java -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_compound_exp_cong.epf -i ../../../trunk/examples/programs/heapseparator/speedup-poc-dd-10-unlimited.bpl
--------------------------------------------------------------------------------
This is Ultimate 0.1.24-0302a3f
[2019-02-25 16:08:11,239 INFO L170 SettingsManager]: Resetting all preferences to default values...
[2019-02-25 16:08:11,241 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values
[2019-02-25 16:08:11,252 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring...
[2019-02-25 16:08:11,253 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values
[2019-02-25 16:08:11,254 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values
[2019-02-25 16:08:11,255 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values
[2019-02-25 16:08:11,257 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values
[2019-02-25 16:08:11,258 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values
[2019-02-25 16:08:11,259 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values
[2019-02-25 16:08:11,260 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring...
[2019-02-25 16:08:11,260 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values
[2019-02-25 16:08:11,261 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values
[2019-02-25 16:08:11,262 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values
[2019-02-25 16:08:11,264 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values
[2019-02-25 16:08:11,264 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values
[2019-02-25 16:08:11,265 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values
[2019-02-25 16:08:11,267 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values
[2019-02-25 16:08:11,269 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values
[2019-02-25 16:08:11,271 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values
[2019-02-25 16:08:11,275 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values
[2019-02-25 16:08:11,277 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values
[2019-02-25 16:08:11,279 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring...
[2019-02-25 16:08:11,279 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring...
[2019-02-25 16:08:11,285 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values
[2019-02-25 16:08:11,286 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values
[2019-02-25 16:08:11,287 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values
[2019-02-25 16:08:11,288 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values
[2019-02-25 16:08:11,292 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values
[2019-02-25 16:08:11,293 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring...
[2019-02-25 16:08:11,294 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values
[2019-02-25 16:08:11,294 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring...
[2019-02-25 16:08:11,294 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring...
[2019-02-25 16:08:11,296 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values
[2019-02-25 16:08:11,298 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values
[2019-02-25 16:08:11,299 INFO L181 SettingsManager]: Finished resetting all preferences to default values...
[2019-02-25 16:08:11,299 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/ai/array-bench/reach_32bit_compound_exp_cong.epf
[2019-02-25 16:08:11,325 INFO L110 SettingsManager]: Loading preferences was successful
[2019-02-25 16:08:11,326 INFO L112 SettingsManager]: Preferences different from defaults after loading the file:
[2019-02-25 16:08:11,326 INFO L131 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults:
[2019-02-25 16:08:11,327 INFO L133 SettingsManager]: * Show backtranslation warnings=false
[2019-02-25 16:08:11,327 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults:
[2019-02-25 16:08:11,327 INFO L133 SettingsManager]: * User list type=DISABLED
[2019-02-25 16:08:11,327 INFO L133 SettingsManager]: * Inline calls to unimplemented procedures=true
[2019-02-25 16:08:11,327 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults:
[2019-02-25 16:08:11,328 INFO L133 SettingsManager]: * Explicit value domain=true
[2019-02-25 16:08:11,328 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain
[2019-02-25 16:08:11,328 INFO L133 SettingsManager]: * Octagon Domain=false
[2019-02-25 16:08:11,328 INFO L133 SettingsManager]: * Abstract domain=CompoundDomain
[2019-02-25 16:08:11,328 INFO L133 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true
[2019-02-25 16:08:11,329 INFO L133 SettingsManager]: * Interval Domain=false
[2019-02-25 16:08:11,330 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults:
[2019-02-25 16:08:11,330 INFO L133 SettingsManager]: * Create parallel compositions if possible=false
[2019-02-25 16:08:11,330 INFO L133 SettingsManager]: * Use SBE=true
[2019-02-25 16:08:11,330 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults:
[2019-02-25 16:08:11,330 INFO L133 SettingsManager]: * sizeof long=4
[2019-02-25 16:08:11,331 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true
[2019-02-25 16:08:11,331 INFO L133 SettingsManager]: * sizeof POINTER=4
[2019-02-25 16:08:11,331 INFO L133 SettingsManager]: * Check division by zero=IGNORE
[2019-02-25 16:08:11,331 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE
[2019-02-25 16:08:11,331 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE
[2019-02-25 16:08:11,332 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE
[2019-02-25 16:08:11,333 INFO L133 SettingsManager]: * sizeof long double=12
[2019-02-25 16:08:11,333 INFO L133 SettingsManager]: * Check if freed pointer was valid=false
[2019-02-25 16:08:11,334 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE
[2019-02-25 16:08:11,334 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults:
[2019-02-25 16:08:11,334 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements
[2019-02-25 16:08:11,334 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode
[2019-02-25 16:08:11,334 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000
[2019-02-25 16:08:11,335 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults:
[2019-02-25 16:08:11,336 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP
[2019-02-25 16:08:11,336 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles
[2019-02-25 16:08:11,336 INFO L133 SettingsManager]: * Trace refinement strategy=TAIPAN
[2019-02-25 16:08:11,336 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode
[2019-02-25 16:08:11,336 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in
[2019-02-25 16:08:11,336 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true
[2019-02-25 16:08:11,337 INFO L133 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES
[2019-02-25 16:08:11,372 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp
[2019-02-25 16:08:11,384 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized
[2019-02-25 16:08:11,387 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected.
[2019-02-25 16:08:11,389 INFO L271 PluginConnector]: Initializing Boogie PL CUP Parser...
[2019-02-25 16:08:11,389 INFO L276 PluginConnector]: Boogie PL CUP Parser initialized
[2019-02-25 16:08:11,390 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/heapseparator/speedup-poc-dd-10-unlimited.bpl
[2019-02-25 16:08:11,390 INFO L111 BoogieParser]: Parsing: '/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/heapseparator/speedup-poc-dd-10-unlimited.bpl'
[2019-02-25 16:08:11,435 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] #######################
[2019-02-25 16:08:11,437 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements.
[2019-02-25 16:08:11,438 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner----------------------------
[2019-02-25 16:08:11,438 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner...
[2019-02-25 16:08:11,438 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized
[2019-02-25 16:08:11,455 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "speedup-poc-dd-10-unlimited.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 25.02 04:08:11" (1/1) ...
[2019-02-25 16:08:11,468 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "speedup-poc-dd-10-unlimited.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 25.02 04:08:11" (1/1) ...
[2019-02-25 16:08:11,499 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner----------------------------
[2019-02-25 16:08:11,499 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor----------------------------
[2019-02-25 16:08:11,500 INFO L271 PluginConnector]: Initializing Boogie Preprocessor...
[2019-02-25 16:08:11,500 INFO L276 PluginConnector]: Boogie Preprocessor initialized
[2019-02-25 16:08:11,511 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "speedup-poc-dd-10-unlimited.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 25.02 04:08:11" (1/1) ...
[2019-02-25 16:08:11,511 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "speedup-poc-dd-10-unlimited.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 25.02 04:08:11" (1/1) ...
[2019-02-25 16:08:11,514 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "speedup-poc-dd-10-unlimited.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 25.02 04:08:11" (1/1) ...
[2019-02-25 16:08:11,515 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "speedup-poc-dd-10-unlimited.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 25.02 04:08:11" (1/1) ...
[2019-02-25 16:08:11,527 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "speedup-poc-dd-10-unlimited.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 25.02 04:08:11" (1/1) ...
[2019-02-25 16:08:11,534 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "speedup-poc-dd-10-unlimited.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 25.02 04:08:11" (1/1) ...
[2019-02-25 16:08:11,535 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "speedup-poc-dd-10-unlimited.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 25.02 04:08:11" (1/1) ...
[2019-02-25 16:08:11,542 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor----------------------------
[2019-02-25 16:08:11,542 INFO L113 PluginConnector]: ------------------------RCFGBuilder----------------------------
[2019-02-25 16:08:11,542 INFO L271 PluginConnector]: Initializing RCFGBuilder...
[2019-02-25 16:08:11,543 INFO L276 PluginConnector]: RCFGBuilder initialized
[2019-02-25 16:08:11,544 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "speedup-poc-dd-10-unlimited.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 25.02 04:08: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-02-25 16:08:11,619 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start
[2019-02-25 16:08:11,620 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start
[2019-02-25 16:08:12,188 INFO L281 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start)
[2019-02-25 16:08:12,188 INFO L286 CfgBuilder]: Removed 23 assue(true) statements.
[2019-02-25 16:08:12,190 INFO L202 PluginConnector]: Adding new model speedup-poc-dd-10-unlimited.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.02 04:08:12 BoogieIcfgContainer
[2019-02-25 16:08:12,190 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder----------------------------
[2019-02-25 16:08:12,191 INFO L113 PluginConnector]: ------------------------Abstract Interpretation----------------------------
[2019-02-25 16:08:12,191 INFO L271 PluginConnector]: Initializing Abstract Interpretation...
[2019-02-25 16:08:12,191 INFO L276 PluginConnector]: Abstract Interpretation initialized
[2019-02-25 16:08:12,192 INFO L185 PluginConnector]: Executing the observer AbstractInterpretationRcfgObserver from plugin Abstract Interpretation for "speedup-poc-dd-10-unlimited.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.02 04:08:12" (1/1) ...
[2019-02-25 16:08:12,224 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2)
[2019-02-25 16:08:12,351 INFO L263 AbstractInterpreter]: Some error location(s) were reachable
[2019-02-25 16:08:12,392 INFO L272 AbstractInterpreter]: Visited 32 different actions 32 times. Never merged. Never widened. Performed 160 root evaluator evaluations with a maximum evaluation depth of 2. Performed 160 inverse root evaluator evaluations with a maximum inverse evaluation depth of 2. Found 10 fixpoints after 10 different actions. Largest state had 0 variables.
[2019-02-25 16:08:12,394 INFO L132 PluginConnector]: ------------------------ END Abstract Interpretation----------------------------
[2019-02-25 16:08:12,395 INFO L168 Benchmark]: Toolchain (without parser) took 959.27 ms. Allocated memory is still 139.5 MB. Free memory was 104.5 MB in the beginning and 78.7 MB in the end (delta: 25.8 MB). Peak memory consumption was 25.8 MB. Max. memory is 7.1 GB.
[2019-02-25 16:08:12,398 INFO L168 Benchmark]: Boogie PL CUP Parser took 0.17 ms. Allocated memory is still 139.5 MB. Free memory is still 105.8 MB. There was no memory consumed. Max. memory is 7.1 GB.
[2019-02-25 16:08:12,399 INFO L168 Benchmark]: Boogie Procedure Inliner took 61.20 ms. Allocated memory is still 139.5 MB. Free memory was 104.3 MB in the beginning and 101.9 MB in the end (delta: 2.4 MB). Peak memory consumption was 2.4 MB. Max. memory is 7.1 GB.
[2019-02-25 16:08:12,400 INFO L168 Benchmark]: Boogie Preprocessor took 42.38 ms. Allocated memory is still 139.5 MB. Free memory was 101.9 MB in the beginning and 100.4 MB in the end (delta: 1.5 MB). Peak memory consumption was 1.5 MB. Max. memory is 7.1 GB.
[2019-02-25 16:08:12,402 INFO L168 Benchmark]: RCFGBuilder took 647.88 ms. Allocated memory is still 139.5 MB. Free memory was 100.4 MB in the beginning and 86.3 MB in the end (delta: 14.2 MB). Peak memory consumption was 14.2 MB. Max. memory is 7.1 GB.
[2019-02-25 16:08:12,403 INFO L168 Benchmark]: Abstract Interpretation took 203.62 ms. Allocated memory is still 139.5 MB. Free memory was 86.1 MB in the beginning and 78.7 MB in the end (delta: 7.4 MB). Peak memory consumption was 7.4 MB. Max. memory is 7.1 GB.
[2019-02-25 16:08:12,410 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] #######################
--- Results ---
* Results from de.uni_freiburg.informatik.ultimate.core:
- StatisticsResult: Toolchain Benchmarks
Benchmark results are:
* Boogie PL CUP Parser took 0.17 ms. Allocated memory is still 139.5 MB. Free memory is still 105.8 MB. There was no memory consumed. Max. memory is 7.1 GB.
* Boogie Procedure Inliner took 61.20 ms. Allocated memory is still 139.5 MB. Free memory was 104.3 MB in the beginning and 101.9 MB in the end (delta: 2.4 MB). Peak memory consumption was 2.4 MB. Max. memory is 7.1 GB.
* Boogie Preprocessor took 42.38 ms. Allocated memory is still 139.5 MB. Free memory was 101.9 MB in the beginning and 100.4 MB in the end (delta: 1.5 MB). Peak memory consumption was 1.5 MB. Max. memory is 7.1 GB.
* RCFGBuilder took 647.88 ms. Allocated memory is still 139.5 MB. Free memory was 100.4 MB in the beginning and 86.3 MB in the end (delta: 14.2 MB). Peak memory consumption was 14.2 MB. Max. memory is 7.1 GB.
* Abstract Interpretation took 203.62 ms. Allocated memory is still 139.5 MB. Free memory was 86.1 MB in the beginning and 78.7 MB in the end (delta: 7.4 MB). Peak memory consumption was 7.4 MB. Max. memory is 7.1 GB.
* Results from de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2:
- UnprovableResult [Line: 63]: Unable to prove that assertion always holds
Unable to prove that assertion always holds
Reason: abstract domain could reach this error location.
Possible FailurePath:
[L76-L77] modifies #valid;
[L76-L78] ensures old(#valid)[ptr] == 0;
[L76-L79] ensures #valid == old(#valid)[ptr := 1];
[L76-L77] modifies #valid;
[L76-L78] ensures old(#valid)[ptr] == 0;
[L76-L79] ensures #valid == old(#valid)[ptr := 1];
[L76-L77] modifies #valid;
[L76-L78] ensures old(#valid)[ptr] == 0;
[L76-L79] ensures #valid == old(#valid)[ptr := 1];
[L76-L77] modifies #valid;
[L76-L78] ensures old(#valid)[ptr] == 0;
[L76-L79] ensures #valid == old(#valid)[ptr := 1];
[L76-L77] modifies #valid;
[L76-L78] ensures old(#valid)[ptr] == 0;
[L76-L79] ensures #valid == old(#valid)[ptr := 1];
[L76-L77] modifies #valid;
[L76-L78] ensures old(#valid)[ptr] == 0;
[L76-L79] ensures #valid == old(#valid)[ptr := 1];
[L76-L77] modifies #valid;
[L76-L78] ensures old(#valid)[ptr] == 0;
[L76-L79] ensures #valid == old(#valid)[ptr := 1];
[L76-L77] modifies #valid;
[L76-L78] ensures old(#valid)[ptr] == 0;
[L76-L79] ensures #valid == old(#valid)[ptr := 1];
[L76-L77] modifies #valid;
[L76-L78] ensures old(#valid)[ptr] == 0;
[L76-L79] ensures #valid == old(#valid)[ptr := 1];
[L76-L77] modifies #valid;
[L76-L78] ensures old(#valid)[ptr] == 0;
[L76-L79] ensures #valid == old(#valid)[ptr := 1];
[L28] #memory_int[p1] := 0;
[L29] #memory_int[p2] := 0;
[L30] #memory_int[p3] := 0;
[L31] #memory_int[p4] := 0;
[L32] #memory_int[p5] := 0;
[L33] #memory_int[p6] := 0;
[L34] #memory_int[p7] := 0;
[L35] #memory_int[p8] := 0;
[L36] #memory_int[p9] := 0;
[L37] #memory_int[p10] := 0;
[L63] assert #memory_int[p1] >= 0;
- UnprovableResult [Line: 64]: Unable to prove that assertion always holds
Unable to prove that assertion always holds
Reason: abstract domain could reach this error location.
Possible FailurePath:
[L76-L77] modifies #valid;
[L76-L78] ensures old(#valid)[ptr] == 0;
[L76-L79] ensures #valid == old(#valid)[ptr := 1];
[L76-L77] modifies #valid;
[L76-L78] ensures old(#valid)[ptr] == 0;
[L76-L79] ensures #valid == old(#valid)[ptr := 1];
[L76-L77] modifies #valid;
[L76-L78] ensures old(#valid)[ptr] == 0;
[L76-L79] ensures #valid == old(#valid)[ptr := 1];
[L76-L77] modifies #valid;
[L76-L78] ensures old(#valid)[ptr] == 0;
[L76-L79] ensures #valid == old(#valid)[ptr := 1];
[L76-L77] modifies #valid;
[L76-L78] ensures old(#valid)[ptr] == 0;
[L76-L79] ensures #valid == old(#valid)[ptr := 1];
[L76-L77] modifies #valid;
[L76-L78] ensures old(#valid)[ptr] == 0;
[L76-L79] ensures #valid == old(#valid)[ptr := 1];
[L76-L77] modifies #valid;
[L76-L78] ensures old(#valid)[ptr] == 0;
[L76-L79] ensures #valid == old(#valid)[ptr := 1];
[L76-L77] modifies #valid;
[L76-L78] ensures old(#valid)[ptr] == 0;
[L76-L79] ensures #valid == old(#valid)[ptr := 1];
[L76-L77] modifies #valid;
[L76-L78] ensures old(#valid)[ptr] == 0;
[L76-L79] ensures #valid == old(#valid)[ptr := 1];
[L76-L77] modifies #valid;
[L76-L78] ensures old(#valid)[ptr] == 0;
[L76-L79] ensures #valid == old(#valid)[ptr := 1];
[L28] #memory_int[p1] := 0;
[L29] #memory_int[p2] := 0;
[L30] #memory_int[p3] := 0;
[L31] #memory_int[p4] := 0;
[L32] #memory_int[p5] := 0;
[L33] #memory_int[p6] := 0;
[L34] #memory_int[p7] := 0;
[L35] #memory_int[p8] := 0;
[L36] #memory_int[p9] := 0;
[L37] #memory_int[p10] := 0;
[L63] assert #memory_int[p1] >= 0;
[L64] assert #memory_int[p2] <= 0;
- UnprovableResult [Line: 65]: Unable to prove that assertion always holds
Unable to prove that assertion always holds
Reason: abstract domain could reach this error location.
Possible FailurePath:
[L76-L77] modifies #valid;
[L76-L78] ensures old(#valid)[ptr] == 0;
[L76-L79] ensures #valid == old(#valid)[ptr := 1];
[L76-L77] modifies #valid;
[L76-L78] ensures old(#valid)[ptr] == 0;
[L76-L79] ensures #valid == old(#valid)[ptr := 1];
[L76-L77] modifies #valid;
[L76-L78] ensures old(#valid)[ptr] == 0;
[L76-L79] ensures #valid == old(#valid)[ptr := 1];
[L76-L77] modifies #valid;
[L76-L78] ensures old(#valid)[ptr] == 0;
[L76-L79] ensures #valid == old(#valid)[ptr := 1];
[L76-L77] modifies #valid;
[L76-L78] ensures old(#valid)[ptr] == 0;
[L76-L79] ensures #valid == old(#valid)[ptr := 1];
[L76-L77] modifies #valid;
[L76-L78] ensures old(#valid)[ptr] == 0;
[L76-L79] ensures #valid == old(#valid)[ptr := 1];
[L76-L77] modifies #valid;
[L76-L78] ensures old(#valid)[ptr] == 0;
[L76-L79] ensures #valid == old(#valid)[ptr := 1];
[L76-L77] modifies #valid;
[L76-L78] ensures old(#valid)[ptr] == 0;
[L76-L79] ensures #valid == old(#valid)[ptr := 1];
[L76-L77] modifies #valid;
[L76-L78] ensures old(#valid)[ptr] == 0;
[L76-L79] ensures #valid == old(#valid)[ptr := 1];
[L76-L77] modifies #valid;
[L76-L78] ensures old(#valid)[ptr] == 0;
[L76-L79] ensures #valid == old(#valid)[ptr := 1];
[L28] #memory_int[p1] := 0;
[L29] #memory_int[p2] := 0;
[L30] #memory_int[p3] := 0;
[L31] #memory_int[p4] := 0;
[L32] #memory_int[p5] := 0;
[L33] #memory_int[p6] := 0;
[L34] #memory_int[p7] := 0;
[L35] #memory_int[p8] := 0;
[L36] #memory_int[p9] := 0;
[L37] #memory_int[p10] := 0;
[L63] assert #memory_int[p1] >= 0;
[L64] assert #memory_int[p2] <= 0;
[L65] assert #memory_int[p3] >= 0;
- UnprovableResult [Line: 66]: Unable to prove that assertion always holds
Unable to prove that assertion always holds
Reason: abstract domain could reach this error location.
Possible FailurePath:
[L76-L77] modifies #valid;
[L76-L78] ensures old(#valid)[ptr] == 0;
[L76-L79] ensures #valid == old(#valid)[ptr := 1];
[L76-L77] modifies #valid;
[L76-L78] ensures old(#valid)[ptr] == 0;
[L76-L79] ensures #valid == old(#valid)[ptr := 1];
[L76-L77] modifies #valid;
[L76-L78] ensures old(#valid)[ptr] == 0;
[L76-L79] ensures #valid == old(#valid)[ptr := 1];
[L76-L77] modifies #valid;
[L76-L78] ensures old(#valid)[ptr] == 0;
[L76-L79] ensures #valid == old(#valid)[ptr := 1];
[L76-L77] modifies #valid;
[L76-L78] ensures old(#valid)[ptr] == 0;
[L76-L79] ensures #valid == old(#valid)[ptr := 1];
[L76-L77] modifies #valid;
[L76-L78] ensures old(#valid)[ptr] == 0;
[L76-L79] ensures #valid == old(#valid)[ptr := 1];
[L76-L77] modifies #valid;
[L76-L78] ensures old(#valid)[ptr] == 0;
[L76-L79] ensures #valid == old(#valid)[ptr := 1];
[L76-L77] modifies #valid;
[L76-L78] ensures old(#valid)[ptr] == 0;
[L76-L79] ensures #valid == old(#valid)[ptr := 1];
[L76-L77] modifies #valid;
[L76-L78] ensures old(#valid)[ptr] == 0;
[L76-L79] ensures #valid == old(#valid)[ptr := 1];
[L76-L77] modifies #valid;
[L76-L78] ensures old(#valid)[ptr] == 0;
[L76-L79] ensures #valid == old(#valid)[ptr := 1];
[L28] #memory_int[p1] := 0;
[L29] #memory_int[p2] := 0;
[L30] #memory_int[p3] := 0;
[L31] #memory_int[p4] := 0;
[L32] #memory_int[p5] := 0;
[L33] #memory_int[p6] := 0;
[L34] #memory_int[p7] := 0;
[L35] #memory_int[p8] := 0;
[L36] #memory_int[p9] := 0;
[L37] #memory_int[p10] := 0;
[L63] assert #memory_int[p1] >= 0;
[L64] assert #memory_int[p2] <= 0;
[L65] assert #memory_int[p3] >= 0;
[L66] assert #memory_int[p4] <= 0;
- UnprovableResult [Line: 67]: Unable to prove that assertion always holds
Unable to prove that assertion always holds
Reason: abstract domain could reach this error location.
Possible FailurePath:
[L76-L77] modifies #valid;
[L76-L78] ensures old(#valid)[ptr] == 0;
[L76-L79] ensures #valid == old(#valid)[ptr := 1];
[L76-L77] modifies #valid;
[L76-L78] ensures old(#valid)[ptr] == 0;
[L76-L79] ensures #valid == old(#valid)[ptr := 1];
[L76-L77] modifies #valid;
[L76-L78] ensures old(#valid)[ptr] == 0;
[L76-L79] ensures #valid == old(#valid)[ptr := 1];
[L76-L77] modifies #valid;
[L76-L78] ensures old(#valid)[ptr] == 0;
[L76-L79] ensures #valid == old(#valid)[ptr := 1];
[L76-L77] modifies #valid;
[L76-L78] ensures old(#valid)[ptr] == 0;
[L76-L79] ensures #valid == old(#valid)[ptr := 1];
[L76-L77] modifies #valid;
[L76-L78] ensures old(#valid)[ptr] == 0;
[L76-L79] ensures #valid == old(#valid)[ptr := 1];
[L76-L77] modifies #valid;
[L76-L78] ensures old(#valid)[ptr] == 0;
[L76-L79] ensures #valid == old(#valid)[ptr := 1];
[L76-L77] modifies #valid;
[L76-L78] ensures old(#valid)[ptr] == 0;
[L76-L79] ensures #valid == old(#valid)[ptr := 1];
[L76-L77] modifies #valid;
[L76-L78] ensures old(#valid)[ptr] == 0;
[L76-L79] ensures #valid == old(#valid)[ptr := 1];
[L76-L77] modifies #valid;
[L76-L78] ensures old(#valid)[ptr] == 0;
[L76-L79] ensures #valid == old(#valid)[ptr := 1];
[L28] #memory_int[p1] := 0;
[L29] #memory_int[p2] := 0;
[L30] #memory_int[p3] := 0;
[L31] #memory_int[p4] := 0;
[L32] #memory_int[p5] := 0;
[L33] #memory_int[p6] := 0;
[L34] #memory_int[p7] := 0;
[L35] #memory_int[p8] := 0;
[L36] #memory_int[p9] := 0;
[L37] #memory_int[p10] := 0;
[L63] assert #memory_int[p1] >= 0;
[L64] assert #memory_int[p2] <= 0;
[L65] assert #memory_int[p3] >= 0;
[L66] assert #memory_int[p4] <= 0;
[L67] assert #memory_int[p5] >= 0;
- UnprovableResult [Line: 68]: Unable to prove that assertion always holds
Unable to prove that assertion always holds
Reason: abstract domain could reach this error location.
Possible FailurePath:
[L76-L77] modifies #valid;
[L76-L78] ensures old(#valid)[ptr] == 0;
[L76-L79] ensures #valid == old(#valid)[ptr := 1];
[L76-L77] modifies #valid;
[L76-L78] ensures old(#valid)[ptr] == 0;
[L76-L79] ensures #valid == old(#valid)[ptr := 1];
[L76-L77] modifies #valid;
[L76-L78] ensures old(#valid)[ptr] == 0;
[L76-L79] ensures #valid == old(#valid)[ptr := 1];
[L76-L77] modifies #valid;
[L76-L78] ensures old(#valid)[ptr] == 0;
[L76-L79] ensures #valid == old(#valid)[ptr := 1];
[L76-L77] modifies #valid;
[L76-L78] ensures old(#valid)[ptr] == 0;
[L76-L79] ensures #valid == old(#valid)[ptr := 1];
[L76-L77] modifies #valid;
[L76-L78] ensures old(#valid)[ptr] == 0;
[L76-L79] ensures #valid == old(#valid)[ptr := 1];
[L76-L77] modifies #valid;
[L76-L78] ensures old(#valid)[ptr] == 0;
[L76-L79] ensures #valid == old(#valid)[ptr := 1];
[L76-L77] modifies #valid;
[L76-L78] ensures old(#valid)[ptr] == 0;
[L76-L79] ensures #valid == old(#valid)[ptr := 1];
[L76-L77] modifies #valid;
[L76-L78] ensures old(#valid)[ptr] == 0;
[L76-L79] ensures #valid == old(#valid)[ptr := 1];
[L76-L77] modifies #valid;
[L76-L78] ensures old(#valid)[ptr] == 0;
[L76-L79] ensures #valid == old(#valid)[ptr := 1];
[L28] #memory_int[p1] := 0;
[L29] #memory_int[p2] := 0;
[L30] #memory_int[p3] := 0;
[L31] #memory_int[p4] := 0;
[L32] #memory_int[p5] := 0;
[L33] #memory_int[p6] := 0;
[L34] #memory_int[p7] := 0;
[L35] #memory_int[p8] := 0;
[L36] #memory_int[p9] := 0;
[L37] #memory_int[p10] := 0;
[L63] assert #memory_int[p1] >= 0;
[L64] assert #memory_int[p2] <= 0;
[L65] assert #memory_int[p3] >= 0;
[L66] assert #memory_int[p4] <= 0;
[L67] assert #memory_int[p5] >= 0;
[L68] assert #memory_int[p6] <= 0;
- UnprovableResult [Line: 69]: Unable to prove that assertion always holds
Unable to prove that assertion always holds
Reason: abstract domain could reach this error location.
Possible FailurePath:
[L76-L77] modifies #valid;
[L76-L78] ensures old(#valid)[ptr] == 0;
[L76-L79] ensures #valid == old(#valid)[ptr := 1];
[L76-L77] modifies #valid;
[L76-L78] ensures old(#valid)[ptr] == 0;
[L76-L79] ensures #valid == old(#valid)[ptr := 1];
[L76-L77] modifies #valid;
[L76-L78] ensures old(#valid)[ptr] == 0;
[L76-L79] ensures #valid == old(#valid)[ptr := 1];
[L76-L77] modifies #valid;
[L76-L78] ensures old(#valid)[ptr] == 0;
[L76-L79] ensures #valid == old(#valid)[ptr := 1];
[L76-L77] modifies #valid;
[L76-L78] ensures old(#valid)[ptr] == 0;
[L76-L79] ensures #valid == old(#valid)[ptr := 1];
[L76-L77] modifies #valid;
[L76-L78] ensures old(#valid)[ptr] == 0;
[L76-L79] ensures #valid == old(#valid)[ptr := 1];
[L76-L77] modifies #valid;
[L76-L78] ensures old(#valid)[ptr] == 0;
[L76-L79] ensures #valid == old(#valid)[ptr := 1];
[L76-L77] modifies #valid;
[L76-L78] ensures old(#valid)[ptr] == 0;
[L76-L79] ensures #valid == old(#valid)[ptr := 1];
[L76-L77] modifies #valid;
[L76-L78] ensures old(#valid)[ptr] == 0;
[L76-L79] ensures #valid == old(#valid)[ptr := 1];
[L76-L77] modifies #valid;
[L76-L78] ensures old(#valid)[ptr] == 0;
[L76-L79] ensures #valid == old(#valid)[ptr := 1];
[L28] #memory_int[p1] := 0;
[L29] #memory_int[p2] := 0;
[L30] #memory_int[p3] := 0;
[L31] #memory_int[p4] := 0;
[L32] #memory_int[p5] := 0;
[L33] #memory_int[p6] := 0;
[L34] #memory_int[p7] := 0;
[L35] #memory_int[p8] := 0;
[L36] #memory_int[p9] := 0;
[L37] #memory_int[p10] := 0;
[L63] assert #memory_int[p1] >= 0;
[L64] assert #memory_int[p2] <= 0;
[L65] assert #memory_int[p3] >= 0;
[L66] assert #memory_int[p4] <= 0;
[L67] assert #memory_int[p5] >= 0;
[L68] assert #memory_int[p6] <= 0;
[L69] assert #memory_int[p7] >= 0;
- UnprovableResult [Line: 70]: Unable to prove that assertion always holds
Unable to prove that assertion always holds
Reason: abstract domain could reach this error location.
Possible FailurePath:
[L76-L77] modifies #valid;
[L76-L78] ensures old(#valid)[ptr] == 0;
[L76-L79] ensures #valid == old(#valid)[ptr := 1];
[L76-L77] modifies #valid;
[L76-L78] ensures old(#valid)[ptr] == 0;
[L76-L79] ensures #valid == old(#valid)[ptr := 1];
[L76-L77] modifies #valid;
[L76-L78] ensures old(#valid)[ptr] == 0;
[L76-L79] ensures #valid == old(#valid)[ptr := 1];
[L76-L77] modifies #valid;
[L76-L78] ensures old(#valid)[ptr] == 0;
[L76-L79] ensures #valid == old(#valid)[ptr := 1];
[L76-L77] modifies #valid;
[L76-L78] ensures old(#valid)[ptr] == 0;
[L76-L79] ensures #valid == old(#valid)[ptr := 1];
[L76-L77] modifies #valid;
[L76-L78] ensures old(#valid)[ptr] == 0;
[L76-L79] ensures #valid == old(#valid)[ptr := 1];
[L76-L77] modifies #valid;
[L76-L78] ensures old(#valid)[ptr] == 0;
[L76-L79] ensures #valid == old(#valid)[ptr := 1];
[L76-L77] modifies #valid;
[L76-L78] ensures old(#valid)[ptr] == 0;
[L76-L79] ensures #valid == old(#valid)[ptr := 1];
[L76-L77] modifies #valid;
[L76-L78] ensures old(#valid)[ptr] == 0;
[L76-L79] ensures #valid == old(#valid)[ptr := 1];
[L76-L77] modifies #valid;
[L76-L78] ensures old(#valid)[ptr] == 0;
[L76-L79] ensures #valid == old(#valid)[ptr := 1];
[L28] #memory_int[p1] := 0;
[L29] #memory_int[p2] := 0;
[L30] #memory_int[p3] := 0;
[L31] #memory_int[p4] := 0;
[L32] #memory_int[p5] := 0;
[L33] #memory_int[p6] := 0;
[L34] #memory_int[p7] := 0;
[L35] #memory_int[p8] := 0;
[L36] #memory_int[p9] := 0;
[L37] #memory_int[p10] := 0;
[L63] assert #memory_int[p1] >= 0;
[L64] assert #memory_int[p2] <= 0;
[L65] assert #memory_int[p3] >= 0;
[L66] assert #memory_int[p4] <= 0;
[L67] assert #memory_int[p5] >= 0;
[L68] assert #memory_int[p6] <= 0;
[L69] assert #memory_int[p7] >= 0;
[L70] assert #memory_int[p8] <= 0;
- UnprovableResult [Line: 71]: Unable to prove that assertion always holds
Unable to prove that assertion always holds
Reason: abstract domain could reach this error location.
Possible FailurePath:
[L76-L77] modifies #valid;
[L76-L78] ensures old(#valid)[ptr] == 0;
[L76-L79] ensures #valid == old(#valid)[ptr := 1];
[L76-L77] modifies #valid;
[L76-L78] ensures old(#valid)[ptr] == 0;
[L76-L79] ensures #valid == old(#valid)[ptr := 1];
[L76-L77] modifies #valid;
[L76-L78] ensures old(#valid)[ptr] == 0;
[L76-L79] ensures #valid == old(#valid)[ptr := 1];
[L76-L77] modifies #valid;
[L76-L78] ensures old(#valid)[ptr] == 0;
[L76-L79] ensures #valid == old(#valid)[ptr := 1];
[L76-L77] modifies #valid;
[L76-L78] ensures old(#valid)[ptr] == 0;
[L76-L79] ensures #valid == old(#valid)[ptr := 1];
[L76-L77] modifies #valid;
[L76-L78] ensures old(#valid)[ptr] == 0;
[L76-L79] ensures #valid == old(#valid)[ptr := 1];
[L76-L77] modifies #valid;
[L76-L78] ensures old(#valid)[ptr] == 0;
[L76-L79] ensures #valid == old(#valid)[ptr := 1];
[L76-L77] modifies #valid;
[L76-L78] ensures old(#valid)[ptr] == 0;
[L76-L79] ensures #valid == old(#valid)[ptr := 1];
[L76-L77] modifies #valid;
[L76-L78] ensures old(#valid)[ptr] == 0;
[L76-L79] ensures #valid == old(#valid)[ptr := 1];
[L76-L77] modifies #valid;
[L76-L78] ensures old(#valid)[ptr] == 0;
[L76-L79] ensures #valid == old(#valid)[ptr := 1];
[L28] #memory_int[p1] := 0;
[L29] #memory_int[p2] := 0;
[L30] #memory_int[p3] := 0;
[L31] #memory_int[p4] := 0;
[L32] #memory_int[p5] := 0;
[L33] #memory_int[p6] := 0;
[L34] #memory_int[p7] := 0;
[L35] #memory_int[p8] := 0;
[L36] #memory_int[p9] := 0;
[L37] #memory_int[p10] := 0;
[L63] assert #memory_int[p1] >= 0;
[L64] assert #memory_int[p2] <= 0;
[L65] assert #memory_int[p3] >= 0;
[L66] assert #memory_int[p4] <= 0;
[L67] assert #memory_int[p5] >= 0;
[L68] assert #memory_int[p6] <= 0;
[L69] assert #memory_int[p7] >= 0;
[L70] assert #memory_int[p8] <= 0;
[L71] assert #memory_int[p9] >= 0;
- UnprovableResult [Line: 72]: Unable to prove that assertion always holds
Unable to prove that assertion always holds
Reason: abstract domain could reach this error location.
Possible FailurePath:
[L76-L77] modifies #valid;
[L76-L78] ensures old(#valid)[ptr] == 0;
[L76-L79] ensures #valid == old(#valid)[ptr := 1];
[L76-L77] modifies #valid;
[L76-L78] ensures old(#valid)[ptr] == 0;
[L76-L79] ensures #valid == old(#valid)[ptr := 1];
[L76-L77] modifies #valid;
[L76-L78] ensures old(#valid)[ptr] == 0;
[L76-L79] ensures #valid == old(#valid)[ptr := 1];
[L76-L77] modifies #valid;
[L76-L78] ensures old(#valid)[ptr] == 0;
[L76-L79] ensures #valid == old(#valid)[ptr := 1];
[L76-L77] modifies #valid;
[L76-L78] ensures old(#valid)[ptr] == 0;
[L76-L79] ensures #valid == old(#valid)[ptr := 1];
[L76-L77] modifies #valid;
[L76-L78] ensures old(#valid)[ptr] == 0;
[L76-L79] ensures #valid == old(#valid)[ptr := 1];
[L76-L77] modifies #valid;
[L76-L78] ensures old(#valid)[ptr] == 0;
[L76-L79] ensures #valid == old(#valid)[ptr := 1];
[L76-L77] modifies #valid;
[L76-L78] ensures old(#valid)[ptr] == 0;
[L76-L79] ensures #valid == old(#valid)[ptr := 1];
[L76-L77] modifies #valid;
[L76-L78] ensures old(#valid)[ptr] == 0;
[L76-L79] ensures #valid == old(#valid)[ptr := 1];
[L76-L77] modifies #valid;
[L76-L78] ensures old(#valid)[ptr] == 0;
[L76-L79] ensures #valid == old(#valid)[ptr := 1];
[L28] #memory_int[p1] := 0;
[L29] #memory_int[p2] := 0;
[L30] #memory_int[p3] := 0;
[L31] #memory_int[p4] := 0;
[L32] #memory_int[p5] := 0;
[L33] #memory_int[p6] := 0;
[L34] #memory_int[p7] := 0;
[L35] #memory_int[p8] := 0;
[L36] #memory_int[p9] := 0;
[L37] #memory_int[p10] := 0;
[L63] assert #memory_int[p1] >= 0;
[L64] assert #memory_int[p2] <= 0;
[L65] assert #memory_int[p3] >= 0;
[L66] assert #memory_int[p4] <= 0;
[L67] assert #memory_int[p5] >= 0;
[L68] assert #memory_int[p6] <= 0;
[L69] assert #memory_int[p7] >= 0;
[L70] assert #memory_int[p8] <= 0;
[L71] assert #memory_int[p9] >= 0;
[L72] assert #memory_int[p10] <= 0;
RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces
Received shutdown request...