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

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

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

2017-05-11 15:24:33:955	INFO	CFACreationUtils.addEdgeToCFA	line 91: Dead code detected: return (retValue_acc);

2017-05-11 15:24:33:960	INFO	CFACreationUtils.addEdgeToCFA	line 123: Dead code detected: return (retValue_acc);

2017-05-11 15:24:33:966	INFO	CFACreationUtils.addEdgeToCFA	line 137: Dead code detected: return (retValue_acc);

2017-05-11 15:24:34:044	INFO	CFACreationUtils.addEdgeToCFA	line 457: Dead code detected: return (retValue_acc);

2017-05-11 15:24:34:051	INFO	CFACreationUtils.addEdgeToCFA	line 503: Dead code detected: return (retValue_acc);

2017-05-11 15:24:34:054	INFO	CFACreationUtils.addEdgeToCFA	line 518: Dead code detected: return (retValue_acc);

2017-05-11 15:24:34:057	INFO	CFACreationUtils.addEdgeToCFA	line 541: Dead code detected: return (retValue_acc);

2017-05-11 15:24:34:066	INFO	CFACreationUtils.addEdgeToCFA	line 668: Dead code detected: return (retValue_acc);

2017-05-11 15:24:34:098	INFO	CFACreationUtils.addEdgeToCFA	line 844: Dead code detected: return (retValue_acc);

2017-05-11 15:24:34:107	INFO	CFACreationUtils.addEdgeToCFA	line 853: Dead code detected: return (retValue_acc);

2017-05-11 15:24:34:111	INFO	CFACreationUtils.addEdgeToCFA	line 908: Dead code detected: return (retValue_acc);

2017-05-11 15:24:34:452	WARNING	CFunctionPointerResolver.replaceFunctionPointerCall	line 294: Function pointer *__cil_tmp10 with type int (*)(int, int) is called, but no possible target functions were found.

2017-05-11 15:24:36:188	INFO	CPAchecker.runAlgorithm	Starting analysis ...

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

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

2017-05-11 15:24:36:551	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:24:37:415	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:24:37:643	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:24:37:937	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:24:38:384	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:24:38:393	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:24:38:408	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:24:38:418	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:24:38:932	INFO	Parallel analysis 1:AbstractBMCAlgorithm.run	Creating formula for program

2017-05-11 15:24:42:655	INFO	Parallel analysis 1:AbstractBMCAlgorithm.boundedModelCheck	Starting satisfiability check...

2017-05-11 15:24:42:709	INFO	Parallel analysis 1:AbstractBMCAlgorithm.checkBoundingAssertions	Starting assertions check...

2017-05-11 15:24:43:100	INFO	Parallel analysis 2:InvariantsCPA:InvariantsCPA$InterestingVariableLimitAdjuster.adjustConditions	Adjusting interestingVariableLimit to 1

2017-05-11 15:24:43:100	INFO	Parallel analysis 2:ParallelAlgorithm.runParallelAnalysis	Adjusting precision for CPA org.sosy_lab.cpachecker.cpa.invariants.InvariantsCPA@4bb3b879

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

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

2017-05-11 15:24:48:742	INFO	Parallel analysis 2:InvariantsCPA:InvariantsCPA$InterestingVariableLimitAdjuster.adjustConditions	Adjusting interestingVariableLimit to 2

2017-05-11 15:24:48:743	INFO	Parallel analysis 2:ParallelAlgorithm.runParallelAnalysis	Adjusting precision for CPA org.sosy_lab.cpachecker.cpa.invariants.InvariantsCPA@4bb3b879

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

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

2017-05-11 15:24:52:080	INFO	Parallel analysis 2:ParallelAlgorithm.runParallelAnalysis	Adjusting precision for CPA org.sosy_lab.cpachecker.cpa.invariants.InvariantsCPA@4bb3b879

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

2017-05-11 15:24:54:708	INFO	Parallel analysis 2:InvariantsCPA:InvariantsCPA$InterestingVariableLimitAdjuster.adjustConditions	Adjusting interestingVariableLimit to 8

2017-05-11 15:24:54:708	INFO	Parallel analysis 2:ParallelAlgorithm.runParallelAnalysis	Adjusting precision for CPA org.sosy_lab.cpachecker.cpa.invariants.InvariantsCPA@4bb3b879

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

2017-05-11 15:24:57:151	INFO	Parallel analysis 2:InvariantsCPA:InvariantsCPA$InterestingVariableLimitAdjuster.adjustConditions	Adjusting interestingVariableLimit to 16

2017-05-11 15:24:57:151	INFO	Parallel analysis 2:ParallelAlgorithm.runParallelAnalysis	Adjusting precision for CPA org.sosy_lab.cpachecker.cpa.invariants.InvariantsCPA@4bb3b879

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

2017-05-11 15:25:00:886	INFO	Parallel analysis 2:InvariantsCPA:InvariantsCPA$InterestingVariableLimitAdjuster.adjustConditions	Adjusting interestingVariableLimit to 20

2017-05-11 15:25:00:886	INFO	Parallel analysis 2:ParallelAlgorithm.runParallelAnalysis	Adjusting precision for CPA org.sosy_lab.cpachecker.cpa.invariants.InvariantsCPA@4bb3b879

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

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

2017-05-11 15:25:03:664	INFO	Parallel analysis 2:ParallelAlgorithm.runParallelAnalysis	Adjusting precision for CPA org.sosy_lab.cpachecker.cpa.invariants.InvariantsCPA@4bb3b879

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

2017-05-11 15:25:05:102	INFO	Parallel analysis 2:InvariantsCPA:InvariantsCPA$InterestingVariableLimitAdjuster.adjustConditions	Adjusting interestingVariableLimit to 28

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

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

2017-05-11 15:25:05:210	INFO	Parallel analysis 1:KInductionProver.check	Starting induction check...

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

2017-05-11 15:25:09:813	INFO	Parallel analysis 2:ParallelAlgorithm.runParallelAnalysis	Adjusting precision for CPA org.sosy_lab.cpachecker.cpa.invariants.InvariantsCPA@4bb3b879

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

2017-05-11 15:25:12:339	INFO	Parallel analysis 2:InvariantsCPA:InvariantsCPA$InterestingVariableLimitAdjuster.adjustConditions	Adjusting interestingVariableLimit to 40

2017-05-11 15:25:12:339	INFO	Parallel analysis 2:ParallelAlgorithm.runParallelAnalysis	Adjusting precision for CPA org.sosy_lab.cpachecker.cpa.invariants.InvariantsCPA@4bb3b879

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

2017-05-11 15:25:18:338	INFO	Parallel analysis 1:BoundsCPA:BoundsCPA.adjustPrecision	Adjusting maxLoopIterations to 2

2017-05-11 15:25:18:338	INFO	Parallel analysis 1:AbstractBMCAlgorithm.run	Creating formula for program

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

2017-05-11 15:25:18:361	INFO	Parallel analysis 1:AbstractBMCAlgorithm.checkBoundingAssertions	Starting assertions check...

2017-05-11 15:25:18:408	INFO	Parallel analysis 1:KInductionProver.check	Running algorithm to create induction hypothesis

2017-05-11 15:25:24:078	INFO	Parallel analysis 1:KInductionProver.check	Starting induction check...

2017-05-11 15:25:28:469	INFO	Parallel analysis 1:BoundsCPA:BoundsCPA.adjustPrecision	Adjusting maxLoopIterations to 3

2017-05-11 15:25:28:469	INFO	Parallel analysis 1:AbstractBMCAlgorithm.run	Creating formula for program

2017-05-11 15:25:28:478	INFO	Parallel analysis 1:AbstractBMCAlgorithm.boundedModelCheck	Starting satisfiability check...

2017-05-11 15:25:28:479	INFO	Parallel analysis 1:AbstractBMCAlgorithm.checkBoundingAssertions	Starting assertions check...

2017-05-11 15:25:28:536	INFO	Parallel analysis 1:KInductionProver.check	Running algorithm to create induction hypothesis

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

2017-05-11 15:25:36:249	INFO	Parallel analysis 2:InvariantsCPA:InvariantsCPA$InterestingVariableLimitAdjuster.adjustConditions	Adjusting interestingVariableLimit to 44

2017-05-11 15:25:36:249	INFO	Parallel analysis 2:ParallelAlgorithm.runParallelAnalysis	Adjusting precision for CPA org.sosy_lab.cpachecker.cpa.invariants.InvariantsCPA@4bb3b879

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

2017-05-11 15:25:53:516	INFO	Parallel analysis 1:BoundsCPA:BoundsCPA.adjustPrecision	Adjusting maxLoopIterations to 4

2017-05-11 15:25:53:516	INFO	Parallel analysis 1:AbstractBMCAlgorithm.run	Creating formula for program

2017-05-11 15:25:53:525	INFO	Parallel analysis 1:AbstractBMCAlgorithm.boundedModelCheck	Starting satisfiability check...

2017-05-11 15:25:53:526	INFO	Parallel analysis 1:AbstractBMCAlgorithm.checkBoundingAssertions	Starting assertions check...

2017-05-11 15:25:53:599	INFO	Parallel analysis 1:KInductionProver.check	Running algorithm to create induction hypothesis

2017-05-11 15:25:57:919	INFO	Parallel analysis 2:InvariantsCPA:InvariantsCPA$InterestingVariableLimitAdjuster.adjustConditions	Adjusting interestingVariableLimit to 52

2017-05-11 15:25:57:920	INFO	Parallel analysis 2:ParallelAlgorithm.runParallelAnalysis	Adjusting precision for CPA org.sosy_lab.cpachecker.cpa.invariants.InvariantsCPA@4bb3b879

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

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

2017-05-11 15:26:24:193	INFO	Parallel analysis 1:BoundsCPA:BoundsCPA.adjustPrecision	Adjusting maxLoopIterations to 5

2017-05-11 15:26:24:194	INFO	Parallel analysis 1:AbstractBMCAlgorithm.run	Creating formula for program

2017-05-11 15:26:24:204	INFO	Parallel analysis 1:AbstractBMCAlgorithm.boundedModelCheck	Starting satisfiability check...

2017-05-11 15:26:24:205	INFO	Parallel analysis 1:AbstractBMCAlgorithm.checkBoundingAssertions	Starting assertions check...

2017-05-11 15:26:24:295	INFO	Parallel analysis 1:KInductionProver.check	Running algorithm to create induction hypothesis

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

2017-05-11 15:26:59:610	INFO	Parallel analysis 1:BoundsCPA:BoundsCPA.adjustPrecision	Adjusting maxLoopIterations to 6

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

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

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

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

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

2017-05-11 15:27:43:463	INFO	Parallel analysis 2:InvariantsCPA:InvariantsCPA$InterestingVariableLimitAdjuster.adjustConditions	Adjusting interestingVariableLimit to 56

2017-05-11 15:27:43:464	INFO	Parallel analysis 2:ParallelAlgorithm.runParallelAnalysis	Adjusting precision for CPA org.sosy_lab.cpachecker.cpa.invariants.InvariantsCPA@4bb3b879

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

2017-05-11 15:28:20:143	INFO	Parallel analysis 1:BoundsCPA:BoundsCPA.adjustPrecision	Adjusting maxLoopIterations to 7

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

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

2017-05-11 15:28:27:355	INFO	Parallel analysis 1:BMCAlgorithm.analyzeCounterexample	Error found, creating error path

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

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

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

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

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

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

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

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

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

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

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

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

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

2017-05-11 15:28:35:016	INFO	Parallel analysis 1:CounterexampleCheckAlgorithm.checkCounterexample	Error path found and confirmed by counterexample check with CBMC.

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

2017-05-11 15:28:35:029	INFO	Parallel analysis 2:ParallelAlgorithm.runParallelAnalysis	Analysis was terminated

2017-05-11 15:28:35:030	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:         324
  BDD entailment checks:           0
Number of SMT sat checks:          0
  trivial:                         0
  cached:                          0

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

Time for post operator:                  3.057s
  Time for path formula creation:        3.055s
Time for strengthen operator:            0.007s
Time for prec operator:                  0.033s
  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.146s
Time for coverage check:                 0.000s
Total time for SMT solver (w/o itp):     0.000s

Total number of created targets for pointer analysis: 882
   Number of created targets for uf: *signed_int is 127



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:                                  23781 (count: 1521, min: 0, max: 22, avg: 15.64)
Number of global variables:                           16492 (count: 1521, min: 0, max: 16, avg: 10.84)

ValueAnalysisPrecisionAdjustment statistics
-------------------------------------------
Number of abstraction computations:                    1688
Total time for liveness abstraction:                   0.000s
Total time for abstraction computation:                0.041s
Total time for path thresholds:                        0.000s
Number of tracked memory locations:                50

ValueAnalysisTransferRelation statistics
----------------------------------------
Number of Assumptions:                                  526
Number of deterministic Assumptions:                    132
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.040s
Automaton transfers with branching:                0
Automaton transfer successors:                         1688 (count: 1695, min: 0, max: 1, avg: 1.00) [0 x 7, 1 x 1688]

CPA algorithm statistics
------------------------
Number of iterations:            1533
Max size of waitlist:            7
Average size of waitlist:        2
Number of computed successors:   1688
Max successors for one state:    2
Number of times merged:          162
Number of times stopped:         162
Number of times breaked:         0

Total time for CPA algorithm:         4.236s (Max:     3.703s)
  Time for choose from waitlist:      0.024s
  Time for precision adjustment:      0.103s
  Time for transfer relation:         3.921s
  Time for merge operator:            0.153s
  Time for stop operator:             0.004s
  Time for adding to reached set:     0.015s

BMC algorithm statistics
------------------------
Time for BMC formula creation:           4.242s
Time for final sat check:                6.759s
Time for error path creation:            1.911s
Time for bounding assertions check:      0.774s
Time for induction formula creation:    62.042s
Time for induction check:              154.064s

Counterexample-Check Algorithm statistics
-----------------------------------------
Number of counterexample checks:    1
Number of infeasible paths:         6 (600%)
Time for counterexample checks:         5.200s
Time for running CBMC:                  4.789s


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.636s
  Time for transition matches:                         0.230s
  Time for transition assertions:                      0.001s
  Time for transition actions:                         0.000s
Automaton transfers with branching:                0
Automaton transfer successors:                       125658 (count: 126109, min: 0, max: 1, avg: 1.00) [0 x 451, 1 x 125658]

CPA algorithm statistics
------------------------
Number of iterations:            117320
Max size of waitlist:            540
Average size of waitlist:        149
Number of computed successors:   125658
Max successors for one state:    2
Number of times merged:          25057
Number of times stopped:         27408
Number of times breaked:         0

Total time for CPA algorithm:       235.001s (Max:   105.485s)
  Time for choose from waitlist:      0.155s
  Time for precision adjustment:      2.496s
  Time for transfer relation:        24.347s
  Time for merge operator:          193.948s
  Time for stop operator:            11.571s
  Time for adding to reached set:     0.956s


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

Code Coverage
-----------------------------
  Function coverage:      0.676
  Visited lines:          118
  Total lines:            414
  Line coverage:          0.285
  Visited conditions:     75
  Total conditions:       110
  Condition coverage:     0.682

CPAchecker general statistics
-----------------------------
Number of program locations:     678
Number of CFA edges:             786
Number of relevant variables:    146
Number of functions:             37
Number of loops:                 9
Size of reached set:             1521
  Number of reached locations:   320 (47%)
    Avg states per location:     4
    Max states per location:     13 (at node N568)
  Number of reached functions:   25 (68%)
  Number of partitions:          1521
    Avg size of partitions:      1
    Max size of partitions:      1
  Number of target states:       7

Time for analysis setup:          3.923s
  Time for loading CPAs:          1.206s
  Time for loading parser:        0.685s
  Time for CFA construction:      1.933s
    Time for parsing file(s):     0.473s
    Time for AST to CFA:          0.541s
    Time for CFA sanity check:    0.190s
    Time for post-processing:     0.666s
      Time for var class.:        0.323s
    Time for CFA export:          0.982s
Time for Analysis:              238.839s
CPU time for analysis:          470.490s
Time for analyzing result:        0.002s
Total time for CPAchecker:      242.780s
Total CPU time for CPAchecker:  477.350s
Time for statistics:              5.272s

Time for Garbage Collector:      17.787s (in 190 runs)
Garbage Collector(s) used:    PS MarkSweep, PS Scavenge
Used heap memory:                628MB (   599 MiB) max;    311MB (   297 MiB) avg;    650MB (   620 MiB) peak
Used non-heap memory:             53MB (    51 MiB) max;     50MB (    48 MiB) avg;     59MB (    56 MiB) peak
Used in PS Old Gen pool:         216MB (   206 MiB) max;    116MB (   111 MiB) avg;    216MB (   206 MiB) peak
Allocated heap memory:          1205MB (  1150 MiB) max;    775MB (   739 MiB) avg
Allocated non-heap memory:        55MB (    52 MiB) max;     52MB (    50 MiB) avg
Total process virtual memory:   6936MB (  6615 MiB) max;   6607MB (  6301 MiB) avg

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