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

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

2017-05-11 15:33:12:203	INFO	CPAchecker.run	CPAchecker 1.6.1-svn (Java HotSpot(TM) 64-Bit Server VM 1.8.0_102) started

2017-05-11 15:33:13:968	INFO	CFACreationUtils.addEdgeToCFA	line 162: Dead code detected: return (retValue_acc);

2017-05-11 15:33:13:973	INFO	CFACreationUtils.addEdgeToCFA	line 171: Dead code detected: return (retValue_acc);

2017-05-11 15:33:13:979	INFO	CFACreationUtils.addEdgeToCFA	line 226: Dead code detected: return (retValue_acc);

2017-05-11 15:33:14:115	INFO	CFACreationUtils.addEdgeToCFA	line 447: Dead code detected: return (retValue_acc);

2017-05-11 15:33:14:117	INFO	CFACreationUtils.addEdgeToCFA	line 459: Dead code detected: return (retValue_acc);

2017-05-11 15:33:14:138	INFO	CFACreationUtils.addEdgeToCFA	line 482: Dead code detected: return (retValue_acc);

2017-05-11 15:33:14:261	INFO	CFACreationUtils.addEdgeToCFA	line 811: Dead code detected: return (retValue_acc);

2017-05-11 15:33:14:266	INFO	CFACreationUtils.addEdgeToCFA	line 857: Dead code detected: return (retValue_acc);

2017-05-11 15:33:14:281	INFO	CFACreationUtils.addEdgeToCFA	line 906: Dead code detected: return (retValue_acc);

2017-05-11 15:33:14:282	INFO	CFACreationUtils.addEdgeToCFA	line 938: Dead code detected: return (retValue_acc);

2017-05-11 15:33:14:291	INFO	CFACreationUtils.addEdgeToCFA	line 952: Dead code detected: return (retValue_acc);

2017-05-11 15:33:14:530	WARNING	CFunctionPointerResolver.replaceFunctionPointerCall	line 648: Function pointer *__cil_tmp10 with type int (*)(int, int) is called, but no possible target functions were found.

2017-05-11 15:33:16:113	INFO	CPAchecker.runAlgorithm	Starting analysis ...

2017-05-11 15:33:16:166	INFO	Parallel analysis 1:ResourceLimitChecker.fromConfiguration	Using the following resource limits: CPU-time limit of 900s

2017-05-11 15:33:16:206	INFO	Parallel analysis 2:ResourceLimitChecker.fromConfiguration	Using the following resource limits: CPU-time limit of 900s

2017-05-11 15:33:16:571	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 15:33:17:285	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 15:33:17:455	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 15:33:17:610	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 15:33:18:194	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 15:33:18:197	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 15:33:18:216	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 15:33:18:232	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 15:33:19:012	INFO	Parallel analysis 1:AbstractBMCAlgorithm.run	Creating formula for program

2017-05-11 15:33:23:226	INFO	Parallel analysis 1:AbstractBMCAlgorithm.boundedModelCheck	Starting satisfiability check...

2017-05-11 15:33:23:282	INFO	Parallel analysis 1:AbstractBMCAlgorithm.checkBoundingAssertions	Starting assertions check...

2017-05-11 15:33:23:794	INFO	Parallel analysis 1:KInductionProver.check	Running algorithm to create induction hypothesis

2017-05-11 15:33:26:267	INFO	Parallel analysis 2:InvariantsCPA:InvariantsCPA$InterestingVariableLimitAdjuster.adjustConditions	Adjusting interestingVariableLimit to 1

2017-05-11 15:33:26:268	INFO	Parallel analysis 2:ParallelAlgorithm.runParallelAnalysis	Adjusting precision for CPA org.sosy_lab.cpachecker.cpa.invariants.InvariantsCPA@770fe623

2017-05-11 15:33:26:269	INFO	Parallel analysis 2:ParallelAlgorithm.runParallelAnalysis	Updating reached set provided to other analyses

2017-05-11 15:33:33:096	INFO	Parallel analysis 2:InvariantsCPA:InvariantsCPA$InterestingVariableLimitAdjuster.adjustConditions	Adjusting interestingVariableLimit to 2

2017-05-11 15:33:33:096	INFO	Parallel analysis 2:ParallelAlgorithm.runParallelAnalysis	Adjusting precision for CPA org.sosy_lab.cpachecker.cpa.invariants.InvariantsCPA@770fe623

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

2017-05-11 15:33:36:774	INFO	Parallel analysis 2:InvariantsCPA:InvariantsCPA$InterestingVariableLimitAdjuster.adjustConditions	Adjusting interestingVariableLimit to 4

2017-05-11 15:33:36:774	INFO	Parallel analysis 2:ParallelAlgorithm.runParallelAnalysis	Adjusting precision for CPA org.sosy_lab.cpachecker.cpa.invariants.InvariantsCPA@770fe623

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

2017-05-11 15:33:39:627	INFO	Parallel analysis 2:InvariantsCPA:InvariantsCPA$InterestingVariableLimitAdjuster.adjustConditions	Adjusting interestingVariableLimit to 8

2017-05-11 15:33:39:638	INFO	Parallel analysis 2:ParallelAlgorithm.runParallelAnalysis	Adjusting precision for CPA org.sosy_lab.cpachecker.cpa.invariants.InvariantsCPA@770fe623

2017-05-11 15:33:39:639	INFO	Parallel analysis 2:ParallelAlgorithm.runParallelAnalysis	Updating reached set provided to other analyses

2017-05-11 15:33:41:356	INFO	Parallel analysis 2:InvariantsCPA:InvariantsCPA$InterestingVariableLimitAdjuster.adjustConditions	Adjusting interestingVariableLimit to 16

2017-05-11 15:33:41:357	INFO	Parallel analysis 2:ParallelAlgorithm.runParallelAnalysis	Adjusting precision for CPA org.sosy_lab.cpachecker.cpa.invariants.InvariantsCPA@770fe623

2017-05-11 15:33:41:358	INFO	Parallel analysis 2:ParallelAlgorithm.runParallelAnalysis	Updating reached set provided to other analyses

2017-05-11 15:33:42:771	INFO	Parallel analysis 2:InvariantsCPA:InvariantsCPA$InterestingVariableLimitAdjuster.adjustConditions	Adjusting interestingVariableLimit to 32

2017-05-11 15:33:42:771	INFO	Parallel analysis 2:ParallelAlgorithm.runParallelAnalysis	Adjusting precision for CPA org.sosy_lab.cpachecker.cpa.invariants.InvariantsCPA@770fe623

2017-05-11 15:33:42:771	INFO	Parallel analysis 2:ParallelAlgorithm.runParallelAnalysis	Updating reached set provided to other analyses

2017-05-11 15:33:47:863	INFO	Parallel analysis 1:KInductionProver.check	Starting induction check...

2017-05-11 15:33:49:819	INFO	Parallel analysis 2:InvariantsCPA:InvariantsCPA$InterestingVariableLimitAdjuster.adjustConditions	Adjusting interestingVariableLimit to 40

2017-05-11 15:33:49:820	INFO	Parallel analysis 2:ParallelAlgorithm.runParallelAnalysis	Adjusting precision for CPA org.sosy_lab.cpachecker.cpa.invariants.InvariantsCPA@770fe623

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

2017-05-11 15:33:57:103	INFO	Parallel analysis 2:InvariantsCPA:InvariantsCPA$FormulaDepthAdjuster.adjustConditions	Adjusting maximum formula depth to 2

2017-05-11 15:33:57:103	INFO	Parallel analysis 2:ParallelAlgorithm.runParallelAnalysis	Adjusting precision for CPA org.sosy_lab.cpachecker.cpa.invariants.InvariantsCPA@770fe623

2017-05-11 15:33:57:104	INFO	Parallel analysis 2:ParallelAlgorithm.runParallelAnalysis	Updating reached set provided to other analyses

2017-05-11 15:34:02:416	INFO	Parallel analysis 2:InvariantsCPA:InvariantsCPA$InterestingVariableLimitAdjuster.adjustConditions	Adjusting interestingVariableLimit to 56

2017-05-11 15:34:02:417	INFO	Parallel analysis 2:ParallelAlgorithm.runParallelAnalysis	Adjusting precision for CPA org.sosy_lab.cpachecker.cpa.invariants.InvariantsCPA@770fe623

2017-05-11 15:34:02:417	INFO	Parallel analysis 2:ParallelAlgorithm.runParallelAnalysis	Updating reached set provided to other analyses

2017-05-11 15:34:10:301	INFO	Parallel analysis 1:BoundsCPA:BoundsCPA.adjustPrecision	Adjusting maxLoopIterations to 2

2017-05-11 15:34:10:303	INFO	Parallel analysis 1:AbstractBMCAlgorithm.run	Creating formula for program

2017-05-11 15:34:10:317	INFO	Parallel analysis 1:AbstractBMCAlgorithm.boundedModelCheck	Starting satisfiability check...

2017-05-11 15:34:10:322	INFO	Parallel analysis 1:AbstractBMCAlgorithm.checkBoundingAssertions	Starting assertions check...

2017-05-11 15:34:10:356	INFO	Parallel analysis 1:KInductionProver.check	Running algorithm to create induction hypothesis

2017-05-11 15:34:20:529	INFO	Parallel analysis 1:KInductionProver.check	Starting induction check...

2017-05-11 15:34:27:460	INFO	Parallel analysis 1:BoundsCPA:BoundsCPA.adjustPrecision	Adjusting maxLoopIterations to 3

2017-05-11 15:34:27:463	INFO	Parallel analysis 1:AbstractBMCAlgorithm.run	Creating formula for program

2017-05-11 15:34:27:472	INFO	Parallel analysis 1:AbstractBMCAlgorithm.boundedModelCheck	Starting satisfiability check...

2017-05-11 15:34:27:473	INFO	Parallel analysis 1:AbstractBMCAlgorithm.checkBoundingAssertions	Starting assertions check...

2017-05-11 15:34:27:517	INFO	Parallel analysis 1:KInductionProver.check	Running algorithm to create induction hypothesis

2017-05-11 15:34:34:945	INFO	Parallel analysis 1:KInductionProver.check	Starting induction check...

2017-05-11 15:34:46:551	INFO	Parallel analysis 1:BoundsCPA:BoundsCPA.adjustPrecision	Adjusting maxLoopIterations to 4

2017-05-11 15:34:46:552	INFO	Parallel analysis 1:AbstractBMCAlgorithm.run	Creating formula for program

2017-05-11 15:34:46:572	INFO	Parallel analysis 1:AbstractBMCAlgorithm.boundedModelCheck	Starting satisfiability check...

2017-05-11 15:34:46:575	INFO	Parallel analysis 1:AbstractBMCAlgorithm.checkBoundingAssertions	Starting assertions check...

2017-05-11 15:34:46:630	INFO	Parallel analysis 1:KInductionProver.check	Running algorithm to create induction hypothesis

2017-05-11 15:34:52:939	INFO	Parallel analysis 1:KInductionProver.check	Starting induction check...

2017-05-11 15:35:08:556	INFO	Parallel analysis 1:BoundsCPA:BoundsCPA.adjustPrecision	Adjusting maxLoopIterations to 5

2017-05-11 15:35:08:558	INFO	Parallel analysis 1:AbstractBMCAlgorithm.run	Creating formula for program

2017-05-11 15:35:08:564	INFO	Parallel analysis 1:AbstractBMCAlgorithm.boundedModelCheck	Starting satisfiability check...

2017-05-11 15:35:08:565	INFO	Parallel analysis 1:AbstractBMCAlgorithm.checkBoundingAssertions	Starting assertions check...

2017-05-11 15:35:08:639	INFO	Parallel analysis 1:KInductionProver.check	Running algorithm to create induction hypothesis

2017-05-11 15:35:15:807	INFO	Parallel analysis 2:InvariantsCPA:InvariantsCPA$InterestingVariableLimitAdjuster.adjustConditions	Adjusting interestingVariableLimit to 64

2017-05-11 15:35:15:807	INFO	Parallel analysis 2:ParallelAlgorithm.runParallelAnalysis	Adjusting precision for CPA org.sosy_lab.cpachecker.cpa.invariants.InvariantsCPA@770fe623

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

2017-05-11 15:35:30:978	INFO	Parallel analysis 1:KInductionProver.check	Starting induction check...

2017-05-11 15:36:17:673	INFO	Parallel analysis 1:BoundsCPA:BoundsCPA.adjustPrecision	Adjusting maxLoopIterations to 6

2017-05-11 15:36:17:675	INFO	Parallel analysis 1:AbstractBMCAlgorithm.run	Creating formula for program

2017-05-11 15:36:18:240	INFO	Parallel analysis 1:AbstractBMCAlgorithm.boundedModelCheck	Starting satisfiability check...

2017-05-11 15:36:20:388	INFO	Parallel analysis 2:InvariantsCPA:InvariantsCPA$InterestingVariableLimitAdjuster.adjustConditions	Adjusting interestingVariableLimit to 80

2017-05-11 15:36:20:389	INFO	Parallel analysis 2:ParallelAlgorithm.runParallelAnalysis	Adjusting precision for CPA org.sosy_lab.cpachecker.cpa.invariants.InvariantsCPA@770fe623

2017-05-11 15:36:20:389	INFO	Parallel analysis 2:ParallelAlgorithm.runParallelAnalysis	Updating reached set provided to other analyses

2017-05-11 15:36:22:435	INFO	Parallel analysis 1:BMCAlgorithm.analyzeCounterexample	Error found, creating error path

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

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

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

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

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

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

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

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

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

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

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

2017-05-11 15:36:32:164	INFO	Parallel analysis 1:CounterexampleCheckAlgorithm.checkCounterexample	Error path found and confirmed by counterexample check with CBMC.

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

2017-05-11 15:36:32:175	INFO	Parallel analysis 2:ParallelAlgorithm.runParallelAnalysis	Analysis was terminated

2017-05-11 15:36:32:176	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:            6 (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:         6 (100%)
  Times precision was empty:       6 (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:         744
  BDD entailment checks:           0
Number of SMT sat checks:          0
  trivial:                         0
  cached:                          0

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

Time for post operator:                  3.674s
  Time for path formula creation:        3.670s
Time for strengthen operator:            0.013s
Time for prec operator:                  0.003s
  Time for abstraction:                  0.000s (Max:     0.000s, Count: 6)
    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.051s
Time for coverage check:                 0.000s
Total time for SMT solver (w/o itp):     0.000s

Total number of created targets for pointer analysis: 578
   Number of created targets for uf: *signed_int is 69



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

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

Bounds CPA statistics
---------------------
Bound k:                                           6
Maximum loop iteration reached:                    7


ValueAnalysisCPA statistics
---------------------------
Number of variables:                                  31302 (count: 1985, min: 0, max: 27, avg: 15.77)
Number of global variables:                           19808 (count: 1985, min: 0, max: 16, avg: 9.98)

ValueAnalysisPrecisionAdjustment statistics
-------------------------------------------
Number of abstraction computations:                    2361
Total time for liveness abstraction:                   0.000s
Total time for abstraction computation:                0.029s
Total time for path thresholds:                        0.000s
Number of tracked memory locations:                61

ValueAnalysisTransferRelation statistics
----------------------------------------
Number of Assumptions:                                  968
Number of deterministic Assumptions:                    116
Level of Determinism:                              12%

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.007s
Automaton transfers with branching:                0
Automaton transfer successors:                         2361 (count: 2367, min: 0, max: 1, avg: 1.00) [0 x 6, 1 x 2361]

CPA algorithm statistics
------------------------
Number of iterations:            1995
Max size of waitlist:            11
Average size of waitlist:        3
Number of computed successors:   2361
Max successors for one state:    2
Number of times merged:          372
Number of times stopped:         372
Number of times breaked:         0

Total time for CPA algorithm:         4.797s (Max:     4.191s)
  Time for choose from waitlist:      0.001s
  Time for precision adjustment:      0.104s
  Time for transfer relation:         4.567s
  Time for merge operator:            0.077s
  Time for stop operator:             0.008s
  Time for adding to reached set:     0.012s

BMC algorithm statistics
------------------------
Time for BMC formula creation:           4.818s
Time for final sat check:                4.194s
Time for error path creation:            2.057s
Time for bounding assertions check:      0.431s
Time for induction formula creation:    70.231s
Time for induction check:              102.973s

Counterexample-Check Algorithm statistics
-----------------------------------------
Number of counterexample checks:    1
Number of infeasible paths:         5 (500%)
Time for counterexample checks:         7.105s
Time for running CBMC:                  6.466s


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.017s
  Time for transition matches:                         0.532s
  Time for transition assertions:                      0.000s
  Time for transition actions:                         0.000s
Automaton transfers with branching:                0
Automaton transfer successors:                       116990 (count: 117155, min: 0, max: 1, avg: 1.00) [0 x 165, 1 x 116990]

CPA algorithm statistics
------------------------
Number of iterations:            106442
Max size of waitlist:            319
Average size of waitlist:        135
Number of computed successors:   116990
Max successors for one state:    2
Number of times merged:          24934
Number of times stopped:         27358
Number of times breaked:         0

Total time for CPA algorithm:       191.815s (Max:    73.350s)
  Time for choose from waitlist:      0.189s
  Time for precision adjustment:      1.658s
  Time for transfer relation:        28.303s
  Time for merge operator:          149.724s
  Time for stop operator:            10.314s
  Time for adding to reached set:     0.587s


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

Code Coverage
-----------------------------
  Function coverage:      0.684
  Visited lines:          125
  Total lines:            422
  Line coverage:          0.296
  Visited conditions:     156
  Total conditions:       190
  Condition coverage:     0.821

CPAchecker general statistics
-----------------------------
Number of program locations:     753
Number of CFA edges:             904
Number of relevant variables:    149
Number of functions:             38
Number of loops:                 9
Size of reached set:             1985
  Number of reached locations:   395 (52%)
    Avg states per location:     5
    Max states per location:     16 (at node N40)
  Number of reached functions:   26 (68%)
  Number of partitions:          1985
    Avg size of partitions:      1
    Max size of partitions:      1
  Number of target states:       6

Time for analysis setup:          3.873s
  Time for loading CPAs:          1.107s
  Time for loading parser:        0.702s
  Time for CFA construction:      1.959s
    Time for parsing file(s):     0.486s
    Time for AST to CFA:          0.712s
    Time for CFA sanity check:    0.183s
    Time for post-processing:     0.512s
      Time for var class.:        0.269s
    Time for CFA export:          0.981s
Time for Analysis:              196.060s
CPU time for analysis:          384.810s
Time for analyzing result:        0.002s
Total time for CPAchecker:      199.950s
Total CPU time for CPAchecker:  391.600s
Time for statistics:              4.812s

Time for Garbage Collector:      15.657s (in 152 runs)
Garbage Collector(s) used:    PS MarkSweep, PS Scavenge
Used heap memory:                625MB (   596 MiB) max;    300MB (   286 MiB) avg;    651MB (   621 MiB) peak
Used non-heap memory:             54MB (    51 MiB) max;     50MB (    47 MiB) avg;     60MB (    57 MiB) peak
Used in PS Old Gen pool:         217MB (   207 MiB) max;    108MB (   103 MiB) avg;    218MB (   208 MiB) peak
Allocated heap memory:          1205MB (  1150 MiB) max;    954MB (   910 MiB) avg
Allocated non-heap memory:        56MB (    53 MiB) max;     53MB (    50 MiB) avg
Total process virtual memory:   6936MB (  6615 MiB) max;   6550MB (  6247 MiB) avg

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