./Ultimate.py --spec ../sv-benchmarks/c/properties/termination.prp --file ../sv-benchmarks/c/termination-memory-alloca/selectionsort-alloca-2.i --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for termination Using default analysis Version f470102c Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx12G -Xms1G -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerTermination.xml -i ../sv-benchmarks/c/termination-memory-alloca/selectionsort-alloca-2.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-64bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(F end) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 64bit --witnessprinter.graph.data.programhash 7a61d79c4ca9451b26ba6dc1b90600e9ebfec9cf ................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................ Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.25-f470102 [2019-11-28 20:34:51,474 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-28 20:34:51,477 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-28 20:34:51,490 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-28 20:34:51,490 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-28 20:34:51,492 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-28 20:34:51,493 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-28 20:34:51,495 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-28 20:34:51,498 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-28 20:34:51,499 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-28 20:34:51,500 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-28 20:34:51,501 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-28 20:34:51,502 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-28 20:34:51,503 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-28 20:34:51,504 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-28 20:34:51,506 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-28 20:34:51,507 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-28 20:34:51,508 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-28 20:34:51,510 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-28 20:34:51,512 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-28 20:34:51,514 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-28 20:34:51,516 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-28 20:34:51,517 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-28 20:34:51,518 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-28 20:34:51,521 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-28 20:34:51,521 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-28 20:34:51,522 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-28 20:34:51,523 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-28 20:34:51,523 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-28 20:34:51,525 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-28 20:34:51,525 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-28 20:34:51,526 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-28 20:34:51,527 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-28 20:34:51,528 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-28 20:34:51,529 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-28 20:34:51,529 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-28 20:34:51,530 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-28 20:34:51,531 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-28 20:34:51,531 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-28 20:34:51,532 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-28 20:34:51,533 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-28 20:34:51,534 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-64bit-Automizer_Default.epf [2019-11-28 20:34:51,558 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-28 20:34:51,558 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-28 20:34:51,560 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-11-28 20:34:51,560 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-11-28 20:34:51,561 INFO L138 SettingsManager]: * Use SBE=true [2019-11-28 20:34:51,561 INFO L136 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2019-11-28 20:34:51,561 INFO L138 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2019-11-28 20:34:51,561 INFO L138 SettingsManager]: * Use old map elimination=false [2019-11-28 20:34:51,562 INFO L138 SettingsManager]: * Use external solver (rank synthesis)=false [2019-11-28 20:34:51,562 INFO L138 SettingsManager]: * Use only trivial implications for array writes=true [2019-11-28 20:34:51,563 INFO L138 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2019-11-28 20:34:51,564 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-28 20:34:51,564 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2019-11-28 20:34:51,564 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-11-28 20:34:51,565 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-28 20:34:51,565 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2019-11-28 20:34:51,565 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2019-11-28 20:34:51,566 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2019-11-28 20:34:51,566 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-11-28 20:34:51,566 INFO L138 SettingsManager]: * Assume nondeterminstic values are in range=false [2019-11-28 20:34:51,567 INFO L138 SettingsManager]: * Use constant arrays=true [2019-11-28 20:34:51,567 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2019-11-28 20:34:51,567 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-28 20:34:51,568 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-11-28 20:34:51,568 INFO L138 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2019-11-28 20:34:51,568 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-28 20:34:51,569 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-11-28 20:34:51,569 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2019-11-28 20:34:51,569 INFO L138 SettingsManager]: * Dump automata to the following directory=/home/matthias/ultimate/dump/auto [2019-11-28 20:34:51,571 INFO L136 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2019-11-28 20:34:51,571 INFO L138 SettingsManager]: * TransformationType=MODULO_NEIGHBOR Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(F end) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 64bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 7a61d79c4ca9451b26ba6dc1b90600e9ebfec9cf [2019-11-28 20:34:51,899 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-28 20:34:51,912 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-28 20:34:51,916 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-28 20:34:51,917 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-28 20:34:51,918 INFO L275 PluginConnector]: CDTParser initialized [2019-11-28 20:34:51,918 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/termination-memory-alloca/selectionsort-alloca-2.i [2019-11-28 20:34:51,978 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/834bc8123/a179e56e92d145158246e4de7aa13dc9/FLAG2eb59a563 [2019-11-28 20:34:52,509 INFO L306 CDTParser]: Found 1 translation units. [2019-11-28 20:34:52,510 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/termination-memory-alloca/selectionsort-alloca-2.i [2019-11-28 20:34:52,538 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/834bc8123/a179e56e92d145158246e4de7aa13dc9/FLAG2eb59a563 [2019-11-28 20:34:52,825 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/834bc8123/a179e56e92d145158246e4de7aa13dc9 [2019-11-28 20:34:52,831 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-28 20:34:52,833 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-11-28 20:34:52,835 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-28 20:34:52,836 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-28 20:34:52,839 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-28 20:34:52,841 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.11 08:34:52" (1/1) ... [2019-11-28 20:34:52,845 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7261e065 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 08:34:52, skipping insertion in model container [2019-11-28 20:34:52,845 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.11 08:34:52" (1/1) ... [2019-11-28 20:34:52,854 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-11-28 20:34:52,915 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-11-28 20:34:53,352 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-28 20:34:53,363 INFO L203 MainTranslator]: Completed pre-run [2019-11-28 20:34:53,407 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-28 20:34:53,462 INFO L208 MainTranslator]: Completed translation [2019-11-28 20:34:53,462 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 08:34:53 WrapperNode [2019-11-28 20:34:53,463 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-28 20:34:53,464 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-11-28 20:34:53,464 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-11-28 20:34:53,464 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-11-28 20:34:53,474 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 08:34:53" (1/1) ... [2019-11-28 20:34:53,492 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 08:34:53" (1/1) ... [2019-11-28 20:34:53,515 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-11-28 20:34:53,516 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-11-28 20:34:53,516 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-11-28 20:34:53,516 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-11-28 20:34:53,526 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 08:34:53" (1/1) ... [2019-11-28 20:34:53,527 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 08:34:53" (1/1) ... [2019-11-28 20:34:53,530 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 08:34:53" (1/1) ... [2019-11-28 20:34:53,530 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 08:34:53" (1/1) ... [2019-11-28 20:34:53,537 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 08:34:53" (1/1) ... [2019-11-28 20:34:53,542 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 08:34:53" (1/1) ... [2019-11-28 20:34:53,544 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 08:34:53" (1/1) ... [2019-11-28 20:34:53,547 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-11-28 20:34:53,547 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-11-28 20:34:53,548 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-11-28 20:34:53,548 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-11-28 20:34:53,549 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 08:34:53" (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:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 20:34:53,607 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2019-11-28 20:34:53,607 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-11-28 20:34:53,607 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-11-28 20:34:53,608 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-11-28 20:34:53,608 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-11-28 20:34:53,608 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-11-28 20:34:53,957 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-11-28 20:34:53,957 INFO L287 CfgBuilder]: Removed 8 assume(true) statements. [2019-11-28 20:34:53,959 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 08:34:53 BoogieIcfgContainer [2019-11-28 20:34:53,959 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-11-28 20:34:53,960 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2019-11-28 20:34:53,960 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2019-11-28 20:34:53,964 INFO L275 PluginConnector]: BuchiAutomizer initialized [2019-11-28 20:34:53,965 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-11-28 20:34:53,965 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 28.11 08:34:52" (1/3) ... [2019-11-28 20:34:53,966 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@47c467d2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 28.11 08:34:53, skipping insertion in model container [2019-11-28 20:34:53,967 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-11-28 20:34:53,967 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 08:34:53" (2/3) ... [2019-11-28 20:34:53,967 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@47c467d2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 28.11 08:34:53, skipping insertion in model container [2019-11-28 20:34:53,968 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-11-28 20:34:53,968 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 08:34:53" (3/3) ... [2019-11-28 20:34:53,970 INFO L371 chiAutomizerObserver]: Analyzing ICFG selectionsort-alloca-2.i [2019-11-28 20:34:54,013 INFO L356 BuchiCegarLoop]: Interprodecural is true [2019-11-28 20:34:54,014 INFO L357 BuchiCegarLoop]: Hoare is false [2019-11-28 20:34:54,014 INFO L358 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2019-11-28 20:34:54,014 INFO L359 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2019-11-28 20:34:54,014 INFO L360 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-11-28 20:34:54,015 INFO L361 BuchiCegarLoop]: Difference is false [2019-11-28 20:34:54,015 INFO L362 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-11-28 20:34:54,015 INFO L365 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2019-11-28 20:34:54,027 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 14 states. [2019-11-28 20:34:54,048 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 6 [2019-11-28 20:34:54,048 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-28 20:34:54,048 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-28 20:34:54,054 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1] [2019-11-28 20:34:54,055 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2019-11-28 20:34:54,055 INFO L424 BuchiCegarLoop]: ======== Iteration 1============ [2019-11-28 20:34:54,056 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 14 states. [2019-11-28 20:34:54,057 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 6 [2019-11-28 20:34:54,058 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-28 20:34:54,058 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-28 20:34:54,058 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1] [2019-11-28 20:34:54,059 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2019-11-28 20:34:54,067 INFO L794 eck$LassoCheckResult]: Stem: 10#ULTIMATE.startENTRYtrue #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; 8#L-1true havoc main_#res;havoc main_#t~nondet8, main_#t~malloc9.base, main_#t~malloc9.offset, main_~array_size~0, main_~numbers~0.base, main_~numbers~0.offset;main_~array_size~0 := main_#t~nondet8;havoc main_#t~nondet8; 7#L566true assume !(main_~array_size~0 < 1); 9#L566-2true call main_#t~malloc9.base, main_#t~malloc9.offset := #Ultimate.allocOnStack(4 * main_~array_size~0);main_~numbers~0.base, main_~numbers~0.offset := main_#t~malloc9.base, main_#t~malloc9.offset;SelectionSort_#in~a.base, SelectionSort_#in~a.offset, SelectionSort_#in~array_size := main_~numbers~0.base, main_~numbers~0.offset, main_~array_size~0;havoc SelectionSort_#t~mem4, SelectionSort_#t~mem5, SelectionSort_#t~pre3, SelectionSort_#t~mem6, SelectionSort_#t~mem7, SelectionSort_#t~pre2, SelectionSort_~j~0, SelectionSort_~min~0, SelectionSort_~temp~0, SelectionSort_~a.base, SelectionSort_~a.offset, SelectionSort_~array_size, SelectionSort_~i~0;SelectionSort_~a.base, SelectionSort_~a.offset := SelectionSort_#in~a.base, SelectionSort_#in~a.offset;SelectionSort_~array_size := SelectionSort_#in~array_size;havoc SelectionSort_~i~0;SelectionSort_~i~0 := 0; 4#L550-3true [2019-11-28 20:34:54,068 INFO L796 eck$LassoCheckResult]: Loop: 4#L550-3true assume !!(SelectionSort_~i~0 < SelectionSort_~array_size - 1);havoc SelectionSort_~j~0;havoc SelectionSort_~min~0;havoc SelectionSort_~temp~0;SelectionSort_~min~0 := SelectionSort_~i~0;SelectionSort_~j~0 := 1 + SelectionSort_~i~0; 12#L554-3true assume !true; 14#L554-4true call SelectionSort_#t~mem6 := read~int(SelectionSort_~a.base, SelectionSort_~a.offset + 4 * SelectionSort_~i~0, 4);SelectionSort_~temp~0 := SelectionSort_#t~mem6;havoc SelectionSort_#t~mem6;call SelectionSort_#t~mem7 := read~int(SelectionSort_~a.base, SelectionSort_~a.offset + 4 * SelectionSort_~min~0, 4);call write~int(SelectionSort_#t~mem7, SelectionSort_~a.base, SelectionSort_~a.offset + 4 * SelectionSort_~i~0, 4);havoc SelectionSort_#t~mem7;call write~int(SelectionSort_~temp~0, SelectionSort_~a.base, SelectionSort_~a.offset + 4 * SelectionSort_~min~0, 4); 3#L550-2true SelectionSort_#t~pre2 := 1 + SelectionSort_~i~0;SelectionSort_~i~0 := 1 + SelectionSort_~i~0;havoc SelectionSort_#t~pre2; 4#L550-3true [2019-11-28 20:34:54,074 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 20:34:54,075 INFO L82 PathProgramCache]: Analyzing trace with hash 925669, now seen corresponding path program 1 times [2019-11-28 20:34:54,084 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 20:34:54,084 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [944685613] [2019-11-28 20:34:54,084 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 20:34:54,178 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 20:34:54,192 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 20:34:54,219 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-28 20:34:54,221 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 20:34:54,221 INFO L82 PathProgramCache]: Analyzing trace with hash 1463796, now seen corresponding path program 1 times [2019-11-28 20:34:54,221 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 20:34:54,222 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1608911650] [2019-11-28 20:34:54,222 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 20:34:54,228 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:34:54,254 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 20:34:54,254 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1608911650] [2019-11-28 20:34:54,255 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 20:34:54,255 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-28 20:34:54,256 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [813357025] [2019-11-28 20:34:54,262 INFO L811 eck$LassoCheckResult]: loop already infeasible [2019-11-28 20:34:54,263 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 20:34:54,280 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2019-11-28 20:34:54,281 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2019-11-28 20:34:54,283 INFO L87 Difference]: Start difference. First operand 14 states. Second operand 2 states. [2019-11-28 20:34:54,290 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 20:34:54,291 INFO L93 Difference]: Finished difference Result 14 states and 17 transitions. [2019-11-28 20:34:54,291 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2019-11-28 20:34:54,293 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 14 states and 17 transitions. [2019-11-28 20:34:54,295 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 6 [2019-11-28 20:34:54,299 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 14 states to 10 states and 13 transitions. [2019-11-28 20:34:54,300 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 10 [2019-11-28 20:34:54,301 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 10 [2019-11-28 20:34:54,302 INFO L73 IsDeterministic]: Start isDeterministic. Operand 10 states and 13 transitions. [2019-11-28 20:34:54,302 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-11-28 20:34:54,302 INFO L688 BuchiCegarLoop]: Abstraction has 10 states and 13 transitions. [2019-11-28 20:34:54,318 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10 states and 13 transitions. [2019-11-28 20:34:54,326 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10 to 10. [2019-11-28 20:34:54,326 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2019-11-28 20:34:54,327 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 13 transitions. [2019-11-28 20:34:54,328 INFO L711 BuchiCegarLoop]: Abstraction has 10 states and 13 transitions. [2019-11-28 20:34:54,328 INFO L591 BuchiCegarLoop]: Abstraction has 10 states and 13 transitions. [2019-11-28 20:34:54,328 INFO L424 BuchiCegarLoop]: ======== Iteration 2============ [2019-11-28 20:34:54,328 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 10 states and 13 transitions. [2019-11-28 20:34:54,329 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 6 [2019-11-28 20:34:54,329 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-28 20:34:54,329 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-28 20:34:54,329 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1] [2019-11-28 20:34:54,329 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2019-11-28 20:34:54,330 INFO L794 eck$LassoCheckResult]: Stem: 41#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; 38#L-1 havoc main_#res;havoc main_#t~nondet8, main_#t~malloc9.base, main_#t~malloc9.offset, main_~array_size~0, main_~numbers~0.base, main_~numbers~0.offset;main_~array_size~0 := main_#t~nondet8;havoc main_#t~nondet8; 39#L566 assume !(main_~array_size~0 < 1); 40#L566-2 call main_#t~malloc9.base, main_#t~malloc9.offset := #Ultimate.allocOnStack(4 * main_~array_size~0);main_~numbers~0.base, main_~numbers~0.offset := main_#t~malloc9.base, main_#t~malloc9.offset;SelectionSort_#in~a.base, SelectionSort_#in~a.offset, SelectionSort_#in~array_size := main_~numbers~0.base, main_~numbers~0.offset, main_~array_size~0;havoc SelectionSort_#t~mem4, SelectionSort_#t~mem5, SelectionSort_#t~pre3, SelectionSort_#t~mem6, SelectionSort_#t~mem7, SelectionSort_#t~pre2, SelectionSort_~j~0, SelectionSort_~min~0, SelectionSort_~temp~0, SelectionSort_~a.base, SelectionSort_~a.offset, SelectionSort_~array_size, SelectionSort_~i~0;SelectionSort_~a.base, SelectionSort_~a.offset := SelectionSort_#in~a.base, SelectionSort_#in~a.offset;SelectionSort_~array_size := SelectionSort_#in~array_size;havoc SelectionSort_~i~0;SelectionSort_~i~0 := 0; 37#L550-3 [2019-11-28 20:34:54,330 INFO L796 eck$LassoCheckResult]: Loop: 37#L550-3 assume !!(SelectionSort_~i~0 < SelectionSort_~array_size - 1);havoc SelectionSort_~j~0;havoc SelectionSort_~min~0;havoc SelectionSort_~temp~0;SelectionSort_~min~0 := SelectionSort_~i~0;SelectionSort_~j~0 := 1 + SelectionSort_~i~0; 42#L554-3 assume !(SelectionSort_~j~0 < SelectionSort_~array_size); 44#L554-4 call SelectionSort_#t~mem6 := read~int(SelectionSort_~a.base, SelectionSort_~a.offset + 4 * SelectionSort_~i~0, 4);SelectionSort_~temp~0 := SelectionSort_#t~mem6;havoc SelectionSort_#t~mem6;call SelectionSort_#t~mem7 := read~int(SelectionSort_~a.base, SelectionSort_~a.offset + 4 * SelectionSort_~min~0, 4);call write~int(SelectionSort_#t~mem7, SelectionSort_~a.base, SelectionSort_~a.offset + 4 * SelectionSort_~i~0, 4);havoc SelectionSort_#t~mem7;call write~int(SelectionSort_~temp~0, SelectionSort_~a.base, SelectionSort_~a.offset + 4 * SelectionSort_~min~0, 4); 36#L550-2 SelectionSort_#t~pre2 := 1 + SelectionSort_~i~0;SelectionSort_~i~0 := 1 + SelectionSort_~i~0;havoc SelectionSort_#t~pre2; 37#L550-3 [2019-11-28 20:34:54,330 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 20:34:54,330 INFO L82 PathProgramCache]: Analyzing trace with hash 925669, now seen corresponding path program 2 times [2019-11-28 20:34:54,331 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 20:34:54,331 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1900462947] [2019-11-28 20:34:54,331 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 20:34:54,342 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 20:34:54,351 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 20:34:54,355 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-28 20:34:54,355 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 20:34:54,356 INFO L82 PathProgramCache]: Analyzing trace with hash 1453225, now seen corresponding path program 1 times [2019-11-28 20:34:54,356 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 20:34:54,356 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1562516771] [2019-11-28 20:34:54,356 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 20:34:54,369 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:34:54,404 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 20:34:54,405 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1562516771] [2019-11-28 20:34:54,405 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 20:34:54,405 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-28 20:34:54,406 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2146226910] [2019-11-28 20:34:54,406 INFO L811 eck$LassoCheckResult]: loop already infeasible [2019-11-28 20:34:54,407 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 20:34:54,407 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-28 20:34:54,407 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-28 20:34:54,407 INFO L87 Difference]: Start difference. First operand 10 states and 13 transitions. cyclomatic complexity: 4 Second operand 3 states. [2019-11-28 20:34:54,437 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 20:34:54,437 INFO L93 Difference]: Finished difference Result 11 states and 14 transitions. [2019-11-28 20:34:54,438 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-28 20:34:54,439 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 11 states and 14 transitions. [2019-11-28 20:34:54,440 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 7 [2019-11-28 20:34:54,441 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 11 states to 11 states and 14 transitions. [2019-11-28 20:34:54,441 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 11 [2019-11-28 20:34:54,441 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 11 [2019-11-28 20:34:54,441 INFO L73 IsDeterministic]: Start isDeterministic. Operand 11 states and 14 transitions. [2019-11-28 20:34:54,442 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-11-28 20:34:54,442 INFO L688 BuchiCegarLoop]: Abstraction has 11 states and 14 transitions. [2019-11-28 20:34:54,442 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11 states and 14 transitions. [2019-11-28 20:34:54,443 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11 to 11. [2019-11-28 20:34:54,444 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2019-11-28 20:34:54,444 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 14 transitions. [2019-11-28 20:34:54,444 INFO L711 BuchiCegarLoop]: Abstraction has 11 states and 14 transitions. [2019-11-28 20:34:54,444 INFO L591 BuchiCegarLoop]: Abstraction has 11 states and 14 transitions. [2019-11-28 20:34:54,445 INFO L424 BuchiCegarLoop]: ======== Iteration 3============ [2019-11-28 20:34:54,445 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 11 states and 14 transitions. [2019-11-28 20:34:54,445 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 7 [2019-11-28 20:34:54,446 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-28 20:34:54,446 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-28 20:34:54,446 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1] [2019-11-28 20:34:54,446 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1] [2019-11-28 20:34:54,447 INFO L794 eck$LassoCheckResult]: Stem: 68#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; 63#L-1 havoc main_#res;havoc main_#t~nondet8, main_#t~malloc9.base, main_#t~malloc9.offset, main_~array_size~0, main_~numbers~0.base, main_~numbers~0.offset;main_~array_size~0 := main_#t~nondet8;havoc main_#t~nondet8; 64#L566 assume !(main_~array_size~0 < 1); 65#L566-2 call main_#t~malloc9.base, main_#t~malloc9.offset := #Ultimate.allocOnStack(4 * main_~array_size~0);main_~numbers~0.base, main_~numbers~0.offset := main_#t~malloc9.base, main_#t~malloc9.offset;SelectionSort_#in~a.base, SelectionSort_#in~a.offset, SelectionSort_#in~array_size := main_~numbers~0.base, main_~numbers~0.offset, main_~array_size~0;havoc SelectionSort_#t~mem4, SelectionSort_#t~mem5, SelectionSort_#t~pre3, SelectionSort_#t~mem6, SelectionSort_#t~mem7, SelectionSort_#t~pre2, SelectionSort_~j~0, SelectionSort_~min~0, SelectionSort_~temp~0, SelectionSort_~a.base, SelectionSort_~a.offset, SelectionSort_~array_size, SelectionSort_~i~0;SelectionSort_~a.base, SelectionSort_~a.offset := SelectionSort_#in~a.base, SelectionSort_#in~a.offset;SelectionSort_~array_size := SelectionSort_#in~array_size;havoc SelectionSort_~i~0;SelectionSort_~i~0 := 0; 66#L550-3 [2019-11-28 20:34:54,447 INFO L796 eck$LassoCheckResult]: Loop: 66#L550-3 assume !!(SelectionSort_~i~0 < SelectionSort_~array_size - 1);havoc SelectionSort_~j~0;havoc SelectionSort_~min~0;havoc SelectionSort_~temp~0;SelectionSort_~min~0 := SelectionSort_~i~0;SelectionSort_~j~0 := 1 + SelectionSort_~i~0; 69#L554-3 assume !!(SelectionSort_~j~0 < SelectionSort_~array_size);call SelectionSort_#t~mem4 := read~int(SelectionSort_~a.base, SelectionSort_~a.offset + 4 * SelectionSort_~j~0, 4);call SelectionSort_#t~mem5 := read~int(SelectionSort_~a.base, SelectionSort_~a.offset + 4 * SelectionSort_~min~0, 4); 72#L556 assume SelectionSort_#t~mem4 < SelectionSort_#t~mem5;havoc SelectionSort_#t~mem4;havoc SelectionSort_#t~mem5;SelectionSort_~min~0 := SelectionSort_~j~0; 70#L554-2 SelectionSort_#t~pre3 := 1 + SelectionSort_~j~0;SelectionSort_~j~0 := 1 + SelectionSort_~j~0;havoc SelectionSort_#t~pre3; 71#L554-3 assume !(SelectionSort_~j~0 < SelectionSort_~array_size); 73#L554-4 call SelectionSort_#t~mem6 := read~int(SelectionSort_~a.base, SelectionSort_~a.offset + 4 * SelectionSort_~i~0, 4);SelectionSort_~temp~0 := SelectionSort_#t~mem6;havoc SelectionSort_#t~mem6;call SelectionSort_#t~mem7 := read~int(SelectionSort_~a.base, SelectionSort_~a.offset + 4 * SelectionSort_~min~0, 4);call write~int(SelectionSort_#t~mem7, SelectionSort_~a.base, SelectionSort_~a.offset + 4 * SelectionSort_~i~0, 4);havoc SelectionSort_#t~mem7;call write~int(SelectionSort_~temp~0, SelectionSort_~a.base, SelectionSort_~a.offset + 4 * SelectionSort_~min~0, 4); 67#L550-2 SelectionSort_#t~pre2 := 1 + SelectionSort_~i~0;SelectionSort_~i~0 := 1 + SelectionSort_~i~0;havoc SelectionSort_#t~pre2; 66#L550-3 [2019-11-28 20:34:54,447 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 20:34:54,448 INFO L82 PathProgramCache]: Analyzing trace with hash 925669, now seen corresponding path program 3 times [2019-11-28 20:34:54,448 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 20:34:54,448 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1113171438] [2019-11-28 20:34:54,448 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 20:34:54,458 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 20:34:54,467 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 20:34:54,471 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-28 20:34:54,472 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 20:34:54,472 INFO L82 PathProgramCache]: Analyzing trace with hash 393067660, now seen corresponding path program 1 times [2019-11-28 20:34:54,472 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 20:34:54,473 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1617441060] [2019-11-28 20:34:54,473 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 20:34:54,491 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 20:34:54,514 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 20:34:54,525 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-28 20:34:54,525 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 20:34:54,527 INFO L82 PathProgramCache]: Analyzing trace with hash 1419424808, now seen corresponding path program 1 times [2019-11-28 20:34:54,527 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 20:34:54,527 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [610053179] [2019-11-28 20:34:54,528 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 20:34:54,575 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 20:34:54,596 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 20:34:54,606 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-28 20:34:54,803 WARN L192 SmtUtils]: Spent 189.00 ms on a formula simplification. DAG size of input: 75 DAG size of output: 60 [2019-11-28 20:34:55,017 WARN L192 SmtUtils]: Spent 146.00 ms on a formula simplification. DAG size of input: 53 DAG size of output: 51 [2019-11-28 20:34:55,090 INFO L210 LassoAnalysis]: Preferences: [2019-11-28 20:34:55,091 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2019-11-28 20:34:55,091 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-11-28 20:34:55,092 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2019-11-28 20:34:55,092 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2019-11-28 20:34:55,092 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 20:34:55,092 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2019-11-28 20:34:55,093 INFO L132 ssoRankerPreferences]: Path of dumped script: [2019-11-28 20:34:55,093 INFO L133 ssoRankerPreferences]: Filename of dumped script: selectionsort-alloca-2.i_Iteration3_Lasso [2019-11-28 20:34:55,093 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2019-11-28 20:34:55,093 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2019-11-28 20:34:55,130 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 20:34:55,290 WARN L192 SmtUtils]: Spent 118.00 ms on a formula simplification. DAG size of input: 44 DAG size of output: 41 [2019-11-28 20:34:55,388 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 20:34:55,391 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 20:34:55,394 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 20:34:55,398 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 20:34:55,403 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 20:34:55,408 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 20:34:55,411 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 20:34:55,414 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 20:34:55,417 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 20:34:55,420 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 20:34:55,424 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 20:34:55,427 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 20:34:55,430 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 20:34:55,872 INFO L292 LassoAnalysis]: Preprocessing complete. [2019-11-28 20:34:55,877 INFO L489 LassoAnalysis]: Using template 'affine'. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-11-28 20:34:55,893 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-28 20:34:55,898 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 20:34:55,898 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-28 20:34:55,899 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 20:34:55,899 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 20:34:55,900 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 20:34:55,903 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-28 20:34:55,904 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. Waiting until toolchain timeout for monitored process 2 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 20:34:55,907 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-11-28 20:34:55,924 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-28 20:34:55,927 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 20:34:55,928 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 20:34:55,928 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 20:34:55,928 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 20:34:55,942 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-28 20:34:55,942 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. Waiting until toolchain timeout for monitored process 3 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 20:34:55,953 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 20:34:55,970 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-28 20:34:55,974 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 20:34:55,974 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 20:34:55,975 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 20:34:55,975 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 20:34:56,006 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-28 20:34:56,009 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-28 20:34:56,035 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-11-28 20:34:56,136 INFO L443 ModelExtractionUtils]: Simplification made 12 calls to the SMT solver. [2019-11-28 20:34:56,136 INFO L444 ModelExtractionUtils]: 16 out of 40 variables were initially zero. Simplification set additionally 21 variables to zero. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-11-28 20:34:56,208 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... Waiting until toolchain timeout for monitored process 5 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 20:34:56,212 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2019-11-28 20:34:56,212 INFO L510 LassoAnalysis]: Proved termination. [2019-11-28 20:34:56,213 INFO L512 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_SelectionSort_~array_size, ULTIMATE.start_SelectionSort_~i~0) = 1*ULTIMATE.start_SelectionSort_~array_size - 1*ULTIMATE.start_SelectionSort_~i~0 Supporting invariants [] [2019-11-28 20:34:56,246 INFO L297 tatePredicateManager]: 3 out of 3 supporting invariants were superfluous and have been removed [2019-11-28 20:34:56,278 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 20:34:56,295 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:34:56,296 INFO L264 TraceCheckSpWp]: Trace formula consists of 37 conjuncts, 2 conjunts are in the unsatisfiable core [2019-11-28 20:34:56,298 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 20:34:56,317 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:34:56,317 INFO L264 TraceCheckSpWp]: Trace formula consists of 35 conjuncts, 4 conjunts are in the unsatisfiable core [2019-11-28 20:34:56,318 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 20:34:56,338 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-11-28 20:34:56,343 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2019-11-28 20:34:56,344 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 11 states and 14 transitions. cyclomatic complexity: 4 Second operand 3 states. [2019-11-28 20:34:56,393 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 11 states and 14 transitions. cyclomatic complexity: 4. Second operand 3 states. Result 18 states and 24 transitions. Complement of second has 4 states. [2019-11-28 20:34:56,394 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 3 states 1 stem states 1 non-accepting loop states 1 accepting loop states [2019-11-28 20:34:56,395 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2019-11-28 20:34:56,395 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 13 transitions. [2019-11-28 20:34:56,397 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 13 transitions. Stem has 4 letters. Loop has 7 letters. [2019-11-28 20:34:56,399 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-28 20:34:56,399 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 13 transitions. Stem has 11 letters. Loop has 7 letters. [2019-11-28 20:34:56,400 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-28 20:34:56,400 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 13 transitions. Stem has 4 letters. Loop has 14 letters. [2019-11-28 20:34:56,400 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-28 20:34:56,400 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 18 states and 24 transitions. [2019-11-28 20:34:56,401 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2019-11-28 20:34:56,402 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 18 states to 16 states and 22 transitions. [2019-11-28 20:34:56,402 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 8 [2019-11-28 20:34:56,403 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 9 [2019-11-28 20:34:56,403 INFO L73 IsDeterministic]: Start isDeterministic. Operand 16 states and 22 transitions. [2019-11-28 20:34:56,403 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-11-28 20:34:56,403 INFO L688 BuchiCegarLoop]: Abstraction has 16 states and 22 transitions. [2019-11-28 20:34:56,403 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16 states and 22 transitions. [2019-11-28 20:34:56,404 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16 to 15. [2019-11-28 20:34:56,404 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2019-11-28 20:34:56,405 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 21 transitions. [2019-11-28 20:34:56,405 INFO L711 BuchiCegarLoop]: Abstraction has 15 states and 21 transitions. [2019-11-28 20:34:56,405 INFO L591 BuchiCegarLoop]: Abstraction has 15 states and 21 transitions. [2019-11-28 20:34:56,405 INFO L424 BuchiCegarLoop]: ======== Iteration 4============ [2019-11-28 20:34:56,405 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 15 states and 21 transitions. [2019-11-28 20:34:56,406 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2019-11-28 20:34:56,406 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-28 20:34:56,406 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-28 20:34:56,407 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2019-11-28 20:34:56,407 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2019-11-28 20:34:56,407 INFO L794 eck$LassoCheckResult]: Stem: 163#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; 157#L-1 havoc main_#res;havoc main_#t~nondet8, main_#t~malloc9.base, main_#t~malloc9.offset, main_~array_size~0, main_~numbers~0.base, main_~numbers~0.offset;main_~array_size~0 := main_#t~nondet8;havoc main_#t~nondet8; 158#L566 assume !(main_~array_size~0 < 1); 159#L566-2 call main_#t~malloc9.base, main_#t~malloc9.offset := #Ultimate.allocOnStack(4 * main_~array_size~0);main_~numbers~0.base, main_~numbers~0.offset := main_#t~malloc9.base, main_#t~malloc9.offset;SelectionSort_#in~a.base, SelectionSort_#in~a.offset, SelectionSort_#in~array_size := main_~numbers~0.base, main_~numbers~0.offset, main_~array_size~0;havoc SelectionSort_#t~mem4, SelectionSort_#t~mem5, SelectionSort_#t~pre3, SelectionSort_#t~mem6, SelectionSort_#t~mem7, SelectionSort_#t~pre2, SelectionSort_~j~0, SelectionSort_~min~0, SelectionSort_~temp~0, SelectionSort_~a.base, SelectionSort_~a.offset, SelectionSort_~array_size, SelectionSort_~i~0;SelectionSort_~a.base, SelectionSort_~a.offset := SelectionSort_#in~a.base, SelectionSort_#in~a.offset;SelectionSort_~array_size := SelectionSort_#in~array_size;havoc SelectionSort_~i~0;SelectionSort_~i~0 := 0; 160#L550-3 assume !!(SelectionSort_~i~0 < SelectionSort_~array_size - 1);havoc SelectionSort_~j~0;havoc SelectionSort_~min~0;havoc SelectionSort_~temp~0;SelectionSort_~min~0 := SelectionSort_~i~0;SelectionSort_~j~0 := 1 + SelectionSort_~i~0; 165#L554-3 [2019-11-28 20:34:56,407 INFO L796 eck$LassoCheckResult]: Loop: 165#L554-3 assume !!(SelectionSort_~j~0 < SelectionSort_~array_size);call SelectionSort_#t~mem4 := read~int(SelectionSort_~a.base, SelectionSort_~a.offset + 4 * SelectionSort_~j~0, 4);call SelectionSort_#t~mem5 := read~int(SelectionSort_~a.base, SelectionSort_~a.offset + 4 * SelectionSort_~min~0, 4); 169#L556 assume SelectionSort_#t~mem4 < SelectionSort_#t~mem5;havoc SelectionSort_#t~mem4;havoc SelectionSort_#t~mem5;SelectionSort_~min~0 := SelectionSort_~j~0; 166#L554-2 SelectionSort_#t~pre3 := 1 + SelectionSort_~j~0;SelectionSort_~j~0 := 1 + SelectionSort_~j~0;havoc SelectionSort_#t~pre3; 165#L554-3 [2019-11-28 20:34:56,407 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 20:34:56,408 INFO L82 PathProgramCache]: Analyzing trace with hash 28695756, now seen corresponding path program 1 times [2019-11-28 20:34:56,408 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 20:34:56,408 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1894587076] [2019-11-28 20:34:56,408 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 20:34:56,417 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 20:34:56,424 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 20:34:56,427 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-28 20:34:56,428 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 20:34:56,428 INFO L82 PathProgramCache]: Analyzing trace with hash 54716, now seen corresponding path program 1 times [2019-11-28 20:34:56,428 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 20:34:56,428 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1469105506] [2019-11-28 20:34:56,429 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 20:34:56,435 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 20:34:56,448 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 20:34:56,452 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-28 20:34:56,453 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 20:34:56,453 INFO L82 PathProgramCache]: Analyzing trace with hash 176800017, now seen corresponding path program 1 times [2019-11-28 20:34:56,456 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 20:34:56,457 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [198444049] [2019-11-28 20:34:56,457 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 20:34:56,485 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 20:34:56,512 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 20:34:56,524 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-28 20:34:56,761 WARN L192 SmtUtils]: Spent 163.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 55 [2019-11-28 20:34:56,846 INFO L210 LassoAnalysis]: Preferences: [2019-11-28 20:34:56,846 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2019-11-28 20:34:56,846 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-11-28 20:34:56,846 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2019-11-28 20:34:56,846 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2019-11-28 20:34:56,847 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 20:34:56,847 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2019-11-28 20:34:56,847 INFO L132 ssoRankerPreferences]: Path of dumped script: [2019-11-28 20:34:56,847 INFO L133 ssoRankerPreferences]: Filename of dumped script: selectionsort-alloca-2.i_Iteration4_Lasso [2019-11-28 20:34:56,847 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2019-11-28 20:34:56,847 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2019-11-28 20:34:56,872 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 20:34:56,882 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 20:34:56,883 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 20:34:56,885 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 20:34:56,889 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 20:34:56,892 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 20:34:57,019 WARN L192 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 49 DAG size of output: 46 [2019-11-28 20:34:57,109 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 20:34:57,116 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 20:34:57,120 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 20:34:57,123 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 20:34:57,127 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 20:34:57,129 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 20:34:57,132 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 20:34:57,134 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 20:34:57,137 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 20:34:57,484 INFO L292 LassoAnalysis]: Preprocessing complete. [2019-11-28 20:34:57,489 INFO L489 LassoAnalysis]: Using template 'affine'. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 6 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-11-28 20:34:57,507 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-28 20:34:57,512 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 20:34:57,512 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-28 20:34:57,512 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 20:34:57,512 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 20:34:57,512 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 20:34:57,513 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-28 20:34:57,513 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. Waiting until toolchain timeout for monitored process 6 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 20:34:57,517 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 7 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-11-28 20:34:57,535 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-28 20:34:57,536 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 20:34:57,537 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-28 20:34:57,537 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 20:34:57,537 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 20:34:57,537 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 20:34:57,538 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-28 20:34:57,538 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. Waiting until toolchain timeout for monitored process 7 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 20:34:57,540 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 8 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-11-28 20:34:57,556 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-28 20:34:57,558 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 20:34:57,558 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-28 20:34:57,559 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 20:34:57,559 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 20:34:57,559 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 20:34:57,560 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-28 20:34:57,560 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. Waiting until toolchain timeout for monitored process 8 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 20:34:57,562 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 9 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-11-28 20:34:57,578 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-28 20:34:57,580 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 20:34:57,581 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-28 20:34:57,582 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 20:34:57,582 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 20:34:57,582 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 20:34:57,585 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-28 20:34:57,585 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. Waiting until toolchain timeout for monitored process 9 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 20:34:57,591 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 10 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-11-28 20:34:57,609 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-28 20:34:57,611 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 20:34:57,611 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 20:34:57,611 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 20:34:57,611 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 20:34:57,613 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-28 20:34:57,614 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. Waiting until toolchain timeout for monitored process 10 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 20:34:57,618 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 11 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-11-28 20:34:57,635 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-28 20:34:57,637 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 20:34:57,637 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 20:34:57,638 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 20:34:57,638 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 20:34:57,645 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-28 20:34:57,646 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. Waiting until toolchain timeout for monitored process 11 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 20:34:57,654 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 12 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-11-28 20:34:57,672 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-28 20:34:57,675 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 20:34:57,675 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 20:34:57,675 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 20:34:57,675 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 20:34:57,689 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-28 20:34:57,689 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. Waiting until toolchain timeout for monitored process 12 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 20:34:57,717 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-11-28 20:34:57,758 INFO L443 ModelExtractionUtils]: Simplification made 12 calls to the SMT solver. [2019-11-28 20:34:57,758 INFO L444 ModelExtractionUtils]: 23 out of 40 variables were initially zero. Simplification set additionally 14 variables to zero. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 13 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 13 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 20:34:57,765 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-11-28 20:34:57,768 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2019-11-28 20:34:57,768 INFO L510 LassoAnalysis]: Proved termination. [2019-11-28 20:34:57,768 INFO L512 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_SelectionSort_~j~0, ULTIMATE.start_SelectionSort_~array_size) = -1*ULTIMATE.start_SelectionSort_~j~0 + 1*ULTIMATE.start_SelectionSort_~array_size Supporting invariants [] [2019-11-28 20:34:57,784 INFO L297 tatePredicateManager]: 4 out of 4 supporting invariants were superfluous and have been removed [2019-11-28 20:34:57,798 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 20:34:57,811 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:34:57,812 INFO L264 TraceCheckSpWp]: Trace formula consists of 42 conjuncts, 2 conjunts are in the unsatisfiable core [2019-11-28 20:34:57,812 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 20:34:57,820 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:34:57,820 INFO L264 TraceCheckSpWp]: Trace formula consists of 18 conjuncts, 4 conjunts are in the unsatisfiable core [2019-11-28 20:34:57,821 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 20:34:57,832 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 20:34:57,833 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2019-11-28 20:34:57,833 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 15 states and 21 transitions. cyclomatic complexity: 8 Second operand 3 states. [2019-11-28 20:34:57,854 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 15 states and 21 transitions. cyclomatic complexity: 8. Second operand 3 states. Result 33 states and 47 transitions. Complement of second has 7 states. [2019-11-28 20:34:57,855 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2019-11-28 20:34:57,855 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2019-11-28 20:34:57,855 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 13 transitions. [2019-11-28 20:34:57,855 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 13 transitions. Stem has 5 letters. Loop has 3 letters. [2019-11-28 20:34:57,856 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-28 20:34:57,856 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 13 transitions. Stem has 8 letters. Loop has 3 letters. [2019-11-28 20:34:57,856 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-28 20:34:57,856 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 13 transitions. Stem has 5 letters. Loop has 6 letters. [2019-11-28 20:34:57,856 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-28 20:34:57,856 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 33 states and 47 transitions. [2019-11-28 20:34:57,860 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2019-11-28 20:34:57,861 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 33 states to 22 states and 30 transitions. [2019-11-28 20:34:57,861 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 8 [2019-11-28 20:34:57,861 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 8 [2019-11-28 20:34:57,861 INFO L73 IsDeterministic]: Start isDeterministic. Operand 22 states and 30 transitions. [2019-11-28 20:34:57,862 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-11-28 20:34:57,862 INFO L688 BuchiCegarLoop]: Abstraction has 22 states and 30 transitions. [2019-11-28 20:34:57,862 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22 states and 30 transitions. [2019-11-28 20:34:57,863 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22 to 15. [2019-11-28 20:34:57,864 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2019-11-28 20:34:57,864 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 20 transitions. [2019-11-28 20:34:57,864 INFO L711 BuchiCegarLoop]: Abstraction has 15 states and 20 transitions. [2019-11-28 20:34:57,865 INFO L591 BuchiCegarLoop]: Abstraction has 15 states and 20 transitions. [2019-11-28 20:34:57,865 INFO L424 BuchiCegarLoop]: ======== Iteration 5============ [2019-11-28 20:34:57,865 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 15 states and 20 transitions. [2019-11-28 20:34:57,866 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2019-11-28 20:34:57,866 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-28 20:34:57,866 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-28 20:34:57,867 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 20:34:57,867 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2019-11-28 20:34:57,867 INFO L794 eck$LassoCheckResult]: Stem: 275#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; 269#L-1 havoc main_#res;havoc main_#t~nondet8, main_#t~malloc9.base, main_#t~malloc9.offset, main_~array_size~0, main_~numbers~0.base, main_~numbers~0.offset;main_~array_size~0 := main_#t~nondet8;havoc main_#t~nondet8; 270#L566 assume !(main_~array_size~0 < 1); 271#L566-2 call main_#t~malloc9.base, main_#t~malloc9.offset := #Ultimate.allocOnStack(4 * main_~array_size~0);main_~numbers~0.base, main_~numbers~0.offset := main_#t~malloc9.base, main_#t~malloc9.offset;SelectionSort_#in~a.base, SelectionSort_#in~a.offset, SelectionSort_#in~array_size := main_~numbers~0.base, main_~numbers~0.offset, main_~array_size~0;havoc SelectionSort_#t~mem4, SelectionSort_#t~mem5, SelectionSort_#t~pre3, SelectionSort_#t~mem6, SelectionSort_#t~mem7, SelectionSort_#t~pre2, SelectionSort_~j~0, SelectionSort_~min~0, SelectionSort_~temp~0, SelectionSort_~a.base, SelectionSort_~a.offset, SelectionSort_~array_size, SelectionSort_~i~0;SelectionSort_~a.base, SelectionSort_~a.offset := SelectionSort_#in~a.base, SelectionSort_#in~a.offset;SelectionSort_~array_size := SelectionSort_#in~array_size;havoc SelectionSort_~i~0;SelectionSort_~i~0 := 0; 272#L550-3 assume !!(SelectionSort_~i~0 < SelectionSort_~array_size - 1);havoc SelectionSort_~j~0;havoc SelectionSort_~min~0;havoc SelectionSort_~temp~0;SelectionSort_~min~0 := SelectionSort_~i~0;SelectionSort_~j~0 := 1 + SelectionSort_~i~0; 276#L554-3 assume !!(SelectionSort_~j~0 < SelectionSort_~array_size);call SelectionSort_#t~mem4 := read~int(SelectionSort_~a.base, SelectionSort_~a.offset + 4 * SelectionSort_~j~0, 4);call SelectionSort_#t~mem5 := read~int(SelectionSort_~a.base, SelectionSort_~a.offset + 4 * SelectionSort_~min~0, 4); 282#L556 assume !(SelectionSort_#t~mem4 < SelectionSort_#t~mem5);havoc SelectionSort_#t~mem4;havoc SelectionSort_#t~mem5; 279#L554-2 SelectionSort_#t~pre3 := 1 + SelectionSort_~j~0;SelectionSort_~j~0 := 1 + SelectionSort_~j~0;havoc SelectionSort_#t~pre3; 280#L554-3 assume !(SelectionSort_~j~0 < SelectionSort_~array_size); 283#L554-4 call SelectionSort_#t~mem6 := read~int(SelectionSort_~a.base, SelectionSort_~a.offset + 4 * SelectionSort_~i~0, 4);SelectionSort_~temp~0 := SelectionSort_#t~mem6;havoc SelectionSort_#t~mem6;call SelectionSort_#t~mem7 := read~int(SelectionSort_~a.base, SelectionSort_~a.offset + 4 * SelectionSort_~min~0, 4);call write~int(SelectionSort_#t~mem7, SelectionSort_~a.base, SelectionSort_~a.offset + 4 * SelectionSort_~i~0, 4);havoc SelectionSort_#t~mem7;call write~int(SelectionSort_~temp~0, SelectionSort_~a.base, SelectionSort_~a.offset + 4 * SelectionSort_~min~0, 4); 273#L550-2 SelectionSort_#t~pre2 := 1 + SelectionSort_~i~0;SelectionSort_~i~0 := 1 + SelectionSort_~i~0;havoc SelectionSort_#t~pre2; 274#L550-3 assume !!(SelectionSort_~i~0 < SelectionSort_~array_size - 1);havoc SelectionSort_~j~0;havoc SelectionSort_~min~0;havoc SelectionSort_~temp~0;SelectionSort_~min~0 := SelectionSort_~i~0;SelectionSort_~j~0 := 1 + SelectionSort_~i~0; 277#L554-3 [2019-11-28 20:34:57,867 INFO L796 eck$LassoCheckResult]: Loop: 277#L554-3 assume !!(SelectionSort_~j~0 < SelectionSort_~array_size);call SelectionSort_#t~mem4 := read~int(SelectionSort_~a.base, SelectionSort_~a.offset + 4 * SelectionSort_~j~0, 4);call SelectionSort_#t~mem5 := read~int(SelectionSort_~a.base, SelectionSort_~a.offset + 4 * SelectionSort_~min~0, 4); 281#L556 assume SelectionSort_#t~mem4 < SelectionSort_#t~mem5;havoc SelectionSort_#t~mem4;havoc SelectionSort_#t~mem5;SelectionSort_~min~0 := SelectionSort_~j~0; 278#L554-2 SelectionSort_#t~pre3 := 1 + SelectionSort_~j~0;SelectionSort_~j~0 := 1 + SelectionSort_~j~0;havoc SelectionSort_#t~pre3; 277#L554-3 [2019-11-28 20:34:57,868 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 20:34:57,868 INFO L82 PathProgramCache]: Analyzing trace with hash 1109754407, now seen corresponding path program 1 times [2019-11-28 20:34:57,868 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 20:34:57,869 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1628281572] [2019-11-28 20:34:57,869 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 20:34:57,883 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:34:57,942 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 20:34:57,943 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1628281572] [2019-11-28 20:34:57,943 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1311550816] [2019-11-28 20:34:57,943 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-28 20:34:58,010 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:34:58,011 INFO L264 TraceCheckSpWp]: Trace formula consists of 73 conjuncts, 5 conjunts are in the unsatisfiable core [2019-11-28 20:34:58,012 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 20:34:58,022 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 20:34:58,023 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-28 20:34:58,023 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 5 [2019-11-28 20:34:58,024 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1475729890] [2019-11-28 20:34:58,024 INFO L799 eck$LassoCheckResult]: stem already infeasible [2019-11-28 20:34:58,024 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 20:34:58,025 INFO L82 PathProgramCache]: Analyzing trace with hash 54716, now seen corresponding path program 2 times [2019-11-28 20:34:58,025 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 20:34:58,025 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [575589843] [2019-11-28 20:34:58,026 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 20:34:58,032 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 20:34:58,039 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 20:34:58,042 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-28 20:34:58,113 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 20:34:58,114 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-28 20:34:58,114 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-11-28 20:34:58,114 INFO L87 Difference]: Start difference. First operand 15 states and 20 transitions. cyclomatic complexity: 7 Second operand 6 states. [2019-11-28 20:34:58,187 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 20:34:58,187 INFO L93 Difference]: Finished difference Result 29 states and 38 transitions. [2019-11-28 20:34:58,188 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-11-28 20:34:58,188 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 29 states and 38 transitions. [2019-11-28 20:34:58,189 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2019-11-28 20:34:58,190 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 29 states to 26 states and 35 transitions. [2019-11-28 20:34:58,190 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 14 [2019-11-28 20:34:58,190 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 14 [2019-11-28 20:34:58,191 INFO L73 IsDeterministic]: Start isDeterministic. Operand 26 states and 35 transitions. [2019-11-28 20:34:58,191 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-11-28 20:34:58,191 INFO L688 BuchiCegarLoop]: Abstraction has 26 states and 35 transitions. [2019-11-28 20:34:58,191 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states and 35 transitions. [2019-11-28 20:34:58,193 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 18. [2019-11-28 20:34:58,193 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2019-11-28 20:34:58,193 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 24 transitions. [2019-11-28 20:34:58,194 INFO L711 BuchiCegarLoop]: Abstraction has 18 states and 24 transitions. [2019-11-28 20:34:58,194 INFO L591 BuchiCegarLoop]: Abstraction has 18 states and 24 transitions. [2019-11-28 20:34:58,194 INFO L424 BuchiCegarLoop]: ======== Iteration 6============ [2019-11-28 20:34:58,194 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 18 states and 24 transitions. [2019-11-28 20:34:58,194 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2019-11-28 20:34:58,195 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-28 20:34:58,195 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-28 20:34:58,196 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 20:34:58,196 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2019-11-28 20:34:58,196 INFO L794 eck$LassoCheckResult]: Stem: 365#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; 359#L-1 havoc main_#res;havoc main_#t~nondet8, main_#t~malloc9.base, main_#t~malloc9.offset, main_~array_size~0, main_~numbers~0.base, main_~numbers~0.offset;main_~array_size~0 := main_#t~nondet8;havoc main_#t~nondet8; 360#L566 assume !(main_~array_size~0 < 1); 361#L566-2 call main_#t~malloc9.base, main_#t~malloc9.offset := #Ultimate.allocOnStack(4 * main_~array_size~0);main_~numbers~0.base, main_~numbers~0.offset := main_#t~malloc9.base, main_#t~malloc9.offset;SelectionSort_#in~a.base, SelectionSort_#in~a.offset, SelectionSort_#in~array_size := main_~numbers~0.base, main_~numbers~0.offset, main_~array_size~0;havoc SelectionSort_#t~mem4, SelectionSort_#t~mem5, SelectionSort_#t~pre3, SelectionSort_#t~mem6, SelectionSort_#t~mem7, SelectionSort_#t~pre2, SelectionSort_~j~0, SelectionSort_~min~0, SelectionSort_~temp~0, SelectionSort_~a.base, SelectionSort_~a.offset, SelectionSort_~array_size, SelectionSort_~i~0;SelectionSort_~a.base, SelectionSort_~a.offset := SelectionSort_#in~a.base, SelectionSort_#in~a.offset;SelectionSort_~array_size := SelectionSort_#in~array_size;havoc SelectionSort_~i~0;SelectionSort_~i~0 := 0; 362#L550-3 assume !!(SelectionSort_~i~0 < SelectionSort_~array_size - 1);havoc SelectionSort_~j~0;havoc SelectionSort_~min~0;havoc SelectionSort_~temp~0;SelectionSort_~min~0 := SelectionSort_~i~0;SelectionSort_~j~0 := 1 + SelectionSort_~i~0; 366#L554-3 assume !!(SelectionSort_~j~0 < SelectionSort_~array_size);call SelectionSort_#t~mem4 := read~int(SelectionSort_~a.base, SelectionSort_~a.offset + 4 * SelectionSort_~j~0, 4);call SelectionSort_#t~mem5 := read~int(SelectionSort_~a.base, SelectionSort_~a.offset + 4 * SelectionSort_~min~0, 4); 376#L556 assume !(SelectionSort_#t~mem4 < SelectionSort_#t~mem5);havoc SelectionSort_#t~mem4;havoc SelectionSort_#t~mem5; 369#L554-2 SelectionSort_#t~pre3 := 1 + SelectionSort_~j~0;SelectionSort_~j~0 := 1 + SelectionSort_~j~0;havoc SelectionSort_#t~pre3; 370#L554-3 assume !!(SelectionSort_~j~0 < SelectionSort_~array_size);call SelectionSort_#t~mem4 := read~int(SelectionSort_~a.base, SelectionSort_~a.offset + 4 * SelectionSort_~j~0, 4);call SelectionSort_#t~mem5 := read~int(SelectionSort_~a.base, SelectionSort_~a.offset + 4 * SelectionSort_~min~0, 4); 372#L556 assume !(SelectionSort_#t~mem4 < SelectionSort_#t~mem5);havoc SelectionSort_#t~mem4;havoc SelectionSort_#t~mem5; 373#L554-2 SelectionSort_#t~pre3 := 1 + SelectionSort_~j~0;SelectionSort_~j~0 := 1 + SelectionSort_~j~0;havoc SelectionSort_#t~pre3; 375#L554-3 assume !(SelectionSort_~j~0 < SelectionSort_~array_size); 374#L554-4 call SelectionSort_#t~mem6 := read~int(SelectionSort_~a.base, SelectionSort_~a.offset + 4 * SelectionSort_~i~0, 4);SelectionSort_~temp~0 := SelectionSort_#t~mem6;havoc SelectionSort_#t~mem6;call SelectionSort_#t~mem7 := read~int(SelectionSort_~a.base, SelectionSort_~a.offset + 4 * SelectionSort_~min~0, 4);call write~int(SelectionSort_#t~mem7, SelectionSort_~a.base, SelectionSort_~a.offset + 4 * SelectionSort_~i~0, 4);havoc SelectionSort_#t~mem7;call write~int(SelectionSort_~temp~0, SelectionSort_~a.base, SelectionSort_~a.offset + 4 * SelectionSort_~min~0, 4); 363#L550-2 SelectionSort_#t~pre2 := 1 + SelectionSort_~i~0;SelectionSort_~i~0 := 1 + SelectionSort_~i~0;havoc SelectionSort_#t~pre2; 364#L550-3 assume !!(SelectionSort_~i~0 < SelectionSort_~array_size - 1);havoc SelectionSort_~j~0;havoc SelectionSort_~min~0;havoc SelectionSort_~temp~0;SelectionSort_~min~0 := SelectionSort_~i~0;SelectionSort_~j~0 := 1 + SelectionSort_~i~0; 367#L554-3 [2019-11-28 20:34:58,196 INFO L796 eck$LassoCheckResult]: Loop: 367#L554-3 assume !!(SelectionSort_~j~0 < SelectionSort_~array_size);call SelectionSort_#t~mem4 := read~int(SelectionSort_~a.base, SelectionSort_~a.offset + 4 * SelectionSort_~j~0, 4);call SelectionSort_#t~mem5 := read~int(SelectionSort_~a.base, SelectionSort_~a.offset + 4 * SelectionSort_~min~0, 4); 371#L556 assume SelectionSort_#t~mem4 < SelectionSort_#t~mem5;havoc SelectionSort_#t~mem4;havoc SelectionSort_#t~mem5;SelectionSort_~min~0 := SelectionSort_~j~0; 368#L554-2 SelectionSort_#t~pre3 := 1 + SelectionSort_~j~0;SelectionSort_~j~0 := 1 + SelectionSort_~j~0;havoc SelectionSort_#t~pre3; 367#L554-3 [2019-11-28 20:34:58,196 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 20:34:58,196 INFO L82 PathProgramCache]: Analyzing trace with hash -366799804, now seen corresponding path program 2 times [2019-11-28 20:34:58,197 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 20:34:58,197 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1684593960] [2019-11-28 20:34:58,197 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 20:34:58,221 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 20:34:58,241 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 20:34:58,259 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-28 20:34:58,259 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 20:34:58,259 INFO L82 PathProgramCache]: Analyzing trace with hash 54716, now seen corresponding path program 3 times [2019-11-28 20:34:58,259 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 20:34:58,260 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1042493925] [2019-11-28 20:34:58,260 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 20:34:58,270 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 20:34:58,274 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 20:34:58,276 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-28 20:34:58,276 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 20:34:58,276 INFO L82 PathProgramCache]: Analyzing trace with hash -936135015, now seen corresponding path program 1 times [2019-11-28 20:34:58,276 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 20:34:58,277 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [64425480] [2019-11-28 20:34:58,277 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 20:34:58,313 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 20:34:58,335 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 20:34:58,342 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-28 20:34:58,845 WARN L192 SmtUtils]: Spent 431.00 ms on a formula simplification. DAG size of input: 133 DAG size of output: 108 [2019-11-28 20:34:58,920 INFO L210 LassoAnalysis]: Preferences: [2019-11-28 20:34:58,920 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2019-11-28 20:34:58,920 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-11-28 20:34:58,920 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2019-11-28 20:34:58,920 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2019-11-28 20:34:58,920 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 20:34:58,921 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2019-11-28 20:34:58,921 INFO L132 ssoRankerPreferences]: Path of dumped script: [2019-11-28 20:34:58,921 INFO L133 ssoRankerPreferences]: Filename of dumped script: selectionsort-alloca-2.i_Iteration6_Lasso [2019-11-28 20:34:58,921 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2019-11-28 20:34:58,922 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2019-11-28 20:34:58,925 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 20:34:58,929 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 20:34:58,931 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 20:34:58,935 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 20:34:58,942 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 20:34:58,944 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 20:34:58,946 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 20:34:59,107 WARN L192 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 62 DAG size of output: 53 [2019-11-28 20:34:59,194 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 20:34:59,197 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 20:34:59,199 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 20:34:59,202 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 20:34:59,205 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 20:34:59,210 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 20:34:59,220 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 20:34:59,222 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 20:34:59,226 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 20:34:59,603 INFO L292 LassoAnalysis]: Preprocessing complete. [2019-11-28 20:34:59,603 INFO L489 LassoAnalysis]: Using template 'affine'. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 15 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 15 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 20:34:59,611 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-28 20:34:59,612 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 20:34:59,612 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-28 20:34:59,612 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 20:34:59,612 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 20:34:59,613 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 20:34:59,616 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-28 20:34:59,616 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-28 20:34:59,620 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 16 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 16 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 20:34:59,634 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-28 20:34:59,636 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 20:34:59,636 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 20:34:59,636 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 20:34:59,636 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 20:34:59,638 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-28 20:34:59,638 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-28 20:34:59,641 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 17 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-11-28 20:34:59,657 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-28 20:34:59,658 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 20:34:59,658 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 20:34:59,658 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 20:34:59,659 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 20:34:59,660 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-28 20:34:59,661 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. Waiting until toolchain timeout for monitored process 17 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 20:34:59,670 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 18 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 18 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 20:34:59,680 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-28 20:34:59,682 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 20:34:59,683 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 20:34:59,683 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 20:34:59,683 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 20:34:59,686 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-28 20:34:59,686 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-28 20:34:59,692 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 19 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-11-28 20:34:59,708 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-28 20:34:59,710 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 20:34:59,710 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 20:34:59,710 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 20:34:59,711 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 20:34:59,713 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-28 20:34:59,713 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. Waiting until toolchain timeout for monitored process 19 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 20:34:59,717 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 20 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-11-28 20:34:59,733 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-28 20:34:59,735 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 20:34:59,735 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-28 20:34:59,735 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 20:34:59,735 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 20:34:59,735 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 20:34:59,736 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-28 20:34:59,736 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. Waiting until toolchain timeout for monitored process 20 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 20:34:59,738 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 21 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 21 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 20:34:59,761 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-28 20:34:59,763 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 20:34:59,763 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 20:34:59,763 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 20:34:59,764 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 20:34:59,767 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-28 20:34:59,767 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-28 20:34:59,773 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 22 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 22 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 20:34:59,792 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-28 20:34:59,794 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 20:34:59,795 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 20:34:59,795 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 20:34:59,795 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 20:34:59,802 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-28 20:34:59,802 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-28 20:34:59,821 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-11-28 20:34:59,849 INFO L443 ModelExtractionUtils]: Simplification made 9 calls to the SMT solver. [2019-11-28 20:34:59,849 INFO L444 ModelExtractionUtils]: 11 out of 31 variables were initially zero. Simplification set additionally 15 variables to zero. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 23 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-11-28 20:34:59,859 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... Waiting until toolchain timeout for monitored process 23 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 20:34:59,862 INFO L438 nArgumentSynthesizer]: Removed 1 redundant supporting invariants from a total of 2. [2019-11-28 20:34:59,862 INFO L510 LassoAnalysis]: Proved termination. [2019-11-28 20:34:59,862 INFO L512 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_SelectionSort_~j~0, v_rep(select #length ULTIMATE.start_SelectionSort_~a.base)_3) = -8*ULTIMATE.start_SelectionSort_~j~0 + 5*v_rep(select #length ULTIMATE.start_SelectionSort_~a.base)_3 Supporting invariants [-1*ULTIMATE.start_SelectionSort_~array_size + 3 >= 0] [MP z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (22)] Exception during sending of exit command (exit): Broken pipe [2019-11-28 20:34:59,885 INFO L297 tatePredicateManager]: 7 out of 8 supporting invariants were superfluous and have been removed [2019-11-28 20:34:59,887 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2019-11-28 20:34:59,910 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 20:34:59,932 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:34:59,933 INFO L264 TraceCheckSpWp]: Trace formula consists of 87 conjuncts, 7 conjunts are in the unsatisfiable core [2019-11-28 20:34:59,934 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 20:35:00,004 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:35:00,004 INFO L264 TraceCheckSpWp]: Trace formula consists of 19 conjuncts, 7 conjunts are in the unsatisfiable core [2019-11-28 20:35:00,005 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 20:35:00,025 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 20:35:00,025 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.6 stem predicates 2 loop predicates [2019-11-28 20:35:00,025 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 18 states and 24 transitions. cyclomatic complexity: 8 Second operand 8 states. [2019-11-28 20:35:00,054 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 18 states and 24 transitions. cyclomatic complexity: 8. Second operand 8 states. Result 19 states and 25 transitions. Complement of second has 4 states. [2019-11-28 20:35:00,054 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 3 states 2 stem states 0 non-accepting loop states 1 accepting loop states [2019-11-28 20:35:00,055 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2019-11-28 20:35:00,055 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 6 transitions. [2019-11-28 20:35:00,055 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 6 transitions. Stem has 15 letters. Loop has 3 letters. [2019-11-28 20:35:00,055 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-28 20:35:00,055 INFO L639 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2019-11-28 20:35:00,084 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 20:35:00,100 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:35:00,101 INFO L264 TraceCheckSpWp]: Trace formula consists of 87 conjuncts, 7 conjunts are in the unsatisfiable core [2019-11-28 20:35:00,102 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 20:35:00,178 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:35:00,179 INFO L264 TraceCheckSpWp]: Trace formula consists of 19 conjuncts, 7 conjunts are in the unsatisfiable core [2019-11-28 20:35:00,179 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 20:35:00,199 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 20:35:00,199 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and with honda bouncer for loop.6 stem predicates 2 loop predicates [2019-11-28 20:35:00,199 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 18 states and 24 transitions. cyclomatic complexity: 8 Second operand 8 states. [2019-11-28 20:35:00,230 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 18 states and 24 transitions. cyclomatic complexity: 8. Second operand 8 states. Result 19 states and 25 transitions. Complement of second has 4 states. [2019-11-28 20:35:00,230 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 3 states 2 stem states 0 non-accepting loop states 1 accepting loop states [2019-11-28 20:35:00,230 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2019-11-28 20:35:00,231 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 6 transitions. [2019-11-28 20:35:00,231 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 6 transitions. Stem has 15 letters. Loop has 3 letters. [2019-11-28 20:35:00,231 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-28 20:35:00,231 INFO L639 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2019-11-28 20:35:00,253 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 20:35:00,269 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:35:00,270 INFO L264 TraceCheckSpWp]: Trace formula consists of 87 conjuncts, 7 conjunts are in the unsatisfiable core [2019-11-28 20:35:00,271 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 20:35:00,335 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:35:00,335 INFO L264 TraceCheckSpWp]: Trace formula consists of 19 conjuncts, 7 conjunts are in the unsatisfiable core [2019-11-28 20:35:00,336 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 20:35:00,356 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 20:35:00,356 INFO L152 lantAutomatonBouncer]: Defining Buchi interpolant automaton with scrooge nondeterminism in stemwith honda bouncer for stem and without honda bouncer for loop.6 stem predicates 2 loop predicates [2019-11-28 20:35:00,357 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 18 states and 24 transitions. cyclomatic complexity: 8 Second operand 8 states. [2019-11-28 20:35:00,667 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 18 states and 24 transitions. cyclomatic complexity: 8. Second operand 8 states. Result 60 states and 84 transitions. Complement of second has 15 states. [2019-11-28 20:35:00,669 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 12 states 8 stem states 2 non-accepting loop states 2 accepting loop states [2019-11-28 20:35:00,669 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2019-11-28 20:35:00,670 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 55 transitions. [2019-11-28 20:35:00,670 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 12 states and 55 transitions. Stem has 15 letters. Loop has 3 letters. [2019-11-28 20:35:00,670 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-28 20:35:00,670 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 12 states and 55 transitions. Stem has 18 letters. Loop has 3 letters. [2019-11-28 20:35:00,671 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-28 20:35:00,671 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 12 states and 55 transitions. Stem has 15 letters. Loop has 6 letters. [2019-11-28 20:35:00,672 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-28 20:35:00,672 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 60 states and 84 transitions. [2019-11-28 20:35:00,673 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2019-11-28 20:35:00,676 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 60 states to 34 states and 46 transitions. [2019-11-28 20:35:00,676 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 9 [2019-11-28 20:35:00,676 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 10 [2019-11-28 20:35:00,677 INFO L73 IsDeterministic]: Start isDeterministic. Operand 34 states and 46 transitions. [2019-11-28 20:35:00,677 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-11-28 20:35:00,677 INFO L688 BuchiCegarLoop]: Abstraction has 34 states and 46 transitions. [2019-11-28 20:35:00,677 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states and 46 transitions. [2019-11-28 20:35:00,679 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 21. [2019-11-28 20:35:00,680 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2019-11-28 20:35:00,680 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 28 transitions. [2019-11-28 20:35:00,680 INFO L711 BuchiCegarLoop]: Abstraction has 21 states and 28 transitions. [2019-11-28 20:35:00,680 INFO L591 BuchiCegarLoop]: Abstraction has 21 states and 28 transitions. [2019-11-28 20:35:00,680 INFO L424 BuchiCegarLoop]: ======== Iteration 7============ [2019-11-28 20:35:00,681 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 21 states and 28 transitions. [2019-11-28 20:35:00,681 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2019-11-28 20:35:00,681 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-28 20:35:00,681 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-28 20:35:00,682 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 20:35:00,682 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2019-11-28 20:35:00,682 INFO L794 eck$LassoCheckResult]: Stem: 755#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; 751#L-1 havoc main_#res;havoc main_#t~nondet8, main_#t~malloc9.base, main_#t~malloc9.offset, main_~array_size~0, main_~numbers~0.base, main_~numbers~0.offset;main_~array_size~0 := main_#t~nondet8;havoc main_#t~nondet8; 752#L566 assume !(main_~array_size~0 < 1); 753#L566-2 call main_#t~malloc9.base, main_#t~malloc9.offset := #Ultimate.allocOnStack(4 * main_~array_size~0);main_~numbers~0.base, main_~numbers~0.offset := main_#t~malloc9.base, main_#t~malloc9.offset;SelectionSort_#in~a.base, SelectionSort_#in~a.offset, SelectionSort_#in~array_size := main_~numbers~0.base, main_~numbers~0.offset, main_~array_size~0;havoc SelectionSort_#t~mem4, SelectionSort_#t~mem5, SelectionSort_#t~pre3, SelectionSort_#t~mem6, SelectionSort_#t~mem7, SelectionSort_#t~pre2, SelectionSort_~j~0, SelectionSort_~min~0, SelectionSort_~temp~0, SelectionSort_~a.base, SelectionSort_~a.offset, SelectionSort_~array_size, SelectionSort_~i~0;SelectionSort_~a.base, SelectionSort_~a.offset := SelectionSort_#in~a.base, SelectionSort_#in~a.offset;SelectionSort_~array_size := SelectionSort_#in~array_size;havoc SelectionSort_~i~0;SelectionSort_~i~0 := 0; 754#L550-3 assume !!(SelectionSort_~i~0 < SelectionSort_~array_size - 1);havoc SelectionSort_~j~0;havoc SelectionSort_~min~0;havoc SelectionSort_~temp~0;SelectionSort_~min~0 := SelectionSort_~i~0;SelectionSort_~j~0 := 1 + SelectionSort_~i~0; 756#L554-3 assume !!(SelectionSort_~j~0 < SelectionSort_~array_size);call SelectionSort_#t~mem4 := read~int(SelectionSort_~a.base, SelectionSort_~a.offset + 4 * SelectionSort_~j~0, 4);call SelectionSort_#t~mem5 := read~int(SelectionSort_~a.base, SelectionSort_~a.offset + 4 * SelectionSort_~min~0, 4); 769#L556 assume !(SelectionSort_#t~mem4 < SelectionSort_#t~mem5);havoc SelectionSort_#t~mem4;havoc SelectionSort_#t~mem5; 760#L554-2 SelectionSort_#t~pre3 := 1 + SelectionSort_~j~0;SelectionSort_~j~0 := 1 + SelectionSort_~j~0;havoc SelectionSort_#t~pre3; 757#L554-3 assume !!(SelectionSort_~j~0 < SelectionSort_~array_size);call SelectionSort_#t~mem4 := read~int(SelectionSort_~a.base, SelectionSort_~a.offset + 4 * SelectionSort_~j~0, 4);call SelectionSort_#t~mem5 := read~int(SelectionSort_~a.base, SelectionSort_~a.offset + 4 * SelectionSort_~min~0, 4); 762#L556 assume !(SelectionSort_#t~mem4 < SelectionSort_#t~mem5);havoc SelectionSort_#t~mem4;havoc SelectionSort_#t~mem5; 763#L554-2 SelectionSort_#t~pre3 := 1 + SelectionSort_~j~0;SelectionSort_~j~0 := 1 + SelectionSort_~j~0;havoc SelectionSort_#t~pre3; 768#L554-3 assume !!(SelectionSort_~j~0 < SelectionSort_~array_size);call SelectionSort_#t~mem4 := read~int(SelectionSort_~a.base, SelectionSort_~a.offset + 4 * SelectionSort_~j~0, 4);call SelectionSort_#t~mem5 := read~int(SelectionSort_~a.base, SelectionSort_~a.offset + 4 * SelectionSort_~min~0, 4); 766#L556 assume !(SelectionSort_#t~mem4 < SelectionSort_#t~mem5);havoc SelectionSort_#t~mem4;havoc SelectionSort_#t~mem5; 767#L554-2 SelectionSort_#t~pre3 := 1 + SelectionSort_~j~0;SelectionSort_~j~0 := 1 + SelectionSort_~j~0;havoc SelectionSort_#t~pre3; 765#L554-3 assume !(SelectionSort_~j~0 < SelectionSort_~array_size); 764#L554-4 call SelectionSort_#t~mem6 := read~int(SelectionSort_~a.base, SelectionSort_~a.offset + 4 * SelectionSort_~i~0, 4);SelectionSort_~temp~0 := SelectionSort_#t~mem6;havoc SelectionSort_#t~mem6;call SelectionSort_#t~mem7 := read~int(SelectionSort_~a.base, SelectionSort_~a.offset + 4 * SelectionSort_~min~0, 4);call write~int(SelectionSort_#t~mem7, SelectionSort_~a.base, SelectionSort_~a.offset + 4 * SelectionSort_~i~0, 4);havoc SelectionSort_#t~mem7;call write~int(SelectionSort_~temp~0, SelectionSort_~a.base, SelectionSort_~a.offset + 4 * SelectionSort_~min~0, 4); 749#L550-2 SelectionSort_#t~pre2 := 1 + SelectionSort_~i~0;SelectionSort_~i~0 := 1 + SelectionSort_~i~0;havoc SelectionSort_#t~pre2; 750#L550-3 assume !!(SelectionSort_~i~0 < SelectionSort_~array_size - 1);havoc SelectionSort_~j~0;havoc SelectionSort_~min~0;havoc SelectionSort_~temp~0;SelectionSort_~min~0 := SelectionSort_~i~0;SelectionSort_~j~0 := 1 + SelectionSort_~i~0; 758#L554-3 [2019-11-28 20:35:00,682 INFO L796 eck$LassoCheckResult]: Loop: 758#L554-3 assume !!(SelectionSort_~j~0 < SelectionSort_~array_size);call SelectionSort_#t~mem4 := read~int(SelectionSort_~a.base, SelectionSort_~a.offset + 4 * SelectionSort_~j~0, 4);call SelectionSort_#t~mem5 := read~int(SelectionSort_~a.base, SelectionSort_~a.offset + 4 * SelectionSort_~min~0, 4); 761#L556 assume SelectionSort_#t~mem4 < SelectionSort_#t~mem5;havoc SelectionSort_#t~mem4;havoc SelectionSort_#t~mem5;SelectionSort_~min~0 := SelectionSort_~j~0; 759#L554-2 SelectionSort_#t~pre3 := 1 + SelectionSort_~j~0;SelectionSort_~j~0 := 1 + SelectionSort_~j~0;havoc SelectionSort_#t~pre3; 758#L554-3 [2019-11-28 20:35:00,683 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 20:35:00,683 INFO L82 PathProgramCache]: Analyzing trace with hash 661745927, now seen corresponding path program 3 times [2019-11-28 20:35:00,683 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 20:35:00,683 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [170392024] [2019-11-28 20:35:00,683 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 20:35:00,696 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 20:35:00,706 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 20:35:00,711 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-28 20:35:00,711 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 20:35:00,711 INFO L82 PathProgramCache]: Analyzing trace with hash 54716, now seen corresponding path program 4 times [2019-11-28 20:35:00,712 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 20:35:00,712 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1792034022] [2019-11-28 20:35:00,712 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 20:35:00,715 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 20:35:00,718 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 20:35:00,719 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-28 20:35:00,719 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 20:35:00,720 INFO L82 PathProgramCache]: Analyzing trace with hash 173047542, now seen corresponding path program 2 times [2019-11-28 20:35:00,720 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 20:35:00,720 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [800436210] [2019-11-28 20:35:00,720 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 20:35:00,738 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 20:35:00,755 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 20:35:00,760 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-28 20:35:01,286 WARN L192 SmtUtils]: Spent 450.00 ms on a formula simplification. DAG size of input: 151 DAG size of output: 120 [2019-11-28 20:35:01,382 INFO L210 LassoAnalysis]: Preferences: [2019-11-28 20:35:01,382 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2019-11-28 20:35:01,382 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-11-28 20:35:01,382 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2019-11-28 20:35:01,382 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2019-11-28 20:35:01,383 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 20:35:01,383 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2019-11-28 20:35:01,383 INFO L132 ssoRankerPreferences]: Path of dumped script: [2019-11-28 20:35:01,383 INFO L133 ssoRankerPreferences]: Filename of dumped script: selectionsort-alloca-2.i_Iteration7_Lasso [2019-11-28 20:35:01,383 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2019-11-28 20:35:01,383 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2019-11-28 20:35:01,386 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 20:35:01,389 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 20:35:01,395 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 20:35:01,402 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 20:35:01,403 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 20:35:01,404 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 20:35:01,405 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 20:35:01,408 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 20:35:01,410 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 20:35:01,644 WARN L192 SmtUtils]: Spent 150.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 59 [2019-11-28 20:35:01,756 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 20:35:01,759 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 20:35:01,760 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 20:35:01,762 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 20:35:01,764 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 20:35:01,767 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 20:35:01,927 WARN L192 SmtUtils]: Spent 105.00 ms on a formula simplification. DAG size of input: 45 DAG size of output: 41 [2019-11-28 20:35:02,177 INFO L292 LassoAnalysis]: Preprocessing complete. [2019-11-28 20:35:02,177 INFO L489 LassoAnalysis]: Using template 'affine'. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 24 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 24 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 20:35:02,186 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-28 20:35:02,187 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 20:35:02,187 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 20:35:02,188 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 20:35:02,188 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 20:35:02,190 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-28 20:35:02,190 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-28 20:35:02,193 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 25 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-11-28 20:35:02,207 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-28 20:35:02,208 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 20:35:02,209 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-28 20:35:02,209 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 20:35:02,209 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 20:35:02,209 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. Waiting until toolchain timeout for monitored process 25 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 20:35:02,210 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-28 20:35:02,210 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-28 20:35:02,211 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 26 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 26 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 20:35:02,216 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-28 20:35:02,217 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 20:35:02,218 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 20:35:02,218 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 20:35:02,218 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 20:35:02,219 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-28 20:35:02,220 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-28 20:35:02,222 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 27 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-11-28 20:35:02,237 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-28 20:35:02,238 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 20:35:02,239 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-28 20:35:02,239 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 20:35:02,239 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 20:35:02,239 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 20:35:02,239 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-28 20:35:02,240 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. Waiting until toolchain timeout for monitored process 27 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 20:35:02,241 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 28 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 28 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 20:35:02,247 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-28 20:35:02,249 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 20:35:02,249 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-28 20:35:02,250 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 20:35:02,250 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 20:35:02,250 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 20:35:02,250 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-28 20:35:02,250 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-28 20:35:02,251 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 29 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 29 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 20:35:02,257 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-28 20:35:02,258 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 20:35:02,259 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-28 20:35:02,259 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 20:35:02,259 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 20:35:02,259 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 20:35:02,260 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-28 20:35:02,260 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-28 20:35:02,261 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 30 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 30 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 20:35:02,268 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-28 20:35:02,269 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 20:35:02,269 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-28 20:35:02,269 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 20:35:02,270 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 20:35:02,270 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 20:35:02,270 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-28 20:35:02,270 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-28 20:35:02,271 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 31 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 31 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 20:35:02,278 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-28 20:35:02,279 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 20:35:02,279 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 20:35:02,279 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 20:35:02,280 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 20:35:02,281 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-28 20:35:02,281 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-28 20:35:02,285 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [MP z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (31)] Exception during sending of exit command (exit): Broken pipe No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 32 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 32 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 20:35:02,291 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-28 20:35:02,293 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 20:35:02,293 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 20:35:02,293 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 20:35:02,293 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 20:35:02,299 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-28 20:35:02,299 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-28 20:35:02,312 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 33 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-11-28 20:35:02,320 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-28 20:35:02,321 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 20:35:02,322 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 20:35:02,322 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 20:35:02,322 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. Waiting until toolchain timeout for monitored process 33 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 20:35:02,325 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-28 20:35:02,325 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-28 20:35:02,333 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 34 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 34 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 20:35:02,357 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-28 20:35:02,359 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 20:35:02,359 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 20:35:02,359 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 20:35:02,359 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 20:35:02,372 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-28 20:35:02,373 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-28 20:35:02,390 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-11-28 20:35:02,416 INFO L443 ModelExtractionUtils]: Simplification made 12 calls to the SMT solver. [2019-11-28 20:35:02,416 INFO L444 ModelExtractionUtils]: 20 out of 40 variables were initially zero. Simplification set additionally 13 variables to zero. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 35 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 35 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 20:35:02,422 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-11-28 20:35:02,424 INFO L438 nArgumentSynthesizer]: Removed 1 redundant supporting invariants from a total of 2. [2019-11-28 20:35:02,425 INFO L510 LassoAnalysis]: Proved termination. [2019-11-28 20:35:02,425 INFO L512 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_SelectionSort_~a.offset, ULTIMATE.start_SelectionSort_~min~0, v_rep(select #length ULTIMATE.start_SelectionSort_~a.base)_4) = -1*ULTIMATE.start_SelectionSort_~a.offset - 4*ULTIMATE.start_SelectionSort_~min~0 + 1*v_rep(select #length ULTIMATE.start_SelectionSort_~a.base)_4 Supporting invariants [1*ULTIMATE.start_SelectionSort_~j~0 - 1*ULTIMATE.start_SelectionSort_~min~0 - 1 >= 0] [2019-11-28 20:35:02,457 INFO L297 tatePredicateManager]: 10 out of 11 supporting invariants were superfluous and have been removed [2019-11-28 20:35:02,459 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2019-11-28 20:35:02,480 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 20:35:02,498 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:35:02,499 INFO L264 TraceCheckSpWp]: Trace formula consists of 101 conjuncts, 4 conjunts are in the unsatisfiable core [2019-11-28 20:35:02,500 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 20:35:02,506 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:35:02,506 INFO L264 TraceCheckSpWp]: Trace formula consists of 19 conjuncts, 7 conjunts are in the unsatisfiable core [2019-11-28 20:35:02,507 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 20:35:02,551 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 20:35:02,551 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 3 loop predicates [2019-11-28 20:35:02,551 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 21 states and 28 transitions. cyclomatic complexity: 9 Second operand 4 states. [2019-11-28 20:35:02,635 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 21 states and 28 transitions. cyclomatic complexity: 9. Second operand 4 states. Result 46 states and 58 transitions. Complement of second has 8 states. [2019-11-28 20:35:02,636 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 5 states 1 stem states 2 non-accepting loop states 2 accepting loop states [2019-11-28 20:35:02,636 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2019-11-28 20:35:02,636 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 14 transitions. [2019-11-28 20:35:02,636 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 14 transitions. Stem has 18 letters. Loop has 3 letters. [2019-11-28 20:35:02,636 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-28 20:35:02,636 INFO L639 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2019-11-28 20:35:02,655 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 20:35:02,673 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:35:02,674 INFO L264 TraceCheckSpWp]: Trace formula consists of 101 conjuncts, 4 conjunts are in the unsatisfiable core [2019-11-28 20:35:02,675 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 20:35:02,681 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:35:02,682 INFO L264 TraceCheckSpWp]: Trace formula consists of 19 conjuncts, 7 conjunts are in the unsatisfiable core [2019-11-28 20:35:02,682 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 20:35:02,723 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 20:35:02,723 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and with honda bouncer for loop.1 stem predicates 3 loop predicates [2019-11-28 20:35:02,723 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 21 states and 28 transitions. cyclomatic complexity: 9 Second operand 4 states. [2019-11-28 20:35:02,806 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 21 states and 28 transitions. cyclomatic complexity: 9. Second operand 4 states. Result 52 states and 69 transitions. Complement of second has 9 states. [2019-11-28 20:35:02,806 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 5 states 1 stem states 3 non-accepting loop states 1 accepting loop states [2019-11-28 20:35:02,806 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2019-11-28 20:35:02,807 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 16 transitions. [2019-11-28 20:35:02,807 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 16 transitions. Stem has 18 letters. Loop has 3 letters. [2019-11-28 20:35:02,807 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-28 20:35:02,807 INFO L639 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2019-11-28 20:35:02,827 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 20:35:02,846 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:35:02,846 INFO L264 TraceCheckSpWp]: Trace formula consists of 101 conjuncts, 4 conjunts are in the unsatisfiable core [2019-11-28 20:35:02,847 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 20:35:02,854 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:35:02,854 INFO L264 TraceCheckSpWp]: Trace formula consists of 19 conjuncts, 7 conjunts are in the unsatisfiable core [2019-11-28 20:35:02,855 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 20:35:02,893 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 20:35:02,894 INFO L152 lantAutomatonBouncer]: Defining Buchi interpolant automaton with scrooge nondeterminism in stemwith honda bouncer for stem and without honda bouncer for loop.1 stem predicates 3 loop predicates [2019-11-28 20:35:02,894 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 21 states and 28 transitions. cyclomatic complexity: 9 Second operand 4 states. [2019-11-28 20:35:02,985 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 21 states and 28 transitions. cyclomatic complexity: 9. Second operand 4 states. Result 57 states and 72 transitions. Complement of second has 7 states. [2019-11-28 20:35:02,985 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 5 states 1 stem states 2 non-accepting loop states 2 accepting loop states [2019-11-28 20:35:02,986 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2019-11-28 20:35:02,986 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 22 transitions. [2019-11-28 20:35:02,986 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 22 transitions. Stem has 18 letters. Loop has 3 letters. [2019-11-28 20:35:02,987 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-28 20:35:02,987 INFO L639 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2019-11-28 20:35:03,012 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 20:35:03,030 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:35:03,031 INFO L264 TraceCheckSpWp]: Trace formula consists of 101 conjuncts, 4 conjunts are in the unsatisfiable core [2019-11-28 20:35:03,032 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 20:35:03,036 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:35:03,037 INFO L264 TraceCheckSpWp]: Trace formula consists of 19 conjuncts, 7 conjunts are in the unsatisfiable core [2019-11-28 20:35:03,037 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 20:35:03,099 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 20:35:03,099 INFO L152 lantAutomatonBouncer]: Defining Buchi interpolant automaton with scrooge nondeterminism in stemwith honda bouncer for stem and with honda bouncer for loop.1 stem predicates 3 loop predicates [2019-11-28 20:35:03,099 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 21 states and 28 transitions. cyclomatic complexity: 9 Second operand 4 states. [2019-11-28 20:35:03,175 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 21 states and 28 transitions. cyclomatic complexity: 9. Second operand 4 states. Result 50 states and 66 transitions. Complement of second has 8 states. [2019-11-28 20:35:03,175 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 5 states 1 stem states 3 non-accepting loop states 1 accepting loop states [2019-11-28 20:35:03,175 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2019-11-28 20:35:03,176 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 24 transitions. [2019-11-28 20:35:03,176 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 24 transitions. Stem has 18 letters. Loop has 3 letters. [2019-11-28 20:35:03,177 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-28 20:35:03,177 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 24 transitions. Stem has 21 letters. Loop has 3 letters. [2019-11-28 20:35:03,177 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-28 20:35:03,178 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 24 transitions. Stem has 18 letters. Loop has 6 letters. [2019-11-28 20:35:03,178 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-28 20:35:03,179 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 50 states and 66 transitions. [2019-11-28 20:35:03,180 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2019-11-28 20:35:03,181 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 50 states to 43 states and 57 transitions. [2019-11-28 20:35:03,181 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 9 [2019-11-28 20:35:03,182 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 10 [2019-11-28 20:35:03,182 INFO L73 IsDeterministic]: Start isDeterministic. Operand 43 states and 57 transitions. [2019-11-28 20:35:03,182 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-11-28 20:35:03,182 INFO L688 BuchiCegarLoop]: Abstraction has 43 states and 57 transitions. [2019-11-28 20:35:03,182 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states and 57 transitions. [2019-11-28 20:35:03,185 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 40. [2019-11-28 20:35:03,185 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 40 states. [2019-11-28 20:35:03,185 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 54 transitions. [2019-11-28 20:35:03,186 INFO L711 BuchiCegarLoop]: Abstraction has 40 states and 54 transitions. [2019-11-28 20:35:03,186 INFO L591 BuchiCegarLoop]: Abstraction has 40 states and 54 transitions. [2019-11-28 20:35:03,186 INFO L424 BuchiCegarLoop]: ======== Iteration 8============ [2019-11-28 20:35:03,186 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 40 states and 54 transitions. [2019-11-28 20:35:03,186 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2019-11-28 20:35:03,187 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-28 20:35:03,187 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-28 20:35:03,187 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [4, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 20:35:03,187 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2019-11-28 20:35:03,188 INFO L794 eck$LassoCheckResult]: Stem: 1361#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; 1355#L-1 havoc main_#res;havoc main_#t~nondet8, main_#t~malloc9.base, main_#t~malloc9.offset, main_~array_size~0, main_~numbers~0.base, main_~numbers~0.offset;main_~array_size~0 := main_#t~nondet8;havoc main_#t~nondet8; 1356#L566 assume !(main_~array_size~0 < 1); 1357#L566-2 call main_#t~malloc9.base, main_#t~malloc9.offset := #Ultimate.allocOnStack(4 * main_~array_size~0);main_~numbers~0.base, main_~numbers~0.offset := main_#t~malloc9.base, main_#t~malloc9.offset;SelectionSort_#in~a.base, SelectionSort_#in~a.offset, SelectionSort_#in~array_size := main_~numbers~0.base, main_~numbers~0.offset, main_~array_size~0;havoc SelectionSort_#t~mem4, SelectionSort_#t~mem5, SelectionSort_#t~pre3, SelectionSort_#t~mem6, SelectionSort_#t~mem7, SelectionSort_#t~pre2, SelectionSort_~j~0, SelectionSort_~min~0, SelectionSort_~temp~0, SelectionSort_~a.base, SelectionSort_~a.offset, SelectionSort_~array_size, SelectionSort_~i~0;SelectionSort_~a.base, SelectionSort_~a.offset := SelectionSort_#in~a.base, SelectionSort_#in~a.offset;SelectionSort_~array_size := SelectionSort_#in~array_size;havoc SelectionSort_~i~0;SelectionSort_~i~0 := 0; 1358#L550-3 assume !!(SelectionSort_~i~0 < SelectionSort_~array_size - 1);havoc SelectionSort_~j~0;havoc SelectionSort_~min~0;havoc SelectionSort_~temp~0;SelectionSort_~min~0 := SelectionSort_~i~0;SelectionSort_~j~0 := 1 + SelectionSort_~i~0; 1362#L554-3 assume !!(SelectionSort_~j~0 < SelectionSort_~array_size);call SelectionSort_#t~mem4 := read~int(SelectionSort_~a.base, SelectionSort_~a.offset + 4 * SelectionSort_~j~0, 4);call SelectionSort_#t~mem5 := read~int(SelectionSort_~a.base, SelectionSort_~a.offset + 4 * SelectionSort_~min~0, 4); 1370#L556 assume SelectionSort_#t~mem4 < SelectionSort_#t~mem5;havoc SelectionSort_#t~mem4;havoc SelectionSort_#t~mem5;SelectionSort_~min~0 := SelectionSort_~j~0; 1372#L554-2 SelectionSort_#t~pre3 := 1 + SelectionSort_~j~0;SelectionSort_~j~0 := 1 + SelectionSort_~j~0;havoc SelectionSort_#t~pre3; 1363#L554-3 assume !!(SelectionSort_~j~0 < SelectionSort_~array_size);call SelectionSort_#t~mem4 := read~int(SelectionSort_~a.base, SelectionSort_~a.offset + 4 * SelectionSort_~j~0, 4);call SelectionSort_#t~mem5 := read~int(SelectionSort_~a.base, SelectionSort_~a.offset + 4 * SelectionSort_~min~0, 4); 1392#L556 assume !(SelectionSort_#t~mem4 < SelectionSort_#t~mem5);havoc SelectionSort_#t~mem4;havoc SelectionSort_#t~mem5; 1390#L554-2 SelectionSort_#t~pre3 := 1 + SelectionSort_~j~0;SelectionSort_~j~0 := 1 + SelectionSort_~j~0;havoc SelectionSort_#t~pre3; 1386#L554-3 assume !!(SelectionSort_~j~0 < SelectionSort_~array_size);call SelectionSort_#t~mem4 := read~int(SelectionSort_~a.base, SelectionSort_~a.offset + 4 * SelectionSort_~j~0, 4);call SelectionSort_#t~mem5 := read~int(SelectionSort_~a.base, SelectionSort_~a.offset + 4 * SelectionSort_~min~0, 4); 1376#L556 assume !(SelectionSort_#t~mem4 < SelectionSort_#t~mem5);havoc SelectionSort_#t~mem4;havoc SelectionSort_#t~mem5; 1385#L554-2 SelectionSort_#t~pre3 := 1 + SelectionSort_~j~0;SelectionSort_~j~0 := 1 + SelectionSort_~j~0;havoc SelectionSort_#t~pre3; 1375#L554-3 assume !(SelectionSort_~j~0 < SelectionSort_~array_size); 1374#L554-4 call SelectionSort_#t~mem6 := read~int(SelectionSort_~a.base, SelectionSort_~a.offset + 4 * SelectionSort_~i~0, 4);SelectionSort_~temp~0 := SelectionSort_#t~mem6;havoc SelectionSort_#t~mem6;call SelectionSort_#t~mem7 := read~int(SelectionSort_~a.base, SelectionSort_~a.offset + 4 * SelectionSort_~min~0, 4);call write~int(SelectionSort_#t~mem7, SelectionSort_~a.base, SelectionSort_~a.offset + 4 * SelectionSort_~i~0, 4);havoc SelectionSort_#t~mem7;call write~int(SelectionSort_~temp~0, SelectionSort_~a.base, SelectionSort_~a.offset + 4 * SelectionSort_~min~0, 4); 1359#L550-2 SelectionSort_#t~pre2 := 1 + SelectionSort_~i~0;SelectionSort_~i~0 := 1 + SelectionSort_~i~0;havoc SelectionSort_#t~pre2; 1360#L550-3 assume !!(SelectionSort_~i~0 < SelectionSort_~array_size - 1);havoc SelectionSort_~j~0;havoc SelectionSort_~min~0;havoc SelectionSort_~temp~0;SelectionSort_~min~0 := SelectionSort_~i~0;SelectionSort_~j~0 := 1 + SelectionSort_~i~0; 1364#L554-3 assume !!(SelectionSort_~j~0 < SelectionSort_~array_size);call SelectionSort_#t~mem4 := read~int(SelectionSort_~a.base, SelectionSort_~a.offset + 4 * SelectionSort_~j~0, 4);call SelectionSort_#t~mem5 := read~int(SelectionSort_~a.base, SelectionSort_~a.offset + 4 * SelectionSort_~min~0, 4); 1369#L556 [2019-11-28 20:35:03,188 INFO L796 eck$LassoCheckResult]: Loop: 1369#L556 assume !(SelectionSort_#t~mem4 < SelectionSort_#t~mem5);havoc SelectionSort_#t~mem4;havoc SelectionSort_#t~mem5; 1365#L554-2 SelectionSort_#t~pre3 := 1 + SelectionSort_~j~0;SelectionSort_~j~0 := 1 + SelectionSort_~j~0;havoc SelectionSort_#t~pre3; 1366#L554-3 assume !!(SelectionSort_~j~0 < SelectionSort_~array_size);call SelectionSort_#t~mem4 := read~int(SelectionSort_~a.base, SelectionSort_~a.offset + 4 * SelectionSort_~j~0, 4);call SelectionSort_#t~mem5 := read~int(SelectionSort_~a.base, SelectionSort_~a.offset + 4 * SelectionSort_~min~0, 4); 1369#L556 [2019-11-28 20:35:03,188 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 20:35:03,188 INFO L82 PathProgramCache]: Analyzing trace with hash -373906704, now seen corresponding path program 3 times [2019-11-28 20:35:03,188 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 20:35:03,188 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1030131523] [2019-11-28 20:35:03,189 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 20:35:03,205 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 20:35:03,219 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 20:35:03,223 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-28 20:35:03,224 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 20:35:03,224 INFO L82 PathProgramCache]: Analyzing trace with hash 59638, now seen corresponding path program 1 times [2019-11-28 20:35:03,224 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 20:35:03,224 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1430233203] [2019-11-28 20:35:03,225 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 20:35:03,227 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 20:35:03,229 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 20:35:03,230 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-28 20:35:03,230 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 20:35:03,230 INFO L82 PathProgramCache]: Analyzing trace with hash 2090576807, now seen corresponding path program 4 times [2019-11-28 20:35:03,231 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 20:35:03,231 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [983601964] [2019-11-28 20:35:03,231 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 20:35:03,247 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 20:35:03,262 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 20:35:03,267 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-28 20:35:03,832 WARN L192 SmtUtils]: Spent 507.00 ms on a formula simplification. DAG size of input: 182 DAG size of output: 130 [2019-11-28 20:35:03,936 INFO L210 LassoAnalysis]: Preferences: [2019-11-28 20:35:03,937 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2019-11-28 20:35:03,937 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-11-28 20:35:03,937 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2019-11-28 20:35:03,937 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2019-11-28 20:35:03,937 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 20:35:03,937 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2019-11-28 20:35:03,938 INFO L132 ssoRankerPreferences]: Path of dumped script: [2019-11-28 20:35:03,938 INFO L133 ssoRankerPreferences]: Filename of dumped script: selectionsort-alloca-2.i_Iteration8_Lasso [2019-11-28 20:35:03,938 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2019-11-28 20:35:03,938 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2019-11-28 20:35:03,941 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 20:35:03,947 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 20:35:03,950 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 20:35:03,952 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 20:35:04,212 WARN L192 SmtUtils]: Spent 149.00 ms on a formula simplification. DAG size of input: 75 DAG size of output: 66 [2019-11-28 20:35:04,308 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 20:35:04,311 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 20:35:04,312 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 20:35:04,313 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 20:35:04,317 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 20:35:04,318 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 20:35:04,320 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 20:35:04,322 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 20:35:04,324 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 20:35:04,707 INFO L292 LassoAnalysis]: Preprocessing complete. [2019-11-28 20:35:04,708 INFO L489 LassoAnalysis]: Using template 'affine'. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 36 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 36 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 20:35:04,721 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-28 20:35:04,722 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 20:35:04,722 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-28 20:35:04,723 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 20:35:04,723 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 20:35:04,723 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 20:35:04,723 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-28 20:35:04,723 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-28 20:35:04,724 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 37 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 37 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 20:35:04,729 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-28 20:35:04,730 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 20:35:04,730 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 20:35:04,730 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 20:35:04,730 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 20:35:04,732 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-28 20:35:04,732 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-28 20:35:04,734 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 38 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 38 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 20:35:04,740 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-28 20:35:04,741 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 20:35:04,741 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 20:35:04,741 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 20:35:04,741 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 20:35:04,743 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-28 20:35:04,743 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-28 20:35:04,751 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 39 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-11-28 20:35:04,758 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-28 20:35:04,760 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 20:35:04,760 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 20:35:04,760 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 20:35:04,760 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 20:35:04,766 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-28 20:35:04,766 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. Waiting until toolchain timeout for monitored process 39 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 20:35:04,778 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 40 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-11-28 20:35:04,785 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-28 20:35:04,787 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 20:35:04,788 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 20:35:04,788 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 20:35:04,788 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 20:35:04,797 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-28 20:35:04,797 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. Waiting until toolchain timeout for monitored process 40 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 20:35:04,820 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-11-28 20:35:04,869 INFO L443 ModelExtractionUtils]: Simplification made 20 calls to the SMT solver. [2019-11-28 20:35:04,869 INFO L444 ModelExtractionUtils]: 5 out of 37 variables were initially zero. Simplification set additionally 27 variables to zero. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 41 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-11-28 20:35:04,875 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... Waiting until toolchain timeout for monitored process 41 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 20:35:04,877 INFO L438 nArgumentSynthesizer]: Removed 1 redundant supporting invariants from a total of 2. [2019-11-28 20:35:04,878 INFO L510 LassoAnalysis]: Proved termination. [2019-11-28 20:35:04,878 INFO L512 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_SelectionSort_~j~0, ULTIMATE.start_SelectionSort_~min~0) = -2*ULTIMATE.start_SelectionSort_~j~0 + 13*ULTIMATE.start_SelectionSort_~min~0 Supporting invariants [16*ULTIMATE.start_SelectionSort_~min~0 - 1*v_rep(select #length ULTIMATE.start_main_#t~malloc9.base)_5 >= 0] [2019-11-28 20:35:04,948 INFO L297 tatePredicateManager]: 17 out of 19 supporting invariants were superfluous and have been removed [2019-11-28 20:35:04,985 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 20:35:05,010 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:35:05,012 INFO L264 TraceCheckSpWp]: Trace formula consists of 114 conjuncts, 19 conjunts are in the unsatisfiable core [2019-11-28 20:35:05,013 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 20:35:05,060 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2019-11-28 20:35:05,060 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-28 20:35:05,071 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-28 20:35:05,077 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-28 20:35:05,077 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:19, output treesize:22 [2019-11-28 20:35:05,320 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:35:05,320 INFO L264 TraceCheckSpWp]: Trace formula consists of 19 conjuncts, 9 conjunts are in the unsatisfiable core [2019-11-28 20:35:05,321 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 20:35:05,339 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 20:35:05,339 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.9 stem predicates 2 loop predicates [2019-11-28 20:35:05,339 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 40 states and 54 transitions. cyclomatic complexity: 17 Second operand 12 states. [2019-11-28 20:35:05,403 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 40 states and 54 transitions. cyclomatic complexity: 17. Second operand 12 states. Result 40 states and 54 transitions. Complement of second has 5 states. [2019-11-28 20:35:05,405 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 3 stem states 0 non-accepting loop states 1 accepting loop states [2019-11-28 20:35:05,405 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2019-11-28 20:35:05,406 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 7 transitions. [2019-11-28 20:35:05,406 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 7 transitions. Stem has 19 letters. Loop has 3 letters. [2019-11-28 20:35:05,406 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-28 20:35:05,406 INFO L639 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2019-11-28 20:35:05,430 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 20:35:05,450 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:35:05,451 INFO L264 TraceCheckSpWp]: Trace formula consists of 114 conjuncts, 19 conjunts are in the unsatisfiable core [2019-11-28 20:35:05,452 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 20:35:05,464 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2019-11-28 20:35:05,464 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-28 20:35:05,478 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-28 20:35:05,479 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-28 20:35:05,479 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:19, output treesize:22 [2019-11-28 20:35:05,670 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:35:05,670 INFO L264 TraceCheckSpWp]: Trace formula consists of 19 conjuncts, 9 conjunts are in the unsatisfiable core [2019-11-28 20:35:05,671 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 20:35:05,692 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 20:35:05,692 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and with honda bouncer for loop.9 stem predicates 2 loop predicates [2019-11-28 20:35:05,692 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 40 states and 54 transitions. cyclomatic complexity: 17 Second operand 12 states. [2019-11-28 20:35:05,741 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 40 states and 54 transitions. cyclomatic complexity: 17. Second operand 12 states. Result 40 states and 54 transitions. Complement of second has 5 states. [2019-11-28 20:35:05,742 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 3 stem states 0 non-accepting loop states 1 accepting loop states [2019-11-28 20:35:05,742 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2019-11-28 20:35:05,743 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 7 transitions. [2019-11-28 20:35:05,743 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 7 transitions. Stem has 19 letters. Loop has 3 letters. [2019-11-28 20:35:05,743 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-28 20:35:05,743 INFO L639 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2019-11-28 20:35:05,765 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 20:35:05,787 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:35:05,788 INFO L264 TraceCheckSpWp]: Trace formula consists of 114 conjuncts, 19 conjunts are in the unsatisfiable core [2019-11-28 20:35:05,789 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 20:35:05,798 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2019-11-28 20:35:05,798 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-28 20:35:05,806 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-28 20:35:05,807 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-28 20:35:05,808 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:19, output treesize:22 [2019-11-28 20:35:06,001 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:35:06,001 INFO L264 TraceCheckSpWp]: Trace formula consists of 19 conjuncts, 9 conjunts are in the unsatisfiable core [2019-11-28 20:35:06,002 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 20:35:06,018 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 20:35:06,019 INFO L152 lantAutomatonBouncer]: Defining Buchi interpolant automaton with scrooge nondeterminism in stemwith honda bouncer for stem and without honda bouncer for loop.9 stem predicates 2 loop predicates [2019-11-28 20:35:06,019 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 40 states and 54 transitions. cyclomatic complexity: 17 Second operand 12 states. [2019-11-28 20:35:07,117 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 40 states and 54 transitions. cyclomatic complexity: 17. Second operand 12 states. Result 286 states and 366 transitions. Complement of second has 46 states. [2019-11-28 20:35:07,117 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 22 states 18 stem states 2 non-accepting loop states 2 accepting loop states [2019-11-28 20:35:07,118 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2019-11-28 20:35:07,119 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 116 transitions. [2019-11-28 20:35:07,119 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 22 states and 116 transitions. Stem has 19 letters. Loop has 3 letters. [2019-11-28 20:35:07,120 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-28 20:35:07,120 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 22 states and 116 transitions. Stem has 22 letters. Loop has 3 letters. [2019-11-28 20:35:07,121 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-28 20:35:07,121 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 22 states and 116 transitions. Stem has 19 letters. Loop has 6 letters. [2019-11-28 20:35:07,121 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-28 20:35:07,122 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 286 states and 366 transitions. [2019-11-28 20:35:07,126 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 6 [2019-11-28 20:35:07,129 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 286 states to 234 states and 310 transitions. [2019-11-28 20:35:07,129 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 23 [2019-11-28 20:35:07,129 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 32 [2019-11-28 20:35:07,129 INFO L73 IsDeterministic]: Start isDeterministic. Operand 234 states and 310 transitions. [2019-11-28 20:35:07,129 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-11-28 20:35:07,130 INFO L688 BuchiCegarLoop]: Abstraction has 234 states and 310 transitions. [2019-11-28 20:35:07,130 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 234 states and 310 transitions. [2019-11-28 20:35:07,138 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 234 to 85. [2019-11-28 20:35:07,138 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 85 states. [2019-11-28 20:35:07,139 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 85 states to 85 states and 119 transitions. [2019-11-28 20:35:07,139 INFO L711 BuchiCegarLoop]: Abstraction has 85 states and 119 transitions. [2019-11-28 20:35:07,139 INFO L591 BuchiCegarLoop]: Abstraction has 85 states and 119 transitions. [2019-11-28 20:35:07,139 INFO L424 BuchiCegarLoop]: ======== Iteration 9============ [2019-11-28 20:35:07,139 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 85 states and 119 transitions. [2019-11-28 20:35:07,140 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2019-11-28 20:35:07,141 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-28 20:35:07,141 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-28 20:35:07,141 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [5, 4, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 20:35:07,142 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2019-11-28 20:35:07,142 INFO L794 eck$LassoCheckResult]: Stem: 2188#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; 2180#L-1 havoc main_#res;havoc main_#t~nondet8, main_#t~malloc9.base, main_#t~malloc9.offset, main_~array_size~0, main_~numbers~0.base, main_~numbers~0.offset;main_~array_size~0 := main_#t~nondet8;havoc main_#t~nondet8; 2181#L566 assume !(main_~array_size~0 < 1); 2182#L566-2 call main_#t~malloc9.base, main_#t~malloc9.offset := #Ultimate.allocOnStack(4 * main_~array_size~0);main_~numbers~0.base, main_~numbers~0.offset := main_#t~malloc9.base, main_#t~malloc9.offset;SelectionSort_#in~a.base, SelectionSort_#in~a.offset, SelectionSort_#in~array_size := main_~numbers~0.base, main_~numbers~0.offset, main_~array_size~0;havoc SelectionSort_#t~mem4, SelectionSort_#t~mem5, SelectionSort_#t~pre3, SelectionSort_#t~mem6, SelectionSort_#t~mem7, SelectionSort_#t~pre2, SelectionSort_~j~0, SelectionSort_~min~0, SelectionSort_~temp~0, SelectionSort_~a.base, SelectionSort_~a.offset, SelectionSort_~array_size, SelectionSort_~i~0;SelectionSort_~a.base, SelectionSort_~a.offset := SelectionSort_#in~a.base, SelectionSort_#in~a.offset;SelectionSort_~array_size := SelectionSort_#in~array_size;havoc SelectionSort_~i~0;SelectionSort_~i~0 := 0; 2183#L550-3 assume !!(SelectionSort_~i~0 < SelectionSort_~array_size - 1);havoc SelectionSort_~j~0;havoc SelectionSort_~min~0;havoc SelectionSort_~temp~0;SelectionSort_~min~0 := SelectionSort_~i~0;SelectionSort_~j~0 := 1 + SelectionSort_~i~0; 2184#L554-3 assume !!(SelectionSort_~j~0 < SelectionSort_~array_size);call SelectionSort_#t~mem4 := read~int(SelectionSort_~a.base, SelectionSort_~a.offset + 4 * SelectionSort_~j~0, 4);call SelectionSort_#t~mem5 := read~int(SelectionSort_~a.base, SelectionSort_~a.offset + 4 * SelectionSort_~min~0, 4); 2244#L556 assume SelectionSort_#t~mem4 < SelectionSort_#t~mem5;havoc SelectionSort_#t~mem4;havoc SelectionSort_#t~mem5;SelectionSort_~min~0 := SelectionSort_~j~0; 2243#L554-2 SelectionSort_#t~pre3 := 1 + SelectionSort_~j~0;SelectionSort_~j~0 := 1 + SelectionSort_~j~0;havoc SelectionSort_#t~pre3; 2240#L554-3 assume !!(SelectionSort_~j~0 < SelectionSort_~array_size);call SelectionSort_#t~mem4 := read~int(SelectionSort_~a.base, SelectionSort_~a.offset + 4 * SelectionSort_~j~0, 4);call SelectionSort_#t~mem5 := read~int(SelectionSort_~a.base, SelectionSort_~a.offset + 4 * SelectionSort_~min~0, 4); 2235#L556 assume !(SelectionSort_#t~mem4 < SelectionSort_#t~mem5);havoc SelectionSort_#t~mem4;havoc SelectionSort_#t~mem5; 2233#L554-2 SelectionSort_#t~pre3 := 1 + SelectionSort_~j~0;SelectionSort_~j~0 := 1 + SelectionSort_~j~0;havoc SelectionSort_#t~pre3; 2231#L554-3 assume !!(SelectionSort_~j~0 < SelectionSort_~array_size);call SelectionSort_#t~mem4 := read~int(SelectionSort_~a.base, SelectionSort_~a.offset + 4 * SelectionSort_~j~0, 4);call SelectionSort_#t~mem5 := read~int(SelectionSort_~a.base, SelectionSort_~a.offset + 4 * SelectionSort_~min~0, 4); 2217#L556 assume !(SelectionSort_#t~mem4 < SelectionSort_#t~mem5);havoc SelectionSort_#t~mem4;havoc SelectionSort_#t~mem5; 2230#L554-2 SelectionSort_#t~pre3 := 1 + SelectionSort_~j~0;SelectionSort_~j~0 := 1 + SelectionSort_~j~0;havoc SelectionSort_#t~pre3; 2229#L554-3 assume !(SelectionSort_~j~0 < SelectionSort_~array_size); 2198#L554-4 call SelectionSort_#t~mem6 := read~int(SelectionSort_~a.base, SelectionSort_~a.offset + 4 * SelectionSort_~i~0, 4);SelectionSort_~temp~0 := SelectionSort_#t~mem6;havoc SelectionSort_#t~mem6;call SelectionSort_#t~mem7 := read~int(SelectionSort_~a.base, SelectionSort_~a.offset + 4 * SelectionSort_~min~0, 4);call write~int(SelectionSort_#t~mem7, SelectionSort_~a.base, SelectionSort_~a.offset + 4 * SelectionSort_~i~0, 4);havoc SelectionSort_#t~mem7;call write~int(SelectionSort_~temp~0, SelectionSort_~a.base, SelectionSort_~a.offset + 4 * SelectionSort_~min~0, 4); 2178#L550-2 SelectionSort_#t~pre2 := 1 + SelectionSort_~i~0;SelectionSort_~i~0 := 1 + SelectionSort_~i~0;havoc SelectionSort_#t~pre2; 2179#L550-3 assume !!(SelectionSort_~i~0 < SelectionSort_~array_size - 1);havoc SelectionSort_~j~0;havoc SelectionSort_~min~0;havoc SelectionSort_~temp~0;SelectionSort_~min~0 := SelectionSort_~i~0;SelectionSort_~j~0 := 1 + SelectionSort_~i~0; 2193#L554-3 assume !!(SelectionSort_~j~0 < SelectionSort_~array_size);call SelectionSort_#t~mem4 := read~int(SelectionSort_~a.base, SelectionSort_~a.offset + 4 * SelectionSort_~j~0, 4);call SelectionSort_#t~mem5 := read~int(SelectionSort_~a.base, SelectionSort_~a.offset + 4 * SelectionSort_~min~0, 4); 2194#L556 assume SelectionSort_#t~mem4 < SelectionSort_#t~mem5;havoc SelectionSort_#t~mem4;havoc SelectionSort_#t~mem5;SelectionSort_~min~0 := SelectionSort_~j~0; 2248#L554-2 SelectionSort_#t~pre3 := 1 + SelectionSort_~j~0;SelectionSort_~j~0 := 1 + SelectionSort_~j~0;havoc SelectionSort_#t~pre3; 2200#L554-3 assume !!(SelectionSort_~j~0 < SelectionSort_~array_size);call SelectionSort_#t~mem4 := read~int(SelectionSort_~a.base, SelectionSort_~a.offset + 4 * SelectionSort_~j~0, 4);call SelectionSort_#t~mem5 := read~int(SelectionSort_~a.base, SelectionSort_~a.offset + 4 * SelectionSort_~min~0, 4); 2195#L556 [2019-11-28 20:35:07,142 INFO L796 eck$LassoCheckResult]: Loop: 2195#L556 assume !(SelectionSort_#t~mem4 < SelectionSort_#t~mem5);havoc SelectionSort_#t~mem4;havoc SelectionSort_#t~mem5; 2189#L554-2 SelectionSort_#t~pre3 := 1 + SelectionSort_~j~0;SelectionSort_~j~0 := 1 + SelectionSort_~j~0;havoc SelectionSort_#t~pre3; 2190#L554-3 assume !!(SelectionSort_~j~0 < SelectionSort_~array_size);call SelectionSort_#t~mem4 := read~int(SelectionSort_~a.base, SelectionSort_~a.offset + 4 * SelectionSort_~j~0, 4);call SelectionSort_#t~mem5 := read~int(SelectionSort_~a.base, SelectionSort_~a.offset + 4 * SelectionSort_~min~0, 4); 2195#L556 [2019-11-28 20:35:07,142 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 20:35:07,142 INFO L82 PathProgramCache]: Analyzing trace with hash 2090574885, now seen corresponding path program 5 times [2019-11-28 20:35:07,142 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 20:35:07,143 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2103506242] [2019-11-28 20:35:07,143 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 20:35:07,163 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 20:35:07,180 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 20:35:07,191 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-28 20:35:07,191 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 20:35:07,195 INFO L82 PathProgramCache]: Analyzing trace with hash 59638, now seen corresponding path program 2 times [2019-11-28 20:35:07,195 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 20:35:07,195 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1028509670] [2019-11-28 20:35:07,195 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 20:35:07,198 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 20:35:07,200 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 20:35:07,204 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-28 20:35:07,206 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 20:35:07,206 INFO L82 PathProgramCache]: Analyzing trace with hash -1004330414, now seen corresponding path program 6 times [2019-11-28 20:35:07,207 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 20:35:07,207 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1346687430] [2019-11-28 20:35:07,207 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 20:35:07,221 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:35:07,398 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 5 proven. 37 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 20:35:07,399 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1346687430] [2019-11-28 20:35:07,399 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [724420404] [2019-11-28 20:35:07,399 INFO L92 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 42 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 42 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-28 20:35:07,449 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 5 check-sat command(s) [2019-11-28 20:35:07,449 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-28 20:35:07,450 INFO L264 TraceCheckSpWp]: Trace formula consists of 144 conjuncts, 10 conjunts are in the unsatisfiable core [2019-11-28 20:35:07,451 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 20:35:07,581 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 6 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 20:35:07,581 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-28 20:35:07,581 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 10] total 20 [2019-11-28 20:35:07,582 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [323987218] [2019-11-28 20:35:07,633 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 20:35:07,634 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2019-11-28 20:35:07,634 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=59, Invalid=361, Unknown=0, NotChecked=0, Total=420 [2019-11-28 20:35:07,634 INFO L87 Difference]: Start difference. First operand 85 states and 119 transitions. cyclomatic complexity: 38 Second operand 21 states. [2019-11-28 20:35:08,136 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 20:35:08,136 INFO L93 Difference]: Finished difference Result 156 states and 192 transitions. [2019-11-28 20:35:08,137 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-11-28 20:35:08,137 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 156 states and 192 transitions. [2019-11-28 20:35:08,139 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2019-11-28 20:35:08,140 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 156 states to 99 states and 128 transitions. [2019-11-28 20:35:08,140 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 20 [2019-11-28 20:35:08,141 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 20 [2019-11-28 20:35:08,141 INFO L73 IsDeterministic]: Start isDeterministic. Operand 99 states and 128 transitions. [2019-11-28 20:35:08,141 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-11-28 20:35:08,141 INFO L688 BuchiCegarLoop]: Abstraction has 99 states and 128 transitions. [2019-11-28 20:35:08,141 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 99 states and 128 transitions. [2019-11-28 20:35:08,144 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 99 to 48. [2019-11-28 20:35:08,144 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 48 states. [2019-11-28 20:35:08,145 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 64 transitions. [2019-11-28 20:35:08,145 INFO L711 BuchiCegarLoop]: Abstraction has 48 states and 64 transitions. [2019-11-28 20:35:08,145 INFO L591 BuchiCegarLoop]: Abstraction has 48 states and 64 transitions. [2019-11-28 20:35:08,145 INFO L424 BuchiCegarLoop]: ======== Iteration 10============ [2019-11-28 20:35:08,145 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 48 states and 64 transitions. [2019-11-28 20:35:08,146 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2019-11-28 20:35:08,146 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-28 20:35:08,146 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-28 20:35:08,147 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [5, 4, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 20:35:08,147 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2019-11-28 20:35:08,147 INFO L794 eck$LassoCheckResult]: Stem: 2545#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; 2539#L-1 havoc main_#res;havoc main_#t~nondet8, main_#t~malloc9.base, main_#t~malloc9.offset, main_~array_size~0, main_~numbers~0.base, main_~numbers~0.offset;main_~array_size~0 := main_#t~nondet8;havoc main_#t~nondet8; 2540#L566 assume !(main_~array_size~0 < 1); 2541#L566-2 call main_#t~malloc9.base, main_#t~malloc9.offset := #Ultimate.allocOnStack(4 * main_~array_size~0);main_~numbers~0.base, main_~numbers~0.offset := main_#t~malloc9.base, main_#t~malloc9.offset;SelectionSort_#in~a.base, SelectionSort_#in~a.offset, SelectionSort_#in~array_size := main_~numbers~0.base, main_~numbers~0.offset, main_~array_size~0;havoc SelectionSort_#t~mem4, SelectionSort_#t~mem5, SelectionSort_#t~pre3, SelectionSort_#t~mem6, SelectionSort_#t~mem7, SelectionSort_#t~pre2, SelectionSort_~j~0, SelectionSort_~min~0, SelectionSort_~temp~0, SelectionSort_~a.base, SelectionSort_~a.offset, SelectionSort_~array_size, SelectionSort_~i~0;SelectionSort_~a.base, SelectionSort_~a.offset := SelectionSort_#in~a.base, SelectionSort_#in~a.offset;SelectionSort_~array_size := SelectionSort_#in~array_size;havoc SelectionSort_~i~0;SelectionSort_~i~0 := 0; 2542#L550-3 assume !!(SelectionSort_~i~0 < SelectionSort_~array_size - 1);havoc SelectionSort_~j~0;havoc SelectionSort_~min~0;havoc SelectionSort_~temp~0;SelectionSort_~min~0 := SelectionSort_~i~0;SelectionSort_~j~0 := 1 + SelectionSort_~i~0; 2546#L554-3 assume !!(SelectionSort_~j~0 < SelectionSort_~array_size);call SelectionSort_#t~mem4 := read~int(SelectionSort_~a.base, SelectionSort_~a.offset + 4 * SelectionSort_~j~0, 4);call SelectionSort_#t~mem5 := read~int(SelectionSort_~a.base, SelectionSort_~a.offset + 4 * SelectionSort_~min~0, 4); 2585#L556 assume SelectionSort_#t~mem4 < SelectionSort_#t~mem5;havoc SelectionSort_#t~mem4;havoc SelectionSort_#t~mem5;SelectionSort_~min~0 := SelectionSort_~j~0; 2583#L554-2 SelectionSort_#t~pre3 := 1 + SelectionSort_~j~0;SelectionSort_~j~0 := 1 + SelectionSort_~j~0;havoc SelectionSort_#t~pre3; 2580#L554-3 assume !!(SelectionSort_~j~0 < SelectionSort_~array_size);call SelectionSort_#t~mem4 := read~int(SelectionSort_~a.base, SelectionSort_~a.offset + 4 * SelectionSort_~j~0, 4);call SelectionSort_#t~mem5 := read~int(SelectionSort_~a.base, SelectionSort_~a.offset + 4 * SelectionSort_~min~0, 4); 2579#L556 assume !(SelectionSort_#t~mem4 < SelectionSort_#t~mem5);havoc SelectionSort_#t~mem4;havoc SelectionSort_#t~mem5; 2578#L554-2 SelectionSort_#t~pre3 := 1 + SelectionSort_~j~0;SelectionSort_~j~0 := 1 + SelectionSort_~j~0;havoc SelectionSort_#t~pre3; 2571#L554-3 assume !!(SelectionSort_~j~0 < SelectionSort_~array_size);call SelectionSort_#t~mem4 := read~int(SelectionSort_~a.base, SelectionSort_~a.offset + 4 * SelectionSort_~j~0, 4);call SelectionSort_#t~mem5 := read~int(SelectionSort_~a.base, SelectionSort_~a.offset + 4 * SelectionSort_~min~0, 4); 2569#L556 assume !(SelectionSort_#t~mem4 < SelectionSort_#t~mem5);havoc SelectionSort_#t~mem4;havoc SelectionSort_#t~mem5; 2567#L554-2 SelectionSort_#t~pre3 := 1 + SelectionSort_~j~0;SelectionSort_~j~0 := 1 + SelectionSort_~j~0;havoc SelectionSort_#t~pre3; 2565#L554-3 assume !!(SelectionSort_~j~0 < SelectionSort_~array_size);call SelectionSort_#t~mem4 := read~int(SelectionSort_~a.base, SelectionSort_~a.offset + 4 * SelectionSort_~j~0, 4);call SelectionSort_#t~mem5 := read~int(SelectionSort_~a.base, SelectionSort_~a.offset + 4 * SelectionSort_~min~0, 4); 2558#L556 assume !(SelectionSort_#t~mem4 < SelectionSort_#t~mem5);havoc SelectionSort_#t~mem4;havoc SelectionSort_#t~mem5; 2563#L554-2 SelectionSort_#t~pre3 := 1 + SelectionSort_~j~0;SelectionSort_~j~0 := 1 + SelectionSort_~j~0;havoc SelectionSort_#t~pre3; 2557#L554-3 assume !(SelectionSort_~j~0 < SelectionSort_~array_size); 2556#L554-4 call SelectionSort_#t~mem6 := read~int(SelectionSort_~a.base, SelectionSort_~a.offset + 4 * SelectionSort_~i~0, 4);SelectionSort_~temp~0 := SelectionSort_#t~mem6;havoc SelectionSort_#t~mem6;call SelectionSort_#t~mem7 := read~int(SelectionSort_~a.base, SelectionSort_~a.offset + 4 * SelectionSort_~min~0, 4);call write~int(SelectionSort_#t~mem7, SelectionSort_~a.base, SelectionSort_~a.offset + 4 * SelectionSort_~i~0, 4);havoc SelectionSort_#t~mem7;call write~int(SelectionSort_~temp~0, SelectionSort_~a.base, SelectionSort_~a.offset + 4 * SelectionSort_~min~0, 4); 2543#L550-2 SelectionSort_#t~pre2 := 1 + SelectionSort_~i~0;SelectionSort_~i~0 := 1 + SelectionSort_~i~0;havoc SelectionSort_#t~pre2; 2544#L550-3 assume !!(SelectionSort_~i~0 < SelectionSort_~array_size - 1);havoc SelectionSort_~j~0;havoc SelectionSort_~min~0;havoc SelectionSort_~temp~0;SelectionSort_~min~0 := SelectionSort_~i~0;SelectionSort_~j~0 := 1 + SelectionSort_~i~0; 2547#L554-3 assume !!(SelectionSort_~j~0 < SelectionSort_~array_size);call SelectionSort_#t~mem4 := read~int(SelectionSort_~a.base, SelectionSort_~a.offset + 4 * SelectionSort_~j~0, 4);call SelectionSort_#t~mem5 := read~int(SelectionSort_~a.base, SelectionSort_~a.offset + 4 * SelectionSort_~min~0, 4); 2552#L556 [2019-11-28 20:35:08,147 INFO L796 eck$LassoCheckResult]: Loop: 2552#L556 assume !(SelectionSort_#t~mem4 < SelectionSort_#t~mem5);havoc SelectionSort_#t~mem4;havoc SelectionSort_#t~mem5; 2548#L554-2 SelectionSort_#t~pre3 := 1 + SelectionSort_~j~0;SelectionSort_~j~0 := 1 + SelectionSort_~j~0;havoc SelectionSort_#t~pre3; 2549#L554-3 assume !!(SelectionSort_~j~0 < SelectionSort_~array_size);call SelectionSort_#t~mem4 := read~int(SelectionSort_~a.base, SelectionSort_~a.offset + 4 * SelectionSort_~j~0, 4);call SelectionSort_#t~mem5 := read~int(SelectionSort_~a.base, SelectionSort_~a.offset + 4 * SelectionSort_~min~0, 4); 2552#L556 [2019-11-28 20:35:08,147 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 20:35:08,147 INFO L82 PathProgramCache]: Analyzing trace with hash 85276535, now seen corresponding path program 7 times [2019-11-28 20:35:08,148 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 20:35:08,148 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1657512883] [2019-11-28 20:35:08,148 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 20:35:08,159 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 20:35:08,168 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 20:35:08,172 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-28 20:35:08,172 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 20:35:08,172 INFO L82 PathProgramCache]: Analyzing trace with hash 59638, now seen corresponding path program 3 times [2019-11-28 20:35:08,172 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 20:35:08,173 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1982059750] [2019-11-28 20:35:08,173 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 20:35:08,175 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 20:35:08,177 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 20:35:08,178 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-28 20:35:08,178 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 20:35:08,178 INFO L82 PathProgramCache]: Analyzing trace with hash -2147355200, now seen corresponding path program 8 times [2019-11-28 20:35:08,178 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 20:35:08,179 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1398205660] [2019-11-28 20:35:08,179 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 20:35:08,192 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 20:35:08,205 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 20:35:08,209 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-28 20:35:08,933 WARN L192 SmtUtils]: Spent 677.00 ms on a formula simplification. DAG size of input: 200 DAG size of output: 147 [2019-11-28 20:35:09,060 WARN L192 SmtUtils]: Spent 121.00 ms on a formula simplification that was a NOOP. DAG size: 94 [2019-11-28 20:35:09,063 INFO L210 LassoAnalysis]: Preferences: [2019-11-28 20:35:09,063 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2019-11-28 20:35:09,063 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-11-28 20:35:09,063 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2019-11-28 20:35:09,063 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2019-11-28 20:35:09,064 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 20:35:09,064 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2019-11-28 20:35:09,064 INFO L132 ssoRankerPreferences]: Path of dumped script: [2019-11-28 20:35:09,064 INFO L133 ssoRankerPreferences]: Filename of dumped script: selectionsort-alloca-2.i_Iteration10_Lasso [2019-11-28 20:35:09,064 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2019-11-28 20:35:09,064 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2019-11-28 20:35:09,067 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 20:35:09,088 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 20:35:09,096 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 20:35:09,098 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 20:35:09,100 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 20:35:09,102 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 20:35:09,103 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 20:35:09,105 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 20:35:09,106 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 20:35:09,109 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 20:35:09,111 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 20:35:09,369 WARN L192 SmtUtils]: Spent 128.00 ms on a formula simplification. DAG size of input: 68 DAG size of output: 62 [2019-11-28 20:35:09,442 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 20:35:09,449 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 20:35:09,453 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 20:35:09,819 INFO L292 LassoAnalysis]: Preprocessing complete. [2019-11-28 20:35:09,819 INFO L489 LassoAnalysis]: Using template 'affine'. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 43 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 43 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 20:35:09,826 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-28 20:35:09,827 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 20:35:09,827 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-28 20:35:09,827 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 20:35:09,827 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 20:35:09,827 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 20:35:09,828 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-28 20:35:09,828 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-28 20:35:09,829 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 44 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 44 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 20:35:09,835 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-28 20:35:09,836 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 20:35:09,836 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 20:35:09,836 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 20:35:09,836 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 20:35:09,838 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-28 20:35:09,838 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-28 20:35:09,842 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 45 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 45 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 20:35:09,847 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-28 20:35:09,849 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 20:35:09,849 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-28 20:35:09,849 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 20:35:09,849 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 20:35:09,849 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 20:35:09,849 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-28 20:35:09,849 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-28 20:35:09,850 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 46 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 46 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 20:35:09,856 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-28 20:35:09,857 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 20:35:09,857 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-28 20:35:09,858 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 20:35:09,858 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 20:35:09,858 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 20:35:09,858 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-28 20:35:09,858 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-28 20:35:09,859 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 47 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 47 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 20:35:09,865 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-28 20:35:09,867 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 20:35:09,867 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 20:35:09,867 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 20:35:09,867 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 20:35:09,868 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-28 20:35:09,868 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-28 20:35:09,870 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 48 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 48 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 20:35:09,875 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-28 20:35:09,876 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 20:35:09,876 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-28 20:35:09,876 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 20:35:09,876 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 20:35:09,876 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 20:35:09,877 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-28 20:35:09,877 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-28 20:35:09,878 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 49 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 49 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 20:35:09,884 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-28 20:35:09,885 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 20:35:09,885 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 20:35:09,886 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 20:35:09,886 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 20:35:09,887 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-28 20:35:09,887 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-28 20:35:09,891 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 50 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 50 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 20:35:09,896 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-28 20:35:09,898 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 20:35:09,898 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-28 20:35:09,898 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 20:35:09,898 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 20:35:09,898 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 20:35:09,899 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-28 20:35:09,899 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-28 20:35:09,901 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 51 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 51 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 20:35:09,907 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-28 20:35:09,908 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 20:35:09,908 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 20:35:09,908 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 20:35:09,908 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 20:35:09,909 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-28 20:35:09,909 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-28 20:35:09,912 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 52 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 52 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 20:35:09,918 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-28 20:35:09,919 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 20:35:09,919 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-28 20:35:09,920 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 20:35:09,920 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 20:35:09,920 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 20:35:09,920 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-28 20:35:09,920 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-28 20:35:09,921 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 53 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 53 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 20:35:09,927 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-28 20:35:09,928 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 20:35:09,928 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-28 20:35:09,928 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 20:35:09,928 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 20:35:09,928 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 20:35:09,929 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-28 20:35:09,929 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-28 20:35:09,930 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 54 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 54 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 20:35:09,935 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-28 20:35:09,937 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 20:35:09,937 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 20:35:09,938 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 20:35:09,938 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 20:35:09,943 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-28 20:35:09,943 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-28 20:35:09,958 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 55 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-11-28 20:35:09,965 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-28 20:35:09,966 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 20:35:09,966 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-28 20:35:09,966 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 20:35:09,967 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 20:35:09,967 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 20:35:09,967 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-28 20:35:09,967 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. Waiting until toolchain timeout for monitored process 55 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 20:35:09,969 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 56 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-11-28 20:35:09,975 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-28 20:35:09,977 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 20:35:09,977 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 20:35:09,977 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 20:35:09,978 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 20:35:09,980 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-28 20:35:09,980 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. Waiting until toolchain timeout for monitored process 56 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 20:35:09,986 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 57 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-11-28 20:35:09,992 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-28 20:35:09,994 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 20:35:09,994 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-28 20:35:09,994 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 20:35:09,995 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 20:35:09,995 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 20:35:09,995 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-28 20:35:09,995 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. Waiting until toolchain timeout for monitored process 57 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 20:35:09,997 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 58 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-11-28 20:35:10,003 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-28 20:35:10,005 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 20:35:10,006 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 20:35:10,006 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 20:35:10,006 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 20:35:10,009 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-28 20:35:10,009 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. Waiting until toolchain timeout for monitored process 58 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 20:35:10,016 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 59 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 59 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 20:35:10,021 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-28 20:35:10,023 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 20:35:10,023 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 20:35:10,023 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 20:35:10,023 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 20:35:10,028 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-28 20:35:10,028 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-28 20:35:10,044 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-11-28 20:35:10,104 INFO L443 ModelExtractionUtils]: Simplification made 28 calls to the SMT solver. [2019-11-28 20:35:10,104 INFO L444 ModelExtractionUtils]: 6 out of 31 variables were initially zero. Simplification set additionally 21 variables to zero. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 60 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-11-28 20:35:10,109 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... Waiting until toolchain timeout for monitored process 60 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 20:35:10,112 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2019-11-28 20:35:10,112 INFO L510 LassoAnalysis]: Proved termination. [2019-11-28 20:35:10,112 INFO L512 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_SelectionSort_~j~0, ULTIMATE.start_SelectionSort_~i~0, v_rep(select #length ULTIMATE.start_SelectionSort_~a.base)_6) = -4*ULTIMATE.start_SelectionSort_~j~0 + 4*ULTIMATE.start_SelectionSort_~i~0 + 1*v_rep(select #length ULTIMATE.start_SelectionSort_~a.base)_6 Supporting invariants [] [2019-11-28 20:35:10,175 INFO L297 tatePredicateManager]: 17 out of 18 supporting invariants were superfluous and have been removed [2019-11-28 20:35:10,178 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2019-11-28 20:35:10,200 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 20:35:10,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:35:10,241 INFO L264 TraceCheckSpWp]: Trace formula consists of 128 conjuncts, 4 conjunts are in the unsatisfiable core [2019-11-28 20:35:10,243 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 20:35:10,262 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:35:10,263 INFO L264 TraceCheckSpWp]: Trace formula consists of 18 conjuncts, 7 conjunts are in the unsatisfiable core [2019-11-28 20:35:10,263 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 20:35:10,279 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 20:35:10,280 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.2 stem predicates 2 loop predicates [2019-11-28 20:35:10,280 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 48 states and 64 transitions. cyclomatic complexity: 19 Second operand 5 states. [2019-11-28 20:35:10,333 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 48 states and 64 transitions. cyclomatic complexity: 19. Second operand 5 states. Result 89 states and 112 transitions. Complement of second has 8 states. [2019-11-28 20:35:10,334 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 5 states 2 stem states 2 non-accepting loop states 1 accepting loop states [2019-11-28 20:35:10,334 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2019-11-28 20:35:10,334 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 12 transitions. [2019-11-28 20:35:10,334 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 12 transitions. Stem has 22 letters. Loop has 3 letters. [2019-11-28 20:35:10,334 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-28 20:35:10,334 INFO L639 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2019-11-28 20:35:10,359 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 20:35:10,381 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:35:10,381 INFO L264 TraceCheckSpWp]: Trace formula consists of 128 conjuncts, 4 conjunts are in the unsatisfiable core [2019-11-28 20:35:10,382 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 20:35:10,391 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:35:10,392 INFO L264 TraceCheckSpWp]: Trace formula consists of 18 conjuncts, 7 conjunts are in the unsatisfiable core [2019-11-28 20:35:10,392 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 20:35:10,406 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 20:35:10,407 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and with honda bouncer for loop.2 stem predicates 2 loop predicates [2019-11-28 20:35:10,407 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 48 states and 64 transitions. cyclomatic complexity: 19 Second operand 5 states. [2019-11-28 20:35:10,456 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 48 states and 64 transitions. cyclomatic complexity: 19. Second operand 5 states. Result 89 states and 112 transitions. Complement of second has 8 states. [2019-11-28 20:35:10,460 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 5 states 2 stem states 2 non-accepting loop states 1 accepting loop states [2019-11-28 20:35:10,460 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2019-11-28 20:35:10,460 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 12 transitions. [2019-11-28 20:35:10,460 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 12 transitions. Stem has 22 letters. Loop has 3 letters. [2019-11-28 20:35:10,460 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-28 20:35:10,460 INFO L639 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2019-11-28 20:35:10,483 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 20:35:10,522 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:35:10,523 INFO L264 TraceCheckSpWp]: Trace formula consists of 128 conjuncts, 4 conjunts are in the unsatisfiable core [2019-11-28 20:35:10,524 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 20:35:10,535 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:35:10,535 INFO L264 TraceCheckSpWp]: Trace formula consists of 18 conjuncts, 7 conjunts are in the unsatisfiable core [2019-11-28 20:35:10,536 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 20:35:10,550 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 20:35:10,551 INFO L152 lantAutomatonBouncer]: Defining Buchi interpolant automaton with scrooge nondeterminism in stemwith honda bouncer for stem and without honda bouncer for loop.2 stem predicates 2 loop predicates [2019-11-28 20:35:10,551 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 48 states and 64 transitions. cyclomatic complexity: 19 Second operand 5 states. [2019-11-28 20:35:10,619 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 48 states and 64 transitions. cyclomatic complexity: 19. Second operand 5 states. Result 93 states and 116 transitions. Complement of second has 8 states. [2019-11-28 20:35:10,624 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 6 states 2 stem states 2 non-accepting loop states 2 accepting loop states [2019-11-28 20:35:10,624 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2019-11-28 20:35:10,624 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 27 transitions. [2019-11-28 20:35:10,624 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 27 transitions. Stem has 22 letters. Loop has 3 letters. [2019-11-28 20:35:10,625 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-28 20:35:10,625 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 27 transitions. Stem has 25 letters. Loop has 3 letters. [2019-11-28 20:35:10,625 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-28 20:35:10,625 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 27 transitions. Stem has 22 letters. Loop has 6 letters. [2019-11-28 20:35:10,625 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-28 20:35:10,626 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 93 states and 116 transitions. [2019-11-28 20:35:10,626 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2019-11-28 20:35:10,627 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 93 states to 71 states and 91 transitions. [2019-11-28 20:35:10,627 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 8 [2019-11-28 20:35:10,628 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 9 [2019-11-28 20:35:10,628 INFO L73 IsDeterministic]: Start isDeterministic. Operand 71 states and 91 transitions. [2019-11-28 20:35:10,628 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-11-28 20:35:10,628 INFO L688 BuchiCegarLoop]: Abstraction has 71 states and 91 transitions. [2019-11-28 20:35:10,628 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 71 states and 91 transitions. [2019-11-28 20:35:10,631 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 71 to 57. [2019-11-28 20:35:10,631 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 57 states. [2019-11-28 20:35:10,632 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 73 transitions. [2019-11-28 20:35:10,632 INFO L711 BuchiCegarLoop]: Abstraction has 57 states and 73 transitions. [2019-11-28 20:35:10,632 INFO L591 BuchiCegarLoop]: Abstraction has 57 states and 73 transitions. [2019-11-28 20:35:10,632 INFO L424 BuchiCegarLoop]: ======== Iteration 11============ [2019-11-28 20:35:10,632 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 57 states and 73 transitions. [2019-11-28 20:35:10,633 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2019-11-28 20:35:10,633 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-28 20:35:10,633 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-28 20:35:10,634 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [6, 5, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 20:35:10,634 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2019-11-28 20:35:10,634 INFO L794 eck$LassoCheckResult]: Stem: 3222#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; 3216#L-1 havoc main_#res;havoc main_#t~nondet8, main_#t~malloc9.base, main_#t~malloc9.offset, main_~array_size~0, main_~numbers~0.base, main_~numbers~0.offset;main_~array_size~0 := main_#t~nondet8;havoc main_#t~nondet8; 3217#L566 assume !(main_~array_size~0 < 1); 3218#L566-2 call main_#t~malloc9.base, main_#t~malloc9.offset := #Ultimate.allocOnStack(4 * main_~array_size~0);main_~numbers~0.base, main_~numbers~0.offset := main_#t~malloc9.base, main_#t~malloc9.offset;SelectionSort_#in~a.base, SelectionSort_#in~a.offset, SelectionSort_#in~array_size := main_~numbers~0.base, main_~numbers~0.offset, main_~array_size~0;havoc SelectionSort_#t~mem4, SelectionSort_#t~mem5, SelectionSort_#t~pre3, SelectionSort_#t~mem6, SelectionSort_#t~mem7, SelectionSort_#t~pre2, SelectionSort_~j~0, SelectionSort_~min~0, SelectionSort_~temp~0, SelectionSort_~a.base, SelectionSort_~a.offset, SelectionSort_~array_size, SelectionSort_~i~0;SelectionSort_~a.base, SelectionSort_~a.offset := SelectionSort_#in~a.base, SelectionSort_#in~a.offset;SelectionSort_~array_size := SelectionSort_#in~array_size;havoc SelectionSort_~i~0;SelectionSort_~i~0 := 0; 3219#L550-3 assume !!(SelectionSort_~i~0 < SelectionSort_~array_size - 1);havoc SelectionSort_~j~0;havoc SelectionSort_~min~0;havoc SelectionSort_~temp~0;SelectionSort_~min~0 := SelectionSort_~i~0;SelectionSort_~j~0 := 1 + SelectionSort_~i~0; 3223#L554-3 assume !!(SelectionSort_~j~0 < SelectionSort_~array_size);call SelectionSort_#t~mem4 := read~int(SelectionSort_~a.base, SelectionSort_~a.offset + 4 * SelectionSort_~j~0, 4);call SelectionSort_#t~mem5 := read~int(SelectionSort_~a.base, SelectionSort_~a.offset + 4 * SelectionSort_~min~0, 4); 3265#L556 assume SelectionSort_#t~mem4 < SelectionSort_#t~mem5;havoc SelectionSort_#t~mem4;havoc SelectionSort_#t~mem5;SelectionSort_~min~0 := SelectionSort_~j~0; 3264#L554-2 SelectionSort_#t~pre3 := 1 + SelectionSort_~j~0;SelectionSort_~j~0 := 1 + SelectionSort_~j~0;havoc SelectionSort_#t~pre3; 3263#L554-3 assume !!(SelectionSort_~j~0 < SelectionSort_~array_size);call SelectionSort_#t~mem4 := read~int(SelectionSort_~a.base, SelectionSort_~a.offset + 4 * SelectionSort_~j~0, 4);call SelectionSort_#t~mem5 := read~int(SelectionSort_~a.base, SelectionSort_~a.offset + 4 * SelectionSort_~min~0, 4); 3260#L556 assume !(SelectionSort_#t~mem4 < SelectionSort_#t~mem5);havoc SelectionSort_#t~mem4;havoc SelectionSort_#t~mem5; 3258#L554-2 SelectionSort_#t~pre3 := 1 + SelectionSort_~j~0;SelectionSort_~j~0 := 1 + SelectionSort_~j~0;havoc SelectionSort_#t~pre3; 3255#L554-3 assume !!(SelectionSort_~j~0 < SelectionSort_~array_size);call SelectionSort_#t~mem4 := read~int(SelectionSort_~a.base, SelectionSort_~a.offset + 4 * SelectionSort_~j~0, 4);call SelectionSort_#t~mem5 := read~int(SelectionSort_~a.base, SelectionSort_~a.offset + 4 * SelectionSort_~min~0, 4); 3254#L556 assume !(SelectionSort_#t~mem4 < SelectionSort_#t~mem5);havoc SelectionSort_#t~mem4;havoc SelectionSort_#t~mem5; 3253#L554-2 SelectionSort_#t~pre3 := 1 + SelectionSort_~j~0;SelectionSort_~j~0 := 1 + SelectionSort_~j~0;havoc SelectionSort_#t~pre3; 3249#L554-3 assume !!(SelectionSort_~j~0 < SelectionSort_~array_size);call SelectionSort_#t~mem4 := read~int(SelectionSort_~a.base, SelectionSort_~a.offset + 4 * SelectionSort_~j~0, 4);call SelectionSort_#t~mem5 := read~int(SelectionSort_~a.base, SelectionSort_~a.offset + 4 * SelectionSort_~min~0, 4); 3247#L556 assume !(SelectionSort_#t~mem4 < SelectionSort_#t~mem5);havoc SelectionSort_#t~mem4;havoc SelectionSort_#t~mem5; 3239#L554-2 SelectionSort_#t~pre3 := 1 + SelectionSort_~j~0;SelectionSort_~j~0 := 1 + SelectionSort_~j~0;havoc SelectionSort_#t~pre3; 3240#L554-3 assume !(SelectionSort_~j~0 < SelectionSort_~array_size); 3233#L554-4 call SelectionSort_#t~mem6 := read~int(SelectionSort_~a.base, SelectionSort_~a.offset + 4 * SelectionSort_~i~0, 4);SelectionSort_~temp~0 := SelectionSort_#t~mem6;havoc SelectionSort_#t~mem6;call SelectionSort_#t~mem7 := read~int(SelectionSort_~a.base, SelectionSort_~a.offset + 4 * SelectionSort_~min~0, 4);call write~int(SelectionSort_#t~mem7, SelectionSort_~a.base, SelectionSort_~a.offset + 4 * SelectionSort_~i~0, 4);havoc SelectionSort_#t~mem7;call write~int(SelectionSort_~temp~0, SelectionSort_~a.base, SelectionSort_~a.offset + 4 * SelectionSort_~min~0, 4); 3220#L550-2 SelectionSort_#t~pre2 := 1 + SelectionSort_~i~0;SelectionSort_~i~0 := 1 + SelectionSort_~i~0;havoc SelectionSort_#t~pre2; 3221#L550-3 assume !!(SelectionSort_~i~0 < SelectionSort_~array_size - 1);havoc SelectionSort_~j~0;havoc SelectionSort_~min~0;havoc SelectionSort_~temp~0;SelectionSort_~min~0 := SelectionSort_~i~0;SelectionSort_~j~0 := 1 + SelectionSort_~i~0; 3224#L554-3 assume !!(SelectionSort_~j~0 < SelectionSort_~array_size);call SelectionSort_#t~mem4 := read~int(SelectionSort_~a.base, SelectionSort_~a.offset + 4 * SelectionSort_~j~0, 4);call SelectionSort_#t~mem5 := read~int(SelectionSort_~a.base, SelectionSort_~a.offset + 4 * SelectionSort_~min~0, 4); 3229#L556 assume SelectionSort_#t~mem4 < SelectionSort_#t~mem5;havoc SelectionSort_#t~mem4;havoc SelectionSort_#t~mem5;SelectionSort_~min~0 := SelectionSort_~j~0; 3235#L554-2 SelectionSort_#t~pre3 := 1 + SelectionSort_~j~0;SelectionSort_~j~0 := 1 + SelectionSort_~j~0;havoc SelectionSort_#t~pre3; 3234#L554-3 assume !!(SelectionSort_~j~0 < SelectionSort_~array_size);call SelectionSort_#t~mem4 := read~int(SelectionSort_~a.base, SelectionSort_~a.offset + 4 * SelectionSort_~j~0, 4);call SelectionSort_#t~mem5 := read~int(SelectionSort_~a.base, SelectionSort_~a.offset + 4 * SelectionSort_~min~0, 4); 3232#L556 [2019-11-28 20:35:10,634 INFO L796 eck$LassoCheckResult]: Loop: 3232#L556 assume !(SelectionSort_#t~mem4 < SelectionSort_#t~mem5);havoc SelectionSort_#t~mem4;havoc SelectionSort_#t~mem5; 3225#L554-2 SelectionSort_#t~pre3 := 1 + SelectionSort_~j~0;SelectionSort_~j~0 := 1 + SelectionSort_~j~0;havoc SelectionSort_#t~pre3; 3226#L554-3 assume !!(SelectionSort_~j~0 < SelectionSort_~array_size);call SelectionSort_#t~mem4 := read~int(SelectionSort_~a.base, SelectionSort_~a.offset + 4 * SelectionSort_~j~0, 4);call SelectionSort_#t~mem5 := read~int(SelectionSort_~a.base, SelectionSort_~a.offset + 4 * SelectionSort_~min~0, 4); 3232#L556 [2019-11-28 20:35:10,634 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 20:35:10,635 INFO L82 PathProgramCache]: Analyzing trace with hash -2147357122, now seen corresponding path program 9 times [2019-11-28 20:35:10,635 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 20:35:10,635 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [25893956] [2019-11-28 20:35:10,635 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 20:35:10,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 20:35:10,659 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 20:35:10,663 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-28 20:35:10,663 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 20:35:10,663 INFO L82 PathProgramCache]: Analyzing trace with hash 59638, now seen corresponding path program 4 times [2019-11-28 20:35:10,663 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 20:35:10,664 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [116626848] [2019-11-28 20:35:10,664 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 20:35:10,666 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 20:35:10,667 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 20:35:10,668 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-28 20:35:10,669 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 20:35:10,669 INFO L82 PathProgramCache]: Analyzing trace with hash 1621882265, now seen corresponding path program 10 times [2019-11-28 20:35:10,669 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 20:35:10,669 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1180582721] [2019-11-28 20:35:10,669 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 20:35:10,681 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 20:35:10,705 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 20:35:10,710 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-28 20:35:11,596 WARN L192 SmtUtils]: Spent 828.00 ms on a formula simplification. DAG size of input: 227 DAG size of output: 162 [2019-11-28 20:35:11,714 WARN L192 SmtUtils]: Spent 111.00 ms on a formula simplification that was a NOOP. DAG size: 94 [2019-11-28 20:35:11,716 INFO L210 LassoAnalysis]: Preferences: [2019-11-28 20:35:11,716 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2019-11-28 20:35:11,716 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-11-28 20:35:11,716 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2019-11-28 20:35:11,716 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2019-11-28 20:35:11,716 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 20:35:11,716 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2019-11-28 20:35:11,716 INFO L132 ssoRankerPreferences]: Path of dumped script: [2019-11-28 20:35:11,716 INFO L133 ssoRankerPreferences]: Filename of dumped script: selectionsort-alloca-2.i_Iteration11_Lasso [2019-11-28 20:35:11,716 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2019-11-28 20:35:11,717 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2019-11-28 20:35:11,719 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 20:35:11,727 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 20:35:11,729 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 20:35:12,172 WARN L192 SmtUtils]: Spent 185.00 ms on a formula simplification. DAG size of input: 92 DAG size of output: 73 [2019-11-28 20:35:12,337 WARN L192 SmtUtils]: Spent 114.00 ms on a formula simplification. DAG size of input: 74 DAG size of output: 63 [2019-11-28 20:35:12,337 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 20:35:12,339 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 20:35:12,342 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 20:35:12,349 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 20:35:12,350 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 20:35:12,351 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 20:35:12,352 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 20:35:12,354 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 20:35:12,355 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 20:35:12,357 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 20:35:12,477 WARN L192 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 47 DAG size of output: 44 [2019-11-28 20:35:12,847 INFO L292 LassoAnalysis]: Preprocessing complete. [2019-11-28 20:35:12,847 INFO L489 LassoAnalysis]: Using template 'affine'. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 61 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 61 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 20:35:12,852 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-28 20:35:12,853 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 20:35:12,854 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 20:35:12,854 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 20:35:12,854 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 20:35:12,855 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-28 20:35:12,855 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-28 20:35:12,857 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 62 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 62 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 20:35:12,862 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-28 20:35:12,863 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 20:35:12,863 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 20:35:12,863 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 20:35:12,863 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 20:35:12,864 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-28 20:35:12,865 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-28 20:35:12,868 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 63 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-11-28 20:35:12,874 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false Waiting until toolchain timeout for monitored process 63 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 20:35:12,876 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 20:35:12,876 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 20:35:12,876 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 20:35:12,876 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 20:35:12,883 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-28 20:35:12,883 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-28 20:35:12,904 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-11-28 20:35:12,943 INFO L443 ModelExtractionUtils]: Simplification made 18 calls to the SMT solver. [2019-11-28 20:35:12,943 INFO L444 ModelExtractionUtils]: 15 out of 40 variables were initially zero. Simplification set additionally 22 variables to zero. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 64 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 64 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 20:35:12,947 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-11-28 20:35:12,948 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2019-11-28 20:35:12,949 INFO L510 LassoAnalysis]: Proved termination. [2019-11-28 20:35:12,949 INFO L512 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_SelectionSort_~j~0, ULTIMATE.start_SelectionSort_~array_size) = -1*ULTIMATE.start_SelectionSort_~j~0 + 1*ULTIMATE.start_SelectionSort_~array_size Supporting invariants [] [2019-11-28 20:35:13,060 INFO L297 tatePredicateManager]: 32 out of 32 supporting invariants were superfluous and have been removed [2019-11-28 20:35:13,071 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 20:35:13,095 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:35:13,096 INFO L264 TraceCheckSpWp]: Trace formula consists of 144 conjuncts, 2 conjunts are in the unsatisfiable core [2019-11-28 20:35:13,098 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 20:35:13,116 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:35:13,116 INFO L264 TraceCheckSpWp]: Trace formula consists of 16 conjuncts, 4 conjunts are in the unsatisfiable core [2019-11-28 20:35:13,117 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 20:35:13,124 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 20:35:13,124 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2019-11-28 20:35:13,124 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 57 states and 73 transitions. cyclomatic complexity: 19 Second operand 4 states. [2019-11-28 20:35:13,146 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 57 states and 73 transitions. cyclomatic complexity: 19. Second operand 4 states. Result 131 states and 164 transitions. Complement of second has 7 states. [2019-11-28 20:35:13,151 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2019-11-28 20:35:13,151 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2019-11-28 20:35:13,151 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 14 transitions. [2019-11-28 20:35:13,151 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 14 transitions. Stem has 25 letters. Loop has 3 letters. [2019-11-28 20:35:13,152 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-28 20:35:13,152 INFO L639 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2019-11-28 20:35:13,162 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 20:35:13,183 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:35:13,184 INFO L264 TraceCheckSpWp]: Trace formula consists of 144 conjuncts, 2 conjunts are in the unsatisfiable core [2019-11-28 20:35:13,185 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 20:35:13,189 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:35:13,189 INFO L264 TraceCheckSpWp]: Trace formula consists of 16 conjuncts, 4 conjunts are in the unsatisfiable core [2019-11-28 20:35:13,189 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 20:35:13,197 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 20:35:13,197 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and with honda bouncer for loop.1 stem predicates 2 loop predicates [2019-11-28 20:35:13,197 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 57 states and 73 transitions. cyclomatic complexity: 19 Second operand 4 states. [2019-11-28 20:35:13,217 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 57 states and 73 transitions. cyclomatic complexity: 19. Second operand 4 states. Result 131 states and 164 transitions. Complement of second has 7 states. [2019-11-28 20:35:13,218 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2019-11-28 20:35:13,218 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2019-11-28 20:35:13,218 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 14 transitions. [2019-11-28 20:35:13,219 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 14 transitions. Stem has 25 letters. Loop has 3 letters. [2019-11-28 20:35:13,219 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-28 20:35:13,219 INFO L639 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2019-11-28 20:35:13,233 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 20:35:13,257 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:35:13,258 INFO L264 TraceCheckSpWp]: Trace formula consists of 144 conjuncts, 2 conjunts are in the unsatisfiable core [2019-11-28 20:35:13,259 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 20:35:13,265 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:35:13,265 INFO L264 TraceCheckSpWp]: Trace formula consists of 16 conjuncts, 4 conjunts are in the unsatisfiable core [2019-11-28 20:35:13,266 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 20:35:13,270 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 20:35:13,271 INFO L152 lantAutomatonBouncer]: Defining Buchi interpolant automaton with scrooge nondeterminism in stemwith honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2019-11-28 20:35:13,271 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 57 states and 73 transitions. cyclomatic complexity: 19 Second operand 4 states. [2019-11-28 20:35:13,289 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 57 states and 73 transitions. cyclomatic complexity: 19. Second operand 4 states. Result 95 states and 116 transitions. Complement of second has 6 states. [2019-11-28 20:35:13,291 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2019-11-28 20:35:13,291 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2019-11-28 20:35:13,291 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 21 transitions. [2019-11-28 20:35:13,291 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 21 transitions. Stem has 25 letters. Loop has 3 letters. [2019-11-28 20:35:13,292 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-28 20:35:13,292 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 21 transitions. Stem has 28 letters. Loop has 3 letters. [2019-11-28 20:35:13,292 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-28 20:35:13,292 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 21 transitions. Stem has 25 letters. Loop has 6 letters. [2019-11-28 20:35:13,292 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-28 20:35:13,293 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 95 states and 116 transitions. [2019-11-28 20:35:13,293 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2019-11-28 20:35:13,294 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 95 states to 0 states and 0 transitions. [2019-11-28 20:35:13,294 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2019-11-28 20:35:13,294 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2019-11-28 20:35:13,294 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2019-11-28 20:35:13,294 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-11-28 20:35:13,294 INFO L688 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-11-28 20:35:13,294 INFO L711 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-11-28 20:35:13,294 INFO L591 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-11-28 20:35:13,294 INFO L424 BuchiCegarLoop]: ======== Iteration 12============ [2019-11-28 20:35:13,294 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2019-11-28 20:35:13,294 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2019-11-28 20:35:13,295 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2019-11-28 20:35:13,301 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 28.11 08:35:13 BoogieIcfgContainer [2019-11-28 20:35:13,301 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2019-11-28 20:35:13,302 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-11-28 20:35:13,302 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-11-28 20:35:13,302 INFO L275 PluginConnector]: Witness Printer initialized [2019-11-28 20:35:13,302 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 08:34:53" (3/4) ... [2019-11-28 20:35:13,306 INFO L140 WitnessPrinter]: No result that supports witness generation found [2019-11-28 20:35:13,306 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-11-28 20:35:13,307 INFO L168 Benchmark]: Toolchain (without parser) took 20474.68 ms. Allocated memory was 1.0 GB in the beginning and 1.5 GB in the end (delta: 472.9 MB). Free memory was 961.7 MB in the beginning and 1.2 GB in the end (delta: -237.4 MB). Peak memory consumption was 235.5 MB. Max. memory is 11.5 GB. [2019-11-28 20:35:13,308 INFO L168 Benchmark]: CDTParser took 0.30 ms. Allocated memory is still 1.0 GB. Free memory is still 987.2 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-28 20:35:13,308 INFO L168 Benchmark]: CACSL2BoogieTranslator took 627.94 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 136.3 MB). Free memory was 956.3 MB in the beginning and 1.1 GB in the end (delta: -161.4 MB). Peak memory consumption was 15.1 MB. Max. memory is 11.5 GB. [2019-11-28 20:35:13,309 INFO L168 Benchmark]: Boogie Procedure Inliner took 52.25 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 6.6 MB). Peak memory consumption was 6.6 MB. Max. memory is 11.5 GB. [2019-11-28 20:35:13,309 INFO L168 Benchmark]: Boogie Preprocessor took 30.93 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-28 20:35:13,310 INFO L168 Benchmark]: RCFGBuilder took 411.97 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 18.6 MB). Peak memory consumption was 18.6 MB. Max. memory is 11.5 GB. [2019-11-28 20:35:13,310 INFO L168 Benchmark]: BuchiAutomizer took 19341.33 ms. Allocated memory was 1.2 GB in the beginning and 1.5 GB in the end (delta: 336.6 MB). Free memory was 1.1 GB in the beginning and 1.2 GB in the end (delta: -106.7 MB). Peak memory consumption was 229.9 MB. Max. memory is 11.5 GB. [2019-11-28 20:35:13,310 INFO L168 Benchmark]: Witness Printer took 4.38 ms. Allocated memory is still 1.5 GB. Free memory is still 1.2 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-28 20:35:13,313 INFO L335 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.30 ms. Allocated memory is still 1.0 GB. Free memory is still 987.2 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 627.94 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 136.3 MB). Free memory was 956.3 MB in the beginning and 1.1 GB in the end (delta: -161.4 MB). Peak memory consumption was 15.1 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 52.25 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 6.6 MB). Peak memory consumption was 6.6 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 30.93 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * RCFGBuilder took 411.97 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 18.6 MB). Peak memory consumption was 18.6 MB. Max. memory is 11.5 GB. * BuchiAutomizer took 19341.33 ms. Allocated memory was 1.2 GB in the beginning and 1.5 GB in the end (delta: 336.6 MB). Free memory was 1.1 GB in the beginning and 1.2 GB in the end (delta: -106.7 MB). Peak memory consumption was 229.9 MB. Max. memory is 11.5 GB. * Witness Printer took 4.38 ms. Allocated memory is still 1.5 GB. Free memory is still 1.2 GB. There was no memory consumed. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Constructed decomposition of program Your program was decomposed into 11 terminating modules (4 trivial, 2 deterministic, 5 nondeterministic). One deterministic module has affine ranking function array_size + -1 * i and consists of 3 locations. One deterministic module has affine ranking function -1 * j + array_size and consists of 4 locations. One nondeterministic module has affine ranking function -8 * j + 5 * unknown-#length-unknown[a] and consists of 12 locations. One nondeterministic module has affine ranking function -1 * a + -4 * min + unknown-#length-unknown[a] and consists of 5 locations. One nondeterministic module has affine ranking function -2 * j + 13 * min and consists of 22 locations. One nondeterministic module has affine ranking function -4 * j + 4 * i + unknown-#length-unknown[a] and consists of 6 locations. One nondeterministic module has affine ranking function -1 * j + array_size and consists of 4 locations. 4 modules have a trivial ranking function, the largest among these consists of 21 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 19.2s and 12 iterations. TraceHistogramMax:6. Analysis of lassos took 13.8s. Construction of modules took 0.7s. Büchi inclusion checks took 4.4s. Highest rank in rank-based complementation 3. Minimization of det autom 3. Minimization of nondet autom 8. Automata minimization 0.0s AutomataMinimizationTime, 10 MinimizatonAttempts, 246 StatesRemovedByMinimization, 8 NontrivialMinimizations. Non-live state removal took 0.0s Buchi closure took 0.0s. Biggest automaton had 85 states and ocurred in iteration 8. Nontrivial modules had stage [2, 0, 4, 1, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 1/1 HoareTripleCheckerStatistics: 219 SDtfs, 519 SDslu, 251 SDs, 0 SdLazy, 576 SolverSat, 181 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.7s Time LassoAnalysisResults: nont0 unkn0 SFLI2 SFLT0 conc1 concLT0 SILN0 SILU1 SILI0 SILT0 lasso7 LassoPreprocessingBenchmarks: Lassos: inital223 mio100 ax108 hnf99 lsp88 ukn73 mio100 lsp66 div100 bol100 ite100 ukn100 eq170 hnf83 smp94 dnf100 smp100 tf100 neg100 sie101 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 0 Time: 42ms VariablesStem: 2 VariablesLoop: 2 DisjunctsStem: 1 DisjunctsLoop: 1 SupportingInvariants: 2 MotzkinApplications: 6 LassoTerminationAnalysisBenchmarks: LassoNonterminationAnalysisSatFixpoint: 0 LassoNonterminationAnalysisSatUnbounded: 0 LassoNonterminationAnalysisUnsat: 0 LassoNonterminationAnalysisUnknown: 0 LassoNonterminationAnalysisTime: 0.0s - TerminationAnalysisResult: Termination proven Buchi Automizer proved that your program is terminating RESULT: Ultimate proved your program to be correct! Received shutdown request...