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_7_cilled_false-unreach-call_const_ok_linux-32_1-drivers--staging--keucr--keucr.ko-ldv_main1_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) line 4950: Dead code detected: Goto: case_1 (CFACreationUtils.addEdgeToCFA, INFO) line 4955: Dead code detected: Goto: case_2 (CFACreationUtils.addEdgeToCFA, INFO) line 4960: Dead code detected: Goto: case_4 (CFACreationUtils.addEdgeToCFA, INFO) line 4969: Dead code detected: Goto: switch_default (CFACreationUtils.addEdgeToCFA, INFO) Dead code detected: Label case_2 is not reachable. (CFAFunctionBuilder.leave, INFO) Dead code detected: Label case_1 is not reachable. (CFAFunctionBuilder.leave, INFO) Dead code detected: Label switch_default is not reachable. (CFAFunctionBuilder.leave, INFO) Dead code detected: Label case_4 is not reachable. (CFAFunctionBuilder.leave, INFO) line 7151: Dead code detected: Goto: case_1 (CFACreationUtils.addEdgeToCFA, INFO) line 7156: Dead code detected: Goto: case_2 (CFACreationUtils.addEdgeToCFA, INFO) line 7161: Dead code detected: Goto: case_4 (CFACreationUtils.addEdgeToCFA, INFO) line 7170: Dead code detected: Goto: switch_default (CFACreationUtils.addEdgeToCFA, INFO) Dead code detected: Label switch_default is not reachable. (CFAFunctionBuilder.leave, INFO) Dead code detected: Label case_2 is not reachable. (CFAFunctionBuilder.leave, INFO) Dead code detected: Label case_1 is not reachable. (CFAFunctionBuilder.leave, INFO) Dead code detected: Label case_4 is not reachable. (CFAFunctionBuilder.leave, INFO) Dead code detected: Label switch_break is not reachable. (CFAFunctionBuilder.leave, INFO) line 20444: Dead code detected: return (0); (CFACreationUtils.addEdgeToCFA, INFO) line 21402: Dead code detected: return (0); (CFACreationUtils.addEdgeToCFA, INFO) line 21611: Dead code detected: return (0); (CFACreationUtils.addEdgeToCFA, INFO) Dead code detected: Label switch_break is not reachable. (CFAFunctionBuilder.leave, INFO) Inline assembler ignored, analysis is probably unsound! (CFABuilder.createCFA, WARNING) line 5991: Function pointer *__cil_tmp11 with type void (*)(struct us_data *, int) is called, but no possible target functions were found. (CFunctionPointerResolver.replaceFunctionPointerCall, WARNING) line 5924: Function pointer *__cil_tmp10 with type void (*)(struct us_data *, int) is called, but no possible target functions were found. (CFunctionPointerResolver.replaceFunctionPointerCall, 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) 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 ldv_initialize to be a constant function. (PredicateCPA:ExpressionToFormulaVisitor.visit, INFO) Assuming external function blk_queue_max_hw_sectors to be a pure function. (PredicateCPA:ExpressionToFormulaVisitor.visit, INFO) Assuming external function blk_queue_update_dma_alignment to be a pure function. (PredicateCPA:ExpressionToFormulaVisitor.visit, INFO) Assuming external function usb_lock_device_for_reset to be a pure function. (PredicateCPA:ExpressionToFormulaVisitor.visit, INFO) Assuming external function usb_reset_device to be a pure function. (PredicateCPA:ExpressionToFormulaVisitor.visit, 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) Dereferencing of a non-pointer in expression *(host) (org.eclipse.cdt.internal.core.dom.parser.ProblemType@13cc4f8d: Type depends on an unresolved name) (CounterexampleCheck:ASTConverter.convert, WARNING) Dereferencing of a non-pointer in expression *(srb) (org.eclipse.cdt.internal.core.dom.parser.ProblemType@2f1a74d1: Type depends on an unresolved name) (CounterexampleCheck:ASTConverter.convert, WARNING) Dereferencing of a non-pointer in expression *(us) (org.eclipse.cdt.internal.core.dom.parser.ProblemType@54fabfeb: Type depends on an unresolved name) (CounterexampleCheck:ASTConverter.convert, WARNING) Dereferencing of a non-pointer in expression *(us) (org.eclipse.cdt.internal.core.dom.parser.ProblemType@9df65c8: Type depends on an unresolved name) (CounterexampleCheck:ASTConverter.convert, WARNING) Error path found and confirmed by counterexample check with CPACHECKER. (CounterexampleCheckAlgorithm.checkCounterexample, INFO) Stopping analysis ... (CPAchecker.runAlgorithm, INFO) PredicateCPA statistics ----------------------- Number of abstractions: 1 (1% of all post computations) Times abstraction was reused: 0 Because of function entry/exit: 0 (0%) Because of loop head: 1 (100%) Because of join nodes: 0 (0%) Because of threshold: 0 (0%) Times precision was empty: 1 (100%) Times precision was {false}: 0 (0%) Times result was cached: 0 (0%) Times cartesian abs was used: 0 (0%) Times boolean abs was used: 0 (0%) Times result was 'false': 0 (0%) Number of strengthen sat checks: 1 Times result was 'false': 0 (0%) Number of coverage checks: 36 BDD entailment checks: 0 Number of SMT sat checks: 1 trivial: 0 cached: 0 Max ABE block size: 1 Number of predicates discovered: 0 Number of path formula cache hits: 1 (0%) Time for post operator: 0.157s Time for path formula creation: 0.153s Actual computation: 0.212s Time for strengthen operator: 0.072s Time for satisfiability checks: 0.067s Time for prec operator: 0.021s Time for abstraction: 0.020s (Max: 0.020s, Count: 1) Solving time: 0.000s (Max: 0.000s) Model enumeration time: 0.000s Time for BDD construction: 0.000s (Max: 0.000s) Time for merge operator: 0.041s Time for coverage check: 0.000s Total time for SMT solver (w/o itp): 0.067s Number of BDD nodes: 202 Size of BDD node table: 10007 Size of BDD node cleanup queue: 0 (count: 3, 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.033s Automaton transfers with branching: 0 Automaton transfer successors: 1483 (count: 1483, min: 1, max: 1, avg: 1,00) [1 x 1483] CPA algorithm statistics ------------------------ Number of iterations: 146 Max size of waitlist: 12 Average size of waitlist: 8 Number of computed successors: 172 Max successors for one state: 2 Number of times merged: 18 Number of times stopped: 18 Number of times breaked: 1 Total time for CPA algorithm: 0.392s (Max: 0.392s) Time for choose from waitlist: 0.001s Time for precision adjustment: 0.030s Time for transfer relation: 0.308s Time for merge operator: 0.044s Time for stop operator: 0.002s Time for adding to reached set: 0.001s 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.519s Counterexample analysis: 0.135s (Max: 0.135s, Calls: 1) Refinement sat check: 0.084s Interpolant computation: 0.000s Error path post-processing: 0.381s Path-formulas extraction: 0.000s Building the counterexample trace: 0.135s Extracting precise counterexample: 0.381s 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: 0 Number of failed refinements: 0 Max. size of reached set before ref.: 155 Max. size of reached set after ref.: 0 Avg. size of reached set before ref.: 155.00 Avg. size of reached set after ref.: NaN Total time for CEGAR algorithm: 0.920s Time for refinements: 0.528s Average time for refinement: 0.528s Max time for refinement: 0.528s Counterexample-Check Algorithm statistics ----------------------------------------- Number of counterexample checks: 1 Number of infeasible paths: 0 (0%) Time for counterexample checks: 0.598s CPAchecker general statistics ----------------------------- Number of program locations: 3817 Number of functions: 179 Number of loops: 37 Size of reached set: 155 Number of reached locations: 149 (4%) Avg states per location: 1 Max states per location: 3 (at node N419) Number of reached functions: 11 (6%) Number of partitions: 155 Avg size of partitions: 1 Max size of partitions: 1 Number of target states: 1 Size of final wait list 9 Time for analysis setup: 6.134s Time for loading CPAs: 1.312s Time for loading parser: 0.349s Time for CFA construction: 4.320s Time for parsing file(s): 1.171s Time for AST to CFA: 1.829s Time for CFA sanity check: 0.000s Time for post-processing: 1.150s Time for var class.: 0.000s Time for Analysis: 1.518s CPU time for analysis: 3.580s Total time for CPAchecker: 7.655s Total CPU time for CPAchecker: 15.930s Time for Garbage Collector: 0.060s (in 1 runs) Garbage Collector(s) used: PS MarkSweep, PS Scavenge Used heap memory: 520MB ( 496 MiB) max; 295MB ( 281 MiB) avg; 595MB ( 567 MiB) peak Used non-heap memory: 25MB ( 24 MiB) max; 17MB ( 16 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: 26MB ( 25 MiB) max; 25MB ( 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 9899) found by chosen configuration. More details about the verification run can be found in the directory "./output".