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_oct_cong.epf -i ../../../trunk/examples/programs/20170304-DifficultPathPrograms/eureka_05.i_5.bpl -------------------------------------------------------------------------------- This is Ultimate 0.1.24-1de736e-m [2019-02-15 11:39:34,435 INFO L170 SettingsManager]: Resetting all preferences to default values... [2019-02-15 11:39:34,437 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2019-02-15 11:39:34,449 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-02-15 11:39:34,450 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-02-15 11:39:34,451 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-02-15 11:39:34,452 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-02-15 11:39:34,454 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2019-02-15 11:39:34,456 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-02-15 11:39:34,457 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-02-15 11:39:34,458 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-02-15 11:39:34,460 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-02-15 11:39:34,461 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-02-15 11:39:34,464 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-02-15 11:39:34,469 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-02-15 11:39:34,470 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-02-15 11:39:34,471 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-02-15 11:39:34,473 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-02-15 11:39:34,476 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2019-02-15 11:39:34,485 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-02-15 11:39:34,486 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-02-15 11:39:34,490 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-02-15 11:39:34,493 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-02-15 11:39:34,493 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-02-15 11:39:34,493 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-02-15 11:39:34,496 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-02-15 11:39:34,497 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-02-15 11:39:34,502 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-02-15 11:39:34,504 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2019-02-15 11:39:34,506 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-02-15 11:39:34,507 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2019-02-15 11:39:34,507 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-02-15 11:39:34,508 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-02-15 11:39:34,508 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2019-02-15 11:39:34,509 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2019-02-15 11:39:34,510 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2019-02-15 11:39:34,512 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/ai/array-bench/reach_32bit_compound_oct_cong.epf [2019-02-15 11:39:34,536 INFO L110 SettingsManager]: Loading preferences was successful [2019-02-15 11:39:34,536 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2019-02-15 11:39:34,538 INFO L131 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2019-02-15 11:39:34,538 INFO L133 SettingsManager]: * Show backtranslation warnings=false [2019-02-15 11:39:34,538 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2019-02-15 11:39:34,539 INFO L133 SettingsManager]: * User list type=DISABLED [2019-02-15 11:39:34,539 INFO L133 SettingsManager]: * Inline calls to unimplemented procedures=true [2019-02-15 11:39:34,539 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2019-02-15 11:39:34,539 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2019-02-15 11:39:34,540 INFO L133 SettingsManager]: * Abstract domain=CompoundDomain [2019-02-15 11:39:34,540 INFO L133 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2019-02-15 11:39:34,540 INFO L133 SettingsManager]: * Interval Domain=false [2019-02-15 11:39:34,541 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-02-15 11:39:34,541 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2019-02-15 11:39:34,542 INFO L133 SettingsManager]: * Use SBE=true [2019-02-15 11:39:34,542 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-02-15 11:39:34,542 INFO L133 SettingsManager]: * sizeof long=4 [2019-02-15 11:39:34,542 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2019-02-15 11:39:34,542 INFO L133 SettingsManager]: * sizeof POINTER=4 [2019-02-15 11:39:34,543 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2019-02-15 11:39:34,545 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-02-15 11:39:34,545 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-02-15 11:39:34,545 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-02-15 11:39:34,545 INFO L133 SettingsManager]: * sizeof long double=12 [2019-02-15 11:39:34,545 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2019-02-15 11:39:34,546 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-02-15 11:39:34,546 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-02-15 11:39:34,546 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-02-15 11:39:34,546 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2019-02-15 11:39:34,547 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-02-15 11:39:34,547 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-02-15 11:39:34,547 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-02-15 11:39:34,547 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-02-15 11:39:34,547 INFO L133 SettingsManager]: * Trace refinement strategy=TAIPAN [2019-02-15 11:39:34,549 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-02-15 11:39:34,549 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-02-15 11:39:34,549 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-02-15 11:39:34,550 INFO L133 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2019-02-15 11:39:34,606 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-02-15 11:39:34,619 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-02-15 11:39:34,623 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-02-15 11:39:34,625 INFO L271 PluginConnector]: Initializing Boogie PL CUP Parser... [2019-02-15 11:39:34,625 INFO L276 PluginConnector]: Boogie PL CUP Parser initialized [2019-02-15 11:39:34,626 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/20170304-DifficultPathPrograms/eureka_05.i_5.bpl [2019-02-15 11:39:34,626 INFO L111 BoogieParser]: Parsing: '/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/20170304-DifficultPathPrograms/eureka_05.i_5.bpl' [2019-02-15 11:39:34,669 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-02-15 11:39:34,671 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-02-15 11:39:34,672 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-02-15 11:39:34,672 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-02-15 11:39:34,672 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2019-02-15 11:39:34,690 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "eureka_05.i_5.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 15.02 11:39:34" (1/1) ... [2019-02-15 11:39:34,700 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "eureka_05.i_5.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 15.02 11:39:34" (1/1) ... [2019-02-15 11:39:34,710 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-02-15 11:39:34,711 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-02-15 11:39:34,711 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-02-15 11:39:34,711 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2019-02-15 11:39:34,723 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "eureka_05.i_5.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 15.02 11:39:34" (1/1) ... [2019-02-15 11:39:34,723 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "eureka_05.i_5.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 15.02 11:39:34" (1/1) ... [2019-02-15 11:39:34,724 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "eureka_05.i_5.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 15.02 11:39:34" (1/1) ... [2019-02-15 11:39:34,725 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "eureka_05.i_5.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 15.02 11:39:34" (1/1) ... [2019-02-15 11:39:34,729 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "eureka_05.i_5.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 15.02 11:39:34" (1/1) ... [2019-02-15 11:39:34,731 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "eureka_05.i_5.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 15.02 11:39:34" (1/1) ... [2019-02-15 11:39:34,732 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "eureka_05.i_5.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 15.02 11:39:34" (1/1) ... [2019-02-15 11:39:34,733 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-02-15 11:39:34,734 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-02-15 11:39:34,734 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-02-15 11:39:34,734 INFO L276 PluginConnector]: RCFGBuilder initialized [2019-02-15 11:39:34,735 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "eureka_05.i_5.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 15.02 11:39:34" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-02-15 11:39:34,803 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-02-15 11:39:34,803 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-02-15 11:39:35,133 INFO L695 $ProcedureCfgBuilder]: dead code at ProgramPoint ULTIMATE.startFINAL: assume true; [2019-02-15 11:39:35,135 INFO L281 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-02-15 11:39:35,135 INFO L286 CfgBuilder]: Removed 4 assue(true) statements. [2019-02-15 11:39:35,137 INFO L202 PluginConnector]: Adding new model eureka_05.i_5.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.02 11:39:35 BoogieIcfgContainer [2019-02-15 11:39:35,137 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-02-15 11:39:35,138 INFO L113 PluginConnector]: ------------------------Abstract Interpretation---------------------------- [2019-02-15 11:39:35,138 INFO L271 PluginConnector]: Initializing Abstract Interpretation... [2019-02-15 11:39:35,138 INFO L276 PluginConnector]: Abstract Interpretation initialized [2019-02-15 11:39:35,139 INFO L185 PluginConnector]: Executing the observer AbstractInterpretationRcfgObserver from plugin Abstract Interpretation for "eureka_05.i_5.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.02 11:39:35" (1/1) ... [2019-02-15 11:39:35,192 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-02-15 11:39:35,580 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-02-15 11:39:35,605 INFO L272 AbstractInterpreter]: Visited 9 different actions 55 times. Merged at 4 different actions 23 times. Widened at 4 different actions 10 times. Performed 424 root evaluator evaluations with a maximum evaluation depth of 3. Performed 424 inverse root evaluator evaluations with a maximum inverse evaluation depth of 3. Found 11 fixpoints after 4 different actions. Largest state had 0 variables. [2019-02-15 11:39:35,607 INFO L132 PluginConnector]: ------------------------ END Abstract Interpretation---------------------------- [2019-02-15 11:39:35,608 INFO L168 Benchmark]: Toolchain (without parser) took 938.04 ms. Allocated memory is still 133.7 MB. Free memory was 105.6 MB in the beginning and 66.3 MB in the end (delta: 39.3 MB). Peak memory consumption was 39.3 MB. Max. memory is 7.1 GB. [2019-02-15 11:39:35,614 INFO L168 Benchmark]: Boogie PL CUP Parser took 0.23 ms. Allocated memory is still 133.7 MB. Free memory is still 107.0 MB. There was no memory consumed. Max. memory is 7.1 GB. [2019-02-15 11:39:35,615 INFO L168 Benchmark]: Boogie Procedure Inliner took 38.56 ms. Allocated memory is still 133.7 MB. Free memory was 105.6 MB in the beginning and 103.8 MB in the end (delta: 1.8 MB). Peak memory consumption was 1.8 MB. Max. memory is 7.1 GB. [2019-02-15 11:39:35,616 INFO L168 Benchmark]: Boogie Preprocessor took 22.73 ms. Allocated memory is still 133.7 MB. Free memory was 103.8 MB in the beginning and 102.6 MB in the end (delta: 1.1 MB). Peak memory consumption was 1.1 MB. Max. memory is 7.1 GB. [2019-02-15 11:39:35,617 INFO L168 Benchmark]: RCFGBuilder took 402.91 ms. Allocated memory is still 133.7 MB. Free memory was 102.6 MB in the beginning and 92.3 MB in the end (delta: 10.3 MB). Peak memory consumption was 10.3 MB. Max. memory is 7.1 GB. [2019-02-15 11:39:35,618 INFO L168 Benchmark]: Abstract Interpretation took 469.62 ms. Allocated memory is still 133.7 MB. Free memory was 92.1 MB in the beginning and 66.3 MB in the end (delta: 25.8 MB). Peak memory consumption was 25.8 MB. Max. memory is 7.1 GB. [2019-02-15 11:39:35,623 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.23 ms. Allocated memory is still 133.7 MB. Free memory is still 107.0 MB. There was no memory consumed. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 38.56 ms. Allocated memory is still 133.7 MB. Free memory was 105.6 MB in the beginning and 103.8 MB in the end (delta: 1.8 MB). Peak memory consumption was 1.8 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 22.73 ms. Allocated memory is still 133.7 MB. Free memory was 103.8 MB in the beginning and 102.6 MB in the end (delta: 1.1 MB). Peak memory consumption was 1.1 MB. Max. memory is 7.1 GB. * RCFGBuilder took 402.91 ms. Allocated memory is still 133.7 MB. Free memory was 102.6 MB in the beginning and 92.3 MB in the end (delta: 10.3 MB). Peak memory consumption was 10.3 MB. Max. memory is 7.1 GB. * Abstract Interpretation took 469.62 ms. Allocated memory is still 133.7 MB. Free memory was 92.1 MB in the beginning and 66.3 MB in the end (delta: 25.8 MB). Peak memory consumption was 25.8 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2: - UnprovableResult [Line: 76]: Unable to prove that assertion always holds Unable to prove that assertion always holds Reason: abstract domain could reach this error location. Possible FailurePath: [L21] ~array := ~array[0 := 0]; [L22] ~array := ~array[1 := 0]; [L23] ~array := ~array[2 := 0]; [L24] ~array := ~array[3 := 0]; [L25] ~array := ~array[4 := 0]; [L26] ~n := 5; [L27] havoc main_#res; [L28] havoc main_#t~post2, main_#t~post3, main_~array~7, main_~i~7; [L29] havoc main_~array~7; [L30] havoc main_~i~7; [L31] main_~i~7 := 4; [L48] assume !!(main_~i~7 >= 0); [L49] main_~array~7 := main_~array~7[main_~i~7 := main_~i~7]; [L50] main_#t~post2 := main_~i~7; [L51] main_~i~7 := main_#t~post2 - 1; [L52] havoc main_#t~post2; [L48] assume !!(main_~i~7 >= 0); [L49] main_~array~7 := main_~array~7[main_~i~7 := main_~i~7]; [L50] main_#t~post2 := main_~i~7; [L51] main_~i~7 := main_#t~post2 - 1; [L52] havoc main_#t~post2; [L48] assume !!(main_~i~7 >= 0); [L49] main_~array~7 := main_~array~7[main_~i~7 := main_~i~7]; [L50] main_#t~post2 := main_~i~7; [L51] main_~i~7 := main_#t~post2 - 1; [L52] havoc main_#t~post2; [L48] assume !!(main_~i~7 >= 0); [L49] main_~array~7 := main_~array~7[main_~i~7 := main_~i~7]; [L50] main_#t~post2 := main_~i~7; [L51] main_~i~7 := main_#t~post2 - 1; [L52] havoc main_#t~post2; [L48] assume !!(main_~i~7 >= 0); [L49] main_~array~7 := main_~array~7[main_~i~7 := main_~i~7]; [L50] main_#t~post2 := main_~i~7; [L51] main_~i~7 := main_#t~post2 - 1; [L52] havoc main_#t~post2; [L39] assume !(main_~i~7 >= 0); [L40] havoc SelectionSort_#t~post1, SelectionSort_#t~post0, SelectionSort_~lh~4, SelectionSort_~rh~4, SelectionSort_~i~4, SelectionSort_~temp~4; [L41] havoc SelectionSort_~lh~4; [L42] havoc SelectionSort_~rh~4; [L43] havoc SelectionSort_~i~4; [L44] havoc SelectionSort_~temp~4; [L45] SelectionSort_~lh~4 := 0; [L71] assume !!(SelectionSort_~lh~4 < ~n); [L72] SelectionSort_~rh~4 := SelectionSort_~lh~4; [L73] SelectionSort_~i~4 := SelectionSort_~lh~4 + 1; [L92] assume !!(SelectionSort_~i~4 < ~n); [L93] assume ~array[SelectionSort_~i~4] < ~array[SelectionSort_~rh~4]; [L94] SelectionSort_~rh~4 := SelectionSort_~i~4; [L95] SelectionSort_#t~post1 := SelectionSort_~i~4; [L96] SelectionSort_~i~4 := SelectionSort_#t~post1 + 1; [L97] havoc SelectionSort_#t~post1; [L92] assume !!(SelectionSort_~i~4 < ~n); [L93] assume ~array[SelectionSort_~i~4] < ~array[SelectionSort_~rh~4]; [L94] SelectionSort_~rh~4 := SelectionSort_~i~4; [L95] SelectionSort_#t~post1 := SelectionSort_~i~4; [L96] SelectionSort_~i~4 := SelectionSort_#t~post1 + 1; [L97] havoc SelectionSort_#t~post1; [L92] assume !!(SelectionSort_~i~4 < ~n); [L93] assume ~array[SelectionSort_~i~4] < ~array[SelectionSort_~rh~4]; [L94] SelectionSort_~rh~4 := SelectionSort_~i~4; [L95] SelectionSort_#t~post1 := SelectionSort_~i~4; [L96] SelectionSort_~i~4 := SelectionSort_#t~post1 + 1; [L97] havoc SelectionSort_#t~post1; [L92] assume !!(SelectionSort_~i~4 < ~n); [L93] assume ~array[SelectionSort_~i~4] < ~array[SelectionSort_~rh~4]; [L94] SelectionSort_~rh~4 := SelectionSort_~i~4; [L95] SelectionSort_#t~post1 := SelectionSort_~i~4; [L96] SelectionSort_~i~4 := SelectionSort_#t~post1 + 1; [L97] havoc SelectionSort_#t~post1; [L83] assume !(SelectionSort_~i~4 < ~n); [L84] SelectionSort_~temp~4 := ~array[SelectionSort_~lh~4]; [L85] ~array := ~array[SelectionSort_~lh~4 := ~array[SelectionSort_~rh~4]]; [L86] ~array := ~array[SelectionSort_~rh~4 := SelectionSort_~temp~4]; [L87] SelectionSort_#t~post0 := SelectionSort_~lh~4; [L88] SelectionSort_~lh~4 := SelectionSort_#t~post0 + 1; [L89] havoc SelectionSort_#t~post0; [L71] assume !!(SelectionSort_~lh~4 < ~n); [L72] SelectionSort_~rh~4 := SelectionSort_~lh~4; [L73] SelectionSort_~i~4 := SelectionSort_~lh~4 + 1; [L92] assume !!(SelectionSort_~i~4 < ~n); [L93] assume ~array[SelectionSort_~i~4] < ~array[SelectionSort_~rh~4]; [L94] SelectionSort_~rh~4 := SelectionSort_~i~4; [L95] SelectionSort_#t~post1 := SelectionSort_~i~4; [L96] SelectionSort_~i~4 := SelectionSort_#t~post1 + 1; [L97] havoc SelectionSort_#t~post1; [L83] assume !(SelectionSort_~i~4 < ~n); [L84] SelectionSort_~temp~4 := ~array[SelectionSort_~lh~4]; [L85] ~array := ~array[SelectionSort_~lh~4 := ~array[SelectionSort_~rh~4]]; [L86] ~array := ~array[SelectionSort_~rh~4 := SelectionSort_~temp~4]; [L87] SelectionSort_#t~post0 := SelectionSort_~lh~4; [L88] SelectionSort_~lh~4 := SelectionSort_#t~post0 + 1; [L89] havoc SelectionSort_#t~post0; [L71] assume !!(SelectionSort_~lh~4 < ~n); [L72] SelectionSort_~rh~4 := SelectionSort_~lh~4; [L73] SelectionSort_~i~4 := SelectionSort_~lh~4 + 1; [L92] assume !!(SelectionSort_~i~4 < ~n); [L93] assume ~array[SelectionSort_~i~4] < ~array[SelectionSort_~rh~4]; [L94] SelectionSort_~rh~4 := SelectionSort_~i~4; [L95] SelectionSort_#t~post1 := SelectionSort_~i~4; [L96] SelectionSort_~i~4 := SelectionSort_#t~post1 + 1; [L97] havoc SelectionSort_#t~post1; [L83] assume !(SelectionSort_~i~4 < ~n); [L84] SelectionSort_~temp~4 := ~array[SelectionSort_~lh~4]; [L85] ~array := ~array[SelectionSort_~lh~4 := ~array[SelectionSort_~rh~4]]; [L86] ~array := ~array[SelectionSort_~rh~4 := SelectionSort_~temp~4]; [L87] SelectionSort_#t~post0 := SelectionSort_~lh~4; [L88] SelectionSort_~lh~4 := SelectionSort_#t~post0 + 1; [L89] havoc SelectionSort_#t~post0; [L71] assume !!(SelectionSort_~lh~4 < ~n); [L72] SelectionSort_~rh~4 := SelectionSort_~lh~4; [L73] SelectionSort_~i~4 := SelectionSort_~lh~4 + 1; [L92] assume !!(SelectionSort_~i~4 < ~n); [L93] assume ~array[SelectionSort_~i~4] < ~array[SelectionSort_~rh~4]; [L94] SelectionSort_~rh~4 := SelectionSort_~i~4; [L95] SelectionSort_#t~post1 := SelectionSort_~i~4; [L96] SelectionSort_~i~4 := SelectionSort_#t~post1 + 1; [L97] havoc SelectionSort_#t~post1; [L83] assume !(SelectionSort_~i~4 < ~n); [L84] SelectionSort_~temp~4 := ~array[SelectionSort_~lh~4]; [L85] ~array := ~array[SelectionSort_~lh~4 := ~array[SelectionSort_~rh~4]]; [L86] ~array := ~array[SelectionSort_~rh~4 := SelectionSort_~temp~4]; [L87] SelectionSort_#t~post0 := SelectionSort_~lh~4; [L88] SelectionSort_~lh~4 := SelectionSort_#t~post0 + 1; [L89] havoc SelectionSort_#t~post0; [L71] assume !!(SelectionSort_~lh~4 < ~n); [L72] SelectionSort_~rh~4 := SelectionSort_~lh~4; [L73] SelectionSort_~i~4 := SelectionSort_~lh~4 + 1; [L83] assume !(SelectionSort_~i~4 < ~n); [L84] SelectionSort_~temp~4 := ~array[SelectionSort_~lh~4]; [L85] ~array := ~array[SelectionSort_~lh~4 := ~array[SelectionSort_~rh~4]]; [L86] ~array := ~array[SelectionSort_~rh~4 := SelectionSort_~temp~4]; [L87] SelectionSort_#t~post0 := SelectionSort_~lh~4; [L88] SelectionSort_~lh~4 := SelectionSort_#t~post0 + 1; [L89] havoc SelectionSort_#t~post0; [L60] assume !(SelectionSort_~lh~4 < ~n); [L61] main_~i~7 := 0; [L63] assume !!(main_~i~7 < 5); [L64] __VERIFIER_assert_#in~cond := (if main_~array~7[main_~i~7] == main_~i~7 then 1 else 0); [L65] havoc __VERIFIER_assert_~cond; [L66] __VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; [L67] assume __VERIFIER_assert_~cond == 0; [L68] assume !false; [L76] assert false; RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces Received shutdown request...