Matches in value-assignements (V): {{numOfValueMatches}}
Matches in edge-description: {{numOfDescriptionMatches}}
-V- |
{{line.desc}}
|
Zoom Factor (%)
Run scripts/report-generator.py to display CFAs.
Zoom Factor (%)
Run scripts/report-generator.py to display ARG.
1 | int num_of_inputs_at_1057 = 1; int INPUTS_at_1057[1]; int input_at_1057_counter = 0;int num_of_inputs_at_1043 = 1; int INPUTS_at_1043[1]; int input_at_1043_counter = 0;int initialize_reads() { for (int instrumentation_index=0; instrumentation_index<1; instrumentation_index++) INPUTS_at_1057[instrumentation_index] = __VERIFIER_nondet_int(); for (int instrumentation_index=0; instrumentation_index<1; instrumentation_index++) INPUTS_at_1043[instrumentation_index] = __VERIFIER_nondet_int();}extern void __VERIFIER_assume(int);extern void __VERIFIER_error() __attribute__ ((__noreturn__)); |
2 | |
3 | extern int __VERIFIER_nondet_int(); |
4 | /* Generated by CIL v. 1.3.6 */ |
5 | /* print_CIL_Input is true */ |
6 | |
7 | void error(void) |
8 | { |
9 | |
10 | { |
11 | __VERIFIER_assume(!((0 == INPUTS_at_1043[0] && 0 == INPUTS_at_1057[0])));__VERIFIER_assume(!((0 == INPUTS_at_1043[0])));__VERIFIER_error(); |
12 | return; |
13 | } |
14 | } |
15 | int m_pc = 0; |
16 | int t1_pc = 0; |
17 | int t2_pc = 0; |
18 | int t3_pc = 0; |
19 | int t4_pc = 0; |
20 | int t5_pc = 0; |
21 | int t6_pc = 0; |
22 | int t7_pc = 0; |
23 | int t8_pc = 0; |
24 | int t9_pc = 0; |
25 | int t10_pc = 0; |
26 | int t11_pc = 0; |
27 | int t12_pc = 0; |
28 | int t13_pc = 0; |
29 | int m_st ; |
30 | int t1_st ; |
31 | int t2_st ; |
32 | int t3_st ; |
33 | int t4_st ; |
34 | int t5_st ; |
35 | int t6_st ; |
36 | int t7_st ; |
37 | int t8_st ; |
38 | int t9_st ; |
39 | int t10_st ; |
40 | int t11_st ; |
41 | int t12_st ; |
42 | int t13_st ; |
43 | int m_i ; |
44 | int t1_i ; |
45 | int t2_i ; |
46 | int t3_i ; |
47 | int t4_i ; |
48 | int t5_i ; |
49 | int t6_i ; |
50 | int t7_i ; |
51 | int t8_i ; |
52 | int t9_i ; |
53 | int t10_i ; |
54 | int t11_i ; |
55 | int t12_i ; |
56 | int t13_i ; |
57 | int M_E = 2; |
58 | int T1_E = 2; |
59 | int T2_E = 2; |
60 | int T3_E = 2; |
61 | int T4_E = 2; |
62 | int T5_E = 2; |
63 | int T6_E = 2; |
64 | int T7_E = 2; |
65 | int T8_E = 2; |
66 | int T9_E = 2; |
67 | int T10_E = 2; |
68 | int T11_E = 2; |
69 | int T12_E = 2; |
70 | int T13_E = 2; |
71 | int E_1 = 2; |
72 | int E_2 = 2; |
73 | int E_3 = 2; |
74 | int E_4 = 2; |
75 | int E_5 = 2; |
76 | int E_6 = 2; |
77 | int E_7 = 2; |
78 | int E_8 = 2; |
79 | int E_9 = 2; |
80 | int E_10 = 2; |
81 | int E_11 = 2; |
82 | int E_12 = 2; |
83 | int E_13 = 2; |
84 | int is_master_triggered(void) ; |
85 | int is_transmit1_triggered(void) ; |
86 | int is_transmit2_triggered(void) ; |
87 | int is_transmit3_triggered(void) ; |
88 | int is_transmit4_triggered(void) ; |
89 | int is_transmit5_triggered(void) ; |
90 | int is_transmit6_triggered(void) ; |
91 | int is_transmit7_triggered(void) ; |
92 | int is_transmit8_triggered(void) ; |
93 | int is_transmit9_triggered(void) ; |
94 | int is_transmit10_triggered(void) ; |
95 | int is_transmit11_triggered(void) ; |
96 | int is_transmit12_triggered(void) ; |
97 | int is_transmit13_triggered(void) ; |
98 | void immediate_notify(void) ; |
99 | void master(void) |
100 | { |
101 | |
102 | { |
103 | if (m_pc == 0) { |
104 | goto M_ENTRY; |
105 | } else { |
106 | if (m_pc == 1) { |
107 | goto M_WAIT; |
108 | } else { |
109 | |
110 | } |
111 | } |
112 | M_ENTRY: ; |
113 | { |
114 | while (1) { |
115 | while_0_continue: /* CIL Label */ ; |
116 | { |
117 | E_1 = 1; |
118 | immediate_notify(); |
119 | E_1 = 2; |
120 | } |
121 | { |
122 | while (1) { |
123 | while_1_continue: /* CIL Label */ ; |
124 | m_pc = 1; |
125 | m_st = 2; |
126 | |
127 | goto return_label; |
128 | M_WAIT: ; |
129 | } |
130 | while_1_break: /* CIL Label */ ; |
131 | } |
132 | } |
133 | while_0_break: /* CIL Label */ ; |
134 | } |
135 | |
136 | return_label: /* CIL Label */ |
137 | return; |
138 | } |
139 | } |
140 | void transmit1(void) |
141 | { |
142 | |
143 | { |
144 | if (t1_pc == 0) { |
145 | goto T1_ENTRY; |
146 | } else { |
147 | if (t1_pc == 1) { |
148 | goto T1_WAIT; |
149 | } else { |
150 | |
151 | } |
152 | } |
153 | T1_ENTRY: ; |
154 | { |
155 | while (1) { |
156 | while_2_continue: /* CIL Label */ ; |
157 | t1_pc = 1; |
158 | t1_st = 2; |
159 | |
160 | goto return_label; |
161 | T1_WAIT: |
162 | { |
163 | E_2 = 1; |
164 | immediate_notify(); |
165 | E_2 = 2; |
166 | } |
167 | } |
168 | while_2_break: /* CIL Label */ ; |
169 | } |
170 | |
171 | return_label: /* CIL Label */ |
172 | return; |
173 | } |
174 | } |
175 | void transmit2(void) |
176 | { |
177 | |
178 | { |
179 | if (t2_pc == 0) { |
180 | goto T2_ENTRY; |
181 | } else { |
182 | if (t2_pc == 1) { |
183 | goto T2_WAIT; |
184 | } else { |
185 | |
186 | } |
187 | } |
188 | T2_ENTRY: ; |
189 | { |
190 | while (1) { |
191 | while_3_continue: /* CIL Label */ ; |
192 | t2_pc = 1; |
193 | t2_st = 2; |
194 | |
195 | goto return_label; |
196 | T2_WAIT: |
197 | { |
198 | E_3 = 1; |
199 | immediate_notify(); |
200 | E_3 = 2; |
201 | } |
202 | } |
203 | while_3_break: /* CIL Label */ ; |
204 | } |
205 | |
206 | return_label: /* CIL Label */ |
207 | return; |
208 | } |
209 | } |
210 | void transmit3(void) |
211 | { |
212 | |
213 | { |
214 | if (t3_pc == 0) { |
215 | goto T3_ENTRY; |
216 | } else { |
217 | if (t3_pc == 1) { |
218 | goto T3_WAIT; |
219 | } else { |
220 | |
221 | } |
222 | } |
223 | T3_ENTRY: ; |
224 | { |
225 | while (1) { |
226 | while_4_continue: /* CIL Label */ ; |
227 | t3_pc = 1; |
228 | t3_st = 2; |
229 | |
230 | goto return_label; |
231 | T3_WAIT: |
232 | { |
233 | E_4 = 1; |
234 | immediate_notify(); |
235 | E_4 = 2; |
236 | } |
237 | } |
238 | while_4_break: /* CIL Label */ ; |
239 | } |
240 | |
241 | return_label: /* CIL Label */ |
242 | return; |
243 | } |
244 | } |
245 | void transmit4(void) |
246 | { |
247 | |
248 | { |
249 | if (t4_pc == 0) { |
250 | goto T4_ENTRY; |
251 | } else { |
252 | if (t4_pc == 1) { |
253 | goto T4_WAIT; |
254 | } else { |
255 | |
256 | } |
257 | } |
258 | T4_ENTRY: ; |
259 | { |
260 | while (1) { |
261 | while_5_continue: /* CIL Label */ ; |
262 | t4_pc = 1; |
263 | t4_st = 2; |
264 | |
265 | goto return_label; |
266 | T4_WAIT: |
267 | { |
268 | E_5 = 1; |
269 | immediate_notify(); |
270 | E_5 = 2; |
271 | } |
272 | } |
273 | while_5_break: /* CIL Label */ ; |
274 | } |
275 | |
276 | return_label: /* CIL Label */ |
277 | return; |
278 | } |
279 | } |
280 | void transmit5(void) |
281 | { |
282 | |
283 | { |
284 | if (t5_pc == 0) { |
285 | goto T5_ENTRY; |
286 | } else { |
287 | if (t5_pc == 1) { |
288 | goto T5_WAIT; |
289 | } else { |
290 | |
291 | } |
292 | } |
293 | T5_ENTRY: ; |
294 | { |
295 | while (1) { |
296 | while_6_continue: /* CIL Label */ ; |
297 | t5_pc = 1; |
298 | t5_st = 2; |
299 | |
300 | goto return_label; |
301 | T5_WAIT: |
302 | { |
303 | E_6 = 1; |
304 | immediate_notify(); |
305 | E_6 = 2; |
306 | } |
307 | } |
308 | while_6_break: /* CIL Label */ ; |
309 | } |
310 | |
311 | return_label: /* CIL Label */ |
312 | return; |
313 | } |
314 | } |
315 | void transmit6(void) |
316 | { |
317 | |
318 | { |
319 | if (t6_pc == 0) { |
320 | goto T6_ENTRY; |
321 | } else { |
322 | if (t6_pc == 1) { |
323 | goto T6_WAIT; |
324 | } else { |
325 | |
326 | } |
327 | } |
328 | T6_ENTRY: ; |
329 | { |
330 | while (1) { |
331 | while_7_continue: /* CIL Label */ ; |
332 | t6_pc = 1; |
333 | t6_st = 2; |
334 | |
335 | goto return_label; |
336 | T6_WAIT: |
337 | { |
338 | E_7 = 1; |
339 | immediate_notify(); |
340 | E_7 = 2; |
341 | } |
342 | } |
343 | while_7_break: /* CIL Label */ ; |
344 | } |
345 | |
346 | return_label: /* CIL Label */ |
347 | return; |
348 | } |
349 | } |
350 | void transmit7(void) |
351 | { |
352 | |
353 | { |
354 | if (t7_pc == 0) { |
355 | goto T7_ENTRY; |
356 | } else { |
357 | if (t7_pc == 1) { |
358 | goto T7_WAIT; |
359 | } else { |
360 | |
361 | } |
362 | } |
363 | T7_ENTRY: ; |
364 | { |
365 | while (1) { |
366 | while_8_continue: /* CIL Label */ ; |
367 | t7_pc = 1; |
368 | t7_st = 2; |
369 | |
370 | goto return_label; |
371 | T7_WAIT: |
372 | { |
373 | E_8 = 1; |
374 | immediate_notify(); |
375 | E_8 = 2; |
376 | } |
377 | } |
378 | while_8_break: /* CIL Label */ ; |
379 | } |
380 | |
381 | return_label: /* CIL Label */ |
382 | return; |
383 | } |
384 | } |
385 | void transmit8(void) |
386 | { |
387 | |
388 | { |
389 | if (t8_pc == 0) { |
390 | goto T8_ENTRY; |
391 | } else { |
392 | if (t8_pc == 1) { |
393 | goto T8_WAIT; |
394 | } else { |
395 | |
396 | } |
397 | } |
398 | T8_ENTRY: ; |
399 | { |
400 | while (1) { |
401 | while_9_continue: /* CIL Label */ ; |
402 | t8_pc = 1; |
403 | t8_st = 2; |
404 | |
405 | goto return_label; |
406 | T8_WAIT: |
407 | { |
408 | E_9 = 1; |
409 | immediate_notify(); |
410 | E_9 = 2; |
411 | } |
412 | } |
413 | while_9_break: /* CIL Label */ ; |
414 | } |
415 | |
416 | return_label: /* CIL Label */ |
417 | return; |
418 | } |
419 | } |
420 | void transmit9(void) |
421 | { |
422 | |
423 | { |
424 | if (t9_pc == 0) { |
425 | goto T9_ENTRY; |
426 | } else { |
427 | if (t9_pc == 1) { |
428 | goto T9_WAIT; |
429 | } else { |
430 | |
431 | } |
432 | } |
433 | T9_ENTRY: ; |
434 | { |
435 | while (1) { |
436 | while_10_continue: /* CIL Label */ ; |
437 | t9_pc = 1; |
438 | t9_st = 2; |
439 | |
440 | goto return_label; |
441 | T9_WAIT: |
442 | { |
443 | E_10 = 1; |
444 | immediate_notify(); |
445 | E_10 = 2; |
446 | } |
447 | } |
448 | while_10_break: /* CIL Label */ ; |
449 | } |
450 | |
451 | return_label: /* CIL Label */ |
452 | return; |
453 | } |
454 | } |
455 | void transmit10(void) |
456 | { |
457 | |
458 | { |
459 | if (t10_pc == 0) { |
460 | goto T10_ENTRY; |
461 | } else { |
462 | if (t10_pc == 1) { |
463 | goto T10_WAIT; |
464 | } else { |
465 | |
466 | } |
467 | } |
468 | T10_ENTRY: ; |
469 | { |
470 | while (1) { |
471 | while_11_continue: /* CIL Label */ ; |
472 | t10_pc = 1; |
473 | t10_st = 2; |
474 | |
475 | goto return_label; |
476 | T10_WAIT: |
477 | { |
478 | E_11 = 1; |
479 | immediate_notify(); |
480 | E_11 = 2; |
481 | } |
482 | } |
483 | while_11_break: /* CIL Label */ ; |
484 | } |
485 | |
486 | return_label: /* CIL Label */ |
487 | return; |
488 | } |
489 | } |
490 | void transmit11(void) |
491 | { |
492 | |
493 | { |
494 | if (t11_pc == 0) { |
495 | goto T11_ENTRY; |
496 | } else { |
497 | if (t11_pc == 1) { |
498 | goto T11_WAIT; |
499 | } else { |
500 | |
501 | } |
502 | } |
503 | T11_ENTRY: ; |
504 | { |
505 | while (1) { |
506 | while_12_continue: /* CIL Label */ ; |
507 | t11_pc = 1; |
508 | t11_st = 2; |
509 | |
510 | goto return_label; |
511 | T11_WAIT: |
512 | { |
513 | E_12 = 1; |
514 | immediate_notify(); |
515 | E_12 = 2; |
516 | } |
517 | } |
518 | while_12_break: /* CIL Label */ ; |
519 | } |
520 | |
521 | return_label: /* CIL Label */ |
522 | return; |
523 | } |
524 | } |
525 | void transmit12(void) |
526 | { |
527 | |
528 | { |
529 | if (t12_pc == 0) { |
530 | goto T12_ENTRY; |
531 | } else { |
532 | if (t12_pc == 1) { |
533 | goto T12_WAIT; |
534 | } else { |
535 | |
536 | } |
537 | } |
538 | T12_ENTRY: ; |
539 | { |
540 | while (1) { |
541 | while_13_continue: /* CIL Label */ ; |
542 | t12_pc = 1; |
543 | t12_st = 2; |
544 | |
545 | goto return_label; |
546 | T12_WAIT: |
547 | { |
548 | E_13 = 1; |
549 | immediate_notify(); |
550 | E_13 = 2; |
551 | } |
552 | } |
553 | while_13_break: /* CIL Label */ ; |
554 | } |
555 | |
556 | return_label: /* CIL Label */ |
557 | return; |
558 | } |
559 | } |
560 | void transmit13(void) |
561 | { |
562 | |
563 | { |
564 | if (t13_pc == 0) { |
565 | goto T13_ENTRY; |
566 | } else { |
567 | if (t13_pc == 1) { |
568 | goto T13_WAIT; |
569 | } else { |
570 | |
571 | } |
572 | } |
573 | T13_ENTRY: ; |
574 | { |
575 | while (1) { |
576 | while_14_continue: /* CIL Label */ ; |
577 | t13_pc = 1; |
578 | t13_st = 2; |
579 | |
580 | goto return_label; |
581 | T13_WAIT: |
582 | { |
583 | //error(); |
584 | } |
585 | } |
586 | while_14_break: /* CIL Label */ ; |
587 | } |
588 | |
589 | return_label: /* CIL Label */ |
590 | return; |
591 | } |
592 | } |
593 | int is_master_triggered(void) |
594 | { int __retres1 ; |
595 | |
596 | { |
597 | if (m_pc == 1) { |
598 | if (M_E == 1) { |
599 | __retres1 = 1; |
600 | goto return_label; |
601 | } else { |
602 | |
603 | } |
604 | } else { |
605 | |
606 | } |
607 | __retres1 = 0; |
608 | return_label: /* CIL Label */ |
609 | return (__retres1); |
610 | } |
611 | } |
612 | int is_transmit1_triggered(void) |
613 | { int __retres1 ; |
614 | |
615 | { |
616 | if (t1_pc == 1) { |
617 | if (E_1 == 1) { |
618 | __retres1 = 1; |
619 | goto return_label; |
620 | } else { |
621 | |
622 | } |
623 | } else { |
624 | |
625 | } |
626 | __retres1 = 0; |
627 | return_label: /* CIL Label */ |
628 | return (__retres1); |
629 | } |
630 | } |
631 | int is_transmit2_triggered(void) |
632 | { int __retres1 ; |
633 | |
634 | { |
635 | if (t2_pc == 1) { |
636 | if (E_2 == 1) { |
637 | __retres1 = 1; |
638 | goto return_label; |
639 | } else { |
640 | |
641 | } |
642 | } else { |
643 | |
644 | } |
645 | __retres1 = 0; |
646 | return_label: /* CIL Label */ |
647 | return (__retres1); |
648 | } |
649 | } |
650 | int is_transmit3_triggered(void) |
651 | { int __retres1 ; |
652 | |
653 | { |
654 | if (t3_pc == 1) { |
655 | if (E_3 == 1) { |
656 | __retres1 = 1; |
657 | goto return_label; |
658 | } else { |
659 | |
660 | } |
661 | } else { |
662 | |
663 | } |
664 | __retres1 = 0; |
665 | return_label: /* CIL Label */ |
666 | return (__retres1); |
667 | } |
668 | } |
669 | int is_transmit4_triggered(void) |
670 | { int __retres1 ; |
671 | |
672 | { |
673 | if (t4_pc == 1) { |
674 | if (E_4 == 1) { |
675 | __retres1 = 1; |
676 | goto return_label; |
677 | } else { |
678 | |
679 | } |
680 | } else { |
681 | |
682 | } |
683 | __retres1 = 0; |
684 | return_label: /* CIL Label */ |
685 | return (__retres1); |
686 | } |
687 | } |
688 | int is_transmit5_triggered(void) |
689 | { int __retres1 ; |
690 | |
691 | { |
692 | if (t5_pc == 1) { |
693 | if (E_5 == 1) { |
694 | __retres1 = 1; |
695 | goto return_label; |
696 | } else { |
697 | |
698 | } |
699 | } else { |
700 | |
701 | } |
702 | __retres1 = 0; |
703 | return_label: /* CIL Label */ |
704 | return (__retres1); |
705 | } |
706 | } |
707 | int is_transmit6_triggered(void) |
708 | { int __retres1 ; |
709 | |
710 | { |
711 | if (t6_pc == 1) { |
712 | if (E_6 == 1) { |
713 | __retres1 = 1; |
714 | goto return_label; |
715 | } else { |
716 | |
717 | } |
718 | } else { |
719 | |
720 | } |
721 | __retres1 = 0; |
722 | return_label: /* CIL Label */ |
723 | return (__retres1); |
724 | } |
725 | } |
726 | int is_transmit7_triggered(void) |
727 | { int __retres1 ; |
728 | |
729 | { |
730 | if (t7_pc == 1) { |
731 | if (E_7 == 1) { |
732 | __retres1 = 1; |
733 | goto return_label; |
734 | } else { |
735 | |
736 | } |
737 | } else { |
738 | |
739 | } |
740 | __retres1 = 0; |
741 | return_label: /* CIL Label */ |
742 | return (__retres1); |
743 | } |
744 | } |
745 | int is_transmit8_triggered(void) |
746 | { int __retres1 ; |
747 | |
748 | { |
749 | if (t8_pc == 1) { |
750 | if (E_8 == 1) { |
751 | __retres1 = 1; |
752 | goto return_label; |
753 | } else { |
754 | |
755 | } |
756 | } else { |
757 | |
758 | } |
759 | __retres1 = 0; |
760 | return_label: /* CIL Label */ |
761 | return (__retres1); |
762 | } |
763 | } |
764 | int is_transmit9_triggered(void) |
765 | { int __retres1 ; |
766 | |
767 | { |
768 | if (t9_pc == 1) { |
769 | if (E_9 == 1) { |
770 | __retres1 = 1; |
771 | goto return_label; |
772 | } else { |
773 | |
774 | } |
775 | } else { |
776 | |
777 | } |
778 | __retres1 = 0; |
779 | return_label: /* CIL Label */ |
780 | return (__retres1); |
781 | } |
782 | } |
783 | int is_transmit10_triggered(void) |
784 | { int __retres1 ; |
785 | |
786 | { |
787 | if (t10_pc == 1) { |
788 | if (E_10 == 1) { |
789 | __retres1 = 1; |
790 | goto return_label; |
791 | } else { |
792 | |
793 | } |
794 | } else { |
795 | |
796 | } |
797 | __retres1 = 0; |
798 | return_label: /* CIL Label */ |
799 | return (__retres1); |
800 | } |
801 | } |
802 | int is_transmit11_triggered(void) |
803 | { int __retres1 ; |
804 | |
805 | { |
806 | if (t11_pc == 1) { |
807 | if (E_11 == 1) { |
808 | __retres1 = 1; |
809 | goto return_label; |
810 | } else { |
811 | |
812 | } |
813 | } else { |
814 | |
815 | } |
816 | __retres1 = 0; |
817 | return_label: /* CIL Label */ |
818 | return (__retres1); |
819 | } |
820 | } |
821 | int is_transmit12_triggered(void) |
822 | { int __retres1 ; |
823 | |
824 | { |
825 | if (t12_pc == 1) { |
826 | if (E_12 == 1) { |
827 | __retres1 = 1; |
828 | goto return_label; |
829 | } else { |
830 | |
831 | } |
832 | } else { |
833 | |
834 | } |
835 | __retres1 = 0; |
836 | return_label: /* CIL Label */ |
837 | return (__retres1); |
838 | } |
839 | } |
840 | int is_transmit13_triggered(void) |
841 | { int __retres1 ; |
842 | |
843 | { |
844 | if (t13_pc == 1) { |
845 | if (E_13 == 1) { |
846 | __retres1 = 1; |
847 | goto return_label; |
848 | } else { |
849 | |
850 | } |
851 | } else { |
852 | |
853 | } |
854 | __retres1 = 0; |
855 | return_label: /* CIL Label */ |
856 | return (__retres1); |
857 | } |
858 | } |
859 | void update_channels(void) |
860 | { |
861 | |
862 | { |
863 | |
864 | return; |
865 | } |
866 | } |
867 | void init_threads(void) |
868 | { |
869 | |
870 | { |
871 | if (m_i == 1) { |
872 | m_st = 0; |
873 | } else { |
874 | m_st = 2; |
875 | } |
876 | if (t1_i == 1) { |
877 | t1_st = 0; |
878 | } else { |
879 | t1_st = 2; |
880 | } |
881 | if (t2_i == 1) { |
882 | t2_st = 0; |
883 | } else { |
884 | t2_st = 2; |
885 | } |
886 | if (t3_i == 1) { |
887 | t3_st = 0; |
888 | } else { |
889 | t3_st = 2; |
890 | } |
891 | if (t4_i == 1) { |
892 | t4_st = 0; |
893 | } else { |
894 | t4_st = 2; |
895 | } |
896 | if (t5_i == 1) { |
897 | t5_st = 0; |
898 | } else { |
899 | t5_st = 2; |
900 | } |
901 | if (t6_i == 1) { |
902 | t6_st = 0; |
903 | } else { |
904 | t6_st = 2; |
905 | } |
906 | if (t7_i == 1) { |
907 | t7_st = 0; |
908 | } else { |
909 | t7_st = 2; |
910 | } |
911 | if (t8_i == 1) { |
912 | t8_st = 0; |
913 | } else { |
914 | t8_st = 2; |
915 | } |
916 | if (t9_i == 1) { |
917 | t9_st = 0; |
918 | } else { |
919 | t9_st = 2; |
920 | } |
921 | if (t10_i == 1) { |
922 | t10_st = 0; |
923 | } else { |
924 | t10_st = 2; |
925 | } |
926 | if (t11_i == 1) { |
927 | t11_st = 0; |
928 | } else { |
929 | t11_st = 2; |
930 | } |
931 | if (t12_i == 1) { |
932 | t12_st = 0; |
933 | } else { |
934 | t12_st = 2; |
935 | } |
936 | if (t13_i == 1) { |
937 | t13_st = 0; |
938 | } else { |
939 | t13_st = 2; |
940 | } |
941 | |
942 | return; |
943 | } |
944 | } |
945 | int exists_runnable_thread(void) |
946 | { int __retres1 ; |
947 | |
948 | { |
949 | if (m_st == 0) { |
950 | __retres1 = 1; |
951 | goto return_label; |
952 | } else { |
953 | if (t1_st == 0) { |
954 | __retres1 = 1; |
955 | goto return_label; |
956 | } else { |
957 | if (t2_st == 0) { |
958 | __retres1 = 1; |
959 | goto return_label; |
960 | } else { |
961 | if (t3_st == 0) { |
962 | __retres1 = 1; |
963 | goto return_label; |
964 | } else { |
965 | if (t4_st == 0) { |
966 | __retres1 = 1; |
967 | goto return_label; |
968 | } else { |
969 | if (t5_st == 0) { |
970 | __retres1 = 1; |
971 | goto return_label; |
972 | } else { |
973 | if (t6_st == 0) { |
974 | __retres1 = 1; |
975 | goto return_label; |
976 | } else { |
977 | if (t7_st == 0) { |
978 | __retres1 = 1; |
979 | goto return_label; |
980 | } else { |
981 | if (t8_st == 0) { |
982 | __retres1 = 1; |
983 | goto return_label; |
984 | } else { |
985 | if (t9_st == 0) { |
986 | __retres1 = 1; |
987 | goto return_label; |
988 | } else { |
989 | if (t10_st == 0) { |
990 | __retres1 = 1; |
991 | goto return_label; |
992 | } else { |
993 | if (t11_st == 0) { |
994 | __retres1 = 1; |
995 | goto return_label; |
996 | } else { |
997 | if (t12_st == 0) { |
998 | __retres1 = 1; |
999 | goto return_label; |
1000 | } else { |
1001 | if (t13_st == 0) { |
1002 | __retres1 = 1; |
1003 | goto return_label; |
1004 | } else { |
1005 | |
1006 | } |
1007 | } |
1008 | } |
1009 | } |
1010 | } |
1011 | } |
1012 | } |
1013 | } |
1014 | } |
1015 | } |
1016 | } |
1017 | } |
1018 | } |
1019 | } |
1020 | __retres1 = 0; |
1021 | return_label: /* CIL Label */ |
1022 | return (__retres1); |
1023 | } |
1024 | } |
1025 | void eval(void) |
1026 | { |
1027 | int tmp ; |
1028 | |
1029 | { |
1030 | { |
1031 | while (1) { |
1032 | while_15_continue: /* CIL Label */ ; |
1033 | { |
1034 | tmp = exists_runnable_thread(); |
1035 | } |
1036 | if (tmp != 0) { |
1037 | |
1038 | } else { |
1039 | goto while_15_break; |
1040 | } |
1041 | if (m_st == 0) { |
1042 | int tmp_ndt_1; |
1043 | tmp_ndt_1 = (input_at_1043_counter < num_of_inputs_at_1043) ? INPUTS_at_1043[input_at_1043_counter++] : __VERIFIER_nondet_int() ; |
1044 | if (tmp_ndt_1 != 0) { |
1045 | { |
1046 | m_st = 1; |
1047 | master(); |
1048 | } |
1049 | } else { |
1050 | |
1051 | } |
1052 | } else { |
1053 | |
1054 | } |
1055 | if (t1_st == 0) { |
1056 | int tmp_ndt_2; |
1057 | tmp_ndt_2 = (input_at_1057_counter < num_of_inputs_at_1057) ? INPUTS_at_1057[input_at_1057_counter++] : __VERIFIER_nondet_int() ; |
1058 | if (tmp_ndt_2 != 0) { |
1059 | { |
1060 | t1_st = 1; |
1061 | transmit1(); |
1062 | } |
1063 | } else { |
1064 | error(); |
1065 | } |
1066 | } else { |
1067 | |
1068 | } |
1069 | if (t2_st == 0) { |
1070 | int tmp_ndt_3; |
1071 | tmp_ndt_3 = __VERIFIER_nondet_int(); |
1072 | if (tmp_ndt_3 != 0) { |
1073 | { |
1074 | t2_st = 1; |
1075 | transmit2(); |
1076 | } |
1077 | } else { |
1078 | |
1079 | } |
1080 | } else { |
1081 | |
1082 | } |
1083 | if (t3_st == 0) { |
1084 | int tmp_ndt_4; |
1085 | tmp_ndt_4 = __VERIFIER_nondet_int(); |
1086 | if (tmp_ndt_4 != 0) { |
1087 | { |
1088 | t3_st = 1; |
1089 | transmit3(); |
1090 | } |
1091 | } else { |
1092 | |
1093 | } |
1094 | } else { |
1095 | |
1096 | } |
1097 | if (t4_st == 0) { |
1098 | int tmp_ndt_5; |
1099 | tmp_ndt_5 = __VERIFIER_nondet_int(); |
1100 | if (tmp_ndt_5 != 0) { |
1101 | { |
1102 | t4_st = 1; |
1103 | transmit4(); |
1104 | } |
1105 | } else { |
1106 | |
1107 | } |
1108 | } else { |
1109 | |
1110 | } |
1111 | if (t5_st == 0) { |
1112 | int tmp_ndt_6; |
1113 | tmp_ndt_6 = __VERIFIER_nondet_int(); |
1114 | if (tmp_ndt_6 != 0) { |
1115 | { |
1116 | t5_st = 1; |
1117 | transmit5(); |
1118 | } |
1119 | } else { |
1120 | |
1121 | } |
1122 | } else { |
1123 | |
1124 | } |
1125 | if (t6_st == 0) { |
1126 | int tmp_ndt_7; |
1127 | tmp_ndt_7 = __VERIFIER_nondet_int(); |
1128 | if (tmp_ndt_7 != 0) { |
1129 | { |
1130 | t6_st = 1; |
1131 | transmit6(); |
1132 | } |
1133 | } else { |
1134 | |
1135 | } |
1136 | } else { |
1137 | |
1138 | } |
1139 | if (t7_st == 0) { |
1140 | int tmp_ndt_8; |
1141 | tmp_ndt_8 = __VERIFIER_nondet_int(); |
1142 | if (tmp_ndt_8 != 0) { |
1143 | { |
1144 | t7_st = 1; |
1145 | transmit7(); |
1146 | } |
1147 | } else { |
1148 | |
1149 | } |
1150 | } else { |
1151 | |
1152 | } |
1153 | if (t8_st == 0) { |
1154 | int tmp_ndt_9; |
1155 | tmp_ndt_9 = __VERIFIER_nondet_int(); |
1156 | if (tmp_ndt_9 != 0) { |
1157 | { |
1158 | t8_st = 1; |
1159 | transmit8(); |
1160 | } |
1161 | } else { |
1162 | |
1163 | } |
1164 | } else { |
1165 | |
1166 | } |
1167 | if (t9_st == 0) { |
1168 | int tmp_ndt_10; |
1169 | tmp_ndt_10 = __VERIFIER_nondet_int(); |
1170 | if (tmp_ndt_10 != 0) { |
1171 | { |
1172 | t9_st = 1; |
1173 | transmit9(); |
1174 | } |
1175 | } else { |
1176 | |
1177 | } |
1178 | } else { |
1179 | |
1180 | } |
1181 | if (t10_st == 0) { |
1182 | int tmp_ndt_11; |
1183 | tmp_ndt_11 = __VERIFIER_nondet_int(); |
1184 | if (tmp_ndt_11 != 0) { |
1185 | { |
1186 | t10_st = 1; |
1187 | transmit10(); |
1188 | } |
1189 | } else { |
1190 | |
1191 | } |
1192 | } else { |
1193 | |
1194 | } |
1195 | if (t11_st == 0) { |
1196 | int tmp_ndt_12; |
1197 | tmp_ndt_12 = __VERIFIER_nondet_int(); |
1198 | if (tmp_ndt_12 != 0) { |
1199 | { |
1200 | t11_st = 1; |
1201 | transmit11(); |
1202 | } |
1203 | } else { |
1204 | |
1205 | } |
1206 | } else { |
1207 | |
1208 | } |
1209 | if (t12_st == 0) { |
1210 | int tmp_ndt_13; |
1211 | tmp_ndt_13 = __VERIFIER_nondet_int(); |
1212 | if (tmp_ndt_13 != 0) { |
1213 | { |
1214 | t12_st = 1; |
1215 | transmit12(); |
1216 | } |
1217 | } else { |
1218 | |
1219 | } |
1220 | } else { |
1221 | |
1222 | } |
1223 | if (t13_st == 0) { |
1224 | int tmp_ndt_14; |
1225 | tmp_ndt_14 = __VERIFIER_nondet_int(); |
1226 | if (tmp_ndt_14 != 0) { |
1227 | { |
1228 | t13_st = 1; |
1229 | transmit13(); |
1230 | } |
1231 | } else { |
1232 | |
1233 | } |
1234 | } else { |
1235 | |
1236 | } |
1237 | } |
1238 | while_15_break: /* CIL Label */ ; |
1239 | } |
1240 | |
1241 | return; |
1242 | } |
1243 | } |
1244 | void fire_delta_events(void) |
1245 | { |
1246 | |
1247 | { |
1248 | if (M_E == 0) { |
1249 | M_E = 1; |
1250 | } else { |
1251 | |
1252 | } |
1253 | if (T1_E == 0) { |
1254 | T1_E = 1; |
1255 | } else { |
1256 | |
1257 | } |
1258 | if (T2_E == 0) { |
1259 | T2_E = 1; |
1260 | } else { |
1261 | |
1262 | } |
1263 | if (T3_E == 0) { |
1264 | T3_E = 1; |
1265 | } else { |
1266 | |
1267 | } |
1268 | if (T4_E == 0) { |
1269 | T4_E = 1; |
1270 | } else { |
1271 | |
1272 | } |
1273 | if (T5_E == 0) { |
1274 | T5_E = 1; |
1275 | } else { |
1276 | |
1277 | } |
1278 | if (T6_E == 0) { |
1279 | T6_E = 1; |
1280 | } else { |
1281 | |
1282 | } |
1283 | if (T7_E == 0) { |
1284 | T7_E = 1; |
1285 | } else { |
1286 | |
1287 | } |
1288 | if (T8_E == 0) { |
1289 | T8_E = 1; |
1290 | } else { |
1291 | |
1292 | } |
1293 | if (T9_E == 0) { |
1294 | T9_E = 1; |
1295 | } else { |
1296 | |
1297 | } |
1298 | if (T10_E == 0) { |
1299 | T10_E = 1; |
1300 | } else { |
1301 | |
1302 | } |
1303 | if (T11_E == 0) { |
1304 | T11_E = 1; |
1305 | } else { |
1306 | |
1307 | } |
1308 | if (T12_E == 0) { |
1309 | T12_E = 1; |
1310 | } else { |
1311 | |
1312 | } |
1313 | if (T13_E == 0) { |
1314 | T13_E = 1; |
1315 | } else { |
1316 | |
1317 | } |
1318 | if (E_1 == 0) { |
1319 | E_1 = 1; |
1320 | } else { |
1321 | |
1322 | } |
1323 | if (E_2 == 0) { |
1324 | E_2 = 1; |
1325 | } else { |
1326 | |
1327 | } |
1328 | if (E_3 == 0) { |
1329 | E_3 = 1; |
1330 | } else { |
1331 | |
1332 | } |
1333 | if (E_4 == 0) { |
1334 | E_4 = 1; |
1335 | } else { |
1336 | |
1337 | } |
1338 | if (E_5 == 0) { |
1339 | E_5 = 1; |
1340 | } else { |
1341 | |
1342 | } |
1343 | if (E_6 == 0) { |
1344 | E_6 = 1; |
1345 | } else { |
1346 | |
1347 | } |
1348 | if (E_7 == 0) { |
1349 | E_7 = 1; |
1350 | } else { |
1351 | |
1352 | } |
1353 | if (E_8 == 0) { |
1354 | E_8 = 1; |
1355 | } else { |
1356 | |
1357 | } |
1358 | if (E_9 == 0) { |
1359 | E_9 = 1; |
1360 | } else { |
1361 | |
1362 | } |
1363 | if (E_10 == 0) { |
1364 | E_10 = 1; |
1365 | } else { |
1366 | |
1367 | } |
1368 | if (E_11 == 0) { |
1369 | E_11 = 1; |
1370 | } else { |
1371 | |
1372 | } |
1373 | if (E_12 == 0) { |
1374 | E_12 = 1; |
1375 | } else { |
1376 | |
1377 | } |
1378 | if (E_13 == 0) { |
1379 | E_13 = 1; |
1380 | } else { |
1381 | |
1382 | } |
1383 | |
1384 | return; |
1385 | } |
1386 | } |
1387 | void reset_delta_events(void) |
1388 | { |
1389 | |
1390 | { |
1391 | if (M_E == 1) { |
1392 | M_E = 2; |
1393 | } else { |
1394 | |
1395 | } |
1396 | if (T1_E == 1) { |
1397 | T1_E = 2; |
1398 | } else { |
1399 | |
1400 | } |
1401 | if (T2_E == 1) { |
1402 | T2_E = 2; |
1403 | } else { |
1404 | |
1405 | } |
1406 | if (T3_E == 1) { |
1407 | T3_E = 2; |
1408 | } else { |
1409 | |
1410 | } |
1411 | if (T4_E == 1) { |
1412 | T4_E = 2; |
1413 | } else { |
1414 | |
1415 | } |
1416 | if (T5_E == 1) { |
1417 | T5_E = 2; |
1418 | } else { |
1419 | |
1420 | } |
1421 | if (T6_E == 1) { |
1422 | T6_E = 2; |
1423 | } else { |
1424 | |
1425 | } |
1426 | if (T7_E == 1) { |
1427 | T7_E = 2; |
1428 | } else { |
1429 | |
1430 | } |
1431 | if (T8_E == 1) { |
1432 | T8_E = 2; |
1433 | } else { |
1434 | |
1435 | } |
1436 | if (T9_E == 1) { |
1437 | T9_E = 2; |
1438 | } else { |
1439 | |
1440 | } |
1441 | if (T10_E == 1) { |
1442 | T10_E = 2; |
1443 | } else { |
1444 | |
1445 | } |
1446 | if (T11_E == 1) { |
1447 | T11_E = 2; |
1448 | } else { |
1449 | |
1450 | } |
1451 | if (T12_E == 1) { |
1452 | T12_E = 2; |
1453 | } else { |
1454 | |
1455 | } |
1456 | if (T13_E == 1) { |
1457 | T13_E = 2; |
1458 | } else { |
1459 | |
1460 | } |
1461 | if (E_1 == 1) { |
1462 | E_1 = 2; |
1463 | } else { |
1464 | |
1465 | } |
1466 | if (E_2 == 1) { |
1467 | E_2 = 2; |
1468 | } else { |
1469 | |
1470 | } |
1471 | if (E_3 == 1) { |
1472 | E_3 = 2; |
1473 | } else { |
1474 | |
1475 | } |
1476 | if (E_4 == 1) { |
1477 | E_4 = 2; |
1478 | } else { |
1479 | |
1480 | } |
1481 | if (E_5 == 1) { |
1482 | E_5 = 2; |
1483 | } else { |
1484 | |
1485 | } |
1486 | if (E_6 == 1) { |
1487 | E_6 = 2; |
1488 | } else { |
1489 | |
1490 | } |
1491 | if (E_7 == 1) { |
1492 | E_7 = 2; |
1493 | } else { |
1494 | |
1495 | } |
1496 | if (E_8 == 1) { |
1497 | E_8 = 2; |
1498 | } else { |
1499 | |
1500 | } |
1501 | if (E_9 == 1) { |
1502 | E_9 = 2; |
1503 | } else { |
1504 | |
1505 | } |
1506 | if (E_10 == 1) { |
1507 | E_10 = 2; |
1508 | } else { |
1509 | |
1510 | } |
1511 | if (E_11 == 1) { |
1512 | E_11 = 2; |
1513 | } else { |
1514 | |
1515 | } |
1516 | if (E_12 == 1) { |
1517 | E_12 = 2; |
1518 | } else { |
1519 | |
1520 | } |
1521 | if (E_13 == 1) { |
1522 | E_13 = 2; |
1523 | } else { |
1524 | |
1525 | } |
1526 | |
1527 | return; |
1528 | } |
1529 | } |
1530 | void activate_threads(void) |
1531 | { int tmp ; |
1532 | int tmp___0 ; |
1533 | int tmp___1 ; |
1534 | int tmp___2 ; |
1535 | int tmp___3 ; |
1536 | int tmp___4 ; |
1537 | int tmp___5 ; |
1538 | int tmp___6 ; |
1539 | int tmp___7 ; |
1540 | int tmp___8 ; |
1541 | int tmp___9 ; |
1542 | int tmp___10 ; |
1543 | int tmp___11 ; |
1544 | int tmp___12 ; |
1545 | |
1546 | { |
1547 | { |
1548 | tmp = is_master_triggered(); |
1549 | } |
1550 | if (tmp != 0) { |
1551 | m_st = 0; |
1552 | } else { |
1553 | |
1554 | } |
1555 | { |
1556 | tmp___0 = is_transmit1_triggered(); |
1557 | } |
1558 | if (tmp___0 != 0) { |
1559 | t1_st = 0; |
1560 | } else { |
1561 | |
1562 | } |
1563 | { |
1564 | tmp___1 = is_transmit2_triggered(); |
1565 | } |
1566 | if (tmp___1 != 0) { |
1567 | t2_st = 0; |
1568 | } else { |
1569 | |
1570 | } |
1571 | { |
1572 | tmp___2 = is_transmit3_triggered(); |
1573 | } |
1574 | if (tmp___2 != 0) { |
1575 | t3_st = 0; |
1576 | } else { |
1577 | |
1578 | } |
1579 | { |
1580 | tmp___3 = is_transmit4_triggered(); |
1581 | } |
1582 | if (tmp___3 != 0) { |
1583 | t4_st = 0; |
1584 | } else { |
1585 | |
1586 | } |
1587 | { |
1588 | tmp___4 = is_transmit5_triggered(); |
1589 | } |
1590 | if (tmp___4 != 0) { |
1591 | t5_st = 0; |
1592 | } else { |
1593 | |
1594 | } |
1595 | { |
1596 | tmp___5 = is_transmit6_triggered(); |
1597 | } |
1598 | if (tmp___5 != 0) { |
1599 | t6_st = 0; |
1600 | } else { |
1601 | |
1602 | } |
1603 | { |
1604 | tmp___6 = is_transmit7_triggered(); |
1605 | } |
1606 | if (tmp___6 != 0) { |
1607 | t7_st = 0; |
1608 | } else { |
1609 | |
1610 | } |
1611 | { |
1612 | tmp___7 = is_transmit8_triggered(); |
1613 | } |
1614 | if (tmp___7 != 0) { |
1615 | t8_st = 0; |
1616 | } else { |
1617 | |
1618 | } |
1619 | { |
1620 | tmp___8 = is_transmit9_triggered(); |
1621 | } |
1622 | if (tmp___8 != 0) { |
1623 | t9_st = 0; |
1624 | } else { |
1625 | |
1626 | } |
1627 | { |
1628 | tmp___9 = is_transmit10_triggered(); |
1629 | } |
1630 | if (tmp___9 != 0) { |
1631 | t10_st = 0; |
1632 | } else { |
1633 | |
1634 | } |
1635 | { |
1636 | tmp___10 = is_transmit11_triggered(); |
1637 | } |
1638 | if (tmp___10 != 0) { |
1639 | t11_st = 0; |
1640 | } else { |
1641 | |
1642 | } |
1643 | { |
1644 | tmp___11 = is_transmit12_triggered(); |
1645 | } |
1646 | if (tmp___11 != 0) { |
1647 | t12_st = 0; |
1648 | } else { |
1649 | |
1650 | } |
1651 | { |
1652 | tmp___12 = is_transmit13_triggered(); |
1653 | } |
1654 | if (tmp___12 != 0) { |
1655 | t13_st = 0; |
1656 | } else { |
1657 | |
1658 | } |
1659 | |
1660 | return; |
1661 | } |
1662 | } |
1663 | void immediate_notify(void) |
1664 | { |
1665 | |
1666 | { |
1667 | { |
1668 | activate_threads(); |
1669 | } |
1670 | |
1671 | return; |
1672 | } |
1673 | } |
1674 | void fire_time_events(void) |
1675 | { |
1676 | |
1677 | { |
1678 | M_E = 1; |
1679 | |
1680 | return; |
1681 | } |
1682 | } |
1683 | void reset_time_events(void) |
1684 | { |
1685 | |
1686 | { |
1687 | if (M_E == 1) { |
1688 | M_E = 2; |
1689 | } else { |
1690 | |
1691 | } |
1692 | if (T1_E == 1) { |
1693 | T1_E = 2; |
1694 | } else { |
1695 | |
1696 | } |
1697 | if (T2_E == 1) { |
1698 | T2_E = 2; |
1699 | } else { |
1700 | |
1701 | } |
1702 | if (T3_E == 1) { |
1703 | T3_E = 2; |
1704 | } else { |
1705 | |
1706 | } |
1707 | if (T4_E == 1) { |
1708 | T4_E = 2; |
1709 | } else { |
1710 | |
1711 | } |
1712 | if (T5_E == 1) { |
1713 | T5_E = 2; |
1714 | } else { |
1715 | |
1716 | } |
1717 | if (T6_E == 1) { |
1718 | T6_E = 2; |
1719 | } else { |
1720 | |
1721 | } |
1722 | if (T7_E == 1) { |
1723 | T7_E = 2; |
1724 | } else { |
1725 | |
1726 | } |
1727 | if (T8_E == 1) { |
1728 | T8_E = 2; |
1729 | } else { |
1730 | |
1731 | } |
1732 | if (T9_E == 1) { |
1733 | T9_E = 2; |
1734 | } else { |
1735 | |
1736 | } |
1737 | if (T10_E == 1) { |
1738 | T10_E = 2; |
1739 | } else { |
1740 | |
1741 | } |
1742 | if (T11_E == 1) { |
1743 | T11_E = 2; |
1744 | } else { |
1745 | |
1746 | } |
1747 | if (T12_E == 1) { |
1748 | T12_E = 2; |
1749 | } else { |
1750 | |
1751 | } |
1752 | if (T13_E == 1) { |
1753 | T13_E = 2; |
1754 | } else { |
1755 | |
1756 | } |
1757 | if (E_1 == 1) { |
1758 | E_1 = 2; |
1759 | } else { |
1760 | |
1761 | } |
1762 | if (E_2 == 1) { |
1763 | E_2 = 2; |
1764 | } else { |
1765 | |
1766 | } |
1767 | if (E_3 == 1) { |
1768 | E_3 = 2; |
1769 | } else { |
1770 | |
1771 | } |
1772 | if (E_4 == 1) { |
1773 | E_4 = 2; |
1774 | } else { |
1775 | |
1776 | } |
1777 | if (E_5 == 1) { |
1778 | E_5 = 2; |
1779 | } else { |
1780 | |
1781 | } |
1782 | if (E_6 == 1) { |
1783 | E_6 = 2; |
1784 | } else { |
1785 | |
1786 | } |
1787 | if (E_7 == 1) { |
1788 | E_7 = 2; |
1789 | } else { |
1790 | |
1791 | } |
1792 | if (E_8 == 1) { |
1793 | E_8 = 2; |
1794 | } else { |
1795 | |
1796 | } |
1797 | if (E_9 == 1) { |
1798 | E_9 = 2; |
1799 | } else { |
1800 | |
1801 | } |
1802 | if (E_10 == 1) { |
1803 | E_10 = 2; |
1804 | } else { |
1805 | |
1806 | } |
1807 | if (E_11 == 1) { |
1808 | E_11 = 2; |
1809 | } else { |
1810 | |
1811 | } |
1812 | if (E_12 == 1) { |
1813 | E_12 = 2; |
1814 | } else { |
1815 | |
1816 | } |
1817 | if (E_13 == 1) { |
1818 | E_13 = 2; |
1819 | } else { |
1820 | |
1821 | } |
1822 | |
1823 | return; |
1824 | } |
1825 | } |
1826 | void init_model(void) |
1827 | { |
1828 | |
1829 | { |
1830 | m_i = 1; |
1831 | t1_i = 1; |
1832 | t2_i = 1; |
1833 | t3_i = 1; |
1834 | t4_i = 1; |
1835 | t5_i = 1; |
1836 | t6_i = 1; |
1837 | t7_i = 1; |
1838 | t8_i = 1; |
1839 | t9_i = 1; |
1840 | t10_i = 1; |
1841 | t11_i = 1; |
1842 | t12_i = 1; |
1843 | t13_i = 1; |
1844 | |
1845 | return; |
1846 | } |
1847 | } |
1848 | int stop_simulation(void) |
1849 | { int tmp ; |
1850 | int __retres2 ; |
1851 | |
1852 | { |
1853 | { |
1854 | tmp = exists_runnable_thread(); |
1855 | } |
1856 | if (tmp != 0) { |
1857 | __retres2 = 0; |
1858 | goto return_label; |
1859 | } else { |
1860 | |
1861 | } |
1862 | __retres2 = 1; |
1863 | return_label: /* CIL Label */ |
1864 | return (__retres2); |
1865 | } |
1866 | } |
1867 | void start_simulation(void) |
1868 | { int kernel_st ; |
1869 | int tmp ; |
1870 | int tmp___0 ; |
1871 | |
1872 | { |
1873 | { |
1874 | kernel_st = 0; |
1875 | update_channels(); |
1876 | init_threads(); |
1877 | fire_delta_events(); |
1878 | activate_threads(); |
1879 | reset_delta_events(); |
1880 | } |
1881 | { |
1882 | while (1) { |
1883 | while_16_continue: /* CIL Label */ ; |
1884 | { |
1885 | kernel_st = 1; |
1886 | eval(); |
1887 | } |
1888 | { |
1889 | kernel_st = 2; |
1890 | update_channels(); |
1891 | } |
1892 | { |
1893 | kernel_st = 3; |
1894 | fire_delta_events(); |
1895 | activate_threads(); |
1896 | reset_delta_events(); |
1897 | } |
1898 | { |
1899 | tmp = exists_runnable_thread(); |
1900 | } |
1901 | if (tmp == 0) { |
1902 | { |
1903 | kernel_st = 4; |
1904 | fire_time_events(); |
1905 | activate_threads(); |
1906 | reset_time_events(); |
1907 | } |
1908 | } else { |
1909 | |
1910 | } |
1911 | { |
1912 | tmp___0 = stop_simulation(); |
1913 | } |
1914 | if (tmp___0 != 0) { |
1915 | goto while_16_break; |
1916 | } else { |
1917 | |
1918 | } |
1919 | } |
1920 | while_16_break: /* CIL Label */ ; |
1921 | } |
1922 | |
1923 | return; |
1924 | } |
1925 | } |
1926 | int main(void) |
1927 | {initialize_reads(); int __retres1 ; |
1928 | |
1929 | { |
1930 | { |
1931 | init_model(); |
1932 | start_simulation(); |
1933 | } |
1934 | __retres1 = 0; |
1935 | return (__retres1); |
1936 | } |
1937 | } |
2017-05-11 14:31:46:807 INFO ResourceLimitChecker.fromConfiguration Using the following resource limits: CPU-time limit of 900s
2017-05-11 14:31:46:934 INFO CPAchecker.run CPAchecker 1.6.1-svn (Java HotSpot(TM) 64-Bit Server VM 1.8.0_102) started
2017-05-11 14:31:50:932 INFO CPAchecker.runAlgorithm Starting analysis ...
2017-05-11 14:31:50:969 INFO Parallel analysis 1:ResourceLimitChecker.fromConfiguration Using the following resource limits: CPU-time limit of 900s
2017-05-11 14:31:51:020 INFO Parallel analysis 2:ResourceLimitChecker.fromConfiguration Using the following resource limits: CPU-time limit of 900s
2017-05-11 14:31:51:381 WARNING Parallel analysis 1:PredicateCPA:JavaSMT:Mathsat5SolverContext.<init> MathSAT5 is available for research and evaluation purposes only. It can not be used in a commercial environment, particularly as part of a commercial product, without written permission. MathSAT5 is provided as is, without any warranty. Please write to mathsat@fbk.eu for additional questions regarding licensing MathSAT5 or obtaining more up-to-date versions.
2017-05-11 14:31:52:221 INFO Parallel analysis 1:PredicateCPA:PredicateCPA.<init> Using predicate analysis with MathSAT5 version 5.3.14 (0b98b661254c) (Nov 17 2016 10:59:45, gmp 5.1.3, gcc 4.8.5, 64-bit).
2017-05-11 14:31:52:343 WARNING Parallel analysis 1:AssumptionStorageCPA:JavaSMT:Mathsat5SolverContext.<init> MathSAT5 is available for research and evaluation purposes only. It can not be used in a commercial environment, particularly as part of a commercial product, without written permission. MathSAT5 is provided as is, without any warranty. Please write to mathsat@fbk.eu for additional questions regarding licensing MathSAT5 or obtaining more up-to-date versions.
2017-05-11 14:31:52:536 WARNING Parallel analysis 1:ValueAnalysisCPA:JavaSMT:Mathsat5SolverContext.<init> MathSAT5 is available for research and evaluation purposes only. It can not be used in a commercial environment, particularly as part of a commercial product, without written permission. MathSAT5 is provided as is, without any warranty. Please write to mathsat@fbk.eu for additional questions regarding licensing MathSAT5 or obtaining more up-to-date versions.
2017-05-11 14:31:53:974 WARNING Parallel analysis 1:InductionStepCase:PredicateCPA:JavaSMT:Mathsat5SolverContext.<init> MathSAT5 is available for research and evaluation purposes only. It can not be used in a commercial environment, particularly as part of a commercial product, without written permission. MathSAT5 is provided as is, without any warranty. Please write to mathsat@fbk.eu for additional questions regarding licensing MathSAT5 or obtaining more up-to-date versions.
2017-05-11 14:31:53:980 INFO Parallel analysis 1:InductionStepCase:PredicateCPA:PredicateCPA.<init> Using predicate analysis with MathSAT5 version 5.3.14 (0b98b661254c) (Nov 17 2016 10:59:45, gmp 5.1.3, gcc 4.8.5, 64-bit).
2017-05-11 14:31:54:068 WARNING Parallel analysis 1:InductionStepCase:AssumptionStorageCPA:JavaSMT:Mathsat5SolverContext.<init> MathSAT5 is available for research and evaluation purposes only. It can not be used in a commercial environment, particularly as part of a commercial product, without written permission. MathSAT5 is provided as is, without any warranty. Please write to mathsat@fbk.eu for additional questions regarding licensing MathSAT5 or obtaining more up-to-date versions.
2017-05-11 14:31:54:137 WARNING Parallel analysis 1:InductionStepCase:ValueAnalysisCPA:JavaSMT:Mathsat5SolverContext.<init> MathSAT5 is available for research and evaluation purposes only. It can not be used in a commercial environment, particularly as part of a commercial product, without written permission. MathSAT5 is provided as is, without any warranty. Please write to mathsat@fbk.eu for additional questions regarding licensing MathSAT5 or obtaining more up-to-date versions.
2017-05-11 14:31:56:870 INFO Parallel analysis 1:AbstractBMCAlgorithm.run Creating formula for program
2017-05-11 14:32:00:223 INFO Parallel analysis 1:AbstractBMCAlgorithm.boundedModelCheck Starting satisfiability check...
2017-05-11 14:32:00:259 INFO Parallel analysis 1:AbstractBMCAlgorithm.checkBoundingAssertions Starting assertions check...
2017-05-11 14:32:01:186 INFO Parallel analysis 1:KInductionProver.check Running algorithm to create induction hypothesis
2017-05-11 14:32:26:866 INFO Parallel analysis 2:InvariantsCPA:InvariantsCPA$InterestingVariableLimitAdjuster.adjustConditions Adjusting interestingVariableLimit to 1
2017-05-11 14:32:26:866 INFO Parallel analysis 2:ParallelAlgorithm.runParallelAnalysis Adjusting precision for CPA org.sosy_lab.cpachecker.cpa.invariants.InvariantsCPA@3b6fd382
2017-05-11 14:32:26:867 INFO Parallel analysis 2:ParallelAlgorithm.runParallelAnalysis Updating reached set provided to other analyses
2017-05-11 14:32:37:820 INFO Parallel analysis 2:InvariantsCPA:InvariantsCPA$InterestingVariableLimitAdjuster.adjustConditions Adjusting interestingVariableLimit to 2
2017-05-11 14:32:37:821 INFO Parallel analysis 2:ParallelAlgorithm.runParallelAnalysis Adjusting precision for CPA org.sosy_lab.cpachecker.cpa.invariants.InvariantsCPA@3b6fd382
2017-05-11 14:32:37:821 INFO Parallel analysis 2:ParallelAlgorithm.runParallelAnalysis Updating reached set provided to other analyses
2017-05-11 14:32:47:136 INFO Parallel analysis 2:InvariantsCPA:InvariantsCPA$InterestingVariableLimitAdjuster.adjustConditions Adjusting interestingVariableLimit to 4
2017-05-11 14:32:47:148 INFO Parallel analysis 2:ParallelAlgorithm.runParallelAnalysis Adjusting precision for CPA org.sosy_lab.cpachecker.cpa.invariants.InvariantsCPA@3b6fd382
2017-05-11 14:32:47:148 INFO Parallel analysis 2:ParallelAlgorithm.runParallelAnalysis Updating reached set provided to other analyses
2017-05-11 14:32:55:321 INFO Parallel analysis 2:InvariantsCPA:InvariantsCPA$InterestingVariableLimitAdjuster.adjustConditions Adjusting interestingVariableLimit to 8
2017-05-11 14:32:55:333 INFO Parallel analysis 2:ParallelAlgorithm.runParallelAnalysis Adjusting precision for CPA org.sosy_lab.cpachecker.cpa.invariants.InvariantsCPA@3b6fd382
2017-05-11 14:32:55:333 INFO Parallel analysis 2:ParallelAlgorithm.runParallelAnalysis Updating reached set provided to other analyses
2017-05-11 14:33:03:854 INFO Parallel analysis 2:InvariantsCPA:InvariantsCPA$InterestingVariableLimitAdjuster.adjustConditions Adjusting interestingVariableLimit to 10
2017-05-11 14:33:03:855 INFO Parallel analysis 2:ParallelAlgorithm.runParallelAnalysis Adjusting precision for CPA org.sosy_lab.cpachecker.cpa.invariants.InvariantsCPA@3b6fd382
2017-05-11 14:33:03:855 INFO Parallel analysis 2:ParallelAlgorithm.runParallelAnalysis Updating reached set provided to other analyses
2017-05-11 14:33:11:745 INFO Parallel analysis 1:KInductionProver.check Starting induction check...
2017-05-11 14:33:11:865 INFO Parallel analysis 2:InvariantsCPA:InvariantsCPA$FormulaDepthAdjuster.adjustConditions Adjusting maximum formula depth to 3
2017-05-11 14:33:11:866 INFO Parallel analysis 2:ParallelAlgorithm.runParallelAnalysis Adjusting precision for CPA org.sosy_lab.cpachecker.cpa.invariants.InvariantsCPA@3b6fd382
2017-05-11 14:33:11:866 INFO Parallel analysis 2:ParallelAlgorithm.runParallelAnalysis Updating reached set provided to other analyses
2017-05-11 14:33:20:597 INFO Parallel analysis 2:InvariantsCPA:InvariantsCPA$InterestingVariableLimitAdjuster.adjustConditions Adjusting interestingVariableLimit to 14
2017-05-11 14:33:20:597 INFO Parallel analysis 2:ParallelAlgorithm.runParallelAnalysis Adjusting precision for CPA org.sosy_lab.cpachecker.cpa.invariants.InvariantsCPA@3b6fd382
2017-05-11 14:33:20:597 INFO Parallel analysis 2:ParallelAlgorithm.runParallelAnalysis Updating reached set provided to other analyses
2017-05-11 14:34:20:270 INFO Parallel analysis 2:InvariantsCPA:InvariantsCPA$InterestingVariableLimitAdjuster.adjustConditions Adjusting interestingVariableLimit to 16
2017-05-11 14:34:20:271 INFO Parallel analysis 2:ParallelAlgorithm.runParallelAnalysis Adjusting precision for CPA org.sosy_lab.cpachecker.cpa.invariants.InvariantsCPA@3b6fd382
2017-05-11 14:34:20:271 INFO Parallel analysis 2:ParallelAlgorithm.runParallelAnalysis Updating reached set provided to other analyses
2017-05-11 14:36:56:749 INFO Parallel analysis 1:BoundsCPA:BoundsCPA.adjustPrecision Adjusting maxLoopIterations to 2
2017-05-11 14:36:56:752 INFO Parallel analysis 1:AbstractBMCAlgorithm.run Creating formula for program
2017-05-11 14:36:57:978 INFO Parallel analysis 1:AbstractBMCAlgorithm.boundedModelCheck Starting satisfiability check...
2017-05-11 14:36:58:418 INFO Parallel analysis 1:BMCAlgorithm.analyzeCounterexample Error found, creating error path
2017-05-11 14:36:59:774 INFO Parallel analysis 1:CounterexampleCheckAlgorithm.checkCounterexample Error path found, starting counterexample check with CBMC.
2017-05-11 14:37:00:366 INFO Parallel analysis 1:CounterexampleCheckAlgorithm.checkCounterexample Error path found and confirmed by counterexample check with CBMC.
2017-05-11 14:37:00:366 INFO Parallel analysis 1:CounterexampleCheckAlgorithm.checkCounterexample Error path found, starting counterexample check with CBMC.
2017-05-11 14:37:01:098 INFO Parallel analysis 1:CounterexampleCheckAlgorithm.checkCounterexample Error path found but identified as infeasible.
2017-05-11 14:37:01:103 INFO ParallelAlgorithm.handleFutureResults /lustre/work/anon/anon/cfc/analyzers/cpachecker/config/components/kInduction/svcomp16-kInduction.properties finished successfully.
2017-05-11 14:37:01:109 INFO Parallel analysis 2:ParallelAlgorithm.runParallelAnalysis Analysis was terminated
2017-05-11 14:37:01:109 INFO CPAchecker.runAlgorithm Stopping analysis ...
Parallel Algorithm statistics
-----------------------------
Number of algorithms used: 2
Successful analysis: /lustre/work/anon/anon/cfc/analyzers/cpachecker/config/components/kInduction/svcomp16-kInduction.properties
Statistics for: /lustre/work/anon/anon/cfc/analyzers/cpachecker/config/components/kInduction/svcomp16-kInduction.properties
===================================================================================================================================
PredicateCPA statistics
-----------------------
Number of abstractions: 2 (0% of all post computations)
Times abstraction was reused: 0
Because of function entry/exit: 0 (0%)
Because of loop head: 0 (0%)
Because of join nodes: 0 (0%)
Because of threshold: 0 (0%)
Because of target state: 2 (100%)
Times precision was empty: 2 (100%)
Times precision was {false}: 0 (0%)
Times result was cached: 0 (0%)
Times cartesian abs was used: 0 (0%)
Times boolean abs was used: 0 (0%)
Times result was 'false': 0 (0%)
Number of strengthen sat checks: 0
Number of coverage checks: 616
BDD entailment checks: 0
Number of SMT sat checks: 0
trivial: 0
cached: 0
Max ABE block size: 669
Number of predicates discovered: 0
Time for post operator: 2.823s
Time for path formula creation: 2.803s
Time for strengthen operator: 0.024s
Time for prec operator: 0.006s
Time for abstraction: 0.000s (Max: 0.000s, Count: 2)
Solving time: 0.000s (Max: 0.000s)
Model enumeration time: 0.000s
Time for BDD construction: 0.000s (Max: 0.000s)
Time for merge operator: 0.096s
Time for coverage check: 0.000s
Total time for SMT solver (w/o itp): 0.000s
Total number of created targets for pointer analysis: 8
Number of created targets for uf: *signed_int is 5
PrecisionBootstrap statistics
-----------------------------
Init. function predicates: 0
Init. global predicates: 0
Init. location predicates: 0
Invariant Generation statistics
-------------------------------
Bounds CPA statistics
---------------------
Bound k: 2
Maximum loop iteration reached: 3
ValueAnalysisCPA statistics
---------------------------
Number of variables: 298641 (count: 5065, min: 0, max: 90, avg: 58.96)
Number of global variables: 261169 (count: 5065, min: 0, max: 73, avg: 51.56)
ValueAnalysisPrecisionAdjustment statistics
-------------------------------------------
Number of abstraction computations: 5373
Total time for liveness abstraction: 0.000s
Total time for abstraction computation: 0.231s
Total time for path thresholds: 0.000s
Number of tracked memory locations: 146
ValueAnalysisTransferRelation statistics
----------------------------------------
Number of Assumptions: 1994
Number of deterministic Assumptions: 1362
Level of Determinism: 68%
ConstraintsStrengthenOperator statistics
----------------------------------------
Total time for strengthening by ConstraintsCPA: 0.000s
Replaced symbolic expressions: 0
AutomatonAnalysis (SVCOMP) statistics
-------------------------------------
Number of states: 1
Total time for successor computation: 0.010s
Automaton transfers with branching: 0
Automaton transfer successors: 5373 (count: 5375, min: 0, max: 1, avg: 1.00) [0 x 2, 1 x 5373]
CPA algorithm statistics
------------------------
Number of iterations: 5067
Max size of waitlist: 14
Average size of waitlist: 4
Number of computed successors: 5373
Max successors for one state: 2
Number of times merged: 308
Number of times stopped: 308
Number of times breaked: 0
Total time for CPA algorithm: 4.516s (Max: 3.308s)
Time for choose from waitlist: 0.007s
Time for precision adjustment: 0.434s
Time for transfer relation: 3.859s
Time for merge operator: 0.129s
Time for stop operator: 0.020s
Time for adding to reached set: 0.023s
BMC algorithm statistics
------------------------
Time for BMC formula creation: 4.539s
Time for final sat check: 0.440s
Time for error path creation: 1.098s
Time for bounding assertions check: 0.025s
Time for induction formula creation: 70.514s
Time for induction check: 224.998s
Counterexample-Check Algorithm statistics
-----------------------------------------
Number of counterexample checks: 1
Number of infeasible paths: 1 (100%)
Time for counterexample checks: 1.324s
Time for running CBMC: 1.153s
Statistics for: /lustre/work/anon/anon/cfc/analyzers/cpachecker/config/components/invariantGeneration-no-out.properties
===============================================================================================================================
AutomatonAnalysis (SVCOMP) statistics
-------------------------------------
Number of states: 1
Total time for successor computation: 1.297s
Time for transition matches: 0.521s
Time for transition assertions: 0.000s
Time for transition actions: 0.000s
Automaton transfers with branching: 0
Automaton transfer successors: 325938 (count: 326004, min: 0, max: 1, avg: 1.00) [0 x 66, 1 x 325938]
CPA algorithm statistics
------------------------
Number of iterations: 307296
Max size of waitlist: 222
Average size of waitlist: 70
Number of computed successors: 325938
Max successors for one state: 2
Number of times merged: 39107
Number of times stopped: 43410
Number of times breaked: 0
Total time for CPA algorithm: 305.167s (Max: 160.722s)
Time for choose from waitlist: 0.298s
Time for precision adjustment: 3.788s
Time for transfer relation: 62.681s
Time for merge operator: 222.024s
Time for stop operator: 12.091s
Time for adding to reached set: 1.816s
Other statistics
================
Code Coverage
-----------------------------
Function coverage: 1.000
Visited lines: 763
Total lines: 861
Line coverage: 0.886
Visited conditions: 341
Total conditions: 438
Condition coverage: 0.779
CPAchecker general statistics
-----------------------------
Number of program locations: 1406
Number of CFA edges: 1705
Number of relevant variables: 163
Number of functions: 44
Number of loops: 4
Size of reached set: 5065
Number of reached locations: 1211 (86%)
Avg states per location: 4
Max states per location: 17 (at node N422)
Number of reached functions: 44 (100%)
Number of partitions: 5065
Avg size of partitions: 1
Max size of partitions: 1
Number of target states: 2
Time for analysis setup: 3.958s
Time for loading CPAs: 1.195s
Time for loading parser: 0.805s
Time for CFA construction: 1.859s
Time for parsing file(s): 0.461s
Time for AST to CFA: 0.522s
Time for CFA sanity check: 0.212s
Time for post-processing: 0.603s
Time for var class.: 0.429s
Time for CFA export: 1.433s
Time for Analysis: 310.175s
CPU time for analysis: 615.260s
Time for analyzing result: 0.003s
Total time for CPAchecker: 314.150s
Total CPU time for CPAchecker: 622.160s
Time for statistics: 5.726s
Time for Garbage Collector: 46.398s (in 307 runs)
Garbage Collector(s) used: PS MarkSweep, PS Scavenge
Used heap memory: 907MB ( 865 MiB) max; 489MB ( 466 MiB) avg; 980MB ( 935 MiB) peak
Used non-heap memory: 51MB ( 49 MiB) max; 48MB ( 46 MiB) avg; 57MB ( 54 MiB) peak
Used in PS Old Gen pool: 530MB ( 506 MiB) max; 300MB ( 286 MiB) avg; 531MB ( 506 MiB) peak
Allocated heap memory: 1253MB ( 1195 MiB) max; 1069MB ( 1020 MiB) avg
Allocated non-heap memory: 54MB ( 51 MiB) max; 52MB ( 49 MiB) avg
Total process virtual memory: 6800MB ( 6485 MiB) max; 6596MB ( 6290 MiB) avg
analysis.programNames = /lustre/work/anon/anon/cfc/benchmarks/sv_subset_falsified_by_cpa_or_ua_transform/scripts/analysis_logs/transmitter.15_false-unreach-call_false-termination.cil/transmitter.15_false-unreach-call_false-termination.cil.over.instr.c
analysis.summaryEdges = true
analysis.useParallelAnalyses = true
cfa.allowBranchSwapping = false
cfa.simplifyCfa = false
limits.time.cpu = 900
log.level = INFO
output.path = /lustre/work/anon/anon/cfc/benchmarks/sv_subset_falsified_by_cpa_or_ua_transform/scripts/analysis_logs/transmitter.15_false-unreach-call_false-termination.cil/cpa_output
overflow.config = sv-comp16--k-induction-overflow.properties
parallelAlgorithm.configFiles = components/kInduction/svcomp16-kInduction.properties, components/invariantGeneration-no-out.properties::supply-reached-refinable
specification = /work/anon/anon/cfc/analyzers/cpachecker/config/specification/sv-comp-reachability.spc