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--tty--serial--altera_uart.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 uart_register_driver to be a pure function. (PredicateCPA:ExpressionToFormulaVisitor.visit, INFO) Assuming external function platform_driver_register to be a pure function. (PredicateCPA:ExpressionToFormulaVisitor.visit, INFO) Assuming external function uart_unregister_driver to be a pure function. (PredicateCPA:ExpressionToFormulaVisitor.visit, INFO) Assuming external function _raw_spin_lock 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 do_SAK to be a pure function. (PredicateCPA:ExpressionToFormulaVisitor.visit, INFO) Assuming external function uart_insert_char to be a pure function. (PredicateCPA:ExpressionToFormulaVisitor.visit, INFO) Assuming external function tty_flip_buffer_push to be a pure function. (PredicateCPA:ExpressionToFormulaVisitor.visit, INFO) Assuming external function uart_write_wakeup to be a pure function. (PredicateCPA:ExpressionToFormulaVisitor.visit, INFO) Assuming external function _raw_spin_unlock to be a pure function. (PredicateCPA:ExpressionToFormulaVisitor.visit, INFO) Assuming external function platform_get_resource to be a pure function. (PredicateCPA:ExpressionToFormulaVisitor.visit, INFO) Assuming external function ioremap_nocache to be a pure function. (PredicateCPA:ExpressionToFormulaVisitor.visit, INFO) Assuming external function dev_set_drvdata to be a pure function. (PredicateCPA:ExpressionToFormulaVisitor.visit, INFO) Assuming external function uart_add_one_port 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 platform_driver_unregister to be a pure function. (PredicateCPA:ExpressionToFormulaVisitor.visit, INFO) Assuming external function uart_get_baud_rate to be a pure function. (PredicateCPA:ExpressionToFormulaVisitor.visit, INFO) Assuming external function tty_termios_copy_hw to be a pure function. (PredicateCPA:ExpressionToFormulaVisitor.visit, INFO) Assuming external function tty_termios_encode_baud_rate 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) Assuming external function uart_update_timeout 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 free_irq to be a pure function. (PredicateCPA:ExpressionToFormulaVisitor.visit, INFO) Assuming external function del_timer_sync 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 init_timer_key to be a pure function. (PredicateCPA:ExpressionToFormulaVisitor.visit, INFO) Assuming external function mod_timer to be a pure function. (PredicateCPA:ExpressionToFormulaVisitor.visit, INFO) Stopping analysis ... (CPAchecker.runAlgorithm, INFO) PredicateCPA statistics ----------------------- Number of abstractions: 33 (2% 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: 11 (33%) Times precision was {false}: 0 (0%) Times result was cached: 0 (0%) Times cartesian abs was used: 0 (0%) Times boolean abs was used: 22 (67%) Times result was 'false': 1 (3%) Number of strengthen sat checks: 5 Times result was 'false': 4 (80%) Number of coverage checks: 254 BDD entailment checks: 18 Number of SMT sat checks: 5 trivial: 0 cached: 1 Max ABE block size: 61 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: 44 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: 44 (100%) Total number of models for allsat: 21 Max number of models for allsat: 1 Avg number of models for allsat: 0.95 Number of path formula cache hits: 621 (37%) Time for post operator: 0.226s Time for path formula creation: 0.208s Actual computation: 0.192s Time for strengthen operator: 0.164s Time for satisfiability checks: 0.157s Time for prec operator: 0.771s Time for abstraction: 0.770s (Max: 0.364s, Count: 33) Boolean abstraction: 0.297s Solving time: 0.237s (Max: 0.112s) Model enumeration time: 0.047s Time for BDD construction: 0.000s (Max: 0.000s) Time for merge operator: 0.330s Time for coverage check: 0.003s Time for BDD entailment checks: 0.001s Total time for SMT solver (w/o itp): 0.441s Number of BDD nodes: 203 Size of BDD node table: 10007 Size of BDD node cleanup queue: 0 (count: 124, 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.099s Automaton transfers with branching: 0 Automaton transfer successors: 6056 (count: 6056, min: 1, max: 1, avg: 1,00) [1 x 6056] CPA algorithm statistics ------------------------ Number of iterations: 1461 Max size of waitlist: 41 Average size of waitlist: 24 Number of computed successors: 1626 Max successors for one state: 2 Number of times merged: 118 Number of times stopped: 136 Number of times breaked: 1 Total time for CPA algorithm: 1.849s (Max: 1.223s) Time for choose from waitlist: 0.014s Time for precision adjustment: 0.811s Time for transfer relation: 0.582s Time for merge operator: 0.345s Time for stop operator: 0.016s Time for adding to reached set: 0.027s 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.083s Counterexample analysis: 0.066s (Max: 0.066s, Calls: 1) Refinement sat check: 0.063s Interpolant computation: 0.000s Error path post-processing: 0.000s Path-formulas extraction: 0.000s Building the counterexample trace: 0.066s 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.: 512 Max. size of reached set after ref.: 1 Avg. size of reached set before ref.: 512.00 Avg. size of reached set after ref.: 1.00 Total time for CEGAR algorithm: 1.942s Time for refinements: 0.092s Average time for refinement: 0.092s Max time for refinement: 0.092s Counterexample-Check Algorithm statistics ----------------------------------------- Number of counterexample checks: 0 CPAchecker general statistics ----------------------------- Number of program locations: 679 Number of functions: 54 Number of loops: 6 Size of reached set: 980 Number of reached locations: 586 (86%) Avg states per location: 1 Max states per location: 18 (at node N65) Number of reached functions: 43 (80%) Number of partitions: 980 Avg size of partitions: 1 Max size of partitions: 1 Number of target states: 0 Time for analysis setup: 2.690s Time for loading CPAs: 0.643s Time for loading parser: 0.351s Time for CFA construction: 1.608s Time for parsing file(s): 0.569s Time for AST to CFA: 0.646s Time for CFA sanity check: 0.000s Time for post-processing: 0.274s Time for var class.: 0.000s Time for Analysis: 1.945s CPU time for analysis: 3.870s Total time for CPAchecker: 4.637s Total CPU time for CPAchecker: 8.200s Time for Garbage Collector: 0.000s (in 0 runs) Garbage Collector(s) used: PS MarkSweep, PS Scavenge Used heap memory: 423MB ( 403 MiB) max; 205MB ( 196 MiB) avg; 423MB ( 403 MiB) peak Used non-heap memory: 23MB ( 21 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: 57056MB ( 54413 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".