java -ea -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AbstractInterpretationInline.xml -s ../../../trunk/examples/settings/ai/array-bench/reach_32bit_array_compound_exp_cong.epf -i ../../../trunk/examples/programs/heapseparator/speedup-poc-dd-10-limited.bpl -------------------------------------------------------------------------------- This is Ultimate 0.1.24-b7bd044-m [2019-01-18 15:07:11,404 INFO L170 SettingsManager]: Resetting all preferences to default values... [2019-01-18 15:07:11,406 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2019-01-18 15:07:11,418 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-01-18 15:07:11,418 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-01-18 15:07:11,419 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-01-18 15:07:11,421 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-01-18 15:07:11,423 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2019-01-18 15:07:11,424 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-01-18 15:07:11,425 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-01-18 15:07:11,426 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-01-18 15:07:11,427 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-01-18 15:07:11,428 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-01-18 15:07:11,432 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-01-18 15:07:11,434 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-01-18 15:07:11,435 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-01-18 15:07:11,435 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-01-18 15:07:11,442 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-01-18 15:07:11,447 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2019-01-18 15:07:11,449 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-01-18 15:07:11,452 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-01-18 15:07:11,454 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-01-18 15:07:11,456 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-01-18 15:07:11,457 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-01-18 15:07:11,457 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-01-18 15:07:11,458 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-01-18 15:07:11,459 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-01-18 15:07:11,460 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-01-18 15:07:11,461 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2019-01-18 15:07:11,462 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-01-18 15:07:11,462 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2019-01-18 15:07:11,462 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-01-18 15:07:11,463 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-01-18 15:07:11,463 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2019-01-18 15:07:11,464 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2019-01-18 15:07:11,465 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2019-01-18 15:07:11,465 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/ai/array-bench/reach_32bit_array_compound_exp_cong.epf [2019-01-18 15:07:11,483 INFO L110 SettingsManager]: Loading preferences was successful [2019-01-18 15:07:11,483 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2019-01-18 15:07:11,485 INFO L131 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2019-01-18 15:07:11,485 INFO L133 SettingsManager]: * Show backtranslation warnings=false [2019-01-18 15:07:11,485 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2019-01-18 15:07:11,485 INFO L133 SettingsManager]: * User list type=DISABLED [2019-01-18 15:07:11,486 INFO L133 SettingsManager]: * Inline calls to unimplemented procedures=true [2019-01-18 15:07:11,486 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2019-01-18 15:07:11,487 INFO L133 SettingsManager]: * Explicit value domain=true [2019-01-18 15:07:11,487 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2019-01-18 15:07:11,487 INFO L133 SettingsManager]: * Octagon Domain=false [2019-01-18 15:07:11,487 INFO L133 SettingsManager]: * Abstract domain=ArrayDomain [2019-01-18 15:07:11,487 INFO L133 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2019-01-18 15:07:11,487 INFO L133 SettingsManager]: * Interval Domain=false [2019-01-18 15:07:11,488 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-01-18 15:07:11,488 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2019-01-18 15:07:11,488 INFO L133 SettingsManager]: * Use SBE=true [2019-01-18 15:07:11,489 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-01-18 15:07:11,490 INFO L133 SettingsManager]: * sizeof long=4 [2019-01-18 15:07:11,490 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2019-01-18 15:07:11,490 INFO L133 SettingsManager]: * sizeof POINTER=4 [2019-01-18 15:07:11,490 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2019-01-18 15:07:11,490 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-01-18 15:07:11,491 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-01-18 15:07:11,491 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-01-18 15:07:11,491 INFO L133 SettingsManager]: * sizeof long double=12 [2019-01-18 15:07:11,491 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2019-01-18 15:07:11,491 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-01-18 15:07:11,491 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-01-18 15:07:11,493 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-01-18 15:07:11,493 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2019-01-18 15:07:11,494 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-01-18 15:07:11,494 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-01-18 15:07:11,494 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-01-18 15:07:11,494 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-01-18 15:07:11,494 INFO L133 SettingsManager]: * Trace refinement strategy=TAIPAN [2019-01-18 15:07:11,495 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-01-18 15:07:11,495 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-01-18 15:07:11,495 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-01-18 15:07:11,495 INFO L133 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2019-01-18 15:07:11,531 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-01-18 15:07:11,542 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-01-18 15:07:11,546 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-01-18 15:07:11,547 INFO L271 PluginConnector]: Initializing Boogie PL CUP Parser... [2019-01-18 15:07:11,548 INFO L276 PluginConnector]: Boogie PL CUP Parser initialized [2019-01-18 15:07:11,548 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/heapseparator/speedup-poc-dd-10-limited.bpl [2019-01-18 15:07:11,549 INFO L111 BoogieParser]: Parsing: '/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/heapseparator/speedup-poc-dd-10-limited.bpl' [2019-01-18 15:07:11,621 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-01-18 15:07:11,623 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-01-18 15:07:11,623 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-01-18 15:07:11,624 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-01-18 15:07:11,624 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2019-01-18 15:07:11,643 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "speedup-poc-dd-10-limited.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 18.01 03:07:11" (1/1) ... [2019-01-18 15:07:11,659 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "speedup-poc-dd-10-limited.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 18.01 03:07:11" (1/1) ... [2019-01-18 15:07:11,712 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-01-18 15:07:11,713 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-01-18 15:07:11,714 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-01-18 15:07:11,714 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2019-01-18 15:07:11,725 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "speedup-poc-dd-10-limited.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 18.01 03:07:11" (1/1) ... [2019-01-18 15:07:11,725 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "speedup-poc-dd-10-limited.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 18.01 03:07:11" (1/1) ... [2019-01-18 15:07:11,735 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "speedup-poc-dd-10-limited.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 18.01 03:07:11" (1/1) ... [2019-01-18 15:07:11,736 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "speedup-poc-dd-10-limited.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 18.01 03:07:11" (1/1) ... [2019-01-18 15:07:11,746 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "speedup-poc-dd-10-limited.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 18.01 03:07:11" (1/1) ... [2019-01-18 15:07:11,750 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "speedup-poc-dd-10-limited.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 18.01 03:07:11" (1/1) ... [2019-01-18 15:07:11,752 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "speedup-poc-dd-10-limited.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 18.01 03:07:11" (1/1) ... [2019-01-18 15:07:11,754 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-01-18 15:07:11,755 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-01-18 15:07:11,755 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-01-18 15:07:11,755 INFO L276 PluginConnector]: RCFGBuilder initialized [2019-01-18 15:07:11,759 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "speedup-poc-dd-10-limited.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 18.01 03:07:11" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-01-18 15:07:11,839 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-01-18 15:07:11,840 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-01-18 15:07:12,942 INFO L281 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-01-18 15:07:12,942 INFO L286 CfgBuilder]: Removed 23 assue(true) statements. [2019-01-18 15:07:12,943 INFO L202 PluginConnector]: Adding new model speedup-poc-dd-10-limited.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.01 03:07:12 BoogieIcfgContainer [2019-01-18 15:07:12,944 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-01-18 15:07:12,944 INFO L113 PluginConnector]: ------------------------Abstract Interpretation---------------------------- [2019-01-18 15:07:12,945 INFO L271 PluginConnector]: Initializing Abstract Interpretation... [2019-01-18 15:07:12,945 INFO L276 PluginConnector]: Abstract Interpretation initialized [2019-01-18 15:07:12,946 INFO L185 PluginConnector]: Executing the observer AbstractInterpretationRcfgObserver from plugin Abstract Interpretation for "speedup-poc-dd-10-limited.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.01 03:07:12" (1/1) ... [2019-01-18 15:07:12,993 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-18 15:07:20,206 WARN L212 ngHoareTripleChecker]: Soundness check inconclusive for the following hoare triple [2019-01-18 15:07:20,206 WARN L217 ngHoareTripleChecker]: Expected: VALID Actual: UNKNOWN [2019-01-18 15:07:20,208 WARN L219 ngHoareTripleChecker]: Solver was "Z3" in version "4.8.3" [2019-01-18 15:07:20,208 WARN L223 ngHoareTripleChecker]: -- [2019-01-18 15:07:20,209 WARN L224 ngHoareTripleChecker]: Pre: {2147483581#(forall ((v_idx_599 Int) (v_idx_600 Int) (v_idx_597 Int) (v_idx_598 Int) (v_idx_601 Int) (v_idx_595 Int) (v_idx_596 Int)) (exists ((v_v_102_1 Int) (v_v_759_1 Int) (v_v_96_1 Int) (v_v_104_1 Int) (v_v_2_1 Int) (v_b_59_1 Int) (v_b_58_1 Int) (v_v_4_1 Int)) (and (= (select |c_ULTIMATE.start_malloc_old_#valid| v_idx_595) v_v_96_1) (or (= v_v_102_1 (select |c_#valid| v_idx_597)) (<= v_b_58_1 v_idx_597)) (= (select |c_#memory_int| v_idx_601) v_v_759_1) (= v_v_2_1 (select |c_old(#valid)| v_idx_596)) (or (< v_idx_598 v_b_58_1) (= 1 (select |c_#valid| v_idx_598)) (<= v_b_59_1 v_idx_598)) (= v_v_4_1 (select |c_old(#memory_int)| v_idx_600)) (or (= v_v_104_1 (select |c_#valid| v_idx_599)) (< v_idx_599 v_b_59_1)))))} [2019-01-18 15:07:20,212 WARN L228 ngHoareTripleChecker]: Action: assume !(#memory_int[main_p6] <= 0); [2019-01-18 15:07:20,213 WARN L184 hOps$ForEachOp$OfRef]: ActionStr: (not (<= (select |c_#memory_int| c_ULTIMATE.start_main_p6) 0)) [2019-01-18 15:07:20,214 WARN L230 ngHoareTripleChecker]: Post: {2147483580#(forall ((v_idx_603 Int) (v_idx_604 Int) (v_idx_602 Int) (v_idx_607 Int) (v_idx_608 Int) (v_idx_605 Int) (v_idx_606 Int)) (exists ((v_v_102_1 Int) (v_v_104_1 Int) (v_v_96_1 Int) (v_v_2_1 Int) (v_b_59_1 Int) (v_v_762_1 Int) (v_b_58_1 Int) (v_v_4_1 Int)) (and (or (< v_idx_605 v_b_58_1) (= (select |c_#valid| v_idx_605) 1) (<= v_b_59_1 v_idx_605)) (or (= v_v_102_1 (select |c_#valid| v_idx_604)) (<= v_b_58_1 v_idx_604)) (or (< v_idx_606 v_b_59_1) (= (select |c_#valid| v_idx_606) v_v_104_1)) (= v_v_96_1 (select |c_ULTIMATE.start_malloc_old_#valid| v_idx_602)) (= (select |c_old(#memory_int)| v_idx_607) v_v_4_1) (= (select |c_#memory_int| v_idx_608) v_v_762_1) (= v_v_2_1 (select |c_old(#valid)| v_idx_603)))))} [2019-01-18 15:07:20,214 WARN L263 ngHoareTripleChecker]: unsat core / model generation is disabled, enable it to get more details [2019-01-18 15:07:20,611 WARN L268 ngHoareTripleChecker]: -- [2019-01-18 15:07:20,611 WARN L269 ngHoareTripleChecker]: Simplified triple [2019-01-18 15:07:20,972 WARN L270 ngHoareTripleChecker]: Pre: {2147483581#true} [2019-01-18 15:07:20,973 WARN L274 ngHoareTripleChecker]: Action: assume !(#memory_int[main_p6] <= 0); [2019-01-18 15:07:20,974 WARN L184 hOps$ForEachOp$OfRef]: ActionStr: (not (<= (select |c_#memory_int| c_ULTIMATE.start_main_p6) 0)) [2019-01-18 15:07:21,165 WARN L276 ngHoareTripleChecker]: Post: {2147483580#true} [2019-01-18 15:07:23,383 WARN L212 ngHoareTripleChecker]: Soundness check inconclusive for the following hoare triple [2019-01-18 15:07:23,384 WARN L217 ngHoareTripleChecker]: Expected: VALID Actual: UNKNOWN [2019-01-18 15:07:23,384 WARN L219 ngHoareTripleChecker]: Solver was "Z3" in version "4.8.3" [2019-01-18 15:07:23,384 WARN L223 ngHoareTripleChecker]: -- [2019-01-18 15:07:23,385 WARN L224 ngHoareTripleChecker]: Pre: {2147483573#(forall ((v_idx_654 Int) (v_idx_655 Int) (v_idx_652 Int) (v_idx_653 Int) (v_idx_656 Int) (v_idx_657 Int) (v_idx_651 Int)) (exists ((v_v_102_1 Int) (v_v_104_1 Int) (v_v_96_1 Int) (v_v_771_1 Int) (v_v_2_1 Int) (v_b_59_1 Int) (v_b_58_1 Int) (v_v_4_1 Int)) (and (or (< v_idx_655 v_b_59_1) (= (select |c_#valid| v_idx_655) v_v_104_1)) (= (select |c_ULTIMATE.start_malloc_old_#valid| v_idx_651) v_v_96_1) (= v_v_2_1 (select |c_old(#valid)| v_idx_652)) (= (select |c_#memory_int| v_idx_657) v_v_771_1) (or (<= v_b_58_1 v_idx_653) (= v_v_102_1 (select |c_#valid| v_idx_653))) (or (= (select |c_#valid| v_idx_654) 1) (<= v_b_59_1 v_idx_654) (< v_idx_654 v_b_58_1)) (= v_v_4_1 (select |c_old(#memory_int)| v_idx_656)))))} [2019-01-18 15:07:23,385 WARN L228 ngHoareTripleChecker]: Action: assume !(#memory_int[main_p8] <= 0); [2019-01-18 15:07:23,385 WARN L184 hOps$ForEachOp$OfRef]: ActionStr: (not (<= (select |c_#memory_int| c_ULTIMATE.start_main_p8) 0)) [2019-01-18 15:07:23,386 WARN L230 ngHoareTripleChecker]: Post: {2147483572#(forall ((v_idx_663 Int) (v_idx_664 Int) (v_idx_658 Int) (v_idx_659 Int) (v_idx_661 Int) (v_idx_662 Int) (v_idx_660 Int)) (exists ((v_v_102_1 Int) (v_v_104_1 Int) (v_v_96_1 Int) (v_v_2_1 Int) (v_b_59_1 Int) (v_b_58_1 Int) (v_v_4_1 Int) (v_v_774_1 Int)) (and (or (<= v_b_58_1 v_idx_660) (= v_v_102_1 (select |c_#valid| v_idx_660))) (= v_v_2_1 (select |c_old(#valid)| v_idx_659)) (or (< v_idx_662 v_b_59_1) (= (select |c_#valid| v_idx_662) v_v_104_1)) (= (select |c_ULTIMATE.start_malloc_old_#valid| v_idx_658) v_v_96_1) (= (select |c_#memory_int| v_idx_664) v_v_774_1) (or (< v_idx_661 v_b_58_1) (<= v_b_59_1 v_idx_661) (= 1 (select |c_#valid| v_idx_661))) (= v_v_4_1 (select |c_old(#memory_int)| v_idx_663)))))} [2019-01-18 15:07:23,386 WARN L263 ngHoareTripleChecker]: unsat core / model generation is disabled, enable it to get more details [2019-01-18 15:07:23,866 WARN L268 ngHoareTripleChecker]: -- [2019-01-18 15:07:23,866 WARN L269 ngHoareTripleChecker]: Simplified triple [2019-01-18 15:07:24,139 WARN L270 ngHoareTripleChecker]: Pre: {2147483573#true} [2019-01-18 15:07:24,140 WARN L274 ngHoareTripleChecker]: Action: assume !(#memory_int[main_p8] <= 0); [2019-01-18 15:07:24,140 WARN L184 hOps$ForEachOp$OfRef]: ActionStr: (not (<= (select |c_#memory_int| c_ULTIMATE.start_main_p8) 0)) [2019-01-18 15:07:24,268 WARN L276 ngHoareTripleChecker]: Post: {2147483572#true} [2019-01-18 15:07:24,432 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-18 15:07:24,475 INFO L272 AbstractInterpreter]: Visited 32 different actions 44 times. Merged at 1 different actions 1 times. Never widened. Found 21 fixpoints after 12 different actions. Largest state had 0 variables. [2019-01-18 15:07:24,481 INFO L132 PluginConnector]: ------------------------ END Abstract Interpretation---------------------------- [2019-01-18 15:07:24,482 INFO L168 Benchmark]: Toolchain (without parser) took 12860.80 ms. Allocated memory was 141.6 MB in the beginning and 231.7 MB in the end (delta: 90.2 MB). Free memory was 108.6 MB in the beginning and 99.6 MB in the end (delta: 9.0 MB). Peak memory consumption was 115.3 MB. Max. memory is 7.1 GB. [2019-01-18 15:07:24,488 INFO L168 Benchmark]: Boogie PL CUP Parser took 0.19 ms. Allocated memory is still 141.6 MB. Free memory is still 110.3 MB. There was no memory consumed. Max. memory is 7.1 GB. [2019-01-18 15:07:24,488 INFO L168 Benchmark]: Boogie Procedure Inliner took 89.68 ms. Allocated memory is still 141.6 MB. Free memory was 108.6 MB in the beginning and 105.7 MB in the end (delta: 2.9 MB). Peak memory consumption was 2.9 MB. Max. memory is 7.1 GB. [2019-01-18 15:07:24,490 INFO L168 Benchmark]: Boogie Preprocessor took 40.71 ms. Allocated memory is still 141.6 MB. Free memory was 105.7 MB in the beginning and 104.3 MB in the end (delta: 1.4 MB). Peak memory consumption was 1.4 MB. Max. memory is 7.1 GB. [2019-01-18 15:07:24,491 INFO L168 Benchmark]: RCFGBuilder took 1189.19 ms. Allocated memory is still 141.6 MB. Free memory was 104.3 MB in the beginning and 63.5 MB in the end (delta: 40.8 MB). Peak memory consumption was 40.8 MB. Max. memory is 7.1 GB. [2019-01-18 15:07:24,492 INFO L168 Benchmark]: Abstract Interpretation took 11536.55 ms. Allocated memory was 141.6 MB in the beginning and 231.7 MB in the end (delta: 90.2 MB). Free memory was 63.5 MB in the beginning and 99.6 MB in the end (delta: -36.1 MB). Peak memory consumption was 70.2 MB. Max. memory is 7.1 GB. [2019-01-18 15:07:24,497 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - GenericResult: Assertions are enabled Assertions are enabled - StatisticsResult: Toolchain Benchmarks Benchmark results are: * Boogie PL CUP Parser took 0.19 ms. Allocated memory is still 141.6 MB. Free memory is still 110.3 MB. There was no memory consumed. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 89.68 ms. Allocated memory is still 141.6 MB. Free memory was 108.6 MB in the beginning and 105.7 MB in the end (delta: 2.9 MB). Peak memory consumption was 2.9 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 40.71 ms. Allocated memory is still 141.6 MB. Free memory was 105.7 MB in the beginning and 104.3 MB in the end (delta: 1.4 MB). Peak memory consumption was 1.4 MB. Max. memory is 7.1 GB. * RCFGBuilder took 1189.19 ms. Allocated memory is still 141.6 MB. Free memory was 104.3 MB in the beginning and 63.5 MB in the end (delta: 40.8 MB). Peak memory consumption was 40.8 MB. Max. memory is 7.1 GB. * Abstract Interpretation took 11536.55 ms. Allocated memory was 141.6 MB in the beginning and 231.7 MB in the end (delta: 90.2 MB). Free memory was 63.5 MB in the beginning and 99.6 MB in the end (delta: -36.1 MB). Peak memory consumption was 70.2 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2: - UnprovableResult [Line: 73]: Unable to prove that assertion always holds Unable to prove that assertion always holds Reason: abstract domain could reach this error location. Possible FailurePath: [L86-L87] modifies #valid; [L86-L88] ensures old(#valid)[ptr] == 0; [L86-L89] ensures #valid == old(#valid)[ptr := 1]; [L86-L87] modifies #valid; [L86-L88] ensures old(#valid)[ptr] == 0; [L86-L89] ensures #valid == old(#valid)[ptr := 1]; [L86-L87] modifies #valid; [L86-L88] ensures old(#valid)[ptr] == 0; [L86-L89] ensures #valid == old(#valid)[ptr := 1]; [L86-L87] modifies #valid; [L86-L88] ensures old(#valid)[ptr] == 0; [L86-L89] ensures #valid == old(#valid)[ptr := 1]; [L86-L87] modifies #valid; [L86-L88] ensures old(#valid)[ptr] == 0; [L86-L89] ensures #valid == old(#valid)[ptr := 1]; [L86-L87] modifies #valid; [L86-L88] ensures old(#valid)[ptr] == 0; [L86-L89] ensures #valid == old(#valid)[ptr := 1]; [L86-L87] modifies #valid; [L86-L88] ensures old(#valid)[ptr] == 0; [L86-L89] ensures #valid == old(#valid)[ptr := 1]; [L86-L87] modifies #valid; [L86-L88] ensures old(#valid)[ptr] == 0; [L86-L89] ensures #valid == old(#valid)[ptr := 1]; [L86-L87] modifies #valid; [L86-L88] ensures old(#valid)[ptr] == 0; [L86-L89] ensures #valid == old(#valid)[ptr := 1]; [L86-L87] modifies #valid; [L86-L88] ensures old(#valid)[ptr] == 0; [L86-L89] ensures #valid == old(#valid)[ptr := 1]; [L28] assume p1 < p2; [L29] assume p2 < p3; [L30] assume p3 < p4; [L31] assume p4 < p5; [L32] assume p5 < p6; [L33] assume p6 < p7; [L34] assume p7 < p8; [L35] assume p8 < p9; [L36] assume p9 < p10; [L38] #memory_int[p1] := 0; [L39] #memory_int[p2] := 0; [L40] #memory_int[p3] := 0; [L41] #memory_int[p4] := 0; [L42] #memory_int[p5] := 0; [L43] #memory_int[p6] := 0; [L44] #memory_int[p7] := 0; [L45] #memory_int[p8] := 0; [L46] #memory_int[p9] := 0; [L47] #memory_int[p10] := 0; [L73] assert #memory_int[p1] >= 0; - UnprovableResult [Line: 74]: Unable to prove that assertion always holds Unable to prove that assertion always holds Reason: abstract domain could reach this error location. Possible FailurePath: [L86-L87] modifies #valid; [L86-L88] ensures old(#valid)[ptr] == 0; [L86-L89] ensures #valid == old(#valid)[ptr := 1]; [L86-L87] modifies #valid; [L86-L88] ensures old(#valid)[ptr] == 0; [L86-L89] ensures #valid == old(#valid)[ptr := 1]; [L86-L87] modifies #valid; [L86-L88] ensures old(#valid)[ptr] == 0; [L86-L89] ensures #valid == old(#valid)[ptr := 1]; [L86-L87] modifies #valid; [L86-L88] ensures old(#valid)[ptr] == 0; [L86-L89] ensures #valid == old(#valid)[ptr := 1]; [L86-L87] modifies #valid; [L86-L88] ensures old(#valid)[ptr] == 0; [L86-L89] ensures #valid == old(#valid)[ptr := 1]; [L86-L87] modifies #valid; [L86-L88] ensures old(#valid)[ptr] == 0; [L86-L89] ensures #valid == old(#valid)[ptr := 1]; [L86-L87] modifies #valid; [L86-L88] ensures old(#valid)[ptr] == 0; [L86-L89] ensures #valid == old(#valid)[ptr := 1]; [L86-L87] modifies #valid; [L86-L88] ensures old(#valid)[ptr] == 0; [L86-L89] ensures #valid == old(#valid)[ptr := 1]; [L86-L87] modifies #valid; [L86-L88] ensures old(#valid)[ptr] == 0; [L86-L89] ensures #valid == old(#valid)[ptr := 1]; [L86-L87] modifies #valid; [L86-L88] ensures old(#valid)[ptr] == 0; [L86-L89] ensures #valid == old(#valid)[ptr := 1]; [L28] assume p1 < p2; [L29] assume p2 < p3; [L30] assume p3 < p4; [L31] assume p4 < p5; [L32] assume p5 < p6; [L33] assume p6 < p7; [L34] assume p7 < p8; [L35] assume p8 < p9; [L36] assume p9 < p10; [L38] #memory_int[p1] := 0; [L39] #memory_int[p2] := 0; [L40] #memory_int[p3] := 0; [L41] #memory_int[p4] := 0; [L42] #memory_int[p5] := 0; [L43] #memory_int[p6] := 0; [L44] #memory_int[p7] := 0; [L45] #memory_int[p8] := 0; [L46] #memory_int[p9] := 0; [L47] #memory_int[p10] := 0; [L73] assert #memory_int[p1] >= 0; [L74] assert #memory_int[p2] <= 0; - UnprovableResult [Line: 75]: Unable to prove that assertion always holds Unable to prove that assertion always holds Reason: abstract domain could reach this error location. Possible FailurePath: [L86-L87] modifies #valid; [L86-L88] ensures old(#valid)[ptr] == 0; [L86-L89] ensures #valid == old(#valid)[ptr := 1]; [L86-L87] modifies #valid; [L86-L88] ensures old(#valid)[ptr] == 0; [L86-L89] ensures #valid == old(#valid)[ptr := 1]; [L86-L87] modifies #valid; [L86-L88] ensures old(#valid)[ptr] == 0; [L86-L89] ensures #valid == old(#valid)[ptr := 1]; [L86-L87] modifies #valid; [L86-L88] ensures old(#valid)[ptr] == 0; [L86-L89] ensures #valid == old(#valid)[ptr := 1]; [L86-L87] modifies #valid; [L86-L88] ensures old(#valid)[ptr] == 0; [L86-L89] ensures #valid == old(#valid)[ptr := 1]; [L86-L87] modifies #valid; [L86-L88] ensures old(#valid)[ptr] == 0; [L86-L89] ensures #valid == old(#valid)[ptr := 1]; [L86-L87] modifies #valid; [L86-L88] ensures old(#valid)[ptr] == 0; [L86-L89] ensures #valid == old(#valid)[ptr := 1]; [L86-L87] modifies #valid; [L86-L88] ensures old(#valid)[ptr] == 0; [L86-L89] ensures #valid == old(#valid)[ptr := 1]; [L86-L87] modifies #valid; [L86-L88] ensures old(#valid)[ptr] == 0; [L86-L89] ensures #valid == old(#valid)[ptr := 1]; [L86-L87] modifies #valid; [L86-L88] ensures old(#valid)[ptr] == 0; [L86-L89] ensures #valid == old(#valid)[ptr := 1]; [L28] assume p1 < p2; [L29] assume p2 < p3; [L30] assume p3 < p4; [L31] assume p4 < p5; [L32] assume p5 < p6; [L33] assume p6 < p7; [L34] assume p7 < p8; [L35] assume p8 < p9; [L36] assume p9 < p10; [L38] #memory_int[p1] := 0; [L39] #memory_int[p2] := 0; [L40] #memory_int[p3] := 0; [L41] #memory_int[p4] := 0; [L42] #memory_int[p5] := 0; [L43] #memory_int[p6] := 0; [L44] #memory_int[p7] := 0; [L45] #memory_int[p8] := 0; [L46] #memory_int[p9] := 0; [L47] #memory_int[p10] := 0; [L73] assert #memory_int[p1] >= 0; [L74] assert #memory_int[p2] <= 0; [L75] assert #memory_int[p3] >= 0; - UnprovableResult [Line: 76]: Unable to prove that assertion always holds Unable to prove that assertion always holds Reason: abstract domain could reach this error location. Possible FailurePath: [L86-L87] modifies #valid; [L86-L88] ensures old(#valid)[ptr] == 0; [L86-L89] ensures #valid == old(#valid)[ptr := 1]; [L86-L87] modifies #valid; [L86-L88] ensures old(#valid)[ptr] == 0; [L86-L89] ensures #valid == old(#valid)[ptr := 1]; [L86-L87] modifies #valid; [L86-L88] ensures old(#valid)[ptr] == 0; [L86-L89] ensures #valid == old(#valid)[ptr := 1]; [L86-L87] modifies #valid; [L86-L88] ensures old(#valid)[ptr] == 0; [L86-L89] ensures #valid == old(#valid)[ptr := 1]; [L86-L87] modifies #valid; [L86-L88] ensures old(#valid)[ptr] == 0; [L86-L89] ensures #valid == old(#valid)[ptr := 1]; [L86-L87] modifies #valid; [L86-L88] ensures old(#valid)[ptr] == 0; [L86-L89] ensures #valid == old(#valid)[ptr := 1]; [L86-L87] modifies #valid; [L86-L88] ensures old(#valid)[ptr] == 0; [L86-L89] ensures #valid == old(#valid)[ptr := 1]; [L86-L87] modifies #valid; [L86-L88] ensures old(#valid)[ptr] == 0; [L86-L89] ensures #valid == old(#valid)[ptr := 1]; [L86-L87] modifies #valid; [L86-L88] ensures old(#valid)[ptr] == 0; [L86-L89] ensures #valid == old(#valid)[ptr := 1]; [L86-L87] modifies #valid; [L86-L88] ensures old(#valid)[ptr] == 0; [L86-L89] ensures #valid == old(#valid)[ptr := 1]; [L28] assume p1 < p2; [L29] assume p2 < p3; [L30] assume p3 < p4; [L31] assume p4 < p5; [L32] assume p5 < p6; [L33] assume p6 < p7; [L34] assume p7 < p8; [L35] assume p8 < p9; [L36] assume p9 < p10; [L38] #memory_int[p1] := 0; [L39] #memory_int[p2] := 0; [L40] #memory_int[p3] := 0; [L41] #memory_int[p4] := 0; [L42] #memory_int[p5] := 0; [L43] #memory_int[p6] := 0; [L44] #memory_int[p7] := 0; [L45] #memory_int[p8] := 0; [L46] #memory_int[p9] := 0; [L47] #memory_int[p10] := 0; [L73] assert #memory_int[p1] >= 0; [L74] assert #memory_int[p2] <= 0; [L75] assert #memory_int[p3] >= 0; [L76] assert #memory_int[p4] <= 0; - UnprovableResult [Line: 77]: Unable to prove that assertion always holds Unable to prove that assertion always holds Reason: abstract domain could reach this error location. Possible FailurePath: [L86-L87] modifies #valid; [L86-L88] ensures old(#valid)[ptr] == 0; [L86-L89] ensures #valid == old(#valid)[ptr := 1]; [L86-L87] modifies #valid; [L86-L88] ensures old(#valid)[ptr] == 0; [L86-L89] ensures #valid == old(#valid)[ptr := 1]; [L86-L87] modifies #valid; [L86-L88] ensures old(#valid)[ptr] == 0; [L86-L89] ensures #valid == old(#valid)[ptr := 1]; [L86-L87] modifies #valid; [L86-L88] ensures old(#valid)[ptr] == 0; [L86-L89] ensures #valid == old(#valid)[ptr := 1]; [L86-L87] modifies #valid; [L86-L88] ensures old(#valid)[ptr] == 0; [L86-L89] ensures #valid == old(#valid)[ptr := 1]; [L86-L87] modifies #valid; [L86-L88] ensures old(#valid)[ptr] == 0; [L86-L89] ensures #valid == old(#valid)[ptr := 1]; [L86-L87] modifies #valid; [L86-L88] ensures old(#valid)[ptr] == 0; [L86-L89] ensures #valid == old(#valid)[ptr := 1]; [L86-L87] modifies #valid; [L86-L88] ensures old(#valid)[ptr] == 0; [L86-L89] ensures #valid == old(#valid)[ptr := 1]; [L86-L87] modifies #valid; [L86-L88] ensures old(#valid)[ptr] == 0; [L86-L89] ensures #valid == old(#valid)[ptr := 1]; [L86-L87] modifies #valid; [L86-L88] ensures old(#valid)[ptr] == 0; [L86-L89] ensures #valid == old(#valid)[ptr := 1]; [L28] assume p1 < p2; [L29] assume p2 < p3; [L30] assume p3 < p4; [L31] assume p4 < p5; [L32] assume p5 < p6; [L33] assume p6 < p7; [L34] assume p7 < p8; [L35] assume p8 < p9; [L36] assume p9 < p10; [L38] #memory_int[p1] := 0; [L39] #memory_int[p2] := 0; [L40] #memory_int[p3] := 0; [L41] #memory_int[p4] := 0; [L42] #memory_int[p5] := 0; [L43] #memory_int[p6] := 0; [L44] #memory_int[p7] := 0; [L45] #memory_int[p8] := 0; [L46] #memory_int[p9] := 0; [L47] #memory_int[p10] := 0; [L73] assert #memory_int[p1] >= 0; [L74] assert #memory_int[p2] <= 0; [L75] assert #memory_int[p3] >= 0; [L76] assert #memory_int[p4] <= 0; [L77] assert #memory_int[p5] >= 0; - UnprovableResult [Line: 78]: Unable to prove that assertion always holds Unable to prove that assertion always holds Reason: abstract domain could reach this error location. Possible FailurePath: [L86-L87] modifies #valid; [L86-L88] ensures old(#valid)[ptr] == 0; [L86-L89] ensures #valid == old(#valid)[ptr := 1]; [L86-L87] modifies #valid; [L86-L88] ensures old(#valid)[ptr] == 0; [L86-L89] ensures #valid == old(#valid)[ptr := 1]; [L86-L87] modifies #valid; [L86-L88] ensures old(#valid)[ptr] == 0; [L86-L89] ensures #valid == old(#valid)[ptr := 1]; [L86-L87] modifies #valid; [L86-L88] ensures old(#valid)[ptr] == 0; [L86-L89] ensures #valid == old(#valid)[ptr := 1]; [L86-L87] modifies #valid; [L86-L88] ensures old(#valid)[ptr] == 0; [L86-L89] ensures #valid == old(#valid)[ptr := 1]; [L86-L87] modifies #valid; [L86-L88] ensures old(#valid)[ptr] == 0; [L86-L89] ensures #valid == old(#valid)[ptr := 1]; [L86-L87] modifies #valid; [L86-L88] ensures old(#valid)[ptr] == 0; [L86-L89] ensures #valid == old(#valid)[ptr := 1]; [L86-L87] modifies #valid; [L86-L88] ensures old(#valid)[ptr] == 0; [L86-L89] ensures #valid == old(#valid)[ptr := 1]; [L86-L87] modifies #valid; [L86-L88] ensures old(#valid)[ptr] == 0; [L86-L89] ensures #valid == old(#valid)[ptr := 1]; [L86-L87] modifies #valid; [L86-L88] ensures old(#valid)[ptr] == 0; [L86-L89] ensures #valid == old(#valid)[ptr := 1]; [L28] assume p1 < p2; [L29] assume p2 < p3; [L30] assume p3 < p4; [L31] assume p4 < p5; [L32] assume p5 < p6; [L33] assume p6 < p7; [L34] assume p7 < p8; [L35] assume p8 < p9; [L36] assume p9 < p10; [L38] #memory_int[p1] := 0; [L39] #memory_int[p2] := 0; [L40] #memory_int[p3] := 0; [L41] #memory_int[p4] := 0; [L42] #memory_int[p5] := 0; [L43] #memory_int[p6] := 0; [L44] #memory_int[p7] := 0; [L45] #memory_int[p8] := 0; [L46] #memory_int[p9] := 0; [L47] #memory_int[p10] := 0; [L73] assert #memory_int[p1] >= 0; [L74] assert #memory_int[p2] <= 0; [L75] assert #memory_int[p3] >= 0; [L76] assert #memory_int[p4] <= 0; [L77] assert #memory_int[p5] >= 0; [L78] assert #memory_int[p6] <= 0; - UnprovableResult [Line: 79]: Unable to prove that assertion always holds Unable to prove that assertion always holds Reason: abstract domain could reach this error location. Possible FailurePath: [L86-L87] modifies #valid; [L86-L88] ensures old(#valid)[ptr] == 0; [L86-L89] ensures #valid == old(#valid)[ptr := 1]; [L86-L87] modifies #valid; [L86-L88] ensures old(#valid)[ptr] == 0; [L86-L89] ensures #valid == old(#valid)[ptr := 1]; [L86-L87] modifies #valid; [L86-L88] ensures old(#valid)[ptr] == 0; [L86-L89] ensures #valid == old(#valid)[ptr := 1]; [L86-L87] modifies #valid; [L86-L88] ensures old(#valid)[ptr] == 0; [L86-L89] ensures #valid == old(#valid)[ptr := 1]; [L86-L87] modifies #valid; [L86-L88] ensures old(#valid)[ptr] == 0; [L86-L89] ensures #valid == old(#valid)[ptr := 1]; [L86-L87] modifies #valid; [L86-L88] ensures old(#valid)[ptr] == 0; [L86-L89] ensures #valid == old(#valid)[ptr := 1]; [L86-L87] modifies #valid; [L86-L88] ensures old(#valid)[ptr] == 0; [L86-L89] ensures #valid == old(#valid)[ptr := 1]; [L86-L87] modifies #valid; [L86-L88] ensures old(#valid)[ptr] == 0; [L86-L89] ensures #valid == old(#valid)[ptr := 1]; [L86-L87] modifies #valid; [L86-L88] ensures old(#valid)[ptr] == 0; [L86-L89] ensures #valid == old(#valid)[ptr := 1]; [L86-L87] modifies #valid; [L86-L88] ensures old(#valid)[ptr] == 0; [L86-L89] ensures #valid == old(#valid)[ptr := 1]; [L28] assume p1 < p2; [L29] assume p2 < p3; [L30] assume p3 < p4; [L31] assume p4 < p5; [L32] assume p5 < p6; [L33] assume p6 < p7; [L34] assume p7 < p8; [L35] assume p8 < p9; [L36] assume p9 < p10; [L38] #memory_int[p1] := 0; [L39] #memory_int[p2] := 0; [L40] #memory_int[p3] := 0; [L41] #memory_int[p4] := 0; [L42] #memory_int[p5] := 0; [L43] #memory_int[p6] := 0; [L44] #memory_int[p7] := 0; [L45] #memory_int[p8] := 0; [L46] #memory_int[p9] := 0; [L47] #memory_int[p10] := 0; [L73] assert #memory_int[p1] >= 0; [L74] assert #memory_int[p2] <= 0; [L75] assert #memory_int[p3] >= 0; [L76] assert #memory_int[p4] <= 0; [L77] assert #memory_int[p5] >= 0; [L78] assert #memory_int[p6] <= 0; [L79] assert #memory_int[p7] >= 0; - UnprovableResult [Line: 80]: Unable to prove that assertion always holds Unable to prove that assertion always holds Reason: abstract domain could reach this error location. Possible FailurePath: [L86-L87] modifies #valid; [L86-L88] ensures old(#valid)[ptr] == 0; [L86-L89] ensures #valid == old(#valid)[ptr := 1]; [L86-L87] modifies #valid; [L86-L88] ensures old(#valid)[ptr] == 0; [L86-L89] ensures #valid == old(#valid)[ptr := 1]; [L86-L87] modifies #valid; [L86-L88] ensures old(#valid)[ptr] == 0; [L86-L89] ensures #valid == old(#valid)[ptr := 1]; [L86-L87] modifies #valid; [L86-L88] ensures old(#valid)[ptr] == 0; [L86-L89] ensures #valid == old(#valid)[ptr := 1]; [L86-L87] modifies #valid; [L86-L88] ensures old(#valid)[ptr] == 0; [L86-L89] ensures #valid == old(#valid)[ptr := 1]; [L86-L87] modifies #valid; [L86-L88] ensures old(#valid)[ptr] == 0; [L86-L89] ensures #valid == old(#valid)[ptr := 1]; [L86-L87] modifies #valid; [L86-L88] ensures old(#valid)[ptr] == 0; [L86-L89] ensures #valid == old(#valid)[ptr := 1]; [L86-L87] modifies #valid; [L86-L88] ensures old(#valid)[ptr] == 0; [L86-L89] ensures #valid == old(#valid)[ptr := 1]; [L86-L87] modifies #valid; [L86-L88] ensures old(#valid)[ptr] == 0; [L86-L89] ensures #valid == old(#valid)[ptr := 1]; [L86-L87] modifies #valid; [L86-L88] ensures old(#valid)[ptr] == 0; [L86-L89] ensures #valid == old(#valid)[ptr := 1]; [L28] assume p1 < p2; [L29] assume p2 < p3; [L30] assume p3 < p4; [L31] assume p4 < p5; [L32] assume p5 < p6; [L33] assume p6 < p7; [L34] assume p7 < p8; [L35] assume p8 < p9; [L36] assume p9 < p10; [L38] #memory_int[p1] := 0; [L39] #memory_int[p2] := 0; [L40] #memory_int[p3] := 0; [L41] #memory_int[p4] := 0; [L42] #memory_int[p5] := 0; [L43] #memory_int[p6] := 0; [L44] #memory_int[p7] := 0; [L45] #memory_int[p8] := 0; [L46] #memory_int[p9] := 0; [L47] #memory_int[p10] := 0; [L73] assert #memory_int[p1] >= 0; [L74] assert #memory_int[p2] <= 0; [L75] assert #memory_int[p3] >= 0; [L76] assert #memory_int[p4] <= 0; [L77] assert #memory_int[p5] >= 0; [L78] assert #memory_int[p6] <= 0; [L79] assert #memory_int[p7] >= 0; [L80] assert #memory_int[p8] <= 0; - UnprovableResult [Line: 81]: Unable to prove that assertion always holds Unable to prove that assertion always holds Reason: abstract domain could reach this error location. Possible FailurePath: [L86-L87] modifies #valid; [L86-L88] ensures old(#valid)[ptr] == 0; [L86-L89] ensures #valid == old(#valid)[ptr := 1]; [L86-L87] modifies #valid; [L86-L88] ensures old(#valid)[ptr] == 0; [L86-L89] ensures #valid == old(#valid)[ptr := 1]; [L86-L87] modifies #valid; [L86-L88] ensures old(#valid)[ptr] == 0; [L86-L89] ensures #valid == old(#valid)[ptr := 1]; [L86-L87] modifies #valid; [L86-L88] ensures old(#valid)[ptr] == 0; [L86-L89] ensures #valid == old(#valid)[ptr := 1]; [L86-L87] modifies #valid; [L86-L88] ensures old(#valid)[ptr] == 0; [L86-L89] ensures #valid == old(#valid)[ptr := 1]; [L86-L87] modifies #valid; [L86-L88] ensures old(#valid)[ptr] == 0; [L86-L89] ensures #valid == old(#valid)[ptr := 1]; [L86-L87] modifies #valid; [L86-L88] ensures old(#valid)[ptr] == 0; [L86-L89] ensures #valid == old(#valid)[ptr := 1]; [L86-L87] modifies #valid; [L86-L88] ensures old(#valid)[ptr] == 0; [L86-L89] ensures #valid == old(#valid)[ptr := 1]; [L86-L87] modifies #valid; [L86-L88] ensures old(#valid)[ptr] == 0; [L86-L89] ensures #valid == old(#valid)[ptr := 1]; [L86-L87] modifies #valid; [L86-L88] ensures old(#valid)[ptr] == 0; [L86-L89] ensures #valid == old(#valid)[ptr := 1]; [L28] assume p1 < p2; [L29] assume p2 < p3; [L30] assume p3 < p4; [L31] assume p4 < p5; [L32] assume p5 < p6; [L33] assume p6 < p7; [L34] assume p7 < p8; [L35] assume p8 < p9; [L36] assume p9 < p10; [L38] #memory_int[p1] := 0; [L39] #memory_int[p2] := 0; [L40] #memory_int[p3] := 0; [L41] #memory_int[p4] := 0; [L42] #memory_int[p5] := 0; [L43] #memory_int[p6] := 0; [L44] #memory_int[p7] := 0; [L45] #memory_int[p8] := 0; [L46] #memory_int[p9] := 0; [L47] #memory_int[p10] := 0; [L73] assert #memory_int[p1] >= 0; [L74] assert #memory_int[p2] <= 0; [L75] assert #memory_int[p3] >= 0; [L76] assert #memory_int[p4] <= 0; [L77] assert #memory_int[p5] >= 0; [L78] assert #memory_int[p6] <= 0; [L79] assert #memory_int[p7] >= 0; [L80] assert #memory_int[p8] <= 0; [L81] assert #memory_int[p9] >= 0; - UnprovableResult [Line: 82]: Unable to prove that assertion always holds Unable to prove that assertion always holds Reason: abstract domain could reach this error location. Possible FailurePath: [L86-L87] modifies #valid; [L86-L88] ensures old(#valid)[ptr] == 0; [L86-L89] ensures #valid == old(#valid)[ptr := 1]; [L86-L87] modifies #valid; [L86-L88] ensures old(#valid)[ptr] == 0; [L86-L89] ensures #valid == old(#valid)[ptr := 1]; [L86-L87] modifies #valid; [L86-L88] ensures old(#valid)[ptr] == 0; [L86-L89] ensures #valid == old(#valid)[ptr := 1]; [L86-L87] modifies #valid; [L86-L88] ensures old(#valid)[ptr] == 0; [L86-L89] ensures #valid == old(#valid)[ptr := 1]; [L86-L87] modifies #valid; [L86-L88] ensures old(#valid)[ptr] == 0; [L86-L89] ensures #valid == old(#valid)[ptr := 1]; [L86-L87] modifies #valid; [L86-L88] ensures old(#valid)[ptr] == 0; [L86-L89] ensures #valid == old(#valid)[ptr := 1]; [L86-L87] modifies #valid; [L86-L88] ensures old(#valid)[ptr] == 0; [L86-L89] ensures #valid == old(#valid)[ptr := 1]; [L86-L87] modifies #valid; [L86-L88] ensures old(#valid)[ptr] == 0; [L86-L89] ensures #valid == old(#valid)[ptr := 1]; [L86-L87] modifies #valid; [L86-L88] ensures old(#valid)[ptr] == 0; [L86-L89] ensures #valid == old(#valid)[ptr := 1]; [L86-L87] modifies #valid; [L86-L88] ensures old(#valid)[ptr] == 0; [L86-L89] ensures #valid == old(#valid)[ptr := 1]; [L28] assume p1 < p2; [L29] assume p2 < p3; [L30] assume p3 < p4; [L31] assume p4 < p5; [L32] assume p5 < p6; [L33] assume p6 < p7; [L34] assume p7 < p8; [L35] assume p8 < p9; [L36] assume p9 < p10; [L38] #memory_int[p1] := 0; [L39] #memory_int[p2] := 0; [L40] #memory_int[p3] := 0; [L41] #memory_int[p4] := 0; [L42] #memory_int[p5] := 0; [L43] #memory_int[p6] := 0; [L44] #memory_int[p7] := 0; [L45] #memory_int[p8] := 0; [L46] #memory_int[p9] := 0; [L47] #memory_int[p10] := 0; [L73] assert #memory_int[p1] >= 0; [L74] assert #memory_int[p2] <= 0; [L75] assert #memory_int[p3] >= 0; [L76] assert #memory_int[p4] <= 0; [L77] assert #memory_int[p5] >= 0; [L78] assert #memory_int[p6] <= 0; [L79] assert #memory_int[p7] >= 0; [L80] assert #memory_int[p8] <= 0; [L81] assert #memory_int[p9] >= 0; [L82] assert #memory_int[p10] <= 0; RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces Received shutdown request...