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

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

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

2017-05-11 15:13:02:910	INFO	CFACreationUtils.addEdgeToCFA	line 394: Dead code detected: return (retValue_acc);

2017-05-11 15:13:02:916	INFO	CFACreationUtils.addEdgeToCFA	line 440: Dead code detected: return (retValue_acc);

2017-05-11 15:13:02:920	INFO	CFACreationUtils.addEdgeToCFA	line 492: Dead code detected: return (retValue_acc);

2017-05-11 15:13:02:921	INFO	CFACreationUtils.addEdgeToCFA	line 524: Dead code detected: return (retValue_acc);

2017-05-11 15:13:02:963	INFO	CFACreationUtils.addEdgeToCFA	line 697: Dead code detected: return (retValue_acc);

2017-05-11 15:13:02:965	INFO	CFACreationUtils.addEdgeToCFA	line 706: Dead code detected: return (retValue_acc);

2017-05-11 15:13:02:970	INFO	CFACreationUtils.addEdgeToCFA	line 780: Dead code detected: return (retValue_acc);

2017-05-11 15:13:02:972	INFO	CFACreationUtils.addEdgeToCFA	line 803: Dead code detected: return (retValue_acc);

2017-05-11 15:13:02:984	INFO	CFACreationUtils.addEdgeToCFA	line 899: Dead code detected: return (retValue_acc);

2017-05-11 15:13:03:107	WARNING	CFunctionPointerResolver.replaceFunctionPointerCall	line 231: Function pointer *__cil_tmp10 with type int (*)(int, int) is called, but no possible target functions were found.

2017-05-11 15:13:04:059	INFO	CPAchecker.runAlgorithm	Starting analysis ...

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

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

2017-05-11 15:13:04:302	WARNING	Parallel analysis 1:PredicateCPA:JavaSMT:Mathsat5SolverContext.<init>	MathSAT5 is available for research and evaluation purposes only. It can not be used in a commercial environment, particularly as part of a commercial product, without written permission. MathSAT5 is provided as is, without any warranty. Please write to mathsat@fbk.eu for additional questions regarding licensing MathSAT5 or obtaining more up-to-date versions.

2017-05-11 15:13:04:852	INFO	Parallel analysis 1:PredicateCPA:PredicateCPA.<init>	Using predicate analysis with MathSAT5 version 5.3.14 (0b98b661254c) (Nov 17 2016 10:59:45, gmp 5.1.3, gcc 4.8.5, 64-bit).

2017-05-11 15:13:04:938	WARNING	Parallel analysis 1:AssumptionStorageCPA:JavaSMT:Mathsat5SolverContext.<init>	MathSAT5 is available for research and evaluation purposes only. It can not be used in a commercial environment, particularly as part of a commercial product, without written permission. MathSAT5 is provided as is, without any warranty. Please write to mathsat@fbk.eu for additional questions regarding licensing MathSAT5 or obtaining more up-to-date versions.

2017-05-11 15:13:05:026	WARNING	Parallel analysis 1:ValueAnalysisCPA:JavaSMT:Mathsat5SolverContext.<init>	MathSAT5 is available for research and evaluation purposes only. It can not be used in a commercial environment, particularly as part of a commercial product, without written permission. MathSAT5 is provided as is, without any warranty. Please write to mathsat@fbk.eu for additional questions regarding licensing MathSAT5 or obtaining more up-to-date versions.

2017-05-11 15:13:05:317	WARNING	Parallel analysis 1:InductionStepCase:PredicateCPA:JavaSMT:Mathsat5SolverContext.<init>	MathSAT5 is available for research and evaluation purposes only. It can not be used in a commercial environment, particularly as part of a commercial product, without written permission. MathSAT5 is provided as is, without any warranty. Please write to mathsat@fbk.eu for additional questions regarding licensing MathSAT5 or obtaining more up-to-date versions.

2017-05-11 15:13:05:320	INFO	Parallel analysis 1:InductionStepCase:PredicateCPA:PredicateCPA.<init>	Using predicate analysis with MathSAT5 version 5.3.14 (0b98b661254c) (Nov 17 2016 10:59:45, gmp 5.1.3, gcc 4.8.5, 64-bit).

2017-05-11 15:13:05:330	WARNING	Parallel analysis 1:InductionStepCase:AssumptionStorageCPA:JavaSMT:Mathsat5SolverContext.<init>	MathSAT5 is available for research and evaluation purposes only. It can not be used in a commercial environment, particularly as part of a commercial product, without written permission. MathSAT5 is provided as is, without any warranty. Please write to mathsat@fbk.eu for additional questions regarding licensing MathSAT5 or obtaining more up-to-date versions.

2017-05-11 15:13:05:339	WARNING	Parallel analysis 1:InductionStepCase:ValueAnalysisCPA:JavaSMT:Mathsat5SolverContext.<init>	MathSAT5 is available for research and evaluation purposes only. It can not be used in a commercial environment, particularly as part of a commercial product, without written permission. MathSAT5 is provided as is, without any warranty. Please write to mathsat@fbk.eu for additional questions regarding licensing MathSAT5 or obtaining more up-to-date versions.

2017-05-11 15:13:05:596	INFO	Parallel analysis 1:AbstractBMCAlgorithm.run	Creating formula for program

2017-05-11 15:13:06:796	INFO	Parallel analysis 1:AbstractBMCAlgorithm.boundedModelCheck	Starting satisfiability check...

2017-05-11 15:13:06:829	INFO	Parallel analysis 1:AbstractBMCAlgorithm.checkBoundingAssertions	Starting assertions check...

2017-05-11 15:13:07:251	INFO	Parallel analysis 1:KInductionProver.check	Running algorithm to create induction hypothesis

2017-05-11 15:13:07:389	INFO	Parallel analysis 2:InvariantsCPA:InvariantsCPA$InterestingVariableLimitAdjuster.adjustConditions	Adjusting interestingVariableLimit to 1

2017-05-11 15:13:07:390	INFO	Parallel analysis 2:ParallelAlgorithm.runParallelAnalysis	Adjusting precision for CPA org.sosy_lab.cpachecker.cpa.invariants.InvariantsCPA@2ef16059

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

2017-05-11 15:13:10:546	INFO	Parallel analysis 2:InvariantsCPA:InvariantsCPA$InterestingVariableLimitAdjuster.adjustConditions	Adjusting interestingVariableLimit to 2

2017-05-11 15:13:10:546	INFO	Parallel analysis 2:ParallelAlgorithm.runParallelAnalysis	Adjusting precision for CPA org.sosy_lab.cpachecker.cpa.invariants.InvariantsCPA@2ef16059

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

2017-05-11 15:13:11:961	INFO	Parallel analysis 2:InvariantsCPA:InvariantsCPA$InterestingVariableLimitAdjuster.adjustConditions	Adjusting interestingVariableLimit to 4

2017-05-11 15:13:11:961	INFO	Parallel analysis 2:ParallelAlgorithm.runParallelAnalysis	Adjusting precision for CPA org.sosy_lab.cpachecker.cpa.invariants.InvariantsCPA@2ef16059

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

2017-05-11 15:13:12:983	INFO	Parallel analysis 2:InvariantsCPA:InvariantsCPA$InterestingVariableLimitAdjuster.adjustConditions	Adjusting interestingVariableLimit to 8

2017-05-11 15:13:13:001	INFO	Parallel analysis 2:ParallelAlgorithm.runParallelAnalysis	Adjusting precision for CPA org.sosy_lab.cpachecker.cpa.invariants.InvariantsCPA@2ef16059

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

2017-05-11 15:13:14:696	INFO	Parallel analysis 2:InvariantsCPA:InvariantsCPA$InterestingVariableLimitAdjuster.adjustConditions	Adjusting interestingVariableLimit to 10

2017-05-11 15:13:14:710	INFO	Parallel analysis 2:ParallelAlgorithm.runParallelAnalysis	Adjusting precision for CPA org.sosy_lab.cpachecker.cpa.invariants.InvariantsCPA@2ef16059

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

2017-05-11 15:13:15:552	INFO	Parallel analysis 2:InvariantsCPA:InvariantsCPA$FormulaDepthAdjuster.adjustConditions	Adjusting maximum formula depth to 3

2017-05-11 15:13:15:553	INFO	Parallel analysis 2:ParallelAlgorithm.runParallelAnalysis	Adjusting precision for CPA org.sosy_lab.cpachecker.cpa.invariants.InvariantsCPA@2ef16059

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

2017-05-11 15:13:16:188	INFO	Parallel analysis 2:InvariantsCPA:InvariantsCPA$InterestingVariableLimitAdjuster.adjustConditions	Adjusting interestingVariableLimit to 14

2017-05-11 15:13:16:198	INFO	Parallel analysis 2:ParallelAlgorithm.runParallelAnalysis	Adjusting precision for CPA org.sosy_lab.cpachecker.cpa.invariants.InvariantsCPA@2ef16059

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

2017-05-11 15:13:16:908	INFO	Parallel analysis 2:InvariantsCPA:InvariantsCPA$InterestingVariableLimitAdjuster.adjustConditions	Adjusting interestingVariableLimit to 16

2017-05-11 15:13:16:909	INFO	Parallel analysis 2:ParallelAlgorithm.runParallelAnalysis	Adjusting precision for CPA org.sosy_lab.cpachecker.cpa.invariants.InvariantsCPA@2ef16059

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

2017-05-11 15:13:17:383	INFO	Parallel analysis 2:InvariantsCPA:InvariantsCPA$InterestingVariableLimitAdjuster.adjustConditions	Adjusting interestingVariableLimit to 20

2017-05-11 15:13:17:386	INFO	Parallel analysis 2:ParallelAlgorithm.runParallelAnalysis	Adjusting precision for CPA org.sosy_lab.cpachecker.cpa.invariants.InvariantsCPA@2ef16059

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

2017-05-11 15:13:17:850	INFO	Parallel analysis 2:InvariantsCPA:InvariantsCPA$InterestingVariableLimitAdjuster.adjustConditions	Adjusting interestingVariableLimit to 28

2017-05-11 15:13:17:850	INFO	Parallel analysis 2:ParallelAlgorithm.runParallelAnalysis	Adjusting precision for CPA org.sosy_lab.cpachecker.cpa.invariants.InvariantsCPA@2ef16059

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

2017-05-11 15:13:18:062	INFO	Parallel analysis 1:KInductionProver.check	Starting induction check...

2017-05-11 15:13:20:568	INFO	Parallel analysis 1:BoundsCPA:BoundsCPA.adjustPrecision	Adjusting maxLoopIterations to 2

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

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

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

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

2017-05-11 15:13:25:502	INFO	Parallel analysis 2:InvariantsCPA:InvariantsCPA$InterestingVariableLimitAdjuster.adjustConditions	Adjusting interestingVariableLimit to 32

2017-05-11 15:13:25:502	INFO	Parallel analysis 2:ParallelAlgorithm.runParallelAnalysis	Adjusting precision for CPA org.sosy_lab.cpachecker.cpa.invariants.InvariantsCPA@2ef16059

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

2017-05-11 15:13:27:930	INFO	Parallel analysis 1:KInductionProver.check	Starting induction check...

2017-05-11 15:13:29:862	INFO	Parallel analysis 2:InvariantsCPA:InvariantsCPA$InterestingVariableLimitAdjuster.adjustConditions	Adjusting interestingVariableLimit to 40

2017-05-11 15:13:29:862	INFO	Parallel analysis 2:ParallelAlgorithm.runParallelAnalysis	Adjusting precision for CPA org.sosy_lab.cpachecker.cpa.invariants.InvariantsCPA@2ef16059

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

2017-05-11 15:13:35:520	INFO	Parallel analysis 1:BoundsCPA:BoundsCPA.adjustPrecision	Adjusting maxLoopIterations to 3

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

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

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

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

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

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

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

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

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

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

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

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

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

Time for post operator:                  0.773s
  Time for path formula creation:        0.771s
Time for strengthen operator:            0.007s
Time for prec operator:                  0.002s
  Time for abstraction:                  0.000s (Max:     0.000s, Count: 3)
    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.014s
Time for coverage check:                 0.000s
Total time for SMT solver (w/o itp):     0.000s

Total number of created targets for pointer analysis: 128
   Number of created targets for uf: *signed_int is 33



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

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

Bounds CPA statistics
---------------------
Bound k:                                           3
Maximum loop iteration reached:                    4


ValueAnalysisCPA statistics
---------------------------
Number of variables:                                  10826 (count: 659, min: 0, max: 26, avg: 16.43)
Number of global variables:                            7140 (count: 659, min: 0, max: 15, avg: 10.83)

ValueAnalysisPrecisionAdjustment statistics
-------------------------------------------
Number of abstraction computations:                     738
Total time for liveness abstraction:                   0.000s
Total time for abstraction computation:                0.027s
Total time for path thresholds:                        0.000s
Number of tracked memory locations:                48

ValueAnalysisTransferRelation statistics
----------------------------------------
Number of Assumptions:                                  284
Number of deterministic Assumptions:                     80
Level of Determinism:                              28%

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.001s
Automaton transfers with branching:                0
Automaton transfer successors:                          738 (count: 741, min: 0, max: 1, avg: 1.00) [0 x 3, 1 x 738]

CPA algorithm statistics
------------------------
Number of iterations:            663
Max size of waitlist:            10
Average size of waitlist:        2
Number of computed successors:   738
Max successors for one state:    2
Number of times merged:          78
Number of times stopped:         78
Number of times breaked:         0

Total time for CPA algorithm:         1.332s (Max:     1.179s)
  Time for choose from waitlist:      0.001s
  Time for precision adjustment:      0.048s
  Time for transfer relation:         1.235s
  Time for merge operator:            0.017s
  Time for stop operator:             0.016s
  Time for adding to reached set:     0.008s

BMC algorithm statistics
------------------------
Time for BMC formula creation:           1.343s
Time for final sat check:                0.597s
Time for error path creation:            0.735s
Time for bounding assertions check:      0.258s
Time for induction formula creation:    18.139s
Time for induction check:               10.067s

Counterexample-Check Algorithm statistics
-----------------------------------------
Number of counterexample checks:    1
Number of infeasible paths:         1 (100%)
Time for counterexample checks:         1.031s
Time for running CBMC:                  0.937s


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.234s
Automaton transfers with branching:                0
Automaton transfer successors:                        37463 (count: 37618, min: 0, max: 1, avg: 1.00) [0 x 155, 1 x 37463]

CPA algorithm statistics
------------------------
Number of iterations:            34196
Max size of waitlist:            163
Average size of waitlist:        50
Number of computed successors:   37463
Max successors for one state:    2
Number of times merged:          8244
Number of times stopped:         9004
Number of times breaked:         0

Total time for CPA algorithm:        31.520s (Max:     8.186s)
  Time for choose from waitlist:      0.048s
  Time for precision adjustment:      0.910s
  Time for transfer relation:         9.941s
  Time for merge operator:           18.088s
  Time for stop operator:             1.851s
  Time for adding to reached set:     0.245s


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

Code Coverage
-----------------------------
  Function coverage:      0.571
  Visited lines:          92
  Total lines:            402
  Line coverage:          0.229
  Visited conditions:     90
  Total conditions:       132
  Condition coverage:     0.682

CPAchecker general statistics
-----------------------------
Number of program locations:     689
Number of CFA edges:             807
Number of relevant variables:    143
Number of functions:             35
Number of loops:                 9
Size of reached set:             659
  Number of reached locations:   303 (44%)
    Avg states per location:     2
    Max states per location:     4 (at node N450)
  Number of reached functions:   20 (57%)
  Number of partitions:          659
    Avg size of partitions:      1
    Max size of partitions:      1
  Number of target states:       3

Time for analysis setup:          2.441s
  Time for loading CPAs:          0.573s
  Time for loading parser:        0.474s
  Time for CFA construction:      1.323s
    Time for parsing file(s):     0.345s
    Time for AST to CFA:          0.416s
    Time for CFA sanity check:    0.107s
    Time for post-processing:     0.377s
      Time for var class.:        0.221s
    Time for CFA export:          0.523s
Time for Analysis:               34.013s
CPU time for analysis:          112.380s
Time for analyzing result:        0.001s
Total time for CPAchecker:       36.466s
Total CPU time for CPAchecker:  118.670s
Time for statistics:              2.498s

Time for Garbage Collector:       3.270s (in 25 runs)
Garbage Collector(s) used:    PS MarkSweep, PS Scavenge
Used heap memory:                426MB (   406 MiB) max;    202MB (   193 MiB) avg;    468MB (   446 MiB) peak
Used non-heap memory:             54MB (    52 MiB) max;     47MB (    45 MiB) avg;     60MB (    57 MiB) peak
Used in PS Old Gen pool:          66MB (    63 MiB) max;     27MB (    26 MiB) avg;     66MB (    63 MiB) peak
Allocated heap memory:          1205MB (  1150 MiB) max;    946MB (   902 MiB) avg
Allocated non-heap memory:        56MB (    53 MiB) max;     49MB (    47 MiB) avg
Total process virtual memory:   8366MB (  7979 MiB) max;   8041MB (  7668 MiB) avg

    
analysis.programNames = /lustre/work/anon/anon/cfc/benchmarks/sv_subset_falsified_by_cpa_or_ua_transform/scripts/analysis_logs/minepump_spec3_product08_false-unreach-call_false-termination.cil/minepump_spec3_product08_false-unreach-call_false-termination.cil.over.instr.c
analysis.summaryEdges = true
analysis.useParallelAnalyses = true
cfa.allowBranchSwapping = false
cfa.simplifyCfa = false
limits.time.cpu = 900
log.level = INFO
output.path = /lustre/work/anon/anon/cfc/benchmarks/sv_subset_falsified_by_cpa_or_ua_transform/scripts/analysis_logs/minepump_spec3_product08_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