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

Generated on 2017-05-11 15:16:48 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_528 = 6; int INPUTS_at_528[6]; int input_at_528_counter = 0;int num_of_inputs_at_548 = 6; int INPUTS_at_548[6]; int input_at_548_counter = 0;int num_of_inputs_at_538 = 6; int INPUTS_at_538[6]; int input_at_538_counter = 0;int num_of_inputs_at_556 = 2; int INPUTS_at_556[2]; int input_at_556_counter = 0;int initialize_reads() {  for (int instrumentation_index=0; instrumentation_index<6; instrumentation_index++) INPUTS_at_528[instrumentation_index] = __VERIFIER_nondet_int();  for (int instrumentation_index=0; instrumentation_index<6; instrumentation_index++) INPUTS_at_548[instrumentation_index] = __VERIFIER_nondet_int();  for (int instrumentation_index=0; instrumentation_index<6; instrumentation_index++) INPUTS_at_538[instrumentation_index] = __VERIFIER_nondet_int();  for (int instrumentation_index=0; instrumentation_index<2; instrumentation_index++) INPUTS_at_556[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,"Environment.i","")  
406
void lowerWaterLevel(void) ;  
407
void waterRise(void) ;  
408
void changeMethaneLevel(void) ;  
409
int isMethaneLevelCritical(void) ;  
410
int getWaterLevel(void) ;  
411
void printEnvironment(void) ;  
412
int isHighWaterSensorDry(void) ;  
413
int waterLevel  =    1;  
414
int methaneLevelCritical  =    0;  
415
void lowerWaterLevel(void)   
416
{   
417
  
418
  {  
419
  if (waterLevel > 0) {  
420
    waterLevel = waterLevel - 1;  
421
  } else {  
422
  
423
  }  
424
  return;  
425
}  
426
}  
427
void waterRise(void)   
428
{   
429
  
430
  {  
431
  if (waterLevel < 2) {  
432
    waterLevel = waterLevel + 1;  
433
  } else {  
434
  
435
  }  
436
  return;  
437
}  
438
}  
439
void changeMethaneLevel(void)   
440
{   
441
  
442
  {  
443
  if (methaneLevelCritical != 0) {  
444
    methaneLevelCritical = 0;  
445
  } else {  
446
    methaneLevelCritical = 1;  
447
  }  
448
  return;  
449
}  
450
}  
451
int isMethaneLevelCritical(void)   
452
{ int retValue_acc ;  
453
  
454
  {  
455
  retValue_acc = methaneLevelCritical;  
456
  return (retValue_acc);  
457
  return (retValue_acc);  
458
}  
459
}  
460
void printEnvironment(void)   
461
{   
462
  
463
  {  
464
  {  
465
//  printf("Env(Water:%i", waterLevel);  
466
//  printf(",Meth:");  
467
  }  
468
  if (methaneLevelCritical != 0) {  
469
    {  
470
//    printf("CRIT");  
471
    }  
472
  } else {  
473
    {  
474
//    printf("OK");  
475
    }  
476
  }  
477
  {  
478
//  printf(")");  
479
  }  
480
  return;  
481
}  
482
}  
483
int getWaterLevel(void)   
484
{ int retValue_acc ;  
485
  
486
  {  
487
  retValue_acc = waterLevel;  
488
  return (retValue_acc);  
489
  return (retValue_acc);  
490
}  
491
}  
492
int isHighWaterSensorDry(void)   
493
{ int retValue_acc ;  
494
  
495
  {  
496
  if (waterLevel < 2) {  
497
    retValue_acc = 1;  
498
    return (retValue_acc);  
499
  } else {  
500
    retValue_acc = 0;  
501
    return (retValue_acc);  
502
  }  
503
  return (retValue_acc);  
504
}  
505
}  
506
#pragma merger(0,"scenario.i","")  
507
void startSystem(void) ;  
508
void timeShift(void) ;  
509
void cleanup(void) ;  
510
void test(void)   
511
{ int splverifierCounter ;  
512
  int tmp ;  
513
  int tmp___0 ;  
514
  int tmp___1 ;  
515
  int tmp___2 ;  
516
  
517
  {  
518
  splverifierCounter = 0;  
519
  {  
520
  while (1) {  
521
    while_3_continue: /* CIL Label */ ;  
522
    if (splverifierCounter < 4) {  
523
  
524
    } else {  
525
      goto while_3_break;  
526
    }  
527
    {  
528
    tmp = (input_at_528_counter < num_of_inputs_at_528) ? INPUTS_at_528[input_at_528_counter++] : __VERIFIER_nondet_int() ;  
529
    }  
530
    if (tmp != 0) {  
531
      {  
532
      waterRise();  
533
      }  
534
    } else {  
535
  
536
    }  
537
    {  
538
    tmp___0 = (input_at_538_counter < num_of_inputs_at_538) ? INPUTS_at_538[input_at_538_counter++] : __VERIFIER_nondet_int() ;  
539
    }  
540
    if (tmp___0 != 0) {  
541
      {  
542
      changeMethaneLevel();  
543
      }  
544
    } else {  
545
  
546
    }  
547
    {  
548
    tmp___2 = (input_at_548_counter < num_of_inputs_at_548) ? INPUTS_at_548[input_at_548_counter++] : __VERIFIER_nondet_int() ;  
549
    }  
550
    if (tmp___2 != 0) {  
551
      {  
552
      startSystem();  
553
      }  
554
    } else {  
555
      {  
556
      tmp___1 = (input_at_556_counter < num_of_inputs_at_556) ? INPUTS_at_556[input_at_556_counter++] : __VERIFIER_nondet_int() ;  
557
      }  
558
      if (tmp___1 != 0) {  
559
  
560
      } else {  
561
  
562
      }  
563
    }  
564
    {  
565
    timeShift();  
566
    }  
567
  }  
568
  while_3_break: /* CIL Label */ ;  
569
  }  
570
  {  
571
  cleanup();  
572
  }  
573
  return;  
574
}  
575
}  
576
#pragma merger(0,"MinePump.i","")  
577
void activatePump(void) ;  
578
void deactivatePump(void) ;  
579
int isPumpRunning(void) ;  
580
void printPump(void) ;  
581
int pumpRunning  =    0;  
582
int systemActive  =    1;  
583
void __utac_acc__Specification1_spec__1(void) ;  
584
void processEnvironment(void) ;  
585
void timeShift(void)   
586
{   
587
  
588
  {  
589
  if (pumpRunning != 0) {  
590
    {  
591
    lowerWaterLevel();  
592
    }  
593
  } else {  
594
  
595
  }  
596
  if (systemActive != 0) {  
597
    {  
598
    processEnvironment();  
599
    }  
600
  } else {  
601
  
602
  }  
603
  {  
604
  __utac_acc__Specification1_spec__1();  
605
  }  
606
  return;  
607
}  
608
}  
609
void processEnvironment__wrappee__base(void)   
610
{   
611
  
612
  {  
613
  return;  
614
}  
615
}  
616
int isHighWaterLevel(void) ;  
617
void processEnvironment(void)   
618
{ int tmp ;  
619
  
620
  {  
621
  if (! pumpRunning) {  
622
    {  
623
    tmp = isHighWaterLevel();  
624
    }  
625
    if (tmp != 0) {  
626
      {  
627
      activatePump();  
628
      }  
629
    } else {  
630
      {  
631
      processEnvironment__wrappee__base();  
632
      }  
633
    }  
634
  } else {  
635
    {  
636
    processEnvironment__wrappee__base();  
637
    }  
638
  }  
639
  return;  
640
}  
641
}  
642
void activatePump__wrappee__highWaterSensor(void)   
643
{   
644
  
645
  {  
646
  pumpRunning = 1;  
647
  return;  
648
}  
649
}  
650
int isMethaneAlarm(void) ;  
651
void activatePump(void)   
652
{ int tmp ;  
653
  
654
  {  
655
  {  
656
  tmp = isMethaneAlarm();  
657
  }  
658
  if (tmp != 0) {  
659
  
660
  } else {  
661
    {  
662
    activatePump__wrappee__highWaterSensor();  
663
    }  
664
  }  
665
  return;  
666
}  
667
}  
668
void deactivatePump(void)   
669
{   
670
  
671
  {  
672
  pumpRunning = 0;  
673
  return;  
674
}  
675
}  
676
int isMethaneAlarm(void)   
677
{ int retValue_acc ;  
678
  
679
  {  
680
  {  
681
  retValue_acc = isMethaneLevelCritical();  
682
  }  
683
  return (retValue_acc);  
684
  return (retValue_acc);  
685
}  
686
}  
687
int isPumpRunning(void)   
688
{ int retValue_acc ;  
689
  
690
  {  
691
  retValue_acc = pumpRunning;  
692
  return (retValue_acc);  
693
  return (retValue_acc);  
694
}  
695
}  
696
void printPump(void)   
697
{   
698
  
699
  {  
700
  {  
701
//  printf("Pump(System:");  
702
  }  
703
  if (systemActive != 0) {  
704
    {  
705
//    printf("On");  
706
    }  
707
  } else {  
708
    {  
709
//    printf("Off");  
710
    }  
711
  }  
712
  {  
713
//  printf(",Pump:");  
714
  }  
715
  if (pumpRunning != 0) {  
716
    {  
717
//    printf("On");  
718
    }  
719
  } else {  
720
    {  
721
//    printf("Off");  
722
    }  
723
  }  
724
  {  
725
//  printf(") ");  
726
  printEnvironment();  
727
//  printf("\n");  
728
  }  
729
  return;  
730
}  
731
}  
732
int isHighWaterLevel(void)   
733
{ int retValue_acc ;  
734
  int tmp ;  
735
  int tmp___0 ;  
736
  
737
  {  
738
  {  
739
  tmp = isHighWaterSensorDry();  
740
  }  
741
  if (tmp != 0) {  
742
    tmp___0 = 0;  
743
  } else {  
744
    tmp___0 = 1;  
745
  }  
746
  retValue_acc = tmp___0;  
747
  return (retValue_acc);  
748
  return (retValue_acc);  
749
}  
750
}  
751
void startSystem(void)   
752
{   
753
  
754
  {  
755
  systemActive = 1;  
756
  return;  
757
}  
758
}  
759
#pragma merger(0,"wsllib_check.i","")  
760
void __automaton_fail(void)   
761
{   
762
  
763
  {  
764
  __VERIFIER_assume(!((0 != INPUTS_at_528[1] && 0 == INPUTS_at_538[0] && 0 == INPUTS_at_528[0] && 0 == INPUTS_at_556[0] && 0 == INPUTS_at_548[0])));__VERIFIER_assume(!((0 != INPUTS_at_548[2])));__VERIFIER_assume(!((0 != INPUTS_at_556[0])));__VERIFIER_assume(!((0 == INPUTS_at_548[1])));__VERIFIER_assume(!((0 != INPUTS_at_538[1])));__VERIFIER_assume(!((0 != INPUTS_at_528[1] && 0 == INPUTS_at_548[0] && 0 == INPUTS_at_538[2] && 0 == INPUTS_at_528[2] && 0 == INPUTS_at_548[1] && 0 != INPUTS_at_538[1] && 0 == INPUTS_at_528[0])));__VERIFIER_assume(!((0 != INPUTS_at_528[1] && 0 == INPUTS_at_556[0] && 0 == INPUTS_at_538[0] && 0 == INPUTS_at_528[3] && 0 == INPUTS_at_548[2] && 0 == INPUTS_at_538[2] && 0 == INPUTS_at_528[2] && 0 != INPUTS_at_528[0] && 0 != INPUTS_at_548[4] && 0 != INPUTS_at_556[1] && 0 == INPUTS_at_548[1] && 0 != INPUTS_at_538[1])));__VERIFIER_assume(!((0 != INPUTS_at_528[1] && 0 == INPUTS_at_538[0] && 0 == INPUTS_at_528[3] && 0 == INPUTS_at_548[2] && 0 == INPUTS_at_538[1] && 0 == INPUTS_at_556[1] && 0 != INPUTS_at_548[1])));__VERIFIER_assume(!((0 != INPUTS_at_548[0] && 0 == INPUTS_at_528[5] && 0 == INPUTS_at_528[0] && 0 == INPUTS_at_538[0] && 0 == INPUTS_at_528[1] && 0 == INPUTS_at_528[4] && 0 == INPUTS_at_528[3] && 0 == INPUTS_at_548[2] && 0 != INPUTS_at_528[2] && 0 != INPUTS_at_548[1] && 0 != INPUTS_at_548[5] && 0 != INPUTS_at_538[2] && 0 == INPUTS_at_556[1] && 0 == INPUTS_at_538[1])));__VERIFIER_error();  
765
  return;  
766
}  
767
}  
768
#pragma merger(0,"Specification1_spec.i","")  
769
void __utac_acc__Specification1_spec__1(void)   
770
{ int tmp ;  
771
  int tmp___0 ;  
772
  
773
  {  
774
  {  
775
  tmp = isMethaneLevelCritical();  
776
  }  
777
  if (tmp != 0) {  
778
    {  
779
    tmp___0 = isPumpRunning();  
780
    }  
781
    if (tmp___0 != 0) {  
782
      {  
783
      __automaton_fail();  
784
      }  
785
    } else {  
786
  
787
    }  
788
  } else {  
789
  
790
  }  
791
  return;  
792
}  
793
}  
794
#pragma merger(0,"featureselect.i","")  
795
int select_one(void) ;  
796
void select_features(void) ;  
797
void select_helpers(void) ;  
798
int valid_product(void) ;  
799
int select_one(void)   
800
{ int retValue_acc ;  
801
  int choice = __VERIFIER_nondet_int();  
802
  
803
  {  
804
  retValue_acc = choice;  
805
  return (retValue_acc);  
806
  return (retValue_acc);  
807
}  
808
}  
809
void select_features(void)   
810
{   
811
  
812
  {  
813
  return;  
814
}  
815
}  
816
void select_helpers(void)   
817
{   
818
  
819
  {  
820
  return;  
821
}  
822
}  
823
int valid_product(void)   
824
{ int retValue_acc ;  
825
  
826
  {  
827
  retValue_acc = 1;  
828
  return (retValue_acc);  
829
  return (retValue_acc);  
830
}  
831
}  
832
#pragma merger(0,"Test.i","")  
833
int cleanupTimeShifts  =    4;  
834
void cleanup(void)   
835
{ int i ;  
836
  int __cil_tmp2 ;  
837
  
838
  {  
839
  {  
840
  timeShift();  
841
  i = 0;  
842
  }  
843
  {  
844
  while (1) {  
845
    while_4_continue: /* CIL Label */ ;  
846
    {  
847
    __cil_tmp2 = cleanupTimeShifts - 1;  
848
    if (i < __cil_tmp2) {  
849
  
850
    } else {  
851
      goto while_4_break;  
852
    }  
853
    }  
854
    {  
855
    timeShift();  
856
    i = i + 1;  
857
    }  
858
  }  
859
  while_4_break: /* CIL Label */ ;  
860
  }  
861
  return;  
862
}  
863
}  
864
void Specification2(void)   
865
{   
866
  
867
  {  
868
  {  
869
  timeShift();  
870
  printPump();  
871
  timeShift();  
872
  printPump();  
873
  timeShift();  
874
  printPump();  
875
  waterRise();  
876
  printPump();  
877
  timeShift();  
878
  printPump();  
879
  changeMethaneLevel();  
880
  printPump();  
881
  timeShift();  
882
  printPump();  
883
  cleanup();  
884
  }  
885
  return;  
886
}  
887
}  
888
void setup(void)   
889
{   
890
  
891
  {  
892
  return;  
893
}  
894
}  
895
void runTest(void)   
896
{   
897
  
898
  {  
899
  {  
900
  test();  
901
  }  
902
  return;  
903
}  
904
}  
905
int main(void)   
906
{initialize_reads(); int retValue_acc ;  
907
  int tmp ;  
908
  
909
  {  
910
  {  
911
  select_helpers();  
912
  select_features();  
913
  tmp = valid_product();  
914
  }  
915
  if (tmp != 0) {  
916
    {  
917
    setup();  
918
    runTest();  
919
    }  
920
  } else {  
921
  
922
  }  
923
  retValue_acc = 0;  
924
  return (retValue_acc);  
925
  return (retValue_acc);  
926
}  
927
}  
2017-05-11 15:12:39:701	INFO	ResourceLimitChecker.fromConfiguration	Using the following resource limits: CPU-time limit of 900s

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

2017-05-11 15:12:41:073	INFO	CFACreationUtils.addEdgeToCFA	line 356: Dead code detected: return (retValue_acc);

2017-05-11 15:12:41:079	INFO	CFACreationUtils.addEdgeToCFA	line 402: Dead code detected: return (retValue_acc);

2017-05-11 15:12:41:083	INFO	CFACreationUtils.addEdgeToCFA	line 457: Dead code detected: return (retValue_acc);

2017-05-11 15:12:41:084	INFO	CFACreationUtils.addEdgeToCFA	line 489: Dead code detected: return (retValue_acc);

2017-05-11 15:12:41:086	INFO	CFACreationUtils.addEdgeToCFA	line 503: Dead code detected: return (retValue_acc);

2017-05-11 15:12:41:113	INFO	CFACreationUtils.addEdgeToCFA	line 684: Dead code detected: return (retValue_acc);

2017-05-11 15:12:41:115	INFO	CFACreationUtils.addEdgeToCFA	line 693: Dead code detected: return (retValue_acc);

2017-05-11 15:12:41:117	INFO	CFACreationUtils.addEdgeToCFA	line 748: Dead code detected: return (retValue_acc);

2017-05-11 15:12:41:153	INFO	CFACreationUtils.addEdgeToCFA	line 806: Dead code detected: return (retValue_acc);

2017-05-11 15:12:41:155	INFO	CFACreationUtils.addEdgeToCFA	line 829: Dead code detected: return (retValue_acc);

2017-05-11 15:12:41:162	INFO	CFACreationUtils.addEdgeToCFA	line 925: Dead code detected: return (retValue_acc);

2017-05-11 15:12:41:305	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 15:12:42:251	INFO	CPAchecker.runAlgorithm	Starting analysis ...

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

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

2017-05-11 15:12:42:513	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:12:43:102	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:12:43:192	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:12:43:283	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:12:43:541	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:12:43:555	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:12:43:564	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:12:43:572	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:12:43:857	INFO	Parallel analysis 1:AbstractBMCAlgorithm.run	Creating formula for program

2017-05-11 15:12:45:772	INFO	Parallel analysis 1:AbstractBMCAlgorithm.boundedModelCheck	Starting satisfiability check...

2017-05-11 15:12:45:804	INFO	Parallel analysis 1:AbstractBMCAlgorithm.checkBoundingAssertions	Starting assertions check...

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

2017-05-11 15:12:48:175	INFO	Parallel analysis 2:InvariantsCPA:InvariantsCPA$InterestingVariableLimitAdjuster.adjustConditions	Adjusting interestingVariableLimit to 1

2017-05-11 15:12:48:175	INFO	Parallel analysis 2:ParallelAlgorithm.runParallelAnalysis	Adjusting precision for CPA org.sosy_lab.cpachecker.cpa.invariants.InvariantsCPA@1b954708

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

2017-05-11 15:12:50:963	INFO	Parallel analysis 2:InvariantsCPA:InvariantsCPA$InterestingVariableLimitAdjuster.adjustConditions	Adjusting interestingVariableLimit to 2

2017-05-11 15:12:50:963	INFO	Parallel analysis 2:ParallelAlgorithm.runParallelAnalysis	Adjusting precision for CPA org.sosy_lab.cpachecker.cpa.invariants.InvariantsCPA@1b954708

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

2017-05-11 15:12:52:330	INFO	Parallel analysis 2:InvariantsCPA:InvariantsCPA$InterestingVariableLimitAdjuster.adjustConditions	Adjusting interestingVariableLimit to 4

2017-05-11 15:12:52:331	INFO	Parallel analysis 2:ParallelAlgorithm.runParallelAnalysis	Adjusting precision for CPA org.sosy_lab.cpachecker.cpa.invariants.InvariantsCPA@1b954708

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

2017-05-11 15:12:53:954	INFO	Parallel analysis 2:InvariantsCPA:InvariantsCPA$InterestingVariableLimitAdjuster.adjustConditions	Adjusting interestingVariableLimit to 5

2017-05-11 15:12:53:955	INFO	Parallel analysis 2:ParallelAlgorithm.runParallelAnalysis	Adjusting precision for CPA org.sosy_lab.cpachecker.cpa.invariants.InvariantsCPA@1b954708

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

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

2017-05-11 15:12:54:876	INFO	Parallel analysis 2:ParallelAlgorithm.runParallelAnalysis	Adjusting precision for CPA org.sosy_lab.cpachecker.cpa.invariants.InvariantsCPA@1b954708

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

2017-05-11 15:12:55:646	INFO	Parallel analysis 2:InvariantsCPA:InvariantsCPA$InterestingVariableLimitAdjuster.adjustConditions	Adjusting interestingVariableLimit to 7

2017-05-11 15:12:55:646	INFO	Parallel analysis 2:ParallelAlgorithm.runParallelAnalysis	Adjusting precision for CPA org.sosy_lab.cpachecker.cpa.invariants.InvariantsCPA@1b954708

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

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

2017-05-11 15:12:56:411	INFO	Parallel analysis 2:ParallelAlgorithm.runParallelAnalysis	Adjusting precision for CPA org.sosy_lab.cpachecker.cpa.invariants.InvariantsCPA@1b954708

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

2017-05-11 15:12:56:945	INFO	Parallel analysis 2:InvariantsCPA:InvariantsCPA$InterestingVariableLimitAdjuster.adjustConditions	Adjusting interestingVariableLimit to 10

2017-05-11 15:12:56:946	INFO	Parallel analysis 2:ParallelAlgorithm.runParallelAnalysis	Adjusting precision for CPA org.sosy_lab.cpachecker.cpa.invariants.InvariantsCPA@1b954708

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

2017-05-11 15:12:56:982	INFO	Parallel analysis 1:KInductionProver.check	Starting induction check...

2017-05-11 15:12:57:358	INFO	Parallel analysis 2:InvariantsCPA:InvariantsCPA$InterestingVariableLimitAdjuster.adjustConditions	Adjusting interestingVariableLimit to 14

2017-05-11 15:12:57:359	INFO	Parallel analysis 2:ParallelAlgorithm.runParallelAnalysis	Adjusting precision for CPA org.sosy_lab.cpachecker.cpa.invariants.InvariantsCPA@1b954708

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

2017-05-11 15:12:57:765	INFO	Parallel analysis 2:InvariantsCPA:InvariantsCPA$InterestingVariableLimitAdjuster.adjustConditions	Adjusting interestingVariableLimit to 22

2017-05-11 15:12:57:765	INFO	Parallel analysis 2:ParallelAlgorithm.runParallelAnalysis	Adjusting precision for CPA org.sosy_lab.cpachecker.cpa.invariants.InvariantsCPA@1b954708

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

2017-05-11 15:12:58:192	INFO	Parallel analysis 2:InvariantsCPA:InvariantsCPA$InterestingVariableLimitAdjuster.adjustConditions	Adjusting interestingVariableLimit to 26

2017-05-11 15:12:58:192	INFO	Parallel analysis 2:ParallelAlgorithm.runParallelAnalysis	Adjusting precision for CPA org.sosy_lab.cpachecker.cpa.invariants.InvariantsCPA@1b954708

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

2017-05-11 15:12:59:221	INFO	Parallel analysis 2:InvariantsCPA:InvariantsCPA$InterestingVariableLimitAdjuster.adjustConditions	Adjusting interestingVariableLimit to 28

2017-05-11 15:12:59:233	INFO	Parallel analysis 2:ParallelAlgorithm.runParallelAnalysis	Adjusting precision for CPA org.sosy_lab.cpachecker.cpa.invariants.InvariantsCPA@1b954708

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

2017-05-11 15:12:59:827	INFO	Parallel analysis 2:InvariantsCPA:InvariantsCPA$InterestingVariableLimitAdjuster.adjustConditions	Adjusting interestingVariableLimit to 32

2017-05-11 15:12:59:828	INFO	Parallel analysis 2:ParallelAlgorithm.runParallelAnalysis	Adjusting precision for CPA org.sosy_lab.cpachecker.cpa.invariants.InvariantsCPA@1b954708

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

2017-05-11 15:13:00:659	INFO	Parallel analysis 2:InvariantsCPA:InvariantsCPA$InterestingVariableLimitAdjuster.adjustConditions	Adjusting interestingVariableLimit to 34

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

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

2017-05-11 15:13:01:391	INFO	Parallel analysis 2:InvariantsCPA:InvariantsCPA$InterestingVariableLimitAdjuster.adjustConditions	Adjusting interestingVariableLimit to 38

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

2017-05-11 15:13:37:526	INFO	Parallel analysis 2:InvariantsCPA:InvariantsCPA$InterestingVariableLimitAdjuster.adjustConditions	Adjusting interestingVariableLimit to 44

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

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

2017-05-11 15:13:49:198	INFO	Parallel analysis 2:InvariantsCPA:InvariantsCPA$InterestingVariableLimitAdjuster.adjustConditions	Adjusting interestingVariableLimit to 48

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

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

2017-05-11 15:13:59:602	INFO	Parallel analysis 1:BoundsCPA:BoundsCPA.adjustPrecision	Adjusting maxLoopIterations to 4

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

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

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

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

2017-05-11 15:14:01:105	INFO	Parallel analysis 2:InvariantsCPA:InvariantsCPA$InterestingVariableLimitAdjuster.adjustConditions	Adjusting interestingVariableLimit to 50

2017-05-11 15:14:01:105	INFO	Parallel analysis 2:ParallelAlgorithm.runParallelAnalysis	Adjusting precision for CPA org.sosy_lab.cpachecker.cpa.invariants.InvariantsCPA@1b954708

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

2017-05-11 15:14:05:949	INFO	Parallel analysis 1:KInductionProver.check	Starting induction check...

2017-05-11 15:14:12:933	INFO	Parallel analysis 2:InvariantsCPA:InvariantsCPA$InterestingVariableLimitAdjuster.adjustConditions	Adjusting interestingVariableLimit to 54

2017-05-11 15:14:12:933	INFO	Parallel analysis 2:ParallelAlgorithm.runParallelAnalysis	Adjusting precision for CPA org.sosy_lab.cpachecker.cpa.invariants.InvariantsCPA@1b954708

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

2017-05-11 15:14:25:228	INFO	Parallel analysis 2:InvariantsCPA:InvariantsCPA$InterestingVariableLimitAdjuster.adjustConditions	Adjusting interestingVariableLimit to 56

2017-05-11 15:14:25:228	INFO	Parallel analysis 2:ParallelAlgorithm.runParallelAnalysis	Adjusting precision for CPA org.sosy_lab.cpachecker.cpa.invariants.InvariantsCPA@1b954708

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

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

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

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

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

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

2017-05-11 15:14:50:578	INFO	Parallel analysis 1:KInductionProver.check	Starting induction check...

2017-05-11 15:15:03:034	INFO	Parallel analysis 1:BoundsCPA:BoundsCPA.adjustPrecision	Adjusting maxLoopIterations to 6

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

2017-05-11 15:15:03:041	INFO	Parallel analysis 1:AbstractBMCAlgorithm.boundedModelCheck	Starting satisfiability check...

2017-05-11 15:15:03:041	INFO	Parallel analysis 1:AbstractBMCAlgorithm.checkBoundingAssertions	Starting assertions check...

2017-05-11 15:15:03:111	INFO	Parallel analysis 1:KInductionProver.check	Running algorithm to create induction hypothesis

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

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

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

2017-05-11 15:15:19:639	INFO	Parallel analysis 1:KInductionProver.check	Starting induction check...

2017-05-11 15:15:55:627	INFO	Parallel analysis 2:InvariantsCPA:InvariantsCPA$InterestingVariableLimitAdjuster.adjustConditions	Adjusting interestingVariableLimit to 59

2017-05-11 15:15:55:627	INFO	Parallel analysis 2:ParallelAlgorithm.runParallelAnalysis	Adjusting precision for CPA org.sosy_lab.cpachecker.cpa.invariants.InvariantsCPA@1b954708

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

2017-05-11 15:16:34:894	INFO	Parallel analysis 1:BoundsCPA:BoundsCPA.adjustPrecision	Adjusting maxLoopIterations to 7

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

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

2017-05-11 15:16:39:824	INFO	Parallel analysis 1:BMCAlgorithm.analyzeCounterexample	Error found, creating error path

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

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

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

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

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

2017-05-11 15:16:42:855	INFO	Parallel analysis 1:CounterexampleCheckAlgorithm.checkCounterexample	Error path found and confirmed by counterexample check with CBMC.

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

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

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

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

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

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

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

2017-05-11 15:16:45:525	INFO	Parallel analysis 1:CounterexampleCheckAlgorithm.checkCounterexample	Error path found and confirmed by counterexample check with CBMC.

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

2017-05-11 15:16:45:533	INFO	Parallel analysis 2:ParallelAlgorithm.runParallelAnalysis	Analysis was terminated

2017-05-11 15:16:45:534	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:            7 (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:         7 (100%)
  Times precision was empty:       7 (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:         702
  BDD entailment checks:           0
Number of SMT sat checks:          0
  trivial:                         0
  cached:                          0

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

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

Total number of created targets for pointer analysis: 800
   Number of created targets for uf: *signed_int is 81



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

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

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


ValueAnalysisCPA statistics
---------------------------
Number of variables:                                  32092 (count: 1888, min: 0, max: 29, avg: 17.00)
Number of global variables:                           22047 (count: 1888, min: 0, max: 20, avg: 11.68)

ValueAnalysisPrecisionAdjustment statistics
-------------------------------------------
Number of abstraction computations:                    2244
Total time for liveness abstraction:                   0.000s
Total time for abstraction computation:                0.034s
Total time for path thresholds:                        0.000s
Number of tracked memory locations:                59

ValueAnalysisTransferRelation statistics
----------------------------------------
Number of Assumptions:                                 1084
Number of deterministic Assumptions:                    270
Level of Determinism:                              25%

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

CPA algorithm statistics
------------------------
Number of iterations:            1900
Max size of waitlist:            10
Average size of waitlist:        3
Number of computed successors:   2244
Max successors for one state:    2
Number of times merged:          351
Number of times stopped:         351
Number of times breaked:         0

Total time for CPA algorithm:         2.511s (Max:     1.889s)
  Time for choose from waitlist:      0.002s
  Time for precision adjustment:      0.083s
  Time for transfer relation:         2.260s
  Time for merge operator:            0.136s
  Time for stop operator:             0.006s
  Time for adding to reached set:     0.008s

BMC algorithm statistics
------------------------
Time for BMC formula creation:           2.523s
Time for final sat check:                4.335s
Time for error path creation:            1.338s
Time for bounding assertions check:      0.668s
Time for induction formula creation:    50.406s
Time for induction check:              177.661s

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


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.818s
  Time for transition matches:                         0.316s
  Time for transition assertions:                      0.000s
  Time for transition actions:                         0.002s
Automaton transfers with branching:                0
Automaton transfer successors:                       252036 (count: 252464, min: 0, max: 1, avg: 1.00) [0 x 428, 1 x 252036]

CPA algorithm statistics
------------------------
Number of iterations:            226744
Max size of waitlist:            254
Average size of waitlist:        104
Number of computed successors:   252036
Max successors for one state:    2
Number of times merged:          53435
Number of times stopped:         57493
Number of times breaked:         0

Total time for CPA algorithm:       240.177s (Max:    49.871s)
  Time for choose from waitlist:      0.164s
  Time for precision adjustment:      2.115s
  Time for transfer relation:        29.026s
  Time for merge operator:          191.685s
  Time for stop operator:            15.469s
  Time for adding to reached set:     0.532s


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

Code Coverage
-----------------------------
  Function coverage:      0.649
  Visited lines:          115
  Total lines:            414
  Line coverage:          0.278
  Visited conditions:     145
  Total conditions:       192
  Condition coverage:     0.755

CPAchecker general statistics
-----------------------------
Number of program locations:     736
Number of CFA edges:             880
Number of relevant variables:    147
Number of functions:             37
Number of loops:                 9
Size of reached set:             1888
  Number of reached locations:   368 (50%)
    Avg states per location:     5
    Max states per location:     14 (at node N352)
  Number of reached functions:   24 (65%)
  Number of partitions:          1888
    Avg size of partitions:      1
    Max size of partitions:      1
  Number of target states:       7

Time for analysis setup:          2.423s
  Time for loading CPAs:          0.551s
  Time for loading parser:        0.456s
  Time for CFA construction:      1.330s
    Time for parsing file(s):     0.337s
    Time for AST to CFA:          0.428s
    Time for CFA sanity check:    0.102s
    Time for post-processing:     0.413s
      Time for var class.:        0.253s
    Time for CFA export:          0.815s
Time for Analysis:              243.280s
CPU time for analysis:          572.790s
Time for analyzing result:        0.001s
Total time for CPAchecker:      245.723s
Total CPU time for CPAchecker:  578.890s
Time for statistics:              2.990s

Time for Garbage Collector:      20.901s (in 237 runs)
Garbage Collector(s) used:    PS MarkSweep, PS Scavenge
Used heap memory:                768MB (   732 MiB) max;    400MB (   382 MiB) avg;    792MB (   756 MiB) peak
Used non-heap memory:             55MB (    53 MiB) max;     52MB (    50 MiB) avg;     61MB (    58 MiB) peak
Used in PS Old Gen pool:         360MB (   343 MiB) max;    207MB (   197 MiB) avg;    362MB (   345 MiB) peak
Allocated heap memory:          1205MB (  1150 MiB) max;    947MB (   903 MiB) avg
Allocated non-heap memory:        57MB (    55 MiB) max;     55MB (    53 MiB) avg
Total process virtual memory:   8704MB (  8301 MiB) max;   8346MB (  7959 MiB) avg

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