scripts/cpa.sh -sv-comp15 -disable-java-assertions -heap 10000m -timelimit 900s -stats -spec ../benchmarks/c/loop-invgen/ALL.prp ../benchmarks/c/loop-invgen/id_build_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_779829717_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: 59 (count: 14, min: 0, max: 6, avg: 4.21)
Number of global variables: 0 (count: 14, min: 0, max: 0, avg: 0.00)
AutomatonAnalysis (SVCOMP) statistics
-------------------------------------
Number of states: 1
Total time for successor computation: 0.000s
Automaton transfers with branching: 0
Automaton transfer successors: 28 (count: 28, min: 1, max: 1, avg: 1.00) [1 x 28]
CPA algorithm statistics
------------------------
Number of iterations: 12
Max size of waitlist: 2
Average size of waitlist: 1
Number of computed successors: 13
Max successors for one state: 2
Number of times merged: 0
Number of times stopped: 0
Number of times breaked: 1
Total time for CPA algorithm: 0.014s (Max: 0.014s)
Time for choose from waitlist: 0.000s
Time for precision adjustment: 0.001s
Time for transfer relation: 0.012s
Time for stop operator: 0.000s
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.114s
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.102s
ValueAnalysisCPA statistics
---------------------------
Number of variables: 0 (count: 15, min: 0, max: 0, avg: 0.00)
Number of global variables: 0 (count: 15, 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.000s
Total time for composite: 0.000s
Total time for abstraction computation: 0.000s
Total time for path threshold: 0.000s
Number of abstraction computations: 15
CPA algorithm statistics
------------------------
Number of iterations: 13
Max size of waitlist: 2
Average size of waitlist: 1
Number of computed successors: 15
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.004s (Max: 0.004s)
Time for choose from waitlist: 0.000s
Time for precision adjustment: 0.000s
Time for transfer relation: 0.003s
Time for stop operator: 0.001s
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.: 15
Max. size of reached set after ref.: 0
Avg. size of reached set before ref.: 15.00
Avg. size of reached set after ref.: NaN
Total time for CEGAR algorithm: 0.016s
Time for refinements: 0.012s
Average time for refinement: 0.012s
Max time for refinement: 0.012s
Counterexample-Check Algorithm statistics
-----------------------------------------
Number of counterexample checks: 1
Number of infeasible paths: 1 (100%)
Time for counterexample checks: 0.049s
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)
Could not use induction for proving program safety, program has too many loops (Analysis3:BMCAlgorithm$KInductionProver., WARNING)
Starting satisfiability check... (Analysis3:BMCAlgorithm.checkTargetStates, INFO)
Error found, creating error path (Analysis3:BMCAlgorithm.addCounterexampleTo, INFO)
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.181s
PredicateCPA statistics
-----------------------
Number of abstractions: 0 (0% of all post computations)
Number of strengthen sat checks: 0
Number of coverage checks: 0
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.008s
Time for path formula creation: 0.008s
Time for strengthen operator: 0.000s
Time for prec operator: 0.000s
Time for merge operator: 0.000s
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:1
Maximum loop iteration reached:2
ValueAnalysisCPA statistics
---------------------------
Number of variables: 119 (count: 25, min: 0, max: 6, avg: 4.76)
Number of global variables: 0 (count: 25, 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: 41 (count: 43, min: 0, max: 1, avg: 0.95) [0 x 2, 1 x 41]
CPA algorithm statistics
------------------------
Number of iterations: 25
Max size of waitlist: 2
Average size of waitlist: 1
Number of computed successors: 24
Max successors for one state: 2
Number of times merged: 0
Number of times stopped: 0
Number of times breaked: 0
Total time for CPA algorithm: 0.015s (Max: 0.015s)
Time for choose from waitlist: 0.000s
Time for precision adjustment: 0.001s
Time for transfer relation: 0.013s
Time for stop operator: 0.001s
Time for adding to reached set: 0.000s
BMC algorithm statistics
------------------------
Time for final sat check: 0.001s
Time for error path creation: 0.013s
Counterexample-Check Algorithm statistics
-----------------------------------------
Number of counterexample checks: 1
Number of infeasible paths: 1 (100%)
Time for counterexample checks: 0.030s
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.066s
PredicateCPA statistics
-----------------------
Number of abstractions: 3 (20% of all post computations)
Times abstraction was reused: 0
Because of function entry/exit: 0 (0%)
Because of loop head: 3 (100%)
Because of join nodes: 0 (0%)
Because of threshold: 0 (0%)
Times precision was empty: 3 (100%)
Times precision was {false}: 0 (0%)
Times result was cached: 0 (0%)
Times cartesian abs was used: 0 (0%)
Times boolean abs was used: 0 (0%)
Times result was 'false': 0 (0%)
Number of strengthen sat checks: 1
Times result was 'false': 0 (0%)
Number of coverage checks: 1
BDD entailment checks: 1
Number of SMT sat checks: 1
trivial: 0
cached: 0
Max ABE block size: 2
Number of predicates discovered: 0
Number of path formula cache hits: 1 (3%)
Time for post operator: 0.002s
Time for path formula creation: 0.002s
Actual computation: 0.004s
Time for strengthen operator: 0.001s
Time for satisfiability checks: 0.001s
Time for prec operator: 0.001s
Time for abstraction: 0.001s (Max: 0.001s, Count: 3)
Solving time: 0.000s (Max: 0.000s)
Model enumeration time: 0.000s
Time for BDD construction: 0.000s (Max: 0.000s)
Time for merge operator: 0.000s
Time for coverage check: 0.001s
Time for BDD entailment checks: 0.001s
Total time for SMT solver (w/o itp): 0.001s
Number of BDD nodes: 202
Size of BDD node table: 10007
Size of BDD node cleanup queue: 0 (count: 6, 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.000s
Automaton transfers with branching: 0
Automaton transfer successors: 32 (count: 32, min: 1, max: 1, avg: 1.00) [1 x 32]
CPA algorithm statistics
------------------------
Number of iterations: 13
Max size of waitlist: 2
Average size of waitlist: 1
Number of computed successors: 15
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.007s (Max: 0.007s)
Time for choose from waitlist: 0.000s
Time for precision adjustment: 0.001s
Time for transfer relation: 0.005s
Time for merge operator: 0.000s
Time for stop operator: 0.001s
Time for adding to reached set: 0.000s
Predicate-Abstraction Refiner statistics
----------------------------------------
Avg. length of target path (in blocks): 3 (count: 1, min: 3, max: 3, avg: 3.00)
Time for refinement: 0.006s
Counterexample analysis: 0.003s (Max: 0.003s, Calls: 1)
Refinement sat check: 0.001s
Interpolant computation: 0.000s
Error path post-processing: 0.000s
Path-formulas extraction: 0.000s
Building the counterexample trace: 0.003s
Extracting precise counterexample: 0.003s
Predicate creation: 0.000s
Precision update: 0.000s
ARG update: 0.000s
Length of refined path (in blocks): 0 (count: 0, min: 0, max: 0, avg: 0.00)
Number of affected states: 0 (count: 0, min: 0, max: 0, avg: 0.00)
Length (states) of path with itp 'true': 0 (count: 0, min: 0, max: 0, avg: 0.00)
Length (states) of path with itp non-trivial itp: 0 (count: 0, min: 0, max: 0, avg: 0.00)
Length (states) of path with itp 'false': 0 (count: 0, min: 0, max: 0, avg: 0.00)
Different non-trivial interpolants along paths: 0 (count: 0, min: 0, max: 0, avg: 0.00)
Equal non-trivial interpolants along paths: 0 (count: 0, 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: 1
Number of successful refinements: 0
Number of failed refinements: 0
Max. size of reached set before ref.: 15
Max. size of reached set after ref.: 0
Avg. size of reached set before ref.: 15.00
Avg. size of reached set after ref.: NaN
Total time for CEGAR algorithm: 0.013s
Time for refinements: 0.006s
Average time for refinement: 0.006s
Max time for refinement: 0.006s
Counterexample-Check Algorithm statistics
-----------------------------------------
Number of counterexample checks: 1
Number of infeasible paths: 1 (100%)
Time for counterexample checks: 0.026s
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: 882.079s
PredicateCPA statistics
-----------------------
Number of abstractions: 27395 (10% of all post computations)
Times abstraction was reused: 0
Because of function entry/exit: 0 (0%)
Because of loop head: 27395 (100%)
Because of join nodes: 0 (0%)
Because of threshold: 0 (0%)
Times precision was empty: 6 (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: 27389 (100%)
Times result was 'false': 6451 (24%)
Number of strengthen sat checks: 26534
Times result was 'false': 26485 (100%)
Number of coverage checks: 3176540
BDD entailment checks: 3176540
Number of SMT sat checks: 26534
trivial: 0
cached: 1
Max ABE block size: 6
Number of predicates discovered: 122
Number of abstraction locations: 3
Max number of predicates per location: 120
Avg number of predicates per location: 77
Total predicates per abstraction: 2101996
Max number of predicates per abstraction: 120
Avg number of predicates per abstraction: 76.75
Number of irrelevant predicates: 14689 (1%)
Number of preds handled by boolean abs: 2087307 (99%)
Total number of models for allsat: 738864
Max number of models for allsat: 354
Avg number of models for allsat: 26.98
Number of path formula cache hits: 281404 (95%)
Time for post operator: 1.242s
Time for path formula creation: 1.109s
Actual computation: 0.886s
Time for strengthen operator: 231.321s
Time for satisfiability checks: 231.117s
Time for prec operator: 613.433s
Time for abstraction: 613.134s (Max: 0.298s, Count: 27395)
Boolean abstraction: 528.799s
Solving time: 181.534s (Max: 0.021s)
Model enumeration time: 206.901s
Time for BDD construction: 114.622s (Max: 0.117s)
Time for merge operator: 0.000s
Time for coverage check: 2.802s
Time for BDD entailment checks: 2.588s
Total time for SMT solver (w/o itp): 619.400s
Number of BDD nodes: 226021
Size of BDD node table: 230003
Size of BDD node cleanup queue: 712107 (count: 3561882, min: 0, max: 7427, avg: 0.20)
Time for BDD node cleanup: 0.186s
Time for BDD garbage collection: 37.919s (in 19504 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.873s
Time for transition matches: 0.139s
Time for transition assertions: 0.016s
Time for transition actions: 0.030s
Automaton transfers with branching: 0
Automaton transfer successors: 324001 (count: 324001, min: 1, max: 1, avg: 1.00) [1 x 324001]
CPA algorithm statistics
------------------------
Number of iterations: 228945
Max size of waitlist: 4
Average size of waitlist: 2
Number of computed successors: 242264
Max successors for one state: 2
Number of times merged: 0
Number of times stopped: 13182
Number of times breaked: 49
Total time for CPA algorithm: 854.055s (Max: 77.128s)
Time for choose from waitlist: 0.105s
Time for precision adjustment: 613.690s
Time for transfer relation: 234.925s
Time for merge operator: 0.722s
Time for stop operator: 3.802s
Time for adding to reached set: 0.320s
Predicate-Abstraction Refiner statistics
----------------------------------------
Avg. length of target path (in blocks): 7991 (count: 49, min: 3, max: 393, avg: 163.08)
Time for refinement: 27.953s
Counterexample analysis: 27.593s (Max: 2.309s, Calls: 49)
Refinement sat check: 3.288s
Interpolant computation: 23.543s
Error path post-processing: 0.000s
Path-formulas extraction: 0.000s
Building the counterexample trace: 27.593s
Extracting precise counterexample: 0.000s
Predicate creation: 0.055s
Precision update: 0.040s
ARG update: 0.227s
Length of refined path (in blocks): 7972 (count: 48, min: 3, max: 393, avg: 166.08)
Number of affected states: 7916 (count: 48, min: 1, max: 392, avg: 164.92)
Length (states) of path with itp 'true': 8 (count: 48, min: 0, max: 1, avg: 0.17)
Length (states) of path with itp non-trivial itp: 7916 (count: 48, min: 1, max: 392, avg: 164.92)
Length (states) of path with itp 'false': 8 (count: 48, min: 0, max: 1, avg: 0.17)
Different non-trivial interpolants along paths: 1099 (count: 48, min: 0, max: 50, avg: 22.90)
Equal non-trivial interpolants along paths: 6769 (count: 48, min: 0, max: 341, avg: 141.02)
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: 49
Number of successful refinements: 49
Number of failed refinements: 0
Max. size of reached set before ref.: 11300
Max. size of reached set after ref.: 6
Avg. size of reached set before ref.: 4578.35
Avg. size of reached set after ref.: 2.63
Total time for CEGAR algorithm: 882.057s
Time for refinements: 28.002s
Average time for refinement: 0.571s
Max time for refinement: 2.325s
Counterexample-Check Algorithm statistics
-----------------------------------------
Number of counterexample checks: 0
CPAchecker general statistics
-----------------------------
Number of program locations: 18
Number of functions: 2
Number of loops: 2
Size of reached set: 4872
Number of reached locations: 17 (94%)
Avg states per location: 286
Max states per location: 564 (at node N0)
Number of reached functions: 2 (100%)
Number of partitions: 4573
Avg size of partitions: 1
Max size of partitions: 283 (with key [N22 (before lines 76-84), Function main called from node N9, stack depth 1 [2d581156], stack [main], Init])
Number of target states: 0
Size of final wait list 2
Time for analysis setup: 0.399s
Time for loading CPAs: 0.003s
Time for loading parser: 0.193s
Time for CFA construction: 0.182s
Time for parsing file(s): 0.096s
Time for AST to CFA: 0.052s
Time for CFA sanity check: 0.000s
Time for post-processing: 0.022s
Time for Analysis: 882.880s
CPU time for analysis: 899.320s
Total time for CPAchecker: 883.280s
Total CPU time for CPAchecker: 900.180s
Verification result: UNKNOWN, incomplete analysis.
More details about the verification run can be found in the directory "./output".