scripts/cpa.sh -heap 3000M -noout -disable-java-assertions -predicateAnalysis-PredAbsRefiner-ABEl -timelimit 900s -stats -spec test/programs/benchmarks/ssh-simplified/ALL.prp test/programs/benchmarks/ssh-simplified/s3_clnt_2_false-unreach-call_true-termination.cil.c -------------------------------------------------------------------------------- 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 and confirmed by counterexample check with CPACHECKER. (CounterexampleCheckAlgorithm.checkCounterexample, INFO) Stopping analysis ... (CPAchecker.runAlgorithm, INFO) PredicateCPA statistics ----------------------- Number of abstractions: 14 (0% of all post computations) Times abstraction was reused: 0 Because of function entry/exit: 0 (0%) Because of loop head: 14 (100%) Because of join nodes: 0 (0%) Because of threshold: 0 (0%) Times precision was empty: 1 (7%) Times precision was {false}: 0 (0%) Times result was cached: 0 (0%) Times cartesian abs was used: 0 (0%) Times boolean abs was used: 13 (93%) Times result was 'false': 0 (0%) Number of strengthen sat checks: 14 Times result was 'false': 10 (71%) Number of coverage checks: 1862 BDD entailment checks: 26 Number of SMT sat checks: 14 trivial: 0 cached: 0 Max ABE block size: 47 Number of predicates discovered: 17 Number of abstraction locations: 2 Max number of predicates per location: 16 Avg number of predicates per location: 9 Total predicates per abstraction: 133 Max number of predicates per abstraction: 16 Avg number of predicates per abstraction: 10.23 Number of irrelevant predicates: 0 (0%) Number of preds handled by boolean abs: 133 (100%) Total number of models for allsat: 44 Max number of models for allsat: 11 Avg number of models for allsat: 3.38 Number of path formula cache hits: 2794 (56%) Time for post operator: 0.428s Time for path formula creation: 0.407s Actual computation: 0.391s Time for strengthen operator: 0.067s Time for satisfiability checks: 0.046s Time for prec operator: 1.319s Time for abstraction: 1.319s (Max: 0.185s, Count: 14) Boolean abstraction: 0.826s Solving time: 0.377s (Max: 0.093s) Model enumeration time: 0.395s Time for BDD construction: 0.026s (Max: 0.016s) Time for merge operator: 0.311s Time for coverage check: 0.005s Time for BDD entailment checks: 0.004s Total time for SMT solver (w/o itp): 0.818s Number of BDD nodes: 1269 Size of BDD node table: 10007 Size of BDD node cleanup queue: 386 (count: 295, min: 0, max: 313, avg: 1,31) 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.102s Automaton transfers with branching: 0 Automaton transfer successors: 6304 (count: 6304, min: 1, max: 1, avg: 1,00) [1 x 6304] CPA algorithm statistics ------------------------ Number of iterations: 3114 Max size of waitlist: 65 Average size of waitlist: 29 Number of computed successors: 4152 Max successors for one state: 2 Number of times merged: 918 Number of times stopped: 918 Number of times breaked: 4 Total time for CPA algorithm: 2.953s (Max: 1.385s) Time for choose from waitlist: 0.025s Time for precision adjustment: 1.408s Time for transfer relation: 0.847s Time for merge operator: 0.434s Time for stop operator: 0.078s Time for adding to reached set: 0.092s Predicate-Abstraction Refiner statistics ---------------------------------------- Avg. length of target path (in blocks): 18 (count: 4, min: 2, max: 7, avg: 4,50) Time for refinement: 2.265s Counterexample analysis: 2.014s (Max: 1.159s, Calls: 4) Refinement sat check: 0.748s Interpolant computation: 1.000s Error path post-processing: 0.201s Path-formulas extraction: 0.000s Building the counterexample trace: 2.014s Extracting precise counterexample: 0.201s Predicate creation: 0.002s Precision update: 0.002s ARG update: 0.025s Length of refined path (in blocks): 9 (count: 2, min: 3, max: 6, avg: 4,50) Number of affected states: 7 (count: 2, min: 2, max: 5, avg: 3,50) Length (states) of path with itp 'true': 0 (count: 2, min: 0, max: 0, avg: 0,00) Length (states) of path with itp non-trivial itp: 7 (count: 2, min: 2, max: 5, avg: 3,50) Length (states) of path with itp 'false': 0 (count: 2, min: 0, max: 0, avg: 0,00) Different non-trivial interpolants along paths: 5 (count: 2, min: 1, max: 4, avg: 2,50) Equal non-trivial interpolants along paths: 0 (count: 2, 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: 4 Number of successful refinements: 3 Number of failed refinements: 0 Max. size of reached set before ref.: 1455 Max. size of reached set after ref.: 67 Avg. size of reached set before ref.: 842.50 Avg. size of reached set after ref.: 45.00 Total time for CEGAR algorithm: 5.241s Time for refinements: 2.288s Average time for refinement: 0.572s Max time for refinement: 1.191s Counterexample-Check Algorithm statistics ----------------------------------------- Number of counterexample checks: 1 Number of infeasible paths: 0 (0%) Time for counterexample checks: 0.957s CPAchecker general statistics ----------------------------- Number of program locations: 319 Number of functions: 2 Number of loops: 1 Size of reached set: 1455 Number of reached locations: 313 (98%) Avg states per location: 4 Max states per location: 6 (at node N117) Number of reached functions: 2 (100%) Number of partitions: 1450 Avg size of partitions: 1 Max size of partitions: 6 (with key [N117 (before line 118), Function ssl3_connect called from node N582, stack depth 2 [3c207486], stack [main, ssl3_connect], Init]) Number of target states: 1 Size of final wait list 46 Time for analysis setup: 1.361s Time for loading CPAs: 0.320s Time for loading parser: 0.443s Time for CFA construction: 0.562s Time for parsing file(s): 0.325s Time for AST to CFA: 0.107s Time for CFA sanity check: 0.000s Time for post-processing: 0.078s Time for var class.: 0.000s Time for Analysis: 6.198s CPU time for analysis: 6.190s Total time for CPAchecker: 7.560s Total CPU time for CPAchecker: 7.550s Time for Garbage Collector: 0.166s (in 2 runs) Garbage Collector(s) used: PS MarkSweep, PS Scavenge Used heap memory: 149MB ( 142 MiB) max; 76MB ( 72 MiB) avg; 150MB ( 143 MiB) peak Used non-heap memory: 24MB ( 23 MiB) max; 20MB ( 19 MiB) avg; 24MB ( 23 MiB) peak Used in PS Old Gen pool: 0MB ( 0 MiB) max; 0MB ( 0 MiB) avg; 0MB ( 0 MiB) peak Allocated heap memory: 637MB ( 607 MiB) max; 540MB ( 515 MiB) avg Allocated non-heap memory: 25MB ( 24 MiB) max; 24MB ( 23 MiB) avg Total process virtual memory: 4967MB ( 4737 MiB) max; 4906MB ( 4679 MiB) avg Verification result: FALSE. Property violation (__VERIFIER_error(); called in line 757) found by chosen configuration. More details about the verification run can be found in the directory "./output".