Report for /lustre/work/anon/anon/cfc/benchmarks/sv_subset_falsified_by_cpa_or_ua_transform/scripts/analysis_logs/transmitter.16_false-unreach-call_false-termination.cil/transmitter.16_false-unreach-call_false-termination.cil.over.instr.c (Counterexample 1)

Generated on 2017-05-11 14:37:21 by CPAchecker 1.6.1-svn

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_1126 = 1; int INPUTS_at_1126[1]; int input_at_1126_counter = 0;int num_of_inputs_at_1112 = 1; int INPUTS_at_1112[1]; int input_at_1112_counter = 0;int initialize_reads() {  for (int instrumentation_index=0; instrumentation_index<1; instrumentation_index++) INPUTS_at_1126[instrumentation_index] = __VERIFIER_nondet_int();  for (int instrumentation_index=0; instrumentation_index<1; instrumentation_index++) INPUTS_at_1112[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_1112[0] && 0 == INPUTS_at_1126[0])));__VERIFIER_assume(!((0 == INPUTS_at_1112[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 t14_pc  =    0;  
30
int m_st  ;  
31
int t1_st  ;  
32
int t2_st  ;  
33
int t3_st  ;  
34
int t4_st  ;  
35
int t5_st  ;  
36
int t6_st  ;  
37
int t7_st  ;  
38
int t8_st  ;  
39
int t9_st  ;  
40
int t10_st  ;  
41
int t11_st  ;  
42
int t12_st  ;  
43
int t13_st  ;  
44
int t14_st  ;  
45
int m_i  ;  
46
int t1_i  ;  
47
int t2_i  ;  
48
int t3_i  ;  
49
int t4_i  ;  
50
int t5_i  ;  
51
int t6_i  ;  
52
int t7_i  ;  
53
int t8_i  ;  
54
int t9_i  ;  
55
int t10_i  ;  
56
int t11_i  ;  
57
int t12_i  ;  
58
int t13_i  ;  
59
int t14_i  ;  
60
int M_E  =    2;  
61
int T1_E  =    2;  
62
int T2_E  =    2;  
63
int T3_E  =    2;  
64
int T4_E  =    2;  
65
int T5_E  =    2;  
66
int T6_E  =    2;  
67
int T7_E  =    2;  
68
int T8_E  =    2;  
69
int T9_E  =    2;  
70
int T10_E  =    2;  
71
int T11_E  =    2;  
72
int T12_E  =    2;  
73
int T13_E  =    2;  
74
int T14_E  =    2;  
75
int E_1  =    2;  
76
int E_2  =    2;  
77
int E_3  =    2;  
78
int E_4  =    2;  
79
int E_5  =    2;  
80
int E_6  =    2;  
81
int E_7  =    2;  
82
int E_8  =    2;  
83
int E_9  =    2;  
84
int E_10  =    2;  
85
int E_11  =    2;  
86
int E_12  =    2;  
87
int E_13  =    2;  
88
int E_14  =    2;  
89
int is_master_triggered(void) ;  
90
int is_transmit1_triggered(void) ;  
91
int is_transmit2_triggered(void) ;  
92
int is_transmit3_triggered(void) ;  
93
int is_transmit4_triggered(void) ;  
94
int is_transmit5_triggered(void) ;  
95
int is_transmit6_triggered(void) ;  
96
int is_transmit7_triggered(void) ;  
97
int is_transmit8_triggered(void) ;  
98
int is_transmit9_triggered(void) ;  
99
int is_transmit10_triggered(void) ;  
100
int is_transmit11_triggered(void) ;  
101
int is_transmit12_triggered(void) ;  
102
int is_transmit13_triggered(void) ;  
103
int is_transmit14_triggered(void) ;  
104
void immediate_notify(void) ;  
105
void master(void)   
106
{   
107
  
108
  {  
109
  if (m_pc == 0) {  
110
    goto M_ENTRY;  
111
  } else {  
112
    if (m_pc == 1) {  
113
      goto M_WAIT;  
114
    } else {  
115
  
116
    }  
117
  }  
118
  M_ENTRY: ;  
119
  {  
120
  while (1) {  
121
    while_0_continue: /* CIL Label */ ;  
122
    {  
123
    E_1 = 1;  
124
    immediate_notify();  
125
    E_1 = 2;  
126
    }  
127
    {  
128
    while (1) {  
129
      while_1_continue: /* CIL Label */ ;  
130
      m_pc = 1;  
131
      m_st = 2;  
132
  
133
      goto return_label;  
134
      M_WAIT: ;  
135
    }  
136
    while_1_break: /* CIL Label */ ;  
137
    }  
138
  }  
139
  while_0_break: /* CIL Label */ ;  
140
  }  
141
  
142
  return_label: /* CIL Label */   
143
  return;  
144
}  
145
}  
146
void transmit1(void)   
147
{   
148
  
149
  {  
150
  if (t1_pc == 0) {  
151
    goto T1_ENTRY;  
152
  } else {  
153
    if (t1_pc == 1) {  
154
      goto T1_WAIT;  
155
    } else {  
156
  
157
    }  
158
  }  
159
  T1_ENTRY: ;  
160
  {  
161
  while (1) {  
162
    while_2_continue: /* CIL Label */ ;  
163
    t1_pc = 1;  
164
    t1_st = 2;  
165
  
166
    goto return_label;  
167
    T1_WAIT:   
168
    {  
169
    E_2 = 1;  
170
    immediate_notify();  
171
    E_2 = 2;  
172
    }  
173
  }  
174
  while_2_break: /* CIL Label */ ;  
175
  }  
176
  
177
  return_label: /* CIL Label */   
178
  return;  
179
}  
180
}  
181
void transmit2(void)   
182
{   
183
  
184
  {  
185
  if (t2_pc == 0) {  
186
    goto T2_ENTRY;  
187
  } else {  
188
    if (t2_pc == 1) {  
189
      goto T2_WAIT;  
190
    } else {  
191
  
192
    }  
193
  }  
194
  T2_ENTRY: ;  
195
  {  
196
  while (1) {  
197
    while_3_continue: /* CIL Label */ ;  
198
    t2_pc = 1;  
199
    t2_st = 2;  
200
  
201
    goto return_label;  
202
    T2_WAIT:   
203
    {  
204
    E_3 = 1;  
205
    immediate_notify();  
206
    E_3 = 2;  
207
    }  
208
  }  
209
  while_3_break: /* CIL Label */ ;  
210
  }  
211
  
212
  return_label: /* CIL Label */   
213
  return;  
214
}  
215
}  
216
void transmit3(void)   
217
{   
218
  
219
  {  
220
  if (t3_pc == 0) {  
221
    goto T3_ENTRY;  
222
  } else {  
223
    if (t3_pc == 1) {  
224
      goto T3_WAIT;  
225
    } else {  
226
  
227
    }  
228
  }  
229
  T3_ENTRY: ;  
230
  {  
231
  while (1) {  
232
    while_4_continue: /* CIL Label */ ;  
233
    t3_pc = 1;  
234
    t3_st = 2;  
235
  
236
    goto return_label;  
237
    T3_WAIT:   
238
    {  
239
    E_4 = 1;  
240
    immediate_notify();  
241
    E_4 = 2;  
242
    }  
243
  }  
244
  while_4_break: /* CIL Label */ ;  
245
  }  
246
  
247
  return_label: /* CIL Label */   
248
  return;  
249
}  
250
}  
251
void transmit4(void)   
252
{   
253
  
254
  {  
255
  if (t4_pc == 0) {  
256
    goto T4_ENTRY;  
257
  } else {  
258
    if (t4_pc == 1) {  
259
      goto T4_WAIT;  
260
    } else {  
261
  
262
    }  
263
  }  
264
  T4_ENTRY: ;  
265
  {  
266
  while (1) {  
267
    while_5_continue: /* CIL Label */ ;  
268
    t4_pc = 1;  
269
    t4_st = 2;  
270
  
271
    goto return_label;  
272
    T4_WAIT:   
273
    {  
274
    E_5 = 1;  
275
    immediate_notify();  
276
    E_5 = 2;  
277
    }  
278
  }  
279
  while_5_break: /* CIL Label */ ;  
280
  }  
281
  
282
  return_label: /* CIL Label */   
283
  return;  
284
}  
285
}  
286
void transmit5(void)   
287
{   
288
  
289
  {  
290
  if (t5_pc == 0) {  
291
    goto T5_ENTRY;  
292
  } else {  
293
    if (t5_pc == 1) {  
294
      goto T5_WAIT;  
295
    } else {  
296
  
297
    }  
298
  }  
299
  T5_ENTRY: ;  
300
  {  
301
  while (1) {  
302
    while_6_continue: /* CIL Label */ ;  
303
    t5_pc = 1;  
304
    t5_st = 2;  
305
  
306
    goto return_label;  
307
    T5_WAIT:   
308
    {  
309
    E_6 = 1;  
310
    immediate_notify();  
311
    E_6 = 2;  
312
    }  
313
  }  
314
  while_6_break: /* CIL Label */ ;  
315
  }  
316
  
317
  return_label: /* CIL Label */   
318
  return;  
319
}  
320
}  
321
void transmit6(void)   
322
{   
323
  
324
  {  
325
  if (t6_pc == 0) {  
326
    goto T6_ENTRY;  
327
  } else {  
328
    if (t6_pc == 1) {  
329
      goto T6_WAIT;  
330
    } else {  
331
  
332
    }  
333
  }  
334
  T6_ENTRY: ;  
335
  {  
336
  while (1) {  
337
    while_7_continue: /* CIL Label */ ;  
338
    t6_pc = 1;  
339
    t6_st = 2;  
340
  
341
    goto return_label;  
342
    T6_WAIT:   
343
    {  
344
    E_7 = 1;  
345
    immediate_notify();  
346
    E_7 = 2;  
347
    }  
348
  }  
349
  while_7_break: /* CIL Label */ ;  
350
  }  
351
  
352
  return_label: /* CIL Label */   
353
  return;  
354
}  
355
}  
356
void transmit7(void)   
357
{   
358
  
359
  {  
360
  if (t7_pc == 0) {  
361
    goto T7_ENTRY;  
362
  } else {  
363
    if (t7_pc == 1) {  
364
      goto T7_WAIT;  
365
    } else {  
366
  
367
    }  
368
  }  
369
  T7_ENTRY: ;  
370
  {  
371
  while (1) {  
372
    while_8_continue: /* CIL Label */ ;  
373
    t7_pc = 1;  
374
    t7_st = 2;  
375
  
376
    goto return_label;  
377
    T7_WAIT:   
378
    {  
379
    E_8 = 1;  
380
    immediate_notify();  
381
    E_8 = 2;  
382
    }  
383
  }  
384
  while_8_break: /* CIL Label */ ;  
385
  }  
386
  
387
  return_label: /* CIL Label */   
388
  return;  
389
}  
390
}  
391
void transmit8(void)   
392
{   
393
  
394
  {  
395
  if (t8_pc == 0) {  
396
    goto T8_ENTRY;  
397
  } else {  
398
    if (t8_pc == 1) {  
399
      goto T8_WAIT;  
400
    } else {  
401
  
402
    }  
403
  }  
404
  T8_ENTRY: ;  
405
  {  
406
  while (1) {  
407
    while_9_continue: /* CIL Label */ ;  
408
    t8_pc = 1;  
409
    t8_st = 2;  
410
  
411
    goto return_label;  
412
    T8_WAIT:   
413
    {  
414
    E_9 = 1;  
415
    immediate_notify();  
416
    E_9 = 2;  
417
    }  
418
  }  
419
  while_9_break: /* CIL Label */ ;  
420
  }  
421
  
422
  return_label: /* CIL Label */   
423
  return;  
424
}  
425
}  
426
void transmit9(void)   
427
{   
428
  
429
  {  
430
  if (t9_pc == 0) {  
431
    goto T9_ENTRY;  
432
  } else {  
433
    if (t9_pc == 1) {  
434
      goto T9_WAIT;  
435
    } else {  
436
  
437
    }  
438
  }  
439
  T9_ENTRY: ;  
440
  {  
441
  while (1) {  
442
    while_10_continue: /* CIL Label */ ;  
443
    t9_pc = 1;  
444
    t9_st = 2;  
445
  
446
    goto return_label;  
447
    T9_WAIT:   
448
    {  
449
    E_10 = 1;  
450
    immediate_notify();  
451
    E_10 = 2;  
452
    }  
453
  }  
454
  while_10_break: /* CIL Label */ ;  
455
  }  
456
  
457
  return_label: /* CIL Label */   
458
  return;  
459
}  
460
}  
461
void transmit10(void)   
462
{   
463
  
464
  {  
465
  if (t10_pc == 0) {  
466
    goto T10_ENTRY;  
467
  } else {  
468
    if (t10_pc == 1) {  
469
      goto T10_WAIT;  
470
    } else {  
471
  
472
    }  
473
  }  
474
  T10_ENTRY: ;  
475
  {  
476
  while (1) {  
477
    while_11_continue: /* CIL Label */ ;  
478
    t10_pc = 1;  
479
    t10_st = 2;  
480
  
481
    goto return_label;  
482
    T10_WAIT:   
483
    {  
484
    E_11 = 1;  
485
    immediate_notify();  
486
    E_11 = 2;  
487
    }  
488
  }  
489
  while_11_break: /* CIL Label */ ;  
490
  }  
491
  
492
  return_label: /* CIL Label */   
493
  return;  
494
}  
495
}  
496
void transmit11(void)   
497
{   
498
  
499
  {  
500
  if (t11_pc == 0) {  
501
    goto T11_ENTRY;  
502
  } else {  
503
    if (t11_pc == 1) {  
504
      goto T11_WAIT;  
505
    } else {  
506
  
507
    }  
508
  }  
509
  T11_ENTRY: ;  
510
  {  
511
  while (1) {  
512
    while_12_continue: /* CIL Label */ ;  
513
    t11_pc = 1;  
514
    t11_st = 2;  
515
  
516
    goto return_label;  
517
    T11_WAIT:   
518
    {  
519
    E_12 = 1;  
520
    immediate_notify();  
521
    E_12 = 2;  
522
    }  
523
  }  
524
  while_12_break: /* CIL Label */ ;  
525
  }  
526
  
527
  return_label: /* CIL Label */   
528
  return;  
529
}  
530
}  
531
void transmit12(void)   
532
{   
533
  
534
  {  
535
  if (t12_pc == 0) {  
536
    goto T12_ENTRY;  
537
  } else {  
538
    if (t12_pc == 1) {  
539
      goto T12_WAIT;  
540
    } else {  
541
  
542
    }  
543
  }  
544
  T12_ENTRY: ;  
545
  {  
546
  while (1) {  
547
    while_13_continue: /* CIL Label */ ;  
548
    t12_pc = 1;  
549
    t12_st = 2;  
550
  
551
    goto return_label;  
552
    T12_WAIT:   
553
    {  
554
    E_13 = 1;  
555
    immediate_notify();  
556
    E_13 = 2;  
557
    }  
558
  }  
559
  while_13_break: /* CIL Label */ ;  
560
  }  
561
  
562
  return_label: /* CIL Label */   
563
  return;  
564
}  
565
}  
566
void transmit13(void)   
567
{   
568
  
569
  {  
570
  if (t13_pc == 0) {  
571
    goto T13_ENTRY;  
572
  } else {  
573
    if (t13_pc == 1) {  
574
      goto T13_WAIT;  
575
    } else {  
576
  
577
    }  
578
  }  
579
  T13_ENTRY: ;  
580
  {  
581
  while (1) {  
582
    while_14_continue: /* CIL Label */ ;  
583
    t13_pc = 1;  
584
    t13_st = 2;  
585
  
586
    goto return_label;  
587
    T13_WAIT:   
588
    {  
589
    //error();  
590
    }  
591
  }  
592
  while_14_break: /* CIL Label */ ;  
593
  }  
594
  
595
  return_label: /* CIL Label */   
596
  return;  
597
}  
598
}  
599
void transmit14(void)   
600
{   
601
  
602
  {  
603
  if (t14_pc == 0) {  
604
    goto T14_ENTRY;  
605
  } else {  
606
    if (t14_pc == 1) {  
607
      goto T14_WAIT;  
608
    } else {  
609
  
610
    }  
611
  }  
612
  T14_ENTRY: ;  
613
  {  
614
  while (1) {  
615
    while_45_continue: /* CIL Label */ ;  
616
    t14_pc = 1;  
617
    t14_st = 2;  
618
  
619
    goto return_label;  
620
    T14_WAIT:   
621
    {  
622
    //error();  
623
    }  
624
  }  
625
  while_45_break: /* CIL Label */ ;  
626
  }  
627
  
628
  return_label: /* CIL Label */   
629
  return;  
630
}  
631
}  
632
int is_master_triggered(void)   
633
{ int __retres1 ;  
634
  
635
  {  
636
  if (m_pc == 1) {  
637
    if (M_E == 1) {  
638
      __retres1 = 1;  
639
      goto return_label;  
640
    } else {  
641
  
642
    }  
643
  } else {  
644
  
645
  }  
646
  __retres1 = 0;  
647
  return_label: /* CIL Label */   
648
  return (__retres1);  
649
}  
650
}  
651
int is_transmit1_triggered(void)   
652
{ int __retres1 ;  
653
  
654
  {  
655
  if (t1_pc == 1) {  
656
    if (E_1 == 1) {  
657
      __retres1 = 1;  
658
      goto return_label;  
659
    } else {  
660
  
661
    }  
662
  } else {  
663
  
664
  }  
665
  __retres1 = 0;  
666
  return_label: /* CIL Label */   
667
  return (__retres1);  
668
}  
669
}  
670
int is_transmit2_triggered(void)   
671
{ int __retres1 ;  
672
  
673
  {  
674
  if (t2_pc == 1) {  
675
    if (E_2 == 1) {  
676
      __retres1 = 1;  
677
      goto return_label;  
678
    } else {  
679
  
680
    }  
681
  } else {  
682
  
683
  }  
684
  __retres1 = 0;  
685
  return_label: /* CIL Label */   
686
  return (__retres1);  
687
}  
688
}  
689
int is_transmit3_triggered(void)   
690
{ int __retres1 ;  
691
  
692
  {  
693
  if (t3_pc == 1) {  
694
    if (E_3 == 1) {  
695
      __retres1 = 1;  
696
      goto return_label;  
697
    } else {  
698
  
699
    }  
700
  } else {  
701
  
702
  }  
703
  __retres1 = 0;  
704
  return_label: /* CIL Label */   
705
  return (__retres1);  
706
}  
707
}  
708
int is_transmit4_triggered(void)   
709
{ int __retres1 ;  
710
  
711
  {  
712
  if (t4_pc == 1) {  
713
    if (E_4 == 1) {  
714
      __retres1 = 1;  
715
      goto return_label;  
716
    } else {  
717
  
718
    }  
719
  } else {  
720
  
721
  }  
722
  __retres1 = 0;  
723
  return_label: /* CIL Label */   
724
  return (__retres1);  
725
}  
726
}  
727
int is_transmit5_triggered(void)   
728
{ int __retres1 ;  
729
  
730
  {  
731
  if (t5_pc == 1) {  
732
    if (E_5 == 1) {  
733
      __retres1 = 1;  
734
      goto return_label;  
735
    } else {  
736
  
737
    }  
738
  } else {  
739
  
740
  }  
741
  __retres1 = 0;  
742
  return_label: /* CIL Label */   
743
  return (__retres1);  
744
}  
745
}  
746
int is_transmit6_triggered(void)   
747
{ int __retres1 ;  
748
  
749
  {  
750
  if (t6_pc == 1) {  
751
    if (E_6 == 1) {  
752
      __retres1 = 1;  
753
      goto return_label;  
754
    } else {  
755
  
756
    }  
757
  } else {  
758
  
759
  }  
760
  __retres1 = 0;  
761
  return_label: /* CIL Label */   
762
  return (__retres1);  
763
}  
764
}  
765
int is_transmit7_triggered(void)   
766
{ int __retres1 ;  
767
  
768
  {  
769
  if (t7_pc == 1) {  
770
    if (E_7 == 1) {  
771
      __retres1 = 1;  
772
      goto return_label;  
773
    } else {  
774
  
775
    }  
776
  } else {  
777
  
778
  }  
779
  __retres1 = 0;  
780
  return_label: /* CIL Label */   
781
  return (__retres1);  
782
}  
783
}  
784
int is_transmit8_triggered(void)   
785
{ int __retres1 ;  
786
  
787
  {  
788
  if (t8_pc == 1) {  
789
    if (E_8 == 1) {  
790
      __retres1 = 1;  
791
      goto return_label;  
792
    } else {  
793
  
794
    }  
795
  } else {  
796
  
797
  }  
798
  __retres1 = 0;  
799
  return_label: /* CIL Label */   
800
  return (__retres1);  
801
}  
802
}  
803
int is_transmit9_triggered(void)   
804
{ int __retres1 ;  
805
  
806
  {  
807
  if (t9_pc == 1) {  
808
    if (E_9 == 1) {  
809
      __retres1 = 1;  
810
      goto return_label;  
811
    } else {  
812
  
813
    }  
814
  } else {  
815
  
816
  }  
817
  __retres1 = 0;  
818
  return_label: /* CIL Label */   
819
  return (__retres1);  
820
}  
821
}  
822
int is_transmit10_triggered(void)   
823
{ int __retres1 ;  
824
  
825
  {  
826
  if (t10_pc == 1) {  
827
    if (E_10 == 1) {  
828
      __retres1 = 1;  
829
      goto return_label;  
830
    } else {  
831
  
832
    }  
833
  } else {  
834
  
835
  }  
836
  __retres1 = 0;  
837
  return_label: /* CIL Label */   
838
  return (__retres1);  
839
}  
840
}  
841
int is_transmit11_triggered(void)   
842
{ int __retres1 ;  
843
  
844
  {  
845
  if (t11_pc == 1) {  
846
    if (E_11 == 1) {  
847
      __retres1 = 1;  
848
      goto return_label;  
849
    } else {  
850
  
851
    }  
852
  } else {  
853
  
854
  }  
855
  __retres1 = 0;  
856
  return_label: /* CIL Label */   
857
  return (__retres1);  
858
}  
859
}  
860
int is_transmit12_triggered(void)   
861
{ int __retres1 ;  
862
  
863
  {  
864
  if (t12_pc == 1) {  
865
    if (E_12 == 1) {  
866
      __retres1 = 1;  
867
      goto return_label;  
868
    } else {  
869
  
870
    }  
871
  } else {  
872
  
873
  }  
874
  __retres1 = 0;  
875
  return_label: /* CIL Label */   
876
  return (__retres1);  
877
}  
878
}  
879
int is_transmit13_triggered(void)   
880
{ int __retres1 ;  
881
  
882
  {  
883
  if (t13_pc == 1) {  
884
    if (E_13 == 1) {  
885
      __retres1 = 1;  
886
      goto return_label;  
887
    } else {  
888
  
889
    }  
890
  } else {  
891
  
892
  }  
893
  __retres1 = 0;  
894
  return_label: /* CIL Label */   
895
  return (__retres1);  
896
}  
897
}  
898
int is_transmit14_triggered(void)   
899
{ int __retres1 ;  
900
  
901
  {  
902
  if (t14_pc == 1) {  
903
    if (E_14 == 1) {  
904
      __retres1 = 1;  
905
      goto return_label;  
906
    } else {  
907
  
908
    }  
909
  } else {  
910
  
911
  }  
912
  __retres1 = 0;  
913
  return_label: /* CIL Label */   
914
  return (__retres1);  
915
}  
916
}  
917
void update_channels(void)   
918
{   
919
  
920
  {  
921
  
922
  return;  
923
}  
924
}  
925
void init_threads(void)   
926
{   
927
  
928
  {  
929
  if (m_i == 1) {  
930
    m_st = 0;  
931
  } else {  
932
    m_st = 2;  
933
  }  
934
  if (t1_i == 1) {  
935
    t1_st = 0;  
936
  } else {  
937
    t1_st = 2;  
938
  }  
939
  if (t2_i == 1) {  
940
    t2_st = 0;  
941
  } else {  
942
    t2_st = 2;  
943
  }  
944
  if (t3_i == 1) {  
945
    t3_st = 0;  
946
  } else {  
947
    t3_st = 2;  
948
  }  
949
  if (t4_i == 1) {  
950
    t4_st = 0;  
951
  } else {  
952
    t4_st = 2;  
953
  }  
954
  if (t5_i == 1) {  
955
    t5_st = 0;  
956
  } else {  
957
    t5_st = 2;  
958
  }  
959
  if (t6_i == 1) {  
960
    t6_st = 0;  
961
  } else {  
962
    t6_st = 2;  
963
  }  
964
  if (t7_i == 1) {  
965
    t7_st = 0;  
966
  } else {  
967
    t7_st = 2;  
968
  }  
969
  if (t8_i == 1) {  
970
    t8_st = 0;  
971
  } else {  
972
    t8_st = 2;  
973
  }  
974
  if (t9_i == 1) {  
975
    t9_st = 0;  
976
  } else {  
977
    t9_st = 2;  
978
  }  
979
  if (t10_i == 1) {  
980
    t10_st = 0;  
981
  } else {  
982
    t10_st = 2;  
983
  }  
984
  if (t11_i == 1) {  
985
    t11_st = 0;  
986
  } else {  
987
    t11_st = 2;  
988
  }  
989
  if (t12_i == 1) {  
990
    t12_st = 0;  
991
  } else {  
992
    t12_st = 2;  
993
  }  
994
  if (t13_i == 1) {  
995
    t13_st = 0;  
996
  } else {  
997
    t13_st = 2;  
998
  }  
999
  if (t14_i == 1) {  
1000
    t14_st = 0;  
1001
  } else {  
1002
    t14_st = 2;  
1003
  }  
1004
  
1005
  return;  
1006
}  
1007
}  
1008
int exists_runnable_thread(void)   
1009
{ int __retres1 ;  
1010
  
1011
  {  
1012
  if (m_st == 0) {  
1013
    __retres1 = 1;  
1014
    goto return_label;  
1015
  } else {  
1016
    if (t1_st == 0) {  
1017
      __retres1 = 1;  
1018
      goto return_label;  
1019
    } else {  
1020
      if (t2_st == 0) {  
1021
        __retres1 = 1;  
1022
        goto return_label;  
1023
      } else {  
1024
        if (t3_st == 0) {  
1025
          __retres1 = 1;  
1026
          goto return_label;  
1027
        } else {  
1028
          if (t4_st == 0) {  
1029
            __retres1 = 1;  
1030
            goto return_label;  
1031
          } else {  
1032
            if (t5_st == 0) {  
1033
              __retres1 = 1;  
1034
              goto return_label;  
1035
            } else {  
1036
              if (t6_st == 0) {  
1037
                __retres1 = 1;  
1038
                goto return_label;  
1039
              } else {  
1040
                if (t7_st == 0) {  
1041
                  __retres1 = 1;  
1042
                  goto return_label;  
1043
                } else {  
1044
                  if (t8_st == 0) {  
1045
                    __retres1 = 1;  
1046
                    goto return_label;  
1047
                  } else {  
1048
                    if (t9_st == 0) {  
1049
                      __retres1 = 1;  
1050
                      goto return_label;  
1051
                    } else {  
1052
                      if (t10_st == 0) {  
1053
                        __retres1 = 1;  
1054
                        goto return_label;  
1055
                      } else {  
1056
                        if (t11_st == 0) {  
1057
                          __retres1 = 1;  
1058
                          goto return_label;  
1059
                        } else {  
1060
                          if (t12_st == 0) {  
1061
                            __retres1 = 1;  
1062
                            goto return_label;  
1063
                          } else {  
1064
                            if (t13_st == 0) {  
1065
                              __retres1 = 1;  
1066
                              goto return_label;  
1067
                            } else {  
1068
                                if(t14_st == 0) {  
1069
                                  __retres1 = 1;  
1070
                                  goto return_label;                                  
1071
                                }  
1072
                                else {  
1073
   
1074
                                }  
1075
                            }  
1076
                          }  
1077
                        }  
1078
                      }  
1079
                    }  
1080
                  }  
1081
                }  
1082
              }  
1083
            }  
1084
          }  
1085
        }  
1086
      }  
1087
    }  
1088
  }  
1089
  __retres1 = 0;  
1090
  return_label: /* CIL Label */   
1091
  return (__retres1);  
1092
}  
1093
}  
1094
void eval(void)   
1095
{  
1096
  int tmp ;  
1097
  
1098
  {  
1099
  {  
1100
  while (1) {  
1101
    while_15_continue: /* CIL Label */ ;  
1102
    {  
1103
    tmp = exists_runnable_thread();  
1104
    }  
1105
    if (tmp != 0) {  
1106
  
1107
    } else {  
1108
      goto while_15_break;  
1109
    }  
1110
    if (m_st == 0) {  
1111
      int tmp_ndt_1;  
1112
      tmp_ndt_1 = (input_at_1112_counter < num_of_inputs_at_1112) ? INPUTS_at_1112[input_at_1112_counter++] : __VERIFIER_nondet_int() ;  
1113
      if (tmp_ndt_1 != 0) {  
1114
        {  
1115
        m_st = 1;  
1116
        master();  
1117
        }  
1118
      } else {  
1119
  
1120
      }  
1121
    } else {  
1122
  
1123
    }  
1124
    if (t1_st == 0) {  
1125
      int tmp_ndt_2;  
1126
      tmp_ndt_2 = (input_at_1126_counter < num_of_inputs_at_1126) ? INPUTS_at_1126[input_at_1126_counter++] : __VERIFIER_nondet_int() ;  
1127
      if (tmp_ndt_2 != 0) {  
1128
        {  
1129
        t1_st = 1;  
1130
        transmit1();  
1131
        }  
1132
      } else {  
1133
        error();  
1134
      }  
1135
    } else {  
1136
  
1137
    }  
1138
    if (t2_st == 0) {  
1139
      int tmp_ndt_3;  
1140
      tmp_ndt_3 = __VERIFIER_nondet_int();  
1141
      if (tmp_ndt_3 != 0) {  
1142
        {  
1143
        t2_st = 1;  
1144
        transmit2();  
1145
        }  
1146
      } else {  
1147
  
1148
      }  
1149
    } else {  
1150
  
1151
    }  
1152
    if (t3_st == 0) {  
1153
      int tmp_ndt_4;  
1154
      tmp_ndt_4 = __VERIFIER_nondet_int();  
1155
      if (tmp_ndt_4 != 0) {  
1156
        {  
1157
        t3_st = 1;  
1158
        transmit3();  
1159
        }  
1160
      } else {  
1161
  
1162
      }  
1163
    } else {  
1164
  
1165
    }  
1166
    if (t4_st == 0) {  
1167
      int tmp_ndt_5;  
1168
      tmp_ndt_5 = __VERIFIER_nondet_int();  
1169
      if (tmp_ndt_5 != 0) {  
1170
        {  
1171
        t4_st = 1;  
1172
        transmit4();  
1173
        }  
1174
      } else {  
1175
  
1176
      }  
1177
    } else {  
1178
  
1179
    }  
1180
    if (t5_st == 0) {  
1181
      int tmp_ndt_6;  
1182
      tmp_ndt_6 = __VERIFIER_nondet_int();  
1183
      if (tmp_ndt_6 != 0) {  
1184
        {  
1185
        t5_st = 1;  
1186
        transmit5();  
1187
        }  
1188
      } else {  
1189
  
1190
      }  
1191
    } else {  
1192
  
1193
    }  
1194
    if (t6_st == 0) {  
1195
      int tmp_ndt_7;  
1196
      tmp_ndt_7 = __VERIFIER_nondet_int();  
1197
      if (tmp_ndt_7 != 0) {  
1198
        {  
1199
        t6_st = 1;  
1200
        transmit6();  
1201
        }  
1202
      } else {  
1203
  
1204
      }  
1205
    } else {  
1206
  
1207
    }  
1208
    if (t7_st == 0) {  
1209
      int tmp_ndt_8;  
1210
      tmp_ndt_8 = __VERIFIER_nondet_int();  
1211
      if (tmp_ndt_8 != 0) {  
1212
        {  
1213
        t7_st = 1;  
1214
        transmit7();  
1215
        }  
1216
      } else {  
1217
  
1218
      }  
1219
    } else {  
1220
  
1221
    }  
1222
    if (t8_st == 0) {  
1223
      int tmp_ndt_9;  
1224
      tmp_ndt_9 = __VERIFIER_nondet_int();  
1225
      if (tmp_ndt_9 != 0) {  
1226
        {  
1227
        t8_st = 1;  
1228
        transmit8();  
1229
        }  
1230
      } else {  
1231
  
1232
      }  
1233
    } else {  
1234
  
1235
    }  
1236
    if (t9_st == 0) {  
1237
      int tmp_ndt_10;  
1238
      tmp_ndt_10 = __VERIFIER_nondet_int();  
1239
      if (tmp_ndt_10 != 0) {  
1240
        {  
1241
        t9_st = 1;  
1242
        transmit9();  
1243
        }  
1244
      } else {  
1245
  
1246
      }  
1247
    } else {  
1248
  
1249
    }  
1250
    if (t10_st == 0) {  
1251
      int tmp_ndt_11;  
1252
      tmp_ndt_11 = __VERIFIER_nondet_int();  
1253
      if (tmp_ndt_11 != 0) {  
1254
        {  
1255
        t10_st = 1;  
1256
        transmit10();  
1257
        }  
1258
      } else {  
1259
  
1260
      }  
1261
    } else {  
1262
  
1263
    }  
1264
    if (t11_st == 0) {  
1265
      int tmp_ndt_12;  
1266
      tmp_ndt_12 = __VERIFIER_nondet_int();  
1267
      if (tmp_ndt_12 != 0) {  
1268
        {  
1269
        t11_st = 1;  
1270
        transmit11();  
1271
        }  
1272
      } else {  
1273
  
1274
      }  
1275
    } else {  
1276
  
1277
    }  
1278
    if (t12_st == 0) {  
1279
      int tmp_ndt_13;  
1280
      tmp_ndt_13 = __VERIFIER_nondet_int();  
1281
      if (tmp_ndt_13 != 0) {  
1282
        {  
1283
        t12_st = 1;  
1284
        transmit12();  
1285
        }  
1286
      } else {  
1287
  
1288
      }  
1289
    } else {  
1290
  
1291
    }  
1292
    if (t13_st == 0) {  
1293
      int tmp_ndt_14;  
1294
      tmp_ndt_14 = __VERIFIER_nondet_int();  
1295
      if (tmp_ndt_14 != 0) {  
1296
        {  
1297
        t13_st = 1;  
1298
        transmit13();  
1299
        }  
1300
      } else {  
1301
  
1302
      }  
1303
    } else {  
1304
  
1305
    }  
1306
    if (t14_st == 0) {  
1307
      int tmp_ndt_15;  
1308
      tmp_ndt_15 = __VERIFIER_nondet_int();  
1309
      if (tmp_ndt_15 != 0) {  
1310
        {  
1311
        t14_st = 1;  
1312
        transmit14();  
1313
        }  
1314
      } else {  
1315
  
1316
      }  
1317
    }  
1318
    else {  
1319
    
1320
    }  
1321
  }  
1322
  while_15_break: /* CIL Label */ ;  
1323
  }  
1324
  
1325
  return;  
1326
}  
1327
}  
1328
void fire_delta_events(void)   
1329
{   
1330
  
1331
  {  
1332
  if (M_E == 0) {  
1333
    M_E = 1;  
1334
  } else {  
1335
  
1336
  }  
1337
  if (T1_E == 0) {  
1338
    T1_E = 1;  
1339
  } else {  
1340
  
1341
  }  
1342
  if (T2_E == 0) {  
1343
    T2_E = 1;  
1344
  } else {  
1345
  
1346
  }  
1347
  if (T3_E == 0) {  
1348
    T3_E = 1;  
1349
  } else {  
1350
  
1351
  }  
1352
  if (T4_E == 0) {  
1353
    T4_E = 1;  
1354
  } else {  
1355
  
1356
  }  
1357
  if (T5_E == 0) {  
1358
    T5_E = 1;  
1359
  } else {  
1360
  
1361
  }  
1362
  if (T6_E == 0) {  
1363
    T6_E = 1;  
1364
  } else {  
1365
  
1366
  }  
1367
  if (T7_E == 0) {  
1368
    T7_E = 1;  
1369
  } else {  
1370
  
1371
  }  
1372
  if (T8_E == 0) {  
1373
    T8_E = 1;  
1374
  } else {  
1375
  
1376
  }  
1377
  if (T9_E == 0) {  
1378
    T9_E = 1;  
1379
  } else {  
1380
  
1381
  }  
1382
  if (T10_E == 0) {  
1383
    T10_E = 1;  
1384
  } else {  
1385
  
1386
  }  
1387
  if (T11_E == 0) {  
1388
    T11_E = 1;  
1389
  } else {  
1390
  
1391
  }  
1392
  if (T12_E == 0) {  
1393
    T12_E = 1;  
1394
  } else {  
1395
  
1396
  }  
1397
  if (T13_E == 0) {  
1398
    T13_E = 1;  
1399
  } else {  
1400
  
1401
  }  
1402
  if (T14_E == 0) {  
1403
    T14_E = 1;  
1404
  } else {  
1405
  
1406
  }  
1407
  if (E_1 == 0) {  
1408
    E_1 = 1;  
1409
  } else {  
1410
  
1411
  }  
1412
  if (E_2 == 0) {  
1413
    E_2 = 1;  
1414
  } else {  
1415
  
1416
  }  
1417
  if (E_3 == 0) {  
1418
    E_3 = 1;  
1419
  } else {  
1420
  
1421
  }  
1422
  if (E_4 == 0) {  
1423
    E_4 = 1;  
1424
  } else {  
1425
  
1426
  }  
1427
  if (E_5 == 0) {  
1428
    E_5 = 1;  
1429
  } else {  
1430
  
1431
  }  
1432
  if (E_6 == 0) {  
1433
    E_6 = 1;  
1434
  } else {  
1435
  
1436
  }  
1437
  if (E_7 == 0) {  
1438
    E_7 = 1;  
1439
  } else {  
1440
  
1441
  }  
1442
  if (E_8 == 0) {  
1443
    E_8 = 1;  
1444
  } else {  
1445
  
1446
  }  
1447
  if (E_9 == 0) {  
1448
    E_9 = 1;  
1449
  } else {  
1450
  
1451
  }  
1452
  if (E_10 == 0) {  
1453
    E_10 = 1;  
1454
  } else {  
1455
  
1456
  }  
1457
  if (E_11 == 0) {  
1458
    E_11 = 1;  
1459
  } else {  
1460
  
1461
  }  
1462
  if (E_12 == 0) {  
1463
    E_12 = 1;  
1464
  } else {  
1465
  
1466
  }  
1467
  if (E_13 == 0) {  
1468
    E_13 = 1;  
1469
  } else {  
1470
  
1471
  }  
1472
  if (E_14 == 0) {  
1473
    E_14 = 1;  
1474
  } else {  
1475
  
1476
  }  
1477
  
1478
  return;  
1479
}  
1480
}  
1481
void reset_delta_events(void)   
1482
{   
1483
  
1484
  {  
1485
  if (M_E == 1) {  
1486
    M_E = 2;  
1487
  } else {  
1488
  
1489
  }  
1490
  if (T1_E == 1) {  
1491
    T1_E = 2;  
1492
  } else {  
1493
  
1494
  }  
1495
  if (T2_E == 1) {  
1496
    T2_E = 2;  
1497
  } else {  
1498
  
1499
  }  
1500
  if (T3_E == 1) {  
1501
    T3_E = 2;  
1502
  } else {  
1503
  
1504
  }  
1505
  if (T4_E == 1) {  
1506
    T4_E = 2;  
1507
  } else {  
1508
  
1509
  }  
1510
  if (T5_E == 1) {  
1511
    T5_E = 2;  
1512
  } else {  
1513
  
1514
  }  
1515
  if (T6_E == 1) {  
1516
    T6_E = 2;  
1517
  } else {  
1518
  
1519
  }  
1520
  if (T7_E == 1) {  
1521
    T7_E = 2;  
1522
  } else {  
1523
  
1524
  }  
1525
  if (T8_E == 1) {  
1526
    T8_E = 2;  
1527
  } else {  
1528
  
1529
  }  
1530
  if (T9_E == 1) {  
1531
    T9_E = 2;  
1532
  } else {  
1533
  
1534
  }  
1535
  if (T10_E == 1) {  
1536
    T10_E = 2;  
1537
  } else {  
1538
  
1539
  }  
1540
  if (T11_E == 1) {  
1541
    T11_E = 2;  
1542
  } else {  
1543
  
1544
  }  
1545
  if (T12_E == 1) {  
1546
    T12_E = 2;  
1547
  } else {  
1548
  
1549
  }  
1550
  if (T13_E == 1) {  
1551
    T13_E = 2;  
1552
  } else {  
1553
  
1554
  }  
1555
  if (T14_E == 1) {  
1556
    T14_E = 2;  
1557
  } else {  
1558
  
1559
  }  
1560
  if (E_1 == 1) {  
1561
    E_1 = 2;  
1562
  } else {  
1563
  
1564
  }  
1565
  if (E_2 == 1) {  
1566
    E_2 = 2;  
1567
  } else {  
1568
  
1569
  }  
1570
  if (E_3 == 1) {  
1571
    E_3 = 2;  
1572
  } else {  
1573
  
1574
  }  
1575
  if (E_4 == 1) {  
1576
    E_4 = 2;  
1577
  } else {  
1578
  
1579
  }  
1580
  if (E_5 == 1) {  
1581
    E_5 = 2;  
1582
  } else {  
1583
  
1584
  }  
1585
  if (E_6 == 1) {  
1586
    E_6 = 2;  
1587
  } else {  
1588
  
1589
  }  
1590
  if (E_7 == 1) {  
1591
    E_7 = 2;  
1592
  } else {  
1593
  
1594
  }  
1595
  if (E_8 == 1) {  
1596
    E_8 = 2;  
1597
  } else {  
1598
  
1599
  }  
1600
  if (E_9 == 1) {  
1601
    E_9 = 2;  
1602
  } else {  
1603
  
1604
  }  
1605
  if (E_10 == 1) {  
1606
    E_10 = 2;  
1607
  } else {  
1608
  
1609
  }  
1610
  if (E_11 == 1) {  
1611
    E_11 = 2;  
1612
  } else {  
1613
  
1614
  }  
1615
  if (E_12 == 1) {  
1616
    E_12 = 2;  
1617
  } else {  
1618
  
1619
  }  
1620
  if (E_13 == 1) {  
1621
    E_13 = 2;  
1622
  } else {  
1623
  
1624
  }  
1625
  if (E_14 == 1) {  
1626
    E_14 = 2;  
1627
  } else {  
1628
  
1629
  }  
1630
  
1631
  return;  
1632
}  
1633
}  
1634
void activate_threads(void)   
1635
{ int tmp ;  
1636
  int tmp___0 ;  
1637
  int tmp___1 ;  
1638
  int tmp___2 ;  
1639
  int tmp___3 ;  
1640
  int tmp___4 ;  
1641
  int tmp___5 ;  
1642
  int tmp___6 ;  
1643
  int tmp___7 ;  
1644
  int tmp___8 ;  
1645
  int tmp___9 ;  
1646
  int tmp___10 ;  
1647
  int tmp___11 ;  
1648
  int tmp___12 ;  
1649
  int tmp___13 ;  
1650
  
1651
  
1652
  {  
1653
  {  
1654
  tmp = is_master_triggered();  
1655
  }  
1656
  if (tmp != 0) {  
1657
    m_st = 0;  
1658
  } else {  
1659
  
1660
  }  
1661
  {  
1662
  tmp___0 = is_transmit1_triggered();  
1663
  }  
1664
  if (tmp___0 != 0) {  
1665
    t1_st = 0;  
1666
  } else {  
1667
  
1668
  }  
1669
  {  
1670
  tmp___1 = is_transmit2_triggered();  
1671
  }  
1672
  if (tmp___1 != 0) {  
1673
    t2_st = 0;  
1674
  } else {  
1675
  
1676
  }  
1677
  {  
1678
  tmp___2 = is_transmit3_triggered();  
1679
  }  
1680
  if (tmp___2 != 0) {  
1681
    t3_st = 0;  
1682
  } else {  
1683
  
1684
  }  
1685
  {  
1686
  tmp___3 = is_transmit4_triggered();  
1687
  }  
1688
  if (tmp___3 != 0) {  
1689
    t4_st = 0;  
1690
  } else {  
1691
  
1692
  }  
1693
  {  
1694
  tmp___4 = is_transmit5_triggered();  
1695
  }  
1696
  if (tmp___4 != 0) {  
1697
    t5_st = 0;  
1698
  } else {  
1699
  
1700
  }  
1701
  {  
1702
  tmp___5 = is_transmit6_triggered();  
1703
  }  
1704
  if (tmp___5 != 0) {  
1705
    t6_st = 0;  
1706
  } else {  
1707
  
1708
  }  
1709
  {  
1710
  tmp___6 = is_transmit7_triggered();  
1711
  }  
1712
  if (tmp___6 != 0) {  
1713
    t7_st = 0;  
1714
  } else {  
1715
  
1716
  }  
1717
  {  
1718
  tmp___7 = is_transmit8_triggered();  
1719
  }  
1720
  if (tmp___7 != 0) {  
1721
    t8_st = 0;  
1722
  } else {  
1723
  
1724
  }  
1725
  {  
1726
  tmp___8 = is_transmit9_triggered();  
1727
  }  
1728
  if (tmp___8 != 0) {  
1729
    t9_st = 0;  
1730
  } else {  
1731
  
1732
  }  
1733
  {  
1734
  tmp___9 = is_transmit10_triggered();  
1735
  }  
1736
  if (tmp___9 != 0) {  
1737
    t10_st = 0;  
1738
  } else {  
1739
  
1740
  }  
1741
  {  
1742
  tmp___10 = is_transmit11_triggered();  
1743
  }  
1744
  if (tmp___10 != 0) {  
1745
    t11_st = 0;  
1746
  } else {  
1747
  
1748
  }  
1749
  {  
1750
  tmp___11 = is_transmit12_triggered();  
1751
  }  
1752
  if (tmp___11 != 0) {  
1753
    t12_st = 0;  
1754
  } else {  
1755
  
1756
  }  
1757
  {  
1758
  tmp___12 = is_transmit13_triggered();  
1759
  }  
1760
  if (tmp___12 != 0) {  
1761
    t13_st = 0;  
1762
  } else {  
1763
  
1764
  }  
1765
  {  
1766
  tmp___13 = is_transmit14_triggered();  
1767
  }  
1768
  if (tmp___13 != 0) {  
1769
    t14_st = 0;  
1770
  } else {  
1771
  
1772
  }  
1773
  
1774
  return;  
1775
}  
1776
}  
1777
void immediate_notify(void)   
1778
{   
1779
  
1780
  {  
1781
  {  
1782
  activate_threads();  
1783
  }  
1784
  
1785
  return;  
1786
}  
1787
}  
1788
void fire_time_events(void)   
1789
{   
1790
  
1791
  {  
1792
  M_E = 1;  
1793
  
1794
  return;  
1795
}  
1796
}  
1797
void reset_time_events(void)   
1798
{   
1799
  
1800
  {  
1801
  if (M_E == 1) {  
1802
    M_E = 2;  
1803
  } else {  
1804
  
1805
  }  
1806
  if (T1_E == 1) {  
1807
    T1_E = 2;  
1808
  } else {  
1809
  
1810
  }  
1811
  if (T2_E == 1) {  
1812
    T2_E = 2;  
1813
  } else {  
1814
  
1815
  }  
1816
  if (T3_E == 1) {  
1817
    T3_E = 2;  
1818
  } else {  
1819
  
1820
  }  
1821
  if (T4_E == 1) {  
1822
    T4_E = 2;  
1823
  } else {  
1824
  
1825
  }  
1826
  if (T5_E == 1) {  
1827
    T5_E = 2;  
1828
  } else {  
1829
  
1830
  }  
1831
  if (T6_E == 1) {  
1832
    T6_E = 2;  
1833
  } else {  
1834
  
1835
  }  
1836
  if (T7_E == 1) {  
1837
    T7_E = 2;  
1838
  } else {  
1839
  
1840
  }  
1841
  if (T8_E == 1) {  
1842
    T8_E = 2;  
1843
  } else {  
1844
  
1845
  }  
1846
  if (T9_E == 1) {  
1847
    T9_E = 2;  
1848
  } else {  
1849
  
1850
  }  
1851
  if (T10_E == 1) {  
1852
    T10_E = 2;  
1853
  } else {  
1854
  
1855
  }  
1856
  if (T11_E == 1) {  
1857
    T11_E = 2;  
1858
  } else {  
1859
  
1860
  }  
1861
  if (T12_E == 1) {  
1862
    T12_E = 2;  
1863
  } else {  
1864
  
1865
  }  
1866
  if (T13_E == 1) {  
1867
    T13_E = 2;  
1868
  } else {  
1869
  
1870
  }  
1871
  if (T14_E == 1) {  
1872
    T14_E = 2;  
1873
  } else {  
1874
  
1875
  }  
1876
  if (E_1 == 1) {  
1877
    E_1 = 2;  
1878
  } else {  
1879
  
1880
  }  
1881
  if (E_2 == 1) {  
1882
    E_2 = 2;  
1883
  } else {  
1884
  
1885
  }  
1886
  if (E_3 == 1) {  
1887
    E_3 = 2;  
1888
  } else {  
1889
  
1890
  }  
1891
  if (E_4 == 1) {  
1892
    E_4 = 2;  
1893
  } else {  
1894
  
1895
  }  
1896
  if (E_5 == 1) {  
1897
    E_5 = 2;  
1898
  } else {  
1899
  
1900
  }  
1901
  if (E_6 == 1) {  
1902
    E_6 = 2;  
1903
  } else {  
1904
  
1905
  }  
1906
  if (E_7 == 1) {  
1907
    E_7 = 2;  
1908
  } else {  
1909
  
1910
  }  
1911
  if (E_8 == 1) {  
1912
    E_8 = 2;  
1913
  } else {  
1914
  
1915
  }  
1916
  if (E_9 == 1) {  
1917
    E_9 = 2;  
1918
  } else {  
1919
  
1920
  }  
1921
  if (E_10 == 1) {  
1922
    E_10 = 2;  
1923
  } else {  
1924
  
1925
  }  
1926
  if (E_11 == 1) {  
1927
    E_11 = 2;  
1928
  } else {  
1929
  
1930
  }  
1931
  if (E_12 == 1) {  
1932
    E_12 = 2;  
1933
  } else {  
1934
  
1935
  }  
1936
  if (E_13 == 1) {  
1937
    E_13 = 2;  
1938
  } else {  
1939
  
1940
  }  
1941
  if (E_14 == 1) {  
1942
    E_14 = 2;  
1943
  } else {  
1944
  
1945
  }  
1946
  
1947
  return;  
1948
}  
1949
}  
1950
void init_model(void)   
1951
{   
1952
  
1953
  {  
1954
  m_i = 1;  
1955
  t1_i = 1;  
1956
  t2_i = 1;  
1957
  t3_i = 1;  
1958
  t4_i = 1;  
1959
  t5_i = 1;  
1960
  t6_i = 1;  
1961
  t7_i = 1;  
1962
  t8_i = 1;  
1963
  t9_i = 1;  
1964
  t10_i = 1;  
1965
  t11_i = 1;  
1966
  t12_i = 1;  
1967
  t13_i = 1;  
1968
  t14_i = 1;  
1969
  
1970
  return;  
1971
}  
1972
}  
1973
int stop_simulation(void)   
1974
{ int tmp ;  
1975
  int __retres2 ;  
1976
  
1977
  {  
1978
  {  
1979
  tmp = exists_runnable_thread();  
1980
  }  
1981
  if (tmp != 0) {  
1982
    __retres2 = 0;  
1983
    goto return_label;  
1984
  } else {  
1985
  
1986
  }  
1987
  __retres2 = 1;  
1988
  return_label: /* CIL Label */   
1989
  return (__retres2);  
1990
}  
1991
}  
1992
void start_simulation(void)   
1993
{ int kernel_st ;  
1994
  int tmp ;  
1995
  int tmp___0 ;  
1996
  
1997
  {  
1998
  {  
1999
  kernel_st = 0;  
2000
  update_channels();  
2001
  init_threads();  
2002
  fire_delta_events();  
2003
  activate_threads();  
2004
  reset_delta_events();  
2005
  }  
2006
  {  
2007
  while (1) {  
2008
    while_16_continue: /* CIL Label */ ;  
2009
    {  
2010
    kernel_st = 1;  
2011
    eval();  
2012
    }  
2013
    {  
2014
    kernel_st = 2;  
2015
    update_channels();  
2016
    }  
2017
    {  
2018
    kernel_st = 3;  
2019
    fire_delta_events();  
2020
    activate_threads();  
2021
    reset_delta_events();  
2022
    }  
2023
    {  
2024
    tmp = exists_runnable_thread();  
2025
    }  
2026
    if (tmp == 0) {  
2027
      {  
2028
      kernel_st = 4;  
2029
      fire_time_events();  
2030
      activate_threads();  
2031
      reset_time_events();  
2032
      }  
2033
    } else {  
2034
  
2035
    }  
2036
    {  
2037
    tmp___0 = stop_simulation();  
2038
    }  
2039
    if (tmp___0 != 0) {  
2040
      goto while_16_break;  
2041
    } else {  
2042
  
2043
    }  
2044
  }  
2045
  while_16_break: /* CIL Label */ ;  
2046
  }  
2047
  
2048
  return;  
2049
}  
2050
}  
2051
int main(void)   
2052
{initialize_reads(); int __retres1 ;  
2053
  
2054
  {  
2055
  {  
2056
  init_model();  
2057
  start_simulation();  
2058
  }  
2059
  __retres1 = 0;  
2060
  return (__retres1);  
2061
}  
2062
}  
2017-05-11 14:32:10:456	INFO	ResourceLimitChecker.fromConfiguration	Using the following resource limits: CPU-time limit of 900s

2017-05-11 14:32:10:582	INFO	CPAchecker.run	CPAchecker 1.6.1-svn (Java HotSpot(TM) 64-Bit Server VM 1.8.0_102) started

2017-05-11 14:32:14:409	INFO	CPAchecker.runAlgorithm	Starting analysis ...

2017-05-11 14:32:14:457	INFO	Parallel analysis 1:ResourceLimitChecker.fromConfiguration	Using the following resource limits: CPU-time limit of 900s

2017-05-11 14:32:14:499	INFO	Parallel analysis 2:ResourceLimitChecker.fromConfiguration	Using the following resource limits: CPU-time limit of 900s

2017-05-11 14:32:15:043	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:32:15:995	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:32:16:142	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:32:16:308	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:32:17:846	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:32:17:858	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:32:17:901	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:32:17:972	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:32:20:410	INFO	Parallel analysis 1:AbstractBMCAlgorithm.run	Creating formula for program

2017-05-11 14:32:24:543	INFO	Parallel analysis 1:AbstractBMCAlgorithm.boundedModelCheck	Starting satisfiability check...

2017-05-11 14:32:24:566	INFO	Parallel analysis 1:AbstractBMCAlgorithm.checkBoundingAssertions	Starting assertions check...

2017-05-11 14:32:25:197	INFO	Parallel analysis 1:KInductionProver.check	Running algorithm to create induction hypothesis

2017-05-11 14:32:52:286	INFO	Parallel analysis 2:InvariantsCPA:InvariantsCPA$InterestingVariableLimitAdjuster.adjustConditions	Adjusting interestingVariableLimit to 1

2017-05-11 14:32:52:287	INFO	Parallel analysis 2:ParallelAlgorithm.runParallelAnalysis	Adjusting precision for CPA org.sosy_lab.cpachecker.cpa.invariants.InvariantsCPA@2dc986f8

2017-05-11 14:32:52:287	INFO	Parallel analysis 2:ParallelAlgorithm.runParallelAnalysis	Updating reached set provided to other analyses

2017-05-11 14:33:02:490	INFO	Parallel analysis 2:InvariantsCPA:InvariantsCPA$InterestingVariableLimitAdjuster.adjustConditions	Adjusting interestingVariableLimit to 2

2017-05-11 14:33:02:491	INFO	Parallel analysis 2:ParallelAlgorithm.runParallelAnalysis	Adjusting precision for CPA org.sosy_lab.cpachecker.cpa.invariants.InvariantsCPA@2dc986f8

2017-05-11 14:33:02:491	INFO	Parallel analysis 2:ParallelAlgorithm.runParallelAnalysis	Updating reached set provided to other analyses

2017-05-11 14:33:12:817	INFO	Parallel analysis 2:InvariantsCPA:InvariantsCPA$InterestingVariableLimitAdjuster.adjustConditions	Adjusting interestingVariableLimit to 3

2017-05-11 14:33:12:817	INFO	Parallel analysis 2:ParallelAlgorithm.runParallelAnalysis	Adjusting precision for CPA org.sosy_lab.cpachecker.cpa.invariants.InvariantsCPA@2dc986f8

2017-05-11 14:33:12:817	INFO	Parallel analysis 2:ParallelAlgorithm.runParallelAnalysis	Updating reached set provided to other analyses

2017-05-11 14:33:21:380	INFO	Parallel analysis 2:InvariantsCPA:InvariantsCPA$InterestingVariableLimitAdjuster.adjustConditions	Adjusting interestingVariableLimit to 5

2017-05-11 14:33:21:380	INFO	Parallel analysis 2:ParallelAlgorithm.runParallelAnalysis	Adjusting precision for CPA org.sosy_lab.cpachecker.cpa.invariants.InvariantsCPA@2dc986f8

2017-05-11 14:33:21:380	INFO	Parallel analysis 2:ParallelAlgorithm.runParallelAnalysis	Updating reached set provided to other analyses

2017-05-11 14:33:27:771	INFO	Parallel analysis 2:InvariantsCPA:InvariantsCPA$InterestingVariableLimitAdjuster.adjustConditions	Adjusting interestingVariableLimit to 9

2017-05-11 14:33:27:773	INFO	Parallel analysis 2:ParallelAlgorithm.runParallelAnalysis	Adjusting precision for CPA org.sosy_lab.cpachecker.cpa.invariants.InvariantsCPA@2dc986f8

2017-05-11 14:33:27:773	INFO	Parallel analysis 2:ParallelAlgorithm.runParallelAnalysis	Updating reached set provided to other analyses

2017-05-11 14:33:35:609	INFO	Parallel analysis 1:KInductionProver.check	Starting induction check...

2017-05-11 14:33:36:855	INFO	Parallel analysis 2:InvariantsCPA:InvariantsCPA$InterestingVariableLimitAdjuster.adjustConditions	Adjusting interestingVariableLimit to 11

2017-05-11 14:33:36:857	INFO	Parallel analysis 2:ParallelAlgorithm.runParallelAnalysis	Adjusting precision for CPA org.sosy_lab.cpachecker.cpa.invariants.InvariantsCPA@2dc986f8

2017-05-11 14:33:36:857	INFO	Parallel analysis 2:ParallelAlgorithm.runParallelAnalysis	Updating reached set provided to other analyses

2017-05-11 14:34:09:335	INFO	Parallel analysis 2:InvariantsCPA:InvariantsCPA$FormulaDepthAdjuster.adjustConditions	Adjusting maximum formula depth to 2

2017-05-11 14:34:09:348	INFO	Parallel analysis 2:ParallelAlgorithm.runParallelAnalysis	Adjusting precision for CPA org.sosy_lab.cpachecker.cpa.invariants.InvariantsCPA@2dc986f8

2017-05-11 14:34:09:349	INFO	Parallel analysis 2:ParallelAlgorithm.runParallelAnalysis	Updating reached set provided to other analyses

2017-05-11 14:34:40:783	INFO	Parallel analysis 2:InvariantsCPA:InvariantsCPA$InterestingVariableLimitAdjuster.adjustConditions	Adjusting interestingVariableLimit to 15

2017-05-11 14:34:40:783	INFO	Parallel analysis 2:ParallelAlgorithm.runParallelAnalysis	Adjusting precision for CPA org.sosy_lab.cpachecker.cpa.invariants.InvariantsCPA@2dc986f8

2017-05-11 14:34:40:783	INFO	Parallel analysis 2:ParallelAlgorithm.runParallelAnalysis	Updating reached set provided to other analyses

2017-05-11 14:37:10:825	INFO	Parallel analysis 1:BoundsCPA:BoundsCPA.adjustPrecision	Adjusting maxLoopIterations to 2

2017-05-11 14:37:10:828	INFO	Parallel analysis 1:AbstractBMCAlgorithm.run	Creating formula for program

2017-05-11 14:37:12:416	INFO	Parallel analysis 1:AbstractBMCAlgorithm.boundedModelCheck	Starting satisfiability check...

2017-05-11 14:37:12:759	INFO	Parallel analysis 1:BMCAlgorithm.analyzeCounterexample	Error found, creating error path

2017-05-11 14:37:14:193	INFO	Parallel analysis 1:CounterexampleCheckAlgorithm.checkCounterexample	Error path found, starting counterexample check with CBMC.

2017-05-11 14:37:14:626	INFO	Parallel analysis 1:CounterexampleCheckAlgorithm.checkCounterexample	Error path found and confirmed by counterexample check with CBMC.

2017-05-11 14:37:14:626	INFO	Parallel analysis 1:CounterexampleCheckAlgorithm.checkCounterexample	Error path found, starting counterexample check with CBMC.

2017-05-11 14:37:15:543	INFO	Parallel analysis 1:CounterexampleCheckAlgorithm.checkCounterexample	Error path found but identified as infeasible.

2017-05-11 14:37:15:547	INFO	ParallelAlgorithm.handleFutureResults	/lustre/work/anon/anon/cfc/analyzers/cpachecker/config/components/kInduction/svcomp16-kInduction.properties finished successfully.

2017-05-11 14:37:15:554	INFO	Parallel analysis 2:ParallelAlgorithm.runParallelAnalysis	Analysis was terminated

2017-05-11 14:37:15:554	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:         662
  BDD entailment checks:           0
Number of SMT sat checks:          0
  trivial:                         0
  cached:                          0

Max ABE block size:                       712
Number of predicates discovered:          0

Time for post operator:                  3.189s
  Time for path formula creation:        3.160s
Time for strengthen operator:            0.054s
Time for prec operator:                  0.139s
  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.109s
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:                                 337964 (count: 5401, min: 0, max: 96, avg: 62.57)
Number of global variables:                          296239 (count: 5401, min: 0, max: 78, avg: 54.85)

ValueAnalysisPrecisionAdjustment statistics
-------------------------------------------
Number of abstraction computations:                    5732
Total time for liveness abstraction:                   0.000s
Total time for abstraction computation:                0.282s
Total time for path thresholds:                        0.000s
Number of tracked memory locations:                155

ValueAnalysisTransferRelation statistics
----------------------------------------
Number of Assumptions:                                 2134
Number of deterministic Assumptions:                   1456
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.013s
Automaton transfers with branching:                0
Automaton transfer successors:                         5732 (count: 5734, min: 0, max: 1, avg: 1.00) [0 x 2, 1 x 5732]

CPA algorithm statistics
------------------------
Number of iterations:            5403
Max size of waitlist:            15
Average size of waitlist:        4
Number of computed successors:   5732
Max successors for one state:    2
Number of times merged:          331
Number of times stopped:         331
Number of times breaked:         0

Total time for CPA algorithm:         5.684s (Max:     4.107s)
  Time for choose from waitlist:      0.007s
  Time for precision adjustment:      0.656s
  Time for transfer relation:         4.705s
  Time for merge operator:            0.171s
  Time for stop operator:             0.022s
  Time for adding to reached set:     0.029s

BMC algorithm statistics
------------------------
Time for BMC formula creation:           5.709s
Time for final sat check:                0.344s
Time for error path creation:            1.294s
Time for bounding assertions check:      0.021s
Time for induction formula creation:    70.364s
Time for induction check:              215.211s

Counterexample-Check Algorithm statistics
-----------------------------------------
Number of counterexample checks:    1
Number of infeasible paths:         1 (100%)
Time for counterexample checks:         1.350s
Time for running CBMC:                  1.203s


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.020s
  Time for transition matches:                         0.413s
  Time for transition assertions:                      0.000s
  Time for transition actions:                         0.000s
Automaton transfers with branching:                0
Automaton transfer successors:                       339461 (count: 339542, min: 0, max: 1, avg: 1.00) [0 x 81, 1 x 339461]

CPA algorithm statistics
------------------------
Number of iterations:            319555
Max size of waitlist:            254
Average size of waitlist:        65
Number of computed successors:   339461
Max successors for one state:    2
Number of times merged:          41026
Number of times stopped:         45406
Number of times breaked:         0

Total time for CPA algorithm:       295.479s (Max:   154.511s)
  Time for choose from waitlist:      0.261s
  Time for precision adjustment:      4.222s
  Time for transfer relation:        66.761s
  Time for merge operator:          207.295s
  Time for stop operator:            12.598s
  Time for adding to reached set:     2.242s


Other statistics
================

Code Coverage
-----------------------------
  Function coverage:      1.000
  Visited lines:          807
  Total lines:            915
  Line coverage:          0.882
  Visited conditions:     362
  Total conditions:       468
  Condition coverage:     0.774

CPAchecker general statistics
-----------------------------
Number of program locations:     1492
Number of CFA edges:             1808
Number of relevant variables:    173
Number of functions:             46
Number of loops:                 4
Size of reached set:             5401
  Number of reached locations:   1279 (86%)
    Avg states per location:     4
    Max states per location:     17 (at node N447)
  Number of reached functions:   46 (100%)
  Number of partitions:          5401
    Avg size of partitions:      1
    Max size of partitions:      1
  Number of target states:       2

Time for analysis setup:          3.796s
  Time for loading CPAs:          1.153s
  Time for loading parser:        0.721s
  Time for CFA construction:      1.820s
    Time for parsing file(s):     0.477s
    Time for AST to CFA:          0.559s
    Time for CFA sanity check:    0.180s
    Time for post-processing:     0.525s
      Time for var class.:        0.330s
    Time for CFA export:          1.274s
Time for Analysis:              301.140s
CPU time for analysis:          597.150s
Time for analyzing result:        0.003s
Total time for CPAchecker:      304.952s
Total CPU time for CPAchecker:  603.710s
Time for statistics:              6.006s

Time for Garbage Collector:      43.742s (in 292 runs)
Garbage Collector(s) used:    PS MarkSweep, PS Scavenge
Used heap memory:                951MB (   907 MiB) max;    478MB (   456 MiB) avg;   1033MB (   986 MiB) peak
Used non-heap memory:             51MB (    49 MiB) max;     48MB (    46 MiB) avg;     58MB (    55 MiB) peak
Used in PS Old Gen pool:         573MB (   546 MiB) max;    287MB (   273 MiB) avg;    576MB (   550 MiB) peak
Allocated heap memory:          1254MB (  1196 MiB) max;   1116MB (  1064 MiB) avg
Allocated non-heap memory:        54MB (    51 MiB) max;     52MB (    49 MiB) avg
Total process virtual memory:   6871MB (  6553 MiB) max;   6553MB (  6250 MiB) avg

    
analysis.programNames = /lustre/work/anon/anon/cfc/benchmarks/sv_subset_falsified_by_cpa_or_ua_transform/scripts/analysis_logs/transmitter.16_false-unreach-call_false-termination.cil/transmitter.16_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.16_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