./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 a4ecdabc Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/run_dir_f3b23108-7052-4c58-a573-90c15f01a784/bin/uautomizer/data/config -Xmx15G -Xms4m -jar /tmp/vcloud-vcloud-master/worker/run_dir_f3b23108-7052-4c58-a573-90c15f01a784/bin/uautomizer/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/run_dir_f3b23108-7052-4c58-a573-90c15f01a784/bin/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/run_dir_f3b23108-7052-4c58-a573-90c15f01a784/bin/uautomizer/config/AutomizerTermination.xml -i ../../sv-benchmarks/c/array-memsafety/selectionsort-alloca-1.i -s /tmp/vcloud-vcloud-master/worker/run_dir_f3b23108-7052-4c58-a573-90c15f01a784/bin/uautomizer/config/svcomp-Termination-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/run_dir_f3b23108-7052-4c58-a573-90c15f01a784/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_f3b23108-7052-4c58-a573-90c15f01a784/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.2.0-a4ecdab [2020-11-28 03:04:10,643 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-11-28 03:04:10,647 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-11-28 03:04:10,736 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-11-28 03:04:10,736 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-11-28 03:04:10,744 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-11-28 03:04:10,747 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-11-28 03:04:10,760 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-11-28 03:04:10,763 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-11-28 03:04:10,764 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-11-28 03:04:10,766 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-11-28 03:04:10,768 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-11-28 03:04:10,769 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-11-28 03:04:10,771 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-11-28 03:04:10,772 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-11-28 03:04:10,774 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-11-28 03:04:10,776 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-11-28 03:04:10,778 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-11-28 03:04:10,784 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-11-28 03:04:10,792 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-11-28 03:04:10,794 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-11-28 03:04:10,806 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-11-28 03:04:10,808 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-11-28 03:04:10,810 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-11-28 03:04:10,814 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-11-28 03:04:10,815 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-11-28 03:04:10,815 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-11-28 03:04:10,817 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-11-28 03:04:10,818 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-11-28 03:04:10,819 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-11-28 03:04:10,820 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-11-28 03:04:10,821 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-11-28 03:04:10,822 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-11-28 03:04:10,823 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-11-28 03:04:10,827 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-11-28 03:04:10,829 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-11-28 03:04:10,830 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-11-28 03:04:10,831 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-11-28 03:04:10,832 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-11-28 03:04:10,833 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-11-28 03:04:10,833 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-11-28 03:04:10,836 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/run_dir_f3b23108-7052-4c58-a573-90c15f01a784/bin/uautomizer/config/svcomp-Termination-32bit-Automizer_Default.epf [2020-11-28 03:04:10,880 INFO L113 SettingsManager]: Loading preferences was successful [2020-11-28 03:04:10,880 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-11-28 03:04:10,882 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2020-11-28 03:04:10,882 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2020-11-28 03:04:10,883 INFO L138 SettingsManager]: * Use SBE=true [2020-11-28 03:04:10,883 INFO L136 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2020-11-28 03:04:10,883 INFO L138 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2020-11-28 03:04:10,884 INFO L138 SettingsManager]: * Use old map elimination=false [2020-11-28 03:04:10,884 INFO L138 SettingsManager]: * Use external solver (rank synthesis)=false [2020-11-28 03:04:10,884 INFO L138 SettingsManager]: * Use only trivial implications for array writes=true [2020-11-28 03:04:10,885 INFO L138 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2020-11-28 03:04:10,885 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-11-28 03:04:10,885 INFO L138 SettingsManager]: * sizeof long=4 [2020-11-28 03:04:10,886 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2020-11-28 03:04:10,886 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-11-28 03:04:10,886 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-11-28 03:04:10,887 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-11-28 03:04:10,887 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2020-11-28 03:04:10,887 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2020-11-28 03:04:10,888 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2020-11-28 03:04:10,888 INFO L138 SettingsManager]: * sizeof long double=12 [2020-11-28 03:04:10,888 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-11-28 03:04:10,888 INFO L138 SettingsManager]: * Assume nondeterminstic values are in range=false [2020-11-28 03:04:10,889 INFO L138 SettingsManager]: * Use constant arrays=true [2020-11-28 03:04:10,889 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2020-11-28 03:04:10,889 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-11-28 03:04:10,890 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2020-11-28 03:04:10,890 INFO L138 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2020-11-28 03:04:10,890 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-11-28 03:04:10,891 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2020-11-28 03:04:10,891 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2020-11-28 03:04:10,891 INFO L138 SettingsManager]: * Dump automata to the following directory=/home/matthias/ultimate/dump/auto [2020-11-28 03:04:10,893 INFO L136 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2020-11-28 03:04:10,893 INFO L138 SettingsManager]: * TransformationType=MODULO_NEIGHBOR WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/tmp/vcloud-vcloud-master/worker/run_dir_f3b23108-7052-4c58-a573-90c15f01a784/bin/uautomizer/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release 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_f3b23108-7052-4c58-a573-90c15f01a784/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 [2020-11-28 03:04:11,256 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2020-11-28 03:04:11,297 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-11-28 03:04:11,302 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-11-28 03:04:11,304 INFO L271 PluginConnector]: Initializing CDTParser... [2020-11-28 03:04:11,305 INFO L275 PluginConnector]: CDTParser initialized [2020-11-28 03:04:11,306 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/run_dir_f3b23108-7052-4c58-a573-90c15f01a784/bin/uautomizer/../../sv-benchmarks/c/array-memsafety/selectionsort-alloca-1.i [2020-11-28 03:04:11,443 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_f3b23108-7052-4c58-a573-90c15f01a784/bin/uautomizer/data/0d6a4e494/20d7ca14fb2a4226a3555c9ab88e669c/FLAG6d8bfb0f2 [2020-11-28 03:04:12,098 INFO L306 CDTParser]: Found 1 translation units. [2020-11-28 03:04:12,099 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/run_dir_f3b23108-7052-4c58-a573-90c15f01a784/sv-benchmarks/c/array-memsafety/selectionsort-alloca-1.i [2020-11-28 03:04:12,117 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_f3b23108-7052-4c58-a573-90c15f01a784/bin/uautomizer/data/0d6a4e494/20d7ca14fb2a4226a3555c9ab88e669c/FLAG6d8bfb0f2 [2020-11-28 03:04:12,389 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/run_dir_f3b23108-7052-4c58-a573-90c15f01a784/bin/uautomizer/data/0d6a4e494/20d7ca14fb2a4226a3555c9ab88e669c [2020-11-28 03:04:12,394 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-11-28 03:04:12,396 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2020-11-28 03:04:12,404 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-11-28 03:04:12,404 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-11-28 03:04:12,415 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-11-28 03:04:12,416 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.11 03:04:12" (1/1) ... [2020-11-28 03:04:12,418 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4a048ff3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 03:04:12, skipping insertion in model container [2020-11-28 03:04:12,420 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.11 03:04:12" (1/1) ... [2020-11-28 03:04:12,428 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-11-28 03:04:12,510 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-11-28 03:04:12,943 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-11-28 03:04:12,965 INFO L203 MainTranslator]: Completed pre-run [2020-11-28 03:04:13,022 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-11-28 03:04:13,085 INFO L208 MainTranslator]: Completed translation [2020-11-28 03:04:13,086 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 03:04:13 WrapperNode [2020-11-28 03:04:13,086 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-11-28 03:04:13,088 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2020-11-28 03:04:13,088 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2020-11-28 03:04:13,088 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2020-11-28 03:04:13,098 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 03:04:13" (1/1) ... [2020-11-28 03:04:13,115 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 03:04:13" (1/1) ... [2020-11-28 03:04:13,141 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2020-11-28 03:04:13,142 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-11-28 03:04:13,142 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-11-28 03:04:13,143 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-11-28 03:04:13,153 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 03:04:13" (1/1) ... [2020-11-28 03:04:13,153 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 03:04:13" (1/1) ... [2020-11-28 03:04:13,157 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 03:04:13" (1/1) ... [2020-11-28 03:04:13,158 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 03:04:13" (1/1) ... [2020-11-28 03:04:13,165 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 03:04:13" (1/1) ... [2020-11-28 03:04:13,170 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 03:04:13" (1/1) ... [2020-11-28 03:04:13,172 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 03:04:13" (1/1) ... [2020-11-28 03:04:13,175 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-11-28 03:04:13,176 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-11-28 03:04:13,177 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-11-28 03:04:13,177 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-11-28 03:04:13,178 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 03:04:13" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_f3b23108-7052-4c58-a573-90c15f01a784/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 [2020-11-28 03:04:13,275 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2020-11-28 03:04:13,275 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2020-11-28 03:04:13,276 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2020-11-28 03:04:13,276 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2020-11-28 03:04:13,276 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-11-28 03:04:13,277 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-11-28 03:04:13,770 INFO L293 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-11-28 03:04:13,772 INFO L298 CfgBuilder]: Removed 9 assume(true) statements. [2020-11-28 03:04:13,774 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 03:04:13 BoogieIcfgContainer [2020-11-28 03:04:13,775 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-11-28 03:04:13,777 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2020-11-28 03:04:13,777 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2020-11-28 03:04:13,781 INFO L275 PluginConnector]: BuchiAutomizer initialized [2020-11-28 03:04:13,782 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2020-11-28 03:04:13,783 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 28.11 03:04:12" (1/3) ... [2020-11-28 03:04:13,784 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@16200585 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 28.11 03:04:13, skipping insertion in model container [2020-11-28 03:04:13,785 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2020-11-28 03:04:13,785 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 03:04:13" (2/3) ... [2020-11-28 03:04:13,785 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@16200585 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 28.11 03:04:13, skipping insertion in model container [2020-11-28 03:04:13,786 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2020-11-28 03:04:13,786 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 03:04:13" (3/3) ... [2020-11-28 03:04:13,788 INFO L373 chiAutomizerObserver]: Analyzing ICFG selectionsort-alloca-1.i [2020-11-28 03:04:13,856 INFO L359 BuchiCegarLoop]: Interprodecural is true [2020-11-28 03:04:13,857 INFO L360 BuchiCegarLoop]: Hoare is false [2020-11-28 03:04:13,857 INFO L361 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2020-11-28 03:04:13,857 INFO L362 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2020-11-28 03:04:13,857 INFO L363 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-11-28 03:04:13,857 INFO L364 BuchiCegarLoop]: Difference is false [2020-11-28 03:04:13,857 INFO L365 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-11-28 03:04:13,858 INFO L368 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2020-11-28 03:04:13,875 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 17 states. [2020-11-28 03:04:13,903 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 8 [2020-11-28 03:04:13,904 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-11-28 03:04:13,904 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-11-28 03:04:13,911 INFO L852 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1] [2020-11-28 03:04:13,911 INFO L853 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2020-11-28 03:04:13,911 INFO L427 BuchiCegarLoop]: ======== Iteration 1============ [2020-11-28 03:04:13,912 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 17 states. [2020-11-28 03:04:13,916 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 8 [2020-11-28 03:04:13,916 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-11-28 03:04:13,916 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-11-28 03:04:13,917 INFO L852 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1] [2020-11-28 03:04:13,917 INFO L853 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2020-11-28 03:04:13,926 INFO L794 eck$LassoCheckResult]: Stem: 13#ULTIMATE.startENTRYtrue #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; 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 [2020-11-28 03:04:13,926 INFO L796 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 [2020-11-28 03:04:13,940 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-28 03:04:13,940 INFO L82 PathProgramCache]: Analyzing trace with hash 925669, now seen corresponding path program 1 times [2020-11-28 03:04:13,955 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-28 03:04:13,955 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1094127175] [2020-11-28 03:04:13,956 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-28 03:04:14,096 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-11-28 03:04:14,096 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-11-28 03:04:14,123 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-11-28 03:04:14,128 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-11-28 03:04:14,157 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-11-28 03:04:14,165 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-28 03:04:14,165 INFO L82 PathProgramCache]: Analyzing trace with hash 1507, now seen corresponding path program 1 times [2020-11-28 03:04:14,165 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-28 03:04:14,166 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [921368260] [2020-11-28 03:04:14,166 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-28 03:04:14,186 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-11-28 03:04:14,195 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-11-28 03:04:14,208 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-11-28 03:04:14,212 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-11-28 03:04:14,221 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-11-28 03:04:14,228 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-28 03:04:14,229 INFO L82 PathProgramCache]: Analyzing trace with hash 889568455, now seen corresponding path program 1 times [2020-11-28 03:04:14,229 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-28 03:04:14,230 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1295898725] [2020-11-28 03:04:14,230 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-28 03:04:14,282 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-11-28 03:04:14,282 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-11-28 03:04:14,320 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-11-28 03:04:14,321 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-11-28 03:04:14,327 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-11-28 03:04:14,827 WARN L193 SmtUtils]: Spent 378.00 ms on a formula simplification. DAG size of input: 44 DAG size of output: 42 [2020-11-28 03:04:14,922 INFO L210 LassoAnalysis]: Preferences: [2020-11-28 03:04:14,923 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2020-11-28 03:04:14,923 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2020-11-28 03:04:14,923 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2020-11-28 03:04:14,923 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2020-11-28 03:04:14,924 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-11-28 03:04:14,924 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2020-11-28 03:04:14,924 INFO L132 ssoRankerPreferences]: Path of dumped script: [2020-11-28 03:04:14,924 INFO L133 ssoRankerPreferences]: Filename of dumped script: selectionsort-alloca-1.i_Iteration1_Lasso [2020-11-28 03:04:14,924 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2020-11-28 03:04:14,925 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2020-11-28 03:04:14,950 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-11-28 03:04:14,960 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-11-28 03:04:14,966 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-11-28 03:04:14,975 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-11-28 03:04:15,138 WARN L193 SmtUtils]: Spent 121.00 ms on a formula simplification. DAG size of input: 33 DAG size of output: 31 [2020-11-28 03:04:15,194 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-11-28 03:04:15,199 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-11-28 03:04:15,204 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-11-28 03:04:15,215 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-11-28 03:04:15,220 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-11-28 03:04:15,598 INFO L292 LassoAnalysis]: Preprocessing complete. [2020-11-28 03:04:15,606 INFO L489 LassoAnalysis]: Using template 'affine'. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_f3b23108-7052-4c58-a573-90c15f01a784/bin/uautomizer/z3 Starting monitored process 2 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2020-11-28 03:04:15,626 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 [2020-11-28 03:04:15,630 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-11-28 03:04:15,630 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-11-28 03:04:15,631 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-11-28 03:04:15,631 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-11-28 03:04:15,632 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-11-28 03:04:15,634 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-11-28 03:04:15,635 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. Waiting until toolchain timeout for monitored process 2 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-11-28 03:04:15,639 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_f3b23108-7052-4c58-a573-90c15f01a784/bin/uautomizer/z3 Starting monitored process 3 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2020-11-28 03:04:15,689 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 [2020-11-28 03:04:15,691 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-11-28 03:04:15,691 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-11-28 03:04:15,691 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-11-28 03:04:15,692 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-11-28 03:04:15,692 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-11-28 03:04:15,694 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-11-28 03:04:15,694 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. Waiting until toolchain timeout for monitored process 3 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-11-28 03:04:15,697 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_f3b23108-7052-4c58-a573-90c15f01a784/bin/uautomizer/z3 Starting monitored process 4 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2020-11-28 03:04:15,749 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 [2020-11-28 03:04:15,752 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-11-28 03:04:15,753 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-11-28 03:04:15,753 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-11-28 03:04:15,753 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-11-28 03:04:15,763 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-11-28 03:04:15,763 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. Waiting until toolchain timeout for monitored process 4 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-11-28 03:04:15,772 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_f3b23108-7052-4c58-a573-90c15f01a784/bin/uautomizer/z3 Starting monitored process 5 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 5 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-11-28 03:04:15,827 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 [2020-11-28 03:04:15,829 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-11-28 03:04:15,829 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-11-28 03:04:15,830 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-11-28 03:04:15,830 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-11-28 03:04:15,830 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-11-28 03:04:15,831 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-11-28 03:04:15,831 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-11-28 03:04:15,835 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_f3b23108-7052-4c58-a573-90c15f01a784/bin/uautomizer/z3 Starting monitored process 6 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 6 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-11-28 03:04:15,864 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 [2020-11-28 03:04:15,866 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-11-28 03:04:15,867 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-11-28 03:04:15,867 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-11-28 03:04:15,867 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-11-28 03:04:15,867 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-11-28 03:04:15,868 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-11-28 03:04:15,869 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-11-28 03:04:15,891 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_f3b23108-7052-4c58-a573-90c15f01a784/bin/uautomizer/z3 Starting monitored process 7 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2020-11-28 03:04:15,942 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false Waiting until toolchain timeout for monitored process 7 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-11-28 03:04:15,945 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-11-28 03:04:15,945 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-11-28 03:04:15,946 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-11-28 03:04:15,946 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-11-28 03:04:15,980 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-11-28 03:04:15,983 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-11-28 03:04:16,002 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2020-11-28 03:04:16,099 INFO L443 ModelExtractionUtils]: Simplification made 9 calls to the SMT solver. [2020-11-28 03:04:16,099 INFO L444 ModelExtractionUtils]: 4 out of 22 variables were initially zero. Simplification set additionally 13 variables to zero. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_f3b23108-7052-4c58-a573-90c15f01a784/bin/uautomizer/z3 Starting monitored process 8 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2020-11-28 03:04:16,106 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... Waiting until toolchain timeout for monitored process 8 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-11-28 03:04:16,110 INFO L438 nArgumentSynthesizer]: Removed 1 redundant supporting invariants from a total of 2. [2020-11-28 03:04:16,111 INFO L510 LassoAnalysis]: Proved termination. [2020-11-28 03:04:16,112 INFO L512 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~i~1, v_rep(select #length ULTIMATE.start_main_~numbers~0.base)_1) = -2*ULTIMATE.start_main_~i~1 + 1*v_rep(select #length ULTIMATE.start_main_~numbers~0.base)_1 Supporting invariants [-2*ULTIMATE.start_main_~array_size~0 + 1*v_rep(select #length ULTIMATE.start_main_#t~malloc9.base)_1 >= 0] [2020-11-28 03:04:16,177 INFO L297 tatePredicateManager]: 2 out of 4 supporting invariants were superfluous and have been removed [2020-11-28 03:04:16,193 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-11-28 03:04:16,243 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-28 03:04:16,262 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-28 03:04:16,265 INFO L263 TraceCheckSpWp]: Trace formula consists of 26 conjuncts, 6 conjunts are in the unsatisfiable core [2020-11-28 03:04:16,266 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-11-28 03:04:16,309 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-28 03:04:16,310 WARN L261 TraceCheckSpWp]: Trace formula consists of 13 conjuncts, 7 conjunts are in the unsatisfiable core [2020-11-28 03:04:16,310 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-11-28 03:04:16,340 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-28 03:04:16,362 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.2 stem predicates 2 loop predicates [2020-11-28 03:04:16,364 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 17 states. Second operand 4 states. [2020-11-28 03:04:16,513 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 17 states.. Second operand 4 states. Result 38 states and 56 transitions. Complement of second has 9 states. [2020-11-28 03:04:16,515 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 6 states 2 stem states 2 non-accepting loop states 1 accepting loop states [2020-11-28 03:04:16,517 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2020-11-28 03:04:16,519 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 36 transitions. [2020-11-28 03:04:16,521 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 36 transitions. Stem has 4 letters. Loop has 2 letters. [2020-11-28 03:04:16,525 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-11-28 03:04:16,525 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 36 transitions. Stem has 6 letters. Loop has 2 letters. [2020-11-28 03:04:16,526 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-11-28 03:04:16,526 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 36 transitions. Stem has 4 letters. Loop has 4 letters. [2020-11-28 03:04:16,526 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-11-28 03:04:16,527 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 38 states and 56 transitions. [2020-11-28 03:04:16,535 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 6 [2020-11-28 03:04:16,541 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 38 states to 14 states and 19 transitions. [2020-11-28 03:04:16,542 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 11 [2020-11-28 03:04:16,543 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 12 [2020-11-28 03:04:16,544 INFO L73 IsDeterministic]: Start isDeterministic. Operand 14 states and 19 transitions. [2020-11-28 03:04:16,544 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-11-28 03:04:16,544 INFO L691 BuchiCegarLoop]: Abstraction has 14 states and 19 transitions. [2020-11-28 03:04:16,565 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14 states and 19 transitions. [2020-11-28 03:04:16,575 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14 to 14. [2020-11-28 03:04:16,575 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2020-11-28 03:04:16,576 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 19 transitions. [2020-11-28 03:04:16,578 INFO L714 BuchiCegarLoop]: Abstraction has 14 states and 19 transitions. [2020-11-28 03:04:16,578 INFO L594 BuchiCegarLoop]: Abstraction has 14 states and 19 transitions. [2020-11-28 03:04:16,578 INFO L427 BuchiCegarLoop]: ======== Iteration 2============ [2020-11-28 03:04:16,578 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 14 states and 19 transitions. [2020-11-28 03:04:16,582 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 6 [2020-11-28 03:04:16,582 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-11-28 03:04:16,584 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-11-28 03:04:16,584 INFO L852 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1] [2020-11-28 03:04:16,585 INFO L853 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2020-11-28 03:04:16,585 INFO L794 eck$LassoCheckResult]: Stem: 137#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; 134#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; 135#L531 assume !(main_~array_size~0 < 1 || main_~array_size~0 >= 536870911); 138#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; 132#L536-3 assume !(main_~i~1 < main_~array_size~0); 133#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; 129#L515-3 [2020-11-28 03:04:16,586 INFO L796 eck$LassoCheckResult]: Loop: 129#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; 125#L519-3 assume !(SelectionSort_~j~0 < SelectionSort_~array_size); 126#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); 128#L515-2 SelectionSort_#t~pre2 := 1 + SelectionSort_~i~0;SelectionSort_~i~0 := 1 + SelectionSort_~i~0;havoc SelectionSort_#t~pre2; 129#L515-3 [2020-11-28 03:04:16,587 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-28 03:04:16,587 INFO L82 PathProgramCache]: Analyzing trace with hash 889568397, now seen corresponding path program 1 times [2020-11-28 03:04:16,587 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-28 03:04:16,587 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [253913008] [2020-11-28 03:04:16,587 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-28 03:04:16,621 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-28 03:04:16,711 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-28 03:04:16,712 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [253913008] [2020-11-28 03:04:16,713 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-28 03:04:16,713 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-11-28 03:04:16,713 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1472221912] [2020-11-28 03:04:16,716 INFO L799 eck$LassoCheckResult]: stem already infeasible [2020-11-28 03:04:16,717 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-28 03:04:16,717 INFO L82 PathProgramCache]: Analyzing trace with hash 1884201, now seen corresponding path program 1 times [2020-11-28 03:04:16,717 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-28 03:04:16,718 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1770504536] [2020-11-28 03:04:16,718 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-28 03:04:16,740 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-28 03:04:16,760 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-28 03:04:16,760 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1770504536] [2020-11-28 03:04:16,760 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-28 03:04:16,760 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-11-28 03:04:16,761 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1671174337] [2020-11-28 03:04:16,761 INFO L811 eck$LassoCheckResult]: loop already infeasible [2020-11-28 03:04:16,761 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-28 03:04:16,764 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-11-28 03:04:16,765 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-11-28 03:04:16,766 INFO L87 Difference]: Start difference. First operand 14 states and 19 transitions. cyclomatic complexity: 7 Second operand 3 states. [2020-11-28 03:04:16,792 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-28 03:04:16,793 INFO L93 Difference]: Finished difference Result 15 states and 20 transitions. [2020-11-28 03:04:16,793 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-11-28 03:04:16,794 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 15 states and 20 transitions. [2020-11-28 03:04:16,795 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 7 [2020-11-28 03:04:16,796 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 15 states to 15 states and 20 transitions. [2020-11-28 03:04:16,796 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 13 [2020-11-28 03:04:16,796 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 13 [2020-11-28 03:04:16,796 INFO L73 IsDeterministic]: Start isDeterministic. Operand 15 states and 20 transitions. [2020-11-28 03:04:16,796 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-11-28 03:04:16,796 INFO L691 BuchiCegarLoop]: Abstraction has 15 states and 20 transitions. [2020-11-28 03:04:16,797 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15 states and 20 transitions. [2020-11-28 03:04:16,798 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15 to 15. [2020-11-28 03:04:16,798 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2020-11-28 03:04:16,799 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 20 transitions. [2020-11-28 03:04:16,799 INFO L714 BuchiCegarLoop]: Abstraction has 15 states and 20 transitions. [2020-11-28 03:04:16,799 INFO L594 BuchiCegarLoop]: Abstraction has 15 states and 20 transitions. [2020-11-28 03:04:16,799 INFO L427 BuchiCegarLoop]: ======== Iteration 3============ [2020-11-28 03:04:16,799 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 15 states and 20 transitions. [2020-11-28 03:04:16,800 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 7 [2020-11-28 03:04:16,800 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-11-28 03:04:16,800 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-11-28 03:04:16,801 INFO L852 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1] [2020-11-28 03:04:16,801 INFO L853 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1] [2020-11-28 03:04:16,801 INFO L794 eck$LassoCheckResult]: Stem: 174#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; 171#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; 172#L531 assume !(main_~array_size~0 < 1 || main_~array_size~0 >= 536870911); 175#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; 169#L536-3 assume !(main_~i~1 < main_~array_size~0); 170#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; 166#L515-3 [2020-11-28 03:04:16,802 INFO L796 eck$LassoCheckResult]: Loop: 166#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; 162#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); 163#L521 assume SelectionSort_#t~mem4 < SelectionSort_#t~mem5;havoc SelectionSort_#t~mem4;havoc SelectionSort_#t~mem5;SelectionSort_~min~0 := SelectionSort_~j~0; 173#L519-2 SelectionSort_#t~pre3 := 1 + SelectionSort_~j~0;SelectionSort_~j~0 := 1 + SelectionSort_~j~0;havoc SelectionSort_#t~pre3; 176#L519-3 assume !(SelectionSort_~j~0 < SelectionSort_~array_size); 164#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); 165#L515-2 SelectionSort_#t~pre2 := 1 + SelectionSort_~i~0;SelectionSort_~i~0 := 1 + SelectionSort_~i~0;havoc SelectionSort_#t~pre2; 166#L515-3 [2020-11-28 03:04:16,802 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-28 03:04:16,802 INFO L82 PathProgramCache]: Analyzing trace with hash 889568397, now seen corresponding path program 2 times [2020-11-28 03:04:16,802 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-28 03:04:16,805 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1599488373] [2020-11-28 03:04:16,805 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-28 03:04:16,818 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-28 03:04:16,863 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-28 03:04:16,864 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1599488373] [2020-11-28 03:04:16,864 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-28 03:04:16,864 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-11-28 03:04:16,864 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1603892680] [2020-11-28 03:04:16,865 INFO L799 eck$LassoCheckResult]: stem already infeasible [2020-11-28 03:04:16,887 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-28 03:04:16,887 INFO L82 PathProgramCache]: Analyzing trace with hash 347385690, now seen corresponding path program 1 times [2020-11-28 03:04:16,887 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-28 03:04:16,887 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1805334195] [2020-11-28 03:04:16,888 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-28 03:04:16,910 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-11-28 03:04:16,910 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-11-28 03:04:16,952 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-11-28 03:04:16,953 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-11-28 03:04:16,962 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-11-28 03:04:17,172 WARN L193 SmtUtils]: Spent 203.00 ms on a formula simplification. DAG size of input: 75 DAG size of output: 60 [2020-11-28 03:04:17,232 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-28 03:04:17,233 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-11-28 03:04:17,233 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2020-11-28 03:04:17,233 INFO L87 Difference]: Start difference. First operand 15 states and 20 transitions. cyclomatic complexity: 7 Second operand 4 states. [2020-11-28 03:04:17,273 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-28 03:04:17,273 INFO L93 Difference]: Finished difference Result 16 states and 20 transitions. [2020-11-28 03:04:17,274 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-11-28 03:04:17,274 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 16 states and 20 transitions. [2020-11-28 03:04:17,275 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 7 [2020-11-28 03:04:17,276 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 16 states to 16 states and 20 transitions. [2020-11-28 03:04:17,276 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 13 [2020-11-28 03:04:17,276 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 13 [2020-11-28 03:04:17,276 INFO L73 IsDeterministic]: Start isDeterministic. Operand 16 states and 20 transitions. [2020-11-28 03:04:17,276 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-11-28 03:04:17,277 INFO L691 BuchiCegarLoop]: Abstraction has 16 states and 20 transitions. [2020-11-28 03:04:17,277 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16 states and 20 transitions. [2020-11-28 03:04:17,278 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16 to 15. [2020-11-28 03:04:17,278 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2020-11-28 03:04:17,279 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 19 transitions. [2020-11-28 03:04:17,279 INFO L714 BuchiCegarLoop]: Abstraction has 15 states and 19 transitions. [2020-11-28 03:04:17,279 INFO L594 BuchiCegarLoop]: Abstraction has 15 states and 19 transitions. [2020-11-28 03:04:17,279 INFO L427 BuchiCegarLoop]: ======== Iteration 4============ [2020-11-28 03:04:17,279 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 15 states and 19 transitions. [2020-11-28 03:04:17,280 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 7 [2020-11-28 03:04:17,280 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-11-28 03:04:17,280 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-11-28 03:04:17,281 INFO L852 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1] [2020-11-28 03:04:17,281 INFO L853 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1] [2020-11-28 03:04:17,281 INFO L794 eck$LassoCheckResult]: Stem: 212#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; 209#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; 210#L531 assume !(main_~array_size~0 < 1 || main_~array_size~0 >= 536870911); 213#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; 207#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; 205#L536-2 main_#t~post10 := main_~i~1;main_~i~1 := 1 + main_#t~post10;havoc main_#t~post10; 206#L536-3 assume !(main_~i~1 < main_~array_size~0); 208#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; 204#L515-3 [2020-11-28 03:04:17,282 INFO L796 eck$LassoCheckResult]: Loop: 204#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; 200#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); 201#L521 assume SelectionSort_#t~mem4 < SelectionSort_#t~mem5;havoc SelectionSort_#t~mem4;havoc SelectionSort_#t~mem5;SelectionSort_~min~0 := SelectionSort_~j~0; 211#L519-2 SelectionSort_#t~pre3 := 1 + SelectionSort_~j~0;SelectionSort_~j~0 := 1 + SelectionSort_~j~0;havoc SelectionSort_#t~pre3; 214#L519-3 assume !(SelectionSort_~j~0 < SelectionSort_~array_size); 202#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); 203#L515-2 SelectionSort_#t~pre2 := 1 + SelectionSort_~i~0;SelectionSort_~i~0 := 1 + SelectionSort_~i~0;havoc SelectionSort_#t~pre2; 204#L515-3 [2020-11-28 03:04:17,282 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-28 03:04:17,282 INFO L82 PathProgramCache]: Analyzing trace with hash 176793839, now seen corresponding path program 1 times [2020-11-28 03:04:17,282 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-28 03:04:17,282 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1479876948] [2020-11-28 03:04:17,283 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-28 03:04:17,295 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-11-28 03:04:17,296 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-11-28 03:04:17,307 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-11-28 03:04:17,307 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-11-28 03:04:17,312 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-11-28 03:04:17,312 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-28 03:04:17,313 INFO L82 PathProgramCache]: Analyzing trace with hash 347385690, now seen corresponding path program 2 times [2020-11-28 03:04:17,313 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-28 03:04:17,313 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1502245761] [2020-11-28 03:04:17,313 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-28 03:04:17,343 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-11-28 03:04:17,343 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-11-28 03:04:17,363 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-11-28 03:04:17,363 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-11-28 03:04:17,375 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-11-28 03:04:17,376 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-28 03:04:17,376 INFO L82 PathProgramCache]: Analyzing trace with hash 651542188, now seen corresponding path program 1 times [2020-11-28 03:04:17,376 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-28 03:04:17,377 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1068078062] [2020-11-28 03:04:17,377 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-28 03:04:17,415 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-28 03:04:17,492 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2020-11-28 03:04:17,492 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1068078062] [2020-11-28 03:04:17,492 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [386120279] [2020-11-28 03:04:17,492 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_f3b23108-7052-4c58-a573-90c15f01a784/bin/uautomizer/z3 Starting monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-11-28 03:04:17,582 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-28 03:04:17,583 INFO L263 TraceCheckSpWp]: Trace formula consists of 82 conjuncts, 7 conjunts are in the unsatisfiable core [2020-11-28 03:04:17,585 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-11-28 03:04:17,674 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2020-11-28 03:04:17,674 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-11-28 03:04:17,675 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 8 [2020-11-28 03:04:17,675 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [536855597] [2020-11-28 03:04:17,890 WARN L193 SmtUtils]: Spent 212.00 ms on a formula simplification. DAG size of input: 75 DAG size of output: 60 [2020-11-28 03:04:17,950 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-28 03:04:17,951 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-11-28 03:04:17,951 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2020-11-28 03:04:17,951 INFO L87 Difference]: Start difference. First operand 15 states and 19 transitions. cyclomatic complexity: 6 Second operand 8 states. [2020-11-28 03:04:18,091 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-28 03:04:18,091 INFO L93 Difference]: Finished difference Result 25 states and 30 transitions. [2020-11-28 03:04:18,092 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-11-28 03:04:18,092 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 25 states and 30 transitions. [2020-11-28 03:04:18,093 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 7 [2020-11-28 03:04:18,094 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 25 states to 18 states and 21 transitions. [2020-11-28 03:04:18,094 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 13 [2020-11-28 03:04:18,094 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 13 [2020-11-28 03:04:18,094 INFO L73 IsDeterministic]: Start isDeterministic. Operand 18 states and 21 transitions. [2020-11-28 03:04:18,095 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-11-28 03:04:18,095 INFO L691 BuchiCegarLoop]: Abstraction has 18 states and 21 transitions. [2020-11-28 03:04:18,095 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18 states and 21 transitions. [2020-11-28 03:04:18,096 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18 to 17. [2020-11-28 03:04:18,097 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2020-11-28 03:04:18,097 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 20 transitions. [2020-11-28 03:04:18,098 INFO L714 BuchiCegarLoop]: Abstraction has 17 states and 20 transitions. [2020-11-28 03:04:18,098 INFO L594 BuchiCegarLoop]: Abstraction has 17 states and 20 transitions. [2020-11-28 03:04:18,098 INFO L427 BuchiCegarLoop]: ======== Iteration 5============ [2020-11-28 03:04:18,098 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 17 states and 20 transitions. [2020-11-28 03:04:18,099 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 7 [2020-11-28 03:04:18,099 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-11-28 03:04:18,099 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-11-28 03:04:18,100 INFO L852 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 1, 1, 1, 1, 1, 1] [2020-11-28 03:04:18,100 INFO L853 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1] [2020-11-28 03:04:18,100 INFO L794 eck$LassoCheckResult]: Stem: 316#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; 313#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; 314#L531 assume !(main_~array_size~0 < 1 || main_~array_size~0 >= 536870911); 317#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; 310#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; 308#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);call write~int(main_#t~nondet11, main_~numbers~0.base, main_~numbers~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet11; 311#L536-2 main_#t~post10 := main_~i~1;main_~i~1 := 1 + main_#t~post10;havoc main_#t~post10; 319#L536-3 assume !(main_~i~1 < main_~array_size~0); 312#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; 307#L515-3 [2020-11-28 03:04:18,101 INFO L796 eck$LassoCheckResult]: Loop: 307#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; 303#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); 304#L521 assume SelectionSort_#t~mem4 < SelectionSort_#t~mem5;havoc SelectionSort_#t~mem4;havoc SelectionSort_#t~mem5;SelectionSort_~min~0 := SelectionSort_~j~0; 315#L519-2 SelectionSort_#t~pre3 := 1 + SelectionSort_~j~0;SelectionSort_~j~0 := 1 + SelectionSort_~j~0;havoc SelectionSort_#t~pre3; 318#L519-3 assume !(SelectionSort_~j~0 < SelectionSort_~array_size); 305#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); 306#L515-2 SelectionSort_#t~pre2 := 1 + SelectionSort_~i~0;SelectionSort_~i~0 := 1 + SelectionSort_~i~0;havoc SelectionSort_#t~pre2; 307#L515-3 [2020-11-28 03:04:18,101 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-28 03:04:18,101 INFO L82 PathProgramCache]: Analyzing trace with hash -1899756335, now seen corresponding path program 2 times [2020-11-28 03:04:18,102 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-28 03:04:18,102 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [216177414] [2020-11-28 03:04:18,102 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-28 03:04:18,114 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-11-28 03:04:18,114 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-11-28 03:04:18,134 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-11-28 03:04:18,134 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-11-28 03:04:18,139 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-11-28 03:04:18,140 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-28 03:04:18,140 INFO L82 PathProgramCache]: Analyzing trace with hash 347385690, now seen corresponding path program 3 times [2020-11-28 03:04:18,140 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-28 03:04:18,140 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1074530285] [2020-11-28 03:04:18,141 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-28 03:04:18,153 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-11-28 03:04:18,153 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-11-28 03:04:18,166 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-11-28 03:04:18,166 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-11-28 03:04:18,170 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-11-28 03:04:18,170 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-28 03:04:18,170 INFO L82 PathProgramCache]: Analyzing trace with hash 219717770, now seen corresponding path program 2 times [2020-11-28 03:04:18,171 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-28 03:04:18,171 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1240434820] [2020-11-28 03:04:18,171 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-28 03:04:18,229 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-11-28 03:04:18,229 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-11-28 03:04:18,259 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-11-28 03:04:18,260 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-11-28 03:04:18,266 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-11-28 03:04:18,445 WARN L193 SmtUtils]: Spent 176.00 ms on a formula simplification. DAG size of input: 75 DAG size of output: 60 [2020-11-28 03:04:18,878 WARN L193 SmtUtils]: Spent 361.00 ms on a formula simplification. DAG size of input: 98 DAG size of output: 77 [2020-11-28 03:04:18,997 INFO L210 LassoAnalysis]: Preferences: [2020-11-28 03:04:18,997 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2020-11-28 03:04:18,998 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2020-11-28 03:04:18,998 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2020-11-28 03:04:18,998 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2020-11-28 03:04:18,998 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-11-28 03:04:18,998 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2020-11-28 03:04:18,998 INFO L132 ssoRankerPreferences]: Path of dumped script: [2020-11-28 03:04:18,998 INFO L133 ssoRankerPreferences]: Filename of dumped script: selectionsort-alloca-1.i_Iteration5_Lasso [2020-11-28 03:04:18,998 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2020-11-28 03:04:18,998 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2020-11-28 03:04:19,004 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-11-28 03:04:19,010 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-11-28 03:04:19,019 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-11-28 03:04:19,023 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-11-28 03:04:19,028 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-11-28 03:04:19,255 WARN L193 SmtUtils]: Spent 187.00 ms on a formula simplification. DAG size of input: 48 DAG size of output: 45 [2020-11-28 03:04:19,394 WARN L193 SmtUtils]: Spent 115.00 ms on a formula simplification. DAG size of input: 44 DAG size of output: 39 [2020-11-28 03:04:19,395 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-11-28 03:04:19,398 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-11-28 03:04:19,402 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-11-28 03:04:19,406 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-11-28 03:04:19,409 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-11-28 03:04:19,412 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-11-28 03:04:19,416 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-11-28 03:04:19,419 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-11-28 03:04:19,423 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-11-28 03:04:19,441 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-11-28 03:04:19,446 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-11-28 03:04:19,726 WARN L193 SmtUtils]: Spent 161.00 ms on a formula simplification. DAG size of input: 39 DAG size of output: 38 [2020-11-28 03:04:20,004 WARN L193 SmtUtils]: Spent 113.00 ms on a formula simplification that was a NOOP. DAG size: 38 [2020-11-28 03:04:20,093 INFO L292 LassoAnalysis]: Preprocessing complete. [2020-11-28 03:04:20,094 INFO L489 LassoAnalysis]: Using template 'affine'. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_f3b23108-7052-4c58-a573-90c15f01a784/bin/uautomizer/z3 Starting monitored process 10 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 10 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-11-28 03:04:20,128 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 [2020-11-28 03:04:20,131 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-11-28 03:04:20,131 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-11-28 03:04:20,131 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-11-28 03:04:20,132 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-11-28 03:04:20,132 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-11-28 03:04:20,132 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-11-28 03:04:20,132 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-11-28 03:04:20,134 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_f3b23108-7052-4c58-a573-90c15f01a784/bin/uautomizer/z3 Starting monitored process 11 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 11 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-11-28 03:04:20,166 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 [2020-11-28 03:04:20,168 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-11-28 03:04:20,168 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-11-28 03:04:20,168 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-11-28 03:04:20,168 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-11-28 03:04:20,172 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-11-28 03:04:20,172 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-11-28 03:04:20,195 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_f3b23108-7052-4c58-a573-90c15f01a784/bin/uautomizer/z3 Starting monitored process 12 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2020-11-28 03:04:20,247 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-11-28 03:04:20,249 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-11-28 03:04:20,250 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-11-28 03:04:20,250 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-11-28 03:04:20,250 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-11-28 03:04:20,250 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-11-28 03:04:20,251 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-11-28 03:04:20,251 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. Waiting until toolchain timeout for monitored process 12 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-11-28 03:04:20,253 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_f3b23108-7052-4c58-a573-90c15f01a784/bin/uautomizer/z3 Starting monitored process 13 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 13 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-11-28 03:04:20,307 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 [2020-11-28 03:04:20,309 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-11-28 03:04:20,309 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-11-28 03:04:20,310 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-11-28 03:04:20,310 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-11-28 03:04:20,315 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-11-28 03:04:20,316 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-11-28 03:04:20,320 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_f3b23108-7052-4c58-a573-90c15f01a784/bin/uautomizer/z3 Starting monitored process 14 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2020-11-28 03:04:20,377 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 [2020-11-28 03:04:20,379 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-11-28 03:04:20,380 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-11-28 03:04:20,380 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-11-28 03:04:20,380 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. Waiting until toolchain timeout for monitored process 14 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-11-28 03:04:20,392 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-11-28 03:04:20,392 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-11-28 03:04:20,401 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_f3b23108-7052-4c58-a573-90c15f01a784/bin/uautomizer/z3 Starting monitored process 15 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 15 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-11-28 03:04:20,455 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 [2020-11-28 03:04:20,457 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-11-28 03:04:20,458 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-11-28 03:04:20,458 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-11-28 03:04:20,458 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-11-28 03:04:20,464 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-11-28 03:04:20,464 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-11-28 03:04:20,471 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_f3b23108-7052-4c58-a573-90c15f01a784/bin/uautomizer/z3 Starting monitored process 16 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 16 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-11-28 03:04:20,524 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 [2020-11-28 03:04:20,525 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-11-28 03:04:20,526 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-11-28 03:04:20,526 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-11-28 03:04:20,526 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-11-28 03:04:20,529 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-11-28 03:04:20,529 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-11-28 03:04:20,534 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_f3b23108-7052-4c58-a573-90c15f01a784/bin/uautomizer/z3 Starting monitored process 17 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2020-11-28 03:04:20,599 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 [2020-11-28 03:04:20,603 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-11-28 03:04:20,603 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-11-28 03:04:20,603 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-11-28 03:04:20,603 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. Waiting until toolchain timeout for monitored process 17 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-11-28 03:04:20,630 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-11-28 03:04:20,631 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-11-28 03:04:20,656 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2020-11-28 03:04:20,713 INFO L443 ModelExtractionUtils]: Simplification made 12 calls to the SMT solver. [2020-11-28 03:04:20,713 INFO L444 ModelExtractionUtils]: 25 out of 43 variables were initially zero. Simplification set additionally 15 variables to zero. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_f3b23108-7052-4c58-a573-90c15f01a784/bin/uautomizer/z3 Starting monitored process 18 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 18 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-11-28 03:04:20,719 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2020-11-28 03:04:20,724 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2020-11-28 03:04:20,725 INFO L510 LassoAnalysis]: Proved termination. [2020-11-28 03:04:20,725 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 [] [2020-11-28 03:04:20,782 INFO L297 tatePredicateManager]: 3 out of 3 supporting invariants were superfluous and have been removed [2020-11-28 03:04:20,809 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-28 03:04:20,839 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-28 03:04:20,840 INFO L263 TraceCheckSpWp]: Trace formula consists of 57 conjuncts, 2 conjunts are in the unsatisfiable core [2020-11-28 03:04:20,842 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-11-28 03:04:20,865 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-28 03:04:20,866 INFO L263 TraceCheckSpWp]: Trace formula consists of 35 conjuncts, 4 conjunts are in the unsatisfiable core [2020-11-28 03:04:20,868 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-11-28 03:04:20,889 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2020-11-28 03:04:20,890 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 [2020-11-28 03:04:20,890 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 17 states and 20 transitions. cyclomatic complexity: 5 Second operand 3 states. [2020-11-28 03:04:20,921 INFO L75 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. [2020-11-28 03:04:20,921 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 3 states 1 stem states 1 non-accepting loop states 1 accepting loop states [2020-11-28 03:04:20,921 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-11-28 03:04:20,922 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 16 transitions. [2020-11-28 03:04:20,922 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 16 transitions. Stem has 10 letters. Loop has 7 letters. [2020-11-28 03:04:20,922 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-11-28 03:04:20,923 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 16 transitions. Stem has 17 letters. Loop has 7 letters. [2020-11-28 03:04:20,923 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-11-28 03:04:20,923 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 16 transitions. Stem has 10 letters. Loop has 14 letters. [2020-11-28 03:04:20,924 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-11-28 03:04:20,924 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 24 states and 30 transitions. [2020-11-28 03:04:20,925 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2020-11-28 03:04:20,926 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 24 states to 22 states and 28 transitions. [2020-11-28 03:04:20,926 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 10 [2020-11-28 03:04:20,926 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 11 [2020-11-28 03:04:20,926 INFO L73 IsDeterministic]: Start isDeterministic. Operand 22 states and 28 transitions. [2020-11-28 03:04:20,926 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2020-11-28 03:04:20,927 INFO L691 BuchiCegarLoop]: Abstraction has 22 states and 28 transitions. [2020-11-28 03:04:20,927 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22 states and 28 transitions. [2020-11-28 03:04:20,928 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22 to 21. [2020-11-28 03:04:20,929 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2020-11-28 03:04:20,929 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 27 transitions. [2020-11-28 03:04:20,929 INFO L714 BuchiCegarLoop]: Abstraction has 21 states and 27 transitions. [2020-11-28 03:04:20,930 INFO L594 BuchiCegarLoop]: Abstraction has 21 states and 27 transitions. [2020-11-28 03:04:20,930 INFO L427 BuchiCegarLoop]: ======== Iteration 6============ [2020-11-28 03:04:20,930 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 21 states and 27 transitions. [2020-11-28 03:04:20,930 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2020-11-28 03:04:20,933 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-11-28 03:04:20,933 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-11-28 03:04:20,934 INFO L852 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 1, 1, 1, 1, 1, 1, 1] [2020-11-28 03:04:20,934 INFO L853 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2020-11-28 03:04:20,934 INFO L794 eck$LassoCheckResult]: Stem: 444#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; 439#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; 440#L531 assume !(main_~array_size~0 < 1 || main_~array_size~0 >= 536870911); 445#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; 437#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; 434#L536-2 main_#t~post10 := main_~i~1;main_~i~1 := 1 + main_#t~post10;havoc main_#t~post10; 435#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; 438#L536-2 main_#t~post10 := main_~i~1;main_~i~1 := 1 + main_#t~post10;havoc main_#t~post10; 447#L536-3 assume !(main_~i~1 < main_~array_size~0); 441#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; 436#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; 427#L519-3 [2020-11-28 03:04:20,934 INFO L796 eck$LassoCheckResult]: Loop: 427#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); 428#L521 assume SelectionSort_#t~mem4 < SelectionSort_#t~mem5;havoc SelectionSort_#t~mem4;havoc SelectionSort_#t~mem5;SelectionSort_~min~0 := SelectionSort_~j~0; 442#L519-2 SelectionSort_#t~pre3 := 1 + SelectionSort_~j~0;SelectionSort_~j~0 := 1 + SelectionSort_~j~0;havoc SelectionSort_#t~pre3; 427#L519-3 [2020-11-28 03:04:20,935 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-28 03:04:20,935 INFO L82 PathProgramCache]: Analyzing trace with hash 1237095790, now seen corresponding path program 1 times [2020-11-28 03:04:20,935 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-28 03:04:20,935 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [609720088] [2020-11-28 03:04:20,936 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-28 03:04:20,965 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-11-28 03:04:20,967 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-11-28 03:04:20,987 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-11-28 03:04:20,989 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-11-28 03:04:20,993 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-11-28 03:04:20,996 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-28 03:04:20,996 INFO L82 PathProgramCache]: Analyzing trace with hash 68618, now seen corresponding path program 1 times [2020-11-28 03:04:20,996 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-28 03:04:20,997 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [402888145] [2020-11-28 03:04:20,997 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-28 03:04:21,001 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-11-28 03:04:21,006 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-11-28 03:04:21,010 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-11-28 03:04:21,011 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-11-28 03:04:21,013 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-11-28 03:04:21,014 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-28 03:04:21,014 INFO L82 PathProgramCache]: Analyzing trace with hash -793648259, now seen corresponding path program 1 times [2020-11-28 03:04:21,014 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-28 03:04:21,015 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1885606521] [2020-11-28 03:04:21,015 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-28 03:04:21,040 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-11-28 03:04:21,040 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-11-28 03:04:21,063 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-11-28 03:04:21,069 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-11-28 03:04:21,077 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-11-28 03:04:21,476 WARN L193 SmtUtils]: Spent 313.00 ms on a formula simplification. DAG size of input: 104 DAG size of output: 85 [2020-11-28 03:04:21,579 INFO L210 LassoAnalysis]: Preferences: [2020-11-28 03:04:21,579 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2020-11-28 03:04:21,579 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2020-11-28 03:04:21,579 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2020-11-28 03:04:21,579 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2020-11-28 03:04:21,579 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-11-28 03:04:21,579 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2020-11-28 03:04:21,579 INFO L132 ssoRankerPreferences]: Path of dumped script: [2020-11-28 03:04:21,579 INFO L133 ssoRankerPreferences]: Filename of dumped script: selectionsort-alloca-1.i_Iteration6_Lasso [2020-11-28 03:04:21,580 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2020-11-28 03:04:21,580 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2020-11-28 03:04:21,584 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-11-28 03:04:21,595 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-11-28 03:04:21,599 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-11-28 03:04:21,603 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-11-28 03:04:21,606 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-11-28 03:04:21,837 WARN L193 SmtUtils]: Spent 148.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 54 [2020-11-28 03:04:21,930 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-11-28 03:04:21,951 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-11-28 03:04:21,954 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-11-28 03:04:21,958 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-11-28 03:04:21,996 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-11-28 03:04:22,006 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-11-28 03:04:22,011 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-11-28 03:04:22,015 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-11-28 03:04:22,018 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-11-28 03:04:22,028 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-11-28 03:04:22,032 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-11-28 03:04:22,036 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-11-28 03:04:22,317 WARN L193 SmtUtils]: Spent 230.00 ms on a formula simplification. DAG size of input: 51 DAG size of output: 48 [2020-11-28 03:04:22,764 INFO L292 LassoAnalysis]: Preprocessing complete. [2020-11-28 03:04:22,773 INFO L489 LassoAnalysis]: Using template 'affine'. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_f3b23108-7052-4c58-a573-90c15f01a784/bin/uautomizer/z3 Starting monitored process 19 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 19 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-11-28 03:04:22,778 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 [2020-11-28 03:04:22,785 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-11-28 03:04:22,785 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-11-28 03:04:22,785 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-11-28 03:04:22,785 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-11-28 03:04:22,785 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-11-28 03:04:22,787 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-11-28 03:04:22,787 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-11-28 03:04:22,789 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_f3b23108-7052-4c58-a573-90c15f01a784/bin/uautomizer/z3 Starting monitored process 20 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 20 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-11-28 03:04:22,834 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 [2020-11-28 03:04:22,836 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-11-28 03:04:22,836 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-11-28 03:04:22,836 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-11-28 03:04:22,836 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-11-28 03:04:22,836 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-11-28 03:04:22,837 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-11-28 03:04:22,837 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-11-28 03:04:22,838 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_f3b23108-7052-4c58-a573-90c15f01a784/bin/uautomizer/z3 Starting monitored process 21 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 21 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-11-28 03:04:22,871 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 [2020-11-28 03:04:22,873 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-11-28 03:04:22,873 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-11-28 03:04:22,873 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-11-28 03:04:22,873 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-11-28 03:04:22,875 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-11-28 03:04:22,876 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-11-28 03:04:22,883 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_f3b23108-7052-4c58-a573-90c15f01a784/bin/uautomizer/z3 Starting monitored process 22 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 22 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-11-28 03:04:22,923 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 [2020-11-28 03:04:22,925 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-11-28 03:04:22,925 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-11-28 03:04:22,926 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-11-28 03:04:22,926 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-11-28 03:04:22,926 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-11-28 03:04:22,927 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-11-28 03:04:22,927 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-11-28 03:04:22,929 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_f3b23108-7052-4c58-a573-90c15f01a784/bin/uautomizer/z3 Starting monitored process 23 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 23 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-11-28 03:04:22,957 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 [2020-11-28 03:04:22,960 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-11-28 03:04:22,960 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-11-28 03:04:22,960 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-11-28 03:04:22,960 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-11-28 03:04:22,982 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-11-28 03:04:22,982 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-11-28 03:04:23,012 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2020-11-28 03:04:23,097 INFO L443 ModelExtractionUtils]: Simplification made 18 calls to the SMT solver. [2020-11-28 03:04:23,097 INFO L444 ModelExtractionUtils]: 30 out of 46 variables were initially zero. Simplification set additionally 13 variables to zero. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_f3b23108-7052-4c58-a573-90c15f01a784/bin/uautomizer/z3 Starting monitored process 24 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2020-11-28 03:04:23,101 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... Waiting until toolchain timeout for monitored process 24 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-11-28 03:04:23,105 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2020-11-28 03:04:23,105 INFO L510 LassoAnalysis]: Proved termination. [2020-11-28 03:04:23,105 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 [] [2020-11-28 03:04:23,166 INFO L297 tatePredicateManager]: 6 out of 6 supporting invariants were superfluous and have been removed [2020-11-28 03:04:23,187 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-28 03:04:23,218 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-28 03:04:23,219 INFO L263 TraceCheckSpWp]: Trace formula consists of 62 conjuncts, 2 conjunts are in the unsatisfiable core [2020-11-28 03:04:23,220 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-11-28 03:04:23,245 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-28 03:04:23,245 INFO L263 TraceCheckSpWp]: Trace formula consists of 18 conjuncts, 4 conjunts are in the unsatisfiable core [2020-11-28 03:04:23,246 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-11-28 03:04:23,261 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-28 03:04:23,262 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 [2020-11-28 03:04:23,262 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 21 states and 27 transitions. cyclomatic complexity: 9 Second operand 3 states. [2020-11-28 03:04:23,300 INFO L75 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. [2020-11-28 03:04:23,302 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2020-11-28 03:04:23,302 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-11-28 03:04:23,303 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 16 transitions. [2020-11-28 03:04:23,303 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 16 transitions. Stem has 11 letters. Loop has 3 letters. [2020-11-28 03:04:23,303 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-11-28 03:04:23,303 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 16 transitions. Stem has 14 letters. Loop has 3 letters. [2020-11-28 03:04:23,303 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-11-28 03:04:23,303 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 16 transitions. Stem has 11 letters. Loop has 6 letters. [2020-11-28 03:04:23,304 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-11-28 03:04:23,305 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 39 states and 53 transitions. [2020-11-28 03:04:23,306 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2020-11-28 03:04:23,307 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 39 states to 28 states and 36 transitions. [2020-11-28 03:04:23,308 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 10 [2020-11-28 03:04:23,308 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 10 [2020-11-28 03:04:23,308 INFO L73 IsDeterministic]: Start isDeterministic. Operand 28 states and 36 transitions. [2020-11-28 03:04:23,308 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2020-11-28 03:04:23,308 INFO L691 BuchiCegarLoop]: Abstraction has 28 states and 36 transitions. [2020-11-28 03:04:23,308 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states and 36 transitions. [2020-11-28 03:04:23,310 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 21. [2020-11-28 03:04:23,310 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2020-11-28 03:04:23,311 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 26 transitions. [2020-11-28 03:04:23,311 INFO L714 BuchiCegarLoop]: Abstraction has 21 states and 26 transitions. [2020-11-28 03:04:23,312 INFO L594 BuchiCegarLoop]: Abstraction has 21 states and 26 transitions. [2020-11-28 03:04:23,312 INFO L427 BuchiCegarLoop]: ======== Iteration 7============ [2020-11-28 03:04:23,312 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 21 states and 26 transitions. [2020-11-28 03:04:23,313 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2020-11-28 03:04:23,313 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-11-28 03:04:23,313 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-11-28 03:04:23,314 INFO L852 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-28 03:04:23,314 INFO L853 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2020-11-28 03:04:23,315 INFO L794 eck$LassoCheckResult]: Stem: 594#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; 589#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; 590#L531 assume !(main_~array_size~0 < 1 || main_~array_size~0 >= 536870911); 595#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; 587#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; 584#L536-2 main_#t~post10 := main_~i~1;main_~i~1 := 1 + main_#t~post10;havoc main_#t~post10; 585#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; 588#L536-2 main_#t~post10 := main_~i~1;main_~i~1 := 1 + main_#t~post10;havoc main_#t~post10; 597#L536-3 assume !(main_~i~1 < main_~array_size~0); 591#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; 586#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; 579#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); 580#L521 assume !(SelectionSort_#t~mem4 < SelectionSort_#t~mem5);havoc SelectionSort_#t~mem4;havoc SelectionSort_#t~mem5; 593#L519-2 SelectionSort_#t~pre3 := 1 + SelectionSort_~j~0;SelectionSort_~j~0 := 1 + SelectionSort_~j~0;havoc SelectionSort_#t~pre3; 596#L519-3 assume !(SelectionSort_~j~0 < SelectionSort_~array_size); 581#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); 582#L515-2 SelectionSort_#t~pre2 := 1 + SelectionSort_~i~0;SelectionSort_~i~0 := 1 + SelectionSort_~i~0;havoc SelectionSort_#t~pre2; 583#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; 577#L519-3 [2020-11-28 03:04:23,315 INFO L796 eck$LassoCheckResult]: Loop: 577#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); 578#L521 assume SelectionSort_#t~mem4 < SelectionSort_#t~mem5;havoc SelectionSort_#t~mem4;havoc SelectionSort_#t~mem5;SelectionSort_~min~0 := SelectionSort_~j~0; 592#L519-2 SelectionSort_#t~pre3 := 1 + SelectionSort_~j~0;SelectionSort_~j~0 := 1 + SelectionSort_~j~0;havoc SelectionSort_#t~pre3; 577#L519-3 [2020-11-28 03:04:23,315 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-28 03:04:23,315 INFO L82 PathProgramCache]: Analyzing trace with hash -1721425389, now seen corresponding path program 1 times [2020-11-28 03:04:23,316 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-28 03:04:23,316 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2077397627] [2020-11-28 03:04:23,316 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-28 03:04:23,328 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-28 03:04:23,397 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2020-11-28 03:04:23,397 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2077397627] [2020-11-28 03:04:23,397 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1250831630] [2020-11-28 03:04:23,397 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_f3b23108-7052-4c58-a573-90c15f01a784/bin/uautomizer/z3 Starting monitored process 25 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 25 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-11-28 03:04:23,467 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-28 03:04:23,469 INFO L263 TraceCheckSpWp]: Trace formula consists of 93 conjuncts, 9 conjunts are in the unsatisfiable core [2020-11-28 03:04:23,470 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-11-28 03:04:23,569 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 4 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2020-11-28 03:04:23,570 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-11-28 03:04:23,570 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 10 [2020-11-28 03:04:23,570 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1011069502] [2020-11-28 03:04:23,570 INFO L799 eck$LassoCheckResult]: stem already infeasible [2020-11-28 03:04:23,571 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-28 03:04:23,571 INFO L82 PathProgramCache]: Analyzing trace with hash 68618, now seen corresponding path program 2 times [2020-11-28 03:04:23,571 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-28 03:04:23,571 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1314704978] [2020-11-28 03:04:23,571 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-28 03:04:23,576 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-11-28 03:04:23,577 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-11-28 03:04:23,579 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-11-28 03:04:23,580 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-11-28 03:04:23,581 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-11-28 03:04:23,639 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-28 03:04:23,640 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-11-28 03:04:23,640 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=82, Unknown=0, NotChecked=0, Total=110 [2020-11-28 03:04:23,640 INFO L87 Difference]: Start difference. First operand 21 states and 26 transitions. cyclomatic complexity: 8 Second operand 11 states. [2020-11-28 03:04:23,796 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-28 03:04:23,796 INFO L93 Difference]: Finished difference Result 33 states and 40 transitions. [2020-11-28 03:04:23,796 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-11-28 03:04:23,796 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 33 states and 40 transitions. [2020-11-28 03:04:23,797 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2020-11-28 03:04:23,798 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 33 states to 24 states and 29 transitions. [2020-11-28 03:04:23,798 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 10 [2020-11-28 03:04:23,798 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 10 [2020-11-28 03:04:23,798 INFO L73 IsDeterministic]: Start isDeterministic. Operand 24 states and 29 transitions. [2020-11-28 03:04:23,799 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2020-11-28 03:04:23,799 INFO L691 BuchiCegarLoop]: Abstraction has 24 states and 29 transitions. [2020-11-28 03:04:23,799 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states and 29 transitions. [2020-11-28 03:04:23,801 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 23. [2020-11-28 03:04:23,801 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23 states. [2020-11-28 03:04:23,801 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 28 transitions. [2020-11-28 03:04:23,801 INFO L714 BuchiCegarLoop]: Abstraction has 23 states and 28 transitions. [2020-11-28 03:04:23,802 INFO L594 BuchiCegarLoop]: Abstraction has 23 states and 28 transitions. [2020-11-28 03:04:23,802 INFO L427 BuchiCegarLoop]: ======== Iteration 8============ [2020-11-28 03:04:23,802 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 23 states and 28 transitions. [2020-11-28 03:04:23,802 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2020-11-28 03:04:23,802 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-11-28 03:04:23,803 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-11-28 03:04:23,803 INFO L852 BuchiCegarLoop]: Counterexample stem histogram [3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-28 03:04:23,803 INFO L853 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2020-11-28 03:04:23,804 INFO L794 eck$LassoCheckResult]: Stem: 720#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; 716#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; 717#L531 assume !(main_~array_size~0 < 1 || main_~array_size~0 >= 536870911); 721#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; 712#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; 713#L536-2 main_#t~post10 := main_~i~1;main_~i~1 := 1 + main_#t~post10;havoc main_#t~post10; 714#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; 709#L536-2 main_#t~post10 := main_~i~1;main_~i~1 := 1 + main_#t~post10;havoc main_#t~post10; 710#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; 724#L536-2 main_#t~post10 := main_~i~1;main_~i~1 := 1 + main_#t~post10;havoc main_#t~post10; 723#L536-3 assume !(main_~i~1 < main_~array_size~0); 715#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; 711#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; 704#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); 705#L521 assume !(SelectionSort_#t~mem4 < SelectionSort_#t~mem5);havoc SelectionSort_#t~mem4;havoc SelectionSort_#t~mem5; 719#L519-2 SelectionSort_#t~pre3 := 1 + SelectionSort_~j~0;SelectionSort_~j~0 := 1 + SelectionSort_~j~0;havoc SelectionSort_#t~pre3; 722#L519-3 assume !(SelectionSort_~j~0 < SelectionSort_~array_size); 706#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); 707#L515-2 SelectionSort_#t~pre2 := 1 + SelectionSort_~i~0;SelectionSort_~i~0 := 1 + SelectionSort_~i~0;havoc SelectionSort_#t~pre2; 708#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; 702#L519-3 [2020-11-28 03:04:23,804 INFO L796 eck$LassoCheckResult]: Loop: 702#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); 703#L521 assume SelectionSort_#t~mem4 < SelectionSort_#t~mem5;havoc SelectionSort_#t~mem4;havoc SelectionSort_#t~mem5;SelectionSort_~min~0 := SelectionSort_~j~0; 718#L519-2 SelectionSort_#t~pre3 := 1 + SelectionSort_~j~0;SelectionSort_~j~0 := 1 + SelectionSort_~j~0;havoc SelectionSort_#t~pre3; 702#L519-3 [2020-11-28 03:04:23,804 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-28 03:04:23,804 INFO L82 PathProgramCache]: Analyzing trace with hash 1519356789, now seen corresponding path program 2 times [2020-11-28 03:04:23,804 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-28 03:04:23,805 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1897334813] [2020-11-28 03:04:23,805 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-28 03:04:23,816 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-28 03:04:23,942 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 2 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-28 03:04:23,943 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1897334813] [2020-11-28 03:04:23,943 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [882398382] [2020-11-28 03:04:23,943 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_f3b23108-7052-4c58-a573-90c15f01a784/bin/uautomizer/z3 Starting monitored process 26 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 26 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-11-28 03:04:24,086 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2020-11-28 03:04:24,087 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-11-28 03:04:24,088 INFO L263 TraceCheckSpWp]: Trace formula consists of 101 conjuncts, 10 conjunts are in the unsatisfiable core [2020-11-28 03:04:24,089 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-11-28 03:04:24,209 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 5 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-28 03:04:24,209 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-11-28 03:04:24,209 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 13 [2020-11-28 03:04:24,210 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1968947845] [2020-11-28 03:04:24,210 INFO L799 eck$LassoCheckResult]: stem already infeasible [2020-11-28 03:04:24,210 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-28 03:04:24,210 INFO L82 PathProgramCache]: Analyzing trace with hash 68618, now seen corresponding path program 3 times [2020-11-28 03:04:24,211 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-28 03:04:24,211 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1190425157] [2020-11-28 03:04:24,211 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-28 03:04:24,215 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-11-28 03:04:24,216 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-11-28 03:04:24,219 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-11-28 03:04:24,219 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-11-28 03:04:24,221 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-11-28 03:04:24,277 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-28 03:04:24,277 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2020-11-28 03:04:24,277 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=123, Unknown=0, NotChecked=0, Total=156 [2020-11-28 03:04:24,277 INFO L87 Difference]: Start difference. First operand 23 states and 28 transitions. cyclomatic complexity: 8 Second operand 13 states. [2020-11-28 03:04:24,540 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-28 03:04:24,541 INFO L93 Difference]: Finished difference Result 35 states and 44 transitions. [2020-11-28 03:04:24,541 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-11-28 03:04:24,541 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 35 states and 44 transitions. [2020-11-28 03:04:24,542 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2020-11-28 03:04:24,543 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 35 states to 35 states and 44 transitions. [2020-11-28 03:04:24,543 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 11 [2020-11-28 03:04:24,543 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 11 [2020-11-28 03:04:24,544 INFO L73 IsDeterministic]: Start isDeterministic. Operand 35 states and 44 transitions. [2020-11-28 03:04:24,544 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2020-11-28 03:04:24,544 INFO L691 BuchiCegarLoop]: Abstraction has 35 states and 44 transitions. [2020-11-28 03:04:24,544 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states and 44 transitions. [2020-11-28 03:04:24,546 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 26. [2020-11-28 03:04:24,546 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26 states. [2020-11-28 03:04:24,547 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 32 transitions. [2020-11-28 03:04:24,547 INFO L714 BuchiCegarLoop]: Abstraction has 26 states and 32 transitions. [2020-11-28 03:04:24,547 INFO L594 BuchiCegarLoop]: Abstraction has 26 states and 32 transitions. [2020-11-28 03:04:24,547 INFO L427 BuchiCegarLoop]: ======== Iteration 9============ [2020-11-28 03:04:24,547 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 26 states and 32 transitions. [2020-11-28 03:04:24,551 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2020-11-28 03:04:24,551 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-11-28 03:04:24,551 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-11-28 03:04:24,552 INFO L852 BuchiCegarLoop]: Counterexample stem histogram [3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-28 03:04:24,552 INFO L853 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2020-11-28 03:04:24,553 INFO L794 eck$LassoCheckResult]: Stem: 864#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; 859#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; 860#L531 assume !(main_~array_size~0 < 1 || main_~array_size~0 >= 536870911); 865#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; 856#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; 857#L536-2 main_#t~post10 := main_~i~1;main_~i~1 := 1 + main_#t~post10;havoc main_#t~post10; 858#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; 852#L536-2 main_#t~post10 := main_~i~1;main_~i~1 := 1 + main_#t~post10;havoc main_#t~post10; 853#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; 868#L536-2 main_#t~post10 := main_~i~1;main_~i~1 := 1 + main_#t~post10;havoc main_#t~post10; 867#L536-3 assume !(main_~i~1 < main_~array_size~0); 861#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; 854#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; 855#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); 870#L521 assume !(SelectionSort_#t~mem4 < SelectionSort_#t~mem5);havoc SelectionSort_#t~mem4;havoc SelectionSort_#t~mem5; 866#L519-2 SelectionSort_#t~pre3 := 1 + SelectionSort_~j~0;SelectionSort_~j~0 := 1 + SelectionSort_~j~0;havoc SelectionSort_#t~pre3; 847#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); 848#L521 assume !(SelectionSort_#t~mem4 < SelectionSort_#t~mem5);havoc SelectionSort_#t~mem4;havoc SelectionSort_#t~mem5; 863#L519-2 SelectionSort_#t~pre3 := 1 + SelectionSort_~j~0;SelectionSort_~j~0 := 1 + SelectionSort_~j~0;havoc SelectionSort_#t~pre3; 869#L519-3 assume !(SelectionSort_~j~0 < SelectionSort_~array_size); 849#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); 850#L515-2 SelectionSort_#t~pre2 := 1 + SelectionSort_~i~0;SelectionSort_~i~0 := 1 + SelectionSort_~i~0;havoc SelectionSort_#t~pre2; 851#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; 845#L519-3 [2020-11-28 03:04:24,553 INFO L796 eck$LassoCheckResult]: Loop: 845#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); 846#L521 assume SelectionSort_#t~mem4 < SelectionSort_#t~mem5;havoc SelectionSort_#t~mem4;havoc SelectionSort_#t~mem5;SelectionSort_~min~0 := SelectionSort_~j~0; 862#L519-2 SelectionSort_#t~pre3 := 1 + SelectionSort_~j~0;SelectionSort_~j~0 := 1 + SelectionSort_~j~0;havoc SelectionSort_#t~pre3; 845#L519-3 [2020-11-28 03:04:24,553 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-28 03:04:24,554 INFO L82 PathProgramCache]: Analyzing trace with hash 95688324, now seen corresponding path program 3 times [2020-11-28 03:04:24,554 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-28 03:04:24,554 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1499473407] [2020-11-28 03:04:24,554 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-28 03:04:24,573 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-11-28 03:04:24,574 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-11-28 03:04:24,592 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-11-28 03:04:24,593 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-11-28 03:04:24,599 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-11-28 03:04:24,599 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-28 03:04:24,600 INFO L82 PathProgramCache]: Analyzing trace with hash 68618, now seen corresponding path program 4 times [2020-11-28 03:04:24,600 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-28 03:04:24,600 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [909231616] [2020-11-28 03:04:24,600 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-28 03:04:24,604 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-11-28 03:04:24,604 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-11-28 03:04:24,607 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-11-28 03:04:24,607 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-11-28 03:04:24,609 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-11-28 03:04:24,609 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-28 03:04:24,609 INFO L82 PathProgramCache]: Analyzing trace with hash -1207385433, now seen corresponding path program 1 times [2020-11-28 03:04:24,610 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-28 03:04:24,610 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1509019749] [2020-11-28 03:04:24,610 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-28 03:04:24,630 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-11-28 03:04:24,630 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-11-28 03:04:24,661 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-11-28 03:04:24,665 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-11-28 03:04:24,673 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-11-28 03:04:25,942 WARN L193 SmtUtils]: Spent 1.15 s on a formula simplification. DAG size of input: 194 DAG size of output: 145 [2020-11-28 03:04:26,299 WARN L193 SmtUtils]: Spent 307.00 ms on a formula simplification that was a NOOP. DAG size: 98 [2020-11-28 03:04:26,302 INFO L210 LassoAnalysis]: Preferences: [2020-11-28 03:04:26,302 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2020-11-28 03:04:26,302 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2020-11-28 03:04:26,302 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2020-11-28 03:04:26,302 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2020-11-28 03:04:26,302 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-11-28 03:04:26,302 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2020-11-28 03:04:26,303 INFO L132 ssoRankerPreferences]: Path of dumped script: [2020-11-28 03:04:26,303 INFO L133 ssoRankerPreferences]: Filename of dumped script: selectionsort-alloca-1.i_Iteration9_Lasso [2020-11-28 03:04:26,303 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2020-11-28 03:04:26,303 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2020-11-28 03:04:26,307 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-11-28 03:04:26,419 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:612) at de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.LassoCheck.access$16(LassoCheck.java:539) at de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.LassoCheck$LassoCheckResult.checkLassoTermination(LassoCheck.java:957) at de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.LassoCheck$LassoCheckResult.(LassoCheck.java:865) at de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.LassoCheck.(LassoCheck.java:251) at de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiCegarLoop.iterate(BuchiCegarLoop.java:461) 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:382) 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:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2020-11-28 03:04:26,421 INFO L168 Benchmark]: Toolchain (without parser) took 14025.12 ms. Allocated memory was 83.9 MB in the beginning and 182.5 MB in the end (delta: 98.6 MB). Free memory was 54.7 MB in the beginning and 53.0 MB in the end (delta: 1.7 MB). Peak memory consumption was 101.9 MB. Max. memory is 16.1 GB. [2020-11-28 03:04:26,422 INFO L168 Benchmark]: CDTParser took 1.00 ms. Allocated memory is still 83.9 MB. Free memory was 41.1 MB in the beginning and 41.0 MB in the end (delta: 75.6 kB). There was no memory consumed. Max. memory is 16.1 GB. [2020-11-28 03:04:26,423 INFO L168 Benchmark]: CACSL2BoogieTranslator took 683.03 ms. Allocated memory was 83.9 MB in the beginning and 102.8 MB in the end (delta: 18.9 MB). Free memory was 54.7 MB in the beginning and 69.0 MB in the end (delta: -14.3 MB). Peak memory consumption was 8.4 MB. Max. memory is 16.1 GB. [2020-11-28 03:04:26,423 INFO L168 Benchmark]: Boogie Procedure Inliner took 53.80 ms. Allocated memory is still 102.8 MB. Free memory was 69.0 MB in the beginning and 67.0 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. [2020-11-28 03:04:26,424 INFO L168 Benchmark]: Boogie Preprocessor took 33.23 ms. Allocated memory is still 102.8 MB. Free memory was 67.0 MB in the beginning and 66.1 MB in the end (delta: 946.6 kB). There was no memory consumed. Max. memory is 16.1 GB. [2020-11-28 03:04:26,424 INFO L168 Benchmark]: RCFGBuilder took 598.67 ms. Allocated memory is still 102.8 MB. Free memory was 65.7 MB in the beginning and 76.6 MB in the end (delta: -10.9 MB). Peak memory consumption was 14.1 MB. Max. memory is 16.1 GB. [2020-11-28 03:04:26,425 INFO L168 Benchmark]: BuchiAutomizer took 12643.64 ms. Allocated memory was 102.8 MB in the beginning and 182.5 MB in the end (delta: 79.7 MB). Free memory was 76.6 MB in the beginning and 53.0 MB in the end (delta: 23.6 MB). Peak memory consumption was 104.8 MB. Max. memory is 16.1 GB. [2020-11-28 03:04:26,428 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 1.00 ms. Allocated memory is still 83.9 MB. Free memory was 41.1 MB in the beginning and 41.0 MB in the end (delta: 75.6 kB). There was no memory consumed. Max. memory is 16.1 GB. * CACSL2BoogieTranslator took 683.03 ms. Allocated memory was 83.9 MB in the beginning and 102.8 MB in the end (delta: 18.9 MB). Free memory was 54.7 MB in the beginning and 69.0 MB in the end (delta: -14.3 MB). Peak memory consumption was 8.4 MB. Max. memory is 16.1 GB. * Boogie Procedure Inliner took 53.80 ms. Allocated memory is still 102.8 MB. Free memory was 69.0 MB in the beginning and 67.0 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. * Boogie Preprocessor took 33.23 ms. Allocated memory is still 102.8 MB. Free memory was 67.0 MB in the beginning and 66.1 MB in the end (delta: 946.6 kB). There was no memory consumed. Max. memory is 16.1 GB. * RCFGBuilder took 598.67 ms. Allocated memory is still 102.8 MB. Free memory was 65.7 MB in the beginning and 76.6 MB in the end (delta: -10.9 MB). Peak memory consumption was 14.1 MB. Max. memory is 16.1 GB. * BuchiAutomizer took 12643.64 ms. Allocated memory was 102.8 MB in the beginning and 182.5 MB in the end (delta: 79.7 MB). Free memory was 76.6 MB in the beginning and 53.0 MB in the end (delta: 23.6 MB). Peak memory consumption was 104.8 MB. Max. memory is 16.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResult: Unfinished Backtranslation unknown boogie variable #length * 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...