1 /* Copyright (c) 2011-2013. The SimGrid Team.
2 * All rights reserved. */
4 /* This program is free software; you can redistribute it and/or modify it
5 * under the terms of the license (GNU LGPL) which comes with this package. */
7 #include "mc_private.h"
11 XBT_LOG_NEW_DEFAULT_SUBCATEGORY(mc_liveness, mc,
12 "Logging specific to algorithms for liveness properties verification");
14 /********* Global variables *********/
16 xbt_dynar_t acceptance_pairs;
17 xbt_dynar_t visited_pairs;
18 xbt_dynar_t successors;
21 /********* Static functions *********/
23 static xbt_dynar_t get_atomic_propositions_values(){
26 unsigned int cursor = 0;
27 xbt_automaton_propositional_symbol_t ps = NULL;
28 xbt_dynar_t values = xbt_dynar_new(sizeof(int), NULL);
30 xbt_dynar_foreach(_mc_property_automaton->propositional_symbols, cursor, ps){
31 f = (int_f_void_t)ps->function;
33 xbt_dynar_push_as(values, int, res);
39 static int get_search_interval(xbt_dynar_t all_pairs, mc_pair_t pair, int *min, int *max){
41 int raw_mem_set = (mmalloc_get_current_heap() == raw_heap);
45 int cursor = 0, previous_cursor, next_cursor;
48 int end = xbt_dynar_length(all_pairs) - 1;
51 cursor = (start + end) / 2;
52 pair_test = (mc_pair_t)xbt_dynar_get_as(all_pairs, cursor, mc_pair_t);
53 if(pair_test->nb_processes < pair->nb_processes){
55 }else if(pair_test->nb_processes > pair->nb_processes){
58 if(pair_test->heap_bytes_used < pair->heap_bytes_used){
60 }else if(pair_test->heap_bytes_used > pair->heap_bytes_used){
64 previous_cursor = cursor - 1;
65 while(previous_cursor >= 0){
66 pair_test = (mc_pair_t)xbt_dynar_get_as(all_pairs, previous_cursor, mc_pair_t);
67 if(pair_test->nb_processes != pair->nb_processes || pair_test->heap_bytes_used != pair->heap_bytes_used)
69 *min = previous_cursor;
72 next_cursor = cursor + 1;
73 while(next_cursor < xbt_dynar_length(all_pairs)){
74 pair_test = (mc_pair_t)xbt_dynar_get_as(all_pairs, next_cursor, mc_pair_t);
75 if(pair_test->nb_processes != pair->nb_processes || pair_test->heap_bytes_used != pair->heap_bytes_used)
93 static int is_reached_acceptance_pair(mc_pair_t pair){
95 int raw_mem_set = (mmalloc_get_current_heap() == raw_heap);
99 if(xbt_dynar_is_empty(acceptance_pairs)){
101 if(pair->graph_state->system_state == NULL){
102 pair->graph_state->system_state = MC_take_snapshot();
103 pair->heap_bytes_used = mmalloc_get_bytes_used(std_heap);
105 xbt_dynar_push(acceptance_pairs, &pair);
114 if(pair->graph_state->system_state == NULL){
115 pair->graph_state->system_state = MC_take_snapshot();
116 pair->heap_bytes_used = mmalloc_get_bytes_used(std_heap);
119 int min = -1, max = -1, index;
124 index = get_search_interval(acceptance_pairs, pair, &min, &max);
126 if(min != -1 && max != -1){ // Acceptance pair with same number of processes and same heap bytes used exists
127 /*res = xbt_parmap_mc_apply(parmap, snapshot_compare, xbt_dynar_get_ptr(acceptance_pairs, min), (max-min)+1, pair);
131 return ((mc_pair_t)xbt_dynar_get_as(acceptance_pairs, (min+res)-1, mc_pair_t))->num;
134 while(cursor <= max){
135 pair_test = (mc_pair_t)xbt_dynar_get_as(acceptance_pairs, cursor, mc_pair_t);
136 if(xbt_automaton_state_compare(pair_test->automaton_state, pair->automaton_state) == 0){
137 if(xbt_automaton_propositional_symbols_compare_value(pair_test->atomic_propositions, pair->atomic_propositions) == 0){
138 if(snapshot_compare(pair_test, pair) == 0){
141 return pair_test->num;
147 xbt_dynar_insert_at(acceptance_pairs, min, &pair);
149 pair_test = (mc_pair_t)xbt_dynar_get_as(acceptance_pairs, index, mc_pair_t);
150 if(pair_test->nb_processes < pair->nb_processes){
151 xbt_dynar_insert_at(acceptance_pairs, index+1, &pair);
153 if(pair_test->heap_bytes_used < pair->heap_bytes_used)
154 xbt_dynar_insert_at(acceptance_pairs, index + 1, &pair);
156 xbt_dynar_insert_at(acceptance_pairs, index, &pair);
170 static void set_acceptance_pair_reached(mc_pair_t pair){
172 int raw_mem_set = (mmalloc_get_current_heap() == raw_heap);
176 if(xbt_dynar_is_empty(acceptance_pairs)){
178 if(pair->graph_state->system_state == NULL){
179 pair->graph_state->system_state = MC_take_snapshot();
180 pair->heap_bytes_used = mmalloc_get_bytes_used(std_heap);
182 xbt_dynar_push(acceptance_pairs, &pair);
186 if(pair->graph_state->system_state == NULL){
187 pair->graph_state->system_state = MC_take_snapshot();
188 pair->heap_bytes_used = mmalloc_get_bytes_used(std_heap);
191 size_t current_bytes_used = pair->heap_bytes_used;
192 int current_nb_processes = pair->nb_processes;
196 int end = xbt_dynar_length(acceptance_pairs) - 1;
198 mc_pair_t pair_test = NULL;
199 size_t bytes_used_test = 0;
200 int nb_processes_test;
203 cursor = (start + end) / 2;
204 pair_test = (mc_pair_t)xbt_dynar_get_as(acceptance_pairs, cursor, mc_pair_t);
205 bytes_used_test = pair_test->heap_bytes_used;
206 nb_processes_test = pair_test->nb_processes;
207 if(nb_processes_test < current_nb_processes)
209 if(nb_processes_test > current_nb_processes)
211 if(nb_processes_test == current_nb_processes){
212 if(bytes_used_test < current_bytes_used)
214 if(bytes_used_test > current_bytes_used)
216 if(bytes_used_test == current_bytes_used)
221 if(pair_test->nb_processes < pair->nb_processes){
222 xbt_dynar_insert_at(acceptance_pairs, cursor+1, &pair);
224 if(pair_test->heap_bytes_used < pair->heap_bytes_used)
225 xbt_dynar_insert_at(acceptance_pairs, cursor + 1, &pair);
227 xbt_dynar_insert_at(acceptance_pairs, cursor, &pair);
237 static void remove_acceptance_pair(mc_pair_t pair){
239 int raw_mem_set = (mmalloc_get_current_heap() == raw_heap);
243 unsigned int cursor = 0;
247 xbt_dynar_foreach(acceptance_pairs, cursor, pair_test){
248 if(pair_test->num == pair->num){
255 xbt_dynar_remove_at(acceptance_pairs, cursor, NULL);
257 pair->acceptance_removed = 1;
259 if(pair->stack_removed && pair->acceptance_removed){
260 if(_sg_mc_visited == 0){
261 MC_pair_delete(pair);
262 }else if(pair->visited_removed){
263 MC_pair_delete(pair);
271 static int is_visited_pair(mc_pair_t pair){
273 if(_sg_mc_visited == 0)
276 int raw_mem_set = (mmalloc_get_current_heap() == raw_heap);
280 if(xbt_dynar_is_empty(visited_pairs)){
282 if(pair->graph_state->system_state == NULL)
283 pair->graph_state->system_state = MC_take_snapshot();
284 xbt_dynar_push(visited_pairs, &pair);
293 if(pair->graph_state->system_state == NULL)
294 pair->graph_state->system_state = MC_take_snapshot();
296 int min = -1, max = -1, index;
301 index = get_search_interval(visited_pairs, pair, &min, &max);
303 if(min != -1 && max != -1){ // Visited pair with same number of processes and same heap bytes used exists
304 /*res = xbt_parmap_mc_apply(parmap, snapshot_compare, xbt_dynar_get_ptr(visited_pairs, min), (max-min)+1, pair);
306 pair_test = (mc_pair_t)xbt_dynar_get_as(visited_pairs, (min+res)-1, mc_pair_t);
307 if(pair_test->other_num == -1)
308 pair->other_num = pair_test->num;
310 pair->other_num = pair_test->other_num;
311 if(dot_output == NULL)
312 XBT_DEBUG("Pair %d already visited ! (equal to pair %d)", pair->num, pair_test->num);
314 XBT_DEBUG("Pair %d already visited ! (equal to pair %d (pair %d in dot_output))", pair->num, pair_test->num, pair->other_num);
315 xbt_dynar_remove_at(visited_pairs, (min + res) - 1, NULL);
316 xbt_dynar_insert_at(visited_pairs, (min+res) - 1, &pair);
317 pair_test->visited_removed = 1;
318 if(pair_test->stack_removed && pair_test->visited_removed){
319 if((pair_test->automaton_state->type == 1) || (pair_test->automaton_state->type == 2)){
320 if(pair_test->acceptance_removed){
321 MC_pair_delete(pair_test);
324 MC_pair_delete(pair_test);
329 return pair->other_num;
332 while(cursor <= max){
333 pair_test = (mc_pair_t)xbt_dynar_get_as(visited_pairs, cursor, mc_pair_t);
334 if(xbt_automaton_state_compare(pair_test->automaton_state, pair->automaton_state) == 0){
335 if(xbt_automaton_propositional_symbols_compare_value(pair_test->atomic_propositions, pair->atomic_propositions) == 0){
336 if(snapshot_compare(pair_test, pair) == 0){
337 if(pair_test->other_num == -1)
338 pair->other_num = pair_test->num;
340 pair->other_num = pair_test->other_num;
341 if(dot_output == NULL)
342 XBT_DEBUG("Pair %d already visited ! (equal to pair %d)", pair->num, pair_test->num);
344 XBT_DEBUG("Pair %d already visited ! (equal to pair %d (pair %d in dot_output))", pair->num, pair_test->num, pair->other_num);
345 xbt_dynar_remove_at(visited_pairs, cursor, NULL);
346 xbt_dynar_insert_at(visited_pairs, cursor, &pair);
347 pair_test->visited_removed = 1;
348 if(pair_test->stack_removed && pair_test->visited_removed){
349 if((pair_test->automaton_state->type == 1) || (pair_test->automaton_state->type == 2)){
350 if(pair_test->acceptance_removed){
351 MC_pair_delete(pair_test);
354 MC_pair_delete(pair_test);
359 return pair->other_num;
365 xbt_dynar_insert_at(visited_pairs, min, &pair);
367 pair_test = (mc_pair_t)xbt_dynar_get_as(visited_pairs, index, mc_pair_t);
368 if(pair_test->nb_processes < pair->nb_processes){
369 xbt_dynar_insert_at(visited_pairs, index+1, &pair);
371 if(pair_test->heap_bytes_used < pair->heap_bytes_used)
372 xbt_dynar_insert_at(visited_pairs, index + 1, &pair);
374 xbt_dynar_insert_at(visited_pairs, index, &pair);
378 if(xbt_dynar_length(visited_pairs) > _sg_mc_visited){
379 int min2 = mc_stats->expanded_pairs;
380 unsigned int cursor2 = 0;
381 unsigned int index2 = 0;
382 xbt_dynar_foreach(visited_pairs, cursor2, pair_test){
383 if(pair_test->num < min2){
385 min2 = pair_test->num;
388 xbt_dynar_remove_at(visited_pairs, index2, &pair_test);
389 pair_test->visited_removed = 1;
390 if(pair_test->stack_removed && pair_test->acceptance_removed && pair_test->visited_removed)
391 MC_pair_delete(pair_test);
403 static int MC_automaton_evaluate_label(xbt_automaton_exp_label_t l, xbt_dynar_t atomic_propositions_values){
407 int left_res = MC_automaton_evaluate_label(l->u.or_and.left_exp, atomic_propositions_values);
408 int right_res = MC_automaton_evaluate_label(l->u.or_and.right_exp, atomic_propositions_values);
409 return (left_res || right_res);
412 int left_res = MC_automaton_evaluate_label(l->u.or_and.left_exp, atomic_propositions_values);
413 int right_res = MC_automaton_evaluate_label(l->u.or_and.right_exp, atomic_propositions_values);
414 return (left_res && right_res);
417 int res = MC_automaton_evaluate_label(l->u.exp_not, atomic_propositions_values);
421 unsigned int cursor = 0;
422 xbt_automaton_propositional_symbol_t p = NULL;
423 xbt_dynar_foreach(_mc_property_automaton->propositional_symbols, cursor, p){
424 if(strcmp(p->pred, l->u.predicat) == 0)
425 return (int)xbt_dynar_get_as(atomic_propositions_values, cursor, int);
438 /********* DDFS Algorithm *********/
441 void MC_ddfs_init(void){
443 initial_state_liveness->raw_mem_set = (mmalloc_get_current_heap() == raw_heap);
445 XBT_DEBUG("**************************************************");
446 XBT_DEBUG("Double-DFS init");
447 XBT_DEBUG("**************************************************");
449 mc_pair_t initial_pair = NULL;
450 smx_process_t process;
452 MC_wait_for_requests();
454 MC_ignore_heap(simix_global->process_to_run->data, 0);
455 MC_ignore_heap(simix_global->process_that_ran->data, 0);
459 acceptance_pairs = xbt_dynar_new(sizeof(mc_pair_t), NULL);
460 visited_pairs = xbt_dynar_new(sizeof(mc_pair_t), NULL);
461 successors = xbt_dynar_new(sizeof(mc_pair_t), NULL);
463 initial_state_liveness->snapshot = MC_take_snapshot();
464 initial_state_liveness->prev_pair = 0;
468 unsigned int cursor = 0;
469 xbt_automaton_state_t automaton_state;
471 xbt_dynar_foreach(_mc_property_automaton->states, cursor, automaton_state){
472 if(automaton_state->type == -1){ /* Initial automaton state */
476 initial_pair = MC_pair_new();
477 initial_pair->automaton_state = automaton_state;
478 initial_pair->graph_state = MC_state_new();
479 initial_pair->atomic_propositions = get_atomic_propositions_values();
481 /* Get enabled process and insert it in the interleave set of the graph_state */
482 xbt_swag_foreach(process, simix_global->process_list){
483 if(MC_process_is_enabled(process)){
484 MC_state_interleave_process(initial_pair->graph_state, process);
488 initial_pair->requests = MC_state_interleave_size(initial_pair->graph_state);
489 initial_pair->search_cycle = 0;
491 xbt_fifo_unshift(mc_stack_liveness, initial_pair);
498 MC_restore_snapshot(initial_state_liveness->snapshot);
503 }else if(automaton_state->type == 2){ /* Acceptance automaton state */
507 initial_pair = MC_pair_new();
508 initial_pair->automaton_state = automaton_state;
509 initial_pair->graph_state = MC_state_new();
510 initial_pair->atomic_propositions = get_atomic_propositions_values();
512 /* Get enabled process and insert it in the interleave set of the graph_state */
513 xbt_swag_foreach(process, simix_global->process_list){
514 if(MC_process_is_enabled(process)){
515 MC_state_interleave_process(initial_pair->graph_state, process);
519 initial_pair->requests = MC_state_interleave_size(initial_pair->graph_state);
520 initial_pair->search_cycle = 1;
522 xbt_fifo_unshift(mc_stack_liveness, initial_pair);
526 set_acceptance_pair_reached(initial_pair);
531 MC_restore_snapshot(initial_state_liveness->snapshot);
537 if(initial_state_liveness->raw_mem_set)
548 smx_process_t process;
549 mc_pair_t current_pair = NULL;
551 if(xbt_fifo_size(mc_stack_liveness) == 0)
554 /* Get current pair */
555 current_pair = (mc_pair_t)xbt_fifo_get_item_content(xbt_fifo_get_first_item(mc_stack_liveness));
557 /* Update current state in buchi automaton */
558 _mc_property_automaton->current_state = current_pair->automaton_state;
560 XBT_DEBUG("********************* ( Depth = %d, search_cycle = %d, interleave size %d)", xbt_fifo_size(mc_stack_liveness), current_pair->search_cycle, MC_state_interleave_size(current_pair->graph_state));
562 mc_stats->visited_pairs++;
565 smx_simcall_t req = NULL;
568 xbt_automaton_transition_t transition_succ;
569 unsigned int cursor = 0;
571 int reached_num, visited_num;
573 mc_pair_t next_pair = NULL;
574 xbt_dynar_t prop_values = NULL;
576 if(xbt_fifo_size(mc_stack_liveness) < _sg_mc_max_depth){
578 if(current_pair->requests > 0){
580 if(current_pair->search_cycle){
582 if((current_pair->automaton_state->type == 1) || (current_pair->automaton_state->type == 2)){
584 if((reached_num = is_reached_acceptance_pair(current_pair)) != -1){
586 XBT_INFO("Pair %d already reached (equal to pair %d) !", current_pair->num, reached_num);
589 xbt_fifo_shift(mc_stack_liveness);
590 if(dot_output != NULL)
591 fprintf(dot_output, "\"%d\" -> \"%d\" [%s];\n", initial_state_liveness->prev_pair, reached_num, initial_state_liveness->prev_req);
594 XBT_INFO("*-*-*-*-*-*-*-*-*-*-*-*-*-*-*-*-*-*-*-*-*-*");
595 XBT_INFO("| ACCEPTANCE CYCLE |");
596 XBT_INFO("*-*-*-*-*-*-*-*-*-*-*-*-*-*-*-*-*-*-*-*-*-*");
597 XBT_INFO("Counter-example that violates formula :");
598 MC_show_stack_liveness(mc_stack_liveness);
599 MC_dump_stack_liveness(mc_stack_liveness);
600 MC_print_statistics(mc_stats);
607 if((visited_num = is_visited_pair(current_pair)) != -1){
610 if(dot_output != NULL)
611 fprintf(dot_output, "\"%d\" -> \"%d\" [%s];\n", initial_state_liveness->prev_pair, visited_num, initial_state_liveness->prev_req);
617 while((req = MC_state_get_request(current_pair->graph_state, &value)) != NULL){
620 if(dot_output != NULL){
621 if(initial_state_liveness->prev_pair != 0 && initial_state_liveness->prev_pair != current_pair->num){
622 fprintf(dot_output, "\"%d\" -> \"%d\" [%s];\n", initial_state_liveness->prev_pair, current_pair->num, initial_state_liveness->prev_req);
623 xbt_free(initial_state_liveness->prev_req);
625 initial_state_liveness->prev_pair = current_pair->num;
629 /* Debug information */
630 if(XBT_LOG_ISENABLED(mc_liveness, xbt_log_priority_debug)){
631 req_str = MC_request_to_string(req, value);
632 XBT_DEBUG("Execute: %s", req_str);
637 if(dot_output != NULL){
638 initial_state_liveness->prev_req = MC_request_get_dot_output(req, value);
639 if(current_pair->search_cycle)
640 fprintf(dot_output, "%d [shape=doublecircle];\n", current_pair->num);
644 MC_state_set_executed_request(current_pair->graph_state, req, value);
645 mc_stats->executed_transitions++;
647 /* Answer the request */
648 SIMIX_simcall_pre(req, value);
650 /* Wait for requests (schedules processes) */
651 MC_wait_for_requests();
654 prop_values = get_atomic_propositions_values();
657 /* Evaluate enabled transition according to atomic propositions values */
659 xbt_dynar_foreach(current_pair->automaton_state->out, cursor, transition_succ){
661 res = MC_automaton_evaluate_label(transition_succ->label, prop_values);
663 if(res == 1){ // enabled transition in automaton
667 next_pair = MC_pair_new();
668 next_pair->graph_state = MC_state_new();
669 next_pair->automaton_state = transition_succ->dst;
670 next_pair->atomic_propositions = get_atomic_propositions_values();
672 /* Get enabled process and insert it in the interleave set of the next graph_state */
673 xbt_swag_foreach(process, simix_global->process_list){
674 if(MC_process_is_enabled(process)){
675 MC_state_interleave_process(next_pair->graph_state, process);
679 next_pair->requests = MC_state_interleave_size(next_pair->graph_state);
681 if(next_pair->automaton_state->type == 1 || next_pair->automaton_state->type == 2 || current_pair->search_cycle)
682 next_pair->search_cycle = 1;
684 xbt_fifo_unshift(mc_stack_liveness, next_pair);
686 if(mc_stats->expanded_pairs%1000000 == 0)
687 XBT_INFO("Expanded pairs : %lu", mc_stats->expanded_pairs);
697 /* Then, evaluate true transitions (always true, whatever atomic propositions values) */
699 xbt_dynar_foreach(current_pair->automaton_state->out, cursor, transition_succ){
701 res = MC_automaton_evaluate_label(transition_succ->label, prop_values);
703 if(res == 2){ // true transition in automaton
707 next_pair = MC_pair_new();
708 next_pair->graph_state = MC_state_new();
709 next_pair->automaton_state = transition_succ->dst;
710 next_pair->atomic_propositions = get_atomic_propositions_values();
712 /* Get enabled process and insert it in the interleave set of the next graph_state */
713 xbt_swag_foreach(process, simix_global->process_list){
714 if(MC_process_is_enabled(process)){
715 MC_state_interleave_process(next_pair->graph_state, process);
719 next_pair->requests = MC_state_interleave_size(next_pair->graph_state);
721 if(next_pair->automaton_state->type == 1 || next_pair->automaton_state->type == 2 || current_pair->search_cycle)
722 next_pair->search_cycle = 1;
724 xbt_fifo_unshift(mc_stack_liveness, next_pair);
726 if(mc_stats->expanded_pairs%1000000 == 0)
727 XBT_INFO("Expanded pairs : %lu", mc_stats->expanded_pairs);
737 if(MC_state_interleave_size(current_pair->graph_state) > 0){
738 XBT_DEBUG("Backtracking to depth %d", xbt_fifo_size(mc_stack_liveness));
739 MC_replay_liveness(mc_stack_liveness, 0);
748 mc_stats->executed_transitions++;
750 XBT_DEBUG("No request to execute in this state, search evolution in Büchi Automaton.");
752 if(current_pair->search_cycle){
754 if((current_pair->automaton_state->type == 1) || (current_pair->automaton_state->type == 2)){
756 if((reached_num = is_reached_acceptance_pair(current_pair)) != -1){
758 XBT_INFO("Pair %d already reached (equal to pair %d) !", current_pair->num, reached_num);
761 xbt_fifo_shift(mc_stack_liveness);
764 XBT_INFO("*-*-*-*-*-*-*-*-*-*-*-*-*-*-*-*-*-*-*-*-*-*");
765 XBT_INFO("| ACCEPTANCE CYCLE |");
766 XBT_INFO("*-*-*-*-*-*-*-*-*-*-*-*-*-*-*-*-*-*-*-*-*-*");
767 XBT_INFO("Counter-example that violates formula :");
768 MC_show_stack_liveness(mc_stack_liveness);
769 MC_dump_stack_liveness(mc_stack_liveness);
770 MC_print_statistics(mc_stats);
777 if((visited_num = is_visited_pair(current_pair)) != -1){
779 XBT_DEBUG("Pair %d already visited ! (equal to pair %d)", current_pair->num, visited_num);
784 prop_values = get_atomic_propositions_values();
787 /* Evaluate enabled transition according to atomic propositions values */
789 xbt_dynar_foreach(current_pair->automaton_state->out, cursor, transition_succ){
791 res = MC_automaton_evaluate_label(transition_succ->label, prop_values);
793 if(res == 1){ // enabled transition in automaton
797 next_pair = MC_pair_new();
798 next_pair->graph_state = MC_state_new();
799 next_pair->automaton_state = transition_succ->dst;
800 next_pair->atomic_propositions = get_atomic_propositions_values();
801 next_pair->requests = MC_state_interleave_size(next_pair->graph_state);
803 if(next_pair->automaton_state->type == 1 || next_pair->automaton_state->type == 2 || current_pair->search_cycle)
804 next_pair->search_cycle = 1;
806 xbt_fifo_unshift(mc_stack_liveness, next_pair);
808 if(mc_stats->expanded_pairs%1000 == 0)
809 XBT_INFO("Expanded pairs : %lu", mc_stats->expanded_pairs);
811 if(dot_output != NULL)
812 fprintf(dot_output, "\"%d\" -> \"%d\" [%s];\n", current_pair->num, next_pair->num, "");
822 /* Then, evaluate true transitions (always true, whatever atomic propositions values) */
824 xbt_dynar_foreach(current_pair->automaton_state->out, cursor, transition_succ){
826 res = MC_automaton_evaluate_label(transition_succ->label, prop_values);
828 if(res == 2){ // true transition in automaton
832 next_pair = MC_pair_new();
833 next_pair->graph_state = MC_state_new();
834 next_pair->automaton_state = transition_succ->dst;
835 next_pair->atomic_propositions = get_atomic_propositions_values();
836 next_pair->requests = MC_state_interleave_size(next_pair->graph_state);
838 if(next_pair->automaton_state->type == 1 || next_pair->automaton_state->type == 2 || current_pair->search_cycle)
839 next_pair->search_cycle = 1;
841 xbt_fifo_unshift(mc_stack_liveness, next_pair);
843 if(mc_stats->expanded_pairs%1000 == 0)
844 XBT_INFO("Expanded pairs : %lu", mc_stats->expanded_pairs);
846 if(dot_output != NULL)
847 fprintf(dot_output, "\"%d\" -> \"%d\" [%s];\n", current_pair->num, next_pair->num, "");
861 XBT_WARN("/!\\ Max depth reached ! /!\\ ");
862 if(MC_state_interleave_size(current_pair->graph_state) > 0){
863 XBT_WARN("/!\\ But, there are still processes to interleave. Model-checker will not be able to ensure the soundness of the verification from now. /!\\ ");
864 if(_sg_mc_max_depth == 1000)
865 XBT_WARN("Notice : the default value of max depth is 1000 but you can change it with cfg=model-check/max_depth:value.");
870 if(xbt_fifo_size(mc_stack_liveness) == _sg_mc_max_depth ){
871 XBT_DEBUG("Pair %d (depth = %d) shifted in stack, maximum depth reached", current_pair->num, xbt_fifo_size(mc_stack_liveness) );
873 XBT_DEBUG("Pair %d (depth = %d) shifted in stack", current_pair->num, xbt_fifo_size(mc_stack_liveness) );
878 xbt_dynar_free(&prop_values);
879 current_pair = xbt_fifo_shift(mc_stack_liveness);
880 current_pair->stack_removed = 1;
881 if(current_pair->search_cycle){
882 remove_acceptance_pair(current_pair);
884 if(_sg_mc_visited == 0)
885 MC_pair_delete(current_pair);
886 else if(current_pair->visited_removed)
887 MC_pair_delete(current_pair);