scripts/cpa.sh -heap 50000M -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--scsi--pcmcia--sym53c500_cs.ko-ldv_main0_sequence_infinite_withcheck_stateful.cil.out.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) 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 _raw_spin_lock_irqsave 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) line 6974: Ignoring call via function pointer SYM53C500_intr::__cil_tmp176 for which no suitable target was found in line: (*__cil_tmp176)(curSC); (FunctionPointerCPA:FunctionPointerTransferRelation.getAbstractSuccessorsForEdge, WARNING) line 6974: Ignoring function call through function pointer *__cil_tmp176: (*__cil_tmp176)(curSC); (PredicateCPA:ExpressionToFormulaVisitor.visit, WARNING) Assuming external function __dynamic_dev_dbg to be a pure function. (PredicateCPA:ExpressionToFormulaVisitor.visit, INFO) Assuming external function scsi_remove_host 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 __release_region 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 scsi_host_put to be a pure function. (PredicateCPA:ExpressionToFormulaVisitor.visit, INFO) Assuming external function sg_next to be a pure function. (PredicateCPA:ExpressionToFormulaVisitor.visit, INFO) Assuming external function _raw_spin_unlock_irqrestore to be a pure function. (PredicateCPA:ExpressionToFormulaVisitor.visit, INFO) Assuming external function pcmcia_loop_config 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 scsi_host_alloc to be a pure function. (PredicateCPA:ExpressionToFormulaVisitor.visit, INFO) Assuming external function request_threaded_irq to be a pure function. (PredicateCPA:ExpressionToFormulaVisitor.visit, INFO) Assuming external function scsi_add_host_with_dma to be a pure function. (PredicateCPA:ExpressionToFormulaVisitor.visit, INFO) Assuming external function scsi_scan_host 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) Assuming external function _raw_spin_lock_irq to be a pure function. (PredicateCPA:ExpressionToFormulaVisitor.visit, INFO) Assuming external function _raw_spin_unlock_irq to be a pure function. (PredicateCPA:ExpressionToFormulaVisitor.visit, INFO) Assuming external function snprintf to be a pure function. (PredicateCPA:ExpressionToFormulaVisitor.visit, INFO) Assuming external function simple_strtoul to be a pure function. (PredicateCPA:ExpressionToFormulaVisitor.visit, INFO) Stopping analysis ... (CPAchecker.runAlgorithm, INFO) PredicateCPA statistics ----------------------- Number of abstractions: 33 (1% of all post computations) Times abstraction was reused: 0 Because of function entry/exit: 0 (0%) Because of loop head: 33 (100%) Because of join nodes: 0 (0%) Because of threshold: 0 (0%) Times precision was empty: 15 (45%) Times precision was {false}: 0 (0%) Times result was cached: 0 (0%) Times cartesian abs was used: 0 (0%) Times boolean abs was used: 18 (55%) Times result was 'false': 0 (0%) Number of strengthen sat checks: 4 Times result was 'false': 3 (75%) Number of coverage checks: 325 BDD entailment checks: 19 Number of SMT sat checks: 4 trivial: 0 cached: 1 Max ABE block size: 87 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: 36 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: 36 (100%) Total number of models for allsat: 18 Max number of models for allsat: 1 Avg number of models for allsat: 1.00 Number of path formula cache hits: 1482 (53%) Time for post operator: 0.251s Time for path formula creation: 0.227s Actual computation: 0.212s Time for strengthen operator: 0.232s Time for satisfiability checks: 0.219s Time for prec operator: 0.622s Time for abstraction: 0.620s (Max: 0.396s, Count: 33) Boolean abstraction: 0.226s Solving time: 0.181s (Max: 0.127s) Model enumeration time: 0.033s Time for BDD construction: 0.003s (Max: 0.001s) Time for merge operator: 0.258s Time for coverage check: 0.003s Time for BDD entailment checks: 0.001s Total time for SMT solver (w/o itp): 0.433s Number of BDD nodes: 203 Size of BDD node table: 10007 Size of BDD node cleanup queue: 0 (count: 113, 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.087s Automaton transfers with branching: 0 Automaton transfer successors: 8292 (count: 8292, min: 1, max: 1, avg: 1,00) [1 x 8292] CPA algorithm statistics ------------------------ Number of iterations: 2536 Max size of waitlist: 24 Average size of waitlist: 14 Number of computed successors: 2719 Max successors for one state: 2 Number of times merged: 153 Number of times stopped: 172 Number of times breaked: 1 Total time for CPA algorithm: 1.858s (Max: 0.935s) Time for choose from waitlist: 0.030s Time for precision adjustment: 0.666s Time for transfer relation: 0.767s Time for merge operator: 0.271s Time for stop operator: 0.024s Time for adding to reached set: 0.039s Predicate-Abstraction Refiner statistics ---------------------------------------- Avg. length of target path (in blocks): 2 (count: 1, min: 2, max: 2, avg: 2,00) Time for refinement: 0.123s Counterexample analysis: 0.098s (Max: 0.098s, Calls: 1) Refinement sat check: 0.091s Interpolant computation: 0.000s Error path post-processing: 0.000s Path-formulas extraction: 0.000s Building the counterexample trace: 0.098s 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.: 1197 Max. size of reached set after ref.: 1 Avg. size of reached set before ref.: 1197.00 Avg. size of reached set after ref.: 1.00 Total time for CEGAR algorithm: 1.989s Time for refinements: 0.130s Average time for refinement: 0.130s Max time for refinement: 0.130s Counterexample-Check Algorithm statistics ----------------------------------------- Number of counterexample checks: 0 CPAchecker general statistics ----------------------------- Number of program locations: 893 Number of functions: 51 Number of loops: 8 Size of reached set: 1352 Number of reached locations: 773 (87%) Avg states per location: 1 Max states per location: 89 (at node N32) Number of reached functions: 39 (76%) Number of partitions: 1352 Avg size of partitions: 1 Max size of partitions: 1 Number of target states: 0 Time for analysis setup: 2.990s Time for loading CPAs: 0.666s Time for loading parser: 0.347s Time for CFA construction: 1.887s Time for parsing file(s): 0.654s Time for AST to CFA: 0.763s Time for CFA sanity check: 0.000s Time for post-processing: 0.336s Time for var class.: 0.000s Time for Analysis: 1.992s CPU time for analysis: 3.920s Total time for CPAchecker: 4.983s Total CPU time for CPAchecker: 8.760s Time for Garbage Collector: 0.000s (in 0 runs) Garbage Collector(s) used: PS MarkSweep, PS Scavenge Used heap memory: 423MB ( 404 MiB) max; 218MB ( 208 MiB) avg; 423MB ( 404 MiB) peak Used non-heap memory: 23MB ( 22 MiB) max; 17MB ( 16 MiB) avg; 23MB ( 22 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: 24MB ( 23 MiB) max; 24MB ( 23 MiB) avg Total process virtual memory: 57054MB ( 54411 MiB) max; 57054MB ( 54411 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".