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-poc01-10.bpl -------------------------------------------------------------------------------- This is Ultimate 0.1.24-b8c145f [2019-08-05 12:13:48,184 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-08-05 12:13:48,186 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-08-05 12:13:48,198 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-08-05 12:13:48,198 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-08-05 12:13:48,199 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-08-05 12:13:48,200 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-08-05 12:13:48,202 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-08-05 12:13:48,204 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-08-05 12:13:48,205 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-08-05 12:13:48,206 INFO L181 SettingsManager]: Resetting Symbolic Interpretation preferences to default values [2019-08-05 12:13:48,206 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-08-05 12:13:48,206 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-08-05 12:13:48,207 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-08-05 12:13:48,208 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-08-05 12:13:48,209 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-08-05 12:13:48,210 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-08-05 12:13:48,211 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-08-05 12:13:48,213 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-08-05 12:13:48,215 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-08-05 12:13:48,217 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-08-05 12:13:48,218 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-08-05 12:13:48,219 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-08-05 12:13:48,220 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-08-05 12:13:48,222 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-08-05 12:13:48,223 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-08-05 12:13:48,223 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-08-05 12:13:48,224 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-08-05 12:13:48,224 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-08-05 12:13:48,225 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-08-05 12:13:48,226 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-08-05 12:13:48,226 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-08-05 12:13:48,227 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-08-05 12:13:48,228 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-08-05 12:13:48,229 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-08-05 12:13:48,229 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-08-05 12:13:48,230 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-08-05 12:13:48,230 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-08-05 12:13:48,231 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-08-05 12:13:48,232 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-08-05 12:13:48,232 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-08-05 12:13:48,233 INFO L101 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-08-05 12:13:48,246 INFO L113 SettingsManager]: Loading preferences was successful [2019-08-05 12:13:48,246 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-08-05 12:13:48,247 INFO L136 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2019-08-05 12:13:48,247 INFO L138 SettingsManager]: * Show backtranslation warnings=false [2019-08-05 12:13:48,247 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2019-08-05 12:13:48,247 INFO L138 SettingsManager]: * User list type=DISABLED [2019-08-05 12:13:48,247 INFO L138 SettingsManager]: * Inline calls to unimplemented procedures=true [2019-08-05 12:13:48,248 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2019-08-05 12:13:48,248 INFO L138 SettingsManager]: * Explicit value domain=true [2019-08-05 12:13:48,248 INFO L138 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2019-08-05 12:13:48,248 INFO L138 SettingsManager]: * Octagon Domain=false [2019-08-05 12:13:48,248 INFO L138 SettingsManager]: * Abstract domain=CompoundDomain [2019-08-05 12:13:48,249 INFO L138 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2019-08-05 12:13:48,249 INFO L138 SettingsManager]: * Interval Domain=false [2019-08-05 12:13:48,249 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-08-05 12:13:48,250 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-08-05 12:13:48,250 INFO L138 SettingsManager]: * Use SBE=true [2019-08-05 12:13:48,250 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-08-05 12:13:48,250 INFO L138 SettingsManager]: * sizeof long=4 [2019-08-05 12:13:48,251 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-08-05 12:13:48,251 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-08-05 12:13:48,251 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-08-05 12:13:48,251 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-08-05 12:13:48,251 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-08-05 12:13:48,252 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-08-05 12:13:48,252 INFO L138 SettingsManager]: * sizeof long double=12 [2019-08-05 12:13:48,252 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-08-05 12:13:48,252 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-08-05 12:13:48,252 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-08-05 12:13:48,253 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-08-05 12:13:48,253 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-08-05 12:13:48,253 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-08-05 12:13:48,253 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-08-05 12:13:48,254 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-08-05 12:13:48,254 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-08-05 12:13:48,254 INFO L138 SettingsManager]: * Trace refinement strategy=TAIPAN [2019-08-05 12:13:48,254 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-08-05 12:13:48,254 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-08-05 12:13:48,254 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-08-05 12:13:48,255 INFO L138 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2019-08-05 12:13:48,283 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-08-05 12:13:48,301 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-08-05 12:13:48,304 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-08-05 12:13:48,306 INFO L271 PluginConnector]: Initializing Boogie PL CUP Parser... [2019-08-05 12:13:48,307 INFO L275 PluginConnector]: Boogie PL CUP Parser initialized [2019-08-05 12:13:48,307 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/heapseparator/speedup-poc01-10.bpl [2019-08-05 12:13:48,308 INFO L110 BoogieParser]: Parsing: '/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/heapseparator/speedup-poc01-10.bpl' [2019-08-05 12:13:48,368 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-08-05 12:13:48,370 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-08-05 12:13:48,371 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-08-05 12:13:48,371 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-08-05 12:13:48,371 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-08-05 12:13:48,388 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "speedup-poc01-10.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 12:13:48" (1/1) ... [2019-08-05 12:13:48,401 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "speedup-poc01-10.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 12:13:48" (1/1) ... [2019-08-05 12:13:48,426 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-08-05 12:13:48,427 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-08-05 12:13:48,427 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-08-05 12:13:48,427 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-08-05 12:13:48,437 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "speedup-poc01-10.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 12:13:48" (1/1) ... [2019-08-05 12:13:48,438 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "speedup-poc01-10.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 12:13:48" (1/1) ... [2019-08-05 12:13:48,440 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "speedup-poc01-10.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 12:13:48" (1/1) ... [2019-08-05 12:13:48,440 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "speedup-poc01-10.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 12:13:48" (1/1) ... [2019-08-05 12:13:48,444 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "speedup-poc01-10.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 12:13:48" (1/1) ... [2019-08-05 12:13:48,448 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "speedup-poc01-10.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 12:13:48" (1/1) ... [2019-08-05 12:13:48,450 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "speedup-poc01-10.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 12:13:48" (1/1) ... [2019-08-05 12:13:48,452 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-08-05 12:13:48,453 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-08-05 12:13:48,453 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-08-05 12:13:48,453 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-08-05 12:13:48,454 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "speedup-poc01-10.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 12:13:48" (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-08-05 12:13:48,525 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-08-05 12:13:48,526 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-08-05 12:13:49,017 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-08-05 12:13:49,017 INFO L283 CfgBuilder]: Removed 3 assume(true) statements. [2019-08-05 12:13:49,018 INFO L202 PluginConnector]: Adding new model speedup-poc01-10.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 05.08 12:13:49 BoogieIcfgContainer [2019-08-05 12:13:49,018 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-08-05 12:13:49,019 INFO L113 PluginConnector]: ------------------------Abstract Interpretation---------------------------- [2019-08-05 12:13:49,019 INFO L271 PluginConnector]: Initializing Abstract Interpretation... [2019-08-05 12:13:49,020 INFO L275 PluginConnector]: Abstract Interpretation initialized [2019-08-05 12:13:49,021 INFO L185 PluginConnector]: Executing the observer AbstractInterpretationRcfgObserver from plugin Abstract Interpretation for "speedup-poc01-10.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 05.08 12:13:49" (1/1) ... [2019-08-05 12:13:49,052 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-08-05 12:13:49,181 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-08-05 12:13:49,227 INFO L272 AbstractInterpreter]: Visited 32 different actions 32 times. Never merged. Never widened. Performed 170 root evaluator evaluations with a maximum evaluation depth of 3. Performed 170 inverse root evaluator evaluations with a maximum inverse evaluation depth of 3. Found 10 fixpoints after 10 different actions. Largest state had 0 variables. [2019-08-05 12:13:49,227 INFO L132 PluginConnector]: ------------------------ END Abstract Interpretation---------------------------- [2019-08-05 12:13:49,232 INFO L168 Benchmark]: Toolchain (without parser) took 858.95 ms. Allocated memory is still 133.7 MB. Free memory was 106.2 MB in the beginning and 79.5 MB in the end (delta: 26.7 MB). Peak memory consumption was 26.7 MB. Max. memory is 7.1 GB. [2019-08-05 12:13:49,233 INFO L168 Benchmark]: Boogie PL CUP Parser took 0.17 ms. Allocated memory is still 133.7 MB. Free memory was 107.7 MB in the beginning and 107.5 MB in the end (delta: 209.7 kB). Peak memory consumption was 209.7 kB. Max. memory is 7.1 GB. [2019-08-05 12:13:49,236 INFO L168 Benchmark]: Boogie Procedure Inliner took 55.46 ms. Allocated memory is still 133.7 MB. Free memory was 106.0 MB in the beginning and 103.8 MB in the end (delta: 2.2 MB). Peak memory consumption was 2.2 MB. Max. memory is 7.1 GB. [2019-08-05 12:13:49,237 INFO L168 Benchmark]: Boogie Preprocessor took 25.50 ms. Allocated memory is still 133.7 MB. Free memory was 103.8 MB in the beginning and 102.5 MB in the end (delta: 1.3 MB). Peak memory consumption was 1.3 MB. Max. memory is 7.1 GB. [2019-08-05 12:13:49,241 INFO L168 Benchmark]: RCFGBuilder took 565.99 ms. Allocated memory is still 133.7 MB. Free memory was 102.5 MB in the beginning and 88.5 MB in the end (delta: 14.0 MB). Peak memory consumption was 14.0 MB. Max. memory is 7.1 GB. [2019-08-05 12:13:49,243 INFO L168 Benchmark]: Abstract Interpretation took 207.87 ms. Allocated memory is still 133.7 MB. Free memory was 88.5 MB in the beginning and 79.5 MB in the end (delta: 8.9 MB). Peak memory consumption was 8.9 MB. Max. memory is 7.1 GB. [2019-08-05 12:13:49,251 INFO L335 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 133.7 MB. Free memory was 107.7 MB in the beginning and 107.5 MB in the end (delta: 209.7 kB). Peak memory consumption was 209.7 kB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 55.46 ms. Allocated memory is still 133.7 MB. Free memory was 106.0 MB in the beginning and 103.8 MB in the end (delta: 2.2 MB). Peak memory consumption was 2.2 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 25.50 ms. Allocated memory is still 133.7 MB. Free memory was 103.8 MB in the beginning and 102.5 MB in the end (delta: 1.3 MB). Peak memory consumption was 1.3 MB. Max. memory is 7.1 GB. * RCFGBuilder took 565.99 ms. Allocated memory is still 133.7 MB. Free memory was 102.5 MB in the beginning and 88.5 MB in the end (delta: 14.0 MB). Peak memory consumption was 14.0 MB. Max. memory is 7.1 GB. * Abstract Interpretation took 207.87 ms. Allocated memory is still 133.7 MB. Free memory was 88.5 MB in the beginning and 79.5 MB in the end (delta: 8.9 MB). Peak memory consumption was 8.9 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2: - UnprovableResult [Line: 108]: Unable to prove that assertion always holds Unable to prove that assertion always holds Reason: abstract domain could reach this error location. Possible FailurePath: [L20] assume p1 != p2; [L21] assume p1 != p3; [L22] assume p1 != p4; [L23] assume p1 != p5; [L24] assume p1 != p6; [L25] assume p1 != p7; [L26] assume p1 != p8; [L27] assume p1 != p9; [L28] assume p1 != p10; [L30] assume p2 != p3; [L31] assume p2 != p4; [L32] assume p2 != p5; [L33] assume p2 != p6; [L34] assume p2 != p7; [L35] assume p2 != p8; [L36] assume p2 != p9; [L37] assume p2 != p10; [L39] assume p3 != p4; [L40] assume p3 != p5; [L41] assume p3 != p6; [L42] assume p3 != p7; [L43] assume p3 != p8; [L44] assume p3 != p9; [L45] assume p3 != p10; [L47] assume p4 != p5; [L48] assume p4 != p6; [L49] assume p4 != p7; [L50] assume p4 != p8; [L51] assume p4 != p9; [L52] assume p4 != p10; [L54] assume p5 != p6; [L55] assume p5 != p7; [L56] assume p5 != p8; [L57] assume p5 != p9; [L58] assume p5 != p10; [L60] assume p6 != p7; [L61] assume p6 != p8; [L62] assume p6 != p9; [L63] assume p6 != p10; [L65] assume p7 != p8; [L66] assume p7 != p9; [L67] assume p7 != p10; [L69] assume p8 != p9; [L70] assume p8 != p10; [L72] assume p9 != p10; [L74] #memory_int[p1] := 0; [L75] #memory_int[p2] := 0; [L76] #memory_int[p3] := 0; [L77] #memory_int[p4] := 0; [L78] #memory_int[p5] := 0; [L79] #memory_int[p6] := 0; [L80] #memory_int[p7] := 0; [L81] #memory_int[p8] := 0; [L82] #memory_int[p9] := 0; [L83] #memory_int[p10] := 0; [L108] assert #memory_int[p1] >= 0; - UnprovableResult [Line: 109]: Unable to prove that assertion always holds Unable to prove that assertion always holds Reason: abstract domain could reach this error location. Possible FailurePath: [L20] assume p1 != p2; [L21] assume p1 != p3; [L22] assume p1 != p4; [L23] assume p1 != p5; [L24] assume p1 != p6; [L25] assume p1 != p7; [L26] assume p1 != p8; [L27] assume p1 != p9; [L28] assume p1 != p10; [L30] assume p2 != p3; [L31] assume p2 != p4; [L32] assume p2 != p5; [L33] assume p2 != p6; [L34] assume p2 != p7; [L35] assume p2 != p8; [L36] assume p2 != p9; [L37] assume p2 != p10; [L39] assume p3 != p4; [L40] assume p3 != p5; [L41] assume p3 != p6; [L42] assume p3 != p7; [L43] assume p3 != p8; [L44] assume p3 != p9; [L45] assume p3 != p10; [L47] assume p4 != p5; [L48] assume p4 != p6; [L49] assume p4 != p7; [L50] assume p4 != p8; [L51] assume p4 != p9; [L52] assume p4 != p10; [L54] assume p5 != p6; [L55] assume p5 != p7; [L56] assume p5 != p8; [L57] assume p5 != p9; [L58] assume p5 != p10; [L60] assume p6 != p7; [L61] assume p6 != p8; [L62] assume p6 != p9; [L63] assume p6 != p10; [L65] assume p7 != p8; [L66] assume p7 != p9; [L67] assume p7 != p10; [L69] assume p8 != p9; [L70] assume p8 != p10; [L72] assume p9 != p10; [L74] #memory_int[p1] := 0; [L75] #memory_int[p2] := 0; [L76] #memory_int[p3] := 0; [L77] #memory_int[p4] := 0; [L78] #memory_int[p5] := 0; [L79] #memory_int[p6] := 0; [L80] #memory_int[p7] := 0; [L81] #memory_int[p8] := 0; [L82] #memory_int[p9] := 0; [L83] #memory_int[p10] := 0; [L108] assert #memory_int[p1] >= 0; [L109] assert #memory_int[p2] <= 0; - UnprovableResult [Line: 110]: Unable to prove that assertion always holds Unable to prove that assertion always holds Reason: abstract domain could reach this error location. Possible FailurePath: [L20] assume p1 != p2; [L21] assume p1 != p3; [L22] assume p1 != p4; [L23] assume p1 != p5; [L24] assume p1 != p6; [L25] assume p1 != p7; [L26] assume p1 != p8; [L27] assume p1 != p9; [L28] assume p1 != p10; [L30] assume p2 != p3; [L31] assume p2 != p4; [L32] assume p2 != p5; [L33] assume p2 != p6; [L34] assume p2 != p7; [L35] assume p2 != p8; [L36] assume p2 != p9; [L37] assume p2 != p10; [L39] assume p3 != p4; [L40] assume p3 != p5; [L41] assume p3 != p6; [L42] assume p3 != p7; [L43] assume p3 != p8; [L44] assume p3 != p9; [L45] assume p3 != p10; [L47] assume p4 != p5; [L48] assume p4 != p6; [L49] assume p4 != p7; [L50] assume p4 != p8; [L51] assume p4 != p9; [L52] assume p4 != p10; [L54] assume p5 != p6; [L55] assume p5 != p7; [L56] assume p5 != p8; [L57] assume p5 != p9; [L58] assume p5 != p10; [L60] assume p6 != p7; [L61] assume p6 != p8; [L62] assume p6 != p9; [L63] assume p6 != p10; [L65] assume p7 != p8; [L66] assume p7 != p9; [L67] assume p7 != p10; [L69] assume p8 != p9; [L70] assume p8 != p10; [L72] assume p9 != p10; [L74] #memory_int[p1] := 0; [L75] #memory_int[p2] := 0; [L76] #memory_int[p3] := 0; [L77] #memory_int[p4] := 0; [L78] #memory_int[p5] := 0; [L79] #memory_int[p6] := 0; [L80] #memory_int[p7] := 0; [L81] #memory_int[p8] := 0; [L82] #memory_int[p9] := 0; [L83] #memory_int[p10] := 0; [L108] assert #memory_int[p1] >= 0; [L109] assert #memory_int[p2] <= 0; [L110] assert #memory_int[p3] >= 0; - UnprovableResult [Line: 111]: Unable to prove that assertion always holds Unable to prove that assertion always holds Reason: abstract domain could reach this error location. Possible FailurePath: [L20] assume p1 != p2; [L21] assume p1 != p3; [L22] assume p1 != p4; [L23] assume p1 != p5; [L24] assume p1 != p6; [L25] assume p1 != p7; [L26] assume p1 != p8; [L27] assume p1 != p9; [L28] assume p1 != p10; [L30] assume p2 != p3; [L31] assume p2 != p4; [L32] assume p2 != p5; [L33] assume p2 != p6; [L34] assume p2 != p7; [L35] assume p2 != p8; [L36] assume p2 != p9; [L37] assume p2 != p10; [L39] assume p3 != p4; [L40] assume p3 != p5; [L41] assume p3 != p6; [L42] assume p3 != p7; [L43] assume p3 != p8; [L44] assume p3 != p9; [L45] assume p3 != p10; [L47] assume p4 != p5; [L48] assume p4 != p6; [L49] assume p4 != p7; [L50] assume p4 != p8; [L51] assume p4 != p9; [L52] assume p4 != p10; [L54] assume p5 != p6; [L55] assume p5 != p7; [L56] assume p5 != p8; [L57] assume p5 != p9; [L58] assume p5 != p10; [L60] assume p6 != p7; [L61] assume p6 != p8; [L62] assume p6 != p9; [L63] assume p6 != p10; [L65] assume p7 != p8; [L66] assume p7 != p9; [L67] assume p7 != p10; [L69] assume p8 != p9; [L70] assume p8 != p10; [L72] assume p9 != p10; [L74] #memory_int[p1] := 0; [L75] #memory_int[p2] := 0; [L76] #memory_int[p3] := 0; [L77] #memory_int[p4] := 0; [L78] #memory_int[p5] := 0; [L79] #memory_int[p6] := 0; [L80] #memory_int[p7] := 0; [L81] #memory_int[p8] := 0; [L82] #memory_int[p9] := 0; [L83] #memory_int[p10] := 0; [L108] assert #memory_int[p1] >= 0; [L109] assert #memory_int[p2] <= 0; [L110] assert #memory_int[p3] >= 0; [L111] assert #memory_int[p4] <= 0; - UnprovableResult [Line: 112]: Unable to prove that assertion always holds Unable to prove that assertion always holds Reason: abstract domain could reach this error location. Possible FailurePath: [L20] assume p1 != p2; [L21] assume p1 != p3; [L22] assume p1 != p4; [L23] assume p1 != p5; [L24] assume p1 != p6; [L25] assume p1 != p7; [L26] assume p1 != p8; [L27] assume p1 != p9; [L28] assume p1 != p10; [L30] assume p2 != p3; [L31] assume p2 != p4; [L32] assume p2 != p5; [L33] assume p2 != p6; [L34] assume p2 != p7; [L35] assume p2 != p8; [L36] assume p2 != p9; [L37] assume p2 != p10; [L39] assume p3 != p4; [L40] assume p3 != p5; [L41] assume p3 != p6; [L42] assume p3 != p7; [L43] assume p3 != p8; [L44] assume p3 != p9; [L45] assume p3 != p10; [L47] assume p4 != p5; [L48] assume p4 != p6; [L49] assume p4 != p7; [L50] assume p4 != p8; [L51] assume p4 != p9; [L52] assume p4 != p10; [L54] assume p5 != p6; [L55] assume p5 != p7; [L56] assume p5 != p8; [L57] assume p5 != p9; [L58] assume p5 != p10; [L60] assume p6 != p7; [L61] assume p6 != p8; [L62] assume p6 != p9; [L63] assume p6 != p10; [L65] assume p7 != p8; [L66] assume p7 != p9; [L67] assume p7 != p10; [L69] assume p8 != p9; [L70] assume p8 != p10; [L72] assume p9 != p10; [L74] #memory_int[p1] := 0; [L75] #memory_int[p2] := 0; [L76] #memory_int[p3] := 0; [L77] #memory_int[p4] := 0; [L78] #memory_int[p5] := 0; [L79] #memory_int[p6] := 0; [L80] #memory_int[p7] := 0; [L81] #memory_int[p8] := 0; [L82] #memory_int[p9] := 0; [L83] #memory_int[p10] := 0; [L108] assert #memory_int[p1] >= 0; [L109] assert #memory_int[p2] <= 0; [L110] assert #memory_int[p3] >= 0; [L111] assert #memory_int[p4] <= 0; [L112] assert #memory_int[p5] >= 0; - UnprovableResult [Line: 113]: Unable to prove that assertion always holds Unable to prove that assertion always holds Reason: abstract domain could reach this error location. Possible FailurePath: [L20] assume p1 != p2; [L21] assume p1 != p3; [L22] assume p1 != p4; [L23] assume p1 != p5; [L24] assume p1 != p6; [L25] assume p1 != p7; [L26] assume p1 != p8; [L27] assume p1 != p9; [L28] assume p1 != p10; [L30] assume p2 != p3; [L31] assume p2 != p4; [L32] assume p2 != p5; [L33] assume p2 != p6; [L34] assume p2 != p7; [L35] assume p2 != p8; [L36] assume p2 != p9; [L37] assume p2 != p10; [L39] assume p3 != p4; [L40] assume p3 != p5; [L41] assume p3 != p6; [L42] assume p3 != p7; [L43] assume p3 != p8; [L44] assume p3 != p9; [L45] assume p3 != p10; [L47] assume p4 != p5; [L48] assume p4 != p6; [L49] assume p4 != p7; [L50] assume p4 != p8; [L51] assume p4 != p9; [L52] assume p4 != p10; [L54] assume p5 != p6; [L55] assume p5 != p7; [L56] assume p5 != p8; [L57] assume p5 != p9; [L58] assume p5 != p10; [L60] assume p6 != p7; [L61] assume p6 != p8; [L62] assume p6 != p9; [L63] assume p6 != p10; [L65] assume p7 != p8; [L66] assume p7 != p9; [L67] assume p7 != p10; [L69] assume p8 != p9; [L70] assume p8 != p10; [L72] assume p9 != p10; [L74] #memory_int[p1] := 0; [L75] #memory_int[p2] := 0; [L76] #memory_int[p3] := 0; [L77] #memory_int[p4] := 0; [L78] #memory_int[p5] := 0; [L79] #memory_int[p6] := 0; [L80] #memory_int[p7] := 0; [L81] #memory_int[p8] := 0; [L82] #memory_int[p9] := 0; [L83] #memory_int[p10] := 0; [L108] assert #memory_int[p1] >= 0; [L109] assert #memory_int[p2] <= 0; [L110] assert #memory_int[p3] >= 0; [L111] assert #memory_int[p4] <= 0; [L112] assert #memory_int[p5] >= 0; [L113] assert #memory_int[p6] <= 0; - UnprovableResult [Line: 114]: Unable to prove that assertion always holds Unable to prove that assertion always holds Reason: abstract domain could reach this error location. Possible FailurePath: [L20] assume p1 != p2; [L21] assume p1 != p3; [L22] assume p1 != p4; [L23] assume p1 != p5; [L24] assume p1 != p6; [L25] assume p1 != p7; [L26] assume p1 != p8; [L27] assume p1 != p9; [L28] assume p1 != p10; [L30] assume p2 != p3; [L31] assume p2 != p4; [L32] assume p2 != p5; [L33] assume p2 != p6; [L34] assume p2 != p7; [L35] assume p2 != p8; [L36] assume p2 != p9; [L37] assume p2 != p10; [L39] assume p3 != p4; [L40] assume p3 != p5; [L41] assume p3 != p6; [L42] assume p3 != p7; [L43] assume p3 != p8; [L44] assume p3 != p9; [L45] assume p3 != p10; [L47] assume p4 != p5; [L48] assume p4 != p6; [L49] assume p4 != p7; [L50] assume p4 != p8; [L51] assume p4 != p9; [L52] assume p4 != p10; [L54] assume p5 != p6; [L55] assume p5 != p7; [L56] assume p5 != p8; [L57] assume p5 != p9; [L58] assume p5 != p10; [L60] assume p6 != p7; [L61] assume p6 != p8; [L62] assume p6 != p9; [L63] assume p6 != p10; [L65] assume p7 != p8; [L66] assume p7 != p9; [L67] assume p7 != p10; [L69] assume p8 != p9; [L70] assume p8 != p10; [L72] assume p9 != p10; [L74] #memory_int[p1] := 0; [L75] #memory_int[p2] := 0; [L76] #memory_int[p3] := 0; [L77] #memory_int[p4] := 0; [L78] #memory_int[p5] := 0; [L79] #memory_int[p6] := 0; [L80] #memory_int[p7] := 0; [L81] #memory_int[p8] := 0; [L82] #memory_int[p9] := 0; [L83] #memory_int[p10] := 0; [L108] assert #memory_int[p1] >= 0; [L109] assert #memory_int[p2] <= 0; [L110] assert #memory_int[p3] >= 0; [L111] assert #memory_int[p4] <= 0; [L112] assert #memory_int[p5] >= 0; [L113] assert #memory_int[p6] <= 0; [L114] assert #memory_int[p7] >= 0; - UnprovableResult [Line: 115]: Unable to prove that assertion always holds Unable to prove that assertion always holds Reason: abstract domain could reach this error location. Possible FailurePath: [L20] assume p1 != p2; [L21] assume p1 != p3; [L22] assume p1 != p4; [L23] assume p1 != p5; [L24] assume p1 != p6; [L25] assume p1 != p7; [L26] assume p1 != p8; [L27] assume p1 != p9; [L28] assume p1 != p10; [L30] assume p2 != p3; [L31] assume p2 != p4; [L32] assume p2 != p5; [L33] assume p2 != p6; [L34] assume p2 != p7; [L35] assume p2 != p8; [L36] assume p2 != p9; [L37] assume p2 != p10; [L39] assume p3 != p4; [L40] assume p3 != p5; [L41] assume p3 != p6; [L42] assume p3 != p7; [L43] assume p3 != p8; [L44] assume p3 != p9; [L45] assume p3 != p10; [L47] assume p4 != p5; [L48] assume p4 != p6; [L49] assume p4 != p7; [L50] assume p4 != p8; [L51] assume p4 != p9; [L52] assume p4 != p10; [L54] assume p5 != p6; [L55] assume p5 != p7; [L56] assume p5 != p8; [L57] assume p5 != p9; [L58] assume p5 != p10; [L60] assume p6 != p7; [L61] assume p6 != p8; [L62] assume p6 != p9; [L63] assume p6 != p10; [L65] assume p7 != p8; [L66] assume p7 != p9; [L67] assume p7 != p10; [L69] assume p8 != p9; [L70] assume p8 != p10; [L72] assume p9 != p10; [L74] #memory_int[p1] := 0; [L75] #memory_int[p2] := 0; [L76] #memory_int[p3] := 0; [L77] #memory_int[p4] := 0; [L78] #memory_int[p5] := 0; [L79] #memory_int[p6] := 0; [L80] #memory_int[p7] := 0; [L81] #memory_int[p8] := 0; [L82] #memory_int[p9] := 0; [L83] #memory_int[p10] := 0; [L108] assert #memory_int[p1] >= 0; [L109] assert #memory_int[p2] <= 0; [L110] assert #memory_int[p3] >= 0; [L111] assert #memory_int[p4] <= 0; [L112] assert #memory_int[p5] >= 0; [L113] assert #memory_int[p6] <= 0; [L114] assert #memory_int[p7] >= 0; [L115] assert #memory_int[p8] <= 0; - UnprovableResult [Line: 116]: Unable to prove that assertion always holds Unable to prove that assertion always holds Reason: abstract domain could reach this error location. Possible FailurePath: [L20] assume p1 != p2; [L21] assume p1 != p3; [L22] assume p1 != p4; [L23] assume p1 != p5; [L24] assume p1 != p6; [L25] assume p1 != p7; [L26] assume p1 != p8; [L27] assume p1 != p9; [L28] assume p1 != p10; [L30] assume p2 != p3; [L31] assume p2 != p4; [L32] assume p2 != p5; [L33] assume p2 != p6; [L34] assume p2 != p7; [L35] assume p2 != p8; [L36] assume p2 != p9; [L37] assume p2 != p10; [L39] assume p3 != p4; [L40] assume p3 != p5; [L41] assume p3 != p6; [L42] assume p3 != p7; [L43] assume p3 != p8; [L44] assume p3 != p9; [L45] assume p3 != p10; [L47] assume p4 != p5; [L48] assume p4 != p6; [L49] assume p4 != p7; [L50] assume p4 != p8; [L51] assume p4 != p9; [L52] assume p4 != p10; [L54] assume p5 != p6; [L55] assume p5 != p7; [L56] assume p5 != p8; [L57] assume p5 != p9; [L58] assume p5 != p10; [L60] assume p6 != p7; [L61] assume p6 != p8; [L62] assume p6 != p9; [L63] assume p6 != p10; [L65] assume p7 != p8; [L66] assume p7 != p9; [L67] assume p7 != p10; [L69] assume p8 != p9; [L70] assume p8 != p10; [L72] assume p9 != p10; [L74] #memory_int[p1] := 0; [L75] #memory_int[p2] := 0; [L76] #memory_int[p3] := 0; [L77] #memory_int[p4] := 0; [L78] #memory_int[p5] := 0; [L79] #memory_int[p6] := 0; [L80] #memory_int[p7] := 0; [L81] #memory_int[p8] := 0; [L82] #memory_int[p9] := 0; [L83] #memory_int[p10] := 0; [L108] assert #memory_int[p1] >= 0; [L109] assert #memory_int[p2] <= 0; [L110] assert #memory_int[p3] >= 0; [L111] assert #memory_int[p4] <= 0; [L112] assert #memory_int[p5] >= 0; [L113] assert #memory_int[p6] <= 0; [L114] assert #memory_int[p7] >= 0; [L115] assert #memory_int[p8] <= 0; [L116] assert #memory_int[p9] >= 0; - UnprovableResult [Line: 117]: Unable to prove that assertion always holds Unable to prove that assertion always holds Reason: abstract domain could reach this error location. Possible FailurePath: [L20] assume p1 != p2; [L21] assume p1 != p3; [L22] assume p1 != p4; [L23] assume p1 != p5; [L24] assume p1 != p6; [L25] assume p1 != p7; [L26] assume p1 != p8; [L27] assume p1 != p9; [L28] assume p1 != p10; [L30] assume p2 != p3; [L31] assume p2 != p4; [L32] assume p2 != p5; [L33] assume p2 != p6; [L34] assume p2 != p7; [L35] assume p2 != p8; [L36] assume p2 != p9; [L37] assume p2 != p10; [L39] assume p3 != p4; [L40] assume p3 != p5; [L41] assume p3 != p6; [L42] assume p3 != p7; [L43] assume p3 != p8; [L44] assume p3 != p9; [L45] assume p3 != p10; [L47] assume p4 != p5; [L48] assume p4 != p6; [L49] assume p4 != p7; [L50] assume p4 != p8; [L51] assume p4 != p9; [L52] assume p4 != p10; [L54] assume p5 != p6; [L55] assume p5 != p7; [L56] assume p5 != p8; [L57] assume p5 != p9; [L58] assume p5 != p10; [L60] assume p6 != p7; [L61] assume p6 != p8; [L62] assume p6 != p9; [L63] assume p6 != p10; [L65] assume p7 != p8; [L66] assume p7 != p9; [L67] assume p7 != p10; [L69] assume p8 != p9; [L70] assume p8 != p10; [L72] assume p9 != p10; [L74] #memory_int[p1] := 0; [L75] #memory_int[p2] := 0; [L76] #memory_int[p3] := 0; [L77] #memory_int[p4] := 0; [L78] #memory_int[p5] := 0; [L79] #memory_int[p6] := 0; [L80] #memory_int[p7] := 0; [L81] #memory_int[p8] := 0; [L82] #memory_int[p9] := 0; [L83] #memory_int[p10] := 0; [L108] assert #memory_int[p1] >= 0; [L109] assert #memory_int[p2] <= 0; [L110] assert #memory_int[p3] >= 0; [L111] assert #memory_int[p4] <= 0; [L112] assert #memory_int[p5] >= 0; [L113] assert #memory_int[p6] <= 0; [L114] assert #memory_int[p7] >= 0; [L115] assert #memory_int[p8] <= 0; [L116] assert #memory_int[p9] >= 0; [L117] assert #memory_int[p10] <= 0; RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces Received shutdown request...