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_oct.epf -i ../../../trunk/examples/programs/heapseparator/speedup-poc-dd-8-unlimited.bpl -------------------------------------------------------------------------------- This is Ultimate 0.1.24-1de736e-m [2019-02-14 18:02:34,147 INFO L170 SettingsManager]: Resetting all preferences to default values... [2019-02-14 18:02:34,149 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2019-02-14 18:02:34,161 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-02-14 18:02:34,161 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-02-14 18:02:34,162 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-02-14 18:02:34,163 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-02-14 18:02:34,165 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2019-02-14 18:02:34,167 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-02-14 18:02:34,168 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-02-14 18:02:34,169 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-02-14 18:02:34,169 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-02-14 18:02:34,170 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-02-14 18:02:34,171 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-02-14 18:02:34,172 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-02-14 18:02:34,173 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-02-14 18:02:34,174 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-02-14 18:02:34,176 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-02-14 18:02:34,178 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2019-02-14 18:02:34,179 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-02-14 18:02:34,180 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-02-14 18:02:34,181 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-02-14 18:02:34,184 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-02-14 18:02:34,184 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-02-14 18:02:34,185 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-02-14 18:02:34,186 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-02-14 18:02:34,187 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-02-14 18:02:34,187 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-02-14 18:02:34,188 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2019-02-14 18:02:34,189 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-02-14 18:02:34,190 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2019-02-14 18:02:34,190 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-02-14 18:02:34,191 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-02-14 18:02:34,191 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2019-02-14 18:02:34,192 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2019-02-14 18:02:34,193 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2019-02-14 18:02:34,193 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/ai/array-bench/reach_32bit_array_oct.epf [2019-02-14 18:02:34,206 INFO L110 SettingsManager]: Loading preferences was successful [2019-02-14 18:02:34,206 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2019-02-14 18:02:34,207 INFO L131 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2019-02-14 18:02:34,207 INFO L133 SettingsManager]: * Show backtranslation warnings=false [2019-02-14 18:02:34,207 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2019-02-14 18:02:34,207 INFO L133 SettingsManager]: * User list type=DISABLED [2019-02-14 18:02:34,208 INFO L133 SettingsManager]: * Inline calls to unimplemented procedures=true [2019-02-14 18:02:34,208 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2019-02-14 18:02:34,208 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2019-02-14 18:02:34,208 INFO L133 SettingsManager]: * Underlying domain=OctagonDomain [2019-02-14 18:02:34,208 INFO L133 SettingsManager]: * Abstract domain=ArrayDomain [2019-02-14 18:02:34,209 INFO L133 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2019-02-14 18:02:34,209 INFO L133 SettingsManager]: * Interval Domain=false [2019-02-14 18:02:34,209 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-02-14 18:02:34,210 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2019-02-14 18:02:34,210 INFO L133 SettingsManager]: * Use SBE=true [2019-02-14 18:02:34,210 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-02-14 18:02:34,210 INFO L133 SettingsManager]: * sizeof long=4 [2019-02-14 18:02:34,210 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2019-02-14 18:02:34,211 INFO L133 SettingsManager]: * sizeof POINTER=4 [2019-02-14 18:02:34,211 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2019-02-14 18:02:34,211 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-02-14 18:02:34,211 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-02-14 18:02:34,211 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-02-14 18:02:34,211 INFO L133 SettingsManager]: * sizeof long double=12 [2019-02-14 18:02:34,212 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2019-02-14 18:02:34,212 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-02-14 18:02:34,212 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-02-14 18:02:34,212 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-02-14 18:02:34,212 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2019-02-14 18:02:34,213 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-02-14 18:02:34,213 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-02-14 18:02:34,213 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-02-14 18:02:34,213 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-02-14 18:02:34,213 INFO L133 SettingsManager]: * Trace refinement strategy=TAIPAN [2019-02-14 18:02:34,214 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-02-14 18:02:34,214 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-02-14 18:02:34,214 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-02-14 18:02:34,214 INFO L133 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2019-02-14 18:02:34,243 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-02-14 18:02:34,255 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-02-14 18:02:34,258 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-02-14 18:02:34,260 INFO L271 PluginConnector]: Initializing Boogie PL CUP Parser... [2019-02-14 18:02:34,260 INFO L276 PluginConnector]: Boogie PL CUP Parser initialized [2019-02-14 18:02:34,261 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/heapseparator/speedup-poc-dd-8-unlimited.bpl [2019-02-14 18:02:34,261 INFO L111 BoogieParser]: Parsing: '/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/heapseparator/speedup-poc-dd-8-unlimited.bpl' [2019-02-14 18:02:34,303 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-02-14 18:02:34,305 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-02-14 18:02:34,306 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-02-14 18:02:34,306 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-02-14 18:02:34,306 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2019-02-14 18:02:34,322 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "speedup-poc-dd-8-unlimited.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 14.02 06:02:34" (1/1) ... [2019-02-14 18:02:34,335 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "speedup-poc-dd-8-unlimited.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 14.02 06:02:34" (1/1) ... [2019-02-14 18:02:34,365 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-02-14 18:02:34,366 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-02-14 18:02:34,367 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-02-14 18:02:34,367 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2019-02-14 18:02:34,377 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "speedup-poc-dd-8-unlimited.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 14.02 06:02:34" (1/1) ... [2019-02-14 18:02:34,378 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "speedup-poc-dd-8-unlimited.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 14.02 06:02:34" (1/1) ... [2019-02-14 18:02:34,380 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "speedup-poc-dd-8-unlimited.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 14.02 06:02:34" (1/1) ... [2019-02-14 18:02:34,380 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "speedup-poc-dd-8-unlimited.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 14.02 06:02:34" (1/1) ... [2019-02-14 18:02:34,385 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "speedup-poc-dd-8-unlimited.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 14.02 06:02:34" (1/1) ... [2019-02-14 18:02:34,389 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "speedup-poc-dd-8-unlimited.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 14.02 06:02:34" (1/1) ... [2019-02-14 18:02:34,390 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "speedup-poc-dd-8-unlimited.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 14.02 06:02:34" (1/1) ... [2019-02-14 18:02:34,392 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-02-14 18:02:34,392 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-02-14 18:02:34,393 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-02-14 18:02:34,393 INFO L276 PluginConnector]: RCFGBuilder initialized [2019-02-14 18:02:34,394 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "speedup-poc-dd-8-unlimited.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 14.02 06:02:34" (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-02-14 18:02:34,458 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-02-14 18:02:34,458 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-02-14 18:02:35,452 INFO L281 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-02-14 18:02:35,452 INFO L286 CfgBuilder]: Removed 19 assue(true) statements. [2019-02-14 18:02:35,453 INFO L202 PluginConnector]: Adding new model speedup-poc-dd-8-unlimited.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.02 06:02:35 BoogieIcfgContainer [2019-02-14 18:02:35,454 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-02-14 18:02:35,455 INFO L113 PluginConnector]: ------------------------Abstract Interpretation---------------------------- [2019-02-14 18:02:35,455 INFO L271 PluginConnector]: Initializing Abstract Interpretation... [2019-02-14 18:02:35,455 INFO L276 PluginConnector]: Abstract Interpretation initialized [2019-02-14 18:02:35,456 INFO L185 PluginConnector]: Executing the observer AbstractInterpretationRcfgObserver from plugin Abstract Interpretation for "speedup-poc-dd-8-unlimited.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.02 06:02:35" (1/1) ... [2019-02-14 18:02:35,507 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2019-02-14 18:03:13,330 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-02-14 18:03:13,362 INFO L272 AbstractInterpreter]: Visited 26 different actions 46 times. Merged at 2 different actions 2 times. Never widened. Found 26 fixpoints after 10 different actions. Largest state had 0 variables. [2019-02-14 18:03:13,364 INFO L132 PluginConnector]: ------------------------ END Abstract Interpretation---------------------------- [2019-02-14 18:03:13,366 INFO L168 Benchmark]: Toolchain (without parser) took 39062.00 ms. Allocated memory was 141.0 MB in the beginning and 541.6 MB in the end (delta: 400.6 MB). Free memory was 108.4 MB in the beginning and 103.6 MB in the end (delta: 4.8 MB). Peak memory consumption was 453.6 MB. Max. memory is 7.1 GB. [2019-02-14 18:03:13,368 INFO L168 Benchmark]: Boogie PL CUP Parser took 0.19 ms. Allocated memory is still 141.0 MB. Free memory is still 109.9 MB. There was no memory consumed. Max. memory is 7.1 GB. [2019-02-14 18:03:13,369 INFO L168 Benchmark]: Boogie Procedure Inliner took 60.44 ms. Allocated memory is still 141.0 MB. Free memory was 108.2 MB in the beginning and 105.7 MB in the end (delta: 2.4 MB). Peak memory consumption was 2.4 MB. Max. memory is 7.1 GB. [2019-02-14 18:03:13,370 INFO L168 Benchmark]: Boogie Preprocessor took 25.63 ms. Allocated memory is still 141.0 MB. Free memory was 105.7 MB in the beginning and 104.2 MB in the end (delta: 1.5 MB). Peak memory consumption was 1.5 MB. Max. memory is 7.1 GB. [2019-02-14 18:03:13,371 INFO L168 Benchmark]: RCFGBuilder took 1061.33 ms. Allocated memory is still 141.0 MB. Free memory was 104.2 MB in the beginning and 74.4 MB in the end (delta: 29.8 MB). Peak memory consumption was 29.8 MB. Max. memory is 7.1 GB. [2019-02-14 18:03:13,372 INFO L168 Benchmark]: Abstract Interpretation took 37910.14 ms. Allocated memory was 141.0 MB in the beginning and 541.6 MB in the end (delta: 400.6 MB). Free memory was 74.2 MB in the beginning and 103.6 MB in the end (delta: -29.4 MB). Peak memory consumption was 419.4 MB. Max. memory is 7.1 GB. [2019-02-14 18:03:13,379 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.0 MB. Free memory is still 109.9 MB. There was no memory consumed. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 60.44 ms. Allocated memory is still 141.0 MB. Free memory was 108.2 MB in the beginning and 105.7 MB in the end (delta: 2.4 MB). Peak memory consumption was 2.4 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 25.63 ms. Allocated memory is still 141.0 MB. Free memory was 105.7 MB in the beginning and 104.2 MB in the end (delta: 1.5 MB). Peak memory consumption was 1.5 MB. Max. memory is 7.1 GB. * RCFGBuilder took 1061.33 ms. Allocated memory is still 141.0 MB. Free memory was 104.2 MB in the beginning and 74.4 MB in the end (delta: 29.8 MB). Peak memory consumption was 29.8 MB. Max. memory is 7.1 GB. * Abstract Interpretation took 37910.14 ms. Allocated memory was 141.0 MB in the beginning and 541.6 MB in the end (delta: 400.6 MB). Free memory was 74.2 MB in the beginning and 103.6 MB in the end (delta: -29.4 MB). Peak memory consumption was 419.4 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2: - UnprovableResult [Line: 55]: Unable to prove that assertion always holds Unable to prove that assertion always holds Reason: abstract domain could reach this error location. Possible FailurePath: [L66-L67] modifies #valid; [L66-L68] ensures old(#valid)[ptr] == 0; [L66-L69] ensures #valid == old(#valid)[ptr := 1]; [L66-L67] modifies #valid; [L66-L68] ensures old(#valid)[ptr] == 0; [L66-L69] ensures #valid == old(#valid)[ptr := 1]; [L66-L67] modifies #valid; [L66-L68] ensures old(#valid)[ptr] == 0; [L66-L69] ensures #valid == old(#valid)[ptr := 1]; [L66-L67] modifies #valid; [L66-L68] ensures old(#valid)[ptr] == 0; [L66-L69] ensures #valid == old(#valid)[ptr := 1]; [L66-L67] modifies #valid; [L66-L68] ensures old(#valid)[ptr] == 0; [L66-L69] ensures #valid == old(#valid)[ptr := 1]; [L66-L67] modifies #valid; [L66-L68] ensures old(#valid)[ptr] == 0; [L66-L69] ensures #valid == old(#valid)[ptr := 1]; [L66-L67] modifies #valid; [L66-L68] ensures old(#valid)[ptr] == 0; [L66-L69] ensures #valid == old(#valid)[ptr := 1]; [L66-L67] modifies #valid; [L66-L68] ensures old(#valid)[ptr] == 0; [L66-L69] ensures #valid == old(#valid)[ptr := 1]; [L26] #memory_int[p1] := 0; [L27] #memory_int[p2] := 0; [L28] #memory_int[p3] := 0; [L29] #memory_int[p4] := 0; [L30] #memory_int[p5] := 0; [L31] #memory_int[p6] := 0; [L32] #memory_int[p7] := 0; [L33] #memory_int[p8] := 0; [L55] assert #memory_int[p1] >= 0; - UnprovableResult [Line: 56]: Unable to prove that assertion always holds Unable to prove that assertion always holds Reason: abstract domain could reach this error location. Possible FailurePath: [L66-L67] modifies #valid; [L66-L68] ensures old(#valid)[ptr] == 0; [L66-L69] ensures #valid == old(#valid)[ptr := 1]; [L66-L67] modifies #valid; [L66-L68] ensures old(#valid)[ptr] == 0; [L66-L69] ensures #valid == old(#valid)[ptr := 1]; [L66-L67] modifies #valid; [L66-L68] ensures old(#valid)[ptr] == 0; [L66-L69] ensures #valid == old(#valid)[ptr := 1]; [L66-L67] modifies #valid; [L66-L68] ensures old(#valid)[ptr] == 0; [L66-L69] ensures #valid == old(#valid)[ptr := 1]; [L66-L67] modifies #valid; [L66-L68] ensures old(#valid)[ptr] == 0; [L66-L69] ensures #valid == old(#valid)[ptr := 1]; [L66-L67] modifies #valid; [L66-L68] ensures old(#valid)[ptr] == 0; [L66-L69] ensures #valid == old(#valid)[ptr := 1]; [L66-L67] modifies #valid; [L66-L68] ensures old(#valid)[ptr] == 0; [L66-L69] ensures #valid == old(#valid)[ptr := 1]; [L66-L67] modifies #valid; [L66-L68] ensures old(#valid)[ptr] == 0; [L66-L69] ensures #valid == old(#valid)[ptr := 1]; [L26] #memory_int[p1] := 0; [L27] #memory_int[p2] := 0; [L28] #memory_int[p3] := 0; [L29] #memory_int[p4] := 0; [L30] #memory_int[p5] := 0; [L31] #memory_int[p6] := 0; [L32] #memory_int[p7] := 0; [L33] #memory_int[p8] := 0; [L55] assert #memory_int[p1] >= 0; [L56] assert #memory_int[p2] <= 0; - UnprovableResult [Line: 57]: Unable to prove that assertion always holds Unable to prove that assertion always holds Reason: abstract domain could reach this error location. Possible FailurePath: [L66-L67] modifies #valid; [L66-L68] ensures old(#valid)[ptr] == 0; [L66-L69] ensures #valid == old(#valid)[ptr := 1]; [L66-L67] modifies #valid; [L66-L68] ensures old(#valid)[ptr] == 0; [L66-L69] ensures #valid == old(#valid)[ptr := 1]; [L66-L67] modifies #valid; [L66-L68] ensures old(#valid)[ptr] == 0; [L66-L69] ensures #valid == old(#valid)[ptr := 1]; [L66-L67] modifies #valid; [L66-L68] ensures old(#valid)[ptr] == 0; [L66-L69] ensures #valid == old(#valid)[ptr := 1]; [L66-L67] modifies #valid; [L66-L68] ensures old(#valid)[ptr] == 0; [L66-L69] ensures #valid == old(#valid)[ptr := 1]; [L66-L67] modifies #valid; [L66-L68] ensures old(#valid)[ptr] == 0; [L66-L69] ensures #valid == old(#valid)[ptr := 1]; [L66-L67] modifies #valid; [L66-L68] ensures old(#valid)[ptr] == 0; [L66-L69] ensures #valid == old(#valid)[ptr := 1]; [L66-L67] modifies #valid; [L66-L68] ensures old(#valid)[ptr] == 0; [L66-L69] ensures #valid == old(#valid)[ptr := 1]; [L26] #memory_int[p1] := 0; [L27] #memory_int[p2] := 0; [L28] #memory_int[p3] := 0; [L29] #memory_int[p4] := 0; [L30] #memory_int[p5] := 0; [L31] #memory_int[p6] := 0; [L32] #memory_int[p7] := 0; [L33] #memory_int[p8] := 0; [L55] assert #memory_int[p1] >= 0; [L56] assert #memory_int[p2] <= 0; [L57] assert #memory_int[p3] >= 0; - UnprovableResult [Line: 58]: Unable to prove that assertion always holds Unable to prove that assertion always holds Reason: abstract domain could reach this error location. Possible FailurePath: [L66-L67] modifies #valid; [L66-L68] ensures old(#valid)[ptr] == 0; [L66-L69] ensures #valid == old(#valid)[ptr := 1]; [L66-L67] modifies #valid; [L66-L68] ensures old(#valid)[ptr] == 0; [L66-L69] ensures #valid == old(#valid)[ptr := 1]; [L66-L67] modifies #valid; [L66-L68] ensures old(#valid)[ptr] == 0; [L66-L69] ensures #valid == old(#valid)[ptr := 1]; [L66-L67] modifies #valid; [L66-L68] ensures old(#valid)[ptr] == 0; [L66-L69] ensures #valid == old(#valid)[ptr := 1]; [L66-L67] modifies #valid; [L66-L68] ensures old(#valid)[ptr] == 0; [L66-L69] ensures #valid == old(#valid)[ptr := 1]; [L66-L67] modifies #valid; [L66-L68] ensures old(#valid)[ptr] == 0; [L66-L69] ensures #valid == old(#valid)[ptr := 1]; [L66-L67] modifies #valid; [L66-L68] ensures old(#valid)[ptr] == 0; [L66-L69] ensures #valid == old(#valid)[ptr := 1]; [L66-L67] modifies #valid; [L66-L68] ensures old(#valid)[ptr] == 0; [L66-L69] ensures #valid == old(#valid)[ptr := 1]; [L26] #memory_int[p1] := 0; [L27] #memory_int[p2] := 0; [L28] #memory_int[p3] := 0; [L29] #memory_int[p4] := 0; [L30] #memory_int[p5] := 0; [L31] #memory_int[p6] := 0; [L32] #memory_int[p7] := 0; [L33] #memory_int[p8] := 0; [L55] assert #memory_int[p1] >= 0; [L56] assert #memory_int[p2] <= 0; [L57] assert #memory_int[p3] >= 0; [L58] assert #memory_int[p4] <= 0; - UnprovableResult [Line: 59]: Unable to prove that assertion always holds Unable to prove that assertion always holds Reason: abstract domain could reach this error location. Possible FailurePath: [L66-L67] modifies #valid; [L66-L68] ensures old(#valid)[ptr] == 0; [L66-L69] ensures #valid == old(#valid)[ptr := 1]; [L66-L67] modifies #valid; [L66-L68] ensures old(#valid)[ptr] == 0; [L66-L69] ensures #valid == old(#valid)[ptr := 1]; [L66-L67] modifies #valid; [L66-L68] ensures old(#valid)[ptr] == 0; [L66-L69] ensures #valid == old(#valid)[ptr := 1]; [L66-L67] modifies #valid; [L66-L68] ensures old(#valid)[ptr] == 0; [L66-L69] ensures #valid == old(#valid)[ptr := 1]; [L66-L67] modifies #valid; [L66-L68] ensures old(#valid)[ptr] == 0; [L66-L69] ensures #valid == old(#valid)[ptr := 1]; [L66-L67] modifies #valid; [L66-L68] ensures old(#valid)[ptr] == 0; [L66-L69] ensures #valid == old(#valid)[ptr := 1]; [L66-L67] modifies #valid; [L66-L68] ensures old(#valid)[ptr] == 0; [L66-L69] ensures #valid == old(#valid)[ptr := 1]; [L66-L67] modifies #valid; [L66-L68] ensures old(#valid)[ptr] == 0; [L66-L69] ensures #valid == old(#valid)[ptr := 1]; [L26] #memory_int[p1] := 0; [L27] #memory_int[p2] := 0; [L28] #memory_int[p3] := 0; [L29] #memory_int[p4] := 0; [L30] #memory_int[p5] := 0; [L31] #memory_int[p6] := 0; [L32] #memory_int[p7] := 0; [L33] #memory_int[p8] := 0; [L55] assert #memory_int[p1] >= 0; [L56] assert #memory_int[p2] <= 0; [L57] assert #memory_int[p3] >= 0; [L58] assert #memory_int[p4] <= 0; [L59] assert #memory_int[p5] >= 0; - UnprovableResult [Line: 60]: Unable to prove that assertion always holds Unable to prove that assertion always holds Reason: abstract domain could reach this error location. Possible FailurePath: [L66-L67] modifies #valid; [L66-L68] ensures old(#valid)[ptr] == 0; [L66-L69] ensures #valid == old(#valid)[ptr := 1]; [L66-L67] modifies #valid; [L66-L68] ensures old(#valid)[ptr] == 0; [L66-L69] ensures #valid == old(#valid)[ptr := 1]; [L66-L67] modifies #valid; [L66-L68] ensures old(#valid)[ptr] == 0; [L66-L69] ensures #valid == old(#valid)[ptr := 1]; [L66-L67] modifies #valid; [L66-L68] ensures old(#valid)[ptr] == 0; [L66-L69] ensures #valid == old(#valid)[ptr := 1]; [L66-L67] modifies #valid; [L66-L68] ensures old(#valid)[ptr] == 0; [L66-L69] ensures #valid == old(#valid)[ptr := 1]; [L66-L67] modifies #valid; [L66-L68] ensures old(#valid)[ptr] == 0; [L66-L69] ensures #valid == old(#valid)[ptr := 1]; [L66-L67] modifies #valid; [L66-L68] ensures old(#valid)[ptr] == 0; [L66-L69] ensures #valid == old(#valid)[ptr := 1]; [L66-L67] modifies #valid; [L66-L68] ensures old(#valid)[ptr] == 0; [L66-L69] ensures #valid == old(#valid)[ptr := 1]; [L26] #memory_int[p1] := 0; [L27] #memory_int[p2] := 0; [L28] #memory_int[p3] := 0; [L29] #memory_int[p4] := 0; [L30] #memory_int[p5] := 0; [L31] #memory_int[p6] := 0; [L32] #memory_int[p7] := 0; [L33] #memory_int[p8] := 0; [L55] assert #memory_int[p1] >= 0; [L56] assert #memory_int[p2] <= 0; [L57] assert #memory_int[p3] >= 0; [L58] assert #memory_int[p4] <= 0; [L59] assert #memory_int[p5] >= 0; [L60] assert #memory_int[p6] <= 0; - UnprovableResult [Line: 61]: Unable to prove that assertion always holds Unable to prove that assertion always holds Reason: abstract domain could reach this error location. Possible FailurePath: [L66-L67] modifies #valid; [L66-L68] ensures old(#valid)[ptr] == 0; [L66-L69] ensures #valid == old(#valid)[ptr := 1]; [L66-L67] modifies #valid; [L66-L68] ensures old(#valid)[ptr] == 0; [L66-L69] ensures #valid == old(#valid)[ptr := 1]; [L66-L67] modifies #valid; [L66-L68] ensures old(#valid)[ptr] == 0; [L66-L69] ensures #valid == old(#valid)[ptr := 1]; [L66-L67] modifies #valid; [L66-L68] ensures old(#valid)[ptr] == 0; [L66-L69] ensures #valid == old(#valid)[ptr := 1]; [L66-L67] modifies #valid; [L66-L68] ensures old(#valid)[ptr] == 0; [L66-L69] ensures #valid == old(#valid)[ptr := 1]; [L66-L67] modifies #valid; [L66-L68] ensures old(#valid)[ptr] == 0; [L66-L69] ensures #valid == old(#valid)[ptr := 1]; [L66-L67] modifies #valid; [L66-L68] ensures old(#valid)[ptr] == 0; [L66-L69] ensures #valid == old(#valid)[ptr := 1]; [L66-L67] modifies #valid; [L66-L68] ensures old(#valid)[ptr] == 0; [L66-L69] ensures #valid == old(#valid)[ptr := 1]; [L26] #memory_int[p1] := 0; [L27] #memory_int[p2] := 0; [L28] #memory_int[p3] := 0; [L29] #memory_int[p4] := 0; [L30] #memory_int[p5] := 0; [L31] #memory_int[p6] := 0; [L32] #memory_int[p7] := 0; [L33] #memory_int[p8] := 0; [L55] assert #memory_int[p1] >= 0; [L56] assert #memory_int[p2] <= 0; [L57] assert #memory_int[p3] >= 0; [L58] assert #memory_int[p4] <= 0; [L59] assert #memory_int[p5] >= 0; [L60] assert #memory_int[p6] <= 0; [L61] assert #memory_int[p7] >= 0; - UnprovableResult [Line: 62]: Unable to prove that assertion always holds Unable to prove that assertion always holds Reason: abstract domain could reach this error location. Possible FailurePath: [L66-L67] modifies #valid; [L66-L68] ensures old(#valid)[ptr] == 0; [L66-L69] ensures #valid == old(#valid)[ptr := 1]; [L66-L67] modifies #valid; [L66-L68] ensures old(#valid)[ptr] == 0; [L66-L69] ensures #valid == old(#valid)[ptr := 1]; [L66-L67] modifies #valid; [L66-L68] ensures old(#valid)[ptr] == 0; [L66-L69] ensures #valid == old(#valid)[ptr := 1]; [L66-L67] modifies #valid; [L66-L68] ensures old(#valid)[ptr] == 0; [L66-L69] ensures #valid == old(#valid)[ptr := 1]; [L66-L67] modifies #valid; [L66-L68] ensures old(#valid)[ptr] == 0; [L66-L69] ensures #valid == old(#valid)[ptr := 1]; [L66-L67] modifies #valid; [L66-L68] ensures old(#valid)[ptr] == 0; [L66-L69] ensures #valid == old(#valid)[ptr := 1]; [L66-L67] modifies #valid; [L66-L68] ensures old(#valid)[ptr] == 0; [L66-L69] ensures #valid == old(#valid)[ptr := 1]; [L66-L67] modifies #valid; [L66-L68] ensures old(#valid)[ptr] == 0; [L66-L69] ensures #valid == old(#valid)[ptr := 1]; [L26] #memory_int[p1] := 0; [L27] #memory_int[p2] := 0; [L28] #memory_int[p3] := 0; [L29] #memory_int[p4] := 0; [L30] #memory_int[p5] := 0; [L31] #memory_int[p6] := 0; [L32] #memory_int[p7] := 0; [L33] #memory_int[p8] := 0; [L55] assert #memory_int[p1] >= 0; [L56] assert #memory_int[p2] <= 0; [L57] assert #memory_int[p3] >= 0; [L58] assert #memory_int[p4] <= 0; [L59] assert #memory_int[p5] >= 0; [L60] assert #memory_int[p6] <= 0; [L61] assert #memory_int[p7] >= 0; [L62] assert #memory_int[p8] <= 0; RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces Received shutdown request...