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/quantifier/Arrays/Arrays20.bpl -------------------------------------------------------------------------------- This is Ultimate 0.1.24-b8c145f [2019-08-05 12:17:39,032 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-08-05 12:17:39,034 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-08-05 12:17:39,046 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-08-05 12:17:39,046 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-08-05 12:17:39,047 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-08-05 12:17:39,049 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-08-05 12:17:39,050 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-08-05 12:17:39,052 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-08-05 12:17:39,053 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-08-05 12:17:39,054 INFO L181 SettingsManager]: Resetting Symbolic Interpretation preferences to default values [2019-08-05 12:17:39,054 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-08-05 12:17:39,055 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-08-05 12:17:39,056 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-08-05 12:17:39,057 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-08-05 12:17:39,058 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-08-05 12:17:39,059 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-08-05 12:17:39,060 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-08-05 12:17:39,061 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-08-05 12:17:39,064 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-08-05 12:17:39,065 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-08-05 12:17:39,066 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-08-05 12:17:39,067 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-08-05 12:17:39,068 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-08-05 12:17:39,071 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-08-05 12:17:39,071 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-08-05 12:17:39,071 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-08-05 12:17:39,072 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-08-05 12:17:39,073 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-08-05 12:17:39,074 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-08-05 12:17:39,074 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-08-05 12:17:39,075 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-08-05 12:17:39,076 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-08-05 12:17:39,077 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-08-05 12:17:39,078 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-08-05 12:17:39,078 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-08-05 12:17:39,081 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-08-05 12:17:39,081 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-08-05 12:17:39,081 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-08-05 12:17:39,082 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-08-05 12:17:39,083 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-08-05 12:17:39,085 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:17:39,113 INFO L113 SettingsManager]: Loading preferences was successful [2019-08-05 12:17:39,114 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-08-05 12:17:39,114 INFO L136 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2019-08-05 12:17:39,115 INFO L138 SettingsManager]: * Show backtranslation warnings=false [2019-08-05 12:17:39,115 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2019-08-05 12:17:39,115 INFO L138 SettingsManager]: * User list type=DISABLED [2019-08-05 12:17:39,115 INFO L138 SettingsManager]: * Inline calls to unimplemented procedures=true [2019-08-05 12:17:39,115 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2019-08-05 12:17:39,116 INFO L138 SettingsManager]: * Explicit value domain=true [2019-08-05 12:17:39,116 INFO L138 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2019-08-05 12:17:39,116 INFO L138 SettingsManager]: * Octagon Domain=false [2019-08-05 12:17:39,116 INFO L138 SettingsManager]: * Abstract domain=CompoundDomain [2019-08-05 12:17:39,116 INFO L138 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2019-08-05 12:17:39,117 INFO L138 SettingsManager]: * Interval Domain=false [2019-08-05 12:17:39,117 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-08-05 12:17:39,117 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-08-05 12:17:39,118 INFO L138 SettingsManager]: * Use SBE=true [2019-08-05 12:17:39,118 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-08-05 12:17:39,118 INFO L138 SettingsManager]: * sizeof long=4 [2019-08-05 12:17:39,118 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-08-05 12:17:39,118 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-08-05 12:17:39,119 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-08-05 12:17:39,119 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-08-05 12:17:39,119 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-08-05 12:17:39,119 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-08-05 12:17:39,119 INFO L138 SettingsManager]: * sizeof long double=12 [2019-08-05 12:17:39,120 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-08-05 12:17:39,120 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-08-05 12:17:39,120 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-08-05 12:17:39,120 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-08-05 12:17:39,120 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-08-05 12:17:39,121 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-08-05 12:17:39,121 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-08-05 12:17:39,121 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-08-05 12:17:39,121 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-08-05 12:17:39,121 INFO L138 SettingsManager]: * Trace refinement strategy=TAIPAN [2019-08-05 12:17:39,122 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-08-05 12:17:39,122 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-08-05 12:17:39,122 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-08-05 12:17:39,122 INFO L138 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2019-08-05 12:17:39,155 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-08-05 12:17:39,168 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-08-05 12:17:39,172 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-08-05 12:17:39,173 INFO L271 PluginConnector]: Initializing Boogie PL CUP Parser... [2019-08-05 12:17:39,174 INFO L275 PluginConnector]: Boogie PL CUP Parser initialized [2019-08-05 12:17:39,174 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/quantifier/Arrays/Arrays20.bpl [2019-08-05 12:17:39,175 INFO L110 BoogieParser]: Parsing: '/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/quantifier/Arrays/Arrays20.bpl' [2019-08-05 12:17:39,214 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-08-05 12:17:39,215 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-08-05 12:17:39,216 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-08-05 12:17:39,216 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-08-05 12:17:39,216 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-08-05 12:17:39,232 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "Arrays20.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 12:17:39" (1/1) ... [2019-08-05 12:17:39,242 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "Arrays20.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 12:17:39" (1/1) ... [2019-08-05 12:17:39,248 WARN L165 Inliner]: Program contained no entry procedure! [2019-08-05 12:17:39,249 WARN L168 Inliner]: Missing entry procedures: [ULTIMATE.start] [2019-08-05 12:17:39,249 WARN L175 Inliner]: Fallback enabled. All procedures will be processed. [2019-08-05 12:17:39,264 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-08-05 12:17:39,265 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-08-05 12:17:39,265 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-08-05 12:17:39,266 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-08-05 12:17:39,276 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "Arrays20.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 12:17:39" (1/1) ... [2019-08-05 12:17:39,276 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "Arrays20.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 12:17:39" (1/1) ... [2019-08-05 12:17:39,278 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "Arrays20.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 12:17:39" (1/1) ... [2019-08-05 12:17:39,278 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "Arrays20.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 12:17:39" (1/1) ... [2019-08-05 12:17:39,281 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "Arrays20.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 12:17:39" (1/1) ... [2019-08-05 12:17:39,286 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "Arrays20.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 12:17:39" (1/1) ... [2019-08-05 12:17:39,287 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "Arrays20.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 12:17:39" (1/1) ... [2019-08-05 12:17:39,289 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-08-05 12:17:39,290 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-08-05 12:17:39,290 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-08-05 12:17:39,290 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-08-05 12:17:39,291 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "Arrays20.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 12:17:39" (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:17:39,354 INFO L130 BoogieDeclarations]: Found specification of procedure p2 [2019-08-05 12:17:39,354 INFO L138 BoogieDeclarations]: Found implementation of procedure p2 [2019-08-05 12:17:39,354 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-08-05 12:17:39,355 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-08-05 12:17:40,000 INFO L275 CfgBuilder]: Using library mode [2019-08-05 12:17:40,000 INFO L283 CfgBuilder]: Removed 2 assume(true) statements. [2019-08-05 12:17:40,001 INFO L202 PluginConnector]: Adding new model Arrays20.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 05.08 12:17:40 BoogieIcfgContainer [2019-08-05 12:17:40,001 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-08-05 12:17:40,002 INFO L113 PluginConnector]: ------------------------Abstract Interpretation---------------------------- [2019-08-05 12:17:40,002 INFO L271 PluginConnector]: Initializing Abstract Interpretation... [2019-08-05 12:17:40,002 INFO L275 PluginConnector]: Abstract Interpretation initialized [2019-08-05 12:17:40,003 INFO L185 PluginConnector]: Executing the observer AbstractInterpretationRcfgObserver from plugin Abstract Interpretation for "Arrays20.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 05.08 12:17:40" (1/1) ... [2019-08-05 12:17:40,028 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-08-05 12:17:40,166 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-08-05 12:17:40,199 INFO L272 AbstractInterpreter]: Visited 45 different actions 64 times. Merged at 6 different actions 11 times. Widened at 1 different actions 1 times. Performed 226 root evaluator evaluations with a maximum evaluation depth of 4. Performed 226 inverse root evaluator evaluations with a maximum inverse evaluation depth of 4. Found 7 fixpoints after 6 different actions. Largest state had 0 variables. [2019-08-05 12:17:40,200 INFO L132 PluginConnector]: ------------------------ END Abstract Interpretation---------------------------- [2019-08-05 12:17:40,203 INFO L168 Benchmark]: Toolchain (without parser) took 986.24 ms. Allocated memory is still 140.0 MB. Free memory was 106.1 MB in the beginning and 80.0 MB in the end (delta: 26.1 MB). Peak memory consumption was 26.1 MB. Max. memory is 7.1 GB. [2019-08-05 12:17:40,204 INFO L168 Benchmark]: Boogie PL CUP Parser took 0.18 ms. Allocated memory is still 140.0 MB. Free memory was 107.4 MB in the beginning and 107.2 MB in the end (delta: 210.0 kB). Peak memory consumption was 210.0 kB. Max. memory is 7.1 GB. [2019-08-05 12:17:40,206 INFO L168 Benchmark]: Boogie Procedure Inliner took 48.99 ms. Allocated memory is still 140.0 MB. Free memory was 105.9 MB in the beginning and 103.7 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:17:40,207 INFO L168 Benchmark]: Boogie Preprocessor took 23.93 ms. Allocated memory is still 140.0 MB. Free memory was 103.7 MB in the beginning and 102.4 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:17:40,209 INFO L168 Benchmark]: RCFGBuilder took 711.86 ms. Allocated memory is still 140.0 MB. Free memory was 102.4 MB in the beginning and 88.9 MB in the end (delta: 13.5 MB). Peak memory consumption was 13.5 MB. Max. memory is 7.1 GB. [2019-08-05 12:17:40,210 INFO L168 Benchmark]: Abstract Interpretation took 198.08 ms. Allocated memory is still 140.0 MB. Free memory was 88.7 MB in the beginning and 80.0 MB in the end (delta: 8.7 MB). Peak memory consumption was 8.7 MB. Max. memory is 7.1 GB. [2019-08-05 12:17:40,215 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.18 ms. Allocated memory is still 140.0 MB. Free memory was 107.4 MB in the beginning and 107.2 MB in the end (delta: 210.0 kB). Peak memory consumption was 210.0 kB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 48.99 ms. Allocated memory is still 140.0 MB. Free memory was 105.9 MB in the beginning and 103.7 MB in the end (delta: 2.2 MB). Peak memory consumption was 2.2 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 23.93 ms. Allocated memory is still 140.0 MB. Free memory was 103.7 MB in the beginning and 102.4 MB in the end (delta: 1.3 MB). Peak memory consumption was 1.3 MB. Max. memory is 7.1 GB. * RCFGBuilder took 711.86 ms. Allocated memory is still 140.0 MB. Free memory was 102.4 MB in the beginning and 88.9 MB in the end (delta: 13.5 MB). Peak memory consumption was 13.5 MB. Max. memory is 7.1 GB. * Abstract Interpretation took 198.08 ms. Allocated memory is still 140.0 MB. Free memory was 88.7 MB in the beginning and 80.0 MB in the end (delta: 8.7 MB). Peak memory consumption was 8.7 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2: - UnprovableResult [Line: 35]: Unable to prove that assertion always holds Unable to prove that assertion always holds Reason: abstract domain could reach this error location. Possible FailurePath: [L24] a[0] := 1; [L25] a[1] := 2; [L26] a[2] := 3; [L27] a[3] := 4; [L28] a[4] := 5; [L29] a[5] := 6; [L30] a[6] := 7; [L31] a[7] := 8; [L32] a[8] := 9; [L33] a[9] := 10; [L34] a[10] := 11; [L35] assert a[0] == 1; - UnprovableResult [Line: 36]: Unable to prove that assertion always holds Unable to prove that assertion always holds Reason: abstract domain could reach this error location. Possible FailurePath: [L24] a[0] := 1; [L25] a[1] := 2; [L26] a[2] := 3; [L27] a[3] := 4; [L28] a[4] := 5; [L29] a[5] := 6; [L30] a[6] := 7; [L31] a[7] := 8; [L32] a[8] := 9; [L33] a[9] := 10; [L34] a[10] := 11; [L35] assert a[0] == 1; [L36] assert a[1] == 2; - UnprovableResult [Line: 37]: Unable to prove that assertion always holds Unable to prove that assertion always holds Reason: abstract domain could reach this error location. Possible FailurePath: [L24] a[0] := 1; [L25] a[1] := 2; [L26] a[2] := 3; [L27] a[3] := 4; [L28] a[4] := 5; [L29] a[5] := 6; [L30] a[6] := 7; [L31] a[7] := 8; [L32] a[8] := 9; [L33] a[9] := 10; [L34] a[10] := 11; [L35] assert a[0] == 1; [L36] assert a[1] == 2; [L37] assert a[2] == 3; - UnprovableResult [Line: 38]: Unable to prove that assertion always holds Unable to prove that assertion always holds Reason: abstract domain could reach this error location. Possible FailurePath: [L24] a[0] := 1; [L25] a[1] := 2; [L26] a[2] := 3; [L27] a[3] := 4; [L28] a[4] := 5; [L29] a[5] := 6; [L30] a[6] := 7; [L31] a[7] := 8; [L32] a[8] := 9; [L33] a[9] := 10; [L34] a[10] := 11; [L35] assert a[0] == 1; [L36] assert a[1] == 2; [L37] assert a[2] == 3; [L38] assert a[3] == 4; - UnprovableResult [Line: 39]: Unable to prove that assertion always holds Unable to prove that assertion always holds Reason: abstract domain could reach this error location. Possible FailurePath: [L24] a[0] := 1; [L25] a[1] := 2; [L26] a[2] := 3; [L27] a[3] := 4; [L28] a[4] := 5; [L29] a[5] := 6; [L30] a[6] := 7; [L31] a[7] := 8; [L32] a[8] := 9; [L33] a[9] := 10; [L34] a[10] := 11; [L35] assert a[0] == 1; [L36] assert a[1] == 2; [L37] assert a[2] == 3; [L38] assert a[3] == 4; [L39] assert a[4] == 5; - UnprovableResult [Line: 40]: Unable to prove that assertion always holds Unable to prove that assertion always holds Reason: abstract domain could reach this error location. Possible FailurePath: [L24] a[0] := 1; [L25] a[1] := 2; [L26] a[2] := 3; [L27] a[3] := 4; [L28] a[4] := 5; [L29] a[5] := 6; [L30] a[6] := 7; [L31] a[7] := 8; [L32] a[8] := 9; [L33] a[9] := 10; [L34] a[10] := 11; [L35] assert a[0] == 1; [L36] assert a[1] == 2; [L37] assert a[2] == 3; [L38] assert a[3] == 4; [L39] assert a[4] == 5; [L40] assert a[5] == 6; - UnprovableResult [Line: 41]: Unable to prove that assertion always holds Unable to prove that assertion always holds Reason: abstract domain could reach this error location. Possible FailurePath: [L24] a[0] := 1; [L25] a[1] := 2; [L26] a[2] := 3; [L27] a[3] := 4; [L28] a[4] := 5; [L29] a[5] := 6; [L30] a[6] := 7; [L31] a[7] := 8; [L32] a[8] := 9; [L33] a[9] := 10; [L34] a[10] := 11; [L35] assert a[0] == 1; [L36] assert a[1] == 2; [L37] assert a[2] == 3; [L38] assert a[3] == 4; [L39] assert a[4] == 5; [L40] assert a[5] == 6; [L41] assert a[6] == 7; - UnprovableResult [Line: 42]: Unable to prove that assertion always holds Unable to prove that assertion always holds Reason: abstract domain could reach this error location. Possible FailurePath: [L24] a[0] := 1; [L25] a[1] := 2; [L26] a[2] := 3; [L27] a[3] := 4; [L28] a[4] := 5; [L29] a[5] := 6; [L30] a[6] := 7; [L31] a[7] := 8; [L32] a[8] := 9; [L33] a[9] := 10; [L34] a[10] := 11; [L35] assert a[0] == 1; [L36] assert a[1] == 2; [L37] assert a[2] == 3; [L38] assert a[3] == 4; [L39] assert a[4] == 5; [L40] assert a[5] == 6; [L41] assert a[6] == 7; [L42] assert a[7] == 8; - UnprovableResult [Line: 43]: Unable to prove that assertion always holds Unable to prove that assertion always holds Reason: abstract domain could reach this error location. Possible FailurePath: [L24] a[0] := 1; [L25] a[1] := 2; [L26] a[2] := 3; [L27] a[3] := 4; [L28] a[4] := 5; [L29] a[5] := 6; [L30] a[6] := 7; [L31] a[7] := 8; [L32] a[8] := 9; [L33] a[9] := 10; [L34] a[10] := 11; [L35] assert a[0] == 1; [L36] assert a[1] == 2; [L37] assert a[2] == 3; [L38] assert a[3] == 4; [L39] assert a[4] == 5; [L40] assert a[5] == 6; [L41] assert a[6] == 7; [L42] assert a[7] == 8; [L43] assert a[8] == 9; - UnprovableResult [Line: 44]: Unable to prove that assertion always holds Unable to prove that assertion always holds Reason: abstract domain could reach this error location. Possible FailurePath: [L24] a[0] := 1; [L25] a[1] := 2; [L26] a[2] := 3; [L27] a[3] := 4; [L28] a[4] := 5; [L29] a[5] := 6; [L30] a[6] := 7; [L31] a[7] := 8; [L32] a[8] := 9; [L33] a[9] := 10; [L34] a[10] := 11; [L35] assert a[0] == 1; [L36] assert a[1] == 2; [L37] assert a[2] == 3; [L38] assert a[3] == 4; [L39] assert a[4] == 5; [L40] assert a[5] == 6; [L41] assert a[6] == 7; [L42] assert a[7] == 8; [L43] assert a[8] == 9; [L44] assert a[10] == 11; - UnprovableResult [Line: 45]: Unable to prove that assertion always holds Unable to prove that assertion always holds Reason: abstract domain could reach this error location. Possible FailurePath: [L24] a[0] := 1; [L25] a[1] := 2; [L26] a[2] := 3; [L27] a[3] := 4; [L28] a[4] := 5; [L29] a[5] := 6; [L30] a[6] := 7; [L31] a[7] := 8; [L32] a[8] := 9; [L33] a[9] := 10; [L34] a[10] := 11; [L35] assert a[0] == 1; [L36] assert a[1] == 2; [L37] assert a[2] == 3; [L38] assert a[3] == 4; [L39] assert a[4] == 5; [L40] assert a[5] == 6; [L41] assert a[6] == 7; [L42] assert a[7] == 8; [L43] assert a[8] == 9; [L44] assert a[10] == 11; [L45] assert a[11] == 12; - UnprovableResult [Line: 46]: Unable to prove that assertion always holds Unable to prove that assertion always holds Reason: abstract domain could reach this error location. Possible FailurePath: [L24] a[0] := 1; [L25] a[1] := 2; [L26] a[2] := 3; [L27] a[3] := 4; [L28] a[4] := 5; [L29] a[5] := 6; [L30] a[6] := 7; [L31] a[7] := 8; [L32] a[8] := 9; [L33] a[9] := 10; [L34] a[10] := 11; [L35] assert a[0] == 1; [L36] assert a[1] == 2; [L37] assert a[2] == 3; [L38] assert a[3] == 4; [L39] assert a[4] == 5; [L40] assert a[5] == 6; [L41] assert a[6] == 7; [L42] assert a[7] == 8; [L43] assert a[8] == 9; [L44] assert a[10] == 11; [L45] assert a[11] == 12; [L46] assert a[12] == 13; - UnprovableResult [Line: 48]: Unable to prove that assertion always holds Unable to prove that assertion always holds Reason: abstract domain could reach this error location. Possible FailurePath: [L24] a[0] := 1; [L25] a[1] := 2; [L26] a[2] := 3; [L27] a[3] := 4; [L28] a[4] := 5; [L29] a[5] := 6; [L30] a[6] := 7; [L31] a[7] := 8; [L32] a[8] := 9; [L33] a[9] := 10; [L34] a[10] := 11; [L35] assert a[0] == 1; [L36] assert a[1] == 2; [L37] assert a[2] == 3; [L38] assert a[3] == 4; [L39] assert a[4] == 5; [L40] assert a[5] == 6; [L41] assert a[6] == 7; [L42] assert a[7] == 8; [L43] assert a[8] == 9; [L44] assert a[10] == 11; [L45] assert a[11] == 12; [L46] assert a[12] == 13; [L47] COND TRUE i < 10 && i >= 0 [L48] assert a[i] <= 10; - UnprovableResult [Line: 51]: Unable to prove that assertion always holds Unable to prove that assertion always holds Reason: abstract domain could reach this error location. Possible FailurePath: [L24] a[0] := 1; [L25] a[1] := 2; [L26] a[2] := 3; [L27] a[3] := 4; [L28] a[4] := 5; [L29] a[5] := 6; [L30] a[6] := 7; [L31] a[7] := 8; [L32] a[8] := 9; [L33] a[9] := 10; [L34] a[10] := 11; [L35] assert a[0] == 1; [L36] assert a[1] == 2; [L37] assert a[2] == 3; [L38] assert a[3] == 4; [L39] assert a[4] == 5; [L40] assert a[5] == 6; [L41] assert a[6] == 7; [L42] assert a[7] == 8; [L43] assert a[8] == 9; [L44] assert a[10] == 11; [L45] assert a[11] == 12; [L46] assert a[12] == 13; [L47] COND FALSE !(i < 10 && i >= 0) [L50] i := 0; [L51] assert a[i] == 1; - UnprovableResult [Line: 53]: Unable to prove that assertion always holds Unable to prove that assertion always holds Reason: abstract domain could reach this error location. Possible FailurePath: [L24] a[0] := 1; [L25] a[1] := 2; [L26] a[2] := 3; [L27] a[3] := 4; [L28] a[4] := 5; [L29] a[5] := 6; [L30] a[6] := 7; [L31] a[7] := 8; [L32] a[8] := 9; [L33] a[9] := 10; [L34] a[10] := 11; [L35] assert a[0] == 1; [L36] assert a[1] == 2; [L37] assert a[2] == 3; [L38] assert a[3] == 4; [L39] assert a[4] == 5; [L40] assert a[5] == 6; [L41] assert a[6] == 7; [L42] assert a[7] == 8; [L43] assert a[8] == 9; [L44] assert a[10] == 11; [L45] assert a[11] == 12; [L46] assert a[12] == 13; [L47] COND FALSE !(i < 10 && i >= 0) [L50] i := 0; [L51] assert a[i] == 1; [L52] i := i + 1; [L53] assert a[i] == 2; - 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: [L24] a[0] := 1; [L25] a[1] := 2; [L26] a[2] := 3; [L27] a[3] := 4; [L28] a[4] := 5; [L29] a[5] := 6; [L30] a[6] := 7; [L31] a[7] := 8; [L32] a[8] := 9; [L33] a[9] := 10; [L34] a[10] := 11; [L35] assert a[0] == 1; [L36] assert a[1] == 2; [L37] assert a[2] == 3; [L38] assert a[3] == 4; [L39] assert a[4] == 5; [L40] assert a[5] == 6; [L41] assert a[6] == 7; [L42] assert a[7] == 8; [L43] assert a[8] == 9; [L44] assert a[10] == 11; [L45] assert a[11] == 12; [L46] assert a[12] == 13; [L47] COND TRUE i < 10 && i >= 0 [L48] assert a[i] <= 10; [L11] i := 0; [L12] COND TRUE i < 20 [L13] a[i] := b[i]; [L14] i := i + 1; [L12] COND TRUE i < 20 [L13] a[i] := b[i]; [L14] i := i + 1; [L12] COND FALSE !(i < 20) [L56] i := 0; [L57] COND TRUE i < 20 [L58] assert a[i] == b[i]; RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces Received shutdown request...