scripts/cpa.sh -heap 50000M -noout -disable-java-assertions -predicateAnalysis-PredAbsRefiner-ABEl -timelimit 900s -stats -spec test/programs/benchmarks/ssh-simplified/ALL.prp test/programs/benchmarks/ssh-simplified/s3_srvr_13_false-unreach-call.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 and confirmed by counterexample check with CPACHECKER. (CounterexampleCheckAlgorithm.checkCounterexample, INFO) Stopping analysis ... (CPAchecker.runAlgorithm, INFO) PredicateCPA statistics ----------------------- Number of abstractions: 17 (0% of all post computations) Times abstraction was reused: 0 Because of function entry/exit: 0 (0%) Because of loop head: 17 (100%) Because of join nodes: 0 (0%) Because of threshold: 0 (0%) Times precision was empty: 2 (12%) Times precision was {false}: 0 (0%) Times result was cached: 0 (0%) Times cartesian abs was used: 0 (0%) Times boolean abs was used: 15 (88%) Times result was 'false': 0 (0%) Number of strengthen sat checks: 8 Times result was 'false': 4 (50%) Number of coverage checks: 2539 BDD entailment checks: 35 Number of SMT sat checks: 8 trivial: 0 cached: 0 Max ABE block size: 58 Number of predicates discovered: 11 Number of abstraction locations: 2 Max number of predicates per location: 10 Avg number of predicates per location: 7 Total predicates per abstraction: 104 Max number of predicates per abstraction: 10 Avg number of predicates per abstraction: 6.93 Number of irrelevant predicates: 3 (3%) Number of preds handled by boolean abs: 101 (97%) Total number of models for allsat: 225 Max number of models for allsat: 42 Avg number of models for allsat: 15.00 Number of path formula cache hits: 3593 (56%) Time for post operator: 0.398s Time for path formula creation: 0.363s Actual computation: 0.344s Time for strengthen operator: 0.349s Time for satisfiability checks: 0.337s Time for prec operator: 1.126s Time for abstraction: 1.121s (Max: 0.285s, Count: 17) Boolean abstraction: 0.780s Solving time: 0.172s (Max: 0.054s) Model enumeration time: 0.569s Time for BDD construction: 0.022s (Max: 0.006s) Time for merge operator: 0.147s Time for coverage check: 0.006s Time for BDD entailment checks: 0.002s Total time for SMT solver (w/o itp): 1.078s Number of BDD nodes: 1194 Size of BDD node table: 10007 Size of BDD node cleanup queue: 0 (count: 243, 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.093s Automaton transfers with branching: 0 Automaton transfer successors: 7870 (count: 7870, min: 1, max: 1, avg: 1,00) [1 x 7870] CPA algorithm statistics ------------------------ Number of iterations: 4062 Max size of waitlist: 79 Average size of waitlist: 34 Number of computed successors: 5403 Max successors for one state: 2 Number of times merged: 1252 Number of times stopped: 1256 Number of times breaked: 4 Total time for CPA algorithm: 2.687s (Max: 0.761s) Time for choose from waitlist: 0.028s Time for precision adjustment: 1.189s Time for transfer relation: 1.041s Time for merge operator: 0.240s Time for stop operator: 0.048s Time for adding to reached set: 0.048s Predicate-Abstraction Refiner statistics ---------------------------------------- Avg. length of target path (in blocks): 12 (count: 4, min: 2, max: 5, avg: 3,00) Time for refinement: 0.711s Counterexample analysis: 0.586s (Max: 0.191s, Calls: 4) Refinement sat check: 0.262s Interpolant computation: 0.213s Error path post-processing: 0.078s Path-formulas extraction: 0.000s Building the counterexample trace: 0.586s Extracting precise counterexample: 0.078s Predicate creation: 0.002s Precision update: 0.001s ARG update: 0.022s Length of refined path (in blocks): 5 (count: 2, min: 2, max: 3, avg: 2,50) Number of affected states: 3 (count: 2, min: 1, max: 2, avg: 1,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: 3 (count: 2, min: 1, max: 2, avg: 1,50) Length (states) of path with itp 'false': 0 (count: 2, min: 0, max: 0, avg: 0,00) Different non-trivial interpolants along paths: 1 (count: 2, min: 0, max: 1, avg: 0,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.: 1919 Max. size of reached set after ref.: 64 Avg. size of reached set before ref.: 1069.25 Avg. size of reached set after ref.: 43.00 Total time for CEGAR algorithm: 3.411s Time for refinements: 0.724s Average time for refinement: 0.181s Max time for refinement: 0.245s Counterexample-Check Algorithm statistics ----------------------------------------- Number of counterexample checks: 1 Number of infeasible paths: 0 (0%) Time for counterexample checks: 0.426s CPAchecker general statistics ----------------------------- Number of program locations: 380 Number of functions: 2 Number of loops: 1 Size of reached set: 1919 Number of reached locations: 374 (98%) Avg states per location: 5 Max states per location: 6 (at node N111) Number of reached functions: 2 (100%) Number of partitions: 1914 Avg size of partitions: 1 Max size of partitions: 6 (with key [N111 (before lines 117-864), Function ssl3_accept called from node N674, stack depth 2 [52878389], stack [main, ssl3_accept], Init]) Number of target states: 1 Size of final wait list 40 Time for analysis setup: 1.906s Time for loading CPAs: 0.704s Time for loading parser: 0.337s Time for CFA construction: 0.736s Time for parsing file(s): 0.232s Time for AST to CFA: 0.297s Time for CFA sanity check: 0.000s Time for post-processing: 0.151s Time for var class.: 0.000s Time for Analysis: 3.837s CPU time for analysis: 9.710s Total time for CPAchecker: 5.747s Total CPU time for CPAchecker: 12.320s Time for Garbage Collector: 0.022s (in 1 runs) Garbage Collector(s) used: PS MarkSweep, PS Scavenge Used heap memory: 529MB ( 504 MiB) max; 205MB ( 196 MiB) avg; 555MB ( 529 MiB) peak Used non-heap memory: 25MB ( 23 MiB) max; 19MB ( 18 MiB) avg; 25MB ( 24 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: 25MB ( 24 MiB) max; 24MB ( 23 MiB) avg Total process virtual memory: 57123MB ( 54476 MiB) max; 57059MB ( 54416 MiB) avg Verification result: FALSE. Property violation (__VERIFIER_error(); called in line 877) found by chosen configuration. More details about the verification run can be found in the directory "./output".