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

Generated on 2017-05-11 12:38:32 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_13 = 1; int INPUTS_at_13[1]; int input_at_13_counter = 0;int num_of_inputs_at_16 = 1; int INPUTS_at_16[1]; int input_at_16_counter = 0;int num_of_inputs_at_17 = 1; int INPUTS_at_17[1]; int input_at_17_counter = 0;int num_of_inputs_at_15 = 1; int INPUTS_at_15[1]; int input_at_15_counter = 0;int initialize_reads() {  for (int instrumentation_index=0; instrumentation_index<1; instrumentation_index++) INPUTS_at_13[instrumentation_index] = __VERIFIER_nondet_int();  for (int instrumentation_index=0; instrumentation_index<1; instrumentation_index++) INPUTS_at_16[instrumentation_index] = __VERIFIER_nondet_int();  for (int instrumentation_index=0; instrumentation_index<1; instrumentation_index++) INPUTS_at_17[instrumentation_index] = __VERIFIER_nondet_int();  for (int instrumentation_index=0; instrumentation_index<1; instrumentation_index++) INPUTS_at_15[instrumentation_index] = __VERIFIER_nondet_int();}extern void __VERIFIER_error(void);  
2
extern void __VERIFIER_assume(int);  
3
void __VERIFIER_assert(int cond) {  
4
  if (!(cond != 0)) {  
5
      __VERIFIER_assume(!((0 == INPUTS_at_13[0])));__VERIFIER_assume(!((0 == INPUTS_at_15[0] && 0 != INPUTS_at_16[0])));__VERIFIER_assume(!((0 != INPUTS_at_16[0])));__VERIFIER_assume(!((0 != INPUTS_at_13[0] && 0 != INPUTS_at_15[0])));__VERIFIER_error();  
6
  }  
7
  return;  
8
}  
9
int __VERIFIER_nondet_int();  
10
int main() {initialize_reads();  
11
    int x,y,z,w;  
12
    x = y = z = w = 0;  
13
    int __cond = (input_at_13_counter < num_of_inputs_at_13) ? INPUTS_at_13[input_at_13_counter++] : __VERIFIER_nondet_int() ;  
14
    while (__cond && y < 10000) {  
15
      __cond = (input_at_15_counter < num_of_inputs_at_15) ? INPUTS_at_15[input_at_15_counter++] : __VERIFIER_nondet_int() ;  
16
      int __if_cond = (input_at_16_counter < num_of_inputs_at_16) ? INPUTS_at_16[input_at_16_counter++] : __VERIFIER_nondet_int() ;  
17
      int __elseif_cond = (input_at_17_counter < num_of_inputs_at_17) ? INPUTS_at_17[input_at_17_counter++] : __VERIFIER_nondet_int() ;  
18
 if (__if_cond != 0) {  
19
     x = x + 1;  
20
     y = y + 100;  
21
 } else if (__elseif_cond != 0) {  
22
     if (x >= 4) {  
23
  x = x + 1;  
24
  y = y + 1;  
25
     }  
26
 } else if (y > 10*w && z >= 100*x) {  
27
     y = -y;  
28
 }  
29
 w = w + 1;  
30
 z = z + 10;  
31
    }  
32
    if (!(x >= 4 && y <= 2)) {  
33
  __VERIFIER_assume(!((0 == INPUTS_at_13[0])));__VERIFIER_assume(!((0 == INPUTS_at_15[0] && 0 != INPUTS_at_16[0])));__VERIFIER_assume(!((0 != INPUTS_at_16[0])));__VERIFIER_assume(!((0 != INPUTS_at_13[0] && 0 != INPUTS_at_15[0])));__VERIFIER_error();  
34
}  
35
    return 0;  
36
}  
2017-05-11 12:38:02:876	INFO	ResourceLimitChecker.fromConfiguration	Using the following resource limits: CPU-time limit of 900s

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

2017-05-11 12:38:04:878	INFO	CPAchecker.runAlgorithm	Starting analysis ...

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

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

2017-05-11 12:38:05:112	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 12:38:05:694	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 12:38:05:781	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 12:38:05:851	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 12:38:06:010	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 12:38:06:013	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 12:38:06:023	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 12:38:06:031	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 12:38:06:189	INFO	Parallel analysis 1:AbstractBMCAlgorithm.run	Creating formula for program

2017-05-11 12:38:06:697	INFO	Parallel analysis 1:AbstractBMCAlgorithm.boundedModelCheck	Starting satisfiability check...

2017-05-11 12:38:06:701	INFO	Parallel analysis 1:AbstractBMCAlgorithm.checkBoundingAssertions	Starting assertions check...

2017-05-11 12:38:06:777	INFO	Parallel analysis 1:KInductionProver.check	Running algorithm to create induction hypothesis

2017-05-11 12:38:07:647	INFO	Parallel analysis 2:InvariantsCPA:InvariantsCPA$InterestingVariableLimitAdjuster.adjustConditions	Adjusting interestingVariableLimit to 1

2017-05-11 12:38:07:649	INFO	Parallel analysis 2:ParallelAlgorithm.runParallelAnalysis	Adjusting precision for CPA org.sosy_lab.cpachecker.cpa.invariants.InvariantsCPA@44917f8

2017-05-11 12:38:07:653	INFO	Parallel analysis 2:ParallelAlgorithm.runParallelAnalysis	Updating reached set provided to other analyses

2017-05-11 12:38:08:721	INFO	Parallel analysis 2:InvariantsCPA:InvariantsCPA$InterestingVariableLimitAdjuster.adjustConditions	Adjusting interestingVariableLimit to 2

2017-05-11 12:38:08:733	INFO	Parallel analysis 2:ParallelAlgorithm.runParallelAnalysis	Adjusting precision for CPA org.sosy_lab.cpachecker.cpa.invariants.InvariantsCPA@44917f8

2017-05-11 12:38:08:741	INFO	Parallel analysis 2:ParallelAlgorithm.runParallelAnalysis	Updating reached set provided to other analyses

2017-05-11 12:38:09:887	INFO	Parallel analysis 2:InvariantsCPA:InvariantsCPA$InterestingVariableLimitAdjuster.adjustConditions	Adjusting interestingVariableLimit to 3

2017-05-11 12:38:09:900	INFO	Parallel analysis 2:ParallelAlgorithm.runParallelAnalysis	Adjusting precision for CPA org.sosy_lab.cpachecker.cpa.invariants.InvariantsCPA@44917f8

2017-05-11 12:38:09:904	INFO	Parallel analysis 2:ParallelAlgorithm.runParallelAnalysis	Updating reached set provided to other analyses

2017-05-11 12:38:10:536	INFO	Parallel analysis 2:InvariantsCPA:InvariantsCPA$InterestingVariableLimitAdjuster.adjustConditions	Adjusting interestingVariableLimit to 5

2017-05-11 12:38:10:537	INFO	Parallel analysis 2:ParallelAlgorithm.runParallelAnalysis	Adjusting precision for CPA org.sosy_lab.cpachecker.cpa.invariants.InvariantsCPA@44917f8

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

2017-05-11 12:38:10:863	INFO	Parallel analysis 2:InvariantsCPA:InvariantsCPA$InterestingVariableLimitAdjuster.adjustConditions	Adjusting interestingVariableLimit to 9

2017-05-11 12:38:10:863	INFO	Parallel analysis 2:ParallelAlgorithm.runParallelAnalysis	Adjusting precision for CPA org.sosy_lab.cpachecker.cpa.invariants.InvariantsCPA@44917f8

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

2017-05-11 12:38:11:811	INFO	Parallel analysis 2:InvariantsCPA:InvariantsCPA$InterestingVariableLimitAdjuster.adjustConditions	Adjusting interestingVariableLimit to 11

2017-05-11 12:38:11:812	INFO	Parallel analysis 2:ParallelAlgorithm.runParallelAnalysis	Adjusting precision for CPA org.sosy_lab.cpachecker.cpa.invariants.InvariantsCPA@44917f8

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

2017-05-11 12:38:13:303	INFO	Parallel analysis 2:InvariantsCPA:InvariantsCPA$FormulaDepthAdjuster.adjustConditions	Adjusting maximum formula depth to 2

2017-05-11 12:38:13:303	INFO	Parallel analysis 2:ParallelAlgorithm.runParallelAnalysis	Adjusting precision for CPA org.sosy_lab.cpachecker.cpa.invariants.InvariantsCPA@44917f8

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

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

2017-05-11 12:38:14:563	INFO	Parallel analysis 2:ParallelAlgorithm.runParallelAnalysis	Adjusting precision for CPA org.sosy_lab.cpachecker.cpa.invariants.InvariantsCPA@44917f8

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

2017-05-11 12:38:15:155	INFO	Parallel analysis 2:InvariantsCPA:InvariantsCPA$InterestingVariableLimitAdjuster.adjustConditions	Adjusting interestingVariableLimit to 17

2017-05-11 12:38:15:155	INFO	Parallel analysis 2:ParallelAlgorithm.runParallelAnalysis	Adjusting precision for CPA org.sosy_lab.cpachecker.cpa.invariants.InvariantsCPA@44917f8

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

2017-05-11 12:38:15:573	INFO	Parallel analysis 2:InvariantsCPA:InvariantsCPA$InterestingVariableLimitAdjuster.adjustConditions	Adjusting interestingVariableLimit to 21

2017-05-11 12:38:15:574	INFO	Parallel analysis 2:ParallelAlgorithm.runParallelAnalysis	Adjusting precision for CPA org.sosy_lab.cpachecker.cpa.invariants.InvariantsCPA@44917f8

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

2017-05-11 12:38:15:941	INFO	Parallel analysis 2:InvariantsCPA:InvariantsCPA$InterestingVariableLimitAdjuster.adjustConditions	Adjusting interestingVariableLimit to 29

2017-05-11 12:38:15:942	INFO	Parallel analysis 2:ParallelAlgorithm.runParallelAnalysis	Adjusting precision for CPA org.sosy_lab.cpachecker.cpa.invariants.InvariantsCPA@44917f8

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

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

2017-05-11 12:38:16:316	INFO	Parallel analysis 2:ParallelAlgorithm.runParallelAnalysis	Adjusting precision for CPA org.sosy_lab.cpachecker.cpa.invariants.InvariantsCPA@44917f8

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

2017-05-11 12:38:16:734	INFO	Parallel analysis 2:InvariantsCPA:InvariantsCPA$InterestingVariableLimitAdjuster.adjustConditions	Adjusting interestingVariableLimit to 35

2017-05-11 12:38:16:735	INFO	Parallel analysis 2:ParallelAlgorithm.runParallelAnalysis	Adjusting precision for CPA org.sosy_lab.cpachecker.cpa.invariants.InvariantsCPA@44917f8

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

2017-05-11 12:38:17:076	INFO	Parallel analysis 2:InvariantsCPA:InvariantsCPA$InterestingVariableLimitAdjuster.adjustConditions	Adjusting interestingVariableLimit to 39

2017-05-11 12:38:17:077	INFO	Parallel analysis 2:ParallelAlgorithm.runParallelAnalysis	Adjusting precision for CPA org.sosy_lab.cpachecker.cpa.invariants.InvariantsCPA@44917f8

2017-05-11 12:38:17:077	INFO	Parallel analysis 2:ParallelAlgorithm.runParallelAnalysis	Updating reached set provided to other analyses

2017-05-11 12:38:17:458	INFO	Parallel analysis 2:InvariantsCPA:InvariantsCPA$AbstractionStrategyAdjuster.adjustConditions	Adjusting abstraction strategy to NEVER

2017-05-11 12:38:17:458	INFO	Parallel analysis 2:ParallelAlgorithm.runParallelAnalysis	Adjusting precision for CPA org.sosy_lab.cpachecker.cpa.invariants.InvariantsCPA@44917f8

2017-05-11 12:38:17:458	INFO	Parallel analysis 2:ParallelAlgorithm.runParallelAnalysis	Updating reached set provided to other analyses

2017-05-11 12:38:21:052	INFO	Parallel analysis 1:KInductionProver.check	Starting induction check...

2017-05-11 12:38:31:021	INFO	Parallel analysis 1:BoundsCPA:BoundsCPA.adjustPrecision	Adjusting maxLoopIterations to 2

2017-05-11 12:38:31:022	INFO	Parallel analysis 1:AbstractBMCAlgorithm.run	Creating formula for program

2017-05-11 12:38:31:106	INFO	Parallel analysis 1:AbstractBMCAlgorithm.boundedModelCheck	Starting satisfiability check...

2017-05-11 12:38:31:251	INFO	Parallel analysis 1:BMCAlgorithm.analyzeCounterexample	Error found, creating error path

2017-05-11 12:38:31:492	INFO	Parallel analysis 1:CounterexampleCheckAlgorithm.checkCounterexample	Error path found, starting counterexample check with CBMC.

2017-05-11 12:38:31:733	INFO	Parallel analysis 1:CounterexampleCheckAlgorithm.checkCounterexample	Error path found but identified as infeasible.

2017-05-11 12:38:31:734	INFO	Parallel analysis 1:CounterexampleCheckAlgorithm.checkCounterexample	Error path found, starting counterexample check with CBMC.

2017-05-11 12:38:32:056	INFO	Parallel analysis 1:CounterexampleCheckAlgorithm.checkCounterexample	Error path found and confirmed by counterexample check with CBMC.

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

2017-05-11 12:38:32:064	INFO	Parallel analysis 2:ParallelAlgorithm.runParallelAnalysis	Analysis was terminated

2017-05-11 12:38:32:065	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:            2 (1% 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:         2 (100%)
  Times precision was empty:       2 (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:         34
  BDD entailment checks:           0
Number of SMT sat checks:          0
  trivial:                         0
  cached:                          0

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

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

Total number of created targets for pointer analysis: 32
   Number of created targets for uf: *signed_int is 9



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

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

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


ValueAnalysisCPA statistics
---------------------------
Number of variables:                                   2213 (count: 177, min: 0, max: 18, avg: 12.50)
Number of global variables:                            1380 (count: 177, min: 0, max: 9, avg: 7.80)

ValueAnalysisPrecisionAdjustment statistics
-------------------------------------------
Number of abstraction computations:                     194
Total time for liveness abstraction:                   0.000s
Total time for abstraction computation:                0.017s
Total time for path thresholds:                        0.000s
Number of tracked memory locations:                29

ValueAnalysisTransferRelation statistics
----------------------------------------
Number of Assumptions:                                   94
Number of deterministic Assumptions:                     38
Level of Determinism:                              40%

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.004s
Automaton transfers with branching:                0
Automaton transfer successors:                          194 (count: 196, min: 0, max: 1, avg: 0.99) [0 x 2, 1 x 194]

CPA algorithm statistics
------------------------
Number of iterations:            179
Max size of waitlist:            8
Average size of waitlist:        3
Number of computed successors:   194
Max successors for one state:    2
Number of times merged:          17
Number of times stopped:         17
Number of times breaked:         0

Total time for CPA algorithm:         0.576s (Max:     0.502s)
  Time for choose from waitlist:      0.000s
  Time for precision adjustment:      0.033s
  Time for transfer relation:         0.523s
  Time for merge operator:            0.013s
  Time for stop operator:             0.001s
  Time for adding to reached set:     0.001s

BMC algorithm statistics
------------------------
Time for BMC formula creation:           0.580s
Time for final sat check:                0.143s
Time for error path creation:            0.219s
Time for bounding assertions check:      0.011s
Time for induction formula creation:    14.274s
Time for induction check:                9.966s

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


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.089s
Automaton transfers with branching:                0
Automaton transfer successors:                        10694 (count: 10872, min: 0, max: 1, avg: 0.98) [0 x 178, 1 x 10694]

CPA algorithm statistics
------------------------
Number of iterations:            9113
Max size of waitlist:            41
Average size of waitlist:        10
Number of computed successors:   10694
Max successors for one state:    2
Number of times merged:          3235
Number of times stopped:         4404
Number of times breaked:         0

Total time for CPA algorithm:        24.695s (Max:    14.332s)
  Time for choose from waitlist:      0.048s
  Time for precision adjustment:      0.220s
  Time for transfer relation:         3.905s
  Time for merge operator:           16.214s
  Time for stop operator:             4.102s
  Time for adding to reached set:     0.037s


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

Code Coverage
-----------------------------
  Function coverage:      0.667
  Visited lines:          23
  Total lines:            26
  Line coverage:          0.885
  Visited conditions:     49
  Total conditions:       68
  Condition coverage:     0.721

CPAchecker general statistics
-----------------------------
Number of program locations:     153
Number of CFA edges:             178
Number of relevant variables:    37
Number of functions:             3
Number of loops:                 5
Size of reached set:             177
  Number of reached locations:   128 (84%)
    Avg states per location:     1
    Max states per location:     3 (at node N67)
  Number of reached functions:   2 (67%)
  Number of partitions:          177
    Avg size of partitions:      1
    Max size of partitions:      1
  Number of target states:       2

Time for analysis setup:          1.888s
  Time for loading CPAs:          0.459s
  Time for loading parser:        0.465s
  Time for CFA construction:      0.894s
    Time for parsing file(s):     0.245s
    Time for AST to CFA:          0.283s
    Time for CFA sanity check:    0.034s
    Time for post-processing:     0.250s
      Time for var class.:        0.158s
    Time for CFA export:          0.203s
Time for Analysis:               27.184s
CPU time for analysis:           82.120s
Time for analyzing result:        0.001s
Total time for CPAchecker:       29.088s
Total CPU time for CPAchecker:   86.380s
Time for statistics:              0.588s

Time for Garbage Collector:       2.232s (in 23 runs)
Garbage Collector(s) used:    PS MarkSweep, PS Scavenge
Used heap memory:                421MB (   402 MiB) max;    189MB (   180 MiB) avg;    441MB (   421 MiB) peak
Used non-heap memory:             50MB (    47 MiB) max;     45MB (    43 MiB) avg;     54MB (    51 MiB) peak
Used in PS Old Gen pool:          25MB (    24 MiB) max;     17MB (    17 MiB) avg;     25MB (    24 MiB) peak
Allocated heap memory:          1205MB (  1150 MiB) max;    957MB (   913 MiB) avg
Allocated non-heap memory:        52MB (    49 MiB) max;     47MB (    45 MiB) avg
Total process virtual memory:   8504MB (  8110 MiB) max;   8013MB (  7642 MiB) avg

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