scripts/cpa.sh -heap 3000M -noout -disable-java-assertions -predicateAnalysis-PredAbsRefiner-ABEl -timelimit 900s -stats -spec test/programs/benchmarks/bitvector/ALL.prp test/programs/benchmarks/bitvector/interleave_bits_true-unreach-call.i -------------------------------------------------------------------------------- Running CPAchecker with Java heap of size 3000M. Using the following resource limits: CPU-time limit of 900s (ResourceLimitChecker.fromConfiguration, INFO) CPAchecker 1.4-svn (OpenJDK 64-Bit Server VM 1.7.0_65) started (CPAchecker.run, INFO) Using predicate analysis with SMTInterpol 2.1-174-ga199d47-comp and JFactory 1.21. (PredicateCPA:PredicateCPA., INFO) Using refinement for predicate analysis with PredicateAbstractionRefinementStrategy strategy. (PredicateCPA:PredicateCPARefiner., INFO) Starting analysis ... (CPAchecker.runAlgorithm, INFO) Error path found, starting counterexample check with CPACHECKER. (CounterexampleCheckAlgorithm.checkCounterexample, INFO) Using the following resource limits: CPU-time limit of 900s (CounterexampleCheck:ResourceLimitChecker.fromConfiguration, INFO) Error path found, but identified as infeasible by counterexample check with CPACHECKER. (CounterexampleCheckAlgorithm.checkCounterexample, INFO) Infeasible counterexample found, but could not remove it from the ARG. Therefore, we cannot prove safety. (CounterexampleCheckAlgorithm.checkCounterexample, WARNING) Stopping analysis ... (CPAchecker.runAlgorithm, INFO) Analysis incomplete: no errors found, but not everything could be checked. (CPAchecker.analyzeResult, WARNING) PredicateCPA statistics ----------------------- Number of abstractions: 563 (8% of all post computations) Times abstraction was reused: 0 Because of function entry/exit: 0 (0%) Because of loop head: 563 (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: 561 (100%) Times result was 'false': 0 (0%) Number of strengthen sat checks: 562 Times result was 'false': 528 (94%) Number of coverage checks: 6017 BDD entailment checks: 6017 Number of SMT sat checks: 562 trivial: 0 cached: 1 Max ABE block size: 5 Number of predicates discovered: 34 Number of abstraction locations: 2 Max number of predicates per location: 32 Avg number of predicates per location: 17 Total predicates per abstraction: 12000 Max number of predicates per abstraction: 32 Avg number of predicates per abstraction: 21.39 Number of irrelevant predicates: 0 (0%) Number of preds handled by boolean abs: 12000 (100%) Total number of models for allsat: 6759 Max number of models for allsat: 33 Avg number of models for allsat: 12.05 Number of path formula cache hits: 7317 (92%) Time for post operator: 0.448s Time for path formula creation: 0.407s Actual computation: 0.356s Time for strengthen operator: 1.815s Time for satisfiability checks: 1.771s Time for prec operator: 6.705s Time for abstraction: 6.694s (Max: 0.090s, Count: 563) Boolean abstraction: 4.649s Solving time: 0.299s (Max: 0.018s) Model enumeration time: 2.766s Time for BDD construction: 0.585s (Max: 0.020s) Time for merge operator: 0.000s Time for coverage check: 0.119s Time for BDD entailment checks: 0.111s Total time for SMT solver (w/o itp): 4.817s Number of BDD nodes: 9128 Size of BDD node table: 10007 Size of BDD node cleanup queue: 22069 (count: 19772, min: 0, max: 8701, avg: 1,12) Time for BDD node cleanup: 0.033s Time for BDD garbage collection: 0.056s (in 70 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.301s Automaton transfers with branching: 0 Automaton transfer successors: 15209 (count: 15209, min: 1, max: 1, avg: 1,00) [1 x 15209] CPA algorithm statistics ------------------------ Number of iterations: 6623 Max size of waitlist: 3 Average size of waitlist: 1 Number of computed successors: 6690 Max successors for one state: 2 Number of times merged: 0 Number of times stopped: 1 Number of times breaked: 34 Total time for CPA algorithm: 11.096s (Max: 0.508s) Time for choose from waitlist: 0.098s Time for precision adjustment: 6.919s Time for transfer relation: 3.282s Time for merge operator: 0.089s Time for stop operator: 0.304s Time for adding to reached set: 0.173s Predicate-Abstraction Refiner statistics ---------------------------------------- Avg. length of target path (in blocks): 596 (count: 34, min: 2, max: 34, avg: 17,53) Time for refinement: 1.474s Counterexample analysis: 1.152s (Max: 0.075s, Calls: 34) Refinement sat check: 0.432s Interpolant computation: 0.530s Error path post-processing: 0.000s Path-formulas extraction: 0.002s Building the counterexample trace: 1.159s Extracting precise counterexample: 0.101s Predicate creation: 0.047s Precision update: 0.010s ARG update: 0.139s Length of refined path (in blocks): 560 (count: 32, min: 2, max: 33, avg: 17,50) Number of affected states: 528 (count: 32, min: 1, max: 32, avg: 16,50) Length (states) of path with itp 'true': 0 (count: 32, min: 0, max: 0, avg: 0,00) Length (states) of path with itp non-trivial itp: 528 (count: 32, min: 1, max: 32, avg: 16,50) Length (states) of path with itp 'false': 0 (count: 32, min: 0, max: 0, avg: 0,00) Different non-trivial interpolants along paths: 496 (count: 32, min: 0, max: 31, avg: 15,50) Equal non-trivial interpolants along paths: 0 (count: 32, 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: 34 Number of successful refinements: 33 Number of failed refinements: 0 Max. size of reached set before ref.: 400 Max. size of reached set after ref.: 6 Avg. size of reached set before ref.: 202.35 Avg. size of reached set after ref.: 5.85 Total time for CEGAR algorithm: 12.588s Time for refinements: 1.491s Average time for refinement: 0.043s Max time for refinement: 0.183s Counterexample-Check Algorithm statistics ----------------------------------------- Number of counterexample checks: 1 Number of infeasible paths: 1 (100%) Time for counterexample checks: 0.545s CPAchecker general statistics ----------------------------- Number of program locations: 19 Number of functions: 2 Number of loops: 1 Size of reached set: 401 Number of reached locations: 18 (95%) Avg states per location: 22 Max states per location: 33 (at node N0) Number of reached functions: 2 (100%) Number of partitions: 369 Avg size of partitions: 1 Max size of partitions: 33 (with key [N20 (before line 30), Function main called from node N9, stack depth 1 [25796d08], stack [main], Init]) Number of target states: 0 Time for analysis setup: 1.174s Time for loading CPAs: 0.277s Time for loading parser: 0.450s Time for CFA construction: 0.409s Time for parsing file(s): 0.285s Time for AST to CFA: 0.058s Time for CFA sanity check: 0.000s Time for post-processing: 0.044s Time for var class.: 0.000s Time for Analysis: 13.134s CPU time for analysis: 13.110s Total time for CPAchecker: 14.308s Total CPU time for CPAchecker: 14.280s Time for Garbage Collector: 0.288s (in 4 runs) Garbage Collector(s) used: PS MarkSweep, PS Scavenge Used heap memory: 283MB ( 270 MiB) max; 118MB ( 112 MiB) avg; 290MB ( 277 MiB) peak Used non-heap memory: 26MB ( 25 MiB) max; 22MB ( 21 MiB) avg; 26MB ( 25 MiB) peak Used in PS Old Gen pool: 0MB ( 0 MiB) max; 0MB ( 0 MiB) avg; 0MB ( 0 MiB) peak Allocated heap memory: 902MB ( 860 MiB) max; 620MB ( 592 MiB) avg Allocated non-heap memory: 27MB ( 25 MiB) max; 25MB ( 24 MiB) avg Total process virtual memory: 4967MB ( 4737 MiB) max; 4901MB ( 4674 MiB) avg Verification result: UNKNOWN, incomplete analysis. More details about the verification run can be found in the directory "./output".