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 = xbt_new0(s_mc_snapshot_t, 1);
65 MC_take_snapshot_liveness(new_pair->system_state);
67 /* Get values of propositional symbols */
70 unsigned int cursor = 0;
71 xbt_propositional_symbol_t ps = NULL;
72 xbt_dynar_foreach(_mc_property_automaton->propositional_symbols, cursor, ps){
73 f = (int_f_void_t)ps->function;
75 xbt_dynar_push_as(new_pair->prop_ato, int, res);
80 if(xbt_dynar_is_empty(reached_pairs) || !compare){
83 /* New pair reached */
84 xbt_dynar_push(reached_pairs, &new_pair);
94 mc_pair_reached_t pair_test = NULL;
96 xbt_dynar_foreach(reached_pairs, cursor, pair_test){
97 XBT_INFO("Pair reached #%d", pair_test->nb);
98 if(automaton_state_compare(pair_test->automaton_state, st) == 0){
99 if(propositional_symbols_compare_value(pair_test->prop_ato, new_pair->prop_ato) == 0){
100 if(snapshot_compare(new_pair->system_state, pair_test->system_state) == 0){
110 XBT_INFO("Different values of propositional symbols");
113 XBT_INFO("Different automaton state");
117 /* New pair reached */
118 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 = xbt_new0(s_mc_snapshot_t, 1);
147 MC_take_snapshot_liveness(pair->system_state);
149 /* Get values of propositional symbols */
150 unsigned int cursor = 0;
151 xbt_propositional_symbol_t ps = NULL;
155 xbt_dynar_foreach(_mc_property_automaton->propositional_symbols, cursor, ps){
156 f = (int_f_void_t)ps->function;
158 xbt_dynar_push_as(pair->prop_ato, int, res);
161 xbt_dynar_push(reached_pairs, &pair);
172 void MC_pair_delete(mc_pair_t pair){
173 xbt_free(pair->graph_state->proc_status);
174 xbt_free(pair->graph_state);
180 int MC_automaton_evaluate_label(xbt_exp_label_t l){
184 int left_res = MC_automaton_evaluate_label(l->u.or_and.left_exp);
185 int right_res = MC_automaton_evaluate_label(l->u.or_and.right_exp);
186 return (left_res || right_res);
189 int left_res = MC_automaton_evaluate_label(l->u.or_and.left_exp);
190 int right_res = MC_automaton_evaluate_label(l->u.or_and.right_exp);
191 return (left_res && right_res);
194 int res = MC_automaton_evaluate_label(l->u.exp_not);
198 unsigned int cursor = 0;
199 xbt_propositional_symbol_t p = NULL;
201 xbt_dynar_foreach(_mc_property_automaton->propositional_symbols, cursor, p){
202 if(strcmp(p->pred, l->u.predicat) == 0){
203 f = (int_f_void_t)p->function;
218 /********************* Double-DFS stateless *******************/
220 void MC_pair_stateless_delete(mc_pair_stateless_t pair){
221 xbt_free(pair->graph_state->proc_status);
222 xbt_free(pair->graph_state);
226 mc_pair_stateless_t new_pair_stateless(mc_state_t sg, xbt_state_t st, int r){
227 mc_pair_stateless_t p = NULL;
228 p = xbt_new0(s_mc_pair_stateless_t, 1);
229 p->automaton_state = st;
232 mc_stats_pair->expanded_pairs++;
236 void MC_ddfs_init(void){
238 raw_mem_set = (mmalloc_get_current_heap() == raw_heap);
240 XBT_INFO("**************************************************");
241 XBT_INFO("Double-DFS init");
242 XBT_INFO("**************************************************");
244 mc_pair_stateless_t mc_initial_pair = NULL;
245 mc_state_t initial_graph_state = NULL;
246 smx_process_t process;
249 MC_wait_for_requests();
253 initial_graph_state = MC_state_pair_new();
254 xbt_swag_foreach(process, simix_global->process_list){
255 if(MC_process_is_enabled(process)){
256 MC_state_interleave_process(initial_graph_state, process);
260 reached_pairs = xbt_dynar_new(sizeof(mc_pair_reached_t), NULL);
261 successors = xbt_dynar_new(sizeof(mc_pair_stateless_t), NULL);
263 /* Save the initial state */
264 initial_snapshot_liveness = xbt_new0(s_mc_snapshot_t, 1);
265 MC_take_snapshot_liveness(initial_snapshot_liveness);
269 /* Get .plt section (start and end addresses) for data libsimgrid and data program comparison */
270 get_libsimgrid_plt_section();
271 get_binary_plt_section();
273 unsigned int cursor = 0;
276 xbt_dynar_foreach(_mc_property_automaton->states, cursor, state){
277 if(state->type == -1){
280 mc_initial_pair = new_pair_stateless(initial_graph_state, state, MC_state_interleave_size(initial_graph_state));
281 xbt_fifo_unshift(mc_stack_liveness, mc_initial_pair);
285 MC_restore_snapshot(initial_snapshot_liveness);
292 if(state->type == 2){
295 mc_initial_pair = new_pair_stateless(initial_graph_state, state, MC_state_interleave_size(initial_graph_state));
296 xbt_fifo_unshift(mc_stack_liveness, mc_initial_pair);
299 set_pair_reached(state);
302 MC_restore_snapshot(initial_snapshot_liveness);
321 void MC_ddfs(int search_cycle){
323 raw_mem_set = (mmalloc_get_current_heap() == raw_heap);
325 smx_process_t process;
326 mc_pair_stateless_t current_pair = NULL;
328 if(xbt_fifo_size(mc_stack_liveness) == 0)
332 /* Get current pair */
333 current_pair = (mc_pair_stateless_t)xbt_fifo_get_item_content(xbt_fifo_get_first_item(mc_stack_liveness));
335 /* Update current state in buchi automaton */
336 _mc_property_automaton->current_state = current_pair->automaton_state;
339 XBT_INFO("********************* ( Depth = %d, search_cycle = %d )", xbt_fifo_size(mc_stack_liveness), search_cycle);
341 mc_stats_pair->visited_pairs++;
346 mc_state_t next_graph_state = NULL;
347 smx_simcall_t req = NULL;
350 xbt_transition_t transition_succ;
351 unsigned int cursor = 0;
354 mc_pair_stateless_t next_pair = NULL;
355 mc_pair_stateless_t pair_succ;
357 if(xbt_fifo_size(mc_stack_liveness) < MAX_DEPTH_LIVENESS){
359 if(current_pair->requests > 0){
361 while((req = MC_state_get_request(current_pair->graph_state, &value)) != NULL){
363 /* Debug information */
365 req_str = MC_request_to_string(req, value);
366 XBT_INFO("Execute: %s", req_str);
369 MC_state_set_executed_request(current_pair->graph_state, req, value);
371 /* Answer the request */
372 SIMIX_simcall_pre(req, value);
374 /* Wait for requests (schedules processes) */
375 MC_wait_for_requests();
379 /* Create the new expanded graph_state */
380 next_graph_state = MC_state_pair_new();
382 /* Get enabled process and insert it in the interleave set of the next graph_state */
383 xbt_swag_foreach(process, simix_global->process_list){
384 if(MC_process_is_enabled(process)){
385 MC_state_interleave_process(next_graph_state, process);
389 xbt_dynar_reset(successors);
395 xbt_dynar_foreach(current_pair->automaton_state->out, cursor, transition_succ){
397 res = MC_automaton_evaluate_label(transition_succ->label);
399 if(res == 1){ // enabled transition in automaton
401 next_pair = new_pair_stateless(next_graph_state, transition_succ->dst, MC_state_interleave_size(next_graph_state));
402 xbt_dynar_push(successors, &next_pair);
410 xbt_dynar_foreach(current_pair->automaton_state->out, cursor, transition_succ){
412 res = MC_automaton_evaluate_label(transition_succ->label);
414 if(res == 2){ // true transition in automaton
416 next_pair = new_pair_stateless(next_graph_state, transition_succ->dst, MC_state_interleave_size(next_graph_state));
417 xbt_dynar_push(successors, &next_pair);
425 xbt_dynar_foreach(successors, cursor, pair_succ){
427 if(search_cycle == 1){
429 if((pair_succ->automaton_state->type == 1) || (pair_succ->automaton_state->type == 2)){
431 if(reached(pair_succ->automaton_state)){
433 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));
435 XBT_INFO("*-*-*-*-*-*-*-*-*-*-*-*-*-*-*-*-*-*-*-*-*-*");
436 XBT_INFO("| ACCEPTANCE CYCLE |");
437 XBT_INFO("*-*-*-*-*-*-*-*-*-*-*-*-*-*-*-*-*-*-*-*-*-*");
438 XBT_INFO("Counter-example that violates formula :");
439 MC_show_stack_liveness(mc_stack_liveness);
440 MC_dump_stack_liveness(mc_stack_liveness);
441 MC_print_statistics_pairs(mc_stats_pair);
446 XBT_INFO("Next pair (depth =%d) -> Acceptance pair : graph=%p, automaton=%p(%s)", xbt_fifo_size(mc_stack_liveness) + 1, pair_succ->graph_state, pair_succ->automaton_state, pair_succ->automaton_state->id);
448 XBT_INFO("Reached pairs : %lu", xbt_dynar_length(reached_pairs));
451 xbt_fifo_unshift(mc_stack_liveness, pair_succ);
454 MC_ddfs(search_cycle);
461 xbt_fifo_unshift(mc_stack_liveness, pair_succ);
464 MC_ddfs(search_cycle);
470 if(((pair_succ->automaton_state->type == 1) || (pair_succ->automaton_state->type == 2))){
472 XBT_INFO("Next pair (depth =%d) -> Acceptance pair : graph=%p, automaton=%p(%s)", xbt_fifo_size(mc_stack_liveness) + 1, pair_succ->graph_state, pair_succ->automaton_state, pair_succ->automaton_state->id);
474 set_pair_reached(pair_succ->automaton_state);
478 XBT_INFO("Reached pairs : %lu", xbt_dynar_length(reached_pairs));
483 xbt_fifo_unshift(mc_stack_liveness, pair_succ);
486 MC_ddfs(search_cycle);
491 /* Restore system before checking others successors */
492 if(cursor != (xbt_dynar_length(successors) - 1))
493 MC_replay_liveness(mc_stack_liveness, 1);
498 if(MC_state_interleave_size(current_pair->graph_state) > 0){
499 XBT_INFO("Backtracking to depth %d", xbt_fifo_size(mc_stack_liveness));
500 MC_replay_liveness(mc_stack_liveness, 0);
505 }else{ /*No request to execute, search evolution in Büchi automaton */
509 /* Create the new expanded graph_state */
510 next_graph_state = MC_state_pair_new();
512 xbt_dynar_reset(successors);
518 xbt_dynar_foreach(current_pair->automaton_state->out, cursor, transition_succ){
520 res = MC_automaton_evaluate_label(transition_succ->label);
522 if(res == 1){ // enabled transition in automaton
524 next_pair = new_pair_stateless(next_graph_state, transition_succ->dst, MC_state_interleave_size(next_graph_state));
525 xbt_dynar_push(successors, &next_pair);
533 xbt_dynar_foreach(current_pair->automaton_state->out, cursor, transition_succ){
535 res = MC_automaton_evaluate_label(transition_succ->label);
537 if(res == 2){ // true transition in automaton
539 next_pair = new_pair_stateless(next_graph_state, transition_succ->dst, MC_state_interleave_size(next_graph_state));
540 xbt_dynar_push(successors, &next_pair);
548 xbt_dynar_foreach(successors, cursor, pair_succ){
550 if(search_cycle == 1){
552 if((pair_succ->automaton_state->type == 1) || (pair_succ->automaton_state->type == 2)){
554 if(reached(pair_succ->automaton_state)){
556 XBT_INFO("Next pair (depth = %d) already reached !", xbt_fifo_size(mc_stack_liveness) + 1);
558 XBT_INFO("*-*-*-*-*-*-*-*-*-*-*-*-*-*-*-*-*-*-*-*-*-*");
559 XBT_INFO("| ACCEPTANCE CYCLE |");
560 XBT_INFO("*-*-*-*-*-*-*-*-*-*-*-*-*-*-*-*-*-*-*-*-*-*");
561 XBT_INFO("Counter-example that violates formula :");
562 MC_show_stack_liveness(mc_stack_liveness);
563 MC_dump_stack_liveness(mc_stack_liveness);
564 MC_print_statistics_pairs(mc_stats_pair);
569 XBT_INFO("Next pair (depth = %d) -> Acceptance pair : graph=%p, automaton=%p(%s)", xbt_fifo_size(mc_stack_liveness) + 1, pair_succ->graph_state, pair_succ->automaton_state, pair_succ->automaton_state->id);
571 XBT_INFO("Reached pairs : %lu", xbt_dynar_length(reached_pairs));
574 xbt_fifo_unshift(mc_stack_liveness, pair_succ);
577 MC_ddfs(search_cycle);
584 xbt_fifo_unshift(mc_stack_liveness, pair_succ);
587 MC_ddfs(search_cycle);
594 if(((pair_succ->automaton_state->type == 1) || (pair_succ->automaton_state->type == 2))){
596 set_pair_reached(pair_succ->automaton_state);
600 XBT_INFO("Reached pairs : %lu", xbt_dynar_length(reached_pairs));
605 xbt_fifo_unshift(mc_stack_liveness, pair_succ);
608 MC_ddfs(search_cycle);
612 /* Restore system before checking others successors */
613 if(cursor != xbt_dynar_length(successors) - 1)
614 MC_replay_liveness(mc_stack_liveness, 1);
623 XBT_INFO("Max depth reached");
627 if(xbt_fifo_size(mc_stack_liveness) == MAX_DEPTH_LIVENESS ){
628 XBT_INFO("Pair (graph=%p, automaton =%p, search_cycle = %d, depth = %d) shifted in stack, maximum depth reached", current_pair->graph_state, current_pair->automaton_state, search_cycle, xbt_fifo_size(mc_stack_liveness) );
630 XBT_INFO("Pair (graph=%p, automaton =%p, search_cycle = %d, depth = %d) shifted in stack", current_pair->graph_state, current_pair->automaton_state, search_cycle, xbt_fifo_size(mc_stack_liveness) );
635 xbt_fifo_shift(mc_stack_liveness);
636 if((current_pair->automaton_state->type == 1) || (current_pair->automaton_state->type == 2)){
637 xbt_dynar_pop(reached_pairs, NULL);