1 /* Copyright (c) 2008-2012 Da SimGrid Team. All rights reserved. */
3 /* This program is free software; you can redistribute it and/or modify it
4 * under the terms of the license (GNU LGPL) which comes with this package. */
6 #include "mc_private.h"
10 XBT_LOG_NEW_DEFAULT_SUBCATEGORY(mc_liveness, mc,
11 "Logging specific to algorithms for liveness properties verification");
13 xbt_dynar_t reached_pairs;
14 xbt_dynar_t successors;
16 int create_dump(int pair)
18 // Try to enable core dumps
19 struct rlimit core_limit;
20 core_limit.rlim_cur = RLIM_INFINITY;
21 core_limit.rlim_max = RLIM_INFINITY;
23 if(setrlimit(RLIMIT_CORE, &core_limit) < 0)
24 fprintf(stderr, "setrlimit: %s\nWarning: core dumps may be truncated or non-existant\n", strerror(errno));
29 // We are the child process -- run the actual program
34 // An error occurred, shouldn't happen
39 // We are the parent process -- wait for the child process to exit
42 if(WIFSIGNALED(status) && WCOREDUMP(status)){
43 char *core_name = malloc(20);
44 sprintf(core_name,"core_%d", pair);
45 rename("core", core_name);
53 int reached(xbt_state_t st){
55 raw_mem_set = (mmalloc_get_current_heap() == raw_heap);
59 mc_pair_reached_t new_pair = NULL;
60 new_pair = xbt_new0(s_mc_pair_reached_t, 1);
61 new_pair->nb = xbt_dynar_length(reached_pairs) + 1;
62 new_pair->automaton_state = st;
63 new_pair->prop_ato = xbt_dynar_new(sizeof(int), NULL);
64 new_pair->system_state = MC_take_snapshot_liveness();
66 /* Get values of propositional symbols */
69 unsigned int cursor = 0;
70 xbt_propositional_symbol_t ps = NULL;
71 xbt_dynar_foreach(_mc_property_automaton->propositional_symbols, cursor, ps){
72 f = (int_f_void_t)ps->function;
74 xbt_dynar_push_as(new_pair->prop_ato, int, res);
79 if(xbt_dynar_is_empty(reached_pairs) || !compare){
82 /* New pair reached */
83 xbt_dynar_push(reached_pairs, &new_pair);
96 mc_pair_reached_t pair_test = NULL;
98 xbt_dynar_foreach(reached_pairs, cursor, pair_test){
99 XBT_INFO("Pair reached #%d", pair_test->nb);
100 if(automaton_state_compare(pair_test->automaton_state, st) == 0){
101 if(propositional_symbols_compare_value(pair_test->prop_ato, new_pair->prop_ato) == 0){
102 if(snapshot_compare(new_pair->system_state, pair_test->system_state) == 0){
112 XBT_INFO("Different values of propositional symbols");
115 XBT_INFO("Different automaton state");
119 /* New pair reached */
120 xbt_dynar_push(reached_pairs, &new_pair);
135 void set_pair_reached(xbt_state_t st){
137 raw_mem_set = (mmalloc_get_current_heap() == raw_heap);
141 mc_pair_reached_t pair = NULL;
142 pair = xbt_new0(s_mc_pair_reached_t, 1);
143 pair->nb = xbt_dynar_length(reached_pairs) + 1;
144 pair->automaton_state = st;
145 pair->prop_ato = xbt_dynar_new(sizeof(int), NULL);
146 pair->system_state = MC_take_snapshot_liveness();
148 /* Get values of propositional symbols */
149 unsigned int cursor = 0;
150 xbt_propositional_symbol_t ps = NULL;
154 xbt_dynar_foreach(_mc_property_automaton->propositional_symbols, cursor, ps){
155 f = (int_f_void_t)ps->function;
157 xbt_dynar_push_as(pair->prop_ato, int, res);
160 xbt_dynar_push(reached_pairs, &pair);
169 void MC_pair_delete(mc_pair_t pair){
170 xbt_free(pair->graph_state->proc_status);
171 xbt_free(pair->graph_state);
177 int MC_automaton_evaluate_label(xbt_exp_label_t l){
181 int left_res = MC_automaton_evaluate_label(l->u.or_and.left_exp);
182 int right_res = MC_automaton_evaluate_label(l->u.or_and.right_exp);
183 return (left_res || right_res);
186 int left_res = MC_automaton_evaluate_label(l->u.or_and.left_exp);
187 int right_res = MC_automaton_evaluate_label(l->u.or_and.right_exp);
188 return (left_res && right_res);
191 int res = MC_automaton_evaluate_label(l->u.exp_not);
195 unsigned int cursor = 0;
196 xbt_propositional_symbol_t p = NULL;
198 xbt_dynar_foreach(_mc_property_automaton->propositional_symbols, cursor, p){
199 if(strcmp(p->pred, l->u.predicat) == 0){
200 f = (int_f_void_t)p->function;
215 /********************* Double-DFS stateless *******************/
217 void pair_stateless_free(mc_pair_stateless_t pair){
221 void pair_stateless_free_voidp(void *p){
222 pair_stateless_free((mc_pair_stateless_t) * (void **) p);
225 mc_pair_stateless_t new_pair_stateless(mc_state_t sg, xbt_state_t st, int r){
226 mc_pair_stateless_t p = NULL;
227 p = xbt_new0(s_mc_pair_stateless_t, 1);
228 p->automaton_state = st;
231 mc_stats_pair->expanded_pairs++;
235 void pair_reached_free(mc_pair_reached_t pair){
237 pair->automaton_state = NULL;
238 xbt_dynar_free(&(pair->prop_ato));
239 MC_free_snapshot(pair->system_state);
244 void pair_reached_free_voidp(void *p){
245 pair_reached_free((mc_pair_reached_t) * (void **) p);
248 void MC_ddfs_init(void){
250 raw_mem_set = (mmalloc_get_current_heap() == raw_heap);
252 XBT_INFO("**************************************************");
253 XBT_INFO("Double-DFS init");
254 XBT_INFO("**************************************************");
256 mc_pair_stateless_t mc_initial_pair = NULL;
257 mc_state_t initial_graph_state = NULL;
258 smx_process_t process;
261 MC_wait_for_requests();
265 initial_graph_state = MC_state_pair_new();
266 xbt_swag_foreach(process, simix_global->process_list){
267 if(MC_process_is_enabled(process)){
268 MC_state_interleave_process(initial_graph_state, process);
272 reached_pairs = xbt_dynar_new(sizeof(mc_pair_reached_t), pair_reached_free_voidp);
273 successors = xbt_dynar_new(sizeof(mc_pair_stateless_t), NULL);
275 /* Save the initial state */
276 initial_state_liveness = xbt_new0(s_mc_global_t, 1);
277 initial_state_liveness->initial_snapshot = MC_take_snapshot_liveness();
281 unsigned int cursor = 0;
284 xbt_dynar_foreach(_mc_property_automaton->states, cursor, state){
285 if(state->type == -1){
288 mc_initial_pair = new_pair_stateless(initial_graph_state, state, MC_state_interleave_size(initial_graph_state));
289 xbt_fifo_unshift(mc_stack_liveness, mc_initial_pair);
293 MC_restore_snapshot(initial_state_liveness->initial_snapshot);
300 if(state->type == 2){
303 mc_initial_pair = new_pair_stateless(initial_graph_state, state, MC_state_interleave_size(initial_graph_state));
304 xbt_fifo_unshift(mc_stack_liveness, mc_initial_pair);
307 set_pair_reached(state);
310 MC_restore_snapshot(initial_state_liveness->initial_snapshot);
329 void MC_ddfs(int search_cycle){
331 raw_mem_set = (mmalloc_get_current_heap() == raw_heap);
333 smx_process_t process;
334 mc_pair_stateless_t current_pair = NULL;
336 if(xbt_fifo_size(mc_stack_liveness) == 0)
340 /* Get current pair */
341 current_pair = (mc_pair_stateless_t)xbt_fifo_get_item_content(xbt_fifo_get_first_item(mc_stack_liveness));
343 /* Update current state in buchi automaton */
344 _mc_property_automaton->current_state = current_pair->automaton_state;
347 XBT_DEBUG("********************* ( Depth = %d, search_cycle = %d )", xbt_fifo_size(mc_stack_liveness), search_cycle);
349 mc_stats_pair->visited_pairs++;
354 mc_state_t next_graph_state = NULL;
355 smx_simcall_t req = NULL;
358 xbt_transition_t transition_succ;
359 unsigned int cursor = 0;
362 mc_pair_stateless_t next_pair = NULL;
363 mc_pair_stateless_t pair_succ;
365 if(xbt_fifo_size(mc_stack_liveness) < MAX_DEPTH_LIVENESS){
367 if(current_pair->requests > 0){
369 while((req = MC_state_get_request(current_pair->graph_state, &value)) != NULL){
371 /* Debug information */
373 req_str = MC_request_to_string(req, value);
374 XBT_DEBUG("Execute: %s", req_str);
377 MC_state_set_executed_request(current_pair->graph_state, req, value);
379 /* Answer the request */
380 SIMIX_simcall_pre(req, value);
382 /* Wait for requests (schedules processes) */
383 MC_wait_for_requests();
387 /* Create the new expanded graph_state */
388 next_graph_state = MC_state_pair_new();
390 /* Get enabled process and insert it in the interleave set of the next graph_state */
391 xbt_swag_foreach(process, simix_global->process_list){
392 if(MC_process_is_enabled(process)){
393 MC_state_interleave_process(next_graph_state, process);
397 xbt_dynar_reset(successors);
403 xbt_dynar_foreach(current_pair->automaton_state->out, cursor, transition_succ){
405 res = MC_automaton_evaluate_label(transition_succ->label);
407 if(res == 1){ // enabled transition in automaton
409 next_pair = new_pair_stateless(next_graph_state, transition_succ->dst, MC_state_interleave_size(next_graph_state));
410 xbt_dynar_push(successors, &next_pair);
418 xbt_dynar_foreach(current_pair->automaton_state->out, cursor, transition_succ){
420 res = MC_automaton_evaluate_label(transition_succ->label);
422 if(res == 2){ // true transition in automaton
424 next_pair = new_pair_stateless(next_graph_state, transition_succ->dst, MC_state_interleave_size(next_graph_state));
425 xbt_dynar_push(successors, &next_pair);
433 xbt_dynar_foreach(successors, cursor, pair_succ){
435 if(search_cycle == 1){
437 if((pair_succ->automaton_state->type == 1) || (pair_succ->automaton_state->type == 2)){
439 if(reached(pair_succ->automaton_state)){
441 XBT_INFO("Next pair (depth = %d, %u interleave) already reached !", xbt_fifo_size(mc_stack_liveness) + 1, MC_state_interleave_size(pair_succ->graph_state));
443 XBT_INFO("*-*-*-*-*-*-*-*-*-*-*-*-*-*-*-*-*-*-*-*-*-*");
444 XBT_INFO("| ACCEPTANCE CYCLE |");
445 XBT_INFO("*-*-*-*-*-*-*-*-*-*-*-*-*-*-*-*-*-*-*-*-*-*");
446 XBT_INFO("Counter-example that violates formula :");
447 MC_show_stack_liveness(mc_stack_liveness);
448 MC_dump_stack_liveness(mc_stack_liveness);
449 MC_print_statistics_pairs(mc_stats_pair);
454 XBT_DEBUG("Next pair (depth =%d) -> Acceptance pair (%s)", xbt_fifo_size(mc_stack_liveness) + 1, pair_succ->automaton_state->id);
456 XBT_DEBUG("Reached pairs : %lu", xbt_dynar_length(reached_pairs));
459 xbt_fifo_unshift(mc_stack_liveness, pair_succ);
462 MC_ddfs(search_cycle);
469 xbt_fifo_unshift(mc_stack_liveness, pair_succ);
472 MC_ddfs(search_cycle);
478 if(((pair_succ->automaton_state->type == 1) || (pair_succ->automaton_state->type == 2))){
480 XBT_DEBUG("Next pair (depth =%d) -> Acceptance pair (%s)", xbt_fifo_size(mc_stack_liveness) + 1, pair_succ->automaton_state->id);
482 set_pair_reached(pair_succ->automaton_state);
486 XBT_DEBUG("Reached pairs : %lu", xbt_dynar_length(reached_pairs));
491 xbt_fifo_unshift(mc_stack_liveness, pair_succ);
494 MC_ddfs(search_cycle);
499 /* Restore system before checking others successors */
500 if(cursor != (xbt_dynar_length(successors) - 1))
501 MC_replay_liveness(mc_stack_liveness, 1);
506 if(MC_state_interleave_size(current_pair->graph_state) > 0){
507 XBT_DEBUG("Backtracking to depth %d", xbt_fifo_size(mc_stack_liveness));
508 MC_replay_liveness(mc_stack_liveness, 0);
517 XBT_DEBUG("Max depth reached");
521 if(xbt_fifo_size(mc_stack_liveness) == MAX_DEPTH_LIVENESS ){
522 XBT_DEBUG("Pair (depth = %d) shifted in stack, maximum depth reached", xbt_fifo_size(mc_stack_liveness) );
524 XBT_DEBUG("Pair (depth = %d) shifted in stack", xbt_fifo_size(mc_stack_liveness) );
529 xbt_fifo_shift(mc_stack_liveness);
530 if((current_pair->automaton_state->type == 1) || (current_pair->automaton_state->type == 2)){
531 xbt_dynar_pop(reached_pairs, NULL);