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

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

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

2017-05-11 14:57:26:500	INFO	CFACreationUtils.addEdgeToCFA	line 60: Dead code detected: return (retValue_acc);

2017-05-11 14:57:26:502	INFO	CFACreationUtils.addEdgeToCFA	line 83: Dead code detected: return (retValue_acc);

2017-05-11 14:57:26:527	INFO	CFACreationUtils.addEdgeToCFA	line 181: Dead code detected: return (retValue_acc);

2017-05-11 14:57:26:530	INFO	CFACreationUtils.addEdgeToCFA	line 190: Dead code detected: return (retValue_acc);

2017-05-11 14:57:26:550	INFO	CFACreationUtils.addEdgeToCFA	line 353: Dead code detected: return (retValue_acc);

2017-05-11 14:57:26:553	INFO	CFACreationUtils.addEdgeToCFA	line 385: Dead code detected: return (retValue_acc);

2017-05-11 14:57:26:561	INFO	CFACreationUtils.addEdgeToCFA	line 481: Dead code detected: return (retValue_acc);

2017-05-11 14:57:26:641	INFO	CFACreationUtils.addEdgeToCFA	line 801: Dead code detected: return (retValue_acc);

2017-05-11 14:57:26:662	INFO	CFACreationUtils.addEdgeToCFA	line 847: Dead code detected: return (retValue_acc);

2017-05-11 14:57:26:889	WARNING	CFunctionPointerResolver.replaceFunctionPointerCall	line 638: Function pointer *__cil_tmp10 with type int (*)(int, int) is called, but no possible target functions were found.

2017-05-11 14:57:29:039	INFO	CPAchecker.runAlgorithm	Starting analysis ...

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

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

2017-05-11 14:57:29:674	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:57:30:531	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:57:30:728	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:57:30:911	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:57:31:365	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:57:31:368	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:57:31:378	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:57:31:386	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:57:31:988	INFO	Parallel analysis 1:AbstractBMCAlgorithm.run	Creating formula for program

2017-05-11 14:57:35:480	INFO	Parallel analysis 1:AbstractBMCAlgorithm.boundedModelCheck	Starting satisfiability check...

2017-05-11 14:57:35:539	INFO	Parallel analysis 1:AbstractBMCAlgorithm.checkBoundingAssertions	Starting assertions check...

2017-05-11 14:57:35:661	INFO	Parallel analysis 2:InvariantsCPA:InvariantsCPA$InterestingVariableLimitAdjuster.adjustConditions	Adjusting interestingVariableLimit to 1

2017-05-11 14:57:35:662	INFO	Parallel analysis 2:ParallelAlgorithm.runParallelAnalysis	Adjusting precision for CPA org.sosy_lab.cpachecker.cpa.invariants.InvariantsCPA@4b5c7d2b

2017-05-11 14:57:35:662	INFO	Parallel analysis 2:ParallelAlgorithm.runParallelAnalysis	Updating reached set provided to other analyses

2017-05-11 14:57:36:033	INFO	Parallel analysis 1:KInductionProver.check	Running algorithm to create induction hypothesis

2017-05-11 14:57:39:782	INFO	Parallel analysis 2:InvariantsCPA:InvariantsCPA$InterestingVariableLimitAdjuster.adjustConditions	Adjusting interestingVariableLimit to 2

2017-05-11 14:57:39:783	INFO	Parallel analysis 2:ParallelAlgorithm.runParallelAnalysis	Adjusting precision for CPA org.sosy_lab.cpachecker.cpa.invariants.InvariantsCPA@4b5c7d2b

2017-05-11 14:57:39:785	INFO	Parallel analysis 2:ParallelAlgorithm.runParallelAnalysis	Updating reached set provided to other analyses

2017-05-11 14:57:43:421	INFO	Parallel analysis 2:InvariantsCPA:InvariantsCPA$InterestingVariableLimitAdjuster.adjustConditions	Adjusting interestingVariableLimit to 4

2017-05-11 14:57:43:422	INFO	Parallel analysis 2:ParallelAlgorithm.runParallelAnalysis	Adjusting precision for CPA org.sosy_lab.cpachecker.cpa.invariants.InvariantsCPA@4b5c7d2b

2017-05-11 14:57:43:427	INFO	Parallel analysis 2:ParallelAlgorithm.runParallelAnalysis	Updating reached set provided to other analyses

2017-05-11 14:57:45:225	INFO	Parallel analysis 2:InvariantsCPA:InvariantsCPA$InterestingVariableLimitAdjuster.adjustConditions	Adjusting interestingVariableLimit to 8

2017-05-11 14:57:45:237	INFO	Parallel analysis 2:ParallelAlgorithm.runParallelAnalysis	Adjusting precision for CPA org.sosy_lab.cpachecker.cpa.invariants.InvariantsCPA@4b5c7d2b

2017-05-11 14:57:45:238	INFO	Parallel analysis 2:ParallelAlgorithm.runParallelAnalysis	Updating reached set provided to other analyses

2017-05-11 14:57:46:815	INFO	Parallel analysis 2:InvariantsCPA:InvariantsCPA$InterestingVariableLimitAdjuster.adjustConditions	Adjusting interestingVariableLimit to 16

2017-05-11 14:57:46:815	INFO	Parallel analysis 2:ParallelAlgorithm.runParallelAnalysis	Adjusting precision for CPA org.sosy_lab.cpachecker.cpa.invariants.InvariantsCPA@4b5c7d2b

2017-05-11 14:57:46:821	INFO	Parallel analysis 2:ParallelAlgorithm.runParallelAnalysis	Updating reached set provided to other analyses

2017-05-11 14:57:48:672	INFO	Parallel analysis 2:InvariantsCPA:InvariantsCPA$InterestingVariableLimitAdjuster.adjustConditions	Adjusting interestingVariableLimit to 20

2017-05-11 14:57:48:673	INFO	Parallel analysis 2:ParallelAlgorithm.runParallelAnalysis	Adjusting precision for CPA org.sosy_lab.cpachecker.cpa.invariants.InvariantsCPA@4b5c7d2b

2017-05-11 14:57:48:674	INFO	Parallel analysis 2:ParallelAlgorithm.runParallelAnalysis	Updating reached set provided to other analyses

2017-05-11 14:57:50:754	INFO	Parallel analysis 2:InvariantsCPA:InvariantsCPA$FormulaDepthAdjuster.adjustConditions	Adjusting maximum formula depth to 2

2017-05-11 14:57:50:772	INFO	Parallel analysis 2:ParallelAlgorithm.runParallelAnalysis	Adjusting precision for CPA org.sosy_lab.cpachecker.cpa.invariants.InvariantsCPA@4b5c7d2b

2017-05-11 14:57:50:772	INFO	Parallel analysis 2:ParallelAlgorithm.runParallelAnalysis	Updating reached set provided to other analyses

2017-05-11 14:57:51:819	INFO	Parallel analysis 2:InvariantsCPA:InvariantsCPA$InterestingVariableLimitAdjuster.adjustConditions	Adjusting interestingVariableLimit to 28

2017-05-11 14:57:51:820	INFO	Parallel analysis 2:ParallelAlgorithm.runParallelAnalysis	Adjusting precision for CPA org.sosy_lab.cpachecker.cpa.invariants.InvariantsCPA@4b5c7d2b

2017-05-11 14:57:51:820	INFO	Parallel analysis 2:ParallelAlgorithm.runParallelAnalysis	Updating reached set provided to other analyses

2017-05-11 14:57:53:332	INFO	Parallel analysis 2:InvariantsCPA:InvariantsCPA$InterestingVariableLimitAdjuster.adjustConditions	Adjusting interestingVariableLimit to 32

2017-05-11 14:57:53:333	INFO	Parallel analysis 2:ParallelAlgorithm.runParallelAnalysis	Adjusting precision for CPA org.sosy_lab.cpachecker.cpa.invariants.InvariantsCPA@4b5c7d2b

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

2017-05-11 14:57:56:208	INFO	Parallel analysis 2:InvariantsCPA:InvariantsCPA$InterestingVariableLimitAdjuster.adjustConditions	Adjusting interestingVariableLimit to 34

2017-05-11 14:57:56:209	INFO	Parallel analysis 2:ParallelAlgorithm.runParallelAnalysis	Adjusting precision for CPA org.sosy_lab.cpachecker.cpa.invariants.InvariantsCPA@4b5c7d2b

2017-05-11 14:57:56:209	INFO	Parallel analysis 2:ParallelAlgorithm.runParallelAnalysis	Updating reached set provided to other analyses

2017-05-11 14:57:58:232	INFO	Parallel analysis 1:KInductionProver.check	Starting induction check...

2017-05-11 14:57:58:477	INFO	Parallel analysis 2:InvariantsCPA:InvariantsCPA$InterestingVariableLimitAdjuster.adjustConditions	Adjusting interestingVariableLimit to 38

2017-05-11 14:57:58:478	INFO	Parallel analysis 2:ParallelAlgorithm.runParallelAnalysis	Adjusting precision for CPA org.sosy_lab.cpachecker.cpa.invariants.InvariantsCPA@4b5c7d2b

2017-05-11 14:57:58:478	INFO	Parallel analysis 2:ParallelAlgorithm.runParallelAnalysis	Updating reached set provided to other analyses

2017-05-11 14:58:00:306	INFO	Parallel analysis 2:InvariantsCPA:InvariantsCPA$InterestingVariableLimitAdjuster.adjustConditions	Adjusting interestingVariableLimit to 46

2017-05-11 14:58:00:322	INFO	Parallel analysis 2:ParallelAlgorithm.runParallelAnalysis	Adjusting precision for CPA org.sosy_lab.cpachecker.cpa.invariants.InvariantsCPA@4b5c7d2b

2017-05-11 14:58:00:322	INFO	Parallel analysis 2:ParallelAlgorithm.runParallelAnalysis	Updating reached set provided to other analyses

2017-05-11 14:58:04:452	INFO	Parallel analysis 1:BoundsCPA:BoundsCPA.adjustPrecision	Adjusting maxLoopIterations to 2

2017-05-11 14:58:04:454	INFO	Parallel analysis 1:AbstractBMCAlgorithm.run	Creating formula for program

2017-05-11 14:58:04:464	INFO	Parallel analysis 1:AbstractBMCAlgorithm.boundedModelCheck	Starting satisfiability check...

2017-05-11 14:58:04:476	INFO	Parallel analysis 1:AbstractBMCAlgorithm.checkBoundingAssertions	Starting assertions check...

2017-05-11 14:58:04:601	INFO	Parallel analysis 1:KInductionProver.check	Running algorithm to create induction hypothesis

2017-05-11 14:58:11:402	INFO	Parallel analysis 1:KInductionProver.check	Starting induction check...

2017-05-11 14:58:15:424	INFO	Parallel analysis 1:BoundsCPA:BoundsCPA.adjustPrecision	Adjusting maxLoopIterations to 3

2017-05-11 14:58:15:424	INFO	Parallel analysis 1:AbstractBMCAlgorithm.run	Creating formula for program

2017-05-11 14:58:15:435	INFO	Parallel analysis 1:AbstractBMCAlgorithm.boundedModelCheck	Starting satisfiability check...

2017-05-11 14:58:15:436	INFO	Parallel analysis 1:AbstractBMCAlgorithm.checkBoundingAssertions	Starting assertions check...

2017-05-11 14:58:15:523	INFO	Parallel analysis 1:KInductionProver.check	Running algorithm to create induction hypothesis

2017-05-11 14:58:19:002	INFO	Parallel analysis 1:KInductionProver.check	Starting induction check...

2017-05-11 14:58:23:812	INFO	Parallel analysis 1:BoundsCPA:BoundsCPA.adjustPrecision	Adjusting maxLoopIterations to 4

2017-05-11 14:58:23:812	INFO	Parallel analysis 1:AbstractBMCAlgorithm.run	Creating formula for program

2017-05-11 14:58:23:826	INFO	Parallel analysis 1:AbstractBMCAlgorithm.boundedModelCheck	Starting satisfiability check...

2017-05-11 14:58:23:829	INFO	Parallel analysis 1:AbstractBMCAlgorithm.checkBoundingAssertions	Starting assertions check...

2017-05-11 14:58:23:945	INFO	Parallel analysis 1:KInductionProver.check	Running algorithm to create induction hypothesis

2017-05-11 14:58:25:260	INFO	Parallel analysis 2:InvariantsCPA:InvariantsCPA$InterestingVariableLimitAdjuster.adjustConditions	Adjusting interestingVariableLimit to 50

2017-05-11 14:58:25:261	INFO	Parallel analysis 2:ParallelAlgorithm.runParallelAnalysis	Adjusting precision for CPA org.sosy_lab.cpachecker.cpa.invariants.InvariantsCPA@4b5c7d2b

2017-05-11 14:58:25:261	INFO	Parallel analysis 2:ParallelAlgorithm.runParallelAnalysis	Updating reached set provided to other analyses

2017-05-11 14:58:32:329	INFO	Parallel analysis 1:KInductionProver.check	Starting induction check...

2017-05-11 14:58:43:878	INFO	Parallel analysis 1:BoundsCPA:BoundsCPA.adjustPrecision	Adjusting maxLoopIterations to 5

2017-05-11 14:58:43:879	INFO	Parallel analysis 1:AbstractBMCAlgorithm.run	Creating formula for program

2017-05-11 14:58:43:890	INFO	Parallel analysis 1:AbstractBMCAlgorithm.boundedModelCheck	Starting satisfiability check...

2017-05-11 14:58:43:891	INFO	Parallel analysis 1:AbstractBMCAlgorithm.checkBoundingAssertions	Starting assertions check...

2017-05-11 14:58:44:025	INFO	Parallel analysis 1:KInductionProver.check	Running algorithm to create induction hypothesis

2017-05-11 14:58:44:695	INFO	Parallel analysis 2:InvariantsCPA:InvariantsCPA$InterestingVariableLimitAdjuster.adjustConditions	Adjusting interestingVariableLimit to 58

2017-05-11 14:58:44:696	INFO	Parallel analysis 2:ParallelAlgorithm.runParallelAnalysis	Adjusting precision for CPA org.sosy_lab.cpachecker.cpa.invariants.InvariantsCPA@4b5c7d2b

2017-05-11 14:58:44:696	INFO	Parallel analysis 2:ParallelAlgorithm.runParallelAnalysis	Updating reached set provided to other analyses

2017-05-11 14:58:52:560	INFO	Parallel analysis 1:KInductionProver.check	Starting induction check...

2017-05-11 14:59:03:525	INFO	Parallel analysis 2:InvariantsCPA:InvariantsCPA$InterestingVariableLimitAdjuster.adjustConditions	Adjusting interestingVariableLimit to 74

2017-05-11 14:59:03:526	INFO	Parallel analysis 2:ParallelAlgorithm.runParallelAnalysis	Adjusting precision for CPA org.sosy_lab.cpachecker.cpa.invariants.InvariantsCPA@4b5c7d2b

2017-05-11 14:59:03:526	INFO	Parallel analysis 2:ParallelAlgorithm.runParallelAnalysis	Updating reached set provided to other analyses

2017-05-11 14:59:19:575	INFO	Parallel analysis 1:BoundsCPA:BoundsCPA.adjustPrecision	Adjusting maxLoopIterations to 6

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

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

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

2017-05-11 14:59:20:208	INFO	Parallel analysis 1:KInductionProver.check	Running algorithm to create induction hypothesis

2017-05-11 14:59:28:800	INFO	Parallel analysis 1:KInductionProver.check	Starting induction check...

2017-05-11 14:59:46:330	INFO	Parallel analysis 1:BoundsCPA:BoundsCPA.adjustPrecision	Adjusting maxLoopIterations to 7

2017-05-11 14:59:46:332	INFO	Parallel analysis 1:AbstractBMCAlgorithm.run	Creating formula for program

2017-05-11 14:59:46:343	INFO	Parallel analysis 1:AbstractBMCAlgorithm.boundedModelCheck	Starting satisfiability check...

2017-05-11 14:59:46:344	INFO	Parallel analysis 1:AbstractBMCAlgorithm.checkBoundingAssertions	Starting assertions check...

2017-05-11 14:59:46:659	INFO	Parallel analysis 1:KInductionProver.check	Running algorithm to create induction hypothesis

2017-05-11 14:59:55:519	INFO	Parallel analysis 1:KInductionProver.check	Starting induction check...

2017-05-11 15:00:20:624	INFO	Parallel analysis 1:BoundsCPA:BoundsCPA.adjustPrecision	Adjusting maxLoopIterations to 8

2017-05-11 15:00:20:625	INFO	Parallel analysis 1:AbstractBMCAlgorithm.run	Creating formula for program

2017-05-11 15:00:20:637	INFO	Parallel analysis 1:AbstractBMCAlgorithm.boundedModelCheck	Starting satisfiability check...

2017-05-11 15:00:20:638	INFO	Parallel analysis 1:AbstractBMCAlgorithm.checkBoundingAssertions	Starting assertions check...

2017-05-11 15:00:20:843	INFO	Parallel analysis 1:KInductionProver.check	Running algorithm to create induction hypothesis

2017-05-11 15:00:45:634	INFO	Parallel analysis 1:KInductionProver.check	Starting induction check...

2017-05-11 15:02:48:322	INFO	Parallel analysis 1:BoundsCPA:BoundsCPA.adjustPrecision	Adjusting maxLoopIterations to 9

2017-05-11 15:02:48:323	INFO	Parallel analysis 1:AbstractBMCAlgorithm.run	Creating formula for program

2017-05-11 15:02:49:135	INFO	Parallel analysis 1:AbstractBMCAlgorithm.boundedModelCheck	Starting satisfiability check...

2017-05-11 15:03:01:885	INFO	Parallel analysis 1:BMCAlgorithm.analyzeCounterexample	Error found, creating error path

2017-05-11 15:03:07:047	INFO	Parallel analysis 1:CounterexampleCheckAlgorithm.checkCounterexample	Error path found, starting counterexample check with CBMC.

2017-05-11 15:03:07:517	INFO	Parallel analysis 1:CounterexampleCheckAlgorithm.checkCounterexample	Error path found but identified as infeasible.

2017-05-11 15:03:07:518	INFO	Parallel analysis 1:CounterexampleCheckAlgorithm.checkCounterexample	Error path found, starting counterexample check with CBMC.

2017-05-11 15:03:07:961	INFO	Parallel analysis 1:CounterexampleCheckAlgorithm.checkCounterexample	Error path found and confirmed by counterexample check with CBMC.

2017-05-11 15:03:07:961	INFO	Parallel analysis 1:CounterexampleCheckAlgorithm.checkCounterexample	Error path found, starting counterexample check with CBMC.

2017-05-11 15:03:08:588	INFO	Parallel analysis 1:CounterexampleCheckAlgorithm.checkCounterexample	Error path found but identified as infeasible.

2017-05-11 15:03:08:588	INFO	Parallel analysis 1:CounterexampleCheckAlgorithm.checkCounterexample	Error path found, starting counterexample check with CBMC.

2017-05-11 15:03:09:121	INFO	Parallel analysis 1:CounterexampleCheckAlgorithm.checkCounterexample	Error path found but identified as infeasible.

2017-05-11 15:03:09:121	INFO	Parallel analysis 1:CounterexampleCheckAlgorithm.checkCounterexample	Error path found, starting counterexample check with CBMC.

2017-05-11 15:03:09:781	INFO	Parallel analysis 1:CounterexampleCheckAlgorithm.checkCounterexample	Error path found but identified as infeasible.

2017-05-11 15:03:09:782	INFO	Parallel analysis 1:CounterexampleCheckAlgorithm.checkCounterexample	Error path found, starting counterexample check with CBMC.

2017-05-11 15:03:10:363	INFO	Parallel analysis 1:CounterexampleCheckAlgorithm.checkCounterexample	Error path found but identified as infeasible.

2017-05-11 15:03:10:363	INFO	Parallel analysis 1:CounterexampleCheckAlgorithm.checkCounterexample	Error path found, starting counterexample check with CBMC.

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

2017-05-11 15:03:11:159	INFO	Parallel analysis 1:CounterexampleCheckAlgorithm.checkCounterexample	Error path found, starting counterexample check with CBMC.

2017-05-11 15:03:12:256	INFO	Parallel analysis 1:CounterexampleCheckAlgorithm.checkCounterexample	Error path found but identified as infeasible.

2017-05-11 15:03:12:256	INFO	Parallel analysis 1:CounterexampleCheckAlgorithm.checkCounterexample	Error path found, starting counterexample check with CBMC.

2017-05-11 15:03:13:843	INFO	Parallel analysis 1:CounterexampleCheckAlgorithm.checkCounterexample	Error path found and confirmed by counterexample check with CBMC.

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

2017-05-11 15:03:13:853	INFO	Parallel analysis 2:ParallelAlgorithm.runParallelAnalysis	Analysis was terminated

2017-05-11 15:03:13:855	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:            9 (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:         9 (100%)
  Times precision was empty:       9 (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:         606
  BDD entailment checks:           0
Number of SMT sat checks:          0
  trivial:                         0
  cached:                          0

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

Time for post operator:                  3.038s
  Time for path formula creation:        2.991s
Time for strengthen operator:            0.003s
Time for prec operator:                  0.018s
  Time for abstraction:                  0.000s (Max:     0.000s, Count: 9)
    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.032s
Time for coverage check:                 0.000s
Total time for SMT solver (w/o itp):     0.000s

Total number of created targets for pointer analysis: 2048
   Number of created targets for uf: *signed_int is 513



PrecisionBootstrap statistics
-----------------------------
Init. function predicates:                         0
Init. global predicates:                           0
Init. location predicates:                         0

Invariant Generation statistics
-------------------------------

Bounds CPA statistics
---------------------
Bound k:                                           9
Maximum loop iteration reached:                    10


ValueAnalysisCPA statistics
---------------------------
Number of variables:                                  35842 (count: 1915, min: 0, max: 32, avg: 18.72)
Number of global variables:                           21960 (count: 1915, min: 0, max: 16, avg: 11.47)

ValueAnalysisPrecisionAdjustment statistics
-------------------------------------------
Number of abstraction computations:                    2225
Total time for liveness abstraction:                   0.000s
Total time for abstraction computation:                0.243s
Total time for path thresholds:                        0.000s
Number of tracked memory locations:                53

ValueAnalysisTransferRelation statistics
----------------------------------------
Number of Assumptions:                                 1010
Number of deterministic Assumptions:                    224
Level of Determinism:                              22%

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.020s
Automaton transfers with branching:                0
Automaton transfer successors:                         2225 (count: 2234, min: 0, max: 1, avg: 1.00) [0 x 9, 1 x 2225]

CPA algorithm statistics
------------------------
Number of iterations:            1931
Max size of waitlist:            12
Average size of waitlist:        3
Number of computed successors:   2225
Max successors for one state:    2
Number of times merged:          303
Number of times stopped:         303
Number of times breaked:         0

Total time for CPA algorithm:         4.432s (Max:     3.486s)
  Time for choose from waitlist:      0.003s
  Time for precision adjustment:      0.350s
  Time for transfer relation:         3.968s
  Time for merge operator:            0.061s
  Time for stop operator:             0.007s
  Time for adding to reached set:     0.015s

BMC algorithm statistics
------------------------
Time for BMC formula creation:           4.438s
Time for final sat check:               12.752s
Time for error path creation:            3.446s
Time for bounding assertions check:      1.770s
Time for induction formula creation:    91.477s
Time for induction check:              218.649s

Counterexample-Check Algorithm statistics
-----------------------------------------
Number of counterexample checks:    1
Number of infeasible paths:         7 (700%)
Time for counterexample checks:         6.797s
Time for running CBMC:                  6.465s


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:                  0.765s
  Time for transition matches:                         0.274s
  Time for transition assertions:                      0.000s
  Time for transition actions:                         0.003s
Automaton transfers with branching:                0
Automaton transfer successors:                       131152 (count: 131608, min: 0, max: 1, avg: 1.00) [0 x 456, 1 x 131152]

CPA algorithm statistics
------------------------
Number of iterations:            120390
Max size of waitlist:            297
Average size of waitlist:        116
Number of computed successors:   131152
Max successors for one state:    2
Number of times merged:          23643
Number of times stopped:         25065
Number of times breaked:         0

Total time for CPA algorithm:       339.571s (Max:   249.976s)
  Time for choose from waitlist:      0.235s
  Time for precision adjustment:      2.053s
  Time for transfer relation:        28.892s
  Time for merge operator:          295.926s
  Time for stop operator:            10.138s
  Time for adding to reached set:     0.841s


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

Code Coverage
-----------------------------
  Function coverage:      0.559
  Visited lines:          88
  Total lines:            397
  Line coverage:          0.222
  Visited conditions:     108
  Total conditions:       150
  Condition coverage:     0.720

CPAchecker general statistics
-----------------------------
Number of program locations:     700
Number of CFA edges:             822
Number of relevant variables:    146
Number of functions:             34
Number of loops:                 9
Size of reached set:             1915
  Number of reached locations:   315 (45%)
    Avg states per location:     6
    Max states per location:     10 (at node N199)
  Number of reached functions:   19 (56%)
  Number of partitions:          1915
    Avg size of partitions:      1
    Max size of partitions:      1
  Number of target states:       9

Time for analysis setup:          4.236s
  Time for loading CPAs:          1.646s
  Time for loading parser:        0.708s
  Time for CFA construction:      1.768s
    Time for parsing file(s):     0.461s
    Time for AST to CFA:          0.552s
    Time for CFA sanity check:    0.190s
    Time for post-processing:     0.464s
      Time for var class.:        0.270s
    Time for CFA export:          1.264s
Time for Analysis:              344.812s
CPU time for analysis:          680.210s
Time for analyzing result:        0.002s
Total time for CPAchecker:      349.068s
Total CPU time for CPAchecker:  687.650s
Time for statistics:              6.982s

Time for Garbage Collector:      29.691s (in 257 runs)
Garbage Collector(s) used:    PS MarkSweep, PS Scavenge
Used heap memory:                717MB (   684 MiB) max;    390MB (   372 MiB) avg;    743MB (   708 MiB) peak
Used non-heap memory:             54MB (    52 MiB) max;     51MB (    48 MiB) avg;     61MB (    58 MiB) peak
Used in PS Old Gen pool:         307MB (   292 MiB) max;    194MB (   185 MiB) avg;    308MB (   294 MiB) peak
Allocated heap memory:          1205MB (  1150 MiB) max;    972MB (   927 MiB) avg
Allocated non-heap memory:        57MB (    54 MiB) max;     53MB (    51 MiB) avg
Total process virtual memory:   7533MB (  7184 MiB) max;   6903MB (  6583 MiB) avg

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