scripts/cpa.sh -heap 50000M -noout -disable-java-assertions -predicateAnalysis-PredAbsRefiner-ABEl -timelimit 900s -stats -spec test/programs/benchmarks/bitvector/ALL.prp test/programs/benchmarks/bitvector/s3_clnt_2_true-unreach-call.BV.c.cil.c -------------------------------------------------------------------------------- Running CPAchecker with Java heap of size 50000M. 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: 36 (0% of all post computations) Times abstraction was reused: 0 Because of function entry/exit: 0 (0%) Because of loop head: 36 (100%) Because of join nodes: 0 (0%) Because of threshold: 0 (0%) Times precision was empty: 1 (3%) Times precision was {false}: 0 (0%) Times result was cached: 0 (0%) Times cartesian abs was used: 0 (0%) Times boolean abs was used: 35 (97%) Times result was 'false': 0 (0%) Number of strengthen sat checks: 35 Times result was 'false': 29 (83%) Number of coverage checks: 5181 BDD entailment checks: 131 Number of SMT sat checks: 35 trivial: 0 cached: 0 Max ABE block size: 46 Number of predicates discovered: 60 Number of abstraction locations: 2 Max number of predicates per location: 59 Avg number of predicates per location: 30 Total predicates per abstraction: 1124 Max number of predicates per abstraction: 59 Avg number of predicates per abstraction: 32.11 Number of irrelevant predicates: 11 (1%) Number of preds handled by boolean abs: 1113 (99%) Total number of models for allsat: 4804 Max number of models for allsat: 711 Avg number of models for allsat: 137.26 Number of path formula cache hits: 9290 (68%) Time for post operator: 0.566s Time for path formula creation: 0.490s Actual computation: 0.462s Time for strengthen operator: 0.094s Time for satisfiability checks: 0.070s Time for prec operator: 3.749s Time for abstraction: 3.730s (Max: 0.423s, Count: 36) Boolean abstraction: 3.088s Solving time: 0.227s (Max: 0.040s) Model enumeration time: 2.331s Time for BDD construction: 0.439s (Max: 0.064s) Time for merge operator: 0.116s Time for coverage check: 0.014s Time for BDD entailment checks: 0.009s Total time for SMT solver (w/o itp): 2.628s Number of BDD nodes: 1793 Size of BDD node table: 10007 Size of BDD node cleanup queue: 7141 (count: 3264, min: 0, max: 4342, avg: 2,19) Time for BDD node cleanup: 0.008s Time for BDD garbage collection: 0.031s (in 324 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.124s Automaton transfers with branching: 0 Automaton transfer successors: 17247 (count: 17247, min: 1, max: 1, avg: 1,00) [1 x 17247] CPA algorithm statistics ------------------------ Number of iterations: 8864 Max size of waitlist: 95 Average size of waitlist: 39 Number of computed successors: 11579 Max successors for one state: 2 Number of times merged: 2525 Number of times stopped: 2526 Number of times breaked: 6 Total time for CPA algorithm: 5.503s (Max: 2.188s) Time for choose from waitlist: 0.040s Time for precision adjustment: 3.807s Time for transfer relation: 1.092s Time for merge operator: 0.247s Time for stop operator: 0.084s Time for adding to reached set: 0.091s Predicate-Abstraction Refiner statistics ---------------------------------------- Avg. length of target path (in blocks): 41 (count: 6, min: 2, max: 12, avg: 6,83) Time for refinement: 2.354s Counterexample analysis: 2.172s (Max: 0.583s, Calls: 6) Refinement sat check: 0.700s Interpolant computation: 1.293s Error path post-processing: 0.097s Path-formulas extraction: 0.000s Building the counterexample trace: 2.172s Extracting precise counterexample: 0.097s Predicate creation: 0.008s Precision update: 0.004s ARG update: 0.053s Length of refined path (in blocks): 27 (count: 4, min: 3, max: 9, avg: 6,75) Number of affected states: 23 (count: 4, min: 2, max: 8, avg: 5,75) Length (states) of path with itp 'true': 0 (count: 4, min: 0, max: 0, avg: 0,00) Length (states) of path with itp non-trivial itp: 23 (count: 4, min: 2, max: 8, avg: 5,75) Length (states) of path with itp 'false': 0 (count: 4, min: 0, max: 0, avg: 0,00) Different non-trivial interpolants along paths: 19 (count: 4, min: 1, max: 7, avg: 4,75) Equal non-trivial interpolants along paths: 0 (count: 4, 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: 6 Number of successful refinements: 5 Number of failed refinements: 0 Max. size of reached set before ref.: 2895 Max. size of reached set after ref.: 63 Avg. size of reached set before ref.: 1520.67 Avg. size of reached set after ref.: 50.60 Total time for CEGAR algorithm: 7.873s Time for refinements: 2.369s Average time for refinement: 0.394s Max time for refinement: 0.599s Counterexample-Check Algorithm statistics ----------------------------------------- Number of counterexample checks: 1 Number of infeasible paths: 1 (100%) Time for counterexample checks: 0.347s CPAchecker general statistics ----------------------------- Number of program locations: 338 Number of functions: 2 Number of loops: 1 Size of reached set: 3076 Number of reached locations: 337 (100%) Avg states per location: 9 Max states per location: 11 (at node N0) Number of reached functions: 2 (100%) Number of partitions: 3066 Avg size of partitions: 1 Max size of partitions: 11 (with key [N108 (before line 94), Function ssl3_connect called from node N598, stack depth 2 [28f16811], stack [main, ssl3_connect], Init]) Number of target states: 0 Time for analysis setup: 1.676s Time for loading CPAs: 0.586s Time for loading parser: 0.334s Time for CFA construction: 0.657s Time for parsing file(s): 0.224s Time for AST to CFA: 0.251s Time for CFA sanity check: 0.000s Time for post-processing: 0.129s Time for var class.: 0.000s Time for Analysis: 8.223s CPU time for analysis: 18.300s Total time for CPAchecker: 9.900s Total CPU time for CPAchecker: 20.760s Time for Garbage Collector: 0.066s (in 4 runs) Garbage Collector(s) used: PS MarkSweep, PS Scavenge Used heap memory: 545MB ( 519 MiB) max; 248MB ( 236 MiB) avg; 556MB ( 530 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: 2024MB ( 1930 MiB) max; 2024MB ( 1930 MiB) avg Allocated non-heap memory: 27MB ( 25 MiB) max; 25MB ( 24 MiB) avg Total process virtual memory: 57123MB ( 54476 MiB) max; 57059MB ( 54416 MiB) avg Verification result: UNKNOWN, incomplete analysis. More details about the verification run can be found in the directory "./output".