scripts/cpa.sh -sv-comp15 -disable-java-assertions -heap 10000m -timelimit 900s -stats -spec ../benchmarks/c/loop-new/ALL.prp ../benchmarks/c/loop-new/half_true-unreach-call.i
--------------------------------------------------------------------------------
Running CPAchecker with Java heap of size 10000m.
Running CPAchecker with the following extra VM options: -Djava.io.tmpdir=/tmp/vcloud-vcloud-master/worker/tmp_-1392070065_tempdir
Using the following resource limits: CPU-time limit of 900s (ResourceLimitChecker.fromConfiguration, INFO)
CPAchecker 1.3.10-svcomp15 (OpenJDK 64-Bit Server VM 1.7.0_85) started (CPAchecker.run, INFO)
Using Restarting Algorithm (CoreComponentsFactory.createAlgorithm, INFO)
The following configuration options were specified but are not used:
cpa.predicate.useFloatingPointArithmetic
cpa.callstack.skipVoidRecursion
cpa.arg.errorPath.file
cpa.callstack.skipFunctionPointerRecursion
cpa.arg.errorPath.graphml
(CPAchecker.printConfigurationWarnings, WARNING)
Starting analysis ... (CPAchecker.runAlgorithm, INFO)
Using the following resource limits: CPU-time limit of 60s (Analysis1:ResourceLimitChecker.fromConfiguration, INFO)
Error path found, starting counterexample check with CPACHECKER. (Analysis1:CounterexampleCheckAlgorithm.checkCounterexample, INFO)
Using the following resource limits: CPU-time limit of 900s (Analysis1:CounterexampleCheck:ResourceLimitChecker.fromConfiguration, INFO)
Using predicate analysis with MathSAT5 version 5.2.12 (6de13e7f4050) (Jun 5 2014 09:12:40, gmp 5.0.5, gcc 4.6.3, 64-bit) and JFactory 1.21. (Analysis1:CounterexampleCheck:PredicateCPA:PredicateCPA., INFO)
Error path found, but identified as infeasible by counterexample check with CPACHECKER. (Analysis1:CounterexampleCheckAlgorithm.checkCounterexample, INFO)
Warning: Analysis not completed (Refinement failed: External tool verified counterexample as infeasible) (CounterexampleCheckAlgorithm.checkCounterexample, WARNING)
Statistics for algorithm 1 of 6
===============================
Total time for algorithm 1: 0.262s
ValueAnalysisCPA statistics
---------------------------
Number of variables: 53 (count: 20, min: 0, max: 4, avg: 2.65)
Number of global variables: 0 (count: 20, min: 0, max: 0, avg: 0.00)
AutomatonAnalysis (SVCOMP) statistics
-------------------------------------
Number of states: 1
Total time for successor computation: 0.002s
Automaton transfers with branching: 0
Automaton transfer successors: 31 (count: 31, min: 1, max: 1, avg: 1.00) [1 x 31]
CPA algorithm statistics
------------------------
Number of iterations: 16
Max size of waitlist: 4
Average size of waitlist: 2
Number of computed successors: 20
Max successors for one state: 2
Number of times merged: 0
Number of times stopped: 1
Number of times breaked: 1
Total time for CPA algorithm: 0.015s (Max: 0.015s)
Time for choose from waitlist: 0.001s
Time for precision adjustment: 0.000s
Time for transfer relation: 0.012s
Time for stop operator: 0.001s
Time for adding to reached set: 0.000s
Counterexample-Check Algorithm statistics
-----------------------------------------
Number of counterexample checks: 1
Number of infeasible paths: 1 (100%)
Time for counterexample checks: 0.115s
RestartAlgorithm switches to the next configuration... (RestartAlgorithm.run, INFO)
Using the following resource limits: CPU-time limit of 60s (Analysis2:ResourceLimitChecker.fromConfiguration, INFO)
Error path found, starting counterexample check with CPACHECKER. (Analysis2:CounterexampleCheckAlgorithm.checkCounterexample, INFO)
Using the following resource limits: CPU-time limit of 900s (Analysis2:CounterexampleCheck:ResourceLimitChecker.fromConfiguration, INFO)
Using predicate analysis with MathSAT5 version 5.2.12 (6de13e7f4050) (Jun 5 2014 09:12:40, gmp 5.0.5, gcc 4.6.3, 64-bit) and JFactory 1.21. (Analysis2:CounterexampleCheck:PredicateCPA:PredicateCPA., INFO)
Error path found, but identified as infeasible by counterexample check with CPACHECKER. (Analysis2:CounterexampleCheckAlgorithm.checkCounterexample, INFO)
Warning: Analysis not completed (Refinement failed: External tool verified counterexample as infeasible) (CounterexampleCheckAlgorithm.checkCounterexample, WARNING)
Statistics for algorithm 2 of 6
===============================
Total time for algorithm 2: 0.109s
ValueAnalysisCPA statistics
---------------------------
Number of variables: 0 (count: 20, min: 0, max: 0, avg: 0.00)
Number of global variables: 0 (count: 20, min: 0, max: 0, avg: 0.00)
AutomatonAnalysis (SVCOMP) statistics
-------------------------------------
Number of states: 1
Total time for successor computation: 0.001s
Automaton transfers with branching: 0
Automaton transfer successors: 32 (count: 32, min: 1, max: 1, avg: 1.00) [1 x 32]
ComponentAwarePrecisionAdjustment Statistics statistics
-------------------------------------------------------
Total time for precision adjustment: 0.001s
Total time for composite: 0.000s
Total time for abstraction computation: 0.000s
Total time for path threshold: 0.000s
Number of abstraction computations: 21
CPA algorithm statistics
------------------------
Number of iterations: 16
Max size of waitlist: 4
Average size of waitlist: 2
Number of computed successors: 21
Max successors for one state: 2
Number of times merged: 0
Number of times stopped: 2
Number of times breaked: 1
Total time for CPA algorithm: 0.005s (Max: 0.005s)
Time for choose from waitlist: 0.000s
Time for precision adjustment: 0.001s
Time for transfer relation: 0.004s
Time for stop operator: 0.000s
Time for adding to reached set: 0.000s
ValueAnalysisDelegatingRefiner statistics
-----------------------------------------
number of value analysis refinements: 0
number of successful valueAnalysis refinements: 0
number of predicate refinements: 0
ValueAnalysisInterpolationBasedRefiner statistics
-------------------------------------------------
Number of interpolations: 0
Number of interpolation queries: 0 (count: 0, min: 0, max: 0, avg: 0.00)
Size of interpolant: 0 (count: 0, min: 0, max: 0, avg: 0.00)
Time for interpolation: 0.000s
CEGAR algorithm statistics
--------------------------
Number of refinements: 1
Number of successful refinements: 0
Number of failed refinements: 0
Max. size of reached set before ref.: 20
Max. size of reached set after ref.: 0
Avg. size of reached set before ref.: 20.00
Avg. size of reached set after ref.: NaN
Total time for CEGAR algorithm: 0.018s
Time for refinements: 0.013s
Average time for refinement: 0.013s
Max time for refinement: 0.013s
Counterexample-Check Algorithm statistics
-----------------------------------------
Number of counterexample checks: 1
Number of infeasible paths: 1 (100%)
Time for counterexample checks: 0.054s
RestartAlgorithm switches to the next configuration... (RestartAlgorithm.run, INFO)
Using the following resource limits: CPU-time limit of 60s (Analysis3:ResourceLimitChecker.fromConfiguration, INFO)
Using predicate analysis with MathSAT5 version 5.2.12 (6de13e7f4050) (Jun 5 2014 09:12:40, gmp 5.0.5, gcc 4.6.3, 64-bit) and JFactory 1.21. (Analysis3:PredicateCPA:PredicateCPA., INFO)
Creating formula for program (Analysis3:BMCAlgorithm.run, INFO)
Finding invariants (Analysis3:CPAInvariantGenerator$InvariantGenerationTask.call, INFO)
Starting satisfiability check... (Analysis3:BMCAlgorithm.checkTargetStates, INFO)
Starting assertions check... (Analysis3:BMCAlgorithm.checkBoundingAssertions, INFO)
Running algorithm to create induction hypothesis (Analysis3:BMCAlgorithm$KInductionProver.check, INFO)
Starting induction check... (Analysis3:BMCAlgorithm$KInductionProver.check, INFO)
Adjusting maxLoopIterations to 2 (Analysis3:LoopstackCPA:LoopstackCPA.adjustPrecision, INFO)
Starting satisfiability check... (Analysis3:BMCAlgorithm.checkTargetStates, INFO)
Error found, creating error path (Analysis3:BMCAlgorithm.addCounterexampleTo, INFO)
ARG branching without AssumeEdge at ARG node 148. (Analysis3:PredicateCPA:PathFormulaManagerImpl.buildBranchingFormula, WARNING)
Could not create error path because of missing branching information! (Analysis3:BMCAlgorithm.addCounterexampleTo, WARNING)
Error path found, starting counterexample check with CPACHECKER. (Analysis3:CounterexampleCheckAlgorithm.checkCounterexample, INFO)
Using the following resource limits: CPU-time limit of 900s (Analysis3:CounterexampleCheck:ResourceLimitChecker.fromConfiguration, INFO)
Using predicate analysis with MathSAT5 version 5.2.12 (6de13e7f4050) (Jun 5 2014 09:12:40, gmp 5.0.5, gcc 4.6.3, 64-bit) and JFactory 1.21. (Analysis3:CounterexampleCheck:PredicateCPA:PredicateCPA., INFO)
Error path found, but identified as infeasible by counterexample check with CPACHECKER. (Analysis3:CounterexampleCheckAlgorithm.checkCounterexample, INFO)
Warning: Analysis not completed (Refinement failed: External tool verified counterexample as infeasible) (CounterexampleCheckAlgorithm.checkCounterexample, WARNING)
Statistics for algorithm 3 of 6
===============================
Total time for algorithm 3: 0.210s
PredicateCPA statistics
-----------------------
Number of abstractions: 0 (0% of all post computations)
Number of strengthen sat checks: 0
Number of coverage checks: 30
BDD entailment checks: 0
Number of SMT sat checks: 0
trivial: 0
cached: 0
Max ABE block size: 0
Number of predicates discovered: 0
Time for post operator: 0.010s
Time for path formula creation: 0.009s
Time for strengthen operator: 0.000s
Time for prec operator: 0.000s
Time for merge operator: 0.001s
Time for coverage check: 0.000s
Total time for SMT solver (w/o itp): 0.000s
Number of BDD nodes: 202
Size of BDD node table: 10007
Size of BDD node cleanup queue: 0 (count: 1, min: 0, max: 0, avg: 0.00)
Time for BDD node cleanup: 0.000s
Time for BDD garbage collection: 0.000s (in 0 runs)
PrecisionBootstrap statistics
-----------------------------
Init. function predicates: 0
Init. global predicates: 0
Init. location predicates: 0
Loopstack CPA statistics
------------------------
Bound k:2
Maximum loop iteration reached:3
ValueAnalysisCPA statistics
---------------------------
Number of variables: 53 (count: 35, min: 0, max: 3, avg: 1.51)
Number of global variables: 0 (count: 35, min: 0, max: 0, avg: 0.00)
AutomatonAnalysis (SVCOMP) statistics
-------------------------------------
Number of states: 1
Total time for successor computation: 0.002s
Automaton transfers with branching: 0
Automaton transfer successors: 97 (count: 100, min: 0, max: 1, avg: 0.97) [0 x 3, 1 x 97]
CPA algorithm statistics
------------------------
Number of iterations: 66
Max size of waitlist: 4
Average size of waitlist: 2
Number of computed successors: 70
Max successors for one state: 2
Number of times merged: 15
Number of times stopped: 15
Number of times breaked: 0
Total time for CPA algorithm: 0.038s (Max: 0.017s)
Time for choose from waitlist: 0.000s
Time for precision adjustment: 0.003s
Time for transfer relation: 0.025s
Time for merge operator: 0.004s
Time for stop operator: 0.002s
Time for adding to reached set: 0.003s
BMC algorithm statistics
------------------------
Time for final sat check: 0.001s
Time for error path creation: 0.002s
Time for bounding assertions check: 0.001s
Number of cut points for induction: 0
Time for induction formula creation: 0.011s
Time for invariant generation: 0.051s
Time for induction check: 0.000s
Counterexample-Check Algorithm statistics
-----------------------------------------
Number of counterexample checks: 1
Number of infeasible paths: 1 (100%)
Time for counterexample checks: 0.041s
RestartAlgorithm switches to the next configuration... (RestartAlgorithm.run, INFO)
Using predicate analysis with MathSAT5 version 5.2.12 (6de13e7f4050) (Jun 5 2014 09:12:40, gmp 5.0.5, gcc 4.6.3, 64-bit) and JFactory 1.21. (Analysis4:PredicateCPA:PredicateCPA., INFO)
Using refinement for predicate analysis with PredicateAbstractionRefinementStrategy strategy. (Analysis4:PredicateCPA:PredicateCPARefiner., INFO)
Error path found, starting counterexample check with CPACHECKER. (Analysis4:CounterexampleCheckAlgorithm.checkCounterexample, INFO)
Using the following resource limits: CPU-time limit of 900s (Analysis4:CounterexampleCheck:ResourceLimitChecker.fromConfiguration, INFO)
Using predicate analysis with MathSAT5 version 5.2.12 (6de13e7f4050) (Jun 5 2014 09:12:40, gmp 5.0.5, gcc 4.6.3, 64-bit) and JFactory 1.21. (Analysis4:CounterexampleCheck:PredicateCPA:PredicateCPA., INFO)
Error path found, but identified as infeasible by counterexample check with CPACHECKER. (Analysis4:CounterexampleCheckAlgorithm.checkCounterexample, INFO)
Warning: Analysis not completed (Refinement failed: External tool verified counterexample as infeasible) (CounterexampleCheckAlgorithm.checkCounterexample, WARNING)
Statistics for algorithm 4 of 6
===============================
Total time for algorithm 4: 0.113s
PredicateCPA statistics
-----------------------
Number of abstractions: 4 (5% of all post computations)
Times abstraction was reused: 0
Because of function entry/exit: 0 (0%)
Because of loop head: 4 (100%)
Because of join nodes: 0 (0%)
Because of threshold: 0 (0%)
Times precision was empty: 2 (50%)
Times precision was {false}: 0 (0%)
Times result was cached: 0 (0%)
Times cartesian abs was used: 0 (0%)
Times boolean abs was used: 2 (50%)
Times result was 'false': 0 (0%)
Number of strengthen sat checks: 4
Times result was 'false': 1 (25%)
Number of coverage checks: 19
BDD entailment checks: 1
Number of SMT sat checks: 4
trivial: 0
cached: 1
Max ABE block size: 4
Number of predicates discovered: 4
Number of abstraction locations: 2
Max number of predicates per location: 2
Avg number of predicates per location: 2
Total predicates per abstraction: 4
Max number of predicates per abstraction: 2
Avg number of predicates per abstraction: 2.00
Number of irrelevant predicates: 0 (0%)
Number of preds handled by boolean abs: 4 (100%)
Total number of models for allsat: 4
Max number of models for allsat: 3
Avg number of models for allsat: 2.00
Number of path formula cache hits: 45 (38%)
Time for post operator: 0.005s
Time for path formula creation: 0.005s
Actual computation: 0.008s
Time for strengthen operator: 0.003s
Time for satisfiability checks: 0.003s
Time for prec operator: 0.005s
Time for abstraction: 0.005s (Max: 0.003s, Count: 4)
Boolean abstraction: 0.003s
Solving time: 0.001s (Max: 0.001s)
Model enumeration time: 0.000s
Time for BDD construction: 0.000s (Max: 0.000s)
Time for merge operator: 0.000s
Time for coverage check: 0.000s
Time for BDD entailment checks: 0.000s
Total time for SMT solver (w/o itp): 0.004s
Number of BDD nodes: 207
Size of BDD node table: 10007
Size of BDD node cleanup queue: 0 (count: 23, min: 0, max: 0, avg: 0.00)
Time for BDD node cleanup: 0.000s
Time for BDD garbage collection: 0.000s (in 0 runs)
PrecisionBootstrap statistics
-----------------------------
Init. function predicates: 0
Init. global predicates: 0
Init. location predicates: 0
AutomatonAnalysis (SVCOMP) statistics
-------------------------------------
Number of states: 1
Total time for successor computation: 0.003s
Automaton transfers with branching: 0
Automaton transfer successors: 110 (count: 110, min: 1, max: 1, avg: 1.00) [1 x 110]
CPA algorithm statistics
------------------------
Number of iterations: 63
Max size of waitlist: 4
Average size of waitlist: 2
Number of computed successors: 79
Max successors for one state: 2
Number of times merged: 9
Number of times stopped: 9
Number of times breaked: 3
Total time for CPA algorithm: 0.025s (Max: 0.015s)
Time for choose from waitlist: 0.000s
Time for precision adjustment: 0.006s
Time for transfer relation: 0.015s
Time for merge operator: 0.000s
Time for stop operator: 0.000s
Time for adding to reached set: 0.001s
Predicate-Abstraction Refiner statistics
----------------------------------------
Avg. length of target path (in blocks): 7 (count: 3, min: 2, max: 3, avg: 2.33)
Time for refinement: 0.022s
Counterexample analysis: 0.010s (Max: 0.007s, Calls: 3)
Refinement sat check: 0.003s
Interpolant computation: 0.000s
Error path post-processing: 0.009s
Path-formulas extraction: 0.000s
Building the counterexample trace: 0.010s
Extracting precise counterexample: 0.009s
Predicate creation: 0.001s
Precision update: 0.000s
ARG update: 0.000s
Length of refined path (in blocks): 2 (count: 1, min: 2, max: 2, avg: 2.00)
Number of affected states: 1 (count: 1, min: 1, max: 1, avg: 1.00)
Length (states) of path with itp 'true': 0 (count: 1, min: 0, max: 0, avg: 0.00)
Length (states) of path with itp non-trivial itp: 1 (count: 1, min: 1, max: 1, avg: 1.00)
Length (states) of path with itp 'false': 0 (count: 1, min: 0, max: 0, avg: 0.00)
Different non-trivial interpolants along paths: 0 (count: 1, min: 0, max: 0, avg: 0.00)
Equal non-trivial interpolants along paths: 0 (count: 1, min: 0, max: 0, avg: 0.00)
Different precisions along paths: 0 (count: 0, min: 0, max: 0, avg: 0.00)
Equal precisions along paths: 0 (count: 0, min: 0, max: 0, avg: 0.00)
Number of refs with location-based cutoff: 0
CEGAR algorithm statistics
--------------------------
Number of refinements: 3
Number of successful refinements: 2
Number of failed refinements: 0
Max. size of reached set before ref.: 38
Max. size of reached set after ref.: 6
Avg. size of reached set before ref.: 26.00
Avg. size of reached set after ref.: 3.50
Total time for CEGAR algorithm: 0.048s
Time for refinements: 0.023s
Average time for refinement: 0.007s
Max time for refinement: 0.017s
Counterexample-Check Algorithm statistics
-----------------------------------------
Number of counterexample checks: 1
Number of infeasible paths: 1 (100%)
Time for counterexample checks: 0.036s
RestartAlgorithm switches to the next configuration... (RestartAlgorithm.run, INFO)
Using the following resource limits: CPU-time limit of 900s (Analysis5:ResourceLimitChecker.fromConfiguration, INFO)
Using predicate analysis with MathSAT5 version 5.2.12 (6de13e7f4050) (Jun 5 2014 09:12:40, gmp 5.0.5, gcc 4.6.3, 64-bit) and JFactory 1.21. (Analysis5:PredicateCPA:PredicateCPA., INFO)
Using refinement for predicate analysis with PredicateAbstractionRefinementStrategy strategy. (Analysis5:PredicateCPA:PredicateCPARefiner., INFO)
Shutdown requested (The CPU-time limit of 900s has elapsed.), waiting for termination. (ForceTerminationOnShutdown$1.shutdownRequested, WARNING)
Warning: Analysis stopped (The CPU-time limit of 900s has elapsed.) (ShutdownNotifier.shutdownIfNecessary, WARNING)
Restart Algorithm statistics
----------------------------
Number of algorithms provided: 6
Number of algorithms used: 5
Total time for algorithm 5: 883.310s
PredicateCPA statistics
-----------------------
Number of abstractions: 3829 (5% of all post computations)
Times abstraction was reused: 0
Because of function entry/exit: 0 (0%)
Because of loop head: 3829 (100%)
Because of join nodes: 0 (0%)
Because of threshold: 0 (0%)
Times precision was empty: 2 (0%)
Times precision was {false}: 0 (0%)
Times result was cached: 0 (0%)
Times cartesian abs was used: 0 (0%)
Times boolean abs was used: 3827 (100%)
Times result was 'false': 0 (0%)
Number of strengthen sat checks: 3829
Times result was 'false': 3741 (98%)
Number of coverage checks: 132534
BDD entailment checks: 109736
Number of SMT sat checks: 3829
trivial: 0
cached: 1
Max ABE block size: 4
Number of predicates discovered: 285
Number of abstraction locations: 2
Max number of predicates per location: 283
Avg number of predicates per location: 142
Total predicates per abstraction: 718518
Max number of predicates per abstraction: 283
Avg number of predicates per abstraction: 187.75
Number of irrelevant predicates: 0 (0%)
Number of preds handled by boolean abs: 718518 (100%)
Total number of models for allsat: 57197
Max number of models for allsat: 60
Avg number of models for allsat: 14.95
Number of path formula cache hits: 96689 (98%)
Time for post operator: 0.297s
Time for path formula creation: 0.249s
Actual computation: 0.174s
Time for strengthen operator: 26.970s
Time for satisfiability checks: 26.903s
Time for prec operator: 220.475s
Time for abstraction: 220.411s (Max: 0.351s, Count: 3829)
Boolean abstraction: 193.518s
Solving time: 37.991s (Max: 0.032s)
Model enumeration time: 11.792s
Time for BDD construction: 133.548s (Max: 0.275s)
Time for merge operator: 0.031s
Time for coverage check: 1.290s
Time for BDD entailment checks: 1.281s
Total time for SMT solver (w/o itp): 76.668s
Number of BDD nodes: 705079
Size of BDD node table: 829883
Size of BDD node cleanup queue: 3042784 (count: 1369184, min: 0, max: 33133, avg: 2.22)
Time for BDD node cleanup: 0.535s
Time for BDD garbage collection: 56.465s (in 6341 runs)
PrecisionBootstrap statistics
-----------------------------
Init. function predicates: 0
Init. global predicates: 0
Init. location predicates: 0
AutomatonAnalysis (SVCOMP) statistics
-------------------------------------
Number of states: 1
Total time for successor computation: 0.314s
Automaton transfers with branching: 0
Automaton transfer successors: 106360 (count: 106360, min: 1, max: 1, avg: 1.00) [1 x 106360]
CPA algorithm statistics
------------------------
Number of iterations: 68403
Max size of waitlist: 4
Average size of waitlist: 2
Number of computed successors: 79979
Max successors for one state: 2
Number of times merged: 11399
Number of times stopped: 11399
Number of times breaked: 88
Total time for CPA algorithm: 250.597s (Max: 15.038s)
Time for choose from waitlist: 0.041s
Time for precision adjustment: 220.586s
Time for transfer relation: 28.076s
Time for merge operator: 0.226s
Time for stop operator: 1.425s
Time for adding to reached set: 0.121s
Predicate-Abstraction Refiner statistics
----------------------------------------
Avg. length of target path (in blocks): 3917 (count: 88, min: 2, max: 88, avg: 44.51)
Time for refinement: 633.646s
Counterexample analysis: 632.479s (Max: 64.692s, Calls: 88)
Refinement sat check: 26.064s
Interpolant computation: 604.906s
Error path post-processing: 0.000s
Path-formulas extraction: 0.003s
Building the counterexample trace: 633.453s
Extracting precise counterexample: 0.000s
Predicate creation: 0.057s
Precision update: 0.031s
ARG update: 0.085s
Length of refined path (in blocks): 3827 (count: 86, min: 2, max: 87, avg: 44.50)
Number of affected states: 3741 (count: 86, min: 1, max: 86, avg: 43.50)
Length (states) of path with itp 'true': 0 (count: 86, min: 0, max: 0, avg: 0.00)
Length (states) of path with itp non-trivial itp: 3741 (count: 86, min: 1, max: 86, avg: 43.50)
Length (states) of path with itp 'false': 0 (count: 86, min: 0, max: 0, avg: 0.00)
Different non-trivial interpolants along paths: 3655 (count: 86, min: 0, max: 85, avg: 42.50)
Equal non-trivial interpolants along paths: 0 (count: 86, min: 0, max: 0, avg: 0.00)
Different precisions along paths: 0 (count: 0, min: 0, max: 0, avg: 0.00)
Equal precisions along paths: 0 (count: 0, min: 0, max: 0, avg: 0.00)
Number of refs with location-based cutoff: 0
CEGAR algorithm statistics
--------------------------
Number of refinements: 88
Number of successful refinements: 87
Number of failed refinements: 0
Max. size of reached set before ref.: 1568
Max. size of reached set after ref.: 6
Avg. size of reached set before ref.: 785.20
Avg. size of reached set after ref.: 5.94
Total time for CEGAR algorithm: 883.286s
Time for refinements: 632.688s
Average time for refinement: 7.189s
Max time for refinement: 64.695s
Counterexample-Check Algorithm statistics
-----------------------------------------
Number of counterexample checks: 0
CPAchecker general statistics
-----------------------------
Number of program locations: 25
Number of functions: 2
Number of loops: 1
Size of reached set: 1568
Number of reached locations: 25 (100%)
Avg states per location: 62
Max states per location: 87 (at node N1)
Number of reached functions: 2 (100%)
Number of partitions: 1482
Avg size of partitions: 1
Max size of partitions: 87 (with key [N17 (before lines 74-84), Function main called from node N9, stack depth 1 [bb64549], stack [main], Init])
Number of target states: 1
Size of final wait list 3
Time for analysis setup: 0.401s
Time for loading CPAs: 0.004s
Time for loading parser: 0.187s
Time for CFA construction: 0.191s
Time for parsing file(s): 0.102s
Time for AST to CFA: 0.055s
Time for CFA sanity check: 0.000s
Time for post-processing: 0.022s
Time for Analysis: 884.189s
CPU time for analysis: 899.950s
Total time for CPAchecker: 884.590s
Total CPU time for CPAchecker: 900.790s
Verification result: UNKNOWN, incomplete analysis.
More details about the verification run can be found in the directory "./output".