./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 6b5699aa Calling Ultimate with: /usr/lib/jvm/java-8-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/run_dir_e2c8543a-5ef0-41a9-9bfa-dfacdeeb282a/bin/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/run_dir_e2c8543a-5ef0-41a9-9bfa-dfacdeeb282a/bin/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/run_dir_e2c8543a-5ef0-41a9-9bfa-dfacdeeb282a/bin/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/run_dir_e2c8543a-5ef0-41a9-9bfa-dfacdeeb282a/bin/uautomizer/config/AutomizerTermination.xml -i ../../sv-benchmarks/c/array-memsafety/selectionsort-alloca-1.i -s /tmp/vcloud-vcloud-master/worker/run_dir_e2c8543a-5ef0-41a9-9bfa-dfacdeeb282a/bin/uautomizer/config/svcomp-Termination-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/run_dir_e2c8543a-5ef0-41a9-9bfa-dfacdeeb282a/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_e2c8543a-5ef0-41a9-9bfa-dfacdeeb282a/bin/uautomizer/config using search string *Termination*32bit*_Bitvector*.epf No suitable settings file found using Termination*32bit*_Bitvector ERROR: UNSUPPORTED PROPERTY Writing output log to file Ultimate.log Result: ERROR: ExceptionOrErrorResult: AssertionError: MapEliminator tries to combine Int and (Array Int Int) --- Real Ultimate output --- This is Ultimate 0.1.24-6b5699a [2019-11-25 08:50:51,450 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-25 08:50:51,452 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-25 08:50:51,466 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-25 08:50:51,467 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-25 08:50:51,468 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-25 08:50:51,470 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-25 08:50:51,478 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-25 08:50:51,482 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-25 08:50:51,486 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-25 08:50:51,487 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-25 08:50:51,488 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-25 08:50:51,488 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-25 08:50:51,490 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-25 08:50:51,491 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-25 08:50:51,492 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-25 08:50:51,493 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-25 08:50:51,493 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-25 08:50:51,496 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-25 08:50:51,499 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-25 08:50:51,503 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-25 08:50:51,506 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-25 08:50:51,507 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-25 08:50:51,508 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-25 08:50:51,511 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-25 08:50:51,511 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-25 08:50:51,511 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-25 08:50:51,513 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-25 08:50:51,513 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-25 08:50:51,514 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-25 08:50:51,514 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-25 08:50:51,515 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-25 08:50:51,516 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-25 08:50:51,516 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-25 08:50:51,518 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-25 08:50:51,518 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-25 08:50:51,519 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-25 08:50:51,519 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-25 08:50:51,519 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-25 08:50:51,521 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-25 08:50:51,522 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-25 08:50:51,522 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/run_dir_e2c8543a-5ef0-41a9-9bfa-dfacdeeb282a/bin/uautomizer/config/svcomp-Termination-32bit-Automizer_Default.epf [2019-11-25 08:50:51,553 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-25 08:50:51,564 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-25 08:50:51,565 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-11-25 08:50:51,566 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-11-25 08:50:51,566 INFO L138 SettingsManager]: * Use SBE=true [2019-11-25 08:50:51,566 INFO L136 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2019-11-25 08:50:51,566 INFO L138 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2019-11-25 08:50:51,566 INFO L138 SettingsManager]: * Use old map elimination=false [2019-11-25 08:50:51,567 INFO L138 SettingsManager]: * Use external solver (rank synthesis)=false [2019-11-25 08:50:51,567 INFO L138 SettingsManager]: * Use only trivial implications for array writes=true [2019-11-25 08:50:51,567 INFO L138 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2019-11-25 08:50:51,567 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-25 08:50:51,568 INFO L138 SettingsManager]: * sizeof long=4 [2019-11-25 08:50:51,568 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2019-11-25 08:50:51,568 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-11-25 08:50:51,568 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-11-25 08:50:51,568 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-25 08:50:51,569 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2019-11-25 08:50:51,569 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2019-11-25 08:50:51,569 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2019-11-25 08:50:51,569 INFO L138 SettingsManager]: * sizeof long double=12 [2019-11-25 08:50:51,569 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-11-25 08:50:51,570 INFO L138 SettingsManager]: * Assume nondeterminstic values are in range=false [2019-11-25 08:50:51,570 INFO L138 SettingsManager]: * Use constant arrays=true [2019-11-25 08:50:51,570 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2019-11-25 08:50:51,570 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-25 08:50:51,571 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-11-25 08:50:51,571 INFO L138 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2019-11-25 08:50:51,573 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-25 08:50:51,574 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-11-25 08:50:51,574 INFO L138 SettingsManager]: * Dump automata to the following directory=/home/matthias/ultimate/dump/auto [2019-11-25 08:50:51,575 INFO L136 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2019-11-25 08:50:51,575 INFO L138 SettingsManager]: * TransformationType=MODULO_NEIGHBOR Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /tmp/vcloud-vcloud-master/worker/run_dir_e2c8543a-5ef0-41a9-9bfa-dfacdeeb282a/bin/uautomizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(F end) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 82679d367c32c359f0c9c81b27b57deea5682b2b [2019-11-25 08:50:51,703 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-25 08:50:51,713 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-25 08:50:51,716 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-25 08:50:51,717 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-25 08:50:51,717 INFO L275 PluginConnector]: CDTParser initialized [2019-11-25 08:50:51,718 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/run_dir_e2c8543a-5ef0-41a9-9bfa-dfacdeeb282a/bin/uautomizer/../../sv-benchmarks/c/array-memsafety/selectionsort-alloca-1.i [2019-11-25 08:50:51,767 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_e2c8543a-5ef0-41a9-9bfa-dfacdeeb282a/bin/uautomizer/data/499ef6381/5c7803e7a8594e82be99ba8f4ee848fa/FLAG5af2bce0c [2019-11-25 08:50:52,228 INFO L306 CDTParser]: Found 1 translation units. [2019-11-25 08:50:52,229 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/run_dir_e2c8543a-5ef0-41a9-9bfa-dfacdeeb282a/sv-benchmarks/c/array-memsafety/selectionsort-alloca-1.i [2019-11-25 08:50:52,244 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_e2c8543a-5ef0-41a9-9bfa-dfacdeeb282a/bin/uautomizer/data/499ef6381/5c7803e7a8594e82be99ba8f4ee848fa/FLAG5af2bce0c [2019-11-25 08:50:52,256 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/run_dir_e2c8543a-5ef0-41a9-9bfa-dfacdeeb282a/bin/uautomizer/data/499ef6381/5c7803e7a8594e82be99ba8f4ee848fa [2019-11-25 08:50:52,259 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-25 08:50:52,260 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-11-25 08:50:52,261 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-25 08:50:52,262 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-25 08:50:52,265 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-25 08:50:52,266 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.11 08:50:52" (1/1) ... [2019-11-25 08:50:52,269 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6d493948 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 08:50:52, skipping insertion in model container [2019-11-25 08:50:52,269 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.11 08:50:52" (1/1) ... [2019-11-25 08:50:52,276 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-11-25 08:50:52,330 INFO L179 MainTranslator]: Built tables and reachable declarations [2019-11-25 08:50:52,752 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-25 08:50:52,762 INFO L201 MainTranslator]: Completed pre-run [2019-11-25 08:50:52,800 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-25 08:50:52,843 INFO L205 MainTranslator]: Completed translation [2019-11-25 08:50:52,843 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 08:50:52 WrapperNode [2019-11-25 08:50:52,844 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-25 08:50:52,844 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-11-25 08:50:52,844 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-11-25 08:50:52,845 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-11-25 08:50:52,853 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 08:50:52" (1/1) ... [2019-11-25 08:50:52,866 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 08:50:52" (1/1) ... [2019-11-25 08:50:52,888 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-11-25 08:50:52,888 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-11-25 08:50:52,888 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-11-25 08:50:52,888 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-11-25 08:50:52,894 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 08:50:52" (1/1) ... [2019-11-25 08:50:52,894 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 08:50:52" (1/1) ... [2019-11-25 08:50:52,897 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 08:50:52" (1/1) ... [2019-11-25 08:50:52,898 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 08:50:52" (1/1) ... [2019-11-25 08:50:52,903 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 08:50:52" (1/1) ... [2019-11-25 08:50:52,907 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 08:50:52" (1/1) ... [2019-11-25 08:50:52,909 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 08:50:52" (1/1) ... [2019-11-25 08:50:52,911 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-11-25 08:50:52,912 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-11-25 08:50:52,912 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-11-25 08:50:52,912 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-11-25 08:50:52,913 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 08:50:52" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_e2c8543a-5ef0-41a9-9bfa-dfacdeeb282a/bin/uautomizer/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-25 08:50:52,985 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2019-11-25 08:50:52,985 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-11-25 08:50:52,985 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-11-25 08:50:52,986 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-11-25 08:50:52,986 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-11-25 08:50:52,986 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-11-25 08:50:53,234 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-11-25 08:50:53,234 INFO L284 CfgBuilder]: Removed 9 assume(true) statements. [2019-11-25 08:50:53,235 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.11 08:50:53 BoogieIcfgContainer [2019-11-25 08:50:53,235 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-11-25 08:50:53,236 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2019-11-25 08:50:53,236 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2019-11-25 08:50:53,244 INFO L275 PluginConnector]: BuchiAutomizer initialized [2019-11-25 08:50:53,244 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-11-25 08:50:53,245 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 25.11 08:50:52" (1/3) ... [2019-11-25 08:50:53,246 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@641b059f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 25.11 08:50:53, skipping insertion in model container [2019-11-25 08:50:53,246 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-11-25 08:50:53,246 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 08:50:52" (2/3) ... [2019-11-25 08:50:53,246 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@641b059f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 25.11 08:50:53, skipping insertion in model container [2019-11-25 08:50:53,246 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-11-25 08:50:53,247 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.11 08:50:53" (3/3) ... [2019-11-25 08:50:53,248 INFO L371 chiAutomizerObserver]: Analyzing ICFG selectionsort-alloca-1.i [2019-11-25 08:50:53,305 INFO L356 BuchiCegarLoop]: Interprodecural is true [2019-11-25 08:50:53,305 INFO L357 BuchiCegarLoop]: Hoare is false [2019-11-25 08:50:53,305 INFO L358 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2019-11-25 08:50:53,306 INFO L359 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2019-11-25 08:50:53,306 INFO L360 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-11-25 08:50:53,306 INFO L361 BuchiCegarLoop]: Difference is false [2019-11-25 08:50:53,306 INFO L362 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-11-25 08:50:53,306 INFO L365 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2019-11-25 08:50:53,316 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 17 states. [2019-11-25 08:50:53,333 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 8 [2019-11-25 08:50:53,333 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-25 08:50:53,333 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-25 08:50:53,338 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1] [2019-11-25 08:50:53,338 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2019-11-25 08:50:53,338 INFO L424 BuchiCegarLoop]: ======== Iteration 1============ [2019-11-25 08:50:53,338 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 17 states. [2019-11-25 08:50:53,340 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 8 [2019-11-25 08:50:53,340 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-25 08:50:53,340 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-25 08:50:53,340 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1] [2019-11-25 08:50:53,341 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2019-11-25 08:50:53,346 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 [2019-11-25 08:50:53,346 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 [2019-11-25 08:50:53,351 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 08:50:53,351 INFO L82 PathProgramCache]: Analyzing trace with hash 925669, now seen corresponding path program 1 times [2019-11-25 08:50:53,359 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-25 08:50:53,359 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [677699080] [2019-11-25 08:50:53,360 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-25 08:50:53,436 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-25 08:50:53,447 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-25 08:50:53,465 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-25 08:50:53,466 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 08:50:53,466 INFO L82 PathProgramCache]: Analyzing trace with hash 1507, now seen corresponding path program 1 times [2019-11-25 08:50:53,466 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-25 08:50:53,467 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [316688597] [2019-11-25 08:50:53,467 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-25 08:50:53,475 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-25 08:50:53,481 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-25 08:50:53,483 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-25 08:50:53,484 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 08:50:53,485 INFO L82 PathProgramCache]: Analyzing trace with hash 889568455, now seen corresponding path program 1 times [2019-11-25 08:50:53,485 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-25 08:50:53,485 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [126568368] [2019-11-25 08:50:53,485 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-25 08:50:53,503 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-25 08:50:53,523 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-25 08:50:53,526 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-25 08:50:53,733 WARN L192 SmtUtils]: Spent 130.00 ms on a formula simplification. DAG size of input: 44 DAG size of output: 42 [2019-11-25 08:50:53,787 INFO L210 LassoAnalysis]: Preferences: [2019-11-25 08:50:53,788 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2019-11-25 08:50:53,788 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-11-25 08:50:53,788 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2019-11-25 08:50:53,789 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2019-11-25 08:50:53,789 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-25 08:50:53,789 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2019-11-25 08:50:53,789 INFO L132 ssoRankerPreferences]: Path of dumped script: [2019-11-25 08:50:53,789 INFO L133 ssoRankerPreferences]: Filename of dumped script: selectionsort-alloca-1.i_Iteration1_Lasso [2019-11-25 08:50:53,789 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2019-11-25 08:50:53,790 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2019-11-25 08:50:53,811 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-25 08:50:53,817 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-25 08:50:53,819 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-25 08:50:53,824 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-25 08:50:53,829 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-25 08:50:53,834 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-25 08:50:53,950 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-25 08:50:53,954 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-25 08:50:53,958 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-25 08:50:54,210 INFO L292 LassoAnalysis]: Preprocessing complete. [2019-11-25 08:50:54,214 INFO L489 LassoAnalysis]: Using template 'affine'. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_e2c8543a-5ef0-41a9-9bfa-dfacdeeb282a/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) [2019-11-25 08:50:54,223 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 2 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-25 08:50:54,226 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-25 08:50:54,226 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-25 08:50:54,227 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-25 08:50:54,227 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-25 08:50:54,227 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-25 08:50:54,229 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-25 08:50:54,229 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-25 08:50:54,233 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_e2c8543a-5ef0-41a9-9bfa-dfacdeeb282a/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) [2019-11-25 08:50:54,240 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-25 08:50:54,241 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-25 08:50:54,242 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-25 08:50:54,242 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-25 08:50:54,242 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-25 08:50:54,242 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. Waiting until toolchain timeout for monitored process 3 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-25 08:50:54,243 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-25 08:50:54,243 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-25 08:50:54,245 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_e2c8543a-5ef0-41a9-9bfa-dfacdeeb282a/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) [2019-11-25 08:50:54,262 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 4 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-25 08:50:54,263 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-25 08:50:54,264 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-25 08:50:54,264 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-25 08:50:54,264 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-25 08:50:54,268 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-25 08:50:54,268 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-25 08:50:54,272 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_e2c8543a-5ef0-41a9-9bfa-dfacdeeb282a/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) [2019-11-25 08:50:54,286 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-25 08:50:54,289 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-25 08:50:54,289 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-25 08:50:54,289 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-25 08:50:54,289 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-25 08:50:54,294 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-25 08:50:54,295 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. Waiting until toolchain timeout for monitored process 5 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-25 08:50:54,299 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_e2c8543a-5ef0-41a9-9bfa-dfacdeeb282a/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) [2019-11-25 08:50:54,309 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-25 08:50:54,311 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-25 08:50:54,311 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-25 08:50:54,311 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-25 08:50:54,311 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-25 08:50:54,311 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-25 08:50:54,313 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-25 08:50:54,313 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. Waiting until toolchain timeout for monitored process 6 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-25 08:50:54,317 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_e2c8543a-5ef0-41a9-9bfa-dfacdeeb282a/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) [2019-11-25 08:50:54,327 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-25 08:50:54,329 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-25 08:50:54,329 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-25 08:50:54,329 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-25 08:50:54,329 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-25 08:50:54,329 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-25 08:50:54,331 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-25 08:50:54,332 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. Waiting until toolchain timeout for monitored process 7 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-25 08:50:54,337 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_e2c8543a-5ef0-41a9-9bfa-dfacdeeb282a/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) [2019-11-25 08:50:54,352 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-25 08:50:54,354 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-25 08:50:54,354 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-25 08:50:54,354 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-25 08:50:54,354 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-25 08:50:54,354 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-25 08:50:54,358 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-25 08:50:54,358 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. Waiting until toolchain timeout for monitored process 8 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-25 08:50:54,360 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_e2c8543a-5ef0-41a9-9bfa-dfacdeeb282a/bin/uautomizer/z3 Starting monitored process 9 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-11-25 08:50:54,378 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-25 08:50:54,381 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-25 08:50:54,381 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-25 08:50:54,382 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-25 08:50:54,382 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. Waiting until toolchain timeout for monitored process 9 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-25 08:50:54,402 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-25 08:50:54,407 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-25 08:50:54,420 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-11-25 08:50:54,474 INFO L443 ModelExtractionUtils]: Simplification made 10 calls to the SMT solver. [2019-11-25 08:50:54,474 INFO L444 ModelExtractionUtils]: 3 out of 22 variables were initially zero. Simplification set additionally 15 variables to zero. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_e2c8543a-5ef0-41a9-9bfa-dfacdeeb282a/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) [2019-11-25 08:50:54,492 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... Waiting until toolchain timeout for monitored process 10 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-25 08:50:54,495 INFO L438 nArgumentSynthesizer]: Removed 1 redundant supporting invariants from a total of 2. [2019-11-25 08:50:54,495 INFO L510 LassoAnalysis]: Proved termination. [2019-11-25 08:50:54,496 INFO L512 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select #length ULTIMATE.start_main_~numbers~0.base)_1, ULTIMATE.start_main_~i~1) = 1*v_rep(select #length ULTIMATE.start_main_~numbers~0.base)_1 - 4*ULTIMATE.start_main_~i~1 Supporting invariants [1*ULTIMATE.start_main_~numbers~0.offset >= 0] [2019-11-25 08:50:54,512 INFO L297 tatePredicateManager]: 3 out of 4 supporting invariants were superfluous and have been removed [2019-11-25 08:50:54,522 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2019-11-25 08:50:54,563 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 08:50:54,580 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 08:50:54,582 INFO L255 TraceCheckSpWp]: Trace formula consists of 26 conjuncts, 4 conjunts are in the unsatisfiable core [2019-11-25 08:50:54,584 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-25 08:50:54,605 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 08:50:54,606 INFO L255 TraceCheckSpWp]: Trace formula consists of 11 conjuncts, 5 conjunts are in the unsatisfiable core [2019-11-25 08:50:54,607 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-25 08:50:54,633 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-25 08:50:54,649 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2019-11-25 08:50:54,650 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 17 states. Second operand 3 states. [2019-11-25 08:50:54,756 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 17 states.. Second operand 3 states. Result 41 states and 59 transitions. Complement of second has 7 states. [2019-11-25 08:50:54,757 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 5 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2019-11-25 08:50:54,758 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2019-11-25 08:50:54,759 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 39 transitions. [2019-11-25 08:50:54,761 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 39 transitions. Stem has 4 letters. Loop has 2 letters. [2019-11-25 08:50:54,762 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-25 08:50:54,762 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 39 transitions. Stem has 6 letters. Loop has 2 letters. [2019-11-25 08:50:54,762 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-25 08:50:54,762 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 39 transitions. Stem has 4 letters. Loop has 4 letters. [2019-11-25 08:50:54,763 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-25 08:50:54,763 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 41 states and 59 transitions. [2019-11-25 08:50:54,767 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 6 [2019-11-25 08:50:54,771 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 41 states to 14 states and 19 transitions. [2019-11-25 08:50:54,772 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 11 [2019-11-25 08:50:54,773 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 12 [2019-11-25 08:50:54,773 INFO L73 IsDeterministic]: Start isDeterministic. Operand 14 states and 19 transitions. [2019-11-25 08:50:54,774 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-11-25 08:50:54,774 INFO L688 BuchiCegarLoop]: Abstraction has 14 states and 19 transitions. [2019-11-25 08:50:54,790 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14 states and 19 transitions. [2019-11-25 08:50:54,798 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14 to 14. [2019-11-25 08:50:54,798 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2019-11-25 08:50:54,799 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 19 transitions. [2019-11-25 08:50:54,800 INFO L711 BuchiCegarLoop]: Abstraction has 14 states and 19 transitions. [2019-11-25 08:50:54,800 INFO L591 BuchiCegarLoop]: Abstraction has 14 states and 19 transitions. [2019-11-25 08:50:54,800 INFO L424 BuchiCegarLoop]: ======== Iteration 2============ [2019-11-25 08:50:54,801 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 14 states and 19 transitions. [2019-11-25 08:50:54,801 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 6 [2019-11-25 08:50:54,802 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-25 08:50:54,802 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-25 08:50:54,802 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1] [2019-11-25 08:50:54,802 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2019-11-25 08:50:54,803 INFO L794 eck$LassoCheckResult]: Stem: 136#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; 133#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; 134#L531 assume !(main_~array_size~0 < 1 || main_~array_size~0 >= 536870911); 137#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; 131#L536-3 assume !(main_~i~1 < main_~array_size~0); 132#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; 128#L515-3 [2019-11-25 08:50:54,803 INFO L796 eck$LassoCheckResult]: Loop: 128#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; 124#L519-3 assume !(SelectionSort_~j~0 < SelectionSort_~array_size); 125#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); 127#L515-2 SelectionSort_#t~pre2 := 1 + SelectionSort_~i~0;SelectionSort_~i~0 := 1 + SelectionSort_~i~0;havoc SelectionSort_#t~pre2; 128#L515-3 [2019-11-25 08:50:54,803 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 08:50:54,804 INFO L82 PathProgramCache]: Analyzing trace with hash 889568397, now seen corresponding path program 1 times [2019-11-25 08:50:54,804 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-25 08:50:54,804 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [641385494] [2019-11-25 08:50:54,804 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-25 08:50:54,818 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 08:50:54,864 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-25 08:50:54,865 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [641385494] [2019-11-25 08:50:54,865 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-25 08:50:54,866 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-25 08:50:54,866 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [263383752] [2019-11-25 08:50:54,869 INFO L799 eck$LassoCheckResult]: stem already infeasible [2019-11-25 08:50:54,869 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 08:50:54,869 INFO L82 PathProgramCache]: Analyzing trace with hash 1884201, now seen corresponding path program 1 times [2019-11-25 08:50:54,869 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-25 08:50:54,870 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1951323417] [2019-11-25 08:50:54,870 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-25 08:50:54,885 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 08:50:54,900 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-25 08:50:54,901 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1951323417] [2019-11-25 08:50:54,901 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-25 08:50:54,901 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-25 08:50:54,901 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [625028881] [2019-11-25 08:50:54,902 INFO L811 eck$LassoCheckResult]: loop already infeasible [2019-11-25 08:50:54,902 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-25 08:50:54,904 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-25 08:50:54,905 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-25 08:50:54,908 INFO L87 Difference]: Start difference. First operand 14 states and 19 transitions. cyclomatic complexity: 7 Second operand 3 states. [2019-11-25 08:50:54,927 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-25 08:50:54,927 INFO L93 Difference]: Finished difference Result 15 states and 20 transitions. [2019-11-25 08:50:54,927 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-25 08:50:54,928 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 15 states and 20 transitions. [2019-11-25 08:50:54,929 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 7 [2019-11-25 08:50:54,929 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 15 states to 15 states and 20 transitions. [2019-11-25 08:50:54,930 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 13 [2019-11-25 08:50:54,930 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 13 [2019-11-25 08:50:54,930 INFO L73 IsDeterministic]: Start isDeterministic. Operand 15 states and 20 transitions. [2019-11-25 08:50:54,930 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-11-25 08:50:54,930 INFO L688 BuchiCegarLoop]: Abstraction has 15 states and 20 transitions. [2019-11-25 08:50:54,931 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15 states and 20 transitions. [2019-11-25 08:50:54,932 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15 to 15. [2019-11-25 08:50:54,932 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2019-11-25 08:50:54,932 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 20 transitions. [2019-11-25 08:50:54,932 INFO L711 BuchiCegarLoop]: Abstraction has 15 states and 20 transitions. [2019-11-25 08:50:54,933 INFO L591 BuchiCegarLoop]: Abstraction has 15 states and 20 transitions. [2019-11-25 08:50:54,933 INFO L424 BuchiCegarLoop]: ======== Iteration 3============ [2019-11-25 08:50:54,933 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 15 states and 20 transitions. [2019-11-25 08:50:54,934 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 7 [2019-11-25 08:50:54,934 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-25 08:50:54,934 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-25 08:50:54,934 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1] [2019-11-25 08:50:54,934 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1] [2019-11-25 08:50:54,935 INFO L794 eck$LassoCheckResult]: Stem: 173#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; 170#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; 171#L531 assume !(main_~array_size~0 < 1 || main_~array_size~0 >= 536870911); 174#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; 168#L536-3 assume !(main_~i~1 < main_~array_size~0); 169#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; 165#L515-3 [2019-11-25 08:50:54,935 INFO L796 eck$LassoCheckResult]: Loop: 165#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; 161#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); 162#L521 assume SelectionSort_#t~mem4 < SelectionSort_#t~mem5;havoc SelectionSort_#t~mem5;havoc SelectionSort_#t~mem4;SelectionSort_~min~0 := SelectionSort_~j~0; 172#L519-2 SelectionSort_#t~pre3 := 1 + SelectionSort_~j~0;SelectionSort_~j~0 := 1 + SelectionSort_~j~0;havoc SelectionSort_#t~pre3; 175#L519-3 assume !(SelectionSort_~j~0 < SelectionSort_~array_size); 163#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); 164#L515-2 SelectionSort_#t~pre2 := 1 + SelectionSort_~i~0;SelectionSort_~i~0 := 1 + SelectionSort_~i~0;havoc SelectionSort_#t~pre2; 165#L515-3 [2019-11-25 08:50:54,935 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 08:50:54,935 INFO L82 PathProgramCache]: Analyzing trace with hash 889568397, now seen corresponding path program 2 times [2019-11-25 08:50:54,936 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-25 08:50:54,936 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1480882823] [2019-11-25 08:50:54,936 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-25 08:50:54,957 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 08:50:54,999 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-25 08:50:54,999 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1480882823] [2019-11-25 08:50:54,999 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-25 08:50:54,999 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-25 08:50:54,999 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [835673665] [2019-11-25 08:50:55,000 INFO L799 eck$LassoCheckResult]: stem already infeasible [2019-11-25 08:50:55,000 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 08:50:55,000 INFO L82 PathProgramCache]: Analyzing trace with hash 347385690, now seen corresponding path program 1 times [2019-11-25 08:50:55,000 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-25 08:50:55,001 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [882835579] [2019-11-25 08:50:55,001 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-25 08:50:55,024 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-25 08:50:55,036 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-25 08:50:55,046 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-25 08:50:55,194 WARN L192 SmtUtils]: Spent 145.00 ms on a formula simplification. DAG size of input: 75 DAG size of output: 60 [2019-11-25 08:50:55,247 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-25 08:50:55,247 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-25 08:50:55,247 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-25 08:50:55,248 INFO L87 Difference]: Start difference. First operand 15 states and 20 transitions. cyclomatic complexity: 7 Second operand 4 states. [2019-11-25 08:50:55,270 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-25 08:50:55,271 INFO L93 Difference]: Finished difference Result 16 states and 20 transitions. [2019-11-25 08:50:55,271 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-25 08:50:55,272 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 16 states and 20 transitions. [2019-11-25 08:50:55,273 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 7 [2019-11-25 08:50:55,273 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 16 states to 16 states and 20 transitions. [2019-11-25 08:50:55,273 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 13 [2019-11-25 08:50:55,274 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 13 [2019-11-25 08:50:55,274 INFO L73 IsDeterministic]: Start isDeterministic. Operand 16 states and 20 transitions. [2019-11-25 08:50:55,274 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-11-25 08:50:55,274 INFO L688 BuchiCegarLoop]: Abstraction has 16 states and 20 transitions. [2019-11-25 08:50:55,274 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16 states and 20 transitions. [2019-11-25 08:50:55,275 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16 to 15. [2019-11-25 08:50:55,276 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2019-11-25 08:50:55,276 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 19 transitions. [2019-11-25 08:50:55,276 INFO L711 BuchiCegarLoop]: Abstraction has 15 states and 19 transitions. [2019-11-25 08:50:55,276 INFO L591 BuchiCegarLoop]: Abstraction has 15 states and 19 transitions. [2019-11-25 08:50:55,277 INFO L424 BuchiCegarLoop]: ======== Iteration 4============ [2019-11-25 08:50:55,277 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 15 states and 19 transitions. [2019-11-25 08:50:55,280 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 7 [2019-11-25 08:50:55,281 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-25 08:50:55,281 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-25 08:50:55,282 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1] [2019-11-25 08:50:55,282 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1] [2019-11-25 08:50:55,282 INFO L794 eck$LassoCheckResult]: Stem: 211#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; 208#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; 209#L531 assume !(main_~array_size~0 < 1 || main_~array_size~0 >= 536870911); 212#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; 206#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; 204#L536-2 main_#t~post10 := main_~i~1;main_~i~1 := 1 + main_#t~post10;havoc main_#t~post10; 205#L536-3 assume !(main_~i~1 < main_~array_size~0); 207#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; 203#L515-3 [2019-11-25 08:50:55,282 INFO L796 eck$LassoCheckResult]: Loop: 203#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; 199#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); 200#L521 assume SelectionSort_#t~mem4 < SelectionSort_#t~mem5;havoc SelectionSort_#t~mem5;havoc SelectionSort_#t~mem4;SelectionSort_~min~0 := SelectionSort_~j~0; 210#L519-2 SelectionSort_#t~pre3 := 1 + SelectionSort_~j~0;SelectionSort_~j~0 := 1 + SelectionSort_~j~0;havoc SelectionSort_#t~pre3; 213#L519-3 assume !(SelectionSort_~j~0 < SelectionSort_~array_size); 201#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); 202#L515-2 SelectionSort_#t~pre2 := 1 + SelectionSort_~i~0;SelectionSort_~i~0 := 1 + SelectionSort_~i~0;havoc SelectionSort_#t~pre2; 203#L515-3 [2019-11-25 08:50:55,282 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 08:50:55,283 INFO L82 PathProgramCache]: Analyzing trace with hash 176793839, now seen corresponding path program 1 times [2019-11-25 08:50:55,283 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-25 08:50:55,283 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1144350428] [2019-11-25 08:50:55,283 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-25 08:50:55,306 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-25 08:50:55,316 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-25 08:50:55,320 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-25 08:50:55,320 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 08:50:55,320 INFO L82 PathProgramCache]: Analyzing trace with hash 347385690, now seen corresponding path program 2 times [2019-11-25 08:50:55,321 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-25 08:50:55,321 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [180909686] [2019-11-25 08:50:55,321 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-25 08:50:55,332 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-25 08:50:55,341 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-25 08:50:55,344 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-25 08:50:55,345 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 08:50:55,345 INFO L82 PathProgramCache]: Analyzing trace with hash 651542188, now seen corresponding path program 1 times [2019-11-25 08:50:55,345 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-25 08:50:55,345 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [107559307] [2019-11-25 08:50:55,346 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-25 08:50:55,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 08:50:55,456 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-11-25 08:50:55,456 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [107559307] [2019-11-25 08:50:55,456 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [382395898] [2019-11-25 08:50:55,456 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_e2c8543a-5ef0-41a9-9bfa-dfacdeeb282a/bin/uautomizer/z3 Starting monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-25 08:50:55,517 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 08:50:55,518 INFO L255 TraceCheckSpWp]: Trace formula consists of 82 conjuncts, 7 conjunts are in the unsatisfiable core [2019-11-25 08:50:55,520 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-25 08:50:55,591 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-11-25 08:50:55,591 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-25 08:50:55,591 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 6] total 11 [2019-11-25 08:50:55,592 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [831128825] [2019-11-25 08:50:55,734 WARN L192 SmtUtils]: Spent 140.00 ms on a formula simplification. DAG size of input: 75 DAG size of output: 60 [2019-11-25 08:50:55,784 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-25 08:50:55,784 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-11-25 08:50:55,784 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=85, Unknown=0, NotChecked=0, Total=110 [2019-11-25 08:50:55,784 INFO L87 Difference]: Start difference. First operand 15 states and 19 transitions. cyclomatic complexity: 6 Second operand 11 states. [2019-11-25 08:50:55,907 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-25 08:50:55,907 INFO L93 Difference]: Finished difference Result 24 states and 29 transitions. [2019-11-25 08:50:55,908 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-11-25 08:50:55,908 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 24 states and 29 transitions. [2019-11-25 08:50:55,909 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 7 [2019-11-25 08:50:55,909 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 24 states to 18 states and 21 transitions. [2019-11-25 08:50:55,909 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 13 [2019-11-25 08:50:55,910 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 13 [2019-11-25 08:50:55,910 INFO L73 IsDeterministic]: Start isDeterministic. Operand 18 states and 21 transitions. [2019-11-25 08:50:55,910 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-11-25 08:50:55,910 INFO L688 BuchiCegarLoop]: Abstraction has 18 states and 21 transitions. [2019-11-25 08:50:55,910 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18 states and 21 transitions. [2019-11-25 08:50:55,911 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18 to 17. [2019-11-25 08:50:55,911 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2019-11-25 08:50:55,912 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 20 transitions. [2019-11-25 08:50:55,912 INFO L711 BuchiCegarLoop]: Abstraction has 17 states and 20 transitions. [2019-11-25 08:50:55,912 INFO L591 BuchiCegarLoop]: Abstraction has 17 states and 20 transitions. [2019-11-25 08:50:55,912 INFO L424 BuchiCegarLoop]: ======== Iteration 5============ [2019-11-25 08:50:55,912 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 17 states and 20 transitions. [2019-11-25 08:50:55,913 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 7 [2019-11-25 08:50:55,913 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-25 08:50:55,913 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-25 08:50:55,914 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 1, 1, 1, 1, 1, 1] [2019-11-25 08:50:55,914 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1] [2019-11-25 08:50:55,914 INFO L794 eck$LassoCheckResult]: Stem: 315#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; 312#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; 313#L531 assume !(main_~array_size~0 < 1 || main_~array_size~0 >= 536870911); 316#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; 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; 307#L536-2 main_#t~post10 := main_~i~1;main_~i~1 := 1 + main_#t~post10;havoc main_#t~post10; 308#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; 310#L536-2 main_#t~post10 := main_~i~1;main_~i~1 := 1 + main_#t~post10;havoc main_#t~post10; 318#L536-3 assume !(main_~i~1 < main_~array_size~0); 311#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; 306#L515-3 [2019-11-25 08:50:55,914 INFO L796 eck$LassoCheckResult]: Loop: 306#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; 302#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); 303#L521 assume SelectionSort_#t~mem4 < SelectionSort_#t~mem5;havoc SelectionSort_#t~mem5;havoc SelectionSort_#t~mem4;SelectionSort_~min~0 := SelectionSort_~j~0; 314#L519-2 SelectionSort_#t~pre3 := 1 + SelectionSort_~j~0;SelectionSort_~j~0 := 1 + SelectionSort_~j~0;havoc SelectionSort_#t~pre3; 317#L519-3 assume !(SelectionSort_~j~0 < SelectionSort_~array_size); 304#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); 305#L515-2 SelectionSort_#t~pre2 := 1 + SelectionSort_~i~0;SelectionSort_~i~0 := 1 + SelectionSort_~i~0;havoc SelectionSort_#t~pre2; 306#L515-3 [2019-11-25 08:50:55,914 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 08:50:55,914 INFO L82 PathProgramCache]: Analyzing trace with hash -1899756335, now seen corresponding path program 2 times [2019-11-25 08:50:55,914 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-25 08:50:55,915 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [989606054] [2019-11-25 08:50:55,915 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-25 08:50:55,925 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-25 08:50:55,934 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-25 08:50:55,938 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-25 08:50:55,938 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 08:50:55,938 INFO L82 PathProgramCache]: Analyzing trace with hash 347385690, now seen corresponding path program 3 times [2019-11-25 08:50:55,938 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-25 08:50:55,939 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1090786148] [2019-11-25 08:50:55,939 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-25 08:50:55,946 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-25 08:50:55,952 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-25 08:50:55,955 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-25 08:50:55,955 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 08:50:55,955 INFO L82 PathProgramCache]: Analyzing trace with hash 219717770, now seen corresponding path program 2 times [2019-11-25 08:50:55,955 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-25 08:50:55,956 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1243655303] [2019-11-25 08:50:55,956 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-25 08:50:55,975 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-25 08:50:55,992 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-25 08:50:55,997 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-25 08:50:56,123 WARN L192 SmtUtils]: Spent 125.00 ms on a formula simplification. DAG size of input: 75 DAG size of output: 60 [2019-11-25 08:50:56,374 WARN L192 SmtUtils]: Spent 208.00 ms on a formula simplification. DAG size of input: 98 DAG size of output: 77 [2019-11-25 08:50:56,445 INFO L210 LassoAnalysis]: Preferences: [2019-11-25 08:50:56,446 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2019-11-25 08:50:56,446 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-11-25 08:50:56,446 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2019-11-25 08:50:56,446 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2019-11-25 08:50:56,446 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-25 08:50:56,446 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2019-11-25 08:50:56,446 INFO L132 ssoRankerPreferences]: Path of dumped script: [2019-11-25 08:50:56,446 INFO L133 ssoRankerPreferences]: Filename of dumped script: selectionsort-alloca-1.i_Iteration5_Lasso [2019-11-25 08:50:56,446 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2019-11-25 08:50:56,447 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2019-11-25 08:50:56,451 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-25 08:50:56,654 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-25 08:50:56,662 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-25 08:50:56,666 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-25 08:50:56,669 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-25 08:50:56,672 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-25 08:50:56,674 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-25 08:50:56,676 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-25 08:50:56,683 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-25 08:50:56,685 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-25 08:50:56,687 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-25 08:50:56,689 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-25 08:50:56,691 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-25 08:50:56,694 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-25 08:50:56,695 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-25 08:50:56,698 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-25 08:50:57,063 INFO L292 LassoAnalysis]: Preprocessing complete. [2019-11-25 08:50:57,063 INFO L489 LassoAnalysis]: Using template 'affine'. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_e2c8543a-5ef0-41a9-9bfa-dfacdeeb282a/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) [2019-11-25 08:50:57,074 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-25 08:50:57,076 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-25 08:50:57,077 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-25 08:50:57,077 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-25 08:50:57,077 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-25 08:50:57,082 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-25 08:50:57,083 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. Waiting until toolchain timeout for monitored process 12 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-25 08:50:57,093 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_e2c8543a-5ef0-41a9-9bfa-dfacdeeb282a/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) [2019-11-25 08:50:57,102 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-25 08:50:57,104 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-25 08:50:57,104 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-25 08:50:57,104 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-25 08:50:57,104 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-25 08:50:57,104 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-25 08:50:57,105 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-25 08:50:57,106 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-25 08:50:57,108 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. Waiting until toolchain timeout for monitored process 13 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_e2c8543a-5ef0-41a9-9bfa-dfacdeeb282a/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) [2019-11-25 08:50:57,118 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-25 08:50:57,119 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-25 08:50:57,120 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-25 08:50:57,120 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-25 08:50:57,120 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-25 08:50:57,123 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-25 08:50:57,123 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-25 08:50:57,129 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. Waiting until toolchain timeout for monitored process 14 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_e2c8543a-5ef0-41a9-9bfa-dfacdeeb282a/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) [2019-11-25 08:50:57,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 [2019-11-25 08:50:57,167 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-25 08:50:57,168 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-25 08:50:57,168 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-25 08:50:57,168 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-25 08:50:57,171 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-25 08:50:57,171 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. Waiting until toolchain timeout for monitored process 15 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-25 08:50:57,175 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_e2c8543a-5ef0-41a9-9bfa-dfacdeeb282a/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) [2019-11-25 08:50:57,184 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 16 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-25 08:50:57,187 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-25 08:50:57,187 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-25 08:50:57,187 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-25 08:50:57,187 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-25 08:50:57,199 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-25 08:50:57,199 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-25 08:50:57,221 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-11-25 08:50:57,361 INFO L443 ModelExtractionUtils]: Simplification made 19 calls to the SMT solver. [2019-11-25 08:50:57,361 INFO L444 ModelExtractionUtils]: 25 out of 43 variables were initially zero. Simplification set additionally 13 variables to zero. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_e2c8543a-5ef0-41a9-9bfa-dfacdeeb282a/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) Waiting until toolchain timeout for monitored process 17 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-25 08:50:57,372 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-11-25 08:50:57,374 INFO L438 nArgumentSynthesizer]: Removed 1 redundant supporting invariants from a total of 2. [2019-11-25 08:50:57,375 INFO L510 LassoAnalysis]: Proved termination. [2019-11-25 08:50:57,375 INFO L512 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_SelectionSort_~i~0) = -2*ULTIMATE.start_SelectionSort_~i~0 + 1 Supporting invariants [-1*ULTIMATE.start_SelectionSort_~array_size + 2 >= 0] [2019-11-25 08:50:57,392 INFO L297 tatePredicateManager]: 4 out of 5 supporting invariants were superfluous and have been removed [2019-11-25 08:50:57,414 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 08:50:57,429 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 08:50:57,430 INFO L255 TraceCheckSpWp]: Trace formula consists of 57 conjuncts, 8 conjunts are in the unsatisfiable core [2019-11-25 08:50:57,431 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-25 08:50:57,500 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 08:50:57,501 INFO L255 TraceCheckSpWp]: Trace formula consists of 36 conjuncts, 5 conjunts are in the unsatisfiable core [2019-11-25 08:50:57,502 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-25 08:50:57,518 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-11-25 08:50:57,518 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.5 stem predicates 2 loop predicates [2019-11-25 08:50:57,518 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 17 states and 20 transitions. cyclomatic complexity: 5 Second operand 7 states. [2019-11-25 08:50:57,644 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 17 states and 20 transitions. cyclomatic complexity: 5. Second operand 7 states. Result 37 states and 46 transitions. Complement of second has 10 states. [2019-11-25 08:50:57,644 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 8 states 5 stem states 1 non-accepting loop states 2 accepting loop states [2019-11-25 08:50:57,644 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2019-11-25 08:50:57,645 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 24 transitions. [2019-11-25 08:50:57,645 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states and 24 transitions. Stem has 10 letters. Loop has 7 letters. [2019-11-25 08:50:57,645 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-25 08:50:57,645 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states and 24 transitions. Stem has 17 letters. Loop has 7 letters. [2019-11-25 08:50:57,646 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-25 08:50:57,646 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states and 24 transitions. Stem has 10 letters. Loop has 14 letters. [2019-11-25 08:50:57,646 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-25 08:50:57,646 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 37 states and 46 transitions. [2019-11-25 08:50:57,647 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 10 [2019-11-25 08:50:57,648 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 37 states to 35 states and 44 transitions. [2019-11-25 08:50:57,648 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 19 [2019-11-25 08:50:57,648 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 21 [2019-11-25 08:50:57,649 INFO L73 IsDeterministic]: Start isDeterministic. Operand 35 states and 44 transitions. [2019-11-25 08:50:57,649 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-11-25 08:50:57,649 INFO L688 BuchiCegarLoop]: Abstraction has 35 states and 44 transitions. [2019-11-25 08:50:57,649 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states and 44 transitions. [2019-11-25 08:50:57,651 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 31. [2019-11-25 08:50:57,651 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31 states. [2019-11-25 08:50:57,651 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 40 transitions. [2019-11-25 08:50:57,652 INFO L711 BuchiCegarLoop]: Abstraction has 31 states and 40 transitions. [2019-11-25 08:50:57,652 INFO L591 BuchiCegarLoop]: Abstraction has 31 states and 40 transitions. [2019-11-25 08:50:57,652 INFO L424 BuchiCegarLoop]: ======== Iteration 6============ [2019-11-25 08:50:57,652 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 31 states and 40 transitions. [2019-11-25 08:50:57,653 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 10 [2019-11-25 08:50:57,653 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-25 08:50:57,653 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-25 08:50:57,653 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 1, 1, 1, 1, 1, 1, 1] [2019-11-25 08:50:57,653 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2019-11-25 08:50:57,654 INFO L794 eck$LassoCheckResult]: Stem: 491#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; 486#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; 487#L531 assume !(main_~array_size~0 < 1 || main_~array_size~0 >= 536870911); 492#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; 484#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; 481#L536-2 main_#t~post10 := main_~i~1;main_~i~1 := 1 + main_#t~post10;havoc main_#t~post10; 482#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; 485#L536-2 main_#t~post10 := main_~i~1;main_~i~1 := 1 + main_#t~post10;havoc main_#t~post10; 501#L536-3 assume !(main_~i~1 < main_~array_size~0); 498#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; 497#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; 471#L519-3 [2019-11-25 08:50:57,654 INFO L796 eck$LassoCheckResult]: Loop: 471#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); 472#L521 assume SelectionSort_#t~mem4 < SelectionSort_#t~mem5;havoc SelectionSort_#t~mem5;havoc SelectionSort_#t~mem4;SelectionSort_~min~0 := SelectionSort_~j~0; 489#L519-2 SelectionSort_#t~pre3 := 1 + SelectionSort_~j~0;SelectionSort_~j~0 := 1 + SelectionSort_~j~0;havoc SelectionSort_#t~pre3; 471#L519-3 [2019-11-25 08:50:57,654 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 08:50:57,654 INFO L82 PathProgramCache]: Analyzing trace with hash 1237095790, now seen corresponding path program 1 times [2019-11-25 08:50:57,654 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-25 08:50:57,654 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1261561810] [2019-11-25 08:50:57,655 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-25 08:50:57,677 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-25 08:50:57,685 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-25 08:50:57,698 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-25 08:50:57,699 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 08:50:57,699 INFO L82 PathProgramCache]: Analyzing trace with hash 68618, now seen corresponding path program 1 times [2019-11-25 08:50:57,699 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-25 08:50:57,699 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [615453431] [2019-11-25 08:50:57,699 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-25 08:50:57,708 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-25 08:50:57,711 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-25 08:50:57,712 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-25 08:50:57,713 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 08:50:57,713 INFO L82 PathProgramCache]: Analyzing trace with hash -793648259, now seen corresponding path program 1 times [2019-11-25 08:50:57,713 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-25 08:50:57,713 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1607538536] [2019-11-25 08:50:57,713 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-25 08:50:57,733 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-25 08:50:57,745 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-25 08:50:57,756 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-25 08:50:58,067 WARN L192 SmtUtils]: Spent 266.00 ms on a formula simplification. DAG size of input: 104 DAG size of output: 85 [2019-11-25 08:50:58,162 INFO L210 LassoAnalysis]: Preferences: [2019-11-25 08:50:58,162 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2019-11-25 08:50:58,162 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-11-25 08:50:58,162 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2019-11-25 08:50:58,162 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2019-11-25 08:50:58,162 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-25 08:50:58,162 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2019-11-25 08:50:58,162 INFO L132 ssoRankerPreferences]: Path of dumped script: [2019-11-25 08:50:58,163 INFO L133 ssoRankerPreferences]: Filename of dumped script: selectionsort-alloca-1.i_Iteration6_Lasso [2019-11-25 08:50:58,163 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2019-11-25 08:50:58,163 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2019-11-25 08:50:58,166 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-25 08:50:58,171 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-25 08:50:58,173 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-25 08:50:58,175 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-25 08:50:58,178 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-25 08:50:58,323 WARN L192 SmtUtils]: Spent 122.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 54 [2019-11-25 08:50:58,393 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-25 08:50:58,395 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-25 08:50:58,398 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-25 08:50:58,399 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-25 08:50:58,401 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-25 08:50:58,403 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-25 08:50:58,405 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-25 08:50:58,406 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-25 08:50:58,423 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-25 08:50:58,425 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-25 08:50:58,428 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-25 08:50:58,430 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-25 08:50:58,559 WARN L192 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 51 DAG size of output: 47 [2019-11-25 08:50:58,758 INFO L292 LassoAnalysis]: Preprocessing complete. [2019-11-25 08:50:58,758 INFO L489 LassoAnalysis]: Using template 'affine'. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_e2c8543a-5ef0-41a9-9bfa-dfacdeeb282a/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 [2019-11-25 08:50:58,764 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-25 08:50:58,765 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-25 08:50:58,765 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-25 08:50:58,765 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-25 08:50:58,765 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-25 08:50:58,765 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-25 08:50:58,765 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-25 08:50:58,766 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-25 08:50:58,766 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_e2c8543a-5ef0-41a9-9bfa-dfacdeeb282a/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 [2019-11-25 08:50:58,771 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-25 08:50:58,772 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-25 08:50:58,772 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-25 08:50:58,772 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-25 08:50:58,772 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-25 08:50:58,772 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-25 08:50:58,773 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-25 08:50:58,773 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-25 08:50:58,774 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_e2c8543a-5ef0-41a9-9bfa-dfacdeeb282a/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 [2019-11-25 08:50:58,782 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-25 08:50:58,783 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-25 08:50:58,783 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-25 08:50:58,783 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-25 08:50:58,784 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-25 08:50:58,785 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-25 08:50:58,785 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-25 08:50:58,788 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_e2c8543a-5ef0-41a9-9bfa-dfacdeeb282a/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) [2019-11-25 08:50:58,810 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-25 08:50:58,811 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-25 08:50:58,812 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-25 08:50:58,812 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-25 08:50:58,812 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-25 08:50:58,812 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-25 08:50:58,812 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-25 08:50:58,813 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. Waiting until toolchain timeout for monitored process 21 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-25 08:50:58,814 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_e2c8543a-5ef0-41a9-9bfa-dfacdeeb282a/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 [2019-11-25 08:50:58,832 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-25 08:50:58,833 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-25 08:50:58,833 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-25 08:50:58,834 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-25 08:50:58,834 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-25 08:50:58,834 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-25 08:50:58,836 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-25 08:50:58,836 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-25 08:50:58,839 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_e2c8543a-5ef0-41a9-9bfa-dfacdeeb282a/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) [2019-11-25 08:50:58,854 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-25 08:50:58,860 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-25 08:50:58,860 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-25 08:50:58,860 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-25 08:50:58,860 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-25 08:50:58,863 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-25 08:50:58,864 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. Waiting until toolchain timeout for monitored process 23 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-25 08:50:58,876 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_e2c8543a-5ef0-41a9-9bfa-dfacdeeb282a/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) [2019-11-25 08:50:58,886 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-25 08:50:58,888 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-25 08:50:58,889 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-25 08:50:58,889 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-25 08:50:58,889 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-25 08:50:58,901 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-25 08:50:58,902 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. Waiting until toolchain timeout for monitored process 24 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-25 08:50:58,925 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-11-25 08:50:58,998 INFO L443 ModelExtractionUtils]: Simplification made 18 calls to the SMT solver. [2019-11-25 08:50:58,998 INFO L444 ModelExtractionUtils]: 23 out of 46 variables were initially zero. Simplification set additionally 14 variables to zero. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_e2c8543a-5ef0-41a9-9bfa-dfacdeeb282a/bin/uautomizer/z3 Starting monitored process 25 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 25 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-25 08:50:59,003 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-11-25 08:50:59,005 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 2. [2019-11-25 08:50:59,006 INFO L510 LassoAnalysis]: Proved termination. [2019-11-25 08:50:59,006 INFO L512 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_SelectionSort_~min~0) = -4*ULTIMATE.start_SelectionSort_~min~0 + 5 Supporting invariants [1*ULTIMATE.start_SelectionSort_~j~0 - 1*ULTIMATE.start_SelectionSort_~min~0 - 1 >= 0, 1*ULTIMATE.start_SelectionSort_~a.offset - 1*v_rep(select #length ULTIMATE.start_SelectionSort_~a.base)_2 + 8 >= 0] [2019-11-25 08:50:59,028 INFO L297 tatePredicateManager]: 6 out of 8 supporting invariants were superfluous and have been removed [2019-11-25 08:50:59,055 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 08:50:59,071 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 08:50:59,072 INFO L255 TraceCheckSpWp]: Trace formula consists of 62 conjuncts, 19 conjunts are in the unsatisfiable core [2019-11-25 08:50:59,073 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-25 08:50:59,095 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2019-11-25 08:50:59,096 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-25 08:50:59,110 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-25 08:50:59,111 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-25 08:50:59,111 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:15 [2019-11-25 08:50:59,242 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 08:50:59,243 INFO L255 TraceCheckSpWp]: Trace formula consists of 20 conjuncts, 8 conjunts are in the unsatisfiable core [2019-11-25 08:50:59,243 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-25 08:50:59,319 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-25 08:50:59,319 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.6 stem predicates 3 loop predicates [2019-11-25 08:50:59,319 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 31 states and 40 transitions. cyclomatic complexity: 13 Second operand 9 states. [2019-11-25 08:50:59,568 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 31 states and 40 transitions. cyclomatic complexity: 13. Second operand 9 states. Result 59 states and 75 transitions. Complement of second has 13 states. [2019-11-25 08:50:59,569 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 10 states 6 stem states 2 non-accepting loop states 2 accepting loop states [2019-11-25 08:50:59,569 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2019-11-25 08:50:59,569 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 26 transitions. [2019-11-25 08:50:59,570 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 10 states and 26 transitions. Stem has 11 letters. Loop has 3 letters. [2019-11-25 08:50:59,570 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-25 08:50:59,570 INFO L639 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2019-11-25 08:50:59,590 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 08:50:59,601 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 08:50:59,602 INFO L255 TraceCheckSpWp]: Trace formula consists of 62 conjuncts, 19 conjunts are in the unsatisfiable core [2019-11-25 08:50:59,602 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-25 08:50:59,607 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2019-11-25 08:50:59,608 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-25 08:50:59,614 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-25 08:50:59,614 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-25 08:50:59,614 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:15 [2019-11-25 08:50:59,702 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 08:50:59,702 INFO L255 TraceCheckSpWp]: Trace formula consists of 20 conjuncts, 8 conjunts are in the unsatisfiable core [2019-11-25 08:50:59,703 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-25 08:50:59,738 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-25 08:50:59,738 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and with honda bouncer for loop.6 stem predicates 3 loop predicates [2019-11-25 08:50:59,738 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 31 states and 40 transitions. cyclomatic complexity: 13 Second operand 9 states. [2019-11-25 08:50:59,976 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 31 states and 40 transitions. cyclomatic complexity: 13. Second operand 9 states. Result 62 states and 83 transitions. Complement of second has 15 states. [2019-11-25 08:50:59,978 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 11 states 6 stem states 3 non-accepting loop states 2 accepting loop states [2019-11-25 08:50:59,979 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2019-11-25 08:50:59,979 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 28 transitions. [2019-11-25 08:50:59,979 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 11 states and 28 transitions. Stem has 11 letters. Loop has 3 letters. [2019-11-25 08:50:59,979 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-25 08:50:59,979 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 11 states and 28 transitions. Stem has 14 letters. Loop has 3 letters. [2019-11-25 08:50:59,980 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-25 08:50:59,980 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 11 states and 28 transitions. Stem has 11 letters. Loop has 6 letters. [2019-11-25 08:50:59,980 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-25 08:50:59,980 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 62 states and 83 transitions. [2019-11-25 08:50:59,982 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 13 [2019-11-25 08:50:59,984 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 62 states to 57 states and 76 transitions. [2019-11-25 08:50:59,984 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 24 [2019-11-25 08:50:59,984 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 26 [2019-11-25 08:50:59,984 INFO L73 IsDeterministic]: Start isDeterministic. Operand 57 states and 76 transitions. [2019-11-25 08:50:59,984 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-11-25 08:50:59,984 INFO L688 BuchiCegarLoop]: Abstraction has 57 states and 76 transitions. [2019-11-25 08:50:59,985 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states and 76 transitions. [2019-11-25 08:50:59,988 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 49. [2019-11-25 08:50:59,988 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 49 states. [2019-11-25 08:50:59,989 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 66 transitions. [2019-11-25 08:50:59,989 INFO L711 BuchiCegarLoop]: Abstraction has 49 states and 66 transitions. [2019-11-25 08:50:59,989 INFO L591 BuchiCegarLoop]: Abstraction has 49 states and 66 transitions. [2019-11-25 08:50:59,989 INFO L424 BuchiCegarLoop]: ======== Iteration 7============ [2019-11-25 08:50:59,989 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 49 states and 66 transitions. [2019-11-25 08:50:59,990 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 13 [2019-11-25 08:50:59,990 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-25 08:50:59,990 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-25 08:50:59,991 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [3, 3, 1, 1, 1, 1, 1, 1] [2019-11-25 08:50:59,991 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1] [2019-11-25 08:50:59,991 INFO L794 eck$LassoCheckResult]: Stem: 852#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; 846#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; 847#L531 assume !(main_~array_size~0 < 1 || main_~array_size~0 >= 536870911); 853#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; 844#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; 840#L536-2 main_#t~post10 := main_~i~1;main_~i~1 := 1 + main_#t~post10;havoc main_#t~post10; 841#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; 845#L536-2 main_#t~post10 := main_~i~1;main_~i~1 := 1 + main_#t~post10;havoc main_#t~post10; 860#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; 861#L536-2 main_#t~post10 := main_~i~1;main_~i~1 := 1 + main_#t~post10;havoc main_#t~post10; 866#L536-3 assume !(main_~i~1 < main_~array_size~0); 848#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; 838#L515-3 [2019-11-25 08:50:59,991 INFO L796 eck$LassoCheckResult]: Loop: 838#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; 842#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); 856#L521 assume SelectionSort_#t~mem4 < SelectionSort_#t~mem5;havoc SelectionSort_#t~mem5;havoc SelectionSort_#t~mem4;SelectionSort_~min~0 := SelectionSort_~j~0; 857#L519-2 SelectionSort_#t~pre3 := 1 + SelectionSort_~j~0;SelectionSort_~j~0 := 1 + SelectionSort_~j~0;havoc SelectionSort_#t~pre3; 855#L519-3 assume !(SelectionSort_~j~0 < SelectionSort_~array_size); 834#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); 835#L515-2 SelectionSort_#t~pre2 := 1 + SelectionSort_~i~0;SelectionSort_~i~0 := 1 + SelectionSort_~i~0;havoc SelectionSort_#t~pre2; 838#L515-3 [2019-11-25 08:50:59,991 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 08:50:59,992 INFO L82 PathProgramCache]: Analyzing trace with hash -304680909, now seen corresponding path program 3 times [2019-11-25 08:50:59,992 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-25 08:50:59,992 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1833134445] [2019-11-25 08:50:59,992 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-25 08:50:59,999 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-25 08:51:00,005 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-25 08:51:00,007 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-25 08:51:00,008 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 08:51:00,008 INFO L82 PathProgramCache]: Analyzing trace with hash 347385690, now seen corresponding path program 4 times [2019-11-25 08:51:00,008 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-25 08:51:00,008 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [612419164] [2019-11-25 08:51:00,008 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-25 08:51:00,013 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-25 08:51:00,017 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-25 08:51:00,019 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-25 08:51:00,019 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 08:51:00,019 INFO L82 PathProgramCache]: Analyzing trace with hash 1848279784, now seen corresponding path program 3 times [2019-11-25 08:51:00,020 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-25 08:51:00,020 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1302770470] [2019-11-25 08:51:00,020 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-25 08:51:00,030 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 08:51:00,127 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 5 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-25 08:51:00,127 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1302770470] [2019-11-25 08:51:00,127 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [849101372] [2019-11-25 08:51:00,127 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_e2c8543a-5ef0-41a9-9bfa-dfacdeeb282a/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 [2019-11-25 08:51:00,193 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2019-11-25 08:51:00,194 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-25 08:51:00,194 INFO L255 TraceCheckSpWp]: Trace formula consists of 98 conjuncts, 10 conjunts are in the unsatisfiable core [2019-11-25 08:51:00,196 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-25 08:51:00,272 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 4 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-25 08:51:00,272 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-25 08:51:00,272 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 9] total 17 [2019-11-25 08:51:00,272 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [570296763] [2019-11-25 08:51:00,383 WARN L192 SmtUtils]: Spent 109.00 ms on a formula simplification. DAG size of input: 75 DAG size of output: 60 [2019-11-25 08:51:00,407 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-25 08:51:00,407 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2019-11-25 08:51:00,407 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=51, Invalid=221, Unknown=0, NotChecked=0, Total=272 [2019-11-25 08:51:00,407 INFO L87 Difference]: Start difference. First operand 49 states and 66 transitions. cyclomatic complexity: 25 Second operand 17 states. [2019-11-25 08:51:00,657 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-25 08:51:00,657 INFO L93 Difference]: Finished difference Result 61 states and 82 transitions. [2019-11-25 08:51:00,657 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-11-25 08:51:00,657 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 61 states and 82 transitions. [2019-11-25 08:51:00,658 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 16 [2019-11-25 08:51:00,659 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 61 states to 61 states and 82 transitions. [2019-11-25 08:51:00,659 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 34 [2019-11-25 08:51:00,660 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 34 [2019-11-25 08:51:00,660 INFO L73 IsDeterministic]: Start isDeterministic. Operand 61 states and 82 transitions. [2019-11-25 08:51:00,660 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-11-25 08:51:00,660 INFO L688 BuchiCegarLoop]: Abstraction has 61 states and 82 transitions. [2019-11-25 08:51:00,660 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61 states and 82 transitions. [2019-11-25 08:51:00,664 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61 to 53. [2019-11-25 08:51:00,664 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 53 states. [2019-11-25 08:51:00,665 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 71 transitions. [2019-11-25 08:51:00,665 INFO L711 BuchiCegarLoop]: Abstraction has 53 states and 71 transitions. [2019-11-25 08:51:00,665 INFO L591 BuchiCegarLoop]: Abstraction has 53 states and 71 transitions. [2019-11-25 08:51:00,665 INFO L424 BuchiCegarLoop]: ======== Iteration 8============ [2019-11-25 08:51:00,665 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 53 states and 71 transitions. [2019-11-25 08:51:00,666 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 13 [2019-11-25 08:51:00,666 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-25 08:51:00,666 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-25 08:51:00,667 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-25 08:51:00,667 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2019-11-25 08:51:00,667 INFO L794 eck$LassoCheckResult]: Stem: 1048#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; 1041#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; 1042#L531 assume !(main_~array_size~0 < 1 || main_~array_size~0 >= 536870911); 1049#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; 1039#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; 1036#L536-2 main_#t~post10 := main_~i~1;main_~i~1 := 1 + main_#t~post10;havoc main_#t~post10; 1037#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; 1040#L536-2 main_#t~post10 := main_~i~1;main_~i~1 := 1 + main_#t~post10;havoc main_#t~post10; 1055#L536-3 assume !(main_~i~1 < main_~array_size~0); 1057#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; 1069#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; 1065#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); 1066#L521 [2019-11-25 08:51:00,667 INFO L796 eck$LassoCheckResult]: Loop: 1066#L521 assume !(SelectionSort_#t~mem4 < SelectionSort_#t~mem5);havoc SelectionSort_#t~mem5;havoc SelectionSort_#t~mem4; 1074#L519-2 SelectionSort_#t~pre3 := 1 + SelectionSort_~j~0;SelectionSort_~j~0 := 1 + SelectionSort_~j~0;havoc SelectionSort_#t~pre3; 1075#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); 1066#L521 [2019-11-25 08:51:00,667 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 08:51:00,667 INFO L82 PathProgramCache]: Analyzing trace with hash -304736135, now seen corresponding path program 1 times [2019-11-25 08:51:00,668 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-25 08:51:00,668 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1480859683] [2019-11-25 08:51:00,668 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-25 08:51:00,676 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-25 08:51:00,684 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-25 08:51:00,687 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-25 08:51:00,688 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 08:51:00,688 INFO L82 PathProgramCache]: Analyzing trace with hash 73540, now seen corresponding path program 1 times [2019-11-25 08:51:00,688 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-25 08:51:00,688 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [528001735] [2019-11-25 08:51:00,688 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-25 08:51:00,691 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-25 08:51:00,692 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-25 08:51:00,694 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-25 08:51:00,694 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 08:51:00,694 INFO L82 PathProgramCache]: Analyzing trace with hash 1166709708, now seen corresponding path program 1 times [2019-11-25 08:51:00,694 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-25 08:51:00,695 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [59792446] [2019-11-25 08:51:00,695 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-25 08:51:00,702 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 08:51:00,760 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 1 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-25 08:51:00,760 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [59792446] [2019-11-25 08:51:00,760 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [204758444] [2019-11-25 08:51:00,760 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_e2c8543a-5ef0-41a9-9bfa-dfacdeeb282a/bin/uautomizer/z3 Starting monitored process 27 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 27 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-25 08:51:00,797 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 08:51:00,797 INFO L255 TraceCheckSpWp]: Trace formula consists of 87 conjuncts, 10 conjunts are in the unsatisfiable core [2019-11-25 08:51:00,798 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-25 08:51:00,850 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 1 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-25 08:51:00,850 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-25 08:51:00,851 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 12 [2019-11-25 08:51:00,851 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1886738903] [2019-11-25 08:51:00,890 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-25 08:51:00,890 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-11-25 08:51:00,890 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=121, Unknown=0, NotChecked=0, Total=156 [2019-11-25 08:51:00,891 INFO L87 Difference]: Start difference. First operand 53 states and 71 transitions. cyclomatic complexity: 26 Second operand 13 states. [2019-11-25 08:51:01,018 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-25 08:51:01,018 INFO L93 Difference]: Finished difference Result 55 states and 63 transitions. [2019-11-25 08:51:01,018 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-11-25 08:51:01,019 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 55 states and 63 transitions. [2019-11-25 08:51:01,019 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 7 [2019-11-25 08:51:01,020 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 55 states to 24 states and 28 transitions. [2019-11-25 08:51:01,020 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 17 [2019-11-25 08:51:01,020 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 17 [2019-11-25 08:51:01,020 INFO L73 IsDeterministic]: Start isDeterministic. Operand 24 states and 28 transitions. [2019-11-25 08:51:01,021 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-11-25 08:51:01,021 INFO L688 BuchiCegarLoop]: Abstraction has 24 states and 28 transitions. [2019-11-25 08:51:01,021 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states and 28 transitions. [2019-11-25 08:51:01,022 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 23. [2019-11-25 08:51:01,022 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23 states. [2019-11-25 08:51:01,022 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 27 transitions. [2019-11-25 08:51:01,023 INFO L711 BuchiCegarLoop]: Abstraction has 23 states and 27 transitions. [2019-11-25 08:51:01,023 INFO L591 BuchiCegarLoop]: Abstraction has 23 states and 27 transitions. [2019-11-25 08:51:01,023 INFO L424 BuchiCegarLoop]: ======== Iteration 9============ [2019-11-25 08:51:01,023 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 23 states and 27 transitions. [2019-11-25 08:51:01,023 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 7 [2019-11-25 08:51:01,023 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-25 08:51:01,023 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-25 08:51:01,024 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-25 08:51:01,024 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1] [2019-11-25 08:51:01,024 INFO L794 eck$LassoCheckResult]: Stem: 1219#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; 1216#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; 1217#L531 assume !(main_~array_size~0 < 1 || main_~array_size~0 >= 536870911); 1220#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; 1212#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; 1213#L536-2 main_#t~post10 := main_~i~1;main_~i~1 := 1 + main_#t~post10;havoc main_#t~post10; 1226#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; 1209#L536-2 main_#t~post10 := main_~i~1;main_~i~1 := 1 + main_#t~post10;havoc main_#t~post10; 1210#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; 1214#L536-2 main_#t~post10 := main_~i~1;main_~i~1 := 1 + main_#t~post10;havoc main_#t~post10; 1224#L536-3 assume !(main_~i~1 < main_~array_size~0); 1215#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; 1211#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; 1204#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); 1205#L521 assume !(SelectionSort_#t~mem4 < SelectionSort_#t~mem5);havoc SelectionSort_#t~mem5;havoc SelectionSort_#t~mem4; 1218#L519-2 SelectionSort_#t~pre3 := 1 + SelectionSort_~j~0;SelectionSort_~j~0 := 1 + SelectionSort_~j~0;havoc SelectionSort_#t~pre3; 1221#L519-3 [2019-11-25 08:51:01,024 INFO L796 eck$LassoCheckResult]: Loop: 1221#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); 1223#L521 assume SelectionSort_#t~mem4 < SelectionSort_#t~mem5;havoc SelectionSort_#t~mem5;havoc SelectionSort_#t~mem4;SelectionSort_~min~0 := SelectionSort_~j~0; 1225#L519-2 SelectionSort_#t~pre3 := 1 + SelectionSort_~j~0;SelectionSort_~j~0 := 1 + SelectionSort_~j~0;havoc SelectionSort_#t~pre3; 1222#L519-3 assume !(SelectionSort_~j~0 < SelectionSort_~array_size); 1206#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); 1207#L515-2 SelectionSort_#t~pre2 := 1 + SelectionSort_~i~0;SelectionSort_~i~0 := 1 + SelectionSort_~i~0;havoc SelectionSort_#t~pre2; 1208#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; 1221#L519-3 [2019-11-25 08:51:01,024 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 08:51:01,025 INFO L82 PathProgramCache]: Analyzing trace with hash 1270631965, now seen corresponding path program 2 times [2019-11-25 08:51:01,025 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-25 08:51:01,025 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [229485546] [2019-11-25 08:51:01,025 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-25 08:51:01,036 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-25 08:51:01,045 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-25 08:51:01,048 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-25 08:51:01,049 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 08:51:01,049 INFO L82 PathProgramCache]: Analyzing trace with hash -1053193502, now seen corresponding path program 5 times [2019-11-25 08:51:01,049 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-25 08:51:01,049 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [816474492] [2019-11-25 08:51:01,050 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-25 08:51:01,053 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-25 08:51:01,057 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-25 08:51:01,059 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-25 08:51:01,059 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 08:51:01,059 INFO L82 PathProgramCache]: Analyzing trace with hash 38430022, now seen corresponding path program 1 times [2019-11-25 08:51:01,060 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-25 08:51:01,060 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [819818344] [2019-11-25 08:51:01,060 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-25 08:51:01,072 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-25 08:51:01,083 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-25 08:51:01,094 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-25 08:51:01,213 WARN L192 SmtUtils]: Spent 107.00 ms on a formula simplification. DAG size of input: 78 DAG size of output: 69 [2019-11-25 08:51:01,589 WARN L192 SmtUtils]: Spent 301.00 ms on a formula simplification. DAG size of input: 151 DAG size of output: 114 [2019-11-25 08:51:01,664 INFO L210 LassoAnalysis]: Preferences: [2019-11-25 08:51:01,664 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2019-11-25 08:51:01,664 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-11-25 08:51:01,664 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2019-11-25 08:51:01,664 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2019-11-25 08:51:01,664 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-25 08:51:01,664 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2019-11-25 08:51:01,665 INFO L132 ssoRankerPreferences]: Path of dumped script: [2019-11-25 08:51:01,665 INFO L133 ssoRankerPreferences]: Filename of dumped script: selectionsort-alloca-1.i_Iteration9_Lasso [2019-11-25 08:51:01,665 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2019-11-25 08:51:01,665 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2019-11-25 08:51:01,667 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-25 08:51:01,671 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-25 08:51:01,673 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-25 08:51:01,675 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-25 08:51:01,677 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-25 08:51:01,680 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-25 08:51:01,681 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-25 08:51:01,683 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-25 08:51:01,685 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-25 08:51:01,687 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-25 08:51:01,689 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-25 08:51:01,850 WARN L192 SmtUtils]: Spent 109.00 ms on a formula simplification. DAG size of input: 72 DAG size of output: 66 [2019-11-25 08:51:01,971 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-25 08:51:01,973 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-25 08:51:01,976 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-25 08:51:01,978 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-25 08:51:01,980 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-25 08:51:01,982 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-25 08:51:02,330 INFO L292 LassoAnalysis]: Preprocessing complete. [2019-11-25 08:51:02,330 INFO L489 LassoAnalysis]: Using template 'affine'. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_e2c8543a-5ef0-41a9-9bfa-dfacdeeb282a/bin/uautomizer/z3 Starting monitored process 28 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 28 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-25 08:51:02,337 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-25 08:51:02,338 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-25 08:51:02,339 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-25 08:51:02,339 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-25 08:51:02,339 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-25 08:51:02,339 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-25 08:51:02,339 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-25 08:51:02,340 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-25 08:51:02,341 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_e2c8543a-5ef0-41a9-9bfa-dfacdeeb282a/bin/uautomizer/z3 Starting monitored process 29 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 29 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-25 08:51:02,345 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-25 08:51:02,346 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-25 08:51:02,346 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-25 08:51:02,346 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-25 08:51:02,346 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-25 08:51:02,347 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-25 08:51:02,347 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-25 08:51:02,349 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_e2c8543a-5ef0-41a9-9bfa-dfacdeeb282a/bin/uautomizer/z3 Starting monitored process 30 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 30 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-25 08:51:02,353 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-25 08:51:02,354 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-25 08:51:02,355 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-25 08:51:02,355 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-25 08:51:02,355 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-25 08:51:02,355 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-25 08:51:02,355 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-25 08:51:02,355 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-25 08:51:02,356 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_e2c8543a-5ef0-41a9-9bfa-dfacdeeb282a/bin/uautomizer/z3 Starting monitored process 31 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 31 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-25 08:51:02,360 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-25 08:51:02,361 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-25 08:51:02,361 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-25 08:51:02,361 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-25 08:51:02,361 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-25 08:51:02,361 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-25 08:51:02,362 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-25 08:51:02,362 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-25 08:51:02,363 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_e2c8543a-5ef0-41a9-9bfa-dfacdeeb282a/bin/uautomizer/z3 Starting monitored process 32 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 32 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-25 08:51:02,366 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-25 08:51:02,367 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-25 08:51:02,367 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-25 08:51:02,368 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-25 08:51:02,368 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-25 08:51:02,369 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-25 08:51:02,369 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-25 08:51:02,371 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_e2c8543a-5ef0-41a9-9bfa-dfacdeeb282a/bin/uautomizer/z3 Starting monitored process 33 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 33 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-25 08:51:02,375 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-25 08:51:02,376 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-25 08:51:02,376 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-25 08:51:02,377 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-25 08:51:02,377 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-25 08:51:02,377 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-25 08:51:02,377 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-25 08:51:02,377 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-25 08:51:02,381 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_e2c8543a-5ef0-41a9-9bfa-dfacdeeb282a/bin/uautomizer/z3 Starting monitored process 34 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-11-25 08:51:02,399 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-25 08:51:02,400 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-25 08:51:02,401 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-25 08:51:02,401 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-25 08:51:02,401 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-25 08:51:02,402 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-25 08:51:02,403 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. Waiting until toolchain timeout for monitored process 34 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-25 08:51:02,406 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_e2c8543a-5ef0-41a9-9bfa-dfacdeeb282a/bin/uautomizer/z3 Starting monitored process 35 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-11-25 08:51:02,414 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-25 08:51:02,416 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-25 08:51:02,416 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-25 08:51:02,416 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-25 08:51:02,416 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-25 08:51:02,416 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-25 08:51:02,417 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-25 08:51:02,417 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. Waiting until toolchain timeout for monitored process 35 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-25 08:51:02,420 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_e2c8543a-5ef0-41a9-9bfa-dfacdeeb282a/bin/uautomizer/z3 Starting monitored process 36 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-11-25 08:51:02,428 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-25 08:51:02,430 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-25 08:51:02,430 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-25 08:51:02,430 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-25 08:51:02,430 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-25 08:51:02,430 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-25 08:51:02,431 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-25 08:51:02,431 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. Waiting until toolchain timeout for monitored process 36 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-25 08:51:02,432 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_e2c8543a-5ef0-41a9-9bfa-dfacdeeb282a/bin/uautomizer/z3 Starting monitored process 37 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-11-25 08:51:02,441 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-25 08:51:02,442 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-25 08:51:02,443 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-25 08:51:02,443 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-25 08:51:02,443 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-25 08:51:02,443 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-25 08:51:02,443 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-25 08:51:02,443 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. Waiting until toolchain timeout for monitored process 37 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-25 08:51:02,445 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_e2c8543a-5ef0-41a9-9bfa-dfacdeeb282a/bin/uautomizer/z3 Starting monitored process 38 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 38 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-25 08:51:02,450 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-25 08:51:02,452 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-25 08:51:02,452 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-25 08:51:02,452 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-25 08:51:02,452 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-25 08:51:02,454 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-25 08:51:02,454 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-25 08:51:02,458 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_e2c8543a-5ef0-41a9-9bfa-dfacdeeb282a/bin/uautomizer/z3 Starting monitored process 39 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 39 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-25 08:51:02,462 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-25 08:51:02,463 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-25 08:51:02,464 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-25 08:51:02,464 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-25 08:51:02,464 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-25 08:51:02,467 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-25 08:51:02,468 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-25 08:51:02,475 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_e2c8543a-5ef0-41a9-9bfa-dfacdeeb282a/bin/uautomizer/z3 Starting monitored process 40 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 40 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-25 08:51:02,481 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-25 08:51:02,483 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-25 08:51:02,483 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-25 08:51:02,483 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-25 08:51:02,483 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-25 08:51:02,487 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-25 08:51:02,487 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-25 08:51:02,493 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_e2c8543a-5ef0-41a9-9bfa-dfacdeeb282a/bin/uautomizer/z3 Starting monitored process 41 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 41 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-25 08:51:02,497 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-25 08:51:02,499 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-25 08:51:02,499 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-25 08:51:02,500 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-25 08:51:02,500 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-25 08:51:02,510 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-25 08:51:02,510 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-25 08:51:02,540 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-11-25 08:51:02,568 INFO L443 ModelExtractionUtils]: Simplification made 10 calls to the SMT solver. [2019-11-25 08:51:02,569 INFO L444 ModelExtractionUtils]: 7 out of 46 variables were initially zero. Simplification set additionally 35 variables to zero. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_e2c8543a-5ef0-41a9-9bfa-dfacdeeb282a/bin/uautomizer/z3 Starting monitored process 42 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 42 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-25 08:51:02,571 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-11-25 08:51:02,573 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2019-11-25 08:51:02,574 INFO L510 LassoAnalysis]: Proved termination. [2019-11-25 08:51:02,574 INFO L512 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_SelectionSort_~i~0, v_rep(select #length ULTIMATE.start_SelectionSort_~a.base)_3, ULTIMATE.start_SelectionSort_~a.offset) = -4*ULTIMATE.start_SelectionSort_~i~0 + 1*v_rep(select #length ULTIMATE.start_SelectionSort_~a.base)_3 - 1*ULTIMATE.start_SelectionSort_~a.offset Supporting invariants [] [2019-11-25 08:51:02,593 INFO L297 tatePredicateManager]: 9 out of 9 supporting invariants were superfluous and have been removed [2019-11-25 08:51:02,594 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2019-11-25 08:51:02,604 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 08:51:02,620 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 08:51:02,620 INFO L255 TraceCheckSpWp]: Trace formula consists of 84 conjuncts, 2 conjunts are in the unsatisfiable core [2019-11-25 08:51:02,621 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-25 08:51:02,629 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 08:51:02,629 INFO L255 TraceCheckSpWp]: Trace formula consists of 35 conjuncts, 7 conjunts are in the unsatisfiable core [2019-11-25 08:51:02,630 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-25 08:51:02,674 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-25 08:51:02,674 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 5 loop predicates [2019-11-25 08:51:02,674 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 23 states and 27 transitions. cyclomatic complexity: 6 Second operand 6 states. [2019-11-25 08:51:02,770 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 23 states and 27 transitions. cyclomatic complexity: 6. Second operand 6 states. Result 31 states and 39 transitions. Complement of second has 10 states. [2019-11-25 08:51:02,771 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 6 states 1 stem states 4 non-accepting loop states 1 accepting loop states [2019-11-25 08:51:02,771 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2019-11-25 08:51:02,771 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 22 transitions. [2019-11-25 08:51:02,772 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 22 transitions. Stem has 16 letters. Loop has 7 letters. [2019-11-25 08:51:02,772 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-25 08:51:02,772 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 22 transitions. Stem has 23 letters. Loop has 7 letters. [2019-11-25 08:51:02,772 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-25 08:51:02,773 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 22 transitions. Stem has 16 letters. Loop has 14 letters. [2019-11-25 08:51:02,773 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-25 08:51:02,773 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 31 states and 39 transitions. [2019-11-25 08:51:02,774 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2019-11-25 08:51:02,774 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 31 states to 28 states and 36 transitions. [2019-11-25 08:51:02,774 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 14 [2019-11-25 08:51:02,774 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 15 [2019-11-25 08:51:02,775 INFO L73 IsDeterministic]: Start isDeterministic. Operand 28 states and 36 transitions. [2019-11-25 08:51:02,775 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-11-25 08:51:02,775 INFO L688 BuchiCegarLoop]: Abstraction has 28 states and 36 transitions. [2019-11-25 08:51:02,775 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states and 36 transitions. [2019-11-25 08:51:02,776 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 27. [2019-11-25 08:51:02,777 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27 states. [2019-11-25 08:51:02,777 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 34 transitions. [2019-11-25 08:51:02,777 INFO L711 BuchiCegarLoop]: Abstraction has 27 states and 34 transitions. [2019-11-25 08:51:02,777 INFO L591 BuchiCegarLoop]: Abstraction has 27 states and 34 transitions. [2019-11-25 08:51:02,777 INFO L424 BuchiCegarLoop]: ======== Iteration 10============ [2019-11-25 08:51:02,778 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 27 states and 34 transitions. [2019-11-25 08:51:02,778 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2019-11-25 08:51:02,778 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-25 08:51:02,778 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-25 08:51:02,779 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-25 08:51:02,779 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2019-11-25 08:51:02,779 INFO L794 eck$LassoCheckResult]: Stem: 1415#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; 1410#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; 1411#L531 assume !(main_~array_size~0 < 1 || main_~array_size~0 >= 536870911); 1416#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; 1408#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; 1404#L536-2 main_#t~post10 := main_~i~1;main_~i~1 := 1 + main_#t~post10;havoc main_#t~post10; 1405#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; 1409#L536-2 main_#t~post10 := main_~i~1;main_~i~1 := 1 + main_#t~post10;havoc main_#t~post10; 1421#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; 1419#L536-2 main_#t~post10 := main_~i~1;main_~i~1 := 1 + main_#t~post10;havoc main_#t~post10; 1418#L536-3 assume !(main_~i~1 < main_~array_size~0); 1412#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; 1406#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; 1407#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); 1423#L521 assume !(SelectionSort_#t~mem4 < SelectionSort_#t~mem5);havoc SelectionSort_#t~mem5;havoc SelectionSort_#t~mem4; 1422#L519-2 SelectionSort_#t~pre3 := 1 + SelectionSort_~j~0;SelectionSort_~j~0 := 1 + SelectionSort_~j~0;havoc SelectionSort_#t~pre3; 1420#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); 1398#L521 [2019-11-25 08:51:02,779 INFO L796 eck$LassoCheckResult]: Loop: 1398#L521 assume SelectionSort_#t~mem4 < SelectionSort_#t~mem5;havoc SelectionSort_#t~mem5;havoc SelectionSort_#t~mem4;SelectionSort_~min~0 := SelectionSort_~j~0; 1413#L519-2 SelectionSort_#t~pre3 := 1 + SelectionSort_~j~0;SelectionSort_~j~0 := 1 + SelectionSort_~j~0;havoc SelectionSort_#t~pre3; 1397#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); 1398#L521 [2019-11-25 08:51:02,779 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 08:51:02,780 INFO L82 PathProgramCache]: Analyzing trace with hash 734885290, now seen corresponding path program 3 times [2019-11-25 08:51:02,780 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-25 08:51:02,780 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [935746425] [2019-11-25 08:51:02,780 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-25 08:51:02,790 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-25 08:51:02,799 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-25 08:51:02,803 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-25 08:51:02,804 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 08:51:02,804 INFO L82 PathProgramCache]: Analyzing trace with hash 71618, now seen corresponding path program 2 times [2019-11-25 08:51:02,804 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-25 08:51:02,804 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1639270492] [2019-11-25 08:51:02,805 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-25 08:51:02,807 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-25 08:51:02,809 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-25 08:51:02,811 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-25 08:51:02,811 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 08:51:02,811 INFO L82 PathProgramCache]: Analyzing trace with hash 1519408505, now seen corresponding path program 1 times [2019-11-25 08:51:02,811 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-25 08:51:02,812 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [430212260] [2019-11-25 08:51:02,812 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-25 08:51:02,820 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 08:51:02,899 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 5 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-25 08:51:02,899 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [430212260] [2019-11-25 08:51:02,899 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [371717725] [2019-11-25 08:51:02,899 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_e2c8543a-5ef0-41a9-9bfa-dfacdeeb282a/bin/uautomizer/z3 Starting monitored process 43 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 43 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-25 08:51:02,948 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 08:51:02,948 INFO L255 TraceCheckSpWp]: Trace formula consists of 111 conjuncts, 12 conjunts are in the unsatisfiable core [2019-11-25 08:51:02,949 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-25 08:51:03,015 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 5 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-25 08:51:03,015 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-25 08:51:03,015 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 15 [2019-11-25 08:51:03,016 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1270095716] [2019-11-25 08:51:03,084 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-25 08:51:03,084 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2019-11-25 08:51:03,084 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=52, Invalid=188, Unknown=0, NotChecked=0, Total=240 [2019-11-25 08:51:03,084 INFO L87 Difference]: Start difference. First operand 27 states and 34 transitions. cyclomatic complexity: 10 Second operand 16 states. [2019-11-25 08:51:03,330 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-25 08:51:03,330 INFO L93 Difference]: Finished difference Result 63 states and 79 transitions. [2019-11-25 08:51:03,330 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2019-11-25 08:51:03,330 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 63 states and 79 transitions. [2019-11-25 08:51:03,331 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2019-11-25 08:51:03,332 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 63 states to 30 states and 37 transitions. [2019-11-25 08:51:03,332 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 14 [2019-11-25 08:51:03,332 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 14 [2019-11-25 08:51:03,332 INFO L73 IsDeterministic]: Start isDeterministic. Operand 30 states and 37 transitions. [2019-11-25 08:51:03,332 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-11-25 08:51:03,332 INFO L688 BuchiCegarLoop]: Abstraction has 30 states and 37 transitions. [2019-11-25 08:51:03,332 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states and 37 transitions. [2019-11-25 08:51:03,333 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 29. [2019-11-25 08:51:03,334 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29 states. [2019-11-25 08:51:03,334 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 36 transitions. [2019-11-25 08:51:03,334 INFO L711 BuchiCegarLoop]: Abstraction has 29 states and 36 transitions. [2019-11-25 08:51:03,334 INFO L591 BuchiCegarLoop]: Abstraction has 29 states and 36 transitions. [2019-11-25 08:51:03,334 INFO L424 BuchiCegarLoop]: ======== Iteration 11============ [2019-11-25 08:51:03,334 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 29 states and 36 transitions. [2019-11-25 08:51:03,335 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2019-11-25 08:51:03,335 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-25 08:51:03,335 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-25 08:51:03,335 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [4, 4, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-25 08:51:03,335 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2019-11-25 08:51:03,336 INFO L794 eck$LassoCheckResult]: Stem: 1602#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; 1597#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; 1598#L531 assume !(main_~array_size~0 < 1 || main_~array_size~0 >= 536870911); 1603#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; 1594#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; 1595#L536-2 main_#t~post10 := main_~i~1;main_~i~1 := 1 + main_#t~post10;havoc main_#t~post10; 1596#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; 1590#L536-2 main_#t~post10 := main_~i~1;main_~i~1 := 1 + main_#t~post10;havoc main_#t~post10; 1591#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; 1611#L536-2 main_#t~post10 := main_~i~1;main_~i~1 := 1 + main_#t~post10;havoc main_#t~post10; 1610#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; 1606#L536-2 main_#t~post10 := main_~i~1;main_~i~1 := 1 + main_#t~post10;havoc main_#t~post10; 1605#L536-3 assume !(main_~i~1 < main_~array_size~0); 1599#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; 1592#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; 1593#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); 1609#L521 assume !(SelectionSort_#t~mem4 < SelectionSort_#t~mem5);havoc SelectionSort_#t~mem5;havoc SelectionSort_#t~mem4; 1608#L519-2 SelectionSort_#t~pre3 := 1 + SelectionSort_~j~0;SelectionSort_~j~0 := 1 + SelectionSort_~j~0;havoc SelectionSort_#t~pre3; 1607#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); 1584#L521 [2019-11-25 08:51:03,336 INFO L796 eck$LassoCheckResult]: Loop: 1584#L521 assume SelectionSort_#t~mem4 < SelectionSort_#t~mem5;havoc SelectionSort_#t~mem5;havoc SelectionSort_#t~mem4;SelectionSort_~min~0 := SelectionSort_~j~0; 1600#L519-2 SelectionSort_#t~pre3 := 1 + SelectionSort_~j~0;SelectionSort_~j~0 := 1 + SelectionSort_~j~0;havoc SelectionSort_#t~pre3; 1583#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); 1584#L521 [2019-11-25 08:51:03,336 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 08:51:03,336 INFO L82 PathProgramCache]: Analyzing trace with hash -1931519992, now seen corresponding path program 4 times [2019-11-25 08:51:03,336 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-25 08:51:03,336 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1005273575] [2019-11-25 08:51:03,336 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-25 08:51:03,346 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-25 08:51:03,360 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-25 08:51:03,373 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-25 08:51:03,374 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 08:51:03,374 INFO L82 PathProgramCache]: Analyzing trace with hash 71618, now seen corresponding path program 3 times [2019-11-25 08:51:03,374 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-25 08:51:03,374 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1139790335] [2019-11-25 08:51:03,375 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-25 08:51:03,377 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-25 08:51:03,378 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-25 08:51:03,380 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-25 08:51:03,381 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 08:51:03,381 INFO L82 PathProgramCache]: Analyzing trace with hash 2059791963, now seen corresponding path program 2 times [2019-11-25 08:51:03,381 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-25 08:51:03,381 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [423017907] [2019-11-25 08:51:03,381 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-25 08:51:03,406 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-25 08:51:03,424 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-25 08:51:03,428 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-25 08:51:03,948 WARN L192 SmtUtils]: Spent 468.00 ms on a formula simplification. DAG size of input: 181 DAG size of output: 132 [2019-11-25 08:51:04,045 INFO L210 LassoAnalysis]: Preferences: [2019-11-25 08:51:04,045 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2019-11-25 08:51:04,045 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-11-25 08:51:04,045 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2019-11-25 08:51:04,045 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2019-11-25 08:51:04,045 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-25 08:51:04,045 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2019-11-25 08:51:04,045 INFO L132 ssoRankerPreferences]: Path of dumped script: [2019-11-25 08:51:04,045 INFO L133 ssoRankerPreferences]: Filename of dumped script: selectionsort-alloca-1.i_Iteration11_Lasso [2019-11-25 08:51:04,045 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2019-11-25 08:51:04,046 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2019-11-25 08:51:04,047 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-25 08:51:04,052 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-25 08:51:04,054 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-25 08:51:04,056 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-25 08:51:04,058 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-25 08:51:04,062 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-25 08:51:04,064 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-25 08:51:04,202 WARN L192 SmtUtils]: Spent 110.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 62 [2019-11-25 08:51:04,261 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-25 08:51:04,262 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-25 08:51:04,264 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-25 08:51:04,265 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-25 08:51:04,267 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-25 08:51:04,269 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-25 08:51:04,271 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-25 08:51:04,272 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-25 08:51:04,274 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-25 08:51:04,579 INFO L292 LassoAnalysis]: Preprocessing complete. [2019-11-25 08:51:04,579 INFO L489 LassoAnalysis]: Using template 'affine'. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_e2c8543a-5ef0-41a9-9bfa-dfacdeeb282a/bin/uautomizer/z3 Starting monitored process 44 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 44 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-25 08:51:04,584 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-25 08:51:04,585 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-25 08:51:04,585 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-25 08:51:04,585 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-25 08:51:04,585 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-25 08:51:04,585 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-25 08:51:04,586 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-25 08:51:04,586 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-25 08:51:04,587 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_e2c8543a-5ef0-41a9-9bfa-dfacdeeb282a/bin/uautomizer/z3 Starting monitored process 45 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 45 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-25 08:51:04,592 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-25 08:51:04,593 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-25 08:51:04,593 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-25 08:51:04,593 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-25 08:51:04,593 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-25 08:51:04,594 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-25 08:51:04,594 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-25 08:51:04,596 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_e2c8543a-5ef0-41a9-9bfa-dfacdeeb282a/bin/uautomizer/z3 Starting monitored process 46 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 46 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-25 08:51:04,600 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-25 08:51:04,601 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-25 08:51:04,601 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-25 08:51:04,601 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-25 08:51:04,601 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-25 08:51:04,603 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-25 08:51:04,603 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-25 08:51:04,605 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_e2c8543a-5ef0-41a9-9bfa-dfacdeeb282a/bin/uautomizer/z3 Starting monitored process 47 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 47 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-25 08:51:04,609 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-25 08:51:04,610 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-25 08:51:04,610 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-25 08:51:04,611 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-25 08:51:04,611 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-25 08:51:04,612 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-25 08:51:04,612 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-25 08:51:04,617 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_e2c8543a-5ef0-41a9-9bfa-dfacdeeb282a/bin/uautomizer/z3 Starting monitored process 48 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 48 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-25 08:51:04,621 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-25 08:51:04,623 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-25 08:51:04,623 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-25 08:51:04,623 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-25 08:51:04,623 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-25 08:51:04,623 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-25 08:51:04,623 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-25 08:51:04,624 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-25 08:51:04,625 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_e2c8543a-5ef0-41a9-9bfa-dfacdeeb282a/bin/uautomizer/z3 Starting monitored process 49 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 49 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-25 08:51:04,629 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-25 08:51:04,630 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-25 08:51:04,630 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-25 08:51:04,630 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-25 08:51:04,631 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-25 08:51:04,631 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-25 08:51:04,631 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-25 08:51:04,631 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-25 08:51:04,632 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_e2c8543a-5ef0-41a9-9bfa-dfacdeeb282a/bin/uautomizer/z3 Starting monitored process 50 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 50 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-25 08:51:04,636 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-25 08:51:04,638 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-25 08:51:04,638 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-25 08:51:04,638 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-25 08:51:04,638 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-25 08:51:04,645 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-25 08:51:04,645 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-25 08:51:04,659 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-11-25 08:51:04,719 INFO L443 ModelExtractionUtils]: Simplification made 32 calls to the SMT solver. [2019-11-25 08:51:04,719 INFO L444 ModelExtractionUtils]: 12 out of 43 variables were initially zero. Simplification set additionally 27 variables to zero. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_e2c8543a-5ef0-41a9-9bfa-dfacdeeb282a/bin/uautomizer/z3 Starting monitored process 51 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 51 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-25 08:51:04,727 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-11-25 08:51:04,728 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2019-11-25 08:51:04,729 INFO L510 LassoAnalysis]: Proved termination. [2019-11-25 08:51:04,729 INFO L512 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select #length ULTIMATE.start_SelectionSort_~a.base)_4, ULTIMATE.start_SelectionSort_~j~0, ULTIMATE.start_SelectionSort_~a.offset) = 1*v_rep(select #length ULTIMATE.start_SelectionSort_~a.base)_4 - 4*ULTIMATE.start_SelectionSort_~j~0 - 1*ULTIMATE.start_SelectionSort_~a.offset Supporting invariants [] [2019-11-25 08:51:04,749 INFO L297 tatePredicateManager]: 6 out of 6 supporting invariants were superfluous and have been removed [2019-11-25 08:51:04,750 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2019-11-25 08:51:04,760 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 08:51:04,775 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 08:51:04,776 INFO L255 TraceCheckSpWp]: Trace formula consists of 103 conjuncts, 2 conjunts are in the unsatisfiable core [2019-11-25 08:51:04,776 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-25 08:51:04,789 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 08:51:04,790 INFO L255 TraceCheckSpWp]: Trace formula consists of 18 conjuncts, 4 conjunts are in the unsatisfiable core [2019-11-25 08:51:04,790 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-25 08:51:04,798 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-25 08:51:04,798 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2019-11-25 08:51:04,799 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 29 states and 36 transitions. cyclomatic complexity: 10 Second operand 4 states. [2019-11-25 08:51:04,820 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 29 states and 36 transitions. cyclomatic complexity: 10. Second operand 4 states. Result 47 states and 60 transitions. Complement of second has 7 states. [2019-11-25 08:51:04,821 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2019-11-25 08:51:04,822 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2019-11-25 08:51:04,822 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 17 transitions. [2019-11-25 08:51:04,822 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 17 transitions. Stem has 19 letters. Loop has 3 letters. [2019-11-25 08:51:04,822 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-25 08:51:04,822 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 17 transitions. Stem has 22 letters. Loop has 3 letters. [2019-11-25 08:51:04,822 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-25 08:51:04,823 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 17 transitions. Stem has 19 letters. Loop has 6 letters. [2019-11-25 08:51:04,823 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-25 08:51:04,823 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 47 states and 60 transitions. [2019-11-25 08:51:04,824 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2019-11-25 08:51:04,824 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 47 states to 37 states and 46 transitions. [2019-11-25 08:51:04,824 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 12 [2019-11-25 08:51:04,824 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 12 [2019-11-25 08:51:04,824 INFO L73 IsDeterministic]: Start isDeterministic. Operand 37 states and 46 transitions. [2019-11-25 08:51:04,825 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-11-25 08:51:04,825 INFO L688 BuchiCegarLoop]: Abstraction has 37 states and 46 transitions. [2019-11-25 08:51:04,825 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states and 46 transitions. [2019-11-25 08:51:04,826 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 32. [2019-11-25 08:51:04,826 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32 states. [2019-11-25 08:51:04,827 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 41 transitions. [2019-11-25 08:51:04,827 INFO L711 BuchiCegarLoop]: Abstraction has 32 states and 41 transitions. [2019-11-25 08:51:04,827 INFO L591 BuchiCegarLoop]: Abstraction has 32 states and 41 transitions. [2019-11-25 08:51:04,827 INFO L424 BuchiCegarLoop]: ======== Iteration 12============ [2019-11-25 08:51:04,827 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 32 states and 41 transitions. [2019-11-25 08:51:04,827 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2019-11-25 08:51:04,827 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-25 08:51:04,827 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-25 08:51:04,828 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [4, 4, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-25 08:51:04,828 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2019-11-25 08:51:04,828 INFO L794 eck$LassoCheckResult]: Stem: 1791#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; 1786#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; 1787#L531 assume !(main_~array_size~0 < 1 || main_~array_size~0 >= 536870911); 1792#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; 1783#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; 1779#L536-2 main_#t~post10 := main_~i~1;main_~i~1 := 1 + main_#t~post10;havoc main_#t~post10; 1780#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; 1784#L536-2 main_#t~post10 := main_~i~1;main_~i~1 := 1 + main_#t~post10;havoc main_#t~post10; 1801#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; 1800#L536-2 main_#t~post10 := main_~i~1;main_~i~1 := 1 + main_#t~post10;havoc main_#t~post10; 1799#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; 1798#L536-2 main_#t~post10 := main_~i~1;main_~i~1 := 1 + main_#t~post10;havoc main_#t~post10; 1797#L536-3 assume !(main_~i~1 < main_~array_size~0); 1785#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; 1781#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; 1773#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); 1774#L521 assume !(SelectionSort_#t~mem4 < SelectionSort_#t~mem5);havoc SelectionSort_#t~mem5;havoc SelectionSort_#t~mem4; 1788#L519-2 SelectionSort_#t~pre3 := 1 + SelectionSort_~j~0;SelectionSort_~j~0 := 1 + SelectionSort_~j~0;havoc SelectionSort_#t~pre3; 1795#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); 1802#L521 assume !(SelectionSort_#t~mem4 < SelectionSort_#t~mem5);havoc SelectionSort_#t~mem5;havoc SelectionSort_#t~mem4; 1804#L519-2 SelectionSort_#t~pre3 := 1 + SelectionSort_~j~0;SelectionSort_~j~0 := 1 + SelectionSort_~j~0;havoc SelectionSort_#t~pre3; 1775#L519-3 assume !(SelectionSort_~j~0 < SelectionSort_~array_size); 1776#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); 1777#L515-2 SelectionSort_#t~pre2 := 1 + SelectionSort_~i~0;SelectionSort_~i~0 := 1 + SelectionSort_~i~0;havoc SelectionSort_#t~pre2; 1778#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; 1782#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); 1796#L521 [2019-11-25 08:51:04,829 INFO L796 eck$LassoCheckResult]: Loop: 1796#L521 assume SelectionSort_#t~mem4 < SelectionSort_#t~mem5;havoc SelectionSort_#t~mem5;havoc SelectionSort_#t~mem4;SelectionSort_~min~0 := SelectionSort_~j~0; 1793#L519-2 SelectionSort_#t~pre3 := 1 + SelectionSort_~j~0;SelectionSort_~j~0 := 1 + SelectionSort_~j~0;havoc SelectionSort_#t~pre3; 1794#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); 1796#L521 [2019-11-25 08:51:04,829 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 08:51:04,829 INFO L82 PathProgramCache]: Analyzing trace with hash 417927685, now seen corresponding path program 1 times [2019-11-25 08:51:04,829 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-25 08:51:04,829 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [392850895] [2019-11-25 08:51:04,829 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-25 08:51:04,840 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 08:51:04,982 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 14 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-25 08:51:04,982 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [392850895] [2019-11-25 08:51:04,983 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1370724962] [2019-11-25 08:51:04,983 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_e2c8543a-5ef0-41a9-9bfa-dfacdeeb282a/bin/uautomizer/z3 Starting monitored process 52 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 52 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-25 08:51:05,027 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 08:51:05,028 INFO L255 TraceCheckSpWp]: Trace formula consists of 134 conjuncts, 12 conjunts are in the unsatisfiable core [2019-11-25 08:51:05,029 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-25 08:51:05,138 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 13 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-25 08:51:05,138 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-25 08:51:05,139 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 11] total 21 [2019-11-25 08:51:05,139 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1337088941] [2019-11-25 08:51:05,139 INFO L799 eck$LassoCheckResult]: stem already infeasible [2019-11-25 08:51:05,139 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 08:51:05,139 INFO L82 PathProgramCache]: Analyzing trace with hash 71618, now seen corresponding path program 4 times [2019-11-25 08:51:05,139 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-25 08:51:05,139 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1854448448] [2019-11-25 08:51:05,139 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-25 08:51:05,142 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-25 08:51:05,143 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-25 08:51:05,144 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-25 08:51:05,220 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-25 08:51:05,220 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2019-11-25 08:51:05,220 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=74, Invalid=346, Unknown=0, NotChecked=0, Total=420 [2019-11-25 08:51:05,220 INFO L87 Difference]: Start difference. First operand 32 states and 41 transitions. cyclomatic complexity: 13 Second operand 21 states. [2019-11-25 08:51:05,482 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-25 08:51:05,482 INFO L93 Difference]: Finished difference Result 44 states and 58 transitions. [2019-11-25 08:51:05,483 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-11-25 08:51:05,483 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 44 states and 58 transitions. [2019-11-25 08:51:05,483 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2019-11-25 08:51:05,484 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 44 states to 42 states and 55 transitions. [2019-11-25 08:51:05,484 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 12 [2019-11-25 08:51:05,484 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 12 [2019-11-25 08:51:05,485 INFO L73 IsDeterministic]: Start isDeterministic. Operand 42 states and 55 transitions. [2019-11-25 08:51:05,485 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-11-25 08:51:05,485 INFO L688 BuchiCegarLoop]: Abstraction has 42 states and 55 transitions. [2019-11-25 08:51:05,485 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states and 55 transitions. [2019-11-25 08:51:05,486 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 35. [2019-11-25 08:51:05,487 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35 states. [2019-11-25 08:51:05,487 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 45 transitions. [2019-11-25 08:51:05,487 INFO L711 BuchiCegarLoop]: Abstraction has 35 states and 45 transitions. [2019-11-25 08:51:05,487 INFO L591 BuchiCegarLoop]: Abstraction has 35 states and 45 transitions. [2019-11-25 08:51:05,487 INFO L424 BuchiCegarLoop]: ======== Iteration 13============ [2019-11-25 08:51:05,487 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 35 states and 45 transitions. [2019-11-25 08:51:05,488 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2019-11-25 08:51:05,488 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-25 08:51:05,488 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-25 08:51:05,489 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [4, 4, 4, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-25 08:51:05,489 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2019-11-25 08:51:05,489 INFO L794 eck$LassoCheckResult]: Stem: 1978#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; 1973#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; 1974#L531 assume !(main_~array_size~0 < 1 || main_~array_size~0 >= 536870911); 1979#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; 1971#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; 1967#L536-2 main_#t~post10 := main_~i~1;main_~i~1 := 1 + main_#t~post10;havoc main_#t~post10; 1968#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; 1972#L536-2 main_#t~post10 := main_~i~1;main_~i~1 := 1 + main_#t~post10;havoc main_#t~post10; 1989#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; 1988#L536-2 main_#t~post10 := main_~i~1;main_~i~1 := 1 + main_#t~post10;havoc main_#t~post10; 1987#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; 1986#L536-2 main_#t~post10 := main_~i~1;main_~i~1 := 1 + main_#t~post10;havoc main_#t~post10; 1985#L536-3 assume !(main_~i~1 < main_~array_size~0); 1975#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; 1969#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; 1960#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); 1961#L521 assume !(SelectionSort_#t~mem4 < SelectionSort_#t~mem5);havoc SelectionSort_#t~mem5;havoc SelectionSort_#t~mem4; 1976#L519-2 SelectionSort_#t~pre3 := 1 + SelectionSort_~j~0;SelectionSort_~j~0 := 1 + SelectionSort_~j~0;havoc SelectionSort_#t~pre3; 1962#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); 1963#L521 assume !(SelectionSort_#t~mem4 < SelectionSort_#t~mem5);havoc SelectionSort_#t~mem5;havoc SelectionSort_#t~mem4; 1977#L519-2 SelectionSort_#t~pre3 := 1 + SelectionSort_~j~0;SelectionSort_~j~0 := 1 + SelectionSort_~j~0;havoc SelectionSort_#t~pre3; 1982#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); 1992#L521 assume !(SelectionSort_#t~mem4 < SelectionSort_#t~mem5);havoc SelectionSort_#t~mem5;havoc SelectionSort_#t~mem4; 1991#L519-2 SelectionSort_#t~pre3 := 1 + SelectionSort_~j~0;SelectionSort_~j~0 := 1 + SelectionSort_~j~0;havoc SelectionSort_#t~pre3; 1990#L519-3 assume !(SelectionSort_~j~0 < SelectionSort_~array_size); 1964#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); 1965#L515-2 SelectionSort_#t~pre2 := 1 + SelectionSort_~i~0;SelectionSort_~i~0 := 1 + SelectionSort_~i~0;havoc SelectionSort_#t~pre2; 1966#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; 1970#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); 1983#L521 [2019-11-25 08:51:05,489 INFO L796 eck$LassoCheckResult]: Loop: 1983#L521 assume SelectionSort_#t~mem4 < SelectionSort_#t~mem5;havoc SelectionSort_#t~mem5;havoc SelectionSort_#t~mem4;SelectionSort_~min~0 := SelectionSort_~j~0; 1980#L519-2 SelectionSort_#t~pre3 := 1 + SelectionSort_~j~0;SelectionSort_~j~0 := 1 + SelectionSort_~j~0;havoc SelectionSort_#t~pre3; 1981#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); 1983#L521 [2019-11-25 08:51:05,489 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 08:51:05,489 INFO L82 PathProgramCache]: Analyzing trace with hash 1663183504, now seen corresponding path program 2 times [2019-11-25 08:51:05,489 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-25 08:51:05,490 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1685066949] [2019-11-25 08:51:05,490 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-25 08:51:05,504 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-25 08:51:05,516 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-25 08:51:05,520 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-25 08:51:05,521 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 08:51:05,521 INFO L82 PathProgramCache]: Analyzing trace with hash 71618, now seen corresponding path program 5 times [2019-11-25 08:51:05,521 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-25 08:51:05,521 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [144899986] [2019-11-25 08:51:05,521 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-25 08:51:05,524 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-25 08:51:05,525 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-25 08:51:05,526 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-25 08:51:05,527 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 08:51:05,527 INFO L82 PathProgramCache]: Analyzing trace with hash 1157082835, now seen corresponding path program 2 times [2019-11-25 08:51:05,527 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-25 08:51:05,527 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1901243178] [2019-11-25 08:51:05,527 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-25 08:51:05,548 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-25 08:51:05,571 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-25 08:51:05,576 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-25 08:51:06,631 WARN L192 SmtUtils]: Spent 975.00 ms on a formula simplification. DAG size of input: 251 DAG size of output: 177 [2019-11-25 08:51:06,756 WARN L192 SmtUtils]: Spent 115.00 ms on a formula simplification that was a NOOP. DAG size: 105 [2019-11-25 08:51:06,757 INFO L210 LassoAnalysis]: Preferences: [2019-11-25 08:51:06,758 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2019-11-25 08:51:06,758 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-11-25 08:51:06,758 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2019-11-25 08:51:06,758 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2019-11-25 08:51:06,758 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-25 08:51:06,758 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2019-11-25 08:51:06,758 INFO L132 ssoRankerPreferences]: Path of dumped script: [2019-11-25 08:51:06,758 INFO L133 ssoRankerPreferences]: Filename of dumped script: selectionsort-alloca-1.i_Iteration13_Lasso [2019-11-25 08:51:06,758 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2019-11-25 08:51:06,758 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2019-11-25 08:51:06,760 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-25 08:51:06,770 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-25 08:51:06,773 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-25 08:51:06,785 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-25 08:51:06,787 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-25 08:51:06,790 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-25 08:51:06,792 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-25 08:51:06,906 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:458) at de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver.doTerminationAnalysis(BuchiAutomizerObserver.java:141) at de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver.finish(BuchiAutomizerObserver.java:380) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:316) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:55) [2019-11-25 08:51:06,908 INFO L168 Benchmark]: Toolchain (without parser) took 14648.10 ms. Allocated memory was 1.0 GB in the beginning and 1.3 GB in the end (delta: 280.0 MB). Free memory was 938.0 MB in the beginning and 967.0 MB in the end (delta: -29.0 MB). Peak memory consumption was 251.0 MB. Max. memory is 11.5 GB. [2019-11-25 08:51:06,908 INFO L168 Benchmark]: CDTParser took 0.22 ms. Allocated memory is still 1.0 GB. Free memory is still 962.2 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-25 08:51:06,908 INFO L168 Benchmark]: CACSL2BoogieTranslator took 582.53 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 106.4 MB). Free memory was 938.0 MB in the beginning and 1.1 GB in the end (delta: -151.0 MB). Peak memory consumption was 18.2 MB. Max. memory is 11.5 GB. [2019-11-25 08:51:06,909 INFO L168 Benchmark]: Boogie Procedure Inliner took 43.59 ms. Allocated memory is still 1.1 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-25 08:51:06,909 INFO L168 Benchmark]: Boogie Preprocessor took 23.26 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. [2019-11-25 08:51:06,909 INFO L168 Benchmark]: RCFGBuilder took 324.00 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 22.4 MB). Peak memory consumption was 22.4 MB. Max. memory is 11.5 GB. [2019-11-25 08:51:06,910 INFO L168 Benchmark]: BuchiAutomizer took 13671.08 ms. Allocated memory was 1.1 GB in the beginning and 1.3 GB in the end (delta: 173.5 MB). Free memory was 1.1 GB in the beginning and 967.0 MB in the end (delta: 94.2 MB). Peak memory consumption was 267.8 MB. Max. memory is 11.5 GB. [2019-11-25 08:51:06,911 INFO L335 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.22 ms. Allocated memory is still 1.0 GB. Free memory is still 962.2 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 582.53 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 106.4 MB). Free memory was 938.0 MB in the beginning and 1.1 GB in the end (delta: -151.0 MB). Peak memory consumption was 18.2 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 43.59 ms. Allocated memory is still 1.1 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * Boogie Preprocessor took 23.26 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. * RCFGBuilder took 324.00 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 22.4 MB). Peak memory consumption was 22.4 MB. Max. memory is 11.5 GB. * BuchiAutomizer took 13671.08 ms. Allocated memory was 1.1 GB in the beginning and 1.3 GB in the end (delta: 173.5 MB). Free memory was 1.1 GB in the beginning and 967.0 MB in the end (delta: 94.2 MB). Peak memory consumption was 267.8 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.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...