Report for /lustre/work/anon/anon/cfc/benchmarks/sv_subset_falsified_by_cpa_or_ua_transform/scripts/analysis_logs/minepump_spec1_product52_false-unreach-call_false-termination.cil/minepump_spec1_product52_false-unreach-call_false-termination.cil.over.instr.c

Generated on 2017-05-11 19:56:15 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_417 = 6; int INPUTS_at_417[6]; int input_at_417_counter = 0;int num_of_inputs_at_435 = 4; int INPUTS_at_435[4]; int input_at_435_counter = 0;int num_of_inputs_at_407 = 6; int INPUTS_at_407[6]; int input_at_407_counter = 0;int num_of_inputs_at_427 = 6; int INPUTS_at_427[6]; int input_at_427_counter = 0;int initialize_reads() {  for (int instrumentation_index=0; instrumentation_index<6; instrumentation_index++) INPUTS_at_417[instrumentation_index] = __VERIFIER_nondet_int();  for (int instrumentation_index=0; instrumentation_index<4; instrumentation_index++) INPUTS_at_435[instrumentation_index] = __VERIFIER_nondet_int();  for (int instrumentation_index=0; instrumentation_index<6; instrumentation_index++) INPUTS_at_407[instrumentation_index] = __VERIFIER_nondet_int();  for (int instrumentation_index=0; instrumentation_index<6; instrumentation_index++) INPUTS_at_427[instrumentation_index] = __VERIFIER_nondet_int();}extern void __VERIFIER_assume(int);extern void __VERIFIER_error() __attribute__ ((__noreturn__));  
2
  
3
extern int __VERIFIER_nondet_int(void);  
4
//extern int printf (__const char *__restrict __format, ...);  
5
/* Generated by CIL v. 1.3.7 */  
6
/* print_CIL_Input is true */  
7
  
8
struct JoinPoint {  
9
   void **(*fp)(struct JoinPoint * ) ;  
10
   void **args ;  
11
   int argsCount ;  
12
   char const   **argsType ;  
13
   void *(*arg)(int  , struct JoinPoint * ) ;  
14
   char const   *(*argType)(int  , struct JoinPoint * ) ;  
15
   void **retValue ;  
16
   char const   *retType ;  
17
   char const   *funcName ;  
18
   char const   *targetName ;  
19
   char const   *fileName ;  
20
   char const   *kind ;  
21
   void *excep_return ;  
22
};  
23
struct __UTAC__CFLOW_FUNC {  
24
   int (*func)(int  , int  ) ;  
25
   int val ;  
26
   struct __UTAC__CFLOW_FUNC *next ;  
27
};  
28
struct __UTAC__EXCEPTION {  
29
   void *jumpbuf ;  
30
   unsigned long long prtValue ;  
31
   int pops ;  
32
   struct __UTAC__CFLOW_FUNC *cflowfuncs ;  
33
};  
34
typedef unsigned int size_t;  
35
struct __ACC__ERR {  
36
   void *v ;  
37
   struct __ACC__ERR *next ;  
38
};  
39
#pragma merger(0,"Environment.i","")  
40
void lowerWaterLevel(void) ;  
41
void waterRise(void) ;  
42
void changeMethaneLevel(void) ;  
43
int isMethaneLevelCritical(void) ;  
44
int getWaterLevel(void) ;  
45
void printEnvironment(void) ;  
46
int isHighWaterSensorDry(void) ;  
47
int isLowWaterSensorDry(void) ;  
48
int waterLevel  =    1;  
49
int methaneLevelCritical  =    0;  
50
void lowerWaterLevel(void)   
51
{   
52
  
53
  {  
54
  if (waterLevel > 0) {  
55
    waterLevel = waterLevel - 1;  
56
  } else {  
57
  
58
  }  
59
  return;  
60
}  
61
}  
62
void waterRise(void)   
63
{   
64
  
65
  {  
66
  if (waterLevel < 2) {  
67
    waterLevel = waterLevel + 1;  
68
  } else {  
69
  
70
  }  
71
  return;  
72
}  
73
}  
74
void changeMethaneLevel(void)   
75
{   
76
  
77
  {  
78
  if (methaneLevelCritical != 0) {  
79
    methaneLevelCritical = 0;  
80
  } else {  
81
    methaneLevelCritical = 1;  
82
  }  
83
  return;  
84
}  
85
}  
86
int isMethaneLevelCritical(void)   
87
{ int retValue_acc ;  
88
  
89
  {  
90
  retValue_acc = methaneLevelCritical;  
91
  return (retValue_acc);  
92
  return (retValue_acc);  
93
}  
94
}  
95
void printEnvironment(void)   
96
{   
97
  
98
  {  
99
  {  
100
//  printf("Env(Water:%i", waterLevel);  
101
//  printf(",Meth:");  
102
  }  
103
  if (methaneLevelCritical != 0) {  
104
    {  
105
//    printf("CRIT");  
106
    }  
107
  } else {  
108
    {  
109
//    printf("OK");  
110
    }  
111
  }  
112
  {  
113
//  printf(")");  
114
  }  
115
  return;  
116
}  
117
}  
118
int getWaterLevel(void)   
119
{ int retValue_acc ;  
120
  
121
  {  
122
  retValue_acc = waterLevel;  
123
  return (retValue_acc);  
124
  return (retValue_acc);  
125
}  
126
}  
127
int isHighWaterSensorDry(void)   
128
{ int retValue_acc ;  
129
  
130
  {  
131
  if (waterLevel < 2) {  
132
    retValue_acc = 1;  
133
    return (retValue_acc);  
134
  } else {  
135
    retValue_acc = 0;  
136
    return (retValue_acc);  
137
  }  
138
  return (retValue_acc);  
139
}  
140
}  
141
int isLowWaterSensorDry(void)   
142
{ int retValue_acc ;  
143
  
144
  {  
145
  retValue_acc = waterLevel == 0;  
146
  return (retValue_acc);  
147
  return (retValue_acc);  
148
}  
149
}  
150
#pragma merger(0,"MinePump.i","")  
151
void timeShift(void) ;  
152
void activatePump(void) ;  
153
void deactivatePump(void) ;  
154
int isPumpRunning(void) ;  
155
void printPump(void) ;  
156
void stopSystem(void) ;  
157
void startSystem(void) ;  
158
int pumpRunning  =    0;  
159
int systemActive  =    1;  
160
void __utac_acc__Specification1_spec__1(void) ;  
161
void processEnvironment(void) ;  
162
void timeShift(void)   
163
{   
164
  
165
  {  
166
  if (pumpRunning != 0) {  
167
    {  
168
    lowerWaterLevel();  
169
    }  
170
  } else {  
171
  
172
  }  
173
  if (systemActive != 0) {  
174
    {  
175
    processEnvironment();  
176
    }  
177
  } else {  
178
  
179
  }  
180
  {  
181
  __utac_acc__Specification1_spec__1();  
182
  }  
183
  return;  
184
}  
185
}  
186
void processEnvironment__wrappee__base(void)   
187
{   
188
  
189
  {  
190
  return;  
191
}  
192
}  
193
int isHighWaterLevel(void) ;  
194
void processEnvironment__wrappee__highWaterSensor(void)   
195
{ int tmp ;  
196
  
197
  {  
198
  if (! pumpRunning) {  
199
    {  
200
    tmp = isHighWaterLevel();  
201
    }  
202
    if (tmp != 0) {  
203
      {  
204
      activatePump();  
205
      }  
206
    } else {  
207
      {  
208
      processEnvironment__wrappee__base();  
209
      }  
210
    }  
211
  } else {  
212
    {  
213
    processEnvironment__wrappee__base();  
214
    }  
215
  }  
216
  return;  
217
}  
218
}  
219
int isLowWaterLevel(void) ;  
220
void processEnvironment(void)   
221
{ int tmp ;  
222
  
223
  {  
224
  if (pumpRunning != 0) {  
225
    {  
226
    tmp = isLowWaterLevel();  
227
    }  
228
    if (tmp != 0) {  
229
      {  
230
      deactivatePump();  
231
      }  
232
    } else {  
233
      {  
234
      processEnvironment__wrappee__highWaterSensor();  
235
      }  
236
    }  
237
  } else {  
238
    {  
239
    processEnvironment__wrappee__highWaterSensor();  
240
    }  
241
  }  
242
  return;  
243
}  
244
}  
245
void activatePump(void)   
246
{   
247
  
248
  {  
249
  pumpRunning = 1;  
250
  return;  
251
}  
252
}  
253
void deactivatePump(void)   
254
{   
255
  
256
  {  
257
  pumpRunning = 0;  
258
  return;  
259
}  
260
}  
261
int isMethaneAlarm(void)   
262
{ int retValue_acc ;  
263
  
264
  {  
265
  {  
266
  retValue_acc = isMethaneLevelCritical();  
267
  }  
268
  return (retValue_acc);  
269
  return (retValue_acc);  
270
}  
271
}  
272
int isPumpRunning(void)   
273
{ int retValue_acc ;  
274
  
275
  {  
276
  retValue_acc = pumpRunning;  
277
  return (retValue_acc);  
278
  return (retValue_acc);  
279
}  
280
}  
281
void printPump(void)   
282
{   
283
  
284
  {  
285
  {  
286
//  printf("Pump(System:");  
287
  }  
288
  if (systemActive != 0) {  
289
    {  
290
//    printf("On");  
291
    }  
292
  } else {  
293
    {  
294
//    printf("Off");  
295
    }  
296
  }  
297
  {  
298
//  printf(",Pump:");  
299
  }  
300
  if (pumpRunning != 0) {  
301
    {  
302
//    printf("On");  
303
    }  
304
  } else {  
305
    {  
306
//    printf("Off");  
307
    }  
308
  }  
309
  {  
310
//  printf(") ");  
311
  printEnvironment();  
312
//  printf("\n");  
313
  }  
314
  return;  
315
}  
316
}  
317
int isHighWaterLevel(void)   
318
{ int retValue_acc ;  
319
  int tmp ;  
320
  int tmp___0 ;  
321
  
322
  {  
323
  {  
324
  tmp = isHighWaterSensorDry();  
325
  }  
326
  if (tmp != 0) {  
327
    tmp___0 = 0;  
328
  } else {  
329
    tmp___0 = 1;  
330
  }  
331
  retValue_acc = tmp___0;  
332
  return (retValue_acc);  
333
  return (retValue_acc);  
334
}  
335
}  
336
int isLowWaterLevel(void)   
337
{ int retValue_acc ;  
338
  int tmp ;  
339
  int tmp___0 ;  
340
  
341
  {  
342
  {  
343
  tmp = isLowWaterSensorDry();  
344
  }  
345
  if (tmp != 0) {  
346
    tmp___0 = 0;  
347
  } else {  
348
    tmp___0 = 1;  
349
  }  
350
  retValue_acc = tmp___0;  
351
  return (retValue_acc);  
352
  return (retValue_acc);  
353
}  
354
}  
355
void stopSystem(void)   
356
{   
357
  
358
  {  
359
  if (pumpRunning != 0) {  
360
    {  
361
    deactivatePump();  
362
    }  
363
  } else {  
364
  
365
  }  
366
  systemActive = 0;  
367
  return;  
368
}  
369
}  
370
void startSystem(void)   
371
{   
372
  
373
  {  
374
  systemActive = 1;  
375
  return;  
376
}  
377
}  
378
#pragma merger(0,"wsllib_check.i","")  
379
void __automaton_fail(void)   
380
{   
381
  
382
  {  
383
  __VERIFIER_assume(!((0 != INPUTS_at_407[0] && 0 == INPUTS_at_427[0] && 0 == INPUTS_at_435[0])));__VERIFIER_assume(!((0 != INPUTS_at_427[0])));__VERIFIER_assume(!((0 == INPUTS_at_417[0] && 0 != INPUTS_at_427[1] && 0 == INPUTS_at_417[1] && 0 != INPUTS_at_435[0] && 0 == INPUTS_at_407[1])));__VERIFIER_assume(!((0 == INPUTS_at_417[0] && 0 != INPUTS_at_427[1] && 0 == INPUTS_at_417[1] && 0 != INPUTS_at_435[0])));__VERIFIER_assume(!((0 == INPUTS_at_427[1])));__VERIFIER_assume(!((0 == INPUTS_at_407[0])));__VERIFIER_assume(!((0 != INPUTS_at_407[3])));__VERIFIER_assume(!((0 != INPUTS_at_407[2] && 0 == INPUTS_at_407[5] && 0 == INPUTS_at_417[3] && 0 == INPUTS_at_407[3] && 0 == INPUTS_at_427[2] && 0 == INPUTS_at_417[2] && 0 == INPUTS_at_417[5] && 0 != INPUTS_at_427[5] && 0 == INPUTS_at_407[4] && 0 != INPUTS_at_435[2] && 0 == INPUTS_at_427[3] && 0 == INPUTS_at_427[4] && 0 == INPUTS_at_417[4] && 0 != INPUTS_at_427[1] && 0 != INPUTS_at_417[1] && 0 == INPUTS_at_435[1])));__VERIFIER_error();  
384
  return;  
385
}  
386
}  
387
#pragma merger(0,"scenario.i","")  
388
void cleanup(void) ;  
389
void test(void)   
390
{ int splverifierCounter ;  
391
  int tmp ;  
392
  int tmp___0 ;  
393
  int tmp___1 ;  
394
  int tmp___2 ;  
395
  
396
  {  
397
  splverifierCounter = 0;  
398
  {  
399
  while (1) {  
400
    while_0_continue: /* CIL Label */ ;  
401
    if (splverifierCounter < 4) {  
402
  
403
    } else {  
404
      goto while_0_break;  
405
    }  
406
    {  
407
    tmp = (input_at_407_counter < num_of_inputs_at_407) ? INPUTS_at_407[input_at_407_counter++] : __VERIFIER_nondet_int() ;  
408
    }  
409
    if (tmp != 0) {  
410
      {  
411
      waterRise();  
412
      }  
413
    } else {  
414
  
415
    }  
416
    {  
417
    tmp___0 = (input_at_417_counter < num_of_inputs_at_417) ? INPUTS_at_417[input_at_417_counter++] : __VERIFIER_nondet_int() ;  
418
    }  
419
    if (tmp___0 != 0) {  
420
      {  
421
      changeMethaneLevel();  
422
      }  
423
    } else {  
424
  
425
    }  
426
    {  
427
    tmp___2 = (input_at_427_counter < num_of_inputs_at_427) ? INPUTS_at_427[input_at_427_counter++] : __VERIFIER_nondet_int() ;  
428
    }  
429
    if (tmp___2 != 0) {  
430
      {  
431
      startSystem();  
432
      }  
433
    } else {  
434
      {  
435
      tmp___1 = (input_at_435_counter < num_of_inputs_at_435) ? INPUTS_at_435[input_at_435_counter++] : __VERIFIER_nondet_int() ;  
436
      }  
437
      if (tmp___1 != 0) {  
438
        {  
439
        stopSystem();  
440
        }  
441
      } else {  
442
  
443
      }  
444
    }  
445
    {  
446
    timeShift();  
447
    }  
448
  }  
449
  while_0_break: /* CIL Label */ ;  
450
  }  
451
  {  
452
  cleanup();  
453
  }  
454
  return;  
455
}  
456
}  
457
#pragma merger(0,"Test.i","")  
458
int cleanupTimeShifts  =    4;  
459
void cleanup(void)   
460
{ int i ;  
461
  int __cil_tmp2 ;  
462
  
463
  {  
464
  {  
465
  timeShift();  
466
  i = 0;  
467
  }  
468
  {  
469
  while (1) {  
470
    while_1_continue: /* CIL Label */ ;  
471
    {  
472
    __cil_tmp2 = cleanupTimeShifts - 1;  
473
    if (i < __cil_tmp2) {  
474
  
475
    } else {  
476
      goto while_1_break;  
477
    }  
478
    }  
479
    {  
480
    timeShift();  
481
    i = i + 1;  
482
    }  
483
  }  
484
  while_1_break: /* CIL Label */ ;  
485
  }  
486
  return;  
487
}  
488
}  
489
void Specification2(void)   
490
{   
491
  
492
  {  
493
  {  
494
  timeShift();  
495
  printPump();  
496
  timeShift();  
497
  printPump();  
498
  timeShift();  
499
  printPump();  
500
  waterRise();  
501
  printPump();  
502
  timeShift();  
503
  printPump();  
504
  changeMethaneLevel();  
505
  printPump();  
506
  timeShift();  
507
  printPump();  
508
  cleanup();  
509
  }  
510
  return;  
511
}  
512
}  
513
void setup(void)   
514
{   
515
  
516
  {  
517
  return;  
518
}  
519
}  
520
void runTest(void)   
521
{   
522
  
523
  {  
524
  {  
525
  test();  
526
  }  
527
  return;  
528
}  
529
}  
530
void select_helpers(void) ;  
531
void select_features(void) ;  
532
int valid_product(void) ;  
533
int main(void)   
534
{initialize_reads(); int retValue_acc ;  
535
  int tmp ;  
536
  
537
  {  
538
  {  
539
  select_helpers();  
540
  select_features();  
541
  tmp = valid_product();  
542
  }  
543
  if (tmp != 0) {  
544
    {  
545
    setup();  
546
    runTest();  
547
    }  
548
  } else {  
549
  
550
  }  
551
  retValue_acc = 0;  
552
  return (retValue_acc);  
553
  return (retValue_acc);  
554
}  
555
}  
556
#pragma merger(0,"Specification1_spec.i","")  
557
void __utac_acc__Specification1_spec__1(void)   
558
{ int tmp ;  
559
  int tmp___0 ;  
560
  
561
  {  
562
  {  
563
  tmp = isMethaneLevelCritical();  
564
  }  
565
  if (tmp != 0) {  
566
    {  
567
    tmp___0 = isPumpRunning();  
568
    }  
569
    if (tmp___0 != 0) {  
570
      {  
571
      __automaton_fail();  
572
      }  
573
    } else {  
574
  
575
    }  
576
  } else {  
577
  
578
  }  
579
  return;  
580
}  
581
}  
582
#pragma merger(0,"libacc.i","")  
583
extern  __attribute__((__nothrow__, __noreturn__)) void __assert_fail(char const   *__assertion ,  
584
                                                                      char const   *__file ,  
585
                                                                      unsigned int __line ,  
586
                                                                      char const   *__function ) ;  
587
extern  __attribute__((__nothrow__)) void *malloc(size_t __size )  __attribute__((__malloc__)) ;  
588
extern  __attribute__((__nothrow__)) void free(void *__ptr ) ;  
589
void __utac__exception__cf_handler_set(void *exception , int (*cflow_func)(int  ,  
590
                                                                           int  ) ,  
591
                                       int val )   
592
{ struct __UTAC__EXCEPTION *excep ;  
593
  struct __UTAC__CFLOW_FUNC *cf ;  
594
  void *tmp ;  
595
  unsigned long __cil_tmp7 ;  
596
  unsigned long __cil_tmp8 ;  
597
  unsigned long __cil_tmp9 ;  
598
  unsigned long __cil_tmp10 ;  
599
  unsigned long __cil_tmp11 ;  
600
  unsigned long __cil_tmp12 ;  
601
  unsigned long __cil_tmp13 ;  
602
  unsigned long __cil_tmp14 ;  
603
  int (**mem_15)(int  , int  ) ;  
604
  int *mem_16 ;  
605
  struct __UTAC__CFLOW_FUNC **mem_17 ;  
606
  struct __UTAC__CFLOW_FUNC **mem_18 ;  
607
  struct __UTAC__CFLOW_FUNC **mem_19 ;  
608
  
609
  {  
610
  {  
611
  excep = (struct __UTAC__EXCEPTION *)exception;  
612
  tmp = malloc(24UL);  
613
  cf = (struct __UTAC__CFLOW_FUNC *)tmp;  
614
  mem_15 = (int (**)(int  , int  ))cf;  
615
  *mem_15 = cflow_func;  
616
  __cil_tmp7 = (unsigned long )cf;  
617
  __cil_tmp8 = __cil_tmp7 + 8;  
618
  mem_16 = (int *)__cil_tmp8;  
619
  *mem_16 = val;  
620
  __cil_tmp9 = (unsigned long )cf;  
621
  __cil_tmp10 = __cil_tmp9 + 16;  
622
  __cil_tmp11 = (unsigned long )excep;  
623
  __cil_tmp12 = __cil_tmp11 + 24;  
624
  mem_17 = (struct __UTAC__CFLOW_FUNC **)__cil_tmp10;  
625
  mem_18 = (struct __UTAC__CFLOW_FUNC **)__cil_tmp12;  
626
  *mem_17 = *mem_18;  
627
  __cil_tmp13 = (unsigned long )excep;  
628
  __cil_tmp14 = __cil_tmp13 + 24;  
629
  mem_19 = (struct __UTAC__CFLOW_FUNC **)__cil_tmp14;  
630
  *mem_19 = cf;  
631
  }  
632
  return;  
633
}  
634
}  
635
void __utac__exception__cf_handler_free(void *exception )   
636
{ struct __UTAC__EXCEPTION *excep ;  
637
  struct __UTAC__CFLOW_FUNC *cf ;  
638
  struct __UTAC__CFLOW_FUNC *tmp ;  
639
  unsigned long __cil_tmp5 ;  
640
  unsigned long __cil_tmp6 ;  
641
  struct __UTAC__CFLOW_FUNC *__cil_tmp7 ;  
642
  unsigned long __cil_tmp8 ;  
643
  unsigned long __cil_tmp9 ;  
644
  unsigned long __cil_tmp10 ;  
645
  unsigned long __cil_tmp11 ;  
646
  void *__cil_tmp12 ;  
647
  unsigned long __cil_tmp13 ;  
648
  unsigned long __cil_tmp14 ;  
649
  struct __UTAC__CFLOW_FUNC **mem_15 ;  
650
  struct __UTAC__CFLOW_FUNC **mem_16 ;  
651
  struct __UTAC__CFLOW_FUNC **mem_17 ;  
652
  
653
  {  
654
  excep = (struct __UTAC__EXCEPTION *)exception;  
655
  __cil_tmp5 = (unsigned long )excep;  
656
  __cil_tmp6 = __cil_tmp5 + 24;  
657
  mem_15 = (struct __UTAC__CFLOW_FUNC **)__cil_tmp6;  
658
  cf = *mem_15;  
659
  {  
660
  while (1) {  
661
    while_2_continue: /* CIL Label */ ;  
662
    {  
663
    __cil_tmp7 = (struct __UTAC__CFLOW_FUNC *)0;  
664
    __cil_tmp8 = (unsigned long )__cil_tmp7;  
665
    __cil_tmp9 = (unsigned long )cf;  
666
    if (__cil_tmp9 != __cil_tmp8) {  
667
  
668
    } else {  
669
      goto while_2_break;  
670
    }  
671
    }  
672
    {  
673
    tmp = cf;  
674
    __cil_tmp10 = (unsigned long )cf;  
675
    __cil_tmp11 = __cil_tmp10 + 16;  
676
    mem_16 = (struct __UTAC__CFLOW_FUNC **)__cil_tmp11;  
677
    cf = *mem_16;  
678
    __cil_tmp12 = (void *)tmp;  
679
    free(__cil_tmp12);  
680
    }  
681
  }  
682
  while_2_break: /* CIL Label */ ;  
683
  }  
684
  __cil_tmp13 = (unsigned long )excep;  
685
  __cil_tmp14 = __cil_tmp13 + 24;  
686
  mem_17 = (struct __UTAC__CFLOW_FUNC **)__cil_tmp14;  
687
  *mem_17 = (struct __UTAC__CFLOW_FUNC *)0;  
688
  return;  
689
}  
690
}  
691
void __utac__exception__cf_handler_reset(void *exception )   
692
{ struct __UTAC__EXCEPTION *excep ;  
693
  struct __UTAC__CFLOW_FUNC *cf ;  
694
  unsigned long __cil_tmp5 ;  
695
  unsigned long __cil_tmp6 ;  
696
  struct __UTAC__CFLOW_FUNC *__cil_tmp7 ;  
697
  unsigned long __cil_tmp8 ;  
698
  unsigned long __cil_tmp9 ;  
699
  int (*__cil_tmp10)(int  , int  ) ;  
700
  unsigned long __cil_tmp11 ;  
701
  unsigned long __cil_tmp12 ;  
702
  int __cil_tmp13 ;  
703
  unsigned long __cil_tmp14 ;  
704
  unsigned long __cil_tmp15 ;  
705
  struct __UTAC__CFLOW_FUNC **mem_16 ;  
706
  int (**mem_17)(int  , int  ) ;  
707
  int *mem_18 ;  
708
  struct __UTAC__CFLOW_FUNC **mem_19 ;  
709
  
710
  {  
711
  excep = (struct __UTAC__EXCEPTION *)exception;  
712
  __cil_tmp5 = (unsigned long )excep;  
713
  __cil_tmp6 = __cil_tmp5 + 24;  
714
  mem_16 = (struct __UTAC__CFLOW_FUNC **)__cil_tmp6;  
715
  cf = *mem_16;  
716
  {  
717
  while (1) {  
718
    while_3_continue: /* CIL Label */ ;  
719
    {  
720
    __cil_tmp7 = (struct __UTAC__CFLOW_FUNC *)0;  
721
    __cil_tmp8 = (unsigned long )__cil_tmp7;  
722
    __cil_tmp9 = (unsigned long )cf;  
723
    if (__cil_tmp9 != __cil_tmp8) {  
724
  
725
    } else {  
726
      goto while_3_break;  
727
    }  
728
    }  
729
    {  
730
    mem_17 = (int (**)(int  , int  ))cf;  
731
    __cil_tmp10 = *mem_17;  
732
    __cil_tmp11 = (unsigned long )cf;  
733
    __cil_tmp12 = __cil_tmp11 + 8;  
734
    mem_18 = (int *)__cil_tmp12;  
735
    __cil_tmp13 = *mem_18;  
736
    (*__cil_tmp10)(4, __cil_tmp13);  
737
    __cil_tmp14 = (unsigned long )cf;  
738
    __cil_tmp15 = __cil_tmp14 + 16;  
739
    mem_19 = (struct __UTAC__CFLOW_FUNC **)__cil_tmp15;  
740
    cf = *mem_19;  
741
    }  
742
  }  
743
  while_3_break: /* CIL Label */ ;  
744
  }  
745
  {  
746
  __utac__exception__cf_handler_free(exception);  
747
  }  
748
  return;  
749
}  
750
}  
751
void *__utac__error_stack_mgt(void *env , int mode , int count ) ;  
752
static struct __ACC__ERR *head  =    (struct __ACC__ERR *)0;  
753
void *__utac__error_stack_mgt(void *env , int mode , int count )   
754
{ void *retValue_acc ;  
755
  struct __ACC__ERR *new ;  
756
  void *tmp ;  
757
  struct __ACC__ERR *temp ;  
758
  struct __ACC__ERR *next ;  
759
  void *excep ;  
760
  unsigned long __cil_tmp10 ;  
761
  unsigned long __cil_tmp11 ;  
762
  unsigned long __cil_tmp12 ;  
763
  unsigned long __cil_tmp13 ;  
764
  void *__cil_tmp14 ;  
765
  unsigned long __cil_tmp15 ;  
766
  unsigned long __cil_tmp16 ;  
767
  void *__cil_tmp17 ;  
768
  void **mem_18 ;  
769
  struct __ACC__ERR **mem_19 ;  
770
  struct __ACC__ERR **mem_20 ;  
771
  void **mem_21 ;  
772
  struct __ACC__ERR **mem_22 ;  
773
  void **mem_23 ;  
774
  void **mem_24 ;  
775
  
776
  {  
777
  if (count == 0) {  
778
    return (retValue_acc);  
779
  } else {  
780
  
781
  }  
782
  if (mode == 0) {  
783
    {  
784
    tmp = malloc(16UL);  
785
    new = (struct __ACC__ERR *)tmp;  
786
    mem_18 = (void **)new;  
787
    *mem_18 = env;  
788
    __cil_tmp10 = (unsigned long )new;  
789
    __cil_tmp11 = __cil_tmp10 + 8;  
790
    mem_19 = (struct __ACC__ERR **)__cil_tmp11;  
791
    *mem_19 = head;  
792
    head = new;  
793
    retValue_acc = (void *)new;  
794
    }  
795
    return (retValue_acc);  
796
  } else {  
797
  
798
  }  
799
  if (mode == 1) {  
800
    temp = head;  
801
    {  
802
    while (1) {  
803
      while_4_continue: /* CIL Label */ ;  
804
      if (count > 1) {  
805
  
806
      } else {  
807
        goto while_4_break;  
808
      }  
809
      {  
810
      __cil_tmp12 = (unsigned long )temp;  
811
      __cil_tmp13 = __cil_tmp12 + 8;  
812
      mem_20 = (struct __ACC__ERR **)__cil_tmp13;  
813
      next = *mem_20;  
814
      mem_21 = (void **)temp;  
815
      excep = *mem_21;  
816
      __cil_tmp14 = (void *)temp;  
817
      free(__cil_tmp14);  
818
      __utac__exception__cf_handler_reset(excep);  
819
      temp = next;  
820
      count = count - 1;  
821
      }  
822
    }  
823
    while_4_break: /* CIL Label */ ;  
824
    }  
825
    {  
826
    __cil_tmp15 = (unsigned long )temp;  
827
    __cil_tmp16 = __cil_tmp15 + 8;  
828
    mem_22 = (struct __ACC__ERR **)__cil_tmp16;  
829
    head = *mem_22;  
830
    mem_23 = (void **)temp;  
831
    excep = *mem_23;  
832
    __cil_tmp17 = (void *)temp;  
833
    free(__cil_tmp17);  
834
    __utac__exception__cf_handler_reset(excep);  
835
    retValue_acc = excep;  
836
    }  
837
    return (retValue_acc);  
838
  } else {  
839
  
840
  }  
841
  if (mode == 2) {  
842
    if (head != 0) {  
843
      mem_24 = (void **)head;  
844
      retValue_acc = *mem_24;  
845
      return (retValue_acc);  
846
    } else {  
847
      retValue_acc = (void *)0;  
848
      return (retValue_acc);  
849
    }  
850
  } else {  
851
  
852
  }  
853
  return (retValue_acc);  
854
}  
855
}  
856
void *__utac__get_this_arg(int i , struct JoinPoint *this )   
857
{ void *retValue_acc ;  
858
  unsigned long __cil_tmp4 ;  
859
  unsigned long __cil_tmp5 ;  
860
  int __cil_tmp6 ;  
861
  int __cil_tmp7 ;  
862
  unsigned long __cil_tmp8 ;  
863
  unsigned long __cil_tmp9 ;  
864
  void **__cil_tmp10 ;  
865
  void **__cil_tmp11 ;  
866
  int *mem_12 ;  
867
  void ***mem_13 ;  
868
  
869
  {  
870
  if (i > 0) {  
871
    {  
872
    __cil_tmp4 = (unsigned long )this;  
873
    __cil_tmp5 = __cil_tmp4 + 16;  
874
    mem_12 = (int *)__cil_tmp5;  
875
    __cil_tmp6 = *mem_12;  
876
    if (i <= __cil_tmp6) {  
877
  
878
    } else {  
879
      {  
880
      __assert_fail("i > 0 && i <= this->argsCount", "libacc.c",  
881
                    123U, "__utac__get_this_arg");  
882
      }  
883
    }  
884
    }  
885
  } else {  
886
    {  
887
    __assert_fail("i > 0 && i <= this->argsCount", "libacc.c",  
888
                  123U, "__utac__get_this_arg");  
889
    }  
890
  }  
891
  __cil_tmp7 = i - 1;  
892
  __cil_tmp8 = (unsigned long )this;  
893
  __cil_tmp9 = __cil_tmp8 + 8;  
894
  mem_13 = (void ***)__cil_tmp9;  
895
  __cil_tmp10 = *mem_13;  
896
  __cil_tmp11 = __cil_tmp10 + __cil_tmp7;  
897
  retValue_acc = *__cil_tmp11;  
898
  return (retValue_acc);  
899
  return (retValue_acc);  
900
}  
901
}  
902
char const   *__utac__get_this_argtype(int i , struct JoinPoint *this )   
903
{ char const   *retValue_acc ;  
904
  unsigned long __cil_tmp4 ;  
905
  unsigned long __cil_tmp5 ;  
906
  int __cil_tmp6 ;  
907
  int __cil_tmp7 ;  
908
  unsigned long __cil_tmp8 ;  
909
  unsigned long __cil_tmp9 ;  
910
  char const   **__cil_tmp10 ;  
911
  char const   **__cil_tmp11 ;  
912
  int *mem_12 ;  
913
  char const   ***mem_13 ;  
914
  
915
  {  
916
  if (i > 0) {  
917
    {  
918
    __cil_tmp4 = (unsigned long )this;  
919
    __cil_tmp5 = __cil_tmp4 + 16;  
920
    mem_12 = (int *)__cil_tmp5;  
921
    __cil_tmp6 = *mem_12;  
922
    if (i <= __cil_tmp6) {  
923
  
924
    } else {  
925
      {  
926
      __assert_fail("i > 0 && i <= this->argsCount", "libacc.c",  
927
                    131U, "__utac__get_this_argtype");  
928
      }  
929
    }  
930
    }  
931
  } else {  
932
    {  
933
    __assert_fail("i > 0 && i <= this->argsCount", "libacc.c",  
934
                  131U, "__utac__get_this_argtype");  
935
    }  
936
  }  
937
  __cil_tmp7 = i - 1;  
938
  __cil_tmp8 = (unsigned long )this;  
939
  __cil_tmp9 = __cil_tmp8 + 24;  
940
  mem_13 = (char const   ***)__cil_tmp9;  
941
  __cil_tmp10 = *mem_13;  
942
  __cil_tmp11 = __cil_tmp10 + __cil_tmp7;  
943
  retValue_acc = *__cil_tmp11;  
944
  return (retValue_acc);  
945
  return (retValue_acc);  
946
}  
947
}  
948
#pragma merger(0,"featureselect.i","")  
949
int select_one(void) ;  
950
int select_one(void)   
951
{ int retValue_acc ;  
952
  int choice = __VERIFIER_nondet_int();  
953
  
954
  {  
955
  retValue_acc = choice;  
956
  return (retValue_acc);  
957
  return (retValue_acc);  
958
}  
959
}  
960
void select_features(void)   
961
{   
962
  
963
  {  
964
  return;  
965
}  
966
}  
967
void select_helpers(void)   
968
{   
969
  
970
  {  
971
  return;  
972
}  
973
}  
974
int valid_product(void)   
975
{ int retValue_acc ;  
976
  
977
  {  
978
  retValue_acc = 1;  
979
  return (retValue_acc);  
980
  return (retValue_acc);  
981
}  
982
}  
2017-05-11 19:48:41:098	INFO	ResourceLimitChecker.fromConfiguration	Using the following resource limits: CPU-time limit of 900s

2017-05-11 19:48:41:226	INFO	CPAchecker.run	CPAchecker 1.6.1-svn (Java HotSpot(TM) 64-Bit Server VM 1.8.0_102) started

2017-05-11 19:48:43:246	INFO	CFACreationUtils.addEdgeToCFA	line 92: Dead code detected: return (retValue_acc);

2017-05-11 19:48:43:248	INFO	CFACreationUtils.addEdgeToCFA	line 124: Dead code detected: return (retValue_acc);

2017-05-11 19:48:43:252	INFO	CFACreationUtils.addEdgeToCFA	line 138: Dead code detected: return (retValue_acc);

2017-05-11 19:48:43:258	INFO	CFACreationUtils.addEdgeToCFA	line 147: Dead code detected: return (retValue_acc);

2017-05-11 19:48:43:288	INFO	CFACreationUtils.addEdgeToCFA	line 269: Dead code detected: return (retValue_acc);

2017-05-11 19:48:43:294	INFO	CFACreationUtils.addEdgeToCFA	line 278: Dead code detected: return (retValue_acc);

2017-05-11 19:48:43:299	INFO	CFACreationUtils.addEdgeToCFA	line 333: Dead code detected: return (retValue_acc);

2017-05-11 19:48:43:301	INFO	CFACreationUtils.addEdgeToCFA	line 352: Dead code detected: return (retValue_acc);

2017-05-11 19:48:43:396	INFO	CFACreationUtils.addEdgeToCFA	line 553: Dead code detected: return (retValue_acc);

2017-05-11 19:48:43:513	INFO	CFACreationUtils.addEdgeToCFA	line 899: Dead code detected: return (retValue_acc);

2017-05-11 19:48:43:520	INFO	CFACreationUtils.addEdgeToCFA	line 945: Dead code detected: return (retValue_acc);

2017-05-11 19:48:43:528	INFO	CFACreationUtils.addEdgeToCFA	line 957: Dead code detected: return (retValue_acc);

2017-05-11 19:48:43:530	INFO	CFACreationUtils.addEdgeToCFA	line 980: Dead code detected: return (retValue_acc);

2017-05-11 19:48:43:738	WARNING	CFunctionPointerResolver.replaceFunctionPointerCall	line 736: Function pointer *__cil_tmp10 with type int (*)(int, int) is called, but no possible target functions were found.

2017-05-11 19:48:45:367	INFO	CPAchecker.runAlgorithm	Starting analysis ...

2017-05-11 19:48:45:392	INFO	Parallel analysis 1:ResourceLimitChecker.fromConfiguration	Using the following resource limits: CPU-time limit of 900s

2017-05-11 19:48:45:431	INFO	Parallel analysis 2:ResourceLimitChecker.fromConfiguration	Using the following resource limits: CPU-time limit of 900s

2017-05-11 19:48:45:720	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 19:48:46:507	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 19:48:46:647	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 19:48:46:906	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 19:48:47:429	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 19:48:47:434	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 19:48:47:446	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 19:48:47:455	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 19:48:48:379	INFO	Parallel analysis 1:AbstractBMCAlgorithm.run	Creating formula for program

2017-05-11 19:48:53:235	INFO	Parallel analysis 1:AbstractBMCAlgorithm.boundedModelCheck	Starting satisfiability check...

2017-05-11 19:48:53:316	INFO	Parallel analysis 1:AbstractBMCAlgorithm.checkBoundingAssertions	Starting assertions check...

2017-05-11 19:48:53:845	INFO	Parallel analysis 1:KInductionProver.check	Running algorithm to create induction hypothesis

2017-05-11 19:48:54:636	INFO	Parallel analysis 2:InvariantsCPA:InvariantsCPA$InterestingVariableLimitAdjuster.adjustConditions	Adjusting interestingVariableLimit to 1

2017-05-11 19:48:54:637	INFO	Parallel analysis 2:ParallelAlgorithm.runParallelAnalysis	Adjusting precision for CPA org.sosy_lab.cpachecker.cpa.invariants.InvariantsCPA@711cb6a3

2017-05-11 19:48:54:640	INFO	Parallel analysis 2:ParallelAlgorithm.runParallelAnalysis	Updating reached set provided to other analyses

2017-05-11 19:49:00:301	INFO	Parallel analysis 2:InvariantsCPA:InvariantsCPA$InterestingVariableLimitAdjuster.adjustConditions	Adjusting interestingVariableLimit to 2

2017-05-11 19:49:00:315	INFO	Parallel analysis 2:ParallelAlgorithm.runParallelAnalysis	Adjusting precision for CPA org.sosy_lab.cpachecker.cpa.invariants.InvariantsCPA@711cb6a3

2017-05-11 19:49:00:318	INFO	Parallel analysis 2:ParallelAlgorithm.runParallelAnalysis	Updating reached set provided to other analyses

2017-05-11 19:49:02:678	INFO	Parallel analysis 2:InvariantsCPA:InvariantsCPA$InterestingVariableLimitAdjuster.adjustConditions	Adjusting interestingVariableLimit to 4

2017-05-11 19:49:02:680	INFO	Parallel analysis 2:ParallelAlgorithm.runParallelAnalysis	Adjusting precision for CPA org.sosy_lab.cpachecker.cpa.invariants.InvariantsCPA@711cb6a3

2017-05-11 19:49:02:680	INFO	Parallel analysis 2:ParallelAlgorithm.runParallelAnalysis	Updating reached set provided to other analyses

2017-05-11 19:49:05:547	INFO	Parallel analysis 2:InvariantsCPA:InvariantsCPA$InterestingVariableLimitAdjuster.adjustConditions	Adjusting interestingVariableLimit to 5

2017-05-11 19:49:05:547	INFO	Parallel analysis 2:ParallelAlgorithm.runParallelAnalysis	Adjusting precision for CPA org.sosy_lab.cpachecker.cpa.invariants.InvariantsCPA@711cb6a3

2017-05-11 19:49:05:547	INFO	Parallel analysis 2:ParallelAlgorithm.runParallelAnalysis	Updating reached set provided to other analyses

2017-05-11 19:49:07:397	INFO	Parallel analysis 2:InvariantsCPA:InvariantsCPA$FormulaDepthAdjuster.adjustConditions	Adjusting maximum formula depth to 3

2017-05-11 19:49:07:397	INFO	Parallel analysis 2:ParallelAlgorithm.runParallelAnalysis	Adjusting precision for CPA org.sosy_lab.cpachecker.cpa.invariants.InvariantsCPA@711cb6a3

2017-05-11 19:49:07:398	INFO	Parallel analysis 2:ParallelAlgorithm.runParallelAnalysis	Updating reached set provided to other analyses

2017-05-11 19:49:08:387	INFO	Parallel analysis 2:InvariantsCPA:InvariantsCPA$InterestingVariableLimitAdjuster.adjustConditions	Adjusting interestingVariableLimit to 7

2017-05-11 19:49:08:387	INFO	Parallel analysis 2:ParallelAlgorithm.runParallelAnalysis	Adjusting precision for CPA org.sosy_lab.cpachecker.cpa.invariants.InvariantsCPA@711cb6a3

2017-05-11 19:49:08:388	INFO	Parallel analysis 2:ParallelAlgorithm.runParallelAnalysis	Updating reached set provided to other analyses

2017-05-11 19:49:09:475	INFO	Parallel analysis 2:InvariantsCPA:InvariantsCPA$InterestingVariableLimitAdjuster.adjustConditions	Adjusting interestingVariableLimit to 8

2017-05-11 19:49:09:476	INFO	Parallel analysis 2:ParallelAlgorithm.runParallelAnalysis	Adjusting precision for CPA org.sosy_lab.cpachecker.cpa.invariants.InvariantsCPA@711cb6a3

2017-05-11 19:49:09:476	INFO	Parallel analysis 2:ParallelAlgorithm.runParallelAnalysis	Updating reached set provided to other analyses

2017-05-11 19:49:10:613	INFO	Parallel analysis 2:InvariantsCPA:InvariantsCPA$InterestingVariableLimitAdjuster.adjustConditions	Adjusting interestingVariableLimit to 9

2017-05-11 19:49:10:613	INFO	Parallel analysis 2:ParallelAlgorithm.runParallelAnalysis	Adjusting precision for CPA org.sosy_lab.cpachecker.cpa.invariants.InvariantsCPA@711cb6a3

2017-05-11 19:49:10:614	INFO	Parallel analysis 2:ParallelAlgorithm.runParallelAnalysis	Updating reached set provided to other analyses

2017-05-11 19:49:11:693	INFO	Parallel analysis 2:InvariantsCPA:InvariantsCPA$InterestingVariableLimitAdjuster.adjustConditions	Adjusting interestingVariableLimit to 11

2017-05-11 19:49:11:699	INFO	Parallel analysis 2:ParallelAlgorithm.runParallelAnalysis	Adjusting precision for CPA org.sosy_lab.cpachecker.cpa.invariants.InvariantsCPA@711cb6a3

2017-05-11 19:49:11:699	INFO	Parallel analysis 2:ParallelAlgorithm.runParallelAnalysis	Updating reached set provided to other analyses

2017-05-11 19:49:12:466	INFO	Parallel analysis 2:InvariantsCPA:InvariantsCPA$InterestingVariableLimitAdjuster.adjustConditions	Adjusting interestingVariableLimit to 15

2017-05-11 19:49:12:467	INFO	Parallel analysis 2:ParallelAlgorithm.runParallelAnalysis	Adjusting precision for CPA org.sosy_lab.cpachecker.cpa.invariants.InvariantsCPA@711cb6a3

2017-05-11 19:49:12:467	INFO	Parallel analysis 2:ParallelAlgorithm.runParallelAnalysis	Updating reached set provided to other analyses

2017-05-11 19:49:12:585	INFO	Parallel analysis 1:KInductionProver.check	Starting induction check...

2017-05-11 19:49:13:221	INFO	Parallel analysis 2:InvariantsCPA:InvariantsCPA$InterestingVariableLimitAdjuster.adjustConditions	Adjusting interestingVariableLimit to 23

2017-05-11 19:49:13:222	INFO	Parallel analysis 2:ParallelAlgorithm.runParallelAnalysis	Adjusting precision for CPA org.sosy_lab.cpachecker.cpa.invariants.InvariantsCPA@711cb6a3

2017-05-11 19:49:13:222	INFO	Parallel analysis 2:ParallelAlgorithm.runParallelAnalysis	Updating reached set provided to other analyses

2017-05-11 19:49:13:979	INFO	Parallel analysis 2:InvariantsCPA:InvariantsCPA$InterestingVariableLimitAdjuster.adjustConditions	Adjusting interestingVariableLimit to 27

2017-05-11 19:49:13:988	INFO	Parallel analysis 2:ParallelAlgorithm.runParallelAnalysis	Adjusting precision for CPA org.sosy_lab.cpachecker.cpa.invariants.InvariantsCPA@711cb6a3

2017-05-11 19:49:13:988	INFO	Parallel analysis 2:ParallelAlgorithm.runParallelAnalysis	Updating reached set provided to other analyses

2017-05-11 19:49:14:858	INFO	Parallel analysis 2:InvariantsCPA:InvariantsCPA$InterestingVariableLimitAdjuster.adjustConditions	Adjusting interestingVariableLimit to 29

2017-05-11 19:49:14:859	INFO	Parallel analysis 2:ParallelAlgorithm.runParallelAnalysis	Adjusting precision for CPA org.sosy_lab.cpachecker.cpa.invariants.InvariantsCPA@711cb6a3

2017-05-11 19:49:14:859	INFO	Parallel analysis 2:ParallelAlgorithm.runParallelAnalysis	Updating reached set provided to other analyses

2017-05-11 19:49:16:747	INFO	Parallel analysis 1:BoundsCPA:BoundsCPA.adjustPrecision	Adjusting maxLoopIterations to 2

2017-05-11 19:49:16:748	INFO	Parallel analysis 1:AbstractBMCAlgorithm.run	Creating formula for program

2017-05-11 19:49:16:760	INFO	Parallel analysis 1:AbstractBMCAlgorithm.boundedModelCheck	Starting satisfiability check...

2017-05-11 19:49:16:776	INFO	Parallel analysis 1:AbstractBMCAlgorithm.checkBoundingAssertions	Starting assertions check...

2017-05-11 19:49:16:852	INFO	Parallel analysis 1:KInductionProver.check	Running algorithm to create induction hypothesis

2017-05-11 19:49:17:223	INFO	Parallel analysis 2:InvariantsCPA:InvariantsCPA$InterestingVariableLimitAdjuster.adjustConditions	Adjusting interestingVariableLimit to 30

2017-05-11 19:49:17:223	INFO	Parallel analysis 2:ParallelAlgorithm.runParallelAnalysis	Adjusting precision for CPA org.sosy_lab.cpachecker.cpa.invariants.InvariantsCPA@711cb6a3

2017-05-11 19:49:17:223	INFO	Parallel analysis 2:ParallelAlgorithm.runParallelAnalysis	Updating reached set provided to other analyses

2017-05-11 19:49:20:042	INFO	Parallel analysis 2:InvariantsCPA:InvariantsCPA$InterestingVariableLimitAdjuster.adjustConditions	Adjusting interestingVariableLimit to 31

2017-05-11 19:49:20:048	INFO	Parallel analysis 2:ParallelAlgorithm.runParallelAnalysis	Adjusting precision for CPA org.sosy_lab.cpachecker.cpa.invariants.InvariantsCPA@711cb6a3

2017-05-11 19:49:20:048	INFO	Parallel analysis 2:ParallelAlgorithm.runParallelAnalysis	Updating reached set provided to other analyses

2017-05-11 19:49:22:775	INFO	Parallel analysis 2:InvariantsCPA:InvariantsCPA$InterestingVariableLimitAdjuster.adjustConditions	Adjusting interestingVariableLimit to 33

2017-05-11 19:49:22:775	INFO	Parallel analysis 2:ParallelAlgorithm.runParallelAnalysis	Adjusting precision for CPA org.sosy_lab.cpachecker.cpa.invariants.InvariantsCPA@711cb6a3

2017-05-11 19:49:22:775	INFO	Parallel analysis 2:ParallelAlgorithm.runParallelAnalysis	Updating reached set provided to other analyses

2017-05-11 19:49:24:537	INFO	Parallel analysis 2:InvariantsCPA:InvariantsCPA$InterestingVariableLimitAdjuster.adjustConditions	Adjusting interestingVariableLimit to 37

2017-05-11 19:49:24:540	INFO	Parallel analysis 2:ParallelAlgorithm.runParallelAnalysis	Adjusting precision for CPA org.sosy_lab.cpachecker.cpa.invariants.InvariantsCPA@711cb6a3

2017-05-11 19:49:24:540	INFO	Parallel analysis 2:ParallelAlgorithm.runParallelAnalysis	Updating reached set provided to other analyses

2017-05-11 19:49:25:455	INFO	Parallel analysis 1:KInductionProver.check	Starting induction check...

2017-05-11 19:49:32:198	INFO	Parallel analysis 2:InvariantsCPA:InvariantsCPA$InterestingVariableLimitAdjuster.adjustConditions	Adjusting interestingVariableLimit to 39

2017-05-11 19:49:32:199	INFO	Parallel analysis 2:ParallelAlgorithm.runParallelAnalysis	Adjusting precision for CPA org.sosy_lab.cpachecker.cpa.invariants.InvariantsCPA@711cb6a3

2017-05-11 19:49:32:199	INFO	Parallel analysis 2:ParallelAlgorithm.runParallelAnalysis	Updating reached set provided to other analyses

2017-05-11 19:49:38:524	INFO	Parallel analysis 2:InvariantsCPA:InvariantsCPA$InterestingVariableLimitAdjuster.adjustConditions	Adjusting interestingVariableLimit to 43

2017-05-11 19:49:38:525	INFO	Parallel analysis 2:ParallelAlgorithm.runParallelAnalysis	Adjusting precision for CPA org.sosy_lab.cpachecker.cpa.invariants.InvariantsCPA@711cb6a3

2017-05-11 19:49:38:525	INFO	Parallel analysis 2:ParallelAlgorithm.runParallelAnalysis	Updating reached set provided to other analyses

2017-05-11 19:49:44:825	INFO	Parallel analysis 2:InvariantsCPA:InvariantsCPA$InterestingVariableLimitAdjuster.adjustConditions	Adjusting interestingVariableLimit to 51

2017-05-11 19:49:44:826	INFO	Parallel analysis 2:ParallelAlgorithm.runParallelAnalysis	Adjusting precision for CPA org.sosy_lab.cpachecker.cpa.invariants.InvariantsCPA@711cb6a3

2017-05-11 19:49:44:826	INFO	Parallel analysis 2:ParallelAlgorithm.runParallelAnalysis	Updating reached set provided to other analyses

2017-05-11 19:49:51:360	INFO	Parallel analysis 2:InvariantsCPA:InvariantsCPA$InterestingVariableLimitAdjuster.adjustConditions	Adjusting interestingVariableLimit to 55

2017-05-11 19:49:51:361	INFO	Parallel analysis 2:ParallelAlgorithm.runParallelAnalysis	Adjusting precision for CPA org.sosy_lab.cpachecker.cpa.invariants.InvariantsCPA@711cb6a3

2017-05-11 19:49:51:363	INFO	Parallel analysis 2:ParallelAlgorithm.runParallelAnalysis	Updating reached set provided to other analyses

2017-05-11 19:49:59:746	INFO	Parallel analysis 1:BoundsCPA:BoundsCPA.adjustPrecision	Adjusting maxLoopIterations to 3

2017-05-11 19:49:59:748	INFO	Parallel analysis 1:AbstractBMCAlgorithm.run	Creating formula for program

2017-05-11 19:49:59:758	INFO	Parallel analysis 1:AbstractBMCAlgorithm.boundedModelCheck	Starting satisfiability check...

2017-05-11 19:49:59:759	INFO	Parallel analysis 1:AbstractBMCAlgorithm.checkBoundingAssertions	Starting assertions check...

2017-05-11 19:49:59:819	INFO	Parallel analysis 1:KInductionProver.check	Running algorithm to create induction hypothesis

2017-05-11 19:50:05:558	INFO	Parallel analysis 1:KInductionProver.check	Starting induction check...

2017-05-11 19:50:07:079	INFO	Parallel analysis 2:InvariantsCPA:InvariantsCPA$InterestingVariableLimitAdjuster.adjustConditions	Adjusting interestingVariableLimit to 57

2017-05-11 19:50:07:080	INFO	Parallel analysis 2:ParallelAlgorithm.runParallelAnalysis	Adjusting precision for CPA org.sosy_lab.cpachecker.cpa.invariants.InvariantsCPA@711cb6a3

2017-05-11 19:50:07:080	INFO	Parallel analysis 2:ParallelAlgorithm.runParallelAnalysis	Updating reached set provided to other analyses

2017-05-11 19:50:22:681	INFO	Parallel analysis 1:BoundsCPA:BoundsCPA.adjustPrecision	Adjusting maxLoopIterations to 4

2017-05-11 19:50:22:681	INFO	Parallel analysis 1:AbstractBMCAlgorithm.run	Creating formula for program

2017-05-11 19:50:22:689	INFO	Parallel analysis 1:AbstractBMCAlgorithm.boundedModelCheck	Starting satisfiability check...

2017-05-11 19:50:22:690	INFO	Parallel analysis 1:AbstractBMCAlgorithm.checkBoundingAssertions	Starting assertions check...

2017-05-11 19:50:22:764	INFO	Parallel analysis 1:KInductionProver.check	Running algorithm to create induction hypothesis

2017-05-11 19:50:22:824	INFO	Parallel analysis 2:InvariantsCPA:InvariantsCPA$InterestingVariableLimitAdjuster.adjustConditions	Adjusting interestingVariableLimit to 58

2017-05-11 19:50:22:824	INFO	Parallel analysis 2:ParallelAlgorithm.runParallelAnalysis	Adjusting precision for CPA org.sosy_lab.cpachecker.cpa.invariants.InvariantsCPA@711cb6a3

2017-05-11 19:50:22:824	INFO	Parallel analysis 2:ParallelAlgorithm.runParallelAnalysis	Updating reached set provided to other analyses

2017-05-11 19:50:31:454	INFO	Parallel analysis 1:KInductionProver.check	Starting induction check...

2017-05-11 19:50:40:279	INFO	Parallel analysis 2:InvariantsCPA:InvariantsCPA$InterestingVariableLimitAdjuster.adjustConditions	Adjusting interestingVariableLimit to 59

2017-05-11 19:50:40:279	INFO	Parallel analysis 2:ParallelAlgorithm.runParallelAnalysis	Adjusting precision for CPA org.sosy_lab.cpachecker.cpa.invariants.InvariantsCPA@711cb6a3

2017-05-11 19:50:40:281	INFO	Parallel analysis 2:ParallelAlgorithm.runParallelAnalysis	Updating reached set provided to other analyses

2017-05-11 19:51:04:210	INFO	Parallel analysis 1:BoundsCPA:BoundsCPA.adjustPrecision	Adjusting maxLoopIterations to 5

2017-05-11 19:51:04:211	INFO	Parallel analysis 1:AbstractBMCAlgorithm.run	Creating formula for program

2017-05-11 19:51:04:220	INFO	Parallel analysis 1:AbstractBMCAlgorithm.boundedModelCheck	Starting satisfiability check...

2017-05-11 19:51:04:221	INFO	Parallel analysis 1:AbstractBMCAlgorithm.checkBoundingAssertions	Starting assertions check...

2017-05-11 19:51:04:318	INFO	Parallel analysis 1:KInductionProver.check	Running algorithm to create induction hypothesis

2017-05-11 19:51:12:617	INFO	Parallel analysis 1:KInductionProver.check	Starting induction check...

2017-05-11 19:51:20:147	INFO	Parallel analysis 2:InvariantsCPA:InvariantsCPA$InterestingVariableLimitAdjuster.adjustConditions	Adjusting interestingVariableLimit to 60

2017-05-11 19:51:20:147	INFO	Parallel analysis 2:ParallelAlgorithm.runParallelAnalysis	Adjusting precision for CPA org.sosy_lab.cpachecker.cpa.invariants.InvariantsCPA@711cb6a3

2017-05-11 19:51:20:147	INFO	Parallel analysis 2:ParallelAlgorithm.runParallelAnalysis	Updating reached set provided to other analyses

2017-05-11 19:51:45:288	INFO	Parallel analysis 1:BoundsCPA:BoundsCPA.adjustPrecision	Adjusting maxLoopIterations to 6

2017-05-11 19:51:45:289	INFO	Parallel analysis 1:AbstractBMCAlgorithm.run	Creating formula for program

2017-05-11 19:51:45:297	INFO	Parallel analysis 1:AbstractBMCAlgorithm.boundedModelCheck	Starting satisfiability check...

2017-05-11 19:51:45:298	INFO	Parallel analysis 1:AbstractBMCAlgorithm.checkBoundingAssertions	Starting assertions check...

2017-05-11 19:51:45:397	INFO	Parallel analysis 1:KInductionProver.check	Running algorithm to create induction hypothesis

2017-05-11 19:52:02:044	INFO	Parallel analysis 2:InvariantsCPA:InvariantsCPA$InterestingVariableLimitAdjuster.adjustConditions	Adjusting interestingVariableLimit to 61

2017-05-11 19:52:02:045	INFO	Parallel analysis 2:ParallelAlgorithm.runParallelAnalysis	Adjusting precision for CPA org.sosy_lab.cpachecker.cpa.invariants.InvariantsCPA@711cb6a3

2017-05-11 19:52:02:045	INFO	Parallel analysis 2:ParallelAlgorithm.runParallelAnalysis	Updating reached set provided to other analyses

2017-05-11 19:52:11:423	INFO	Parallel analysis 1:KInductionProver.check	Starting induction check...

2017-05-11 19:52:40:915	INFO	Parallel analysis 2:InvariantsCPA:InvariantsCPA$InterestingVariableLimitAdjuster.adjustConditions	Adjusting interestingVariableLimit to 63

2017-05-11 19:52:40:916	INFO	Parallel analysis 2:ParallelAlgorithm.runParallelAnalysis	Adjusting precision for CPA org.sosy_lab.cpachecker.cpa.invariants.InvariantsCPA@711cb6a3

2017-05-11 19:52:40:916	INFO	Parallel analysis 2:ParallelAlgorithm.runParallelAnalysis	Updating reached set provided to other analyses

2017-05-11 19:53:19:828	INFO	Parallel analysis 2:InvariantsCPA:InvariantsCPA$InterestingVariableLimitAdjuster.adjustConditions	Adjusting interestingVariableLimit to 64

2017-05-11 19:53:19:829	INFO	Parallel analysis 2:ParallelAlgorithm.runParallelAnalysis	Adjusting precision for CPA org.sosy_lab.cpachecker.cpa.invariants.InvariantsCPA@711cb6a3

2017-05-11 19:53:19:829	INFO	Parallel analysis 2:ParallelAlgorithm.runParallelAnalysis	Updating reached set provided to other analyses

2017-05-11 19:53:58:884	INFO	Parallel analysis 2:InvariantsCPA:InvariantsCPA$InterestingVariableLimitAdjuster.adjustConditions	Adjusting interestingVariableLimit to 65

2017-05-11 19:53:58:885	INFO	Parallel analysis 2:ParallelAlgorithm.runParallelAnalysis	Adjusting precision for CPA org.sosy_lab.cpachecker.cpa.invariants.InvariantsCPA@711cb6a3

2017-05-11 19:53:58:885	INFO	Parallel analysis 2:ParallelAlgorithm.runParallelAnalysis	Updating reached set provided to other analyses

2017-05-11 19:54:56:720	INFO	Parallel analysis 2:InvariantsCPA:InvariantsCPA$InterestingVariableLimitAdjuster.adjustConditions	Adjusting interestingVariableLimit to 66

2017-05-11 19:54:56:720	INFO	Parallel analysis 2:ParallelAlgorithm.runParallelAnalysis	Adjusting precision for CPA org.sosy_lab.cpachecker.cpa.invariants.InvariantsCPA@711cb6a3

2017-05-11 19:54:56:721	INFO	Parallel analysis 2:ParallelAlgorithm.runParallelAnalysis	Updating reached set provided to other analyses

2017-05-11 19:55:56:748	INFO	Parallel analysis 2:InvariantsCPA:InvariantsCPA$InterestingVariableLimitAdjuster.adjustConditions	Adjusting interestingVariableLimit to 67

2017-05-11 19:55:56:749	INFO	Parallel analysis 2:ParallelAlgorithm.runParallelAnalysis	Adjusting precision for CPA org.sosy_lab.cpachecker.cpa.invariants.InvariantsCPA@711cb6a3

2017-05-11 19:55:56:749	INFO	Parallel analysis 2:ParallelAlgorithm.runParallelAnalysis	Updating reached set provided to other analyses

2017-05-11 19:56:14:963	WARNING	ForceTerminationOnShutdown$1.shutdownRequested	Shutdown requested (The CPU-time limit of 900s has elapsed.), waiting for termination.

2017-05-11 19:56:14:963	WARNING	AbstractFuture.get	Warning: Analysis interrupted

2017-05-11 19:56:14:975	INFO	Parallel analysis 2:ParallelAlgorithm.runParallelAnalysis	Analysis was terminated

    
Parallel Algorithm statistics
-----------------------------
Number of algorithms used:        2


Statistics for: /lustre/work/anon/anon/cfc/analyzers/cpachecker/config/components/kInduction/svcomp16-kInduction.properties
===================================================================================================================================
Cannot print statistics for this analysis because it is still running.


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.586s
  Time for transition matches:                         0.729s
  Time for transition assertions:                      0.000s
  Time for transition actions:                         0.001s
Automaton transfers with branching:                0
Automaton transfer successors:                       389312 (count: 390119, min: 0, max: 1, avg: 1.00) [0 x 807, 1 x 389312]

CPA algorithm statistics
------------------------
Number of iterations:            356812
Max size of waitlist:            280
Average size of waitlist:        113
Number of computed successors:   389312
Max successors for one state:    2
Number of times merged:          76443
Number of times stopped:         82593
Number of times breaked:         0

Total time for CPA algorithm:       443.602s (Max:    59.996s)
  Time for choose from waitlist:      0.384s
  Time for precision adjustment:      4.967s
  Time for transfer relation:        58.242s
  Time for merge operator:          353.083s
  Time for stop operator:            23.149s
  Time for adding to reached set:     1.776s


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

Code Coverage
-----------------------------
  Function coverage:      0.025
  Visited lines:          0
  Total lines:            434
  Line coverage:          0.000
  Visited conditions:     0
  Total conditions:       162
  Condition coverage:     0.000

CPAchecker general statistics
-----------------------------
Number of program locations:     749
Number of CFA edges:             886
Number of relevant variables:    151
Number of functions:             40
Number of loops:                 9
Size of reached set:             1
  Number of reached locations:   1 (0%)
    Avg states per location:     1
    Max states per location:     1 (at node N387)
  Number of reached functions:   1 (3%)
  Number of partitions:          1
    Avg size of partitions:      1
    Max size of partitions:      1
  Number of target states:       0
  Size of final wait list        1

Time for analysis setup:          4.104s
  Time for loading CPAs:          1.130s
  Time for loading parser:        0.789s
  Time for CFA construction:      2.075s
    Time for parsing file(s):     0.480s
    Time for AST to CFA:          0.840s
    Time for CFA sanity check:    0.148s
    Time for post-processing:     0.526s
      Time for var class.:        0.277s
    Time for CFA export:          0.965s
Time for Analysis:              449.593s
CPU time for analysis:          893.430s
Total time for CPAchecker:      453.714s
Total CPU time for CPAchecker:  900.180s
Time for statistics:              0.072s

Time for Garbage Collector:      54.083s (in 364 runs)
Garbage Collector(s) used:    PS MarkSweep, PS Scavenge
Used heap memory:                972MB (   927 MiB) max;    496MB (   473 MiB) avg;   1002MB (   956 MiB) peak
Used non-heap memory:             52MB (    50 MiB) max;     51MB (    48 MiB) avg;     52MB (    50 MiB) peak
Used in PS Old Gen pool:         564MB (   538 MiB) max;    300MB (   286 MiB) avg;    566MB (   539 MiB) peak
Allocated heap memory:          1255MB (  1197 MiB) max;    992MB (   946 MiB) avg
Allocated non-heap memory:        55MB (    52 MiB) max;     54MB (    51 MiB) avg
Total process virtual memory:   6989MB (  6665 MiB) max;   6737MB (  6425 MiB) avg

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