./Ultimate.py --spec ../../sv-benchmarks/c/properties/termination.prp --file ../../sv-benchmarks/c/array-memsafety/selectionsort-alloca-1.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for termination Using default analysis Version cad46833 Calling Ultimate with: /usr/lib/jvm/java-8-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/run_dir_58a2b8e5-f9df-4686-b88c-3e189e1481d6/bin/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/run_dir_58a2b8e5-f9df-4686-b88c-3e189e1481d6/bin/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/run_dir_58a2b8e5-f9df-4686-b88c-3e189e1481d6/bin/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/run_dir_58a2b8e5-f9df-4686-b88c-3e189e1481d6/bin/uautomizer/config/AutomizerTermination.xml -i ../../sv-benchmarks/c/array-memsafety/selectionsort-alloca-1.i -s /tmp/vcloud-vcloud-master/worker/run_dir_58a2b8e5-f9df-4686-b88c-3e189e1481d6/bin/uautomizer/config/svcomp-Termination-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/run_dir_58a2b8e5-f9df-4686-b88c-3e189e1481d6/bin/uautomizer --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 32bit --witnessprinter.graph.data.programhash 82679d367c32c359f0c9c81b27b57deea5682b2b ............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Using bit-precise analysis No suitable file found in config dir /tmp/vcloud-vcloud-master/worker/run_dir_58a2b8e5-f9df-4686-b88c-3e189e1481d6/bin/uautomizer/config using search string *Termination*32bit*_Bitvector*.epf No suitable settings file found using Termination*32bit*_Bitvector ERROR: UNSUPPORTED PROPERTY Writing output log to file Ultimate.log Result: ERROR: ExceptionOrErrorResult: AssertionError: MapEliminator tries to combine Int and (Array Int Int) --- Real Ultimate output --- This is Ultimate 0.1.24-cad4683 [2019-11-15 20:27:31,705 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-15 20:27:31,707 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-15 20:27:31,720 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-15 20:27:31,721 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-15 20:27:31,722 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-15 20:27:31,723 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-15 20:27:31,725 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-15 20:27:31,726 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-15 20:27:31,727 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-15 20:27:31,728 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-15 20:27:31,729 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-15 20:27:31,730 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-15 20:27:31,730 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-15 20:27:31,731 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-15 20:27:31,732 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-15 20:27:31,733 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-15 20:27:31,734 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-15 20:27:31,736 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-15 20:27:31,737 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-15 20:27:31,739 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-15 20:27:31,740 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-15 20:27:31,741 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-15 20:27:31,742 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-15 20:27:31,747 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-15 20:27:31,748 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-15 20:27:31,748 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-15 20:27:31,749 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-15 20:27:31,749 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-15 20:27:31,750 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-15 20:27:31,750 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-15 20:27:31,751 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-15 20:27:31,751 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-15 20:27:31,752 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-15 20:27:31,753 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-15 20:27:31,753 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-15 20:27:31,754 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-15 20:27:31,754 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-15 20:27:31,754 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-15 20:27:31,755 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-15 20:27:31,756 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-15 20:27:31,756 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/run_dir_58a2b8e5-f9df-4686-b88c-3e189e1481d6/bin/uautomizer/config/svcomp-Termination-32bit-Automizer_Default.epf [2019-11-15 20:27:31,784 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-15 20:27:31,784 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-15 20:27:31,785 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-11-15 20:27:31,785 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-11-15 20:27:31,786 INFO L138 SettingsManager]: * Use SBE=true [2019-11-15 20:27:31,786 INFO L136 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2019-11-15 20:27:31,786 INFO L138 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2019-11-15 20:27:31,786 INFO L138 SettingsManager]: * Use old map elimination=false [2019-11-15 20:27:31,787 INFO L138 SettingsManager]: * Use external solver (rank synthesis)=false [2019-11-15 20:27:31,787 INFO L138 SettingsManager]: * Use only trivial implications for array writes=true [2019-11-15 20:27:31,788 INFO L138 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2019-11-15 20:27:31,789 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-15 20:27:31,789 INFO L138 SettingsManager]: * sizeof long=4 [2019-11-15 20:27:31,789 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2019-11-15 20:27:31,789 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-11-15 20:27:31,789 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-11-15 20:27:31,790 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-15 20:27:31,790 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2019-11-15 20:27:31,790 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2019-11-15 20:27:31,790 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2019-11-15 20:27:31,791 INFO L138 SettingsManager]: * sizeof long double=12 [2019-11-15 20:27:31,791 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-11-15 20:27:31,791 INFO L138 SettingsManager]: * Assume nondeterminstic values are in range=false [2019-11-15 20:27:31,791 INFO L138 SettingsManager]: * Use constant arrays=true [2019-11-15 20:27:31,792 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2019-11-15 20:27:31,792 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-15 20:27:31,792 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-11-15 20:27:31,792 INFO L138 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2019-11-15 20:27:31,793 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-15 20:27:31,793 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-11-15 20:27:31,793 INFO L138 SettingsManager]: * Dump automata to the following directory=/home/matthias/ultimate/dump/auto [2019-11-15 20:27:31,794 INFO L136 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2019-11-15 20:27:31,794 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 -> /tmp/vcloud-vcloud-master/worker/run_dir_58a2b8e5-f9df-4686-b88c-3e189e1481d6/bin/uautomizer 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 -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 82679d367c32c359f0c9c81b27b57deea5682b2b [2019-11-15 20:27:31,834 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-15 20:27:31,852 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-15 20:27:31,856 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-15 20:27:31,858 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-15 20:27:31,858 INFO L275 PluginConnector]: CDTParser initialized [2019-11-15 20:27:31,859 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/run_dir_58a2b8e5-f9df-4686-b88c-3e189e1481d6/bin/uautomizer/../../sv-benchmarks/c/array-memsafety/selectionsort-alloca-1.i [2019-11-15 20:27:31,918 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_58a2b8e5-f9df-4686-b88c-3e189e1481d6/bin/uautomizer/data/1a78d84f0/19a076cef2da4c6fb0f1a71e6af4eb6f/FLAG5baf9f07c [2019-11-15 20:27:32,374 INFO L306 CDTParser]: Found 1 translation units. [2019-11-15 20:27:32,374 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/run_dir_58a2b8e5-f9df-4686-b88c-3e189e1481d6/sv-benchmarks/c/array-memsafety/selectionsort-alloca-1.i [2019-11-15 20:27:32,387 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_58a2b8e5-f9df-4686-b88c-3e189e1481d6/bin/uautomizer/data/1a78d84f0/19a076cef2da4c6fb0f1a71e6af4eb6f/FLAG5baf9f07c [2019-11-15 20:27:32,687 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/run_dir_58a2b8e5-f9df-4686-b88c-3e189e1481d6/bin/uautomizer/data/1a78d84f0/19a076cef2da4c6fb0f1a71e6af4eb6f [2019-11-15 20:27:32,689 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-15 20:27:32,690 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-11-15 20:27:32,691 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-15 20:27:32,691 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-15 20:27:32,694 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-15 20:27:32,695 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.11 08:27:32" (1/1) ... [2019-11-15 20:27:32,697 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@75eefb4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 08:27:32, skipping insertion in model container [2019-11-15 20:27:32,697 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.11 08:27:32" (1/1) ... [2019-11-15 20:27:32,704 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-11-15 20:27:32,749 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-11-15 20:27:33,107 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-15 20:27:33,120 INFO L188 MainTranslator]: Completed pre-run [2019-11-15 20:27:33,176 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-15 20:27:33,238 INFO L192 MainTranslator]: Completed translation [2019-11-15 20:27:33,238 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 08:27:33 WrapperNode [2019-11-15 20:27:33,238 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-15 20:27:33,239 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-11-15 20:27:33,240 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-11-15 20:27:33,240 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-11-15 20:27:33,248 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 08:27:33" (1/1) ... [2019-11-15 20:27:33,268 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 08:27:33" (1/1) ... [2019-11-15 20:27:33,287 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-11-15 20:27:33,288 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-11-15 20:27:33,288 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-11-15 20:27:33,288 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-11-15 20:27:33,296 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 08:27:33" (1/1) ... [2019-11-15 20:27:33,297 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 08:27:33" (1/1) ... [2019-11-15 20:27:33,300 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 08:27:33" (1/1) ... [2019-11-15 20:27:33,300 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 08:27:33" (1/1) ... [2019-11-15 20:27:33,305 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 08:27:33" (1/1) ... [2019-11-15 20:27:33,310 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 08:27:33" (1/1) ... [2019-11-15 20:27:33,312 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 08:27:33" (1/1) ... [2019-11-15 20:27:33,314 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-11-15 20:27:33,314 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-11-15 20:27:33,315 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-11-15 20:27:33,315 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-11-15 20:27:33,316 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 08:27:33" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_58a2b8e5-f9df-4686-b88c-3e189e1481d6/bin/uautomizer/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-15 20:27:33,382 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2019-11-15 20:27:33,382 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-11-15 20:27:33,383 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-11-15 20:27:33,383 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-11-15 20:27:33,383 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-11-15 20:27:33,383 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-11-15 20:27:33,646 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-11-15 20:27:33,646 INFO L284 CfgBuilder]: Removed 9 assume(true) statements. [2019-11-15 20:27:33,647 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.11 08:27:33 BoogieIcfgContainer [2019-11-15 20:27:33,648 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-11-15 20:27:33,648 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2019-11-15 20:27:33,648 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2019-11-15 20:27:33,651 INFO L275 PluginConnector]: BuchiAutomizer initialized [2019-11-15 20:27:33,652 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-11-15 20:27:33,652 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 15.11 08:27:32" (1/3) ... [2019-11-15 20:27:33,653 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@6f1df3b0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 15.11 08:27:33, skipping insertion in model container [2019-11-15 20:27:33,653 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-11-15 20:27:33,654 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 08:27:33" (2/3) ... [2019-11-15 20:27:33,654 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@6f1df3b0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 15.11 08:27:33, skipping insertion in model container [2019-11-15 20:27:33,654 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-11-15 20:27:33,654 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.11 08:27:33" (3/3) ... [2019-11-15 20:27:33,656 INFO L371 chiAutomizerObserver]: Analyzing ICFG selectionsort-alloca-1.i [2019-11-15 20:27:33,697 INFO L356 BuchiCegarLoop]: Interprodecural is true [2019-11-15 20:27:33,698 INFO L357 BuchiCegarLoop]: Hoare is false [2019-11-15 20:27:33,698 INFO L358 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2019-11-15 20:27:33,698 INFO L359 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2019-11-15 20:27:33,698 INFO L360 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-11-15 20:27:33,698 INFO L361 BuchiCegarLoop]: Difference is false [2019-11-15 20:27:33,698 INFO L362 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-11-15 20:27:33,699 INFO L365 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2019-11-15 20:27:33,711 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 17 states. [2019-11-15 20:27:33,731 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 8 [2019-11-15 20:27:33,732 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-15 20:27:33,732 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-15 20:27:33,738 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1] [2019-11-15 20:27:33,738 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2019-11-15 20:27:33,738 INFO L424 BuchiCegarLoop]: ======== Iteration 1============ [2019-11-15 20:27:33,739 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 17 states. [2019-11-15 20:27:33,740 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 8 [2019-11-15 20:27:33,740 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-15 20:27:33,741 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-15 20:27:33,741 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1] [2019-11-15 20:27:33,741 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2019-11-15 20:27:33,747 INFO L791 eck$LassoCheckResult]: Stem: 13#ULTIMATE.startENTRYtrue #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 10#L-1true havoc main_#res;havoc main_#t~nondet8, main_#t~malloc9.base, main_#t~malloc9.offset, main_#t~nondet11, main_#t~post10, main_~i~1, main_~array_size~0, main_~numbers~0.base, main_~numbers~0.offset;main_~array_size~0 := main_#t~nondet8;havoc main_#t~nondet8; 14#L531true assume !(main_~array_size~0 < 1 || main_~array_size~0 >= 536870911); 17#L531-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;main_~i~1 := 0; 9#L536-3true [2019-11-15 20:27:33,747 INFO L793 eck$LassoCheckResult]: Loop: 9#L536-3true assume !!(main_~i~1 < main_~array_size~0);call write~int(main_#t~nondet11, main_~numbers~0.base, main_~numbers~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet11; 6#L536-2true main_#t~post10 := main_~i~1;main_~i~1 := 1 + main_#t~post10;havoc main_#t~post10; 9#L536-3true [2019-11-15 20:27:33,751 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 20:27:33,751 INFO L82 PathProgramCache]: Analyzing trace with hash 925669, now seen corresponding path program 1 times [2019-11-15 20:27:33,756 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 20:27:33,757 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [234648168] [2019-11-15 20:27:33,757 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:27:33,757 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:27:33,757 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 20:27:33,833 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 20:27:33,844 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 20:27:33,864 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-15 20:27:33,865 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 20:27:33,866 INFO L82 PathProgramCache]: Analyzing trace with hash 1507, now seen corresponding path program 1 times [2019-11-15 20:27:33,866 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 20:27:33,866 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [425919334] [2019-11-15 20:27:33,866 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:27:33,866 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:27:33,866 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 20:27:33,888 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 20:27:33,900 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 20:27:33,902 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-15 20:27:33,903 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 20:27:33,904 INFO L82 PathProgramCache]: Analyzing trace with hash 889568455, now seen corresponding path program 1 times [2019-11-15 20:27:33,904 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 20:27:33,904 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [332654925] [2019-11-15 20:27:33,904 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:27:33,904 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:27:33,905 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 20:27:33,934 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 20:27:33,970 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 20:27:33,974 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-15 20:27:34,153 INFO L210 LassoAnalysis]: Preferences: [2019-11-15 20:27:34,154 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-11-15 20:27:34,154 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-11-15 20:27:34,154 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-11-15 20:27:34,155 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2019-11-15 20:27:34,155 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-15 20:27:34,155 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-11-15 20:27:34,155 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-11-15 20:27:34,155 INFO L131 ssoRankerPreferences]: Filename of dumped script: selectionsort-alloca-1.i_Iteration1_Lasso [2019-11-15 20:27:34,156 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-11-15 20:27:34,156 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2019-11-15 20:27:34,186 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-15 20:27:34,196 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-15 20:27:34,200 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-15 20:27:34,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-15 20:27:34,211 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-15 20:27:34,214 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-15 20:27:34,362 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-15 20:27:34,368 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-15 20:27:34,371 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-15 20:27:34,663 INFO L292 LassoAnalysis]: Preprocessing complete. [2019-11-15 20:27:34,667 INFO L489 LassoAnalysis]: Using template 'affine'. [2019-11-15 20:27:34,668 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-15 20:27:34,669 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 20:27:34,670 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 20:27:34,670 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 20:27:34,670 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 20:27:34,670 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 20:27:34,671 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 20:27:34,671 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 20:27:34,674 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 20:27:34,675 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-15 20:27:34,675 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 20:27:34,676 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 20:27:34,676 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 20:27:34,676 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 20:27:34,676 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 20:27:34,678 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 20:27:34,678 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 20:27:34,680 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 20:27:34,684 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-15 20:27:34,685 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 20:27:34,685 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 20:27:34,685 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 20:27:34,685 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 20:27:34,690 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-15 20:27:34,691 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-15 20:27:34,697 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 20:27:34,698 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-15 20:27:34,698 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 20:27:34,698 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 20:27:34,698 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 20:27:34,699 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 20:27:34,700 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-15 20:27:34,700 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-15 20:27:34,703 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 20:27:34,704 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-15 20:27:34,704 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 20:27:34,704 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 20:27:34,708 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 20:27:34,709 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 20:27:34,709 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 20:27:34,709 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 20:27:34,710 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 20:27:34,711 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 20:27:34,713 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-15 20:27:34,714 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 20:27:34,714 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 20:27:34,714 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 20:27:34,714 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 20:27:34,714 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 20:27:34,714 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 20:27:34,715 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 20:27:34,715 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 20:27:34,716 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-15 20:27:34,716 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 20:27:34,716 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 20:27:34,716 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 20:27:34,717 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 20:27:34,717 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 20:27:34,717 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 20:27:34,717 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 20:27:34,718 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 20:27:34,719 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-15 20:27:34,719 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 20:27:34,720 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 20:27:34,720 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 20:27:34,720 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 20:27:34,726 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-15 20:27:34,726 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-15 20:27:34,791 INFO L419 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-11-15 20:27:34,859 INFO L443 ModelExtractionUtils]: Simplification made 6 calls to the SMT solver. [2019-11-15 20:27:34,859 INFO L444 ModelExtractionUtils]: 16 out of 22 variables were initially zero. Simplification set additionally 3 variables to zero. [2019-11-15 20:27:34,861 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-11-15 20:27:34,863 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2019-11-15 20:27:34,863 INFO L510 LassoAnalysis]: Proved termination. [2019-11-15 20:27:34,864 INFO L512 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~i~1, ULTIMATE.start_main_~array_size~0) = -1*ULTIMATE.start_main_~i~1 + 1*ULTIMATE.start_main_~array_size~0 Supporting invariants [] [2019-11-15 20:27:34,872 INFO L297 tatePredicateManager]: 3 out of 3 supporting invariants were superfluous and have been removed [2019-11-15 20:27:34,897 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 20:27:34,912 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:27:34,914 INFO L256 TraceCheckSpWp]: Trace formula consists of 25 conjuncts, 2 conjunts are in the unsatisfiable core [2019-11-15 20:27:34,915 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 20:27:34,933 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:27:34,934 INFO L256 TraceCheckSpWp]: Trace formula consists of 10 conjuncts, 4 conjunts are in the unsatisfiable core [2019-11-15 20:27:34,935 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 20:27:34,952 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-15 20:27:34,968 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-15 20:27:34,969 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 17 states. Second operand 3 states. [2019-11-15 20:27:35,016 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 17 states.. Second operand 3 states. Result 41 states and 59 transitions. Complement of second has 7 states. [2019-11-15 20:27:35,016 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 5 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2019-11-15 20:27:35,018 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2019-11-15 20:27:35,020 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 39 transitions. [2019-11-15 20:27:35,022 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 39 transitions. Stem has 4 letters. Loop has 2 letters. [2019-11-15 20:27:35,023 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-15 20:27:35,027 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 39 transitions. Stem has 6 letters. Loop has 2 letters. [2019-11-15 20:27:35,027 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-15 20:27:35,028 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 39 transitions. Stem has 4 letters. Loop has 4 letters. [2019-11-15 20:27:35,028 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-15 20:27:35,029 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 41 states and 59 transitions. [2019-11-15 20:27:35,032 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 6 [2019-11-15 20:27:35,035 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 41 states to 14 states and 19 transitions. [2019-11-15 20:27:35,036 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 11 [2019-11-15 20:27:35,036 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 12 [2019-11-15 20:27:35,037 INFO L73 IsDeterministic]: Start isDeterministic. Operand 14 states and 19 transitions. [2019-11-15 20:27:35,037 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-11-15 20:27:35,037 INFO L688 BuchiCegarLoop]: Abstraction has 14 states and 19 transitions. [2019-11-15 20:27:35,048 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14 states and 19 transitions. [2019-11-15 20:27:35,054 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14 to 14. [2019-11-15 20:27:35,054 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2019-11-15 20:27:35,055 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 19 transitions. [2019-11-15 20:27:35,056 INFO L711 BuchiCegarLoop]: Abstraction has 14 states and 19 transitions. [2019-11-15 20:27:35,056 INFO L591 BuchiCegarLoop]: Abstraction has 14 states and 19 transitions. [2019-11-15 20:27:35,056 INFO L424 BuchiCegarLoop]: ======== Iteration 2============ [2019-11-15 20:27:35,056 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 14 states and 19 transitions. [2019-11-15 20:27:35,057 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 6 [2019-11-15 20:27:35,057 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-15 20:27:35,057 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-15 20:27:35,057 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1] [2019-11-15 20:27:35,057 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2019-11-15 20:27:35,058 INFO L791 eck$LassoCheckResult]: Stem: 128#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 124#L-1 havoc main_#res;havoc main_#t~nondet8, main_#t~malloc9.base, main_#t~malloc9.offset, main_#t~nondet11, main_#t~post10, main_~i~1, main_~array_size~0, main_~numbers~0.base, main_~numbers~0.offset;main_~array_size~0 := main_#t~nondet8;havoc main_#t~nondet8; 125#L531 assume !(main_~array_size~0 < 1 || main_~array_size~0 >= 536870911); 127#L531-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;main_~i~1 := 0; 122#L536-3 assume !(main_~i~1 < main_~array_size~0); 123#L536-4 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; 119#L515-3 [2019-11-15 20:27:35,058 INFO L793 eck$LassoCheckResult]: Loop: 119#L515-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; 115#L519-3 assume !(SelectionSort_~j~0 < SelectionSort_~array_size); 116#L519-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); 118#L515-2 SelectionSort_#t~pre2 := 1 + SelectionSort_~i~0;SelectionSort_~i~0 := 1 + SelectionSort_~i~0;havoc SelectionSort_#t~pre2; 119#L515-3 [2019-11-15 20:27:35,058 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 20:27:35,058 INFO L82 PathProgramCache]: Analyzing trace with hash 889568397, now seen corresponding path program 1 times [2019-11-15 20:27:35,059 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 20:27:35,059 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1665105299] [2019-11-15 20:27:35,059 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:27:35,059 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:27:35,059 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 20:27:35,067 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:27:35,118 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-15 20:27:35,119 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1665105299] [2019-11-15 20:27:35,119 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 20:27:35,119 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-15 20:27:35,120 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2105298337] [2019-11-15 20:27:35,122 INFO L796 eck$LassoCheckResult]: stem already infeasible [2019-11-15 20:27:35,122 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 20:27:35,122 INFO L82 PathProgramCache]: Analyzing trace with hash 1884201, now seen corresponding path program 1 times [2019-11-15 20:27:35,122 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 20:27:35,123 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1223537340] [2019-11-15 20:27:35,123 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:27:35,123 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:27:35,123 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 20:27:35,130 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:27:35,138 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-15 20:27:35,138 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1223537340] [2019-11-15 20:27:35,138 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 20:27:35,139 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-15 20:27:35,139 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [15206923] [2019-11-15 20:27:35,139 INFO L808 eck$LassoCheckResult]: loop already infeasible [2019-11-15 20:27:35,139 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 20:27:35,141 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-15 20:27:35,142 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-15 20:27:35,143 INFO L87 Difference]: Start difference. First operand 14 states and 19 transitions. cyclomatic complexity: 7 Second operand 3 states. [2019-11-15 20:27:35,160 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 20:27:35,160 INFO L93 Difference]: Finished difference Result 15 states and 20 transitions. [2019-11-15 20:27:35,161 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-15 20:27:35,161 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 15 states and 20 transitions. [2019-11-15 20:27:35,162 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 7 [2019-11-15 20:27:35,163 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 15 states to 15 states and 20 transitions. [2019-11-15 20:27:35,163 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 13 [2019-11-15 20:27:35,163 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 13 [2019-11-15 20:27:35,163 INFO L73 IsDeterministic]: Start isDeterministic. Operand 15 states and 20 transitions. [2019-11-15 20:27:35,164 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-11-15 20:27:35,164 INFO L688 BuchiCegarLoop]: Abstraction has 15 states and 20 transitions. [2019-11-15 20:27:35,164 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15 states and 20 transitions. [2019-11-15 20:27:35,165 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15 to 15. [2019-11-15 20:27:35,165 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2019-11-15 20:27:35,166 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 20 transitions. [2019-11-15 20:27:35,166 INFO L711 BuchiCegarLoop]: Abstraction has 15 states and 20 transitions. [2019-11-15 20:27:35,166 INFO L591 BuchiCegarLoop]: Abstraction has 15 states and 20 transitions. [2019-11-15 20:27:35,166 INFO L424 BuchiCegarLoop]: ======== Iteration 3============ [2019-11-15 20:27:35,166 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 15 states and 20 transitions. [2019-11-15 20:27:35,167 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 7 [2019-11-15 20:27:35,167 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-15 20:27:35,167 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-15 20:27:35,167 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1] [2019-11-15 20:27:35,168 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1] [2019-11-15 20:27:35,168 INFO L791 eck$LassoCheckResult]: Stem: 164#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 161#L-1 havoc main_#res;havoc main_#t~nondet8, main_#t~malloc9.base, main_#t~malloc9.offset, main_#t~nondet11, main_#t~post10, main_~i~1, main_~array_size~0, main_~numbers~0.base, main_~numbers~0.offset;main_~array_size~0 := main_#t~nondet8;havoc main_#t~nondet8; 162#L531 assume !(main_~array_size~0 < 1 || main_~array_size~0 >= 536870911); 165#L531-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;main_~i~1 := 0; 159#L536-3 assume !(main_~i~1 < main_~array_size~0); 160#L536-4 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; 156#L515-3 [2019-11-15 20:27:35,168 INFO L793 eck$LassoCheckResult]: Loop: 156#L515-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; 152#L519-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); 153#L521 assume SelectionSort_#t~mem4 < SelectionSort_#t~mem5;havoc SelectionSort_#t~mem4;havoc SelectionSort_#t~mem5;SelectionSort_~min~0 := SelectionSort_~j~0; 163#L519-2 SelectionSort_#t~pre3 := 1 + SelectionSort_~j~0;SelectionSort_~j~0 := 1 + SelectionSort_~j~0;havoc SelectionSort_#t~pre3; 166#L519-3 assume !(SelectionSort_~j~0 < SelectionSort_~array_size); 154#L519-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); 155#L515-2 SelectionSort_#t~pre2 := 1 + SelectionSort_~i~0;SelectionSort_~i~0 := 1 + SelectionSort_~i~0;havoc SelectionSort_#t~pre2; 156#L515-3 [2019-11-15 20:27:35,168 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 20:27:35,168 INFO L82 PathProgramCache]: Analyzing trace with hash 889568397, now seen corresponding path program 2 times [2019-11-15 20:27:35,169 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 20:27:35,169 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1915399798] [2019-11-15 20:27:35,169 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:27:35,169 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:27:35,169 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 20:27:35,176 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:27:35,200 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-15 20:27:35,201 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1915399798] [2019-11-15 20:27:35,201 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 20:27:35,201 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-15 20:27:35,201 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [790919792] [2019-11-15 20:27:35,202 INFO L796 eck$LassoCheckResult]: stem already infeasible [2019-11-15 20:27:35,202 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 20:27:35,202 INFO L82 PathProgramCache]: Analyzing trace with hash 347385690, now seen corresponding path program 1 times [2019-11-15 20:27:35,202 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 20:27:35,202 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [616083208] [2019-11-15 20:27:35,203 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:27:35,203 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:27:35,203 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 20:27:35,215 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 20:27:35,233 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 20:27:35,236 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-15 20:27:35,384 WARN L191 SmtUtils]: Spent 144.00 ms on a formula simplification. DAG size of input: 75 DAG size of output: 60 [2019-11-15 20:27:35,423 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 20:27:35,423 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-15 20:27:35,423 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-15 20:27:35,423 INFO L87 Difference]: Start difference. First operand 15 states and 20 transitions. cyclomatic complexity: 7 Second operand 4 states. [2019-11-15 20:27:35,451 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 20:27:35,451 INFO L93 Difference]: Finished difference Result 16 states and 20 transitions. [2019-11-15 20:27:35,452 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-15 20:27:35,452 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 16 states and 20 transitions. [2019-11-15 20:27:35,453 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 7 [2019-11-15 20:27:35,453 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 16 states to 16 states and 20 transitions. [2019-11-15 20:27:35,453 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 13 [2019-11-15 20:27:35,454 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 13 [2019-11-15 20:27:35,454 INFO L73 IsDeterministic]: Start isDeterministic. Operand 16 states and 20 transitions. [2019-11-15 20:27:35,454 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-11-15 20:27:35,454 INFO L688 BuchiCegarLoop]: Abstraction has 16 states and 20 transitions. [2019-11-15 20:27:35,454 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16 states and 20 transitions. [2019-11-15 20:27:35,455 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16 to 15. [2019-11-15 20:27:35,456 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2019-11-15 20:27:35,456 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 19 transitions. [2019-11-15 20:27:35,456 INFO L711 BuchiCegarLoop]: Abstraction has 15 states and 19 transitions. [2019-11-15 20:27:35,456 INFO L591 BuchiCegarLoop]: Abstraction has 15 states and 19 transitions. [2019-11-15 20:27:35,456 INFO L424 BuchiCegarLoop]: ======== Iteration 4============ [2019-11-15 20:27:35,457 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 15 states and 19 transitions. [2019-11-15 20:27:35,457 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 7 [2019-11-15 20:27:35,457 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-15 20:27:35,457 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-15 20:27:35,458 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 20:27:35,458 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1] [2019-11-15 20:27:35,458 INFO L791 eck$LassoCheckResult]: Stem: 202#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 199#L-1 havoc main_#res;havoc main_#t~nondet8, main_#t~malloc9.base, main_#t~malloc9.offset, main_#t~nondet11, main_#t~post10, main_~i~1, main_~array_size~0, main_~numbers~0.base, main_~numbers~0.offset;main_~array_size~0 := main_#t~nondet8;havoc main_#t~nondet8; 200#L531 assume !(main_~array_size~0 < 1 || main_~array_size~0 >= 536870911); 203#L531-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;main_~i~1 := 0; 197#L536-3 assume !!(main_~i~1 < main_~array_size~0);call write~int(main_#t~nondet11, main_~numbers~0.base, main_~numbers~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet11; 195#L536-2 main_#t~post10 := main_~i~1;main_~i~1 := 1 + main_#t~post10;havoc main_#t~post10; 196#L536-3 assume !(main_~i~1 < main_~array_size~0); 198#L536-4 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; 194#L515-3 [2019-11-15 20:27:35,458 INFO L793 eck$LassoCheckResult]: Loop: 194#L515-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; 190#L519-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); 191#L521 assume SelectionSort_#t~mem4 < SelectionSort_#t~mem5;havoc SelectionSort_#t~mem4;havoc SelectionSort_#t~mem5;SelectionSort_~min~0 := SelectionSort_~j~0; 201#L519-2 SelectionSort_#t~pre3 := 1 + SelectionSort_~j~0;SelectionSort_~j~0 := 1 + SelectionSort_~j~0;havoc SelectionSort_#t~pre3; 204#L519-3 assume !(SelectionSort_~j~0 < SelectionSort_~array_size); 192#L519-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); 193#L515-2 SelectionSort_#t~pre2 := 1 + SelectionSort_~i~0;SelectionSort_~i~0 := 1 + SelectionSort_~i~0;havoc SelectionSort_#t~pre2; 194#L515-3 [2019-11-15 20:27:35,459 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 20:27:35,459 INFO L82 PathProgramCache]: Analyzing trace with hash 176793839, now seen corresponding path program 1 times [2019-11-15 20:27:35,459 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 20:27:35,459 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1611912977] [2019-11-15 20:27:35,459 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:27:35,459 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:27:35,460 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 20:27:35,469 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 20:27:35,477 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 20:27:35,480 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-15 20:27:35,481 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 20:27:35,481 INFO L82 PathProgramCache]: Analyzing trace with hash 347385690, now seen corresponding path program 2 times [2019-11-15 20:27:35,481 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 20:27:35,481 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1565622798] [2019-11-15 20:27:35,482 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:27:35,482 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:27:35,482 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 20:27:35,490 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 20:27:35,496 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 20:27:35,499 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-15 20:27:35,500 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 20:27:35,500 INFO L82 PathProgramCache]: Analyzing trace with hash 651542188, now seen corresponding path program 1 times [2019-11-15 20:27:35,500 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 20:27:35,500 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [963468219] [2019-11-15 20:27:35,500 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:27:35,501 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:27:35,501 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 20:27:35,531 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:27:35,611 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-11-15 20:27:35,611 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [963468219] [2019-11-15 20:27:35,611 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1984726052] [2019-11-15 20:27:35,612 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_58a2b8e5-f9df-4686-b88c-3e189e1481d6/bin/uautomizer/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-15 20:27:35,683 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:27:35,684 INFO L256 TraceCheckSpWp]: Trace formula consists of 81 conjuncts, 7 conjunts are in the unsatisfiable core [2019-11-15 20:27:35,686 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 20:27:35,754 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-11-15 20:27:35,754 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-15 20:27:35,755 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 6] total 11 [2019-11-15 20:27:35,755 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1597185564] [2019-11-15 20:27:35,884 WARN L191 SmtUtils]: Spent 126.00 ms on a formula simplification. DAG size of input: 75 DAG size of output: 60 [2019-11-15 20:27:35,927 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 20:27:35,927 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-11-15 20:27:35,927 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=85, Unknown=0, NotChecked=0, Total=110 [2019-11-15 20:27:35,927 INFO L87 Difference]: Start difference. First operand 15 states and 19 transitions. cyclomatic complexity: 6 Second operand 11 states. [2019-11-15 20:27:36,077 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 20:27:36,077 INFO L93 Difference]: Finished difference Result 24 states and 29 transitions. [2019-11-15 20:27:36,078 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-11-15 20:27:36,078 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 24 states and 29 transitions. [2019-11-15 20:27:36,080 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 7 [2019-11-15 20:27:36,080 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 24 states to 18 states and 21 transitions. [2019-11-15 20:27:36,080 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 13 [2019-11-15 20:27:36,080 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 13 [2019-11-15 20:27:36,081 INFO L73 IsDeterministic]: Start isDeterministic. Operand 18 states and 21 transitions. [2019-11-15 20:27:36,081 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-11-15 20:27:36,081 INFO L688 BuchiCegarLoop]: Abstraction has 18 states and 21 transitions. [2019-11-15 20:27:36,081 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18 states and 21 transitions. [2019-11-15 20:27:36,082 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18 to 17. [2019-11-15 20:27:36,082 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2019-11-15 20:27:36,083 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 20 transitions. [2019-11-15 20:27:36,083 INFO L711 BuchiCegarLoop]: Abstraction has 17 states and 20 transitions. [2019-11-15 20:27:36,083 INFO L591 BuchiCegarLoop]: Abstraction has 17 states and 20 transitions. [2019-11-15 20:27:36,083 INFO L424 BuchiCegarLoop]: ======== Iteration 5============ [2019-11-15 20:27:36,083 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 17 states and 20 transitions. [2019-11-15 20:27:36,084 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 7 [2019-11-15 20:27:36,084 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-15 20:27:36,084 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-15 20:27:36,085 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 1, 1, 1, 1, 1, 1] [2019-11-15 20:27:36,085 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1] [2019-11-15 20:27:36,085 INFO L791 eck$LassoCheckResult]: Stem: 306#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 302#L-1 havoc main_#res;havoc main_#t~nondet8, main_#t~malloc9.base, main_#t~malloc9.offset, main_#t~nondet11, main_#t~post10, main_~i~1, main_~array_size~0, main_~numbers~0.base, main_~numbers~0.offset;main_~array_size~0 := main_#t~nondet8;havoc main_#t~nondet8; 303#L531 assume !(main_~array_size~0 < 1 || main_~array_size~0 >= 536870911); 307#L531-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;main_~i~1 := 0; 300#L536-3 assume !!(main_~i~1 < main_~array_size~0);call write~int(main_#t~nondet11, main_~numbers~0.base, main_~numbers~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet11; 298#L536-2 main_#t~post10 := main_~i~1;main_~i~1 := 1 + main_#t~post10;havoc main_#t~post10; 299#L536-3 assume !!(main_~i~1 < main_~array_size~0);call write~int(main_#t~nondet11, main_~numbers~0.base, main_~numbers~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet11; 301#L536-2 main_#t~post10 := main_~i~1;main_~i~1 := 1 + main_#t~post10;havoc main_#t~post10; 309#L536-3 assume !(main_~i~1 < main_~array_size~0); 304#L536-4 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; 297#L515-3 [2019-11-15 20:27:36,085 INFO L793 eck$LassoCheckResult]: Loop: 297#L515-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; 293#L519-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); 294#L521 assume SelectionSort_#t~mem4 < SelectionSort_#t~mem5;havoc SelectionSort_#t~mem4;havoc SelectionSort_#t~mem5;SelectionSort_~min~0 := SelectionSort_~j~0; 305#L519-2 SelectionSort_#t~pre3 := 1 + SelectionSort_~j~0;SelectionSort_~j~0 := 1 + SelectionSort_~j~0;havoc SelectionSort_#t~pre3; 308#L519-3 assume !(SelectionSort_~j~0 < SelectionSort_~array_size); 295#L519-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); 296#L515-2 SelectionSort_#t~pre2 := 1 + SelectionSort_~i~0;SelectionSort_~i~0 := 1 + SelectionSort_~i~0;havoc SelectionSort_#t~pre2; 297#L515-3 [2019-11-15 20:27:36,086 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 20:27:36,086 INFO L82 PathProgramCache]: Analyzing trace with hash -1899756335, now seen corresponding path program 2 times [2019-11-15 20:27:36,086 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 20:27:36,086 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [278275572] [2019-11-15 20:27:36,086 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:27:36,086 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:27:36,087 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 20:27:36,103 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 20:27:36,114 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 20:27:36,118 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-15 20:27:36,119 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 20:27:36,119 INFO L82 PathProgramCache]: Analyzing trace with hash 347385690, now seen corresponding path program 3 times [2019-11-15 20:27:36,119 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 20:27:36,119 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1413329898] [2019-11-15 20:27:36,119 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:27:36,120 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:27:36,120 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 20:27:36,126 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 20:27:36,132 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 20:27:36,134 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-15 20:27:36,135 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 20:27:36,135 INFO L82 PathProgramCache]: Analyzing trace with hash 219717770, now seen corresponding path program 2 times [2019-11-15 20:27:36,135 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 20:27:36,136 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1787932790] [2019-11-15 20:27:36,136 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:27:36,136 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:27:36,136 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 20:27:36,153 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 20:27:36,172 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 20:27:36,178 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-15 20:27:36,308 WARN L191 SmtUtils]: Spent 127.00 ms on a formula simplification. DAG size of input: 75 DAG size of output: 60 [2019-11-15 20:27:36,607 WARN L191 SmtUtils]: Spent 259.00 ms on a formula simplification. DAG size of input: 97 DAG size of output: 78 [2019-11-15 20:27:36,683 INFO L210 LassoAnalysis]: Preferences: [2019-11-15 20:27:36,683 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-11-15 20:27:36,684 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-11-15 20:27:36,684 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-11-15 20:27:36,684 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2019-11-15 20:27:36,684 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-15 20:27:36,684 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-11-15 20:27:36,684 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-11-15 20:27:36,684 INFO L131 ssoRankerPreferences]: Filename of dumped script: selectionsort-alloca-1.i_Iteration5_Lasso [2019-11-15 20:27:36,684 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-11-15 20:27:36,684 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2019-11-15 20:27:36,689 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-15 20:27:36,823 WARN L191 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 50 DAG size of output: 47 [2019-11-15 20:27:36,918 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-15 20:27:36,920 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-15 20:27:36,924 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-15 20:27:36,926 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-15 20:27:36,928 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-15 20:27:36,930 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-15 20:27:36,932 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-15 20:27:36,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-15 20:27:36,937 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-15 20:27:36,939 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-15 20:27:36,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-15 20:27:36,943 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-15 20:27:36,945 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-15 20:27:36,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-15 20:27:36,949 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-15 20:27:37,325 INFO L292 LassoAnalysis]: Preprocessing complete. [2019-11-15 20:27:37,325 INFO L489 LassoAnalysis]: Using template 'affine'. [2019-11-15 20:27:37,325 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-15 20:27:37,326 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 20:27:37,326 INFO L202 nArgumentSynthesizer]: 2 stem disjuncts [2019-11-15 20:27:37,326 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 20:27:37,326 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 20:27:37,329 INFO L400 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2019-11-15 20:27:37,329 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-15 20:27:37,346 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 20:27:37,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-15 20:27:37,357 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 20:27:37,358 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 20:27:37,358 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 20:27:37,358 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 20:27:37,358 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 20:27:37,359 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 20:27:37,361 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 20:27:37,363 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 20:27:37,364 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-15 20:27:37,365 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 20:27:37,365 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 20:27:37,365 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 20:27:37,365 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 20:27:37,367 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-15 20:27:37,367 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-15 20:27:37,372 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 20:27:37,372 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-15 20:27:37,373 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 20:27:37,373 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 20:27:37,373 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 20:27:37,373 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 20:27:37,374 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-15 20:27:37,375 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-15 20:27:37,376 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 20:27:37,376 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-15 20:27:37,377 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 20:27:37,377 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 20:27:37,378 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 20:27:37,378 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 20:27:37,382 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-15 20:27:37,383 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-15 20:27:37,466 INFO L419 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-11-15 20:27:37,494 INFO L443 ModelExtractionUtils]: Simplification made 4 calls to the SMT solver. [2019-11-15 20:27:37,495 INFO L444 ModelExtractionUtils]: 38 out of 43 variables were initially zero. Simplification set additionally 2 variables to zero. [2019-11-15 20:27:37,495 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-11-15 20:27:37,496 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2019-11-15 20:27:37,496 INFO L510 LassoAnalysis]: Proved termination. [2019-11-15 20:27:37,496 INFO L512 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_SelectionSort_~i~0, ULTIMATE.start_SelectionSort_~array_size) = -1*ULTIMATE.start_SelectionSort_~i~0 + 1*ULTIMATE.start_SelectionSort_~array_size Supporting invariants [] [2019-11-15 20:27:37,509 INFO L297 tatePredicateManager]: 4 out of 4 supporting invariants were superfluous and have been removed [2019-11-15 20:27:37,527 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 20:27:37,540 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:27:37,541 INFO L256 TraceCheckSpWp]: Trace formula consists of 56 conjuncts, 2 conjunts are in the unsatisfiable core [2019-11-15 20:27:37,542 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 20:27:37,552 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:27:37,553 INFO L256 TraceCheckSpWp]: Trace formula consists of 35 conjuncts, 4 conjunts are in the unsatisfiable core [2019-11-15 20:27:37,553 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 20:27:37,569 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-15 20:27:37,569 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-15 20:27:37,570 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 17 states and 20 transitions. cyclomatic complexity: 5 Second operand 3 states. [2019-11-15 20:27:37,585 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 17 states and 20 transitions. cyclomatic complexity: 5. Second operand 3 states. Result 24 states and 30 transitions. Complement of second has 4 states. [2019-11-15 20:27:37,586 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-15 20:27:37,586 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2019-11-15 20:27:37,586 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 16 transitions. [2019-11-15 20:27:37,586 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 16 transitions. Stem has 10 letters. Loop has 7 letters. [2019-11-15 20:27:37,586 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-15 20:27:37,587 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 16 transitions. Stem has 17 letters. Loop has 7 letters. [2019-11-15 20:27:37,587 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-15 20:27:37,587 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 16 transitions. Stem has 10 letters. Loop has 14 letters. [2019-11-15 20:27:37,587 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-15 20:27:37,588 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 24 states and 30 transitions. [2019-11-15 20:27:37,589 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2019-11-15 20:27:37,589 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 24 states to 22 states and 28 transitions. [2019-11-15 20:27:37,589 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 10 [2019-11-15 20:27:37,589 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 11 [2019-11-15 20:27:37,590 INFO L73 IsDeterministic]: Start isDeterministic. Operand 22 states and 28 transitions. [2019-11-15 20:27:37,590 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-11-15 20:27:37,590 INFO L688 BuchiCegarLoop]: Abstraction has 22 states and 28 transitions. [2019-11-15 20:27:37,590 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22 states and 28 transitions. [2019-11-15 20:27:37,591 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22 to 21. [2019-11-15 20:27:37,591 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2019-11-15 20:27:37,592 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 27 transitions. [2019-11-15 20:27:37,592 INFO L711 BuchiCegarLoop]: Abstraction has 21 states and 27 transitions. [2019-11-15 20:27:37,592 INFO L591 BuchiCegarLoop]: Abstraction has 21 states and 27 transitions. [2019-11-15 20:27:37,592 INFO L424 BuchiCegarLoop]: ======== Iteration 6============ [2019-11-15 20:27:37,592 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 21 states and 27 transitions. [2019-11-15 20:27:37,593 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2019-11-15 20:27:37,593 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-15 20:27:37,593 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-15 20:27:37,593 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 20:27:37,594 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2019-11-15 20:27:37,594 INFO L791 eck$LassoCheckResult]: Stem: 438#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 433#L-1 havoc main_#res;havoc main_#t~nondet8, main_#t~malloc9.base, main_#t~malloc9.offset, main_#t~nondet11, main_#t~post10, main_~i~1, main_~array_size~0, main_~numbers~0.base, main_~numbers~0.offset;main_~array_size~0 := main_#t~nondet8;havoc main_#t~nondet8; 434#L531 assume !(main_~array_size~0 < 1 || main_~array_size~0 >= 536870911); 439#L531-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;main_~i~1 := 0; 431#L536-3 assume !!(main_~i~1 < main_~array_size~0);call write~int(main_#t~nondet11, main_~numbers~0.base, main_~numbers~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet11; 428#L536-2 main_#t~post10 := main_~i~1;main_~i~1 := 1 + main_#t~post10;havoc main_#t~post10; 429#L536-3 assume !!(main_~i~1 < main_~array_size~0);call write~int(main_#t~nondet11, main_~numbers~0.base, main_~numbers~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet11; 432#L536-2 main_#t~post10 := main_~i~1;main_~i~1 := 1 + main_#t~post10;havoc main_#t~post10; 441#L536-3 assume !(main_~i~1 < main_~array_size~0); 435#L536-4 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; 430#L515-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; 421#L519-3 [2019-11-15 20:27:37,594 INFO L793 eck$LassoCheckResult]: Loop: 421#L519-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); 422#L521 assume SelectionSort_#t~mem4 < SelectionSort_#t~mem5;havoc SelectionSort_#t~mem4;havoc SelectionSort_#t~mem5;SelectionSort_~min~0 := SelectionSort_~j~0; 436#L519-2 SelectionSort_#t~pre3 := 1 + SelectionSort_~j~0;SelectionSort_~j~0 := 1 + SelectionSort_~j~0;havoc SelectionSort_#t~pre3; 421#L519-3 [2019-11-15 20:27:37,594 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 20:27:37,594 INFO L82 PathProgramCache]: Analyzing trace with hash 1237095790, now seen corresponding path program 1 times [2019-11-15 20:27:37,594 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 20:27:37,594 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1239272645] [2019-11-15 20:27:37,594 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:27:37,595 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:27:37,595 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 20:27:37,602 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 20:27:37,610 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 20:27:37,615 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-15 20:27:37,617 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 20:27:37,617 INFO L82 PathProgramCache]: Analyzing trace with hash 68618, now seen corresponding path program 1 times [2019-11-15 20:27:37,618 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 20:27:37,618 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1253181141] [2019-11-15 20:27:37,618 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:27:37,619 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:27:37,619 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 20:27:37,622 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 20:27:37,626 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 20:27:37,629 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-15 20:27:37,630 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 20:27:37,630 INFO L82 PathProgramCache]: Analyzing trace with hash -793648259, now seen corresponding path program 1 times [2019-11-15 20:27:37,631 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 20:27:37,631 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1200983759] [2019-11-15 20:27:37,631 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:27:37,631 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:27:37,631 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 20:27:37,644 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 20:27:37,661 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 20:27:37,669 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-15 20:27:37,993 WARN L191 SmtUtils]: Spent 244.00 ms on a formula simplification. DAG size of input: 103 DAG size of output: 83 [2019-11-15 20:27:38,061 INFO L210 LassoAnalysis]: Preferences: [2019-11-15 20:27:38,061 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-11-15 20:27:38,061 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-11-15 20:27:38,061 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-11-15 20:27:38,061 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2019-11-15 20:27:38,061 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-15 20:27:38,061 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-11-15 20:27:38,061 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-11-15 20:27:38,061 INFO L131 ssoRankerPreferences]: Filename of dumped script: selectionsort-alloca-1.i_Iteration6_Lasso [2019-11-15 20:27:38,061 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-11-15 20:27:38,061 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2019-11-15 20:27:38,065 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-15 20:27:38,073 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-15 20:27:38,075 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-15 20:27:38,077 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-15 20:27:38,079 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-15 20:27:38,082 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-15 20:27:38,084 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-15 20:27:38,086 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-15 20:27:38,089 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-15 20:27:38,255 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-15 20:27:38,257 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-15 20:27:38,259 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-15 20:27:38,261 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-15 20:27:38,262 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-15 20:27:38,263 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-15 20:27:38,265 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-15 20:27:38,267 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-15 20:27:38,636 INFO L292 LassoAnalysis]: Preprocessing complete. [2019-11-15 20:27:38,636 INFO L489 LassoAnalysis]: Using template 'affine'. [2019-11-15 20:27:38,637 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-15 20:27:38,637 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 20:27:38,638 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 20:27:38,638 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 20:27:38,638 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 20:27:38,638 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 20:27:38,638 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 20:27:38,639 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 20:27:38,639 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 20:27:38,639 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-15 20:27:38,640 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 20:27:38,640 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 20:27:38,640 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 20:27:38,640 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 20:27:38,640 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 20:27:38,641 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 20:27:38,641 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 20:27:38,641 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 20:27:38,642 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-15 20:27:38,642 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 20:27:38,642 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 20:27:38,642 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 20:27:38,642 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 20:27:38,643 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-15 20:27:38,643 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-15 20:27:38,645 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 20:27:38,645 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-15 20:27:38,646 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 20:27:38,646 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 20:27:38,646 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 20:27:38,646 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 20:27:38,646 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 20:27:38,647 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 20:27:38,647 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 20:27:38,647 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 20:27:38,649 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-15 20:27:38,649 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 20:27:38,650 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 20:27:38,650 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 20:27:38,650 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 20:27:38,651 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-15 20:27:38,651 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-15 20:27:38,653 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 20:27:38,654 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-15 20:27:38,654 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 20:27:38,654 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 20:27:38,654 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 20:27:38,655 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 20:27:38,655 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 20:27:38,655 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 20:27:38,655 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 20:27:38,656 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 20:27:38,656 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-15 20:27:38,657 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 20:27:38,657 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 20:27:38,657 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 20:27:38,657 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 20:27:38,658 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 20:27:38,658 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 20:27:38,658 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 20:27:38,659 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 20:27:38,659 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-15 20:27:38,660 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 20:27:38,660 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 20:27:38,660 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 20:27:38,660 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 20:27:38,661 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-15 20:27:38,661 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-15 20:27:38,663 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 20:27:38,663 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-15 20:27:38,664 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 20:27:38,664 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 20:27:38,664 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 20:27:38,664 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 20:27:38,664 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 20:27:38,665 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 20:27:38,665 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 20:27:38,667 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 20:27:38,667 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-15 20:27:38,668 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 20:27:38,668 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 20:27:38,668 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 20:27:38,668 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 20:27:38,670 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-15 20:27:38,670 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-15 20:27:38,674 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 20:27:38,675 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-15 20:27:38,675 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 20:27:38,675 INFO L202 nArgumentSynthesizer]: 2 stem disjuncts [2019-11-15 20:27:38,676 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 20:27:38,676 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 20:27:38,678 INFO L400 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2019-11-15 20:27:38,678 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-15 20:27:38,684 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 20:27:38,685 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-15 20:27:38,685 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 20:27:38,686 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 20:27:38,686 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 20:27:38,686 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 20:27:38,689 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-15 20:27:38,690 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-15 20:27:38,740 INFO L419 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-11-15 20:27:38,769 INFO L443 ModelExtractionUtils]: Simplification made 6 calls to the SMT solver. [2019-11-15 20:27:38,769 INFO L444 ModelExtractionUtils]: 35 out of 43 variables were initially zero. Simplification set additionally 5 variables to zero. [2019-11-15 20:27:38,770 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-11-15 20:27:38,770 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2019-11-15 20:27:38,771 INFO L510 LassoAnalysis]: Proved termination. [2019-11-15 20:27:38,771 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-15 20:27:38,788 INFO L297 tatePredicateManager]: 4 out of 4 supporting invariants were superfluous and have been removed [2019-11-15 20:27:38,800 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 20:27:38,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:27:38,814 INFO L256 TraceCheckSpWp]: Trace formula consists of 61 conjuncts, 2 conjunts are in the unsatisfiable core [2019-11-15 20:27:38,815 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 20:27:38,821 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:27:38,822 INFO L256 TraceCheckSpWp]: Trace formula consists of 18 conjuncts, 4 conjunts are in the unsatisfiable core [2019-11-15 20:27:38,822 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 20:27:38,831 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-15 20:27:38,831 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-15 20:27:38,831 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 21 states and 27 transitions. cyclomatic complexity: 9 Second operand 3 states. [2019-11-15 20:27:38,850 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 21 states and 27 transitions. cyclomatic complexity: 9. Second operand 3 states. Result 39 states and 53 transitions. Complement of second has 7 states. [2019-11-15 20:27:38,851 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-15 20:27:38,851 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2019-11-15 20:27:38,851 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 16 transitions. [2019-11-15 20:27:38,851 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 16 transitions. Stem has 11 letters. Loop has 3 letters. [2019-11-15 20:27:38,851 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-15 20:27:38,852 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 16 transitions. Stem has 14 letters. Loop has 3 letters. [2019-11-15 20:27:38,852 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-15 20:27:38,852 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 16 transitions. Stem has 11 letters. Loop has 6 letters. [2019-11-15 20:27:38,852 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-15 20:27:38,852 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 39 states and 53 transitions. [2019-11-15 20:27:38,854 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2019-11-15 20:27:38,854 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 39 states to 28 states and 36 transitions. [2019-11-15 20:27:38,854 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 10 [2019-11-15 20:27:38,854 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 10 [2019-11-15 20:27:38,855 INFO L73 IsDeterministic]: Start isDeterministic. Operand 28 states and 36 transitions. [2019-11-15 20:27:38,855 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-11-15 20:27:38,855 INFO L688 BuchiCegarLoop]: Abstraction has 28 states and 36 transitions. [2019-11-15 20:27:38,855 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states and 36 transitions. [2019-11-15 20:27:38,856 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 21. [2019-11-15 20:27:38,857 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2019-11-15 20:27:38,857 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 26 transitions. [2019-11-15 20:27:38,858 INFO L711 BuchiCegarLoop]: Abstraction has 21 states and 26 transitions. [2019-11-15 20:27:38,858 INFO L591 BuchiCegarLoop]: Abstraction has 21 states and 26 transitions. [2019-11-15 20:27:38,858 INFO L424 BuchiCegarLoop]: ======== Iteration 7============ [2019-11-15 20:27:38,858 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 21 states and 26 transitions. [2019-11-15 20:27:38,859 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2019-11-15 20:27:38,859 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-15 20:27:38,859 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-15 20:27:38,860 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 20:27:38,860 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2019-11-15 20:27:38,860 INFO L791 eck$LassoCheckResult]: Stem: 580#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 575#L-1 havoc main_#res;havoc main_#t~nondet8, main_#t~malloc9.base, main_#t~malloc9.offset, main_#t~nondet11, main_#t~post10, main_~i~1, main_~array_size~0, main_~numbers~0.base, main_~numbers~0.offset;main_~array_size~0 := main_#t~nondet8;havoc main_#t~nondet8; 576#L531 assume !(main_~array_size~0 < 1 || main_~array_size~0 >= 536870911); 581#L531-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;main_~i~1 := 0; 573#L536-3 assume !!(main_~i~1 < main_~array_size~0);call write~int(main_#t~nondet11, main_~numbers~0.base, main_~numbers~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet11; 570#L536-2 main_#t~post10 := main_~i~1;main_~i~1 := 1 + main_#t~post10;havoc main_#t~post10; 571#L536-3 assume !!(main_~i~1 < main_~array_size~0);call write~int(main_#t~nondet11, main_~numbers~0.base, main_~numbers~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet11; 574#L536-2 main_#t~post10 := main_~i~1;main_~i~1 := 1 + main_#t~post10;havoc main_#t~post10; 583#L536-3 assume !(main_~i~1 < main_~array_size~0); 577#L536-4 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; 572#L515-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; 565#L519-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); 566#L521 assume !(SelectionSort_#t~mem4 < SelectionSort_#t~mem5);havoc SelectionSort_#t~mem4;havoc SelectionSort_#t~mem5; 579#L519-2 SelectionSort_#t~pre3 := 1 + SelectionSort_~j~0;SelectionSort_~j~0 := 1 + SelectionSort_~j~0;havoc SelectionSort_#t~pre3; 582#L519-3 assume !(SelectionSort_~j~0 < SelectionSort_~array_size); 567#L519-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); 568#L515-2 SelectionSort_#t~pre2 := 1 + SelectionSort_~i~0;SelectionSort_~i~0 := 1 + SelectionSort_~i~0;havoc SelectionSort_#t~pre2; 569#L515-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; 563#L519-3 [2019-11-15 20:27:38,861 INFO L793 eck$LassoCheckResult]: Loop: 563#L519-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); 564#L521 assume SelectionSort_#t~mem4 < SelectionSort_#t~mem5;havoc SelectionSort_#t~mem4;havoc SelectionSort_#t~mem5;SelectionSort_~min~0 := SelectionSort_~j~0; 578#L519-2 SelectionSort_#t~pre3 := 1 + SelectionSort_~j~0;SelectionSort_~j~0 := 1 + SelectionSort_~j~0;havoc SelectionSort_#t~pre3; 563#L519-3 [2019-11-15 20:27:38,861 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 20:27:38,861 INFO L82 PathProgramCache]: Analyzing trace with hash -1721425389, now seen corresponding path program 1 times [2019-11-15 20:27:38,861 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 20:27:38,861 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [748965009] [2019-11-15 20:27:38,861 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:27:38,862 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:27:38,862 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 20:27:38,869 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:27:38,927 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2019-11-15 20:27:38,927 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [748965009] [2019-11-15 20:27:38,927 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1035078760] [2019-11-15 20:27:38,927 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_58a2b8e5-f9df-4686-b88c-3e189e1481d6/bin/uautomizer/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-15 20:27:39,003 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:27:39,004 INFO L256 TraceCheckSpWp]: Trace formula consists of 92 conjuncts, 9 conjunts are in the unsatisfiable core [2019-11-15 20:27:39,005 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 20:27:39,067 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 4 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-11-15 20:27:39,068 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-15 20:27:39,068 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 7] total 11 [2019-11-15 20:27:39,068 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [446844641] [2019-11-15 20:27:39,069 INFO L796 eck$LassoCheckResult]: stem already infeasible [2019-11-15 20:27:39,069 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 20:27:39,069 INFO L82 PathProgramCache]: Analyzing trace with hash 68618, now seen corresponding path program 2 times [2019-11-15 20:27:39,069 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 20:27:39,069 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1660767596] [2019-11-15 20:27:39,069 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:27:39,069 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:27:39,070 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 20:27:39,072 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 20:27:39,076 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 20:27:39,078 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-15 20:27:39,125 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 20:27:39,126 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-11-15 20:27:39,126 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=102, Unknown=0, NotChecked=0, Total=132 [2019-11-15 20:27:39,126 INFO L87 Difference]: Start difference. First operand 21 states and 26 transitions. cyclomatic complexity: 8 Second operand 12 states. [2019-11-15 20:27:39,343 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 20:27:39,344 INFO L93 Difference]: Finished difference Result 47 states and 58 transitions. [2019-11-15 20:27:39,344 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-11-15 20:27:39,344 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 47 states and 58 transitions. [2019-11-15 20:27:39,345 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2019-11-15 20:27:39,346 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 47 states to 35 states and 44 transitions. [2019-11-15 20:27:39,346 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 16 [2019-11-15 20:27:39,346 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 16 [2019-11-15 20:27:39,346 INFO L73 IsDeterministic]: Start isDeterministic. Operand 35 states and 44 transitions. [2019-11-15 20:27:39,347 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-11-15 20:27:39,347 INFO L688 BuchiCegarLoop]: Abstraction has 35 states and 44 transitions. [2019-11-15 20:27:39,347 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states and 44 transitions. [2019-11-15 20:27:39,350 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 26. [2019-11-15 20:27:39,350 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26 states. [2019-11-15 20:27:39,350 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 32 transitions. [2019-11-15 20:27:39,350 INFO L711 BuchiCegarLoop]: Abstraction has 26 states and 32 transitions. [2019-11-15 20:27:39,350 INFO L591 BuchiCegarLoop]: Abstraction has 26 states and 32 transitions. [2019-11-15 20:27:39,351 INFO L424 BuchiCegarLoop]: ======== Iteration 8============ [2019-11-15 20:27:39,351 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 26 states and 32 transitions. [2019-11-15 20:27:39,351 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2019-11-15 20:27:39,351 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-15 20:27:39,351 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-15 20:27:39,352 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 20:27:39,352 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2019-11-15 20:27:39,352 INFO L791 eck$LassoCheckResult]: Stem: 730#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 724#L-1 havoc main_#res;havoc main_#t~nondet8, main_#t~malloc9.base, main_#t~malloc9.offset, main_#t~nondet11, main_#t~post10, main_~i~1, main_~array_size~0, main_~numbers~0.base, main_~numbers~0.offset;main_~array_size~0 := main_#t~nondet8;havoc main_#t~nondet8; 725#L531 assume !(main_~array_size~0 < 1 || main_~array_size~0 >= 536870911); 731#L531-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;main_~i~1 := 0; 722#L536-3 assume !!(main_~i~1 < main_~array_size~0);call write~int(main_#t~nondet11, main_~numbers~0.base, main_~numbers~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet11; 718#L536-2 main_#t~post10 := main_~i~1;main_~i~1 := 1 + main_#t~post10;havoc main_#t~post10; 719#L536-3 assume !!(main_~i~1 < main_~array_size~0);call write~int(main_#t~nondet11, main_~numbers~0.base, main_~numbers~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet11; 723#L536-2 main_#t~post10 := main_~i~1;main_~i~1 := 1 + main_#t~post10;havoc main_#t~post10; 736#L536-3 assume !!(main_~i~1 < main_~array_size~0);call write~int(main_#t~nondet11, main_~numbers~0.base, main_~numbers~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet11; 735#L536-2 main_#t~post10 := main_~i~1;main_~i~1 := 1 + main_#t~post10;havoc main_#t~post10; 734#L536-3 assume !(main_~i~1 < main_~array_size~0); 726#L536-4 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; 720#L515-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; 721#L519-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); 728#L521 assume !(SelectionSort_#t~mem4 < SelectionSort_#t~mem5);havoc SelectionSort_#t~mem4;havoc SelectionSort_#t~mem5; 729#L519-2 SelectionSort_#t~pre3 := 1 + SelectionSort_~j~0;SelectionSort_~j~0 := 1 + SelectionSort_~j~0;havoc SelectionSort_#t~pre3; 713#L519-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); 714#L521 assume !(SelectionSort_#t~mem4 < SelectionSort_#t~mem5);havoc SelectionSort_#t~mem4;havoc SelectionSort_#t~mem5; 733#L519-2 SelectionSort_#t~pre3 := 1 + SelectionSort_~j~0;SelectionSort_~j~0 := 1 + SelectionSort_~j~0;havoc SelectionSort_#t~pre3; 732#L519-3 assume !(SelectionSort_~j~0 < SelectionSort_~array_size); 715#L519-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); 716#L515-2 SelectionSort_#t~pre2 := 1 + SelectionSort_~i~0;SelectionSort_~i~0 := 1 + SelectionSort_~i~0;havoc SelectionSort_#t~pre2; 717#L515-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; 711#L519-3 [2019-11-15 20:27:39,352 INFO L793 eck$LassoCheckResult]: Loop: 711#L519-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); 712#L521 assume SelectionSort_#t~mem4 < SelectionSort_#t~mem5;havoc SelectionSort_#t~mem4;havoc SelectionSort_#t~mem5;SelectionSort_~min~0 := SelectionSort_~j~0; 727#L519-2 SelectionSort_#t~pre3 := 1 + SelectionSort_~j~0;SelectionSort_~j~0 := 1 + SelectionSort_~j~0;havoc SelectionSort_#t~pre3; 711#L519-3 [2019-11-15 20:27:39,353 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 20:27:39,353 INFO L82 PathProgramCache]: Analyzing trace with hash 95688324, now seen corresponding path program 2 times [2019-11-15 20:27:39,353 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 20:27:39,353 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1391546766] [2019-11-15 20:27:39,353 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:27:39,353 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:27:39,353 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 20:27:39,368 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 20:27:39,382 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 20:27:39,390 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-15 20:27:39,391 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 20:27:39,392 INFO L82 PathProgramCache]: Analyzing trace with hash 68618, now seen corresponding path program 3 times [2019-11-15 20:27:39,392 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 20:27:39,392 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [496576250] [2019-11-15 20:27:39,392 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:27:39,392 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:27:39,392 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 20:27:39,397 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 20:27:39,398 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 20:27:39,400 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-15 20:27:39,401 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 20:27:39,401 INFO L82 PathProgramCache]: Analyzing trace with hash -1207385433, now seen corresponding path program 1 times [2019-11-15 20:27:39,402 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 20:27:39,402 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [38843499] [2019-11-15 20:27:39,402 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:27:39,402 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:27:39,402 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 20:27:39,424 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 20:27:39,445 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 20:27:39,449 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-15 20:27:40,191 WARN L191 SmtUtils]: Spent 693.00 ms on a formula simplification. DAG size of input: 193 DAG size of output: 150 [2019-11-15 20:27:40,304 WARN L191 SmtUtils]: Spent 105.00 ms on a formula simplification that was a NOOP. DAG size: 90 [2019-11-15 20:27:40,306 INFO L210 LassoAnalysis]: Preferences: [2019-11-15 20:27:40,306 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-11-15 20:27:40,306 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-11-15 20:27:40,306 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-11-15 20:27:40,306 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2019-11-15 20:27:40,306 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-15 20:27:40,306 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-11-15 20:27:40,306 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-11-15 20:27:40,306 INFO L131 ssoRankerPreferences]: Filename of dumped script: selectionsort-alloca-1.i_Iteration8_Lasso [2019-11-15 20:27:40,306 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-11-15 20:27:40,306 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2019-11-15 20:27:40,309 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-15 20:27:40,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-15 20:27:40,315 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-15 20:27:40,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-15 20:27:40,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-15 20:27:40,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-15 20:27:40,329 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-15 20:27:40,330 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-15 20:27:40,335 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-15 20:27:40,345 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-15 20:27:40,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-15 20:27:40,359 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-15 20:27:40,361 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-15 20:27:40,420 FATAL L? ?]: The Plugin de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer has thrown an exception: java.lang.AssertionError: MapEliminator tries to combine Int and (Array Int Int) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.mapelimination.MapEliminator.indexEqualityInequalityImpliesValueEquality(MapEliminator.java:850) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.mapelimination.MapEliminator.replaceSelectStoreTerm(MapEliminator.java:592) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.mapelimination.MapEliminator.replaceStoreTerms(MapEliminator.java:542) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.mapelimination.MapEliminator.getRewrittenTransFormula(MapEliminator.java:330) at de.uni_freiburg.informatik.ultimate.lassoranker.preprocessors.MapEliminationLassoPreprocessor.process(MapEliminationLassoPreprocessor.java:109) at de.uni_freiburg.informatik.ultimate.lassoranker.variables.LassoBuilder.applyPreprocessor(LassoBuilder.java:154) at de.uni_freiburg.informatik.ultimate.lassoranker.variables.LassoBuilder.preprocess(LassoBuilder.java:262) at de.uni_freiburg.informatik.ultimate.lassoranker.LassoAnalysis.preprocess(LassoAnalysis.java:278) at de.uni_freiburg.informatik.ultimate.lassoranker.LassoAnalysis.(LassoAnalysis.java:229) at de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.LassoCheck.synthesize(LassoCheck.java:609) at de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.LassoCheck.access$16(LassoCheck.java:536) at de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.LassoCheck$LassoCheckResult.checkLassoTermination(LassoCheck.java:951) at de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.LassoCheck$LassoCheckResult.(LassoCheck.java:862) at de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.LassoCheck.(LassoCheck.java:248) at de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiCegarLoop.iterate(BuchiCegarLoop.java:458) at de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver.doTerminationAnalysis(BuchiAutomizerObserver.java:141) at de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver.finish(BuchiAutomizerObserver.java:380) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:316) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:55) [2019-11-15 20:27:40,423 INFO L168 Benchmark]: Toolchain (without parser) took 7732.65 ms. Allocated memory was 1.0 GB in the beginning and 1.3 GB in the end (delta: 300.9 MB). Free memory was 941.0 MB in the beginning and 1.1 GB in the end (delta: -119.9 MB). Peak memory consumption was 181.1 MB. Max. memory is 11.5 GB. [2019-11-15 20:27:40,424 INFO L168 Benchmark]: CDTParser took 0.22 ms. Allocated memory is still 1.0 GB. Free memory is still 963.8 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-15 20:27:40,424 INFO L168 Benchmark]: CACSL2BoogieTranslator took 547.67 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 120.6 MB). Free memory was 941.0 MB in the beginning and 1.1 GB in the end (delta: -161.7 MB). Peak memory consumption was 18.2 MB. Max. memory is 11.5 GB. [2019-11-15 20:27:40,425 INFO L168 Benchmark]: Boogie Procedure Inliner took 47.88 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 6.9 MB). Peak memory consumption was 6.9 MB. Max. memory is 11.5 GB. [2019-11-15 20:27:40,425 INFO L168 Benchmark]: Boogie Preprocessor took 26.67 ms. Allocated memory is still 1.1 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-15 20:27:40,425 INFO L168 Benchmark]: RCFGBuilder took 333.17 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 21.8 MB). Peak memory consumption was 21.8 MB. Max. memory is 11.5 GB. [2019-11-15 20:27:40,426 INFO L168 Benchmark]: BuchiAutomizer took 6773.92 ms. Allocated memory was 1.1 GB in the beginning and 1.3 GB in the end (delta: 180.4 MB). Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 13.1 MB). Peak memory consumption was 193.4 MB. Max. memory is 11.5 GB. [2019-11-15 20:27:40,429 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.22 ms. Allocated memory is still 1.0 GB. Free memory is still 963.8 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 547.67 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 120.6 MB). Free memory was 941.0 MB in the beginning and 1.1 GB in the end (delta: -161.7 MB). Peak memory consumption was 18.2 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 47.88 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 6.9 MB). Peak memory consumption was 6.9 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 26.67 ms. Allocated memory is still 1.1 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * RCFGBuilder took 333.17 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 21.8 MB). Peak memory consumption was 21.8 MB. Max. memory is 11.5 GB. * BuchiAutomizer took 6773.92 ms. Allocated memory was 1.1 GB in the beginning and 1.3 GB in the end (delta: 180.4 MB). Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 13.1 MB). Peak memory consumption was 193.4 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer: - ExceptionOrErrorResult: AssertionError: MapEliminator tries to combine Int and (Array Int Int) de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer: AssertionError: MapEliminator tries to combine Int and (Array Int Int): de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.mapelimination.MapEliminator.indexEqualityInequalityImpliesValueEquality(MapEliminator.java:850) RESULT: Ultimate could not prove your program: Toolchain returned no result. Received shutdown request...