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-f57a05f [2019-01-07 19:05:40,223 INFO L170 SettingsManager]: Resetting all preferences to default values... [2019-01-07 19:05:40,225 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2019-01-07 19:05:40,241 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-01-07 19:05:40,241 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-01-07 19:05:40,242 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-01-07 19:05:40,244 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-01-07 19:05:40,245 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2019-01-07 19:05:40,247 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-01-07 19:05:40,248 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-01-07 19:05:40,249 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-01-07 19:05:40,249 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-01-07 19:05:40,250 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-01-07 19:05:40,251 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-01-07 19:05:40,252 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-01-07 19:05:40,253 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-01-07 19:05:40,254 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-01-07 19:05:40,256 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-01-07 19:05:40,258 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2019-01-07 19:05:40,260 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-01-07 19:05:40,262 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-01-07 19:05:40,263 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-01-07 19:05:40,266 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-01-07 19:05:40,266 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-01-07 19:05:40,267 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-01-07 19:05:40,268 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-01-07 19:05:40,269 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-01-07 19:05:40,274 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-01-07 19:05:40,275 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2019-01-07 19:05:40,276 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-01-07 19:05:40,277 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2019-01-07 19:05:40,277 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-01-07 19:05:40,278 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-01-07 19:05:40,278 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2019-01-07 19:05:40,279 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2019-01-07 19:05:40,279 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2019-01-07 19:05:40,280 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-07 19:05:40,293 INFO L110 SettingsManager]: Loading preferences was successful [2019-01-07 19:05:40,293 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2019-01-07 19:05:40,294 INFO L131 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2019-01-07 19:05:40,294 INFO L133 SettingsManager]: * Show backtranslation warnings=false [2019-01-07 19:05:40,295 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2019-01-07 19:05:40,295 INFO L133 SettingsManager]: * User list type=DISABLED [2019-01-07 19:05:40,295 INFO L133 SettingsManager]: * Inline calls to unimplemented procedures=true [2019-01-07 19:05:40,295 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2019-01-07 19:05:40,295 INFO L133 SettingsManager]: * Explicit value domain=true [2019-01-07 19:05:40,296 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2019-01-07 19:05:40,296 INFO L133 SettingsManager]: * Octagon Domain=false [2019-01-07 19:05:40,296 INFO L133 SettingsManager]: * Abstract domain=ArrayDomain [2019-01-07 19:05:40,296 INFO L133 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2019-01-07 19:05:40,296 INFO L133 SettingsManager]: * Interval Domain=false [2019-01-07 19:05:40,297 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-01-07 19:05:40,297 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2019-01-07 19:05:40,298 INFO L133 SettingsManager]: * Use SBE=true [2019-01-07 19:05:40,298 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-01-07 19:05:40,298 INFO L133 SettingsManager]: * sizeof long=4 [2019-01-07 19:05:40,298 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2019-01-07 19:05:40,299 INFO L133 SettingsManager]: * sizeof POINTER=4 [2019-01-07 19:05:40,299 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2019-01-07 19:05:40,299 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-01-07 19:05:40,299 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-01-07 19:05:40,300 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-01-07 19:05:40,300 INFO L133 SettingsManager]: * sizeof long double=12 [2019-01-07 19:05:40,300 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2019-01-07 19:05:40,300 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-01-07 19:05:40,301 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-01-07 19:05:40,301 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-01-07 19:05:40,301 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2019-01-07 19:05:40,301 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-01-07 19:05:40,302 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-01-07 19:05:40,302 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-01-07 19:05:40,302 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-01-07 19:05:40,302 INFO L133 SettingsManager]: * Trace refinement strategy=TAIPAN [2019-01-07 19:05:40,303 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-01-07 19:05:40,303 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-01-07 19:05:40,303 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-01-07 19:05:40,303 INFO L133 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2019-01-07 19:05:40,336 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-01-07 19:05:40,351 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-01-07 19:05:40,354 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-01-07 19:05:40,356 INFO L271 PluginConnector]: Initializing Boogie PL CUP Parser... [2019-01-07 19:05:40,357 INFO L276 PluginConnector]: Boogie PL CUP Parser initialized [2019-01-07 19:05:40,357 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-07 19:05:40,358 INFO L111 BoogieParser]: Parsing: '/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/heapseparator/speedup-poc-dd-10-limited.bpl' [2019-01-07 19:05:40,413 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-01-07 19:05:40,415 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-01-07 19:05:40,416 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-01-07 19:05:40,416 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-01-07 19:05:40,416 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2019-01-07 19:05:40,436 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 07.01 07:05:40" (1/1) ... [2019-01-07 19:05:40,451 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 07.01 07:05:40" (1/1) ... [2019-01-07 19:05:40,499 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-01-07 19:05:40,500 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-01-07 19:05:40,501 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-01-07 19:05:40,501 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2019-01-07 19:05:40,513 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 07.01 07:05:40" (1/1) ... [2019-01-07 19:05:40,514 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 07.01 07:05:40" (1/1) ... [2019-01-07 19:05:40,518 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 07.01 07:05:40" (1/1) ... [2019-01-07 19:05:40,518 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 07.01 07:05:40" (1/1) ... [2019-01-07 19:05:40,529 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 07.01 07:05:40" (1/1) ... [2019-01-07 19:05:40,538 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 07.01 07:05:40" (1/1) ... [2019-01-07 19:05:40,540 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 07.01 07:05:40" (1/1) ... [2019-01-07 19:05:40,546 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-01-07 19:05:40,547 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-01-07 19:05:40,547 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-01-07 19:05:40,547 INFO L276 PluginConnector]: RCFGBuilder initialized [2019-01-07 19:05:40,548 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 07.01 07:05:40" (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-07 19:05:40,610 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-01-07 19:05:40,611 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-01-07 19:05:42,209 INFO L281 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-01-07 19:05:42,209 INFO L286 CfgBuilder]: Removed 23 assue(true) statements. [2019-01-07 19:05:42,210 INFO L202 PluginConnector]: Adding new model speedup-poc-dd-10-limited.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.01 07:05:42 BoogieIcfgContainer [2019-01-07 19:05:42,211 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-01-07 19:05:42,211 INFO L113 PluginConnector]: ------------------------Abstract Interpretation---------------------------- [2019-01-07 19:05:42,211 INFO L271 PluginConnector]: Initializing Abstract Interpretation... [2019-01-07 19:05:42,212 INFO L276 PluginConnector]: Abstract Interpretation initialized [2019-01-07 19:05:42,213 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 07.01 07:05:42" (1/1) ... [2019-01-07 19:05:42,250 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-07 19:05:48,056 WARN L212 ngHoareTripleChecker]: Soundness check inconclusive for the following hoare triple [2019-01-07 19:05:48,057 WARN L217 ngHoareTripleChecker]: Expected: VALID Actual: UNKNOWN [2019-01-07 19:05:48,057 WARN L219 ngHoareTripleChecker]: Solver was "Z3" in version "4.8.3" [2019-01-07 19:05:48,058 WARN L223 ngHoareTripleChecker]: -- [2019-01-07 19:05:48,059 WARN L224 ngHoareTripleChecker]: Pre: {2147483623#(forall ((v_idx_191 Int) (v_idx_192 Int) (v_idx_195 Int) (v_idx_196 Int) (v_idx_193 Int) (v_idx_194 Int) (v_idx_199 Int) (v_idx_197 Int) (v_idx_198 Int)) (exists ((v_v_102_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) (v_b_78_1 Int) (v_v_134_1 Int) (v_v_132_1 Int) (v_b_79_1 Int)) (and (or (= (select |c_#memory_int| v_idx_192) v_v_132_1) (<= v_b_78_1 v_idx_192)) (= v_v_96_1 (select |c_ULTIMATE.start_malloc_old_#valid| v_idx_195)) (or (= v_v_104_1 (select |c_#valid| v_idx_199)) (< v_idx_199 v_b_59_1)) (or (<= v_b_79_1 v_idx_193) (< v_idx_193 v_b_78_1) (= (select |c_#memory_int| v_idx_193) 0)) (or (< v_idx_198 v_b_58_1) (<= v_b_59_1 v_idx_198) (= 1 (select |c_#valid| v_idx_198))) (= (select |c_old(#memory_int)| v_idx_191) v_v_4_1) (= v_v_2_1 (select |c_old(#valid)| v_idx_196)) (or (= v_v_102_1 (select |c_#valid| v_idx_197)) (<= v_b_58_1 v_idx_197)) (or (= v_v_134_1 (select |c_#memory_int| v_idx_194)) (< v_idx_194 v_b_79_1)))))} [2019-01-07 19:05:48,062 WARN L228 ngHoareTripleChecker]: Action: #memory_int := #memory_int[main_p7 := #memory_int[main_p7] + 1]; [2019-01-07 19:05:48,063 WARN L184 hOps$ForEachOp$OfRef]: ActionStr: (= |c_#memory_int_primed| (store |c_#memory_int| c_ULTIMATE.start_main_p7 (+ (select |c_#memory_int| c_ULTIMATE.start_main_p7) 1))) [2019-01-07 19:05:48,063 WARN L230 ngHoareTripleChecker]: Post: {2147483622#(forall ((v_idx_203 Int) (v_idx_204 Int) (v_idx_201 Int) (v_idx_202 Int) (v_idx_205 Int) (v_idx_206 Int) (v_idx_200 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_305_1 Int)) (and (or (= v_v_102_1 (select |c_#valid| v_idx_204)) (<= v_b_58_1 v_idx_204)) (or (< v_idx_206 v_b_59_1) (= v_v_104_1 (select |c_#valid| v_idx_206))) (or (<= v_b_59_1 v_idx_205) (< v_idx_205 v_b_58_1) (= 1 (select |c_#valid| v_idx_205))) (= v_v_2_1 (select |c_old(#valid)| v_idx_203)) (= v_v_96_1 (select |c_ULTIMATE.start_malloc_old_#valid| v_idx_202)) (= v_v_4_1 (select |c_old(#memory_int)| v_idx_200)) (= v_v_305_1 (select |c_#memory_int| v_idx_201)))))} [2019-01-07 19:05:48,063 WARN L263 ngHoareTripleChecker]: unsat core / model generation is disabled, enable it to get more details [2019-01-07 19:05:48,412 WARN L268 ngHoareTripleChecker]: -- [2019-01-07 19:05:48,412 WARN L269 ngHoareTripleChecker]: Simplified triple [2019-01-07 19:05:48,905 WARN L270 ngHoareTripleChecker]: Pre: {2147483623#true} [2019-01-07 19:05:48,906 WARN L274 ngHoareTripleChecker]: Action: #memory_int := #memory_int[main_p7 := #memory_int[main_p7] + 1]; [2019-01-07 19:05:48,907 WARN L184 hOps$ForEachOp$OfRef]: ActionStr: (= |c_#memory_int_primed| (store |c_#memory_int| c_ULTIMATE.start_main_p7 (+ (select |c_#memory_int| c_ULTIMATE.start_main_p7) 1))) [2019-01-07 19:05:49,180 WARN L276 ngHoareTripleChecker]: Post: {2147483622#true} [2019-01-07 19:05:52,257 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-07 19:05:52,299 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-07 19:05:52,301 INFO L132 PluginConnector]: ------------------------ END Abstract Interpretation---------------------------- [2019-01-07 19:05:52,303 INFO L168 Benchmark]: Toolchain (without parser) took 11889.01 ms. Allocated memory is still 1.5 GB. Free memory was 1.5 GB in the beginning and 1.1 GB in the end (delta: 383.3 MB). Peak memory consumption was 383.3 MB. Max. memory is 7.1 GB. [2019-01-07 19:05:52,305 INFO L168 Benchmark]: Boogie PL CUP Parser took 0.20 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. [2019-01-07 19:05:52,306 INFO L168 Benchmark]: Boogie Procedure Inliner took 84.06 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. [2019-01-07 19:05:52,307 INFO L168 Benchmark]: Boogie Preprocessor took 46.16 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. [2019-01-07 19:05:52,308 INFO L168 Benchmark]: RCFGBuilder took 1663.79 ms. Allocated memory is still 1.5 GB. Free memory was 1.5 GB in the beginning and 1.4 GB in the end (delta: 52.9 MB). Peak memory consumption was 52.9 MB. Max. memory is 7.1 GB. [2019-01-07 19:05:52,309 INFO L168 Benchmark]: Abstract Interpretation took 10089.92 ms. Allocated memory is still 1.5 GB. Free memory was 1.4 GB in the beginning and 1.1 GB in the end (delta: 330.4 MB). Peak memory consumption was 330.4 MB. Max. memory is 7.1 GB. [2019-01-07 19:05:52,314 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.20 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 84.06 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. * Boogie Preprocessor took 46.16 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. * RCFGBuilder took 1663.79 ms. Allocated memory is still 1.5 GB. Free memory was 1.5 GB in the beginning and 1.4 GB in the end (delta: 52.9 MB). Peak memory consumption was 52.9 MB. Max. memory is 7.1 GB. * Abstract Interpretation took 10089.92 ms. Allocated memory is still 1.5 GB. Free memory was 1.4 GB in the beginning and 1.1 GB in the end (delta: 330.4 MB). Peak memory consumption was 330.4 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...