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

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

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

2017-05-11 16:41:49:352	INFO	CFACreationUtils.addEdgeToCFA	line 145: Dead code detected: return (retValue_acc);

2017-05-11 16:41:49:353	INFO	CFACreationUtils.addEdgeToCFA	line 154: Dead code detected: return (retValue_acc);

2017-05-11 16:41:49:357	INFO	CFACreationUtils.addEdgeToCFA	line 209: Dead code detected: return (retValue_acc);

2017-05-11 16:41:49:366	INFO	CFACreationUtils.addEdgeToCFA	line 283: Dead code detected: return (retValue_acc);

2017-05-11 16:41:49:368	INFO	CFACreationUtils.addEdgeToCFA	line 315: Dead code detected: return (retValue_acc);

2017-05-11 16:41:49:369	INFO	CFACreationUtils.addEdgeToCFA	line 329: Dead code detected: return (retValue_acc);

2017-05-11 16:41:49:386	INFO	CFACreationUtils.addEdgeToCFA	line 414: Dead code detected: return (retValue_acc);

2017-05-11 16:41:49:388	INFO	CFACreationUtils.addEdgeToCFA	line 437: Dead code detected: return (retValue_acc);

2017-05-11 16:41:49:462	INFO	CFACreationUtils.addEdgeToCFA	line 757: Dead code detected: return (retValue_acc);

2017-05-11 16:41:49:477	INFO	CFACreationUtils.addEdgeToCFA	line 803: Dead code detected: return (retValue_acc);

2017-05-11 16:41:49:506	INFO	CFACreationUtils.addEdgeToCFA	line 925: Dead code detected: return (retValue_acc);

2017-05-11 16:41:49:666	WARNING	CFunctionPointerResolver.replaceFunctionPointerCall	line 594: Function pointer *__cil_tmp10 with type int (*)(int, int) is called, but no possible target functions were found.

2017-05-11 16:41:51:827	INFO	CPAchecker.runAlgorithm	Starting analysis ...

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

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

2017-05-11 16:41:52:461	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 16:41:53:398	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 16:41:53:528	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 16:41:53:618	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 16:41:54:096	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 16:41:54:099	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 16:41:54:109	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 16:41:54:150	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 16:41:54:748	INFO	Parallel analysis 1:AbstractBMCAlgorithm.run	Creating formula for program

2017-05-11 16:41:57:509	INFO	Parallel analysis 1:AbstractBMCAlgorithm.boundedModelCheck	Starting satisfiability check...

2017-05-11 16:41:57:558	INFO	Parallel analysis 1:AbstractBMCAlgorithm.checkBoundingAssertions	Starting assertions check...

2017-05-11 16:41:58:051	INFO	Parallel analysis 1:KInductionProver.check	Running algorithm to create induction hypothesis

2017-05-11 16:42:03:713	INFO	Parallel analysis 2:InvariantsCPA:InvariantsCPA$InterestingVariableLimitAdjuster.adjustConditions	Adjusting interestingVariableLimit to 1

2017-05-11 16:42:03:714	INFO	Parallel analysis 2:ParallelAlgorithm.runParallelAnalysis	Adjusting precision for CPA org.sosy_lab.cpachecker.cpa.invariants.InvariantsCPA@6a11c41a

2017-05-11 16:42:03:714	INFO	Parallel analysis 2:ParallelAlgorithm.runParallelAnalysis	Updating reached set provided to other analyses

2017-05-11 16:42:09:693	INFO	Parallel analysis 2:InvariantsCPA:InvariantsCPA$InterestingVariableLimitAdjuster.adjustConditions	Adjusting interestingVariableLimit to 2

2017-05-11 16:42:09:698	INFO	Parallel analysis 2:ParallelAlgorithm.runParallelAnalysis	Adjusting precision for CPA org.sosy_lab.cpachecker.cpa.invariants.InvariantsCPA@6a11c41a

2017-05-11 16:42:09:698	INFO	Parallel analysis 2:ParallelAlgorithm.runParallelAnalysis	Updating reached set provided to other analyses

2017-05-11 16:42:13:630	INFO	Parallel analysis 2:InvariantsCPA:InvariantsCPA$InterestingVariableLimitAdjuster.adjustConditions	Adjusting interestingVariableLimit to 4

2017-05-11 16:42:13:631	INFO	Parallel analysis 2:ParallelAlgorithm.runParallelAnalysis	Adjusting precision for CPA org.sosy_lab.cpachecker.cpa.invariants.InvariantsCPA@6a11c41a

2017-05-11 16:42:13:660	INFO	Parallel analysis 2:ParallelAlgorithm.runParallelAnalysis	Updating reached set provided to other analyses

2017-05-11 16:42:16:628	INFO	Parallel analysis 2:InvariantsCPA:InvariantsCPA$InterestingVariableLimitAdjuster.adjustConditions	Adjusting interestingVariableLimit to 8

2017-05-11 16:42:16:633	INFO	Parallel analysis 2:ParallelAlgorithm.runParallelAnalysis	Adjusting precision for CPA org.sosy_lab.cpachecker.cpa.invariants.InvariantsCPA@6a11c41a

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

2017-05-11 16:42:18:414	INFO	Parallel analysis 2:InvariantsCPA:InvariantsCPA$InterestingVariableLimitAdjuster.adjustConditions	Adjusting interestingVariableLimit to 16

2017-05-11 16:42:18:422	INFO	Parallel analysis 2:ParallelAlgorithm.runParallelAnalysis	Adjusting precision for CPA org.sosy_lab.cpachecker.cpa.invariants.InvariantsCPA@6a11c41a

2017-05-11 16:42:18:422	INFO	Parallel analysis 2:ParallelAlgorithm.runParallelAnalysis	Updating reached set provided to other analyses

2017-05-11 16:42:20:314	INFO	Parallel analysis 2:InvariantsCPA:InvariantsCPA$InterestingVariableLimitAdjuster.adjustConditions	Adjusting interestingVariableLimit to 20

2017-05-11 16:42:20:323	INFO	Parallel analysis 2:ParallelAlgorithm.runParallelAnalysis	Adjusting precision for CPA org.sosy_lab.cpachecker.cpa.invariants.InvariantsCPA@6a11c41a

2017-05-11 16:42:20:323	INFO	Parallel analysis 2:ParallelAlgorithm.runParallelAnalysis	Updating reached set provided to other analyses

2017-05-11 16:42:21:346	INFO	Parallel analysis 2:InvariantsCPA:InvariantsCPA$FormulaDepthAdjuster.adjustConditions	Adjusting maximum formula depth to 3

2017-05-11 16:42:21:347	INFO	Parallel analysis 2:ParallelAlgorithm.runParallelAnalysis	Adjusting precision for CPA org.sosy_lab.cpachecker.cpa.invariants.InvariantsCPA@6a11c41a

2017-05-11 16:42:21:347	INFO	Parallel analysis 2:ParallelAlgorithm.runParallelAnalysis	Updating reached set provided to other analyses

2017-05-11 16:42:21:670	INFO	Parallel analysis 1:KInductionProver.check	Starting induction check...

2017-05-11 16:42:22:183	INFO	Parallel analysis 2:InvariantsCPA:InvariantsCPA$InterestingVariableLimitAdjuster.adjustConditions	Adjusting interestingVariableLimit to 28

2017-05-11 16:42:22:184	INFO	Parallel analysis 2:ParallelAlgorithm.runParallelAnalysis	Adjusting precision for CPA org.sosy_lab.cpachecker.cpa.invariants.InvariantsCPA@6a11c41a

2017-05-11 16:42:22:184	INFO	Parallel analysis 2:ParallelAlgorithm.runParallelAnalysis	Updating reached set provided to other analyses

2017-05-11 16:42:24:341	INFO	Parallel analysis 2:InvariantsCPA:InvariantsCPA$InterestingVariableLimitAdjuster.adjustConditions	Adjusting interestingVariableLimit to 32

2017-05-11 16:42:24:360	INFO	Parallel analysis 2:ParallelAlgorithm.runParallelAnalysis	Adjusting precision for CPA org.sosy_lab.cpachecker.cpa.invariants.InvariantsCPA@6a11c41a

2017-05-11 16:42:24:360	INFO	Parallel analysis 2:ParallelAlgorithm.runParallelAnalysis	Updating reached set provided to other analyses

2017-05-11 16:42:29:724	INFO	Parallel analysis 2:InvariantsCPA:InvariantsCPA$InterestingVariableLimitAdjuster.adjustConditions	Adjusting interestingVariableLimit to 34

2017-05-11 16:42:29:725	INFO	Parallel analysis 2:ParallelAlgorithm.runParallelAnalysis	Adjusting precision for CPA org.sosy_lab.cpachecker.cpa.invariants.InvariantsCPA@6a11c41a

2017-05-11 16:42:29:725	INFO	Parallel analysis 2:ParallelAlgorithm.runParallelAnalysis	Updating reached set provided to other analyses

2017-05-11 16:42:33:274	INFO	Parallel analysis 2:InvariantsCPA:InvariantsCPA$InterestingVariableLimitAdjuster.adjustConditions	Adjusting interestingVariableLimit to 38

2017-05-11 16:42:33:274	INFO	Parallel analysis 2:ParallelAlgorithm.runParallelAnalysis	Adjusting precision for CPA org.sosy_lab.cpachecker.cpa.invariants.InvariantsCPA@6a11c41a

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

2017-05-11 16:42:39:959	INFO	Parallel analysis 1:BoundsCPA:BoundsCPA.adjustPrecision	Adjusting maxLoopIterations to 2

2017-05-11 16:42:39:960	INFO	Parallel analysis 1:AbstractBMCAlgorithm.run	Creating formula for program

2017-05-11 16:42:39:968	INFO	Parallel analysis 1:AbstractBMCAlgorithm.boundedModelCheck	Starting satisfiability check...

2017-05-11 16:42:39:979	INFO	Parallel analysis 1:AbstractBMCAlgorithm.checkBoundingAssertions	Starting assertions check...

2017-05-11 16:42:40:028	INFO	Parallel analysis 1:KInductionProver.check	Running algorithm to create induction hypothesis

2017-05-11 16:42:46:880	INFO	Parallel analysis 2:InvariantsCPA:InvariantsCPA$InterestingVariableLimitAdjuster.adjustConditions	Adjusting interestingVariableLimit to 40

2017-05-11 16:42:46:881	INFO	Parallel analysis 2:ParallelAlgorithm.runParallelAnalysis	Adjusting precision for CPA org.sosy_lab.cpachecker.cpa.invariants.InvariantsCPA@6a11c41a

2017-05-11 16:42:46:882	INFO	Parallel analysis 2:ParallelAlgorithm.runParallelAnalysis	Updating reached set provided to other analyses

2017-05-11 16:42:50:437	INFO	Parallel analysis 1:KInductionProver.check	Starting induction check...

2017-05-11 16:43:01:907	INFO	Parallel analysis 1:BoundsCPA:BoundsCPA.adjustPrecision	Adjusting maxLoopIterations to 3

2017-05-11 16:43:01:911	INFO	Parallel analysis 1:AbstractBMCAlgorithm.run	Creating formula for program

2017-05-11 16:43:01:920	INFO	Parallel analysis 1:AbstractBMCAlgorithm.boundedModelCheck	Starting satisfiability check...

2017-05-11 16:43:01:925	INFO	Parallel analysis 1:AbstractBMCAlgorithm.checkBoundingAssertions	Starting assertions check...

2017-05-11 16:43:01:964	INFO	Parallel analysis 1:KInductionProver.check	Running algorithm to create induction hypothesis

2017-05-11 16:43:09:100	INFO	Parallel analysis 1:KInductionProver.check	Starting induction check...

2017-05-11 16:43:11:939	INFO	Parallel analysis 2:InvariantsCPA:InvariantsCPA$InterestingVariableLimitAdjuster.adjustConditions	Adjusting interestingVariableLimit to 41

2017-05-11 16:43:11:940	INFO	Parallel analysis 2:ParallelAlgorithm.runParallelAnalysis	Adjusting precision for CPA org.sosy_lab.cpachecker.cpa.invariants.InvariantsCPA@6a11c41a

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

2017-05-11 16:43:33:094	INFO	Parallel analysis 1:BoundsCPA:BoundsCPA.adjustPrecision	Adjusting maxLoopIterations to 4

2017-05-11 16:43:33:095	INFO	Parallel analysis 1:AbstractBMCAlgorithm.run	Creating formula for program

2017-05-11 16:43:33:102	INFO	Parallel analysis 1:AbstractBMCAlgorithm.boundedModelCheck	Starting satisfiability check...

2017-05-11 16:43:33:103	INFO	Parallel analysis 1:AbstractBMCAlgorithm.checkBoundingAssertions	Starting assertions check...

2017-05-11 16:43:33:153	INFO	Parallel analysis 1:KInductionProver.check	Running algorithm to create induction hypothesis

2017-05-11 16:43:37:083	INFO	Parallel analysis 2:InvariantsCPA:InvariantsCPA$InterestingVariableLimitAdjuster.adjustConditions	Adjusting interestingVariableLimit to 42

2017-05-11 16:43:37:084	INFO	Parallel analysis 2:ParallelAlgorithm.runParallelAnalysis	Adjusting precision for CPA org.sosy_lab.cpachecker.cpa.invariants.InvariantsCPA@6a11c41a

2017-05-11 16:43:37:084	INFO	Parallel analysis 2:ParallelAlgorithm.runParallelAnalysis	Updating reached set provided to other analyses

2017-05-11 16:43:48:025	INFO	Parallel analysis 1:KInductionProver.check	Starting induction check...

2017-05-11 16:44:02:034	INFO	Parallel analysis 2:InvariantsCPA:InvariantsCPA$InterestingVariableLimitAdjuster.adjustConditions	Adjusting interestingVariableLimit to 44

2017-05-11 16:44:02:035	INFO	Parallel analysis 2:ParallelAlgorithm.runParallelAnalysis	Adjusting precision for CPA org.sosy_lab.cpachecker.cpa.invariants.InvariantsCPA@6a11c41a

2017-05-11 16:44:02:035	INFO	Parallel analysis 2:ParallelAlgorithm.runParallelAnalysis	Updating reached set provided to other analyses

2017-05-11 16:44:21:638	INFO	Parallel analysis 1:BoundsCPA:BoundsCPA.adjustPrecision	Adjusting maxLoopIterations to 5

2017-05-11 16:44:21:639	INFO	Parallel analysis 1:AbstractBMCAlgorithm.run	Creating formula for program

2017-05-11 16:44:22:066	INFO	Parallel analysis 1:AbstractBMCAlgorithm.boundedModelCheck	Starting satisfiability check...

2017-05-11 16:44:26:141	INFO	Parallel analysis 1:BMCAlgorithm.analyzeCounterexample	Error found, creating error path

2017-05-11 16:44:27:848	INFO	Parallel analysis 1:CounterexampleCheckAlgorithm.checkCounterexample	Error path found, starting counterexample check with CBMC.

2017-05-11 16:44:28:480	INFO	Parallel analysis 1:CounterexampleCheckAlgorithm.checkCounterexample	Error path found but identified as infeasible.

2017-05-11 16:44:28:480	INFO	Parallel analysis 1:CounterexampleCheckAlgorithm.checkCounterexample	Error path found, starting counterexample check with CBMC.

2017-05-11 16:44:29:059	INFO	Parallel analysis 1:CounterexampleCheckAlgorithm.checkCounterexample	Error path found but identified as infeasible.

2017-05-11 16:44:29:060	INFO	Parallel analysis 1:CounterexampleCheckAlgorithm.checkCounterexample	Error path found, starting counterexample check with CBMC.

2017-05-11 16:44:29:689	INFO	Parallel analysis 1:CounterexampleCheckAlgorithm.checkCounterexample	Error path found but identified as infeasible.

2017-05-11 16:44:29:689	INFO	Parallel analysis 1:CounterexampleCheckAlgorithm.checkCounterexample	Error path found, starting counterexample check with CBMC.

2017-05-11 16:44:30:489	INFO	Parallel analysis 1:CounterexampleCheckAlgorithm.checkCounterexample	Error path found but identified as infeasible.

2017-05-11 16:44:30:489	INFO	Parallel analysis 1:CounterexampleCheckAlgorithm.checkCounterexample	Error path found, starting counterexample check with CBMC.

2017-05-11 16:44:31:290	INFO	Parallel analysis 1:CounterexampleCheckAlgorithm.checkCounterexample	Error path found and confirmed by counterexample check with CBMC.

2017-05-11 16:44:31:294	INFO	ParallelAlgorithm.handleFutureResults	/lustre/work/anon/anon/cfc/analyzers/cpachecker/config/components/kInduction/svcomp16-kInduction.properties finished successfully.

2017-05-11 16:44:31:300	INFO	Parallel analysis 2:ParallelAlgorithm.runParallelAnalysis	Analysis was terminated

2017-05-11 16:44:31:300	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:            5 (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:         5 (100%)
  Times precision was empty:       5 (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:         526
  BDD entailment checks:           0
Number of SMT sat checks:          0
  trivial:                         0
  cached:                          0

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

Time for post operator:                  2.236s
  Time for path formula creation:        2.236s
Time for strengthen operator:            0.005s
Time for prec operator:                  0.004s
  Time for abstraction:                  0.000s (Max:     0.000s, Count: 5)
    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.033s
Time for coverage check:                 0.000s
Total time for SMT solver (w/o itp):     0.000s

Total number of created targets for pointer analysis: 392
   Number of created targets for uf: *signed_int is 57



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

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

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


ValueAnalysisCPA statistics
---------------------------
Number of variables:                                  22209 (count: 1388, min: 0, max: 29, avg: 16.00)
Number of global variables:                           14139 (count: 1388, min: 0, max: 17, avg: 10.19)

ValueAnalysisPrecisionAdjustment statistics
-------------------------------------------
Number of abstraction computations:                    1654
Total time for liveness abstraction:                   0.000s
Total time for abstraction computation:                0.052s
Total time for path thresholds:                        0.000s
Number of tracked memory locations:                58

ValueAnalysisTransferRelation statistics
----------------------------------------
Number of Assumptions:                                  746
Number of deterministic Assumptions:                    120
Level of Determinism:                              16%

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.029s
Automaton transfers with branching:                0
Automaton transfer successors:                         1654 (count: 1659, min: 0, max: 1, avg: 1.00) [0 x 5, 1 x 1654]

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

Total time for CPA algorithm:         3.190s (Max:     2.746s)
  Time for choose from waitlist:      0.003s
  Time for precision adjustment:      0.093s
  Time for transfer relation:         2.999s
  Time for merge operator:            0.060s
  Time for stop operator:             0.016s
  Time for adding to reached set:     0.004s

BMC algorithm statistics
------------------------
Time for BMC formula creation:           3.203s
Time for final sat check:                4.075s
Time for error path creation:            1.439s
Time for bounding assertions check:      0.305s
Time for induction formula creation:    55.993s
Time for induction check:               87.355s

Counterexample-Check Algorithm statistics
-----------------------------------------
Number of counterexample checks:    1
Number of infeasible paths:         4 (400%)
Time for counterexample checks:         3.442s
Time for running CBMC:                  3.191s


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.631s
  Time for transition matches:                         0.278s
  Time for transition assertions:                      0.000s
  Time for transition actions:                         0.002s
Automaton transfers with branching:                0
Automaton transfer successors:                       131953 (count: 132234, min: 0, max: 1, avg: 1.00) [0 x 281, 1 x 131953]

CPA algorithm statistics
------------------------
Number of iterations:            117293
Max size of waitlist:            313
Average size of waitlist:        103
Number of computed successors:   131953
Max successors for one state:    2
Number of times merged:          30459
Number of times stopped:         32687
Number of times breaked:         0

Total time for CPA algorithm:       154.691s (Max:    29.236s)
  Time for choose from waitlist:      0.188s
  Time for precision adjustment:      2.608s
  Time for transfer relation:        32.338s
  Time for merge operator:          110.201s
  Time for stop operator:             7.184s
  Time for adding to reached set:     0.791s


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

Code Coverage
-----------------------------
  Function coverage:      0.649
  Visited lines:          114
  Total lines:            414
  Line coverage:          0.275
  Visited conditions:     147
  Total conditions:       190
  Condition coverage:     0.774

CPAchecker general statistics
-----------------------------
Number of program locations:     745
Number of CFA edges:             887
Number of relevant variables:    146
Number of functions:             37
Number of loops:                 9
Size of reached set:             1388
  Number of reached locations:   377 (51%)
    Avg states per location:     3
    Max states per location:     9 (at node N122)
  Number of reached functions:   24 (65%)
  Number of partitions:          1388
    Avg size of partitions:      1
    Max size of partitions:      1
  Number of target states:       5

Time for analysis setup:          4.156s
  Time for loading CPAs:          1.650s
  Time for loading parser:        0.660s
  Time for CFA construction:      1.740s
    Time for parsing file(s):     0.496s
    Time for AST to CFA:          0.546s
    Time for CFA sanity check:    0.163s
    Time for post-processing:     0.478s
      Time for var class.:        0.268s
    Time for CFA export:          1.459s
Time for Analysis:              159.469s
CPU time for analysis:          313.860s
Time for analyzing result:        0.001s
Total time for CPAchecker:      163.641s
Total CPU time for CPAchecker:  321.210s
Time for statistics:              4.363s

Time for Garbage Collector:      14.171s (in 122 runs)
Garbage Collector(s) used:    PS MarkSweep, PS Scavenge
Used heap memory:                615MB (   587 MiB) max;    281MB (   268 MiB) avg;    642MB (   613 MiB) peak
Used non-heap memory:             53MB (    51 MiB) max;     50MB (    47 MiB) avg;     59MB (    56 MiB) peak
Used in PS Old Gen pool:         208MB (   198 MiB) max;     94MB (    89 MiB) avg;    210MB (   200 MiB) peak
Allocated heap memory:          1205MB (  1150 MiB) max;    785MB (   749 MiB) avg
Allocated non-heap memory:        55MB (    53 MiB) max;     52MB (    50 MiB) avg
Total process virtual memory:   6802MB (  6487 MiB) max;   6481MB (  6180 MiB) avg

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