scripts/cpa.sh -heap 3000M -noout -disable-java-assertions -predicateAnalysis-PredAbsRefiner-ABEl -setprop cpa.predicate.handlePointerAliasing=false -64 -timelimit 900s -stats -spec test/programs/benchmarks/ldv-linux-3.4-simple/ALL.prp test/programs/benchmarks/ldv-linux-3.4-simple/32_1_cilled_true-unreach-call_ok_nondet_linux-3.4-32_1-drivers--net--arcnet--com20020_cs.ko-ldv_main0_sequence_infinite_withcheck_stateful.cil.out.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) Inline assembler ignored, analysis is probably unsound! (CFABuilder.createCFA, WARNING) Handling of pointer aliasing is disabled, analysis is unsound if aliased pointers exist. (PredicateCPA:PathFormulaManagerImpl., WARNING) 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) The following configuration options were specified but are not used: cpa.predicate.memoryAllocationsAlwaysSucceed cpa.predicate.maxPreFilledAllocationSize (CPAchecker.printConfigurationWarnings, WARNING) Starting analysis ... (CPAchecker.runAlgorithm, INFO) Assuming external function ldv_initialize to be a constant function. (PredicateCPA:ExpressionToFormulaVisitor.visit, INFO) Assuming external function pcmcia_register_driver to be a pure function. (PredicateCPA:ExpressionToFormulaVisitor.visit, INFO) Assuming external function __const_udelay to be a pure function. (PredicateCPA:ExpressionToFormulaVisitor.visit, INFO) Assuming external function netif_device_detach to be a pure function. (PredicateCPA:ExpressionToFormulaVisitor.visit, INFO) Assuming external function __dynamic_dev_dbg to be a pure function. (PredicateCPA:ExpressionToFormulaVisitor.visit, INFO) Assuming external function unregister_netdev to be a pure function. (PredicateCPA:ExpressionToFormulaVisitor.visit, INFO) Assuming external function free_irq to be a pure function. (PredicateCPA:ExpressionToFormulaVisitor.visit, INFO) Assuming external function pcmcia_disable_device to be a pure function. (PredicateCPA:ExpressionToFormulaVisitor.visit, INFO) Assuming external function free_netdev to be a pure function. (PredicateCPA:ExpressionToFormulaVisitor.visit, INFO) Assuming external function alloc_arcdev to be a pure function. (PredicateCPA:ExpressionToFormulaVisitor.visit, INFO) Program contains array, or pointer (multiple level of indirection), or field (enable handleFieldAccess and handleFieldAliasing) access; analysis is imprecise in case of aliasing. (PredicateCPA:CtoFormulaConverter.makeVariableUnsafe, WARNING) Assuming external function pcmcia_request_io to be a pure function. (PredicateCPA:ExpressionToFormulaVisitor.visit, INFO) Assuming external function pcmcia_enable_device to be a pure function. (PredicateCPA:ExpressionToFormulaVisitor.visit, INFO) Assuming external function com20020_check to be a pure function. (PredicateCPA:ExpressionToFormulaVisitor.visit, INFO) Assuming external function com20020_found to be a pure function. (PredicateCPA:ExpressionToFormulaVisitor.visit, INFO) Assuming external function __dynamic_netdev_dbg to be a pure function. (PredicateCPA:ExpressionToFormulaVisitor.visit, INFO) Assuming external function dev_notice to be a pure function. (PredicateCPA:ExpressionToFormulaVisitor.visit, INFO) Assuming external function ldv_check_return_value to be a pure function. (PredicateCPA:ExpressionToFormulaVisitor.visit, INFO) Assuming external function pcmcia_unregister_driver to be a pure function. (PredicateCPA:ExpressionToFormulaVisitor.visit, INFO) Stopping analysis ... (CPAchecker.runAlgorithm, INFO) PredicateCPA statistics ----------------------- Number of abstractions: 8 (1% of all post computations) Times abstraction was reused: 0 Because of function entry/exit: 0 (0%) Because of loop head: 8 (100%) Because of join nodes: 0 (0%) Because of threshold: 0 (0%) Times precision was empty: 3 (38%) Times precision was {false}: 0 (0%) Times result was cached: 0 (0%) Times cartesian abs was used: 0 (0%) Times boolean abs was used: 5 (63%) Times result was 'false': 0 (0%) Number of strengthen sat checks: 5 Times result was 'false': 4 (80%) Number of coverage checks: 200 BDD entailment checks: 4 Number of SMT sat checks: 5 trivial: 0 cached: 1 Max ABE block size: 114 Number of predicates discovered: 2 Number of abstraction locations: 0 Max number of predicates per location: 0 Avg number of predicates per location: 0 Total predicates per abstraction: 10 Max number of predicates per abstraction: 2 Avg number of predicates per abstraction: 2.00 Number of irrelevant predicates: 0 (0%) Number of preds handled by boolean abs: 10 (100%) Total number of models for allsat: 5 Max number of models for allsat: 1 Avg number of models for allsat: 1.00 Number of path formula cache hits: 776 (51%) Time for post operator: 0.172s Time for path formula creation: 0.156s Actual computation: 0.148s Time for strengthen operator: 0.288s Time for satisfiability checks: 0.274s Time for prec operator: 0.887s Time for abstraction: 0.884s (Max: 0.508s, Count: 8) Boolean abstraction: 0.380s Solving time: 0.311s (Max: 0.184s) Model enumeration time: 0.057s Time for BDD construction: 0.000s (Max: 0.000s) Time for merge operator: 0.205s Time for coverage check: 0.002s Time for BDD entailment checks: 0.002s Total time for SMT solver (w/o itp): 0.641s Number of BDD nodes: 203 Size of BDD node table: 10007 Size of BDD node cleanup queue: 0 (count: 34, 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.073s Automaton transfers with branching: 0 Automaton transfer successors: 5433 (count: 5433, min: 1, max: 1, avg: 1,00) [1 x 5433] CPA algorithm statistics ------------------------ Number of iterations: 1357 Max size of waitlist: 18 Average size of waitlist: 8 Number of computed successors: 1465 Max successors for one state: 2 Number of times merged: 98 Number of times stopped: 102 Number of times breaked: 1 Total time for CPA algorithm: 1.908s (Max: 1.156s) Time for choose from waitlist: 0.017s Time for precision adjustment: 0.918s Time for transfer relation: 0.661s Time for merge operator: 0.213s Time for stop operator: 0.011s Time for adding to reached set: 0.025s 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.127s Counterexample analysis: 0.118s (Max: 0.118s, Calls: 1) Refinement sat check: 0.109s Interpolant computation: 0.000s Error path post-processing: 0.000s Path-formulas extraction: 0.000s Building the counterexample trace: 0.118s Extracting precise counterexample: 0.000s 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: 1 Number of failed refinements: 0 Max. size of reached set before ref.: 674 Max. size of reached set after ref.: 1 Avg. size of reached set before ref.: 674.00 Avg. size of reached set after ref.: 1.00 Total time for CEGAR algorithm: 2.041s Time for refinements: 0.133s Average time for refinement: 0.133s Max time for refinement: 0.133s Counterexample-Check Algorithm statistics ----------------------------------------- Number of counterexample checks: 0 CPAchecker general statistics ----------------------------- Number of program locations: 495 Number of functions: 25 Number of loops: 2 Size of reached set: 691 Number of reached locations: 425 (86%) Avg states per location: 1 Max states per location: 25 (at node N1383) Number of reached functions: 17 (68%) Number of partitions: 691 Avg size of partitions: 1 Max size of partitions: 1 Number of target states: 0 Time for analysis setup: 2.509s Time for loading CPAs: 0.453s Time for loading parser: 0.447s Time for CFA construction: 1.572s Time for parsing file(s): 0.802s Time for AST to CFA: 0.435s Time for CFA sanity check: 0.000s Time for post-processing: 0.171s Time for var class.: 0.000s Time for Analysis: 2.042s CPU time for analysis: 2.040s Total time for CPAchecker: 4.552s Total CPU time for CPAchecker: 4.550s Time for Garbage Collector: 0.070s (in 1 runs) Garbage Collector(s) used: PS MarkSweep, PS Scavenge Used heap memory: 123MB ( 118 MiB) max; 76MB ( 73 MiB) avg; 153MB ( 146 MiB) peak Used non-heap memory: 22MB ( 21 MiB) max; 17MB ( 16 MiB) avg; 22MB ( 21 MiB) peak Used in PS Old Gen pool: 0MB ( 0 MiB) max; 0MB ( 0 MiB) avg; 0MB ( 0 MiB) peak Allocated heap memory: 504MB ( 481 MiB) max; 504MB ( 481 MiB) avg Allocated non-heap memory: 24MB ( 23 MiB) max; 24MB ( 23 MiB) avg Total process virtual memory: 4900MB ( 4673 MiB) max; 4899MB ( 4672 MiB) avg Verification result: TRUE. No property violation found by chosen configuration. More details about the verification run can be found in the directory "./output".