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

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

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

2017-05-11 16:50:43:204	INFO	CFACreationUtils.addEdgeToCFA	line 356: Dead code detected: return (retValue_acc);

2017-05-11 16:50:43:210	INFO	CFACreationUtils.addEdgeToCFA	line 402: Dead code detected: return (retValue_acc);

2017-05-11 16:50:43:242	INFO	CFACreationUtils.addEdgeToCFA	line 627: Dead code detected: return (retValue_acc);

2017-05-11 16:50:43:243	INFO	CFACreationUtils.addEdgeToCFA	line 636: Dead code detected: return (retValue_acc);

2017-05-11 16:50:43:247	INFO	CFACreationUtils.addEdgeToCFA	line 691: Dead code detected: return (retValue_acc);

2017-05-11 16:50:43:249	INFO	CFACreationUtils.addEdgeToCFA	line 710: Dead code detected: return (retValue_acc);

2017-05-11 16:50:43:253	INFO	CFACreationUtils.addEdgeToCFA	line 748: Dead code detected: return (retValue_acc);

2017-05-11 16:50:43:256	INFO	CFACreationUtils.addEdgeToCFA	line 771: Dead code detected: return (retValue_acc);

2017-05-11 16:50:43:269	INFO	CFACreationUtils.addEdgeToCFA	line 903: Dead code detected: return (retValue_acc);

2017-05-11 16:50:43:273	INFO	CFACreationUtils.addEdgeToCFA	line 952: Dead code detected: return (retValue_acc);

2017-05-11 16:50:43:277	INFO	CFACreationUtils.addEdgeToCFA	line 984: Dead code detected: return (retValue_acc);

2017-05-11 16:50:43:279	INFO	CFACreationUtils.addEdgeToCFA	line 998: Dead code detected: return (retValue_acc);

2017-05-11 16:50:43:280	INFO	CFACreationUtils.addEdgeToCFA	line 1007: Dead code detected: return (retValue_acc);

2017-05-11 16:50:43:401	WARNING	CFunctionPointerResolver.replaceFunctionPointerCall	line 193: Function pointer *__cil_tmp10 with type int (*)(int, int) is called, but no possible target functions were found.

2017-05-11 16:50:44:323	INFO	CPAchecker.runAlgorithm	Starting analysis ...

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

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

2017-05-11 16:50:44:553	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:50:45:137	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:50:45:228	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:50:45:316	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:50:45:611	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:50:45:615	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:50:45:635	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:50:45:654	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:50:46:075	INFO	Parallel analysis 1:AbstractBMCAlgorithm.run	Creating formula for program

2017-05-11 16:50:48:330	INFO	Parallel analysis 2:InvariantsCPA:InvariantsCPA$InterestingVariableLimitAdjuster.adjustConditions	Adjusting interestingVariableLimit to 1

2017-05-11 16:50:48:331	INFO	Parallel analysis 2:ParallelAlgorithm.runParallelAnalysis	Adjusting precision for CPA org.sosy_lab.cpachecker.cpa.invariants.InvariantsCPA@281b91f8

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

2017-05-11 16:50:48:709	INFO	Parallel analysis 1:AbstractBMCAlgorithm.boundedModelCheck	Starting satisfiability check...

2017-05-11 16:50:48:737	INFO	Parallel analysis 1:AbstractBMCAlgorithm.checkBoundingAssertions	Starting assertions check...

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

2017-05-11 16:50:50:786	INFO	Parallel analysis 2:InvariantsCPA:InvariantsCPA$InterestingVariableLimitAdjuster.adjustConditions	Adjusting interestingVariableLimit to 2

2017-05-11 16:50:50:786	INFO	Parallel analysis 2:ParallelAlgorithm.runParallelAnalysis	Adjusting precision for CPA org.sosy_lab.cpachecker.cpa.invariants.InvariantsCPA@281b91f8

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

2017-05-11 16:50:52:020	INFO	Parallel analysis 2:InvariantsCPA:InvariantsCPA$InterestingVariableLimitAdjuster.adjustConditions	Adjusting interestingVariableLimit to 4

2017-05-11 16:50:52:023	INFO	Parallel analysis 2:ParallelAlgorithm.runParallelAnalysis	Adjusting precision for CPA org.sosy_lab.cpachecker.cpa.invariants.InvariantsCPA@281b91f8

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

2017-05-11 16:50:53:471	INFO	Parallel analysis 2:InvariantsCPA:InvariantsCPA$InterestingVariableLimitAdjuster.adjustConditions	Adjusting interestingVariableLimit to 5

2017-05-11 16:50:53:480	INFO	Parallel analysis 2:ParallelAlgorithm.runParallelAnalysis	Adjusting precision for CPA org.sosy_lab.cpachecker.cpa.invariants.InvariantsCPA@281b91f8

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

2017-05-11 16:50:54:569	INFO	Parallel analysis 2:InvariantsCPA:InvariantsCPA$FormulaDepthAdjuster.adjustConditions	Adjusting maximum formula depth to 3

2017-05-11 16:50:54:569	INFO	Parallel analysis 2:ParallelAlgorithm.runParallelAnalysis	Adjusting precision for CPA org.sosy_lab.cpachecker.cpa.invariants.InvariantsCPA@281b91f8

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

2017-05-11 16:50:55:078	INFO	Parallel analysis 2:InvariantsCPA:InvariantsCPA$InterestingVariableLimitAdjuster.adjustConditions	Adjusting interestingVariableLimit to 7

2017-05-11 16:50:55:078	INFO	Parallel analysis 2:ParallelAlgorithm.runParallelAnalysis	Adjusting precision for CPA org.sosy_lab.cpachecker.cpa.invariants.InvariantsCPA@281b91f8

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

2017-05-11 16:50:56:296	INFO	Parallel analysis 2:InvariantsCPA:InvariantsCPA$InterestingVariableLimitAdjuster.adjustConditions	Adjusting interestingVariableLimit to 8

2017-05-11 16:50:56:303	INFO	Parallel analysis 2:ParallelAlgorithm.runParallelAnalysis	Adjusting precision for CPA org.sosy_lab.cpachecker.cpa.invariants.InvariantsCPA@281b91f8

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

2017-05-11 16:50:57:064	INFO	Parallel analysis 2:InvariantsCPA:InvariantsCPA$InterestingVariableLimitAdjuster.adjustConditions	Adjusting interestingVariableLimit to 10

2017-05-11 16:50:57:065	INFO	Parallel analysis 2:ParallelAlgorithm.runParallelAnalysis	Adjusting precision for CPA org.sosy_lab.cpachecker.cpa.invariants.InvariantsCPA@281b91f8

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

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

2017-05-11 16:50:57:550	INFO	Parallel analysis 2:ParallelAlgorithm.runParallelAnalysis	Adjusting precision for CPA org.sosy_lab.cpachecker.cpa.invariants.InvariantsCPA@281b91f8

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

2017-05-11 16:50:58:571	INFO	Parallel analysis 2:InvariantsCPA:InvariantsCPA$InterestingVariableLimitAdjuster.adjustConditions	Adjusting interestingVariableLimit to 16

2017-05-11 16:50:58:581	INFO	Parallel analysis 2:ParallelAlgorithm.runParallelAnalysis	Adjusting precision for CPA org.sosy_lab.cpachecker.cpa.invariants.InvariantsCPA@281b91f8

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

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

2017-05-11 16:50:59:906	INFO	Parallel analysis 2:InvariantsCPA:InvariantsCPA$InterestingVariableLimitAdjuster.adjustConditions	Adjusting interestingVariableLimit to 17

2017-05-11 16:50:59:906	INFO	Parallel analysis 2:ParallelAlgorithm.runParallelAnalysis	Adjusting precision for CPA org.sosy_lab.cpachecker.cpa.invariants.InvariantsCPA@281b91f8

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

2017-05-11 16:51:03:026	INFO	Parallel analysis 2:InvariantsCPA:InvariantsCPA$InterestingVariableLimitAdjuster.adjustConditions	Adjusting interestingVariableLimit to 18

2017-05-11 16:51:03:026	INFO	Parallel analysis 2:ParallelAlgorithm.runParallelAnalysis	Adjusting precision for CPA org.sosy_lab.cpachecker.cpa.invariants.InvariantsCPA@281b91f8

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

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

2017-05-11 16:51:05:053	INFO	Parallel analysis 2:ParallelAlgorithm.runParallelAnalysis	Adjusting precision for CPA org.sosy_lab.cpachecker.cpa.invariants.InvariantsCPA@281b91f8

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

2017-05-11 16:51:06:831	INFO	Parallel analysis 2:InvariantsCPA:InvariantsCPA$InterestingVariableLimitAdjuster.adjustConditions	Adjusting interestingVariableLimit to 24

2017-05-11 16:51:06:831	INFO	Parallel analysis 2:ParallelAlgorithm.runParallelAnalysis	Adjusting precision for CPA org.sosy_lab.cpachecker.cpa.invariants.InvariantsCPA@281b91f8

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

2017-05-11 16:51:08:587	INFO	Parallel analysis 2:InvariantsCPA:InvariantsCPA$InterestingVariableLimitAdjuster.adjustConditions	Adjusting interestingVariableLimit to 32

2017-05-11 16:51:08:587	INFO	Parallel analysis 2:ParallelAlgorithm.runParallelAnalysis	Adjusting precision for CPA org.sosy_lab.cpachecker.cpa.invariants.InvariantsCPA@281b91f8

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

2017-05-11 16:51:13:018	INFO	Parallel analysis 2:InvariantsCPA:InvariantsCPA$InterestingVariableLimitAdjuster.adjustConditions	Adjusting interestingVariableLimit to 36

2017-05-11 16:51:13:019	INFO	Parallel analysis 2:ParallelAlgorithm.runParallelAnalysis	Adjusting precision for CPA org.sosy_lab.cpachecker.cpa.invariants.InvariantsCPA@281b91f8

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

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

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

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

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

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

2017-05-11 16:51:25:053	INFO	Parallel analysis 1:KInductionProver.check	Starting induction check...

2017-05-11 16:51:30:382	INFO	Parallel analysis 1:BoundsCPA:BoundsCPA.adjustPrecision	Adjusting maxLoopIterations to 3

2017-05-11 16:51:30:383	INFO	Parallel analysis 1:AbstractBMCAlgorithm.run	Creating formula for program

2017-05-11 16:51:30:390	INFO	Parallel analysis 1:AbstractBMCAlgorithm.boundedModelCheck	Starting satisfiability check...

2017-05-11 16:51:30:391	INFO	Parallel analysis 1:AbstractBMCAlgorithm.checkBoundingAssertions	Starting assertions check...

2017-05-11 16:51:30:425	INFO	Parallel analysis 1:KInductionProver.check	Running algorithm to create induction hypothesis

2017-05-11 16:51:31:460	INFO	Parallel analysis 2:InvariantsCPA:InvariantsCPA$InterestingVariableLimitAdjuster.adjustConditions	Adjusting interestingVariableLimit to 38

2017-05-11 16:51:31:460	INFO	Parallel analysis 2:ParallelAlgorithm.runParallelAnalysis	Adjusting precision for CPA org.sosy_lab.cpachecker.cpa.invariants.InvariantsCPA@281b91f8

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

2017-05-11 16:51:36:020	INFO	Parallel analysis 1:KInductionProver.check	Starting induction check...

2017-05-11 16:51:48:399	INFO	Parallel analysis 2:InvariantsCPA:InvariantsCPA$InterestingVariableLimitAdjuster.adjustConditions	Adjusting interestingVariableLimit to 42

2017-05-11 16:51:48:400	INFO	Parallel analysis 2:ParallelAlgorithm.runParallelAnalysis	Adjusting precision for CPA org.sosy_lab.cpachecker.cpa.invariants.InvariantsCPA@281b91f8

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

2017-05-11 16:52:05:000	INFO	Parallel analysis 2:InvariantsCPA:InvariantsCPA$InterestingVariableLimitAdjuster.adjustConditions	Adjusting interestingVariableLimit to 50

2017-05-11 16:52:05:000	INFO	Parallel analysis 2:ParallelAlgorithm.runParallelAnalysis	Adjusting precision for CPA org.sosy_lab.cpachecker.cpa.invariants.InvariantsCPA@281b91f8

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

2017-05-11 16:52:17:590	INFO	Parallel analysis 1:BoundsCPA:BoundsCPA.adjustPrecision	Adjusting maxLoopIterations to 4

2017-05-11 16:52:17:590	INFO	Parallel analysis 1:AbstractBMCAlgorithm.run	Creating formula for program

2017-05-11 16:52:17:597	INFO	Parallel analysis 1:AbstractBMCAlgorithm.boundedModelCheck	Starting satisfiability check...

2017-05-11 16:52:17:598	INFO	Parallel analysis 1:AbstractBMCAlgorithm.checkBoundingAssertions	Starting assertions check...

2017-05-11 16:52:17:641	INFO	Parallel analysis 1:KInductionProver.check	Running algorithm to create induction hypothesis

2017-05-11 16:52:23:681	INFO	Parallel analysis 1:KInductionProver.check	Starting induction check...

2017-05-11 16:52:33:115	INFO	Parallel analysis 1:BoundsCPA:BoundsCPA.adjustPrecision	Adjusting maxLoopIterations to 5

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

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

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

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

2017-05-11 16:52:45:792	INFO	Parallel analysis 1:KInductionProver.check	Starting induction check...

2017-05-11 16:53:02:837	INFO	Parallel analysis 2:InvariantsCPA:InvariantsCPA$InterestingVariableLimitAdjuster.adjustConditions	Adjusting interestingVariableLimit to 54

2017-05-11 16:53:02:838	INFO	Parallel analysis 2:ParallelAlgorithm.runParallelAnalysis	Adjusting precision for CPA org.sosy_lab.cpachecker.cpa.invariants.InvariantsCPA@281b91f8

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

2017-05-11 16:53:30:520	INFO	Parallel analysis 1:BoundsCPA:BoundsCPA.adjustPrecision	Adjusting maxLoopIterations to 6

2017-05-11 16:53:30:520	INFO	Parallel analysis 1:AbstractBMCAlgorithm.run	Creating formula for program

2017-05-11 16:53:30:930	INFO	Parallel analysis 1:AbstractBMCAlgorithm.boundedModelCheck	Starting satisfiability check...

2017-05-11 16:53:36:196	INFO	Parallel analysis 1:BMCAlgorithm.analyzeCounterexample	Error found, creating error path

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

2017-05-11 16:53:38:056	INFO	Parallel analysis 1:CounterexampleCheckAlgorithm.checkCounterexample	Error path found but identified as infeasible.

2017-05-11 16:53:38:056	INFO	Parallel analysis 1:CounterexampleCheckAlgorithm.checkCounterexample	Error path found, starting counterexample check with CBMC.

2017-05-11 16:53:38:367	INFO	Parallel analysis 1:CounterexampleCheckAlgorithm.checkCounterexample	Error path found but identified as infeasible.

2017-05-11 16:53:38:367	INFO	Parallel analysis 1:CounterexampleCheckAlgorithm.checkCounterexample	Error path found, starting counterexample check with CBMC.

2017-05-11 16:53:38:768	INFO	Parallel analysis 1:CounterexampleCheckAlgorithm.checkCounterexample	Error path found but identified as infeasible.

2017-05-11 16:53:38:768	INFO	Parallel analysis 1:CounterexampleCheckAlgorithm.checkCounterexample	Error path found, starting counterexample check with CBMC.

2017-05-11 16:53:39:363	INFO	Parallel analysis 1:CounterexampleCheckAlgorithm.checkCounterexample	Error path found but identified as infeasible.

2017-05-11 16:53:39:368	INFO	Parallel analysis 1:CounterexampleCheckAlgorithm.checkCounterexample	Error path found, starting counterexample check with CBMC.

2017-05-11 16:53:39:995	INFO	Parallel analysis 1:CounterexampleCheckAlgorithm.checkCounterexample	Error path found but identified as infeasible.

2017-05-11 16:53:39:995	INFO	Parallel analysis 1:CounterexampleCheckAlgorithm.checkCounterexample	Error path found, starting counterexample check with CBMC.

2017-05-11 16:53:41:108	INFO	Parallel analysis 1:CounterexampleCheckAlgorithm.checkCounterexample	Error path found and confirmed by counterexample check with CBMC.

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

2017-05-11 16:53:41:118	INFO	Parallel analysis 2:ParallelAlgorithm.runParallelAnalysis	Analysis was terminated

2017-05-11 16:53:41:119	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:         348
  BDD entailment checks:           0
Number of SMT sat checks:          0
  trivial:                         0
  cached:                          0

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

Time for post operator:                  2.110s
  Time for path formula creation:        2.108s
Time for strengthen operator:            0.018s
Time for prec operator:                  0.006s
  Time for abstraction:                  0.001s (Max:     0.001s, 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.047s
Time for coverage check:                 0.000s
Total time for SMT solver (w/o itp):     0.000s

Total number of created targets for pointer analysis: 648
   Number of created targets for uf: *signed_int is 181



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:                                  30917 (count: 2054, min: 0, max: 20, avg: 15.05)
Number of global variables:                           20157 (count: 2054, min: 0, max: 14, avg: 9.81)

ValueAnalysisPrecisionAdjustment statistics
-------------------------------------------
Number of abstraction computations:                    2232
Total time for liveness abstraction:                   0.000s
Total time for abstraction computation:                0.037s
Total time for path thresholds:                        0.000s
Number of tracked memory locations:                49

ValueAnalysisTransferRelation statistics
----------------------------------------
Number of Assumptions:                                  572
Number of deterministic Assumptions:                    140
Level of Determinism:                              24%

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

CPA algorithm statistics
------------------------
Number of iterations:            2064
Max size of waitlist:            9
Average size of waitlist:        3
Number of computed successors:   2232
Max successors for one state:    2
Number of times merged:          174
Number of times stopped:         174
Number of times breaked:         0

Total time for CPA algorithm:         3.059s (Max:     2.627s)
  Time for choose from waitlist:      0.001s
  Time for precision adjustment:      0.069s
  Time for transfer relation:         2.852s
  Time for merge operator:            0.056s
  Time for stop operator:             0.009s
  Time for adding to reached set:     0.055s

BMC algorithm statistics
------------------------
Time for BMC formula creation:           3.064s
Time for final sat check:                5.267s
Time for error path creation:            1.187s
Time for bounding assertions check:      0.323s
Time for induction formula creation:    39.607s
Time for induction check:              121.449s

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


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.557s
  Time for transition matches:                         0.260s
  Time for transition assertions:                      0.000s
  Time for transition actions:                         0.001s
Automaton transfers with branching:                0
Automaton transfer successors:                       162051 (count: 162330, min: 0, max: 1, avg: 1.00) [0 x 279, 1 x 162051]

CPA algorithm statistics
------------------------
Number of iterations:            154730
Max size of waitlist:            246
Average size of waitlist:        97
Number of computed successors:   162051
Max successors for one state:    2
Number of times merged:          28643
Number of times stopped:         31593
Number of times breaked:         0

Total time for CPA algorithm:       173.123s (Max:    57.804s)
  Time for choose from waitlist:      0.165s
  Time for precision adjustment:      1.514s
  Time for transfer relation:        18.992s
  Time for merge operator:          140.980s
  Time for stop operator:             9.942s
  Time for adding to reached set:     0.559s


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

Code Coverage
-----------------------------
  Function coverage:      0.707
  Visited lines:          145
  Total lines:            442
  Line coverage:          0.328
  Visited conditions:     82
  Total conditions:       116
  Condition coverage:     0.707

CPAchecker general statistics
-----------------------------
Number of program locations:     728
Number of CFA edges:             851
Number of relevant variables:    152
Number of functions:             41
Number of loops:                 9
Size of reached set:             2054
  Number of reached locations:   370 (51%)
    Avg states per location:     5
    Max states per location:     21 (at node N406)
  Number of reached functions:   29 (71%)
  Number of partitions:          2054
    Avg size of partitions:      1
    Max size of partitions:      1
  Number of target states:       6

Time for analysis setup:          2.352s
  Time for loading CPAs:          0.550s
  Time for loading parser:        0.446s
  Time for CFA construction:      1.285s
    Time for parsing file(s):     0.335s
    Time for AST to CFA:          0.415s
    Time for CFA sanity check:    0.112s
    Time for post-processing:     0.369s
      Time for var class.:        0.217s
    Time for CFA export:          0.508s
Time for Analysis:              176.793s
CPU time for analysis:          428.760s
Time for analyzing result:        0.001s
Total time for CPAchecker:      179.159s
Total CPU time for CPAchecker:  435.090s
Time for statistics:              2.672s

Time for Garbage Collector:      15.782s (in 194 runs)
Garbage Collector(s) used:    PS MarkSweep, PS Scavenge
Used heap memory:                650MB (   620 MiB) max;    332MB (   317 MiB) avg;    683MB (   651 MiB) peak
Used non-heap memory:             54MB (    52 MiB) max;     51MB (    48 MiB) avg;     61MB (    58 MiB) peak
Used in PS Old Gen pool:         249MB (   237 MiB) max;    139MB (   132 MiB) avg;    250MB (   238 MiB) peak
Allocated heap memory:          1205MB (  1150 MiB) max;    941MB (   898 MiB) avg
Allocated non-heap memory:        56MB (    54 MiB) max;     54MB (    51 MiB) avg
Total process virtual memory:   8570MB (  8173 MiB) max;   8188MB (  7809 MiB) avg

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