./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 678e0110 Calling Ultimate with: /usr/lib/jvm/java-8-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/run_dir_ff7ce0e7-80e9-4e1d-affa-53db3c2c315d/bin/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/run_dir_ff7ce0e7-80e9-4e1d-affa-53db3c2c315d/bin/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/run_dir_ff7ce0e7-80e9-4e1d-affa-53db3c2c315d/bin/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/run_dir_ff7ce0e7-80e9-4e1d-affa-53db3c2c315d/bin/uautomizer/config/AutomizerTermination.xml -i ../../sv-benchmarks/c/array-memsafety/selectionsort-alloca-1.i -s /tmp/vcloud-vcloud-master/worker/run_dir_ff7ce0e7-80e9-4e1d-affa-53db3c2c315d/bin/uautomizer/config/svcomp-Termination-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/run_dir_ff7ce0e7-80e9-4e1d-affa-53db3c2c315d/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_ff7ce0e7-80e9-4e1d-affa-53db3c2c315d/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-678e011 [2019-11-20 03:59:18,781 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-20 03:59:18,783 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-20 03:59:18,793 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-20 03:59:18,793 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-20 03:59:18,794 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-20 03:59:18,795 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-20 03:59:18,797 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-20 03:59:18,799 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-20 03:59:18,800 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-20 03:59:18,801 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-20 03:59:18,802 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-20 03:59:18,802 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-20 03:59:18,803 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-20 03:59:18,804 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-20 03:59:18,805 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-20 03:59:18,806 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-20 03:59:18,807 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-20 03:59:18,808 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-20 03:59:18,810 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-20 03:59:18,812 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-20 03:59:18,813 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-20 03:59:18,814 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-20 03:59:18,815 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-20 03:59:18,817 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-20 03:59:18,818 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-20 03:59:18,818 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-20 03:59:18,819 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-20 03:59:18,819 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-20 03:59:18,820 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-20 03:59:18,820 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-20 03:59:18,821 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-20 03:59:18,822 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-20 03:59:18,822 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-20 03:59:18,823 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-20 03:59:18,824 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-20 03:59:18,824 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-20 03:59:18,824 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-20 03:59:18,825 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-20 03:59:18,826 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-20 03:59:18,826 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-20 03:59:18,827 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/run_dir_ff7ce0e7-80e9-4e1d-affa-53db3c2c315d/bin/uautomizer/config/svcomp-Termination-32bit-Automizer_Default.epf [2019-11-20 03:59:18,841 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-20 03:59:18,841 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-20 03:59:18,842 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-11-20 03:59:18,842 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-11-20 03:59:18,842 INFO L138 SettingsManager]: * Use SBE=true [2019-11-20 03:59:18,843 INFO L136 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2019-11-20 03:59:18,843 INFO L138 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2019-11-20 03:59:18,843 INFO L138 SettingsManager]: * Use old map elimination=false [2019-11-20 03:59:18,843 INFO L138 SettingsManager]: * Use external solver (rank synthesis)=false [2019-11-20 03:59:18,843 INFO L138 SettingsManager]: * Use only trivial implications for array writes=true [2019-11-20 03:59:18,844 INFO L138 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2019-11-20 03:59:18,844 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-20 03:59:18,844 INFO L138 SettingsManager]: * sizeof long=4 [2019-11-20 03:59:18,844 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2019-11-20 03:59:18,845 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-11-20 03:59:18,845 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-11-20 03:59:18,845 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-20 03:59:18,845 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2019-11-20 03:59:18,845 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2019-11-20 03:59:18,846 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2019-11-20 03:59:18,846 INFO L138 SettingsManager]: * sizeof long double=12 [2019-11-20 03:59:18,846 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-11-20 03:59:18,846 INFO L138 SettingsManager]: * Assume nondeterminstic values are in range=false [2019-11-20 03:59:18,847 INFO L138 SettingsManager]: * Use constant arrays=true [2019-11-20 03:59:18,847 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2019-11-20 03:59:18,847 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-20 03:59:18,847 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-11-20 03:59:18,847 INFO L138 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2019-11-20 03:59:18,848 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-20 03:59:18,848 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-11-20 03:59:18,848 INFO L138 SettingsManager]: * Dump automata to the following directory=/home/matthias/ultimate/dump/auto [2019-11-20 03:59:18,849 INFO L136 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2019-11-20 03:59:18,849 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_ff7ce0e7-80e9-4e1d-affa-53db3c2c315d/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-20 03:59:18,989 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-20 03:59:18,998 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-20 03:59:19,001 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-20 03:59:19,002 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-20 03:59:19,003 INFO L275 PluginConnector]: CDTParser initialized [2019-11-20 03:59:19,003 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/run_dir_ff7ce0e7-80e9-4e1d-affa-53db3c2c315d/bin/uautomizer/../../sv-benchmarks/c/array-memsafety/selectionsort-alloca-1.i [2019-11-20 03:59:19,051 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_ff7ce0e7-80e9-4e1d-affa-53db3c2c315d/bin/uautomizer/data/d32089adb/f33219e350574a98b55d3809919438aa/FLAGff49a0799 [2019-11-20 03:59:19,555 INFO L306 CDTParser]: Found 1 translation units. [2019-11-20 03:59:19,556 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/run_dir_ff7ce0e7-80e9-4e1d-affa-53db3c2c315d/sv-benchmarks/c/array-memsafety/selectionsort-alloca-1.i [2019-11-20 03:59:19,573 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_ff7ce0e7-80e9-4e1d-affa-53db3c2c315d/bin/uautomizer/data/d32089adb/f33219e350574a98b55d3809919438aa/FLAGff49a0799 [2019-11-20 03:59:19,830 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/run_dir_ff7ce0e7-80e9-4e1d-affa-53db3c2c315d/bin/uautomizer/data/d32089adb/f33219e350574a98b55d3809919438aa [2019-11-20 03:59:19,832 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-20 03:59:19,832 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-11-20 03:59:19,833 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-20 03:59:19,833 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-20 03:59:19,835 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-20 03:59:19,836 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.11 03:59:19" (1/1) ... [2019-11-20 03:59:19,837 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@443dd33b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 03:59:19, skipping insertion in model container [2019-11-20 03:59:19,837 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.11 03:59:19" (1/1) ... [2019-11-20 03:59:19,842 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-11-20 03:59:19,887 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-11-20 03:59:20,250 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-20 03:59:20,259 INFO L188 MainTranslator]: Completed pre-run [2019-11-20 03:59:20,293 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-20 03:59:20,356 INFO L192 MainTranslator]: Completed translation [2019-11-20 03:59:20,356 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 03:59:20 WrapperNode [2019-11-20 03:59:20,357 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-20 03:59:20,358 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-11-20 03:59:20,359 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-11-20 03:59:20,359 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-11-20 03:59:20,366 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 03:59:20" (1/1) ... [2019-11-20 03:59:20,391 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 03:59:20" (1/1) ... [2019-11-20 03:59:20,414 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-11-20 03:59:20,415 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-11-20 03:59:20,415 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-11-20 03:59:20,415 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-11-20 03:59:20,422 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 03:59:20" (1/1) ... [2019-11-20 03:59:20,422 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 03:59:20" (1/1) ... [2019-11-20 03:59:20,425 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 03:59:20" (1/1) ... [2019-11-20 03:59:20,425 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 03:59:20" (1/1) ... [2019-11-20 03:59:20,430 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 03:59:20" (1/1) ... [2019-11-20 03:59:20,435 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 03:59:20" (1/1) ... [2019-11-20 03:59:20,437 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 03:59:20" (1/1) ... [2019-11-20 03:59:20,439 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-11-20 03:59:20,439 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-11-20 03:59:20,440 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-11-20 03:59:20,440 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-11-20 03:59:20,440 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 03:59:20" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_ff7ce0e7-80e9-4e1d-affa-53db3c2c315d/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-20 03:59:20,500 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2019-11-20 03:59:20,500 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-11-20 03:59:20,501 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-11-20 03:59:20,501 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-11-20 03:59:20,501 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-11-20 03:59:20,501 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-11-20 03:59:20,769 INFO L280 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-11-20 03:59:20,770 INFO L285 CfgBuilder]: Removed 9 assume(true) statements. [2019-11-20 03:59:20,770 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.11 03:59:20 BoogieIcfgContainer [2019-11-20 03:59:20,771 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-11-20 03:59:20,771 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2019-11-20 03:59:20,771 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2019-11-20 03:59:20,774 INFO L275 PluginConnector]: BuchiAutomizer initialized [2019-11-20 03:59:20,775 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-11-20 03:59:20,775 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 20.11 03:59:19" (1/3) ... [2019-11-20 03:59:20,776 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@17aef3ef and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 20.11 03:59:20, skipping insertion in model container [2019-11-20 03:59:20,776 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-11-20 03:59:20,776 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 03:59:20" (2/3) ... [2019-11-20 03:59:20,776 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@17aef3ef and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 20.11 03:59:20, skipping insertion in model container [2019-11-20 03:59:20,776 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-11-20 03:59:20,777 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.11 03:59:20" (3/3) ... [2019-11-20 03:59:20,778 INFO L371 chiAutomizerObserver]: Analyzing ICFG selectionsort-alloca-1.i [2019-11-20 03:59:20,811 INFO L356 BuchiCegarLoop]: Interprodecural is true [2019-11-20 03:59:20,811 INFO L357 BuchiCegarLoop]: Hoare is false [2019-11-20 03:59:20,812 INFO L358 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2019-11-20 03:59:20,812 INFO L359 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2019-11-20 03:59:20,812 INFO L360 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-11-20 03:59:20,812 INFO L361 BuchiCegarLoop]: Difference is false [2019-11-20 03:59:20,812 INFO L362 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-11-20 03:59:20,812 INFO L365 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2019-11-20 03:59:20,823 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 17 states. [2019-11-20 03:59:20,840 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 8 [2019-11-20 03:59:20,841 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-20 03:59:20,841 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-20 03:59:20,847 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1] [2019-11-20 03:59:20,847 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2019-11-20 03:59:20,847 INFO L424 BuchiCegarLoop]: ======== Iteration 1============ [2019-11-20 03:59:20,847 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 17 states. [2019-11-20 03:59:20,849 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 8 [2019-11-20 03:59:20,849 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-20 03:59:20,849 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-20 03:59:20,849 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1] [2019-11-20 03:59:20,849 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2019-11-20 03:59:20,856 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-20 03:59:20,857 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-20 03:59:20,861 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 03:59:20,862 INFO L82 PathProgramCache]: Analyzing trace with hash 925669, now seen corresponding path program 1 times [2019-11-20 03:59:20,867 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 03:59:20,867 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1607998646] [2019-11-20 03:59:20,868 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 03:59:20,949 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-20 03:59:20,960 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-20 03:59:20,977 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-20 03:59:20,977 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 03:59:20,978 INFO L82 PathProgramCache]: Analyzing trace with hash 1507, now seen corresponding path program 1 times [2019-11-20 03:59:20,978 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 03:59:20,978 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [464008829] [2019-11-20 03:59:20,978 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 03:59:20,986 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-20 03:59:20,991 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-20 03:59:20,994 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-20 03:59:20,995 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 03:59:20,995 INFO L82 PathProgramCache]: Analyzing trace with hash 889568455, now seen corresponding path program 1 times [2019-11-20 03:59:20,995 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 03:59:20,995 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [402950436] [2019-11-20 03:59:20,995 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 03:59:21,012 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-20 03:59:21,025 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-20 03:59:21,029 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-20 03:59:21,209 WARN L191 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 44 DAG size of output: 42 [2019-11-20 03:59:21,266 INFO L210 LassoAnalysis]: Preferences: [2019-11-20 03:59:21,266 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2019-11-20 03:59:21,267 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-11-20 03:59:21,267 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2019-11-20 03:59:21,267 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2019-11-20 03:59:21,267 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-20 03:59:21,267 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2019-11-20 03:59:21,268 INFO L132 ssoRankerPreferences]: Path of dumped script: [2019-11-20 03:59:21,268 INFO L133 ssoRankerPreferences]: Filename of dumped script: selectionsort-alloca-1.i_Iteration1_Lasso [2019-11-20 03:59:21,268 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2019-11-20 03:59:21,268 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2019-11-20 03:59:21,301 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-20 03:59:21,309 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-20 03:59:21,313 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-20 03:59:21,317 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-20 03:59:21,323 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-20 03:59:21,329 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-20 03:59:21,450 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-20 03:59:21,455 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-20 03:59:21,460 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-20 03:59:21,709 INFO L292 LassoAnalysis]: Preprocessing complete. [2019-11-20 03:59:21,714 INFO L489 LassoAnalysis]: Using template 'affine'. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_ff7ce0e7-80e9-4e1d-affa-53db3c2c315d/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-20 03:59:21,722 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-20 03:59:21,724 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-20 03:59:21,724 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-20 03:59:21,725 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-20 03:59:21,725 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-20 03:59:21,725 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-20 03:59:21,727 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-20 03:59:21,728 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-20 03:59:21,730 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_ff7ce0e7-80e9-4e1d-affa-53db3c2c315d/bin/uautomizer/z3 Waiting until toolchain timeout for monitored process 2 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 Starting monitored process 3 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-11-20 03:59:21,754 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-20 03:59:21,755 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-20 03:59:21,755 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-20 03:59:21,756 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-20 03:59:21,756 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-20 03:59:21,756 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-20 03:59:21,757 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-20 03:59:21,757 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. Waiting until toolchain timeout for monitored process 3 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-20 03:59:21,760 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_ff7ce0e7-80e9-4e1d-affa-53db3c2c315d/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-20 03:59:21,777 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-20 03:59:21,779 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-20 03:59:21,779 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-20 03:59:21,779 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-20 03:59:21,779 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-20 03:59:21,788 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. Waiting until toolchain timeout for monitored process 4 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-20 03:59:21,791 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-20 03:59:21,795 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_ff7ce0e7-80e9-4e1d-affa-53db3c2c315d/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-20 03:59:21,806 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-20 03:59:21,808 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-20 03:59:21,809 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-20 03:59:21,809 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-20 03:59:21,809 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-20 03:59:21,813 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-20 03:59:21,813 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-20 03:59:21,821 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_ff7ce0e7-80e9-4e1d-affa-53db3c2c315d/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-20 03:59:21,830 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-20 03:59:21,832 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-20 03:59:21,832 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-20 03:59:21,832 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-20 03:59:21,832 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-20 03:59:21,833 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-20 03:59:21,834 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-20 03:59:21,834 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-20 03:59:21,837 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_ff7ce0e7-80e9-4e1d-affa-53db3c2c315d/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-20 03:59:21,847 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-20 03:59:21,849 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-20 03:59:21,849 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-20 03:59:21,850 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-20 03:59:21,850 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-20 03:59:21,850 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-20 03:59:21,852 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-20 03:59:21,852 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-20 03:59:21,857 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_ff7ce0e7-80e9-4e1d-affa-53db3c2c315d/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-20 03:59:21,879 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-20 03:59:21,880 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-20 03:59:21,881 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-20 03:59:21,881 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-20 03:59:21,881 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-20 03:59:21,881 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-20 03:59:21,885 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-20 03:59:21,885 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-20 03:59:21,887 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_ff7ce0e7-80e9-4e1d-affa-53db3c2c315d/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-20 03:59:21,901 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-20 03:59:21,904 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-20 03:59:21,904 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-20 03:59:21,904 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-20 03:59:21,904 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-20 03:59:21,920 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-20 03:59:21,925 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. Waiting until toolchain timeout for monitored process 9 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-20 03:59:21,941 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-11-20 03:59:22,002 INFO L443 ModelExtractionUtils]: Simplification made 10 calls to the SMT solver. [2019-11-20 03:59:22,002 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_ff7ce0e7-80e9-4e1d-affa-53db3c2c315d/bin/uautomizer/z3 Starting monitored process 10 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-20 03:59:22,016 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-11-20 03:59:22,020 INFO L438 nArgumentSynthesizer]: Removed 1 redundant supporting invariants from a total of 2. [2019-11-20 03:59:22,020 INFO L510 LassoAnalysis]: Proved termination. [2019-11-20 03:59:22,021 INFO L512 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~i~1, v_rep(select #length ULTIMATE.start_main_~numbers~0.base)_1) = -4*ULTIMATE.start_main_~i~1 + 1*v_rep(select #length ULTIMATE.start_main_~numbers~0.base)_1 Supporting invariants [1*ULTIMATE.start_main_~numbers~0.offset >= 0] [2019-11-20 03:59:22,042 INFO L297 tatePredicateManager]: 3 out of 4 supporting invariants were superfluous and have been removed [2019-11-20 03:59:22,051 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2019-11-20 03:59:22,093 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 03:59:22,111 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 03:59:22,112 INFO L255 TraceCheckSpWp]: Trace formula consists of 26 conjuncts, 4 conjunts are in the unsatisfiable core [2019-11-20 03:59:22,114 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-20 03:59:22,132 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 03:59:22,133 INFO L255 TraceCheckSpWp]: Trace formula consists of 11 conjuncts, 5 conjunts are in the unsatisfiable core [2019-11-20 03:59:22,134 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-20 03:59:22,155 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-20 03:59:22,171 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-20 03:59:22,172 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 17 states. Second operand 3 states. [2019-11-20 03:59:22,257 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-20 03:59:22,258 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-20 03:59:22,259 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2019-11-20 03:59:22,260 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 39 transitions. [2019-11-20 03:59:22,261 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 39 transitions. Stem has 4 letters. Loop has 2 letters. [2019-11-20 03:59:22,262 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-20 03:59:22,263 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 39 transitions. Stem has 6 letters. Loop has 2 letters. [2019-11-20 03:59:22,263 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-20 03:59:22,263 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 39 transitions. Stem has 4 letters. Loop has 4 letters. [2019-11-20 03:59:22,263 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-20 03:59:22,264 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 41 states and 59 transitions. [2019-11-20 03:59:22,267 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 6 [2019-11-20 03:59:22,271 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 41 states to 14 states and 19 transitions. [2019-11-20 03:59:22,272 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 11 [2019-11-20 03:59:22,272 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 12 [2019-11-20 03:59:22,273 INFO L73 IsDeterministic]: Start isDeterministic. Operand 14 states and 19 transitions. [2019-11-20 03:59:22,273 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-11-20 03:59:22,274 INFO L688 BuchiCegarLoop]: Abstraction has 14 states and 19 transitions. [2019-11-20 03:59:22,289 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14 states and 19 transitions. [2019-11-20 03:59:22,297 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14 to 14. [2019-11-20 03:59:22,298 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2019-11-20 03:59:22,298 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 19 transitions. [2019-11-20 03:59:22,299 INFO L711 BuchiCegarLoop]: Abstraction has 14 states and 19 transitions. [2019-11-20 03:59:22,299 INFO L591 BuchiCegarLoop]: Abstraction has 14 states and 19 transitions. [2019-11-20 03:59:22,299 INFO L424 BuchiCegarLoop]: ======== Iteration 2============ [2019-11-20 03:59:22,300 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 14 states and 19 transitions. [2019-11-20 03:59:22,300 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 6 [2019-11-20 03:59:22,300 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-20 03:59:22,301 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-20 03:59:22,301 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1] [2019-11-20 03:59:22,301 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2019-11-20 03:59:22,302 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-20 03:59:22,302 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-20 03:59:22,302 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 03:59:22,302 INFO L82 PathProgramCache]: Analyzing trace with hash 889568397, now seen corresponding path program 1 times [2019-11-20 03:59:22,302 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 03:59:22,303 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1091321099] [2019-11-20 03:59:22,303 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 03:59:22,314 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 03:59:22,361 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-20 03:59:22,361 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1091321099] [2019-11-20 03:59:22,362 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 03:59:22,362 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-20 03:59:22,363 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [152266290] [2019-11-20 03:59:22,365 INFO L799 eck$LassoCheckResult]: stem already infeasible [2019-11-20 03:59:22,366 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 03:59:22,366 INFO L82 PathProgramCache]: Analyzing trace with hash 1884201, now seen corresponding path program 1 times [2019-11-20 03:59:22,366 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 03:59:22,366 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1911752048] [2019-11-20 03:59:22,367 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 03:59:22,375 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 03:59:22,384 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-20 03:59:22,384 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1911752048] [2019-11-20 03:59:22,385 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 03:59:22,385 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-20 03:59:22,385 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1028289219] [2019-11-20 03:59:22,385 INFO L811 eck$LassoCheckResult]: loop already infeasible [2019-11-20 03:59:22,386 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 03:59:22,388 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-20 03:59:22,388 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-20 03:59:22,390 INFO L87 Difference]: Start difference. First operand 14 states and 19 transitions. cyclomatic complexity: 7 Second operand 3 states. [2019-11-20 03:59:22,409 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 03:59:22,410 INFO L93 Difference]: Finished difference Result 15 states and 20 transitions. [2019-11-20 03:59:22,410 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-20 03:59:22,411 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 15 states and 20 transitions. [2019-11-20 03:59:22,412 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 7 [2019-11-20 03:59:22,412 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 15 states to 15 states and 20 transitions. [2019-11-20 03:59:22,412 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 13 [2019-11-20 03:59:22,413 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 13 [2019-11-20 03:59:22,413 INFO L73 IsDeterministic]: Start isDeterministic. Operand 15 states and 20 transitions. [2019-11-20 03:59:22,413 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-11-20 03:59:22,413 INFO L688 BuchiCegarLoop]: Abstraction has 15 states and 20 transitions. [2019-11-20 03:59:22,413 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15 states and 20 transitions. [2019-11-20 03:59:22,414 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15 to 15. [2019-11-20 03:59:22,414 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2019-11-20 03:59:22,415 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 20 transitions. [2019-11-20 03:59:22,415 INFO L711 BuchiCegarLoop]: Abstraction has 15 states and 20 transitions. [2019-11-20 03:59:22,415 INFO L591 BuchiCegarLoop]: Abstraction has 15 states and 20 transitions. [2019-11-20 03:59:22,415 INFO L424 BuchiCegarLoop]: ======== Iteration 3============ [2019-11-20 03:59:22,416 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 15 states and 20 transitions. [2019-11-20 03:59:22,416 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 7 [2019-11-20 03:59:22,416 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-20 03:59:22,416 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-20 03:59:22,417 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1] [2019-11-20 03:59:22,417 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1] [2019-11-20 03:59:22,417 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-20 03:59:22,418 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~mem4;havoc SelectionSort_#t~mem5;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-20 03:59:22,418 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 03:59:22,418 INFO L82 PathProgramCache]: Analyzing trace with hash 889568397, now seen corresponding path program 2 times [2019-11-20 03:59:22,418 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 03:59:22,418 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2099316199] [2019-11-20 03:59:22,419 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 03:59:22,426 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 03:59:22,447 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-20 03:59:22,447 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2099316199] [2019-11-20 03:59:22,447 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 03:59:22,447 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-20 03:59:22,448 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [686215793] [2019-11-20 03:59:22,448 INFO L799 eck$LassoCheckResult]: stem already infeasible [2019-11-20 03:59:22,448 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 03:59:22,448 INFO L82 PathProgramCache]: Analyzing trace with hash 347385690, now seen corresponding path program 1 times [2019-11-20 03:59:22,449 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 03:59:22,449 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [391800318] [2019-11-20 03:59:22,449 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 03:59:22,465 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-20 03:59:22,477 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-20 03:59:22,480 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-20 03:59:22,612 WARN L191 SmtUtils]: Spent 129.00 ms on a formula simplification. DAG size of input: 75 DAG size of output: 60 [2019-11-20 03:59:22,656 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 03:59:22,656 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-20 03:59:22,656 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-20 03:59:22,657 INFO L87 Difference]: Start difference. First operand 15 states and 20 transitions. cyclomatic complexity: 7 Second operand 4 states. [2019-11-20 03:59:22,677 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 03:59:22,677 INFO L93 Difference]: Finished difference Result 16 states and 20 transitions. [2019-11-20 03:59:22,678 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-20 03:59:22,678 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 16 states and 20 transitions. [2019-11-20 03:59:22,679 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 7 [2019-11-20 03:59:22,679 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 16 states to 16 states and 20 transitions. [2019-11-20 03:59:22,679 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 13 [2019-11-20 03:59:22,680 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 13 [2019-11-20 03:59:22,680 INFO L73 IsDeterministic]: Start isDeterministic. Operand 16 states and 20 transitions. [2019-11-20 03:59:22,680 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-11-20 03:59:22,680 INFO L688 BuchiCegarLoop]: Abstraction has 16 states and 20 transitions. [2019-11-20 03:59:22,680 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16 states and 20 transitions. [2019-11-20 03:59:22,681 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16 to 15. [2019-11-20 03:59:22,682 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2019-11-20 03:59:22,682 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 19 transitions. [2019-11-20 03:59:22,682 INFO L711 BuchiCegarLoop]: Abstraction has 15 states and 19 transitions. [2019-11-20 03:59:22,682 INFO L591 BuchiCegarLoop]: Abstraction has 15 states and 19 transitions. [2019-11-20 03:59:22,682 INFO L424 BuchiCegarLoop]: ======== Iteration 4============ [2019-11-20 03:59:22,683 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 15 states and 19 transitions. [2019-11-20 03:59:22,683 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 7 [2019-11-20 03:59:22,683 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-20 03:59:22,683 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-20 03:59:22,684 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 03:59:22,684 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1] [2019-11-20 03:59:22,684 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-20 03:59:22,684 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~mem4;havoc SelectionSort_#t~mem5;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-20 03:59:22,685 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 03:59:22,685 INFO L82 PathProgramCache]: Analyzing trace with hash 176793839, now seen corresponding path program 1 times [2019-11-20 03:59:22,685 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 03:59:22,686 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [827257280] [2019-11-20 03:59:22,686 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 03:59:22,696 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-20 03:59:22,705 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-20 03:59:22,709 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-20 03:59:22,709 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 03:59:22,709 INFO L82 PathProgramCache]: Analyzing trace with hash 347385690, now seen corresponding path program 2 times [2019-11-20 03:59:22,710 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 03:59:22,710 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [150942463] [2019-11-20 03:59:22,710 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 03:59:22,719 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-20 03:59:22,727 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-20 03:59:22,729 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-20 03:59:22,730 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 03:59:22,730 INFO L82 PathProgramCache]: Analyzing trace with hash 651542188, now seen corresponding path program 1 times [2019-11-20 03:59:22,730 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 03:59:22,731 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2057374046] [2019-11-20 03:59:22,731 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [MP z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (10)] Exception during sending of exit command (exit): Broken pipe [2019-11-20 03:59:22,774 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 03:59:22,863 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-20 03:59:22,864 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2057374046] [2019-11-20 03:59:22,864 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1138848977] [2019-11-20 03:59:22,864 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_ff7ce0e7-80e9-4e1d-affa-53db3c2c315d/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-20 03:59:22,920 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 03:59:22,921 INFO L255 TraceCheckSpWp]: Trace formula consists of 82 conjuncts, 7 conjunts are in the unsatisfiable core [2019-11-20 03:59:22,923 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-20 03:59:22,989 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-20 03:59:22,989 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-20 03:59:22,990 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 6] total 11 [2019-11-20 03:59:22,990 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1232124829] [2019-11-20 03:59:23,133 WARN L191 SmtUtils]: Spent 141.00 ms on a formula simplification. DAG size of input: 75 DAG size of output: 60 [2019-11-20 03:59:23,172 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 03:59:23,173 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-11-20 03:59:23,173 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=85, Unknown=0, NotChecked=0, Total=110 [2019-11-20 03:59:23,173 INFO L87 Difference]: Start difference. First operand 15 states and 19 transitions. cyclomatic complexity: 6 Second operand 11 states. [2019-11-20 03:59:23,294 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 03:59:23,294 INFO L93 Difference]: Finished difference Result 24 states and 29 transitions. [2019-11-20 03:59:23,294 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-11-20 03:59:23,295 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 24 states and 29 transitions. [2019-11-20 03:59:23,295 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 7 [2019-11-20 03:59:23,296 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 24 states to 18 states and 21 transitions. [2019-11-20 03:59:23,296 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 13 [2019-11-20 03:59:23,296 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 13 [2019-11-20 03:59:23,296 INFO L73 IsDeterministic]: Start isDeterministic. Operand 18 states and 21 transitions. [2019-11-20 03:59:23,296 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-11-20 03:59:23,297 INFO L688 BuchiCegarLoop]: Abstraction has 18 states and 21 transitions. [2019-11-20 03:59:23,297 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18 states and 21 transitions. [2019-11-20 03:59:23,298 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18 to 17. [2019-11-20 03:59:23,298 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2019-11-20 03:59:23,298 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 20 transitions. [2019-11-20 03:59:23,298 INFO L711 BuchiCegarLoop]: Abstraction has 17 states and 20 transitions. [2019-11-20 03:59:23,298 INFO L591 BuchiCegarLoop]: Abstraction has 17 states and 20 transitions. [2019-11-20 03:59:23,299 INFO L424 BuchiCegarLoop]: ======== Iteration 5============ [2019-11-20 03:59:23,299 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 17 states and 20 transitions. [2019-11-20 03:59:23,299 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 7 [2019-11-20 03:59:23,299 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-20 03:59:23,299 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-20 03:59:23,300 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 1, 1, 1, 1, 1, 1] [2019-11-20 03:59:23,300 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1] [2019-11-20 03:59:23,300 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-20 03:59:23,300 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~mem4;havoc SelectionSort_#t~mem5;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-20 03:59:23,300 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 03:59:23,300 INFO L82 PathProgramCache]: Analyzing trace with hash -1899756335, now seen corresponding path program 2 times [2019-11-20 03:59:23,301 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 03:59:23,301 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1986675256] [2019-11-20 03:59:23,301 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 03:59:23,310 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-20 03:59:23,318 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-20 03:59:23,322 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-20 03:59:23,322 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 03:59:23,322 INFO L82 PathProgramCache]: Analyzing trace with hash 347385690, now seen corresponding path program 3 times [2019-11-20 03:59:23,322 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 03:59:23,323 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2113505218] [2019-11-20 03:59:23,323 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 03:59:23,329 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-20 03:59:23,336 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-20 03:59:23,338 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-20 03:59:23,338 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 03:59:23,338 INFO L82 PathProgramCache]: Analyzing trace with hash 219717770, now seen corresponding path program 2 times [2019-11-20 03:59:23,338 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 03:59:23,339 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [235843122] [2019-11-20 03:59:23,339 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 03:59:23,357 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-20 03:59:23,373 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-20 03:59:23,377 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-20 03:59:23,497 WARN L191 SmtUtils]: Spent 117.00 ms on a formula simplification. DAG size of input: 75 DAG size of output: 60 [2019-11-20 03:59:23,738 WARN L191 SmtUtils]: Spent 205.00 ms on a formula simplification. DAG size of input: 98 DAG size of output: 77 [2019-11-20 03:59:23,808 INFO L210 LassoAnalysis]: Preferences: [2019-11-20 03:59:23,808 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2019-11-20 03:59:23,808 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-11-20 03:59:23,808 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2019-11-20 03:59:23,808 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2019-11-20 03:59:23,808 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-20 03:59:23,808 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2019-11-20 03:59:23,808 INFO L132 ssoRankerPreferences]: Path of dumped script: [2019-11-20 03:59:23,809 INFO L133 ssoRankerPreferences]: Filename of dumped script: selectionsort-alloca-1.i_Iteration5_Lasso [2019-11-20 03:59:23,809 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2019-11-20 03:59:23,809 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2019-11-20 03:59:23,813 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-20 03:59:24,003 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-20 03:59:24,006 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-20 03:59:24,008 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-20 03:59:24,010 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-20 03:59:24,012 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-20 03:59:24,014 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-20 03:59:24,015 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-20 03:59:24,017 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-20 03:59:24,019 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-20 03:59:24,020 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-20 03:59:24,022 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-20 03:59:24,023 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-20 03:59:24,025 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-20 03:59:24,027 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-20 03:59:24,029 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-20 03:59:24,362 INFO L292 LassoAnalysis]: Preprocessing complete. [2019-11-20 03:59:24,362 INFO L489 LassoAnalysis]: Using template 'affine'. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_ff7ce0e7-80e9-4e1d-affa-53db3c2c315d/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) Waiting until toolchain timeout for monitored process 12 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-20 03:59:24,368 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-20 03:59:24,369 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-20 03:59:24,369 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-20 03:59:24,369 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-20 03:59:24,369 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-20 03:59:24,373 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-20 03:59:24,373 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-20 03:59:24,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_ff7ce0e7-80e9-4e1d-affa-53db3c2c315d/bin/uautomizer/z3 Starting monitored process 13 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 13 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-20 03:59:24,406 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-20 03:59:24,410 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-20 03:59:24,410 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-20 03:59:24,410 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-20 03:59:24,410 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-20 03:59:24,410 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-20 03:59:24,411 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-20 03:59:24,412 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-20 03:59:24,414 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_ff7ce0e7-80e9-4e1d-affa-53db3c2c315d/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-20 03:59:24,435 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-20 03:59:24,437 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-20 03:59:24,437 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-20 03:59:24,437 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-20 03:59:24,437 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-20 03:59:24,441 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-20 03:59:24,441 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-20 03:59:24,456 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_ff7ce0e7-80e9-4e1d-affa-53db3c2c315d/bin/uautomizer/z3 Starting monitored process 15 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 14 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 Waiting until toolchain timeout for monitored process 15 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-20 03:59:24,470 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-20 03:59:24,472 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-20 03:59:24,472 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-20 03:59:24,472 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-20 03:59:24,472 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-20 03:59:24,475 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-20 03:59:24,475 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-20 03:59:24,481 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_ff7ce0e7-80e9-4e1d-affa-53db3c2c315d/bin/uautomizer/z3 Starting monitored process 16 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 16 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-20 03:59:24,494 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-20 03:59:24,496 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-20 03:59:24,496 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-20 03:59:24,496 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-20 03:59:24,496 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-20 03:59:24,509 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-20 03:59:24,509 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-20 03:59:24,529 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-11-20 03:59:24,631 INFO L443 ModelExtractionUtils]: Simplification made 19 calls to the SMT solver. [2019-11-20 03:59:24,632 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_ff7ce0e7-80e9-4e1d-affa-53db3c2c315d/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-20 03:59:24,649 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-11-20 03:59:24,655 INFO L438 nArgumentSynthesizer]: Removed 1 redundant supporting invariants from a total of 2. [2019-11-20 03:59:24,655 INFO L510 LassoAnalysis]: Proved termination. [2019-11-20 03:59:24,655 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-20 03:59:24,673 INFO L297 tatePredicateManager]: 4 out of 5 supporting invariants were superfluous and have been removed [2019-11-20 03:59:24,695 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 03:59:24,706 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 03:59:24,706 INFO L255 TraceCheckSpWp]: Trace formula consists of 57 conjuncts, 8 conjunts are in the unsatisfiable core [2019-11-20 03:59:24,707 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-20 03:59:24,769 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 03:59:24,770 INFO L255 TraceCheckSpWp]: Trace formula consists of 36 conjuncts, 5 conjunts are in the unsatisfiable core [2019-11-20 03:59:24,770 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-20 03:59:24,797 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-20 03:59:24,798 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-20 03:59:24,798 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 17 states and 20 transitions. cyclomatic complexity: 5 Second operand 7 states. [2019-11-20 03:59:24,906 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-20 03:59:24,907 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-20 03:59:24,907 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2019-11-20 03:59:24,907 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 24 transitions. [2019-11-20 03:59:24,907 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states and 24 transitions. Stem has 10 letters. Loop has 7 letters. [2019-11-20 03:59:24,908 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-20 03:59:24,908 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states and 24 transitions. Stem has 17 letters. Loop has 7 letters. [2019-11-20 03:59:24,908 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-20 03:59:24,908 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states and 24 transitions. Stem has 10 letters. Loop has 14 letters. [2019-11-20 03:59:24,909 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-20 03:59:24,909 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 37 states and 46 transitions. [2019-11-20 03:59:24,910 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 10 [2019-11-20 03:59:24,910 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 37 states to 35 states and 44 transitions. [2019-11-20 03:59:24,910 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 19 [2019-11-20 03:59:24,911 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 21 [2019-11-20 03:59:24,911 INFO L73 IsDeterministic]: Start isDeterministic. Operand 35 states and 44 transitions. [2019-11-20 03:59:24,912 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-11-20 03:59:24,912 INFO L688 BuchiCegarLoop]: Abstraction has 35 states and 44 transitions. [2019-11-20 03:59:24,913 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states and 44 transitions. [2019-11-20 03:59:24,916 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 31. [2019-11-20 03:59:24,916 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31 states. [2019-11-20 03:59:24,918 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 40 transitions. [2019-11-20 03:59:24,918 INFO L711 BuchiCegarLoop]: Abstraction has 31 states and 40 transitions. [2019-11-20 03:59:24,918 INFO L591 BuchiCegarLoop]: Abstraction has 31 states and 40 transitions. [2019-11-20 03:59:24,920 INFO L424 BuchiCegarLoop]: ======== Iteration 6============ [2019-11-20 03:59:24,920 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 31 states and 40 transitions. [2019-11-20 03:59:24,921 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 10 [2019-11-20 03:59:24,923 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-20 03:59:24,923 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-20 03:59:24,924 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 03:59:24,924 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2019-11-20 03:59:24,924 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-20 03:59:24,924 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~mem4;havoc SelectionSort_#t~mem5;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-20 03:59:24,925 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 03:59:24,925 INFO L82 PathProgramCache]: Analyzing trace with hash 1237095790, now seen corresponding path program 1 times [2019-11-20 03:59:24,925 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 03:59:24,925 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [396561561] [2019-11-20 03:59:24,925 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 03:59:24,942 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-20 03:59:24,958 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-20 03:59:24,963 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-20 03:59:24,965 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 03:59:24,965 INFO L82 PathProgramCache]: Analyzing trace with hash 68618, now seen corresponding path program 1 times [2019-11-20 03:59:24,966 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 03:59:24,966 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [126568783] [2019-11-20 03:59:24,966 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 03:59:24,975 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-20 03:59:24,985 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-20 03:59:24,986 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-20 03:59:24,988 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 03:59:24,988 INFO L82 PathProgramCache]: Analyzing trace with hash -793648259, now seen corresponding path program 1 times [2019-11-20 03:59:24,989 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 03:59:24,989 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [597522724] [2019-11-20 03:59:24,989 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 03:59:24,998 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-20 03:59:25,008 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-20 03:59:25,015 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-20 03:59:25,323 WARN L191 SmtUtils]: Spent 227.00 ms on a formula simplification. DAG size of input: 104 DAG size of output: 85 [2019-11-20 03:59:25,398 INFO L210 LassoAnalysis]: Preferences: [2019-11-20 03:59:25,398 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2019-11-20 03:59:25,398 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-11-20 03:59:25,398 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2019-11-20 03:59:25,398 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2019-11-20 03:59:25,398 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-20 03:59:25,399 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2019-11-20 03:59:25,399 INFO L132 ssoRankerPreferences]: Path of dumped script: [2019-11-20 03:59:25,399 INFO L133 ssoRankerPreferences]: Filename of dumped script: selectionsort-alloca-1.i_Iteration6_Lasso [2019-11-20 03:59:25,399 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2019-11-20 03:59:25,399 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2019-11-20 03:59:25,402 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-20 03:59:25,410 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-20 03:59:25,414 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-20 03:59:25,422 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-20 03:59:25,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-20 03:59:25,550 WARN L191 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 54 [2019-11-20 03:59:25,613 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-20 03:59:25,615 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-20 03:59:25,617 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-20 03:59:25,619 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-20 03:59:25,621 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-20 03:59:25,623 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-20 03:59:25,624 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-20 03:59:25,626 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-20 03:59:25,649 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-20 03:59:25,652 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-20 03:59:25,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-20 03:59:25,655 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-20 03:59:25,986 INFO L292 LassoAnalysis]: Preprocessing complete. [2019-11-20 03:59:25,986 INFO L489 LassoAnalysis]: Using template 'affine'. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_ff7ce0e7-80e9-4e1d-affa-53db3c2c315d/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-20 03:59:25,993 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-20 03:59:25,994 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-20 03:59:25,994 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-20 03:59:25,994 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-20 03:59:25,994 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-20 03:59:25,994 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-20 03:59:25,995 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-20 03:59:25,995 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-20 03:59:25,996 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_ff7ce0e7-80e9-4e1d-affa-53db3c2c315d/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-20 03:59:26,001 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-20 03:59:26,002 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-20 03:59:26,002 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-20 03:59:26,002 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-20 03:59:26,002 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-20 03:59:26,002 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-20 03:59:26,002 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-20 03:59:26,002 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-20 03:59:26,003 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_ff7ce0e7-80e9-4e1d-affa-53db3c2c315d/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-20 03:59:26,010 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-20 03:59:26,011 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-20 03:59:26,011 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-20 03:59:26,011 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-20 03:59:26,011 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-20 03:59:26,013 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-20 03:59:26,013 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-20 03:59:26,017 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_ff7ce0e7-80e9-4e1d-affa-53db3c2c315d/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-20 03:59:26,034 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-20 03:59:26,035 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-20 03:59:26,035 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-20 03:59:26,035 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-20 03:59:26,035 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-20 03:59:26,036 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-20 03:59:26,036 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-20 03:59:26,036 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-20 03:59:26,038 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_ff7ce0e7-80e9-4e1d-affa-53db3c2c315d/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) [2019-11-20 03:59:26,054 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-20 03:59:26,055 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-20 03:59:26,055 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-20 03:59:26,055 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-20 03:59:26,056 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-20 03:59:26,056 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-20 03:59:26,056 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-20 03:59:26,057 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. Waiting until toolchain timeout for monitored process 22 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-20 03:59:26,059 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_ff7ce0e7-80e9-4e1d-affa-53db3c2c315d/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-20 03:59:26,072 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-20 03:59:26,078 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-20 03:59:26,078 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-20 03:59:26,078 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-20 03:59:26,078 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-20 03:59:26,081 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-20 03:59:26,081 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-20 03:59:26,087 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_ff7ce0e7-80e9-4e1d-affa-53db3c2c315d/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-20 03:59:26,092 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 23 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 Waiting until toolchain timeout for monitored process 24 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-20 03:59:26,094 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-20 03:59:26,095 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-20 03:59:26,095 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-20 03:59:26,095 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-20 03:59:26,105 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-20 03:59:26,106 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-20 03:59:26,126 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-11-20 03:59:26,181 INFO L443 ModelExtractionUtils]: Simplification made 18 calls to the SMT solver. [2019-11-20 03:59:26,182 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_ff7ce0e7-80e9-4e1d-affa-53db3c2c315d/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) [2019-11-20 03:59:26,197 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... Waiting until toolchain timeout for monitored process 25 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-20 03:59:26,201 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 2. [2019-11-20 03:59:26,201 INFO L510 LassoAnalysis]: Proved termination. [2019-11-20 03:59:26,201 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_~a.offset - 1*v_rep(select #length ULTIMATE.start_SelectionSort_~a.base)_2 + 8 >= 0, 1*ULTIMATE.start_SelectionSort_~j~0 - 1*ULTIMATE.start_SelectionSort_~min~0 - 1 >= 0] [2019-11-20 03:59:26,252 INFO L297 tatePredicateManager]: 6 out of 8 supporting invariants were superfluous and have been removed [2019-11-20 03:59:26,286 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 03:59:26,301 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 03:59:26,301 INFO L255 TraceCheckSpWp]: Trace formula consists of 62 conjuncts, 19 conjunts are in the unsatisfiable core [2019-11-20 03:59:26,302 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-20 03:59:26,322 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-20 03:59:26,323 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 03:59:26,330 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 03:59:26,330 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-20 03:59:26,330 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:15 [MP z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (17)] Exception during sending of exit command (exit): Broken pipe [2019-11-20 03:59:26,479 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 03:59:26,480 INFO L255 TraceCheckSpWp]: Trace formula consists of 20 conjuncts, 8 conjunts are in the unsatisfiable core [2019-11-20 03:59:26,480 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-20 03:59:26,518 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-20 03:59:26,518 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-20 03:59:26,518 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 31 states and 40 transitions. cyclomatic complexity: 13 Second operand 9 states. [2019-11-20 03:59:26,765 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-20 03:59:26,766 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-20 03:59:26,766 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2019-11-20 03:59:26,766 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 26 transitions. [2019-11-20 03:59:26,766 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 10 states and 26 transitions. Stem has 11 letters. Loop has 3 letters. [2019-11-20 03:59:26,766 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-20 03:59:26,766 INFO L639 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2019-11-20 03:59:26,801 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 03:59:26,817 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 03:59:26,818 INFO L255 TraceCheckSpWp]: Trace formula consists of 62 conjuncts, 19 conjunts are in the unsatisfiable core [2019-11-20 03:59:26,819 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-20 03:59:26,824 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-20 03:59:26,824 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 03:59:26,835 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 03:59:26,835 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-20 03:59:26,836 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:15 [2019-11-20 03:59:26,921 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 03:59:26,921 INFO L255 TraceCheckSpWp]: Trace formula consists of 20 conjuncts, 8 conjunts are in the unsatisfiable core [2019-11-20 03:59:26,922 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-20 03:59:26,957 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-20 03:59:26,957 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-20 03:59:26,958 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 31 states and 40 transitions. cyclomatic complexity: 13 Second operand 9 states. [2019-11-20 03:59:27,212 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-20 03:59:27,213 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-20 03:59:27,214 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2019-11-20 03:59:27,214 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 28 transitions. [2019-11-20 03:59:27,214 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 11 states and 28 transitions. Stem has 11 letters. Loop has 3 letters. [2019-11-20 03:59:27,214 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-20 03:59:27,214 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 11 states and 28 transitions. Stem has 14 letters. Loop has 3 letters. [2019-11-20 03:59:27,214 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-20 03:59:27,215 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 11 states and 28 transitions. Stem has 11 letters. Loop has 6 letters. [2019-11-20 03:59:27,215 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-20 03:59:27,215 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 62 states and 83 transitions. [2019-11-20 03:59:27,216 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 13 [2019-11-20 03:59:27,218 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 62 states to 57 states and 76 transitions. [2019-11-20 03:59:27,218 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 24 [2019-11-20 03:59:27,218 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 26 [2019-11-20 03:59:27,218 INFO L73 IsDeterministic]: Start isDeterministic. Operand 57 states and 76 transitions. [2019-11-20 03:59:27,218 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-11-20 03:59:27,218 INFO L688 BuchiCegarLoop]: Abstraction has 57 states and 76 transitions. [2019-11-20 03:59:27,218 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states and 76 transitions. [2019-11-20 03:59:27,222 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 49. [2019-11-20 03:59:27,222 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 49 states. [2019-11-20 03:59:27,222 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 66 transitions. [2019-11-20 03:59:27,222 INFO L711 BuchiCegarLoop]: Abstraction has 49 states and 66 transitions. [2019-11-20 03:59:27,223 INFO L591 BuchiCegarLoop]: Abstraction has 49 states and 66 transitions. [2019-11-20 03:59:27,223 INFO L424 BuchiCegarLoop]: ======== Iteration 7============ [2019-11-20 03:59:27,223 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 49 states and 66 transitions. [2019-11-20 03:59:27,223 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 13 [2019-11-20 03:59:27,224 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-20 03:59:27,224 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-20 03:59:27,224 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [3, 3, 1, 1, 1, 1, 1, 1] [2019-11-20 03:59:27,224 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1] [2019-11-20 03:59:27,224 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-20 03:59:27,225 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~mem4;havoc SelectionSort_#t~mem5;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-20 03:59:27,225 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 03:59:27,225 INFO L82 PathProgramCache]: Analyzing trace with hash -304680909, now seen corresponding path program 3 times [2019-11-20 03:59:27,225 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 03:59:27,226 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [398418802] [2019-11-20 03:59:27,226 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 03:59:27,233 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-20 03:59:27,239 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-20 03:59:27,242 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-20 03:59:27,242 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 03:59:27,243 INFO L82 PathProgramCache]: Analyzing trace with hash 347385690, now seen corresponding path program 4 times [2019-11-20 03:59:27,243 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 03:59:27,243 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [160265027] [2019-11-20 03:59:27,243 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 03:59:27,248 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-20 03:59:27,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-20 03:59:27,254 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-20 03:59:27,255 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 03:59:27,255 INFO L82 PathProgramCache]: Analyzing trace with hash 1848279784, now seen corresponding path program 3 times [2019-11-20 03:59:27,255 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 03:59:27,255 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1038765373] [2019-11-20 03:59:27,255 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 03:59:27,289 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 03:59:27,371 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-20 03:59:27,371 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1038765373] [2019-11-20 03:59:27,371 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1282044176] [2019-11-20 03:59:27,371 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_ff7ce0e7-80e9-4e1d-affa-53db3c2c315d/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-20 03:59:27,419 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2019-11-20 03:59:27,419 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-20 03:59:27,420 INFO L255 TraceCheckSpWp]: Trace formula consists of 98 conjuncts, 10 conjunts are in the unsatisfiable core [2019-11-20 03:59:27,422 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-20 03:59:27,500 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-20 03:59:27,500 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-20 03:59:27,501 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 9] total 17 [2019-11-20 03:59:27,501 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1601812201] [2019-11-20 03:59:27,604 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 03:59:27,605 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2019-11-20 03:59:27,605 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=51, Invalid=221, Unknown=0, NotChecked=0, Total=272 [2019-11-20 03:59:27,605 INFO L87 Difference]: Start difference. First operand 49 states and 66 transitions. cyclomatic complexity: 25 Second operand 17 states. [2019-11-20 03:59:27,832 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 03:59:27,832 INFO L93 Difference]: Finished difference Result 61 states and 82 transitions. [2019-11-20 03:59:27,833 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-11-20 03:59:27,833 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 61 states and 82 transitions. [2019-11-20 03:59:27,834 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 16 [2019-11-20 03:59:27,835 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 61 states to 61 states and 82 transitions. [2019-11-20 03:59:27,835 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 34 [2019-11-20 03:59:27,835 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 34 [2019-11-20 03:59:27,836 INFO L73 IsDeterministic]: Start isDeterministic. Operand 61 states and 82 transitions. [2019-11-20 03:59:27,836 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-11-20 03:59:27,836 INFO L688 BuchiCegarLoop]: Abstraction has 61 states and 82 transitions. [2019-11-20 03:59:27,836 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61 states and 82 transitions. [2019-11-20 03:59:27,839 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61 to 53. [2019-11-20 03:59:27,839 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 53 states. [2019-11-20 03:59:27,840 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 71 transitions. [2019-11-20 03:59:27,840 INFO L711 BuchiCegarLoop]: Abstraction has 53 states and 71 transitions. [2019-11-20 03:59:27,840 INFO L591 BuchiCegarLoop]: Abstraction has 53 states and 71 transitions. [2019-11-20 03:59:27,840 INFO L424 BuchiCegarLoop]: ======== Iteration 8============ [2019-11-20 03:59:27,840 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 53 states and 71 transitions. [2019-11-20 03:59:27,841 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 13 [2019-11-20 03:59:27,841 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-20 03:59:27,841 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-20 03:59:27,842 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 03:59:27,842 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2019-11-20 03:59:27,842 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-20 03:59:27,842 INFO L796 eck$LassoCheckResult]: Loop: 1066#L521 assume !(SelectionSort_#t~mem4 < SelectionSort_#t~mem5);havoc SelectionSort_#t~mem4;havoc SelectionSort_#t~mem5; 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-20 03:59:27,842 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 03:59:27,842 INFO L82 PathProgramCache]: Analyzing trace with hash -304736135, now seen corresponding path program 1 times [2019-11-20 03:59:27,842 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 03:59:27,842 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [140728456] [2019-11-20 03:59:27,843 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 03:59:27,852 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-20 03:59:27,860 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-20 03:59:27,863 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-20 03:59:27,873 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 03:59:27,873 INFO L82 PathProgramCache]: Analyzing trace with hash 73540, now seen corresponding path program 1 times [2019-11-20 03:59:27,874 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 03:59:27,874 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [534059457] [2019-11-20 03:59:27,874 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 03:59:27,876 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-20 03:59:27,878 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-20 03:59:27,879 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-20 03:59:27,879 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 03:59:27,880 INFO L82 PathProgramCache]: Analyzing trace with hash 1166709708, now seen corresponding path program 1 times [2019-11-20 03:59:27,880 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 03:59:27,880 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1767845546] [2019-11-20 03:59:27,880 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 03:59:27,888 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 03:59:27,941 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-20 03:59:27,941 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1767845546] [2019-11-20 03:59:27,942 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [380443260] [2019-11-20 03:59:27,942 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_ff7ce0e7-80e9-4e1d-affa-53db3c2c315d/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-20 03:59:27,989 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 03:59:27,990 INFO L255 TraceCheckSpWp]: Trace formula consists of 87 conjuncts, 10 conjunts are in the unsatisfiable core [2019-11-20 03:59:27,990 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-20 03:59:28,036 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-20 03:59:28,036 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-20 03:59:28,036 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 12 [2019-11-20 03:59:28,036 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [741666693] [2019-11-20 03:59:28,079 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 03:59:28,079 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-11-20 03:59:28,079 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=121, Unknown=0, NotChecked=0, Total=156 [2019-11-20 03:59:28,080 INFO L87 Difference]: Start difference. First operand 53 states and 71 transitions. cyclomatic complexity: 26 Second operand 13 states. [2019-11-20 03:59:28,251 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 03:59:28,251 INFO L93 Difference]: Finished difference Result 55 states and 63 transitions. [2019-11-20 03:59:28,251 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-11-20 03:59:28,251 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 55 states and 63 transitions. [2019-11-20 03:59:28,252 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 7 [2019-11-20 03:59:28,253 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 55 states to 24 states and 28 transitions. [2019-11-20 03:59:28,253 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 17 [2019-11-20 03:59:28,253 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 17 [2019-11-20 03:59:28,253 INFO L73 IsDeterministic]: Start isDeterministic. Operand 24 states and 28 transitions. [2019-11-20 03:59:28,253 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-11-20 03:59:28,253 INFO L688 BuchiCegarLoop]: Abstraction has 24 states and 28 transitions. [2019-11-20 03:59:28,254 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states and 28 transitions. [2019-11-20 03:59:28,255 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 23. [2019-11-20 03:59:28,255 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23 states. [2019-11-20 03:59:28,255 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 27 transitions. [2019-11-20 03:59:28,255 INFO L711 BuchiCegarLoop]: Abstraction has 23 states and 27 transitions. [2019-11-20 03:59:28,255 INFO L591 BuchiCegarLoop]: Abstraction has 23 states and 27 transitions. [2019-11-20 03:59:28,255 INFO L424 BuchiCegarLoop]: ======== Iteration 9============ [2019-11-20 03:59:28,256 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 23 states and 27 transitions. [2019-11-20 03:59:28,256 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 7 [2019-11-20 03:59:28,256 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-20 03:59:28,256 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-20 03:59:28,257 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 03:59:28,257 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1] [2019-11-20 03:59:28,257 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~mem4;havoc SelectionSort_#t~mem5; 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-20 03:59:28,257 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~mem4;havoc SelectionSort_#t~mem5;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-20 03:59:28,257 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 03:59:28,257 INFO L82 PathProgramCache]: Analyzing trace with hash 1270631965, now seen corresponding path program 2 times [2019-11-20 03:59:28,258 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 03:59:28,258 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1377539029] [2019-11-20 03:59:28,258 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 03:59:28,278 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-20 03:59:28,290 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-20 03:59:28,304 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-20 03:59:28,306 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 03:59:28,306 INFO L82 PathProgramCache]: Analyzing trace with hash -1053193502, now seen corresponding path program 5 times [2019-11-20 03:59:28,306 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 03:59:28,306 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [756123628] [2019-11-20 03:59:28,306 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 03:59:28,312 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-20 03:59:28,323 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-20 03:59:28,326 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-20 03:59:28,329 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 03:59:28,329 INFO L82 PathProgramCache]: Analyzing trace with hash 38430022, now seen corresponding path program 1 times [2019-11-20 03:59:28,330 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 03:59:28,330 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [415034433] [2019-11-20 03:59:28,331 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 03:59:28,342 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-20 03:59:28,365 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-20 03:59:28,380 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-20 03:59:28,494 WARN L191 SmtUtils]: Spent 113.00 ms on a formula simplification. DAG size of input: 78 DAG size of output: 69 [2019-11-20 03:59:28,830 WARN L191 SmtUtils]: Spent 294.00 ms on a formula simplification. DAG size of input: 151 DAG size of output: 114 [2019-11-20 03:59:28,901 INFO L210 LassoAnalysis]: Preferences: [2019-11-20 03:59:28,901 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2019-11-20 03:59:28,901 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-11-20 03:59:28,901 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2019-11-20 03:59:28,901 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2019-11-20 03:59:28,901 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-20 03:59:28,901 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2019-11-20 03:59:28,901 INFO L132 ssoRankerPreferences]: Path of dumped script: [2019-11-20 03:59:28,901 INFO L133 ssoRankerPreferences]: Filename of dumped script: selectionsort-alloca-1.i_Iteration9_Lasso [2019-11-20 03:59:28,901 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2019-11-20 03:59:28,901 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2019-11-20 03:59:28,904 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-20 03:59:28,908 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-20 03:59:28,910 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-20 03:59:28,911 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-20 03:59:28,913 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-20 03:59:28,916 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-20 03:59:28,918 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-20 03:59:28,920 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-20 03:59:28,921 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-20 03:59:28,923 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-20 03:59:28,925 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-20 03:59:29,083 WARN L191 SmtUtils]: Spent 122.00 ms on a formula simplification. DAG size of input: 72 DAG size of output: 66 [2019-11-20 03:59:29,196 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-20 03:59:29,198 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-20 03:59:29,200 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-20 03:59:29,202 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-20 03:59:29,203 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-20 03:59:29,204 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-20 03:59:29,553 INFO L292 LassoAnalysis]: Preprocessing complete. [2019-11-20 03:59:29,553 INFO L489 LassoAnalysis]: Using template 'affine'. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_ff7ce0e7-80e9-4e1d-affa-53db3c2c315d/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-20 03:59:29,557 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-20 03:59:29,558 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-20 03:59:29,558 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-20 03:59:29,558 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-20 03:59:29,558 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-20 03:59:29,558 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-20 03:59:29,559 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-20 03:59:29,559 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-20 03:59:29,560 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_ff7ce0e7-80e9-4e1d-affa-53db3c2c315d/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-20 03:59:29,566 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-20 03:59:29,567 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-20 03:59:29,567 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-20 03:59:29,567 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-20 03:59:29,567 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-20 03:59:29,569 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-20 03:59:29,569 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-20 03:59:29,571 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_ff7ce0e7-80e9-4e1d-affa-53db3c2c315d/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-20 03:59:29,575 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-20 03:59:29,576 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-20 03:59:29,576 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-20 03:59:29,576 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-20 03:59:29,576 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-20 03:59:29,576 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-20 03:59:29,576 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-20 03:59:29,576 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-20 03:59:29,577 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_ff7ce0e7-80e9-4e1d-affa-53db3c2c315d/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-20 03:59:29,581 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-20 03:59:29,582 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-20 03:59:29,582 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-20 03:59:29,582 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-20 03:59:29,582 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-20 03:59:29,582 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-20 03:59:29,583 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-20 03:59:29,583 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-20 03:59:29,584 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_ff7ce0e7-80e9-4e1d-affa-53db3c2c315d/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-20 03:59:29,588 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-20 03:59:29,589 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-20 03:59:29,589 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-20 03:59:29,590 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-20 03:59:29,590 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-20 03:59:29,591 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-20 03:59:29,591 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-20 03:59:29,594 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_ff7ce0e7-80e9-4e1d-affa-53db3c2c315d/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-20 03:59:29,598 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-20 03:59:29,599 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-20 03:59:29,599 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-20 03:59:29,599 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-20 03:59:29,599 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-20 03:59:29,599 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-20 03:59:29,600 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-20 03:59:29,600 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-20 03:59:29,601 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_ff7ce0e7-80e9-4e1d-affa-53db3c2c315d/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) Waiting until toolchain timeout for monitored process 34 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-20 03:59:29,604 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-20 03:59:29,606 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-20 03:59:29,606 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-20 03:59:29,606 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-20 03:59:29,606 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-20 03:59:29,608 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-20 03:59:29,608 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-20 03:59:29,611 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_ff7ce0e7-80e9-4e1d-affa-53db3c2c315d/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) Waiting until toolchain timeout for monitored process 35 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-20 03:59:29,615 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-20 03:59:29,616 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-20 03:59:29,616 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-20 03:59:29,616 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-20 03:59:29,616 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-20 03:59:29,616 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-20 03:59:29,616 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-20 03:59:29,617 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-20 03:59:29,618 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_ff7ce0e7-80e9-4e1d-affa-53db3c2c315d/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-20 03:59:29,622 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-20 03:59:29,623 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-20 03:59:29,623 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-20 03:59:29,623 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-20 03:59:29,623 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-20 03:59:29,624 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. Waiting until toolchain timeout for monitored process 36 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-20 03:59:29,624 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-20 03:59:29,624 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-20 03:59:29,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_ff7ce0e7-80e9-4e1d-affa-53db3c2c315d/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) Waiting until toolchain timeout for monitored process 37 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-20 03:59:29,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-20 03:59:29,630 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-20 03:59:29,630 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-20 03:59:29,630 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-20 03:59:29,630 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-20 03:59:29,630 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-20 03:59:29,631 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-20 03:59:29,631 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-20 03:59:29,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_ff7ce0e7-80e9-4e1d-affa-53db3c2c315d/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) [2019-11-20 03:59:29,635 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false Waiting until toolchain timeout for monitored process 38 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-20 03:59:29,636 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-20 03:59:29,637 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-20 03:59:29,637 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-20 03:59:29,637 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-20 03:59:29,639 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-20 03:59:29,639 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-20 03:59:29,643 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_ff7ce0e7-80e9-4e1d-affa-53db3c2c315d/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-20 03:59:29,647 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-20 03:59:29,648 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-20 03:59:29,648 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-20 03:59:29,648 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-20 03:59:29,649 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-20 03:59:29,653 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-20 03:59:29,653 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-20 03:59:29,661 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_ff7ce0e7-80e9-4e1d-affa-53db3c2c315d/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-20 03:59:29,666 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-20 03:59:29,667 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-20 03:59:29,667 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-20 03:59:29,667 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-20 03:59:29,667 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-20 03:59:29,671 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-20 03:59:29,671 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-20 03:59:29,677 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_ff7ce0e7-80e9-4e1d-affa-53db3c2c315d/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-20 03:59:29,685 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-20 03:59:29,686 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-20 03:59:29,686 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-20 03:59:29,686 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-20 03:59:29,686 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-20 03:59:29,687 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-20 03:59:29,687 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-20 03:59:29,690 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_ff7ce0e7-80e9-4e1d-affa-53db3c2c315d/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-20 03:59:29,693 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-20 03:59:29,695 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-20 03:59:29,695 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-20 03:59:29,695 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-20 03:59:29,695 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-20 03:59:29,706 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-20 03:59:29,706 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-20 03:59:29,730 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-11-20 03:59:29,783 INFO L443 ModelExtractionUtils]: Simplification made 18 calls to the SMT solver. [2019-11-20 03:59:29,783 INFO L444 ModelExtractionUtils]: 21 out of 46 variables were initially zero. Simplification set additionally 22 variables to zero. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_ff7ce0e7-80e9-4e1d-affa-53db3c2c315d/bin/uautomizer/z3 Starting monitored process 43 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-11-20 03:59:29,786 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... Waiting until toolchain timeout for monitored process 43 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-20 03:59:29,789 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2019-11-20 03:59:29,789 INFO L510 LassoAnalysis]: Proved termination. [2019-11-20 03:59:29,789 INFO L512 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_SelectionSort_~i~0, ULTIMATE.start_SelectionSort_~j~0) = -1*ULTIMATE.start_SelectionSort_~i~0 + 1*ULTIMATE.start_SelectionSort_~j~0 Supporting invariants [] [2019-11-20 03:59:29,811 INFO L297 tatePredicateManager]: 9 out of 9 supporting invariants were superfluous and have been removed [2019-11-20 03:59:29,826 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 03:59:29,841 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 03:59:29,841 INFO L255 TraceCheckSpWp]: Trace formula consists of 84 conjuncts, 2 conjunts are in the unsatisfiable core [2019-11-20 03:59:29,842 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-20 03:59:29,851 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 03:59:29,851 INFO L255 TraceCheckSpWp]: Trace formula consists of 35 conjuncts, 7 conjunts are in the unsatisfiable core [2019-11-20 03:59:29,852 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-20 03:59:29,871 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 03:59:29,871 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 4 loop predicates [2019-11-20 03:59:29,871 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 23 states and 27 transitions. cyclomatic complexity: 6 Second operand 6 states. [2019-11-20 03:59:29,946 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 23 states and 27 transitions. cyclomatic complexity: 6. Second operand 6 states. Result 41 states and 51 transitions. Complement of second has 11 states. [2019-11-20 03:59:29,946 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-20 03:59:29,946 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2019-11-20 03:59:29,946 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 24 transitions. [2019-11-20 03:59:29,946 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 24 transitions. Stem has 16 letters. Loop has 7 letters. [2019-11-20 03:59:29,947 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-20 03:59:29,947 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 24 transitions. Stem has 23 letters. Loop has 7 letters. [2019-11-20 03:59:29,947 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-20 03:59:29,947 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 24 transitions. Stem has 16 letters. Loop has 14 letters. [2019-11-20 03:59:29,948 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-20 03:59:29,948 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 41 states and 51 transitions. [2019-11-20 03:59:29,949 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 7 [2019-11-20 03:59:29,950 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 41 states to 36 states and 45 transitions. [2019-11-20 03:59:29,950 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 22 [2019-11-20 03:59:29,950 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 23 [2019-11-20 03:59:29,950 INFO L73 IsDeterministic]: Start isDeterministic. Operand 36 states and 45 transitions. [2019-11-20 03:59:29,951 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-11-20 03:59:29,951 INFO L688 BuchiCegarLoop]: Abstraction has 36 states and 45 transitions. [2019-11-20 03:59:29,951 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states and 45 transitions. [2019-11-20 03:59:29,952 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 33. [2019-11-20 03:59:29,953 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33 states. [2019-11-20 03:59:29,953 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 41 transitions. [2019-11-20 03:59:29,953 INFO L711 BuchiCegarLoop]: Abstraction has 33 states and 41 transitions. [2019-11-20 03:59:29,953 INFO L591 BuchiCegarLoop]: Abstraction has 33 states and 41 transitions. [2019-11-20 03:59:29,953 INFO L424 BuchiCegarLoop]: ======== Iteration 10============ [2019-11-20 03:59:29,954 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 33 states and 41 transitions. [2019-11-20 03:59:29,954 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 7 [2019-11-20 03:59:29,954 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-20 03:59:29,954 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-20 03:59:29,955 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 03:59:29,955 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1] [2019-11-20 03:59:29,955 INFO L794 eck$LassoCheckResult]: Stem: 1428#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; 1422#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; 1423#L531 assume !(main_~array_size~0 < 1 || main_~array_size~0 >= 536870911); 1429#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; 1420#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; 1418#L536-2 main_#t~post10 := main_~i~1;main_~i~1 := 1 + main_#t~post10;havoc main_#t~post10; 1419#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; 1421#L536-2 main_#t~post10 := main_~i~1;main_~i~1 := 1 + main_#t~post10;havoc main_#t~post10; 1435#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; 1434#L536-2 main_#t~post10 := main_~i~1;main_~i~1 := 1 + main_#t~post10;havoc main_#t~post10; 1433#L536-3 assume !(main_~i~1 < main_~array_size~0); 1424#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; 1425#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; 1439#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); 1438#L521 assume !(SelectionSort_#t~mem4 < SelectionSort_#t~mem5);havoc SelectionSort_#t~mem4;havoc SelectionSort_#t~mem5; 1437#L519-2 SelectionSort_#t~pre3 := 1 + SelectionSort_~j~0;SelectionSort_~j~0 := 1 + SelectionSort_~j~0;havoc SelectionSort_#t~pre3; 1436#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); 1411#L521 assume !(SelectionSort_#t~mem4 < SelectionSort_#t~mem5);havoc SelectionSort_#t~mem4;havoc SelectionSort_#t~mem5; 1430#L519-2 SelectionSort_#t~pre3 := 1 + SelectionSort_~j~0;SelectionSort_~j~0 := 1 + SelectionSort_~j~0;havoc SelectionSort_#t~pre3; 1407#L519-3 [2019-11-20 03:59:29,955 INFO L796 eck$LassoCheckResult]: Loop: 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); 1408#L521 assume SelectionSort_#t~mem4 < SelectionSort_#t~mem5;havoc SelectionSort_#t~mem4;havoc SelectionSort_#t~mem5;SelectionSort_~min~0 := SelectionSort_~j~0; 1426#L519-2 SelectionSort_#t~pre3 := 1 + SelectionSort_~j~0;SelectionSort_~j~0 := 1 + SelectionSort_~j~0;havoc SelectionSort_#t~pre3; 1432#L519-3 assume !(SelectionSort_~j~0 < SelectionSort_~array_size); 1412#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); 1413#L515-2 SelectionSort_#t~pre2 := 1 + SelectionSort_~i~0;SelectionSort_~i~0 := 1 + SelectionSort_~i~0;havoc SelectionSort_#t~pre2; 1416#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 [2019-11-20 03:59:29,955 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 03:59:29,956 INFO L82 PathProgramCache]: Analyzing trace with hash 1850128556, now seen corresponding path program 3 times [2019-11-20 03:59:29,956 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 03:59:29,956 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1797443743] [2019-11-20 03:59:29,956 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 03:59:29,968 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-20 03:59:29,978 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-20 03:59:29,982 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-20 03:59:29,982 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 03:59:29,982 INFO L82 PathProgramCache]: Analyzing trace with hash -1053193502, now seen corresponding path program 6 times [2019-11-20 03:59:29,983 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 03:59:29,983 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [154499607] [2019-11-20 03:59:29,983 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 03:59:29,987 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-20 03:59:29,991 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-20 03:59:29,993 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-20 03:59:29,993 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 03:59:29,993 INFO L82 PathProgramCache]: Analyzing trace with hash 333237207, now seen corresponding path program 2 times [2019-11-20 03:59:29,993 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 03:59:29,994 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1580975152] [2019-11-20 03:59:29,994 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 03:59:30,004 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 03:59:30,153 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 6 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 03:59:30,153 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1580975152] [2019-11-20 03:59:30,153 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1386977816] [2019-11-20 03:59:30,153 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_ff7ce0e7-80e9-4e1d-affa-53db3c2c315d/bin/uautomizer/z3 Starting monitored process 44 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 44 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-20 03:59:30,217 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-11-20 03:59:30,218 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-20 03:59:30,219 INFO L255 TraceCheckSpWp]: Trace formula consists of 131 conjuncts, 12 conjunts are in the unsatisfiable core [2019-11-20 03:59:30,220 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-20 03:59:30,393 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 13 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 03:59:30,393 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-20 03:59:30,393 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 11] total 21 [2019-11-20 03:59:30,393 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [711774133] [2019-11-20 03:59:30,530 WARN L191 SmtUtils]: Spent 135.00 ms on a formula simplification. DAG size of input: 78 DAG size of output: 69 [2019-11-20 03:59:30,582 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 03:59:30,582 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2019-11-20 03:59:30,582 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=68, Invalid=352, Unknown=0, NotChecked=0, Total=420 [2019-11-20 03:59:30,582 INFO L87 Difference]: Start difference. First operand 33 states and 41 transitions. cyclomatic complexity: 11 Second operand 21 states. [2019-11-20 03:59:30,918 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 03:59:30,918 INFO L93 Difference]: Finished difference Result 74 states and 92 transitions. [2019-11-20 03:59:30,918 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-11-20 03:59:30,918 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 74 states and 92 transitions. [2019-11-20 03:59:30,919 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 20 [2019-11-20 03:59:30,922 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 74 states to 71 states and 88 transitions. [2019-11-20 03:59:30,922 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 42 [2019-11-20 03:59:30,922 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 42 [2019-11-20 03:59:30,922 INFO L73 IsDeterministic]: Start isDeterministic. Operand 71 states and 88 transitions. [2019-11-20 03:59:30,922 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-11-20 03:59:30,923 INFO L688 BuchiCegarLoop]: Abstraction has 71 states and 88 transitions. [2019-11-20 03:59:30,923 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 71 states and 88 transitions. [2019-11-20 03:59:30,926 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 71 to 61. [2019-11-20 03:59:30,926 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 61 states. [2019-11-20 03:59:30,927 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 77 transitions. [2019-11-20 03:59:30,927 INFO L711 BuchiCegarLoop]: Abstraction has 61 states and 77 transitions. [2019-11-20 03:59:30,927 INFO L591 BuchiCegarLoop]: Abstraction has 61 states and 77 transitions. [2019-11-20 03:59:30,927 INFO L424 BuchiCegarLoop]: ======== Iteration 11============ [2019-11-20 03:59:30,927 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 61 states and 77 transitions. [2019-11-20 03:59:30,928 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 17 [2019-11-20 03:59:30,928 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-20 03:59:30,928 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-20 03:59:30,933 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [4, 4, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 03:59:30,934 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1] [2019-11-20 03:59:30,935 INFO L794 eck$LassoCheckResult]: Stem: 1653#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; 1646#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; 1647#L531 assume !(main_~array_size~0 < 1 || main_~array_size~0 >= 536870911); 1654#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; 1643#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; 1644#L536-2 main_#t~post10 := main_~i~1;main_~i~1 := 1 + main_#t~post10;havoc main_#t~post10; 1672#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; 1638#L536-2 main_#t~post10 := main_~i~1;main_~i~1 := 1 + main_#t~post10;havoc main_#t~post10; 1639#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; 1645#L536-2 main_#t~post10 := main_~i~1;main_~i~1 := 1 + main_#t~post10;havoc main_#t~post10; 1657#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; 1658#L536-2 main_#t~post10 := main_~i~1;main_~i~1 := 1 + main_#t~post10;havoc main_#t~post10; 1660#L536-3 assume !(main_~i~1 < main_~array_size~0); 1648#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; 1649#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; 1668#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); 1669#L521 assume !(SelectionSort_#t~mem4 < SelectionSort_#t~mem5);havoc SelectionSort_#t~mem4;havoc SelectionSort_#t~mem5; 1664#L519-2 SelectionSort_#t~pre3 := 1 + SelectionSort_~j~0;SelectionSort_~j~0 := 1 + SelectionSort_~j~0;havoc SelectionSort_#t~pre3; 1665#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); 1662#L521 assume !(SelectionSort_#t~mem4 < SelectionSort_#t~mem5);havoc SelectionSort_#t~mem4;havoc SelectionSort_#t~mem5; 1673#L519-2 SelectionSort_#t~pre3 := 1 + SelectionSort_~j~0;SelectionSort_~j~0 := 1 + SelectionSort_~j~0;havoc SelectionSort_#t~pre3; 1629#L519-3 [2019-11-20 03:59:30,935 INFO L796 eck$LassoCheckResult]: Loop: 1629#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); 1630#L521 assume SelectionSort_#t~mem4 < SelectionSort_#t~mem5;havoc SelectionSort_#t~mem4;havoc SelectionSort_#t~mem5;SelectionSort_~min~0 := SelectionSort_~j~0; 1650#L519-2 SelectionSort_#t~pre3 := 1 + SelectionSort_~j~0;SelectionSort_~j~0 := 1 + SelectionSort_~j~0;havoc SelectionSort_#t~pre3; 1674#L519-3 assume !(SelectionSort_~j~0 < SelectionSort_~array_size); 1675#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); 1689#L515-2 SelectionSort_#t~pre2 := 1 + SelectionSort_~i~0;SelectionSort_~i~0 := 1 + SelectionSort_~i~0;havoc SelectionSort_#t~pre2; 1640#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; 1629#L519-3 [2019-11-20 03:59:30,935 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 03:59:30,936 INFO L82 PathProgramCache]: Analyzing trace with hash -764839030, now seen corresponding path program 4 times [2019-11-20 03:59:30,936 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 03:59:30,936 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [139403805] [2019-11-20 03:59:30,936 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 03:59:30,946 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-20 03:59:30,965 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-20 03:59:30,974 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-20 03:59:30,977 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 03:59:30,977 INFO L82 PathProgramCache]: Analyzing trace with hash -1053193502, now seen corresponding path program 7 times [2019-11-20 03:59:30,977 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 03:59:30,978 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [923882809] [2019-11-20 03:59:30,978 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 03:59:30,982 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-20 03:59:30,984 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-20 03:59:30,986 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-20 03:59:30,986 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 03:59:30,986 INFO L82 PathProgramCache]: Analyzing trace with hash -557796551, now seen corresponding path program 3 times [2019-11-20 03:59:30,987 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 03:59:30,987 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [164849872] [2019-11-20 03:59:30,987 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 03:59:31,006 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-20 03:59:31,025 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-20 03:59:31,029 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-20 03:59:31,171 WARN L191 SmtUtils]: Spent 141.00 ms on a formula simplification. DAG size of input: 78 DAG size of output: 69 [2019-11-20 03:59:31,798 WARN L191 SmtUtils]: Spent 576.00 ms on a formula simplification. DAG size of input: 186 DAG size of output: 137 [2019-11-20 03:59:31,886 INFO L210 LassoAnalysis]: Preferences: [2019-11-20 03:59:31,887 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2019-11-20 03:59:31,887 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-11-20 03:59:31,887 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2019-11-20 03:59:31,887 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2019-11-20 03:59:31,887 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-20 03:59:31,887 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2019-11-20 03:59:31,887 INFO L132 ssoRankerPreferences]: Path of dumped script: [2019-11-20 03:59:31,887 INFO L133 ssoRankerPreferences]: Filename of dumped script: selectionsort-alloca-1.i_Iteration11_Lasso [2019-11-20 03:59:31,887 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2019-11-20 03:59:31,887 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2019-11-20 03:59:31,889 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-20 03:59:31,893 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-20 03:59:31,894 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-20 03:59:31,895 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-20 03:59:31,897 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-20 03:59:31,901 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-20 03:59:31,903 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-20 03:59:31,905 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-20 03:59:31,907 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-20 03:59:31,908 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-20 03:59:32,077 WARN L191 SmtUtils]: Spent 119.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 65 [2019-11-20 03:59:32,192 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-20 03:59:32,193 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-20 03:59:32,195 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-20 03:59:32,196 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-20 03:59:32,198 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-20 03:59:32,200 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-20 03:59:32,201 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-20 03:59:32,203 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-20 03:59:32,564 INFO L292 LassoAnalysis]: Preprocessing complete. [2019-11-20 03:59:32,564 INFO L489 LassoAnalysis]: Using template 'affine'. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_ff7ce0e7-80e9-4e1d-affa-53db3c2c315d/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-20 03:59:32,567 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-20 03:59:32,568 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-20 03:59:32,568 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-20 03:59:32,568 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-20 03:59:32,568 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-20 03:59:32,568 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-20 03:59:32,569 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-20 03:59:32,569 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-20 03:59:32,570 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_ff7ce0e7-80e9-4e1d-affa-53db3c2c315d/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-20 03:59:32,574 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-20 03:59:32,575 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-20 03:59:32,576 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-20 03:59:32,576 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-20 03:59:32,576 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-20 03:59:32,576 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-20 03:59:32,576 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-20 03:59:32,576 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-20 03:59:32,577 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_ff7ce0e7-80e9-4e1d-affa-53db3c2c315d/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-20 03:59:32,581 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-20 03:59:32,582 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-20 03:59:32,582 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-20 03:59:32,582 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-20 03:59:32,582 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-20 03:59:32,582 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-20 03:59:32,583 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-20 03:59:32,583 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-20 03:59:32,584 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_ff7ce0e7-80e9-4e1d-affa-53db3c2c315d/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-20 03:59:32,593 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-20 03:59:32,594 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-20 03:59:32,594 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-20 03:59:32,594 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-20 03:59:32,595 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-20 03:59:32,595 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-20 03:59:32,595 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-20 03:59:32,595 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-20 03:59:32,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_ff7ce0e7-80e9-4e1d-affa-53db3c2c315d/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-20 03:59:32,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-20 03:59:32,601 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-20 03:59:32,602 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-20 03:59:32,602 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-20 03:59:32,602 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-20 03:59:32,602 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-20 03:59:32,602 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-20 03:59:32,602 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-20 03:59:32,603 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_ff7ce0e7-80e9-4e1d-affa-53db3c2c315d/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-20 03:59:32,607 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-20 03:59:32,608 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-20 03:59:32,608 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-20 03:59:32,608 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-20 03:59:32,608 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-20 03:59:32,609 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-20 03:59:32,609 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-20 03:59:32,611 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_ff7ce0e7-80e9-4e1d-affa-53db3c2c315d/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-20 03:59:32,615 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-20 03:59:32,616 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-20 03:59:32,616 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-20 03:59:32,616 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-20 03:59:32,617 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-20 03:59:32,618 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-20 03:59:32,618 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-20 03:59:32,621 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_ff7ce0e7-80e9-4e1d-affa-53db3c2c315d/bin/uautomizer/z3 Starting monitored process 52 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 52 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-20 03:59:32,624 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-20 03:59:32,625 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-20 03:59:32,626 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-20 03:59:32,626 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-20 03:59:32,626 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-20 03:59:32,627 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-20 03:59:32,627 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-20 03:59:32,629 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_ff7ce0e7-80e9-4e1d-affa-53db3c2c315d/bin/uautomizer/z3 Starting monitored process 53 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 53 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-20 03:59:32,634 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-20 03:59:32,635 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-20 03:59:32,635 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-20 03:59:32,635 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-20 03:59:32,636 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-20 03:59:32,636 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-20 03:59:32,636 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-20 03:59:32,636 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-20 03:59:32,637 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_ff7ce0e7-80e9-4e1d-affa-53db3c2c315d/bin/uautomizer/z3 Starting monitored process 54 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 54 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-20 03:59:32,641 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-20 03:59:32,642 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-20 03:59:32,642 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-20 03:59:32,642 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-20 03:59:32,642 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-20 03:59:32,645 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-20 03:59:32,645 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-20 03:59:32,651 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_ff7ce0e7-80e9-4e1d-affa-53db3c2c315d/bin/uautomizer/z3 Starting monitored process 55 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 55 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-20 03:59:32,655 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-20 03:59:32,657 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-20 03:59:32,657 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-20 03:59:32,657 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-20 03:59:32,657 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-20 03:59:32,667 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-20 03:59:32,667 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-20 03:59:32,687 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-11-20 03:59:32,739 INFO L443 ModelExtractionUtils]: Simplification made 27 calls to the SMT solver. [2019-11-20 03:59:32,739 INFO L444 ModelExtractionUtils]: 17 out of 43 variables were initially zero. Simplification set additionally 22 variables to zero. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_ff7ce0e7-80e9-4e1d-affa-53db3c2c315d/bin/uautomizer/z3 Starting monitored process 56 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 56 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-20 03:59:32,750 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-11-20 03:59:32,751 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2019-11-20 03:59:32,752 INFO L510 LassoAnalysis]: Proved termination. [2019-11-20 03:59:32,752 INFO L512 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_SelectionSort_~i~0, ULTIMATE.start_SelectionSort_~a.offset, v_rep(select #length ULTIMATE.start_main_~numbers~0.base)_4) = -4*ULTIMATE.start_SelectionSort_~i~0 - 1*ULTIMATE.start_SelectionSort_~a.offset + 1*v_rep(select #length ULTIMATE.start_main_~numbers~0.base)_4 Supporting invariants [] [2019-11-20 03:59:32,793 INFO L297 tatePredicateManager]: 11 out of 12 supporting invariants were superfluous and have been removed [2019-11-20 03:59:32,795 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2019-11-20 03:59:32,814 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 03:59:32,831 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 03:59:32,832 INFO L255 TraceCheckSpWp]: Trace formula consists of 106 conjuncts, 6 conjunts are in the unsatisfiable core [2019-11-20 03:59:32,833 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-20 03:59:32,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 03:59:32,850 INFO L255 TraceCheckSpWp]: Trace formula consists of 37 conjuncts, 9 conjunts are in the unsatisfiable core [2019-11-20 03:59:32,851 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-20 03:59:32,913 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-20 03:59:32,913 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.2 stem predicates 5 loop predicates [2019-11-20 03:59:32,913 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 61 states and 77 transitions. cyclomatic complexity: 21 Second operand 7 states. [2019-11-20 03:59:33,031 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 61 states and 77 transitions. cyclomatic complexity: 21. Second operand 7 states. Result 96 states and 127 transitions. Complement of second has 11 states. [2019-11-20 03:59:33,032 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 7 states 2 stem states 4 non-accepting loop states 1 accepting loop states [2019-11-20 03:59:33,032 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2019-11-20 03:59:33,033 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 22 transitions. [2019-11-20 03:59:33,033 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 22 transitions. Stem has 21 letters. Loop has 7 letters. [2019-11-20 03:59:33,033 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-20 03:59:33,033 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 22 transitions. Stem has 28 letters. Loop has 7 letters. [2019-11-20 03:59:33,033 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-20 03:59:33,034 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 22 transitions. Stem has 21 letters. Loop has 14 letters. [2019-11-20 03:59:33,034 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-20 03:59:33,034 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 96 states and 127 transitions. [2019-11-20 03:59:33,036 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2019-11-20 03:59:33,036 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 96 states to 43 states and 57 transitions. [2019-11-20 03:59:33,036 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 16 [2019-11-20 03:59:33,037 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 18 [2019-11-20 03:59:33,037 INFO L73 IsDeterministic]: Start isDeterministic. Operand 43 states and 57 transitions. [2019-11-20 03:59:33,037 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-11-20 03:59:33,037 INFO L688 BuchiCegarLoop]: Abstraction has 43 states and 57 transitions. [2019-11-20 03:59:33,037 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states and 57 transitions. [2019-11-20 03:59:33,039 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 39. [2019-11-20 03:59:33,039 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39 states. [2019-11-20 03:59:33,040 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 51 transitions. [2019-11-20 03:59:33,040 INFO L711 BuchiCegarLoop]: Abstraction has 39 states and 51 transitions. [2019-11-20 03:59:33,040 INFO L591 BuchiCegarLoop]: Abstraction has 39 states and 51 transitions. [2019-11-20 03:59:33,040 INFO L424 BuchiCegarLoop]: ======== Iteration 12============ [2019-11-20 03:59:33,040 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 39 states and 51 transitions. [2019-11-20 03:59:33,041 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2019-11-20 03:59:33,041 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-20 03:59:33,041 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-20 03:59:33,042 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [4, 4, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 03:59:33,042 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2019-11-20 03:59:33,042 INFO L794 eck$LassoCheckResult]: Stem: 1980#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; 1976#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; 1977#L531 assume !(main_~array_size~0 < 1 || main_~array_size~0 >= 536870911); 1981#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; 1973#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; 1974#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);call write~int(main_#t~nondet11, main_~numbers~0.base, main_~numbers~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet11; 1984#L536-2 main_#t~post10 := main_~i~1;main_~i~1 := 1 + main_#t~post10;havoc main_#t~post10; 1983#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; 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); 1996#L521 assume !(SelectionSort_#t~mem4 < SelectionSort_#t~mem5);havoc SelectionSort_#t~mem4;havoc SelectionSort_#t~mem5; 1995#L519-2 SelectionSort_#t~pre3 := 1 + SelectionSort_~j~0;SelectionSort_~j~0 := 1 + SelectionSort_~j~0;havoc SelectionSort_#t~pre3; 1992#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); 1960#L521 [2019-11-20 03:59:33,042 INFO L796 eck$LassoCheckResult]: Loop: 1960#L521 assume SelectionSort_#t~mem4 < SelectionSort_#t~mem5;havoc SelectionSort_#t~mem4;havoc SelectionSort_#t~mem5;SelectionSort_~min~0 := SelectionSort_~j~0; 1978#L519-2 SelectionSort_#t~pre3 := 1 + SelectionSort_~j~0;SelectionSort_~j~0 := 1 + SelectionSort_~j~0;havoc SelectionSort_#t~pre3; 1959#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); 1960#L521 [2019-11-20 03:59:33,042 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 03:59:33,043 INFO L82 PathProgramCache]: Analyzing trace with hash -1931519992, now seen corresponding path program 5 times [2019-11-20 03:59:33,043 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 03:59:33,043 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2004518424] [2019-11-20 03:59:33,043 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 03:59:33,054 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-20 03:59:33,063 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-20 03:59:33,066 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-20 03:59:33,066 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 03:59:33,066 INFO L82 PathProgramCache]: Analyzing trace with hash 71618, now seen corresponding path program 2 times [2019-11-20 03:59:33,067 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 03:59:33,067 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [964758223] [2019-11-20 03:59:33,067 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 03:59:33,069 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-20 03:59:33,071 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-20 03:59:33,072 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-20 03:59:33,072 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 03:59:33,072 INFO L82 PathProgramCache]: Analyzing trace with hash 2059791963, now seen corresponding path program 1 times [2019-11-20 03:59:33,072 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 03:59:33,073 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [993578572] [2019-11-20 03:59:33,073 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 03:59:33,086 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-20 03:59:33,099 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-20 03:59:33,102 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-20 03:59:33,659 WARN L191 SmtUtils]: Spent 489.00 ms on a formula simplification. DAG size of input: 181 DAG size of output: 132 [2019-11-20 03:59:33,748 INFO L210 LassoAnalysis]: Preferences: [2019-11-20 03:59:33,748 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2019-11-20 03:59:33,748 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-11-20 03:59:33,748 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2019-11-20 03:59:33,748 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2019-11-20 03:59:33,748 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-20 03:59:33,748 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2019-11-20 03:59:33,748 INFO L132 ssoRankerPreferences]: Path of dumped script: [2019-11-20 03:59:33,748 INFO L133 ssoRankerPreferences]: Filename of dumped script: selectionsort-alloca-1.i_Iteration12_Lasso [2019-11-20 03:59:33,748 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2019-11-20 03:59:33,749 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2019-11-20 03:59:33,751 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-20 03:59:33,754 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-20 03:59:33,909 WARN L191 SmtUtils]: Spent 113.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 64 [2019-11-20 03:59:34,027 WARN L191 SmtUtils]: Spent 104.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 53 [2019-11-20 03:59:34,027 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-20 03:59:34,029 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-20 03:59:34,031 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-20 03:59:34,032 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-20 03:59:34,034 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-20 03:59:34,036 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-20 03:59:34,037 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-20 03:59:34,041 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-20 03:59:34,042 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-20 03:59:34,044 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-20 03:59:34,046 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-20 03:59:34,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-20 03:59:34,048 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-20 03:59:34,050 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-20 03:59:34,416 INFO L292 LassoAnalysis]: Preprocessing complete. [2019-11-20 03:59:34,416 INFO L489 LassoAnalysis]: Using template 'affine'. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_ff7ce0e7-80e9-4e1d-affa-53db3c2c315d/bin/uautomizer/z3 Starting monitored process 57 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 57 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-20 03:59:34,423 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-20 03:59:34,424 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-20 03:59:34,424 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-20 03:59:34,425 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-20 03:59:34,425 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-20 03:59:34,426 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-20 03:59:34,426 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-20 03:59:34,428 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_ff7ce0e7-80e9-4e1d-affa-53db3c2c315d/bin/uautomizer/z3 Starting monitored process 58 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 58 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-20 03:59:34,431 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-20 03:59:34,433 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-20 03:59:34,433 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-20 03:59:34,433 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-20 03:59:34,433 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-20 03:59:34,437 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-20 03:59:34,437 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-20 03:59:34,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_ff7ce0e7-80e9-4e1d-affa-53db3c2c315d/bin/uautomizer/z3 Starting monitored process 59 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 59 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-20 03:59:34,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-20 03:59:34,451 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-20 03:59:34,451 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-20 03:59:34,451 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-20 03:59:34,451 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-20 03:59:34,454 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-20 03:59:34,454 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-20 03:59:34,459 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_ff7ce0e7-80e9-4e1d-affa-53db3c2c315d/bin/uautomizer/z3 Starting monitored process 60 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 60 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-20 03:59:34,464 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-20 03:59:34,465 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-20 03:59:34,465 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-20 03:59:34,466 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-20 03:59:34,466 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-20 03:59:34,468 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-20 03:59:34,468 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-20 03:59:34,477 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_ff7ce0e7-80e9-4e1d-affa-53db3c2c315d/bin/uautomizer/z3 Starting monitored process 61 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-11-20 03:59:34,484 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-20 03:59:34,485 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-20 03:59:34,485 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-20 03:59:34,486 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-20 03:59:34,486 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-20 03:59:34,487 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-20 03:59:34,487 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. Waiting until toolchain timeout for monitored process 61 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-20 03:59:34,490 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_ff7ce0e7-80e9-4e1d-affa-53db3c2c315d/bin/uautomizer/z3 Starting monitored process 62 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-11-20 03:59:34,502 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-20 03:59:34,504 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-20 03:59:34,504 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-20 03:59:34,504 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-20 03:59:34,504 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-20 03:59:34,513 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-20 03:59:34,513 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. Waiting until toolchain timeout for monitored process 62 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-20 03:59:34,536 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-11-20 03:59:34,562 INFO L443 ModelExtractionUtils]: Simplification made 12 calls to the SMT solver. [2019-11-20 03:59:34,562 INFO L444 ModelExtractionUtils]: 9 out of 43 variables were initially zero. Simplification set additionally 31 variables to zero. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_ff7ce0e7-80e9-4e1d-affa-53db3c2c315d/bin/uautomizer/z3 Starting monitored process 63 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 63 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-20 03:59:34,565 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-11-20 03:59:34,567 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2019-11-20 03:59:34,567 INFO L510 LassoAnalysis]: Proved termination. [2019-11-20 03:59:34,567 INFO L512 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_SelectionSort_~j~0, ULTIMATE.start_SelectionSort_~array_size) = -1*ULTIMATE.start_SelectionSort_~j~0 + 1*ULTIMATE.start_SelectionSort_~array_size Supporting invariants [] [2019-11-20 03:59:34,585 INFO L297 tatePredicateManager]: 8 out of 8 supporting invariants were superfluous and have been removed [2019-11-20 03:59:34,600 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 03:59:34,614 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 03:59:34,615 INFO L255 TraceCheckSpWp]: Trace formula consists of 103 conjuncts, 2 conjunts are in the unsatisfiable core [2019-11-20 03:59:34,615 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-20 03:59:34,620 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 03:59:34,621 INFO L255 TraceCheckSpWp]: Trace formula consists of 18 conjuncts, 4 conjunts are in the unsatisfiable core [2019-11-20 03:59:34,621 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-20 03:59:34,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-20 03:59:34,634 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-20 03:59:34,634 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 39 states and 51 transitions. cyclomatic complexity: 16 Second operand 4 states. [2019-11-20 03:59:34,661 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 39 states and 51 transitions. cyclomatic complexity: 16. Second operand 4 states. Result 73 states and 95 transitions. Complement of second has 7 states. [2019-11-20 03:59:34,664 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-20 03:59:34,664 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2019-11-20 03:59:34,664 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 17 transitions. [2019-11-20 03:59:34,664 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 17 transitions. Stem has 19 letters. Loop has 3 letters. [2019-11-20 03:59:34,665 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-20 03:59:34,665 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 17 transitions. Stem has 22 letters. Loop has 3 letters. [2019-11-20 03:59:34,665 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-20 03:59:34,665 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 17 transitions. Stem has 19 letters. Loop has 6 letters. [2019-11-20 03:59:34,665 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-20 03:59:34,665 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 73 states and 95 transitions. [2019-11-20 03:59:34,666 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2019-11-20 03:59:34,667 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 73 states to 56 states and 72 transitions. [2019-11-20 03:59:34,667 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 12 [2019-11-20 03:59:34,667 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 12 [2019-11-20 03:59:34,667 INFO L73 IsDeterministic]: Start isDeterministic. Operand 56 states and 72 transitions. [2019-11-20 03:59:34,667 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-11-20 03:59:34,667 INFO L688 BuchiCegarLoop]: Abstraction has 56 states and 72 transitions. [2019-11-20 03:59:34,668 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56 states and 72 transitions. [2019-11-20 03:59:34,670 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56 to 45. [2019-11-20 03:59:34,670 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 45 states. [2019-11-20 03:59:34,670 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 60 transitions. [2019-11-20 03:59:34,670 INFO L711 BuchiCegarLoop]: Abstraction has 45 states and 60 transitions. [2019-11-20 03:59:34,671 INFO L591 BuchiCegarLoop]: Abstraction has 45 states and 60 transitions. [2019-11-20 03:59:34,671 INFO L424 BuchiCegarLoop]: ======== Iteration 13============ [2019-11-20 03:59:34,671 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 45 states and 60 transitions. [2019-11-20 03:59:34,671 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2019-11-20 03:59:34,671 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-20 03:59:34,671 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-20 03:59:34,672 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [4, 4, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 03:59:34,672 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2019-11-20 03:59:34,672 INFO L794 eck$LassoCheckResult]: Stem: 2213#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; 2207#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; 2208#L531 assume !(main_~array_size~0 < 1 || main_~array_size~0 >= 536870911); 2214#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; 2205#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; 2200#L536-2 main_#t~post10 := main_~i~1;main_~i~1 := 1 + main_#t~post10;havoc main_#t~post10; 2201#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; 2206#L536-2 main_#t~post10 := main_~i~1;main_~i~1 := 1 + main_#t~post10;havoc main_#t~post10; 2223#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; 2222#L536-2 main_#t~post10 := main_~i~1;main_~i~1 := 1 + main_#t~post10;havoc main_#t~post10; 2221#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; 2220#L536-2 main_#t~post10 := main_~i~1;main_~i~1 := 1 + main_#t~post10;havoc main_#t~post10; 2219#L536-3 assume !(main_~i~1 < main_~array_size~0); 2209#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; 2202#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; 2193#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); 2194#L521 assume !(SelectionSort_#t~mem4 < SelectionSort_#t~mem5);havoc SelectionSort_#t~mem4;havoc SelectionSort_#t~mem5; 2210#L519-2 SelectionSort_#t~pre3 := 1 + SelectionSort_~j~0;SelectionSort_~j~0 := 1 + SelectionSort_~j~0;havoc SelectionSort_#t~pre3; 2231#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); 2226#L521 assume !(SelectionSort_#t~mem4 < SelectionSort_#t~mem5);havoc SelectionSort_#t~mem4;havoc SelectionSort_#t~mem5; 2225#L519-2 SelectionSort_#t~pre3 := 1 + SelectionSort_~j~0;SelectionSort_~j~0 := 1 + SelectionSort_~j~0;havoc SelectionSort_#t~pre3; 2224#L519-3 assume !(SelectionSort_~j~0 < SelectionSort_~array_size); 2197#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); 2198#L515-2 SelectionSort_#t~pre2 := 1 + SelectionSort_~i~0;SelectionSort_~i~0 := 1 + SelectionSort_~i~0;havoc SelectionSort_#t~pre2; 2199#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; 2229#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); 2218#L521 [2019-11-20 03:59:34,672 INFO L796 eck$LassoCheckResult]: Loop: 2218#L521 assume SelectionSort_#t~mem4 < SelectionSort_#t~mem5;havoc SelectionSort_#t~mem4;havoc SelectionSort_#t~mem5;SelectionSort_~min~0 := SelectionSort_~j~0; 2215#L519-2 SelectionSort_#t~pre3 := 1 + SelectionSort_~j~0;SelectionSort_~j~0 := 1 + SelectionSort_~j~0;havoc SelectionSort_#t~pre3; 2216#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); 2218#L521 [2019-11-20 03:59:34,672 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 03:59:34,673 INFO L82 PathProgramCache]: Analyzing trace with hash 417927685, now seen corresponding path program 1 times [2019-11-20 03:59:34,673 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 03:59:34,673 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1927325524] [2019-11-20 03:59:34,673 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 03:59:34,684 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 03:59:34,802 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-20 03:59:34,802 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1927325524] [2019-11-20 03:59:34,803 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [259089533] [2019-11-20 03:59:34,803 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_ff7ce0e7-80e9-4e1d-affa-53db3c2c315d/bin/uautomizer/z3 Starting monitored process 64 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 64 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-20 03:59:34,844 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 03:59:34,845 INFO L255 TraceCheckSpWp]: Trace formula consists of 134 conjuncts, 12 conjunts are in the unsatisfiable core [2019-11-20 03:59:34,846 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-20 03:59:34,943 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-20 03:59:34,943 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-20 03:59:34,943 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 11] total 21 [2019-11-20 03:59:34,944 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1736947049] [2019-11-20 03:59:34,944 INFO L799 eck$LassoCheckResult]: stem already infeasible [2019-11-20 03:59:34,944 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 03:59:34,944 INFO L82 PathProgramCache]: Analyzing trace with hash 71618, now seen corresponding path program 3 times [2019-11-20 03:59:34,944 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 03:59:34,944 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2128525835] [2019-11-20 03:59:34,945 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 03:59:34,947 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-20 03:59:34,949 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-20 03:59:34,950 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-20 03:59:35,005 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 03:59:35,005 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2019-11-20 03:59:35,005 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=74, Invalid=346, Unknown=0, NotChecked=0, Total=420 [2019-11-20 03:59:35,005 INFO L87 Difference]: Start difference. First operand 45 states and 60 transitions. cyclomatic complexity: 20 Second operand 21 states. [2019-11-20 03:59:35,274 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 03:59:35,274 INFO L93 Difference]: Finished difference Result 45 states and 59 transitions. [2019-11-20 03:59:35,274 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-11-20 03:59:35,275 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 45 states and 59 transitions. [2019-11-20 03:59:35,275 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2019-11-20 03:59:35,276 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 45 states to 42 states and 55 transitions. [2019-11-20 03:59:35,276 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 12 [2019-11-20 03:59:35,276 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 12 [2019-11-20 03:59:35,276 INFO L73 IsDeterministic]: Start isDeterministic. Operand 42 states and 55 transitions. [2019-11-20 03:59:35,276 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-11-20 03:59:35,276 INFO L688 BuchiCegarLoop]: Abstraction has 42 states and 55 transitions. [2019-11-20 03:59:35,276 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states and 55 transitions. [2019-11-20 03:59:35,277 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 35. [2019-11-20 03:59:35,277 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35 states. [2019-11-20 03:59:35,278 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 45 transitions. [2019-11-20 03:59:35,278 INFO L711 BuchiCegarLoop]: Abstraction has 35 states and 45 transitions. [2019-11-20 03:59:35,278 INFO L591 BuchiCegarLoop]: Abstraction has 35 states and 45 transitions. [2019-11-20 03:59:35,278 INFO L424 BuchiCegarLoop]: ======== Iteration 14============ [2019-11-20 03:59:35,278 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 35 states and 45 transitions. [2019-11-20 03:59:35,279 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2019-11-20 03:59:35,279 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-20 03:59:35,279 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-20 03:59:35,279 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [4, 4, 4, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 03:59:35,280 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2019-11-20 03:59:35,280 INFO L794 eck$LassoCheckResult]: Stem: 2412#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; 2407#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; 2408#L531 assume !(main_~array_size~0 < 1 || main_~array_size~0 >= 536870911); 2413#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; 2405#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; 2401#L536-2 main_#t~post10 := main_~i~1;main_~i~1 := 1 + main_#t~post10;havoc main_#t~post10; 2402#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; 2406#L536-2 main_#t~post10 := main_~i~1;main_~i~1 := 1 + main_#t~post10;havoc main_#t~post10; 2423#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; 2422#L536-2 main_#t~post10 := main_~i~1;main_~i~1 := 1 + main_#t~post10;havoc main_#t~post10; 2421#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; 2420#L536-2 main_#t~post10 := main_~i~1;main_~i~1 := 1 + main_#t~post10;havoc main_#t~post10; 2419#L536-3 assume !(main_~i~1 < main_~array_size~0); 2409#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; 2403#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; 2394#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); 2395#L521 assume !(SelectionSort_#t~mem4 < SelectionSort_#t~mem5);havoc SelectionSort_#t~mem4;havoc SelectionSort_#t~mem5; 2410#L519-2 SelectionSort_#t~pre3 := 1 + SelectionSort_~j~0;SelectionSort_~j~0 := 1 + SelectionSort_~j~0;havoc SelectionSort_#t~pre3; 2396#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); 2397#L521 assume !(SelectionSort_#t~mem4 < SelectionSort_#t~mem5);havoc SelectionSort_#t~mem4;havoc SelectionSort_#t~mem5; 2411#L519-2 SelectionSort_#t~pre3 := 1 + SelectionSort_~j~0;SelectionSort_~j~0 := 1 + SelectionSort_~j~0;havoc SelectionSort_#t~pre3; 2416#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); 2426#L521 assume !(SelectionSort_#t~mem4 < SelectionSort_#t~mem5);havoc SelectionSort_#t~mem4;havoc SelectionSort_#t~mem5; 2425#L519-2 SelectionSort_#t~pre3 := 1 + SelectionSort_~j~0;SelectionSort_~j~0 := 1 + SelectionSort_~j~0;havoc SelectionSort_#t~pre3; 2424#L519-3 assume !(SelectionSort_~j~0 < SelectionSort_~array_size); 2398#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); 2399#L515-2 SelectionSort_#t~pre2 := 1 + SelectionSort_~i~0;SelectionSort_~i~0 := 1 + SelectionSort_~i~0;havoc SelectionSort_#t~pre2; 2400#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; 2404#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); 2417#L521 [2019-11-20 03:59:35,280 INFO L796 eck$LassoCheckResult]: Loop: 2417#L521 assume SelectionSort_#t~mem4 < SelectionSort_#t~mem5;havoc SelectionSort_#t~mem4;havoc SelectionSort_#t~mem5;SelectionSort_~min~0 := SelectionSort_~j~0; 2414#L519-2 SelectionSort_#t~pre3 := 1 + SelectionSort_~j~0;SelectionSort_~j~0 := 1 + SelectionSort_~j~0;havoc SelectionSort_#t~pre3; 2415#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); 2417#L521 [2019-11-20 03:59:35,280 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 03:59:35,280 INFO L82 PathProgramCache]: Analyzing trace with hash 1663183504, now seen corresponding path program 2 times [2019-11-20 03:59:35,280 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 03:59:35,280 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [116158242] [2019-11-20 03:59:35,280 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 03:59:35,293 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-20 03:59:35,305 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-20 03:59:35,308 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-20 03:59:35,308 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 03:59:35,309 INFO L82 PathProgramCache]: Analyzing trace with hash 71618, now seen corresponding path program 4 times [2019-11-20 03:59:35,309 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 03:59:35,309 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1597958343] [2019-11-20 03:59:35,309 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 03:59:35,311 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-20 03:59:35,313 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-20 03:59:35,318 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-20 03:59:35,318 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 03:59:35,318 INFO L82 PathProgramCache]: Analyzing trace with hash 1157082835, now seen corresponding path program 4 times [2019-11-20 03:59:35,318 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 03:59:35,318 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [207204075] [2019-11-20 03:59:35,318 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 03:59:35,360 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-20 03:59:35,410 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-20 03:59:35,414 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-20 03:59:36,777 WARN L191 SmtUtils]: Spent 1.29 s on a formula simplification. DAG size of input: 251 DAG size of output: 185 [2019-11-20 03:59:36,976 WARN L191 SmtUtils]: Spent 192.00 ms on a formula simplification that was a NOOP. DAG size: 119 [2019-11-20 03:59:36,978 INFO L210 LassoAnalysis]: Preferences: [2019-11-20 03:59:36,978 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2019-11-20 03:59:36,978 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-11-20 03:59:36,978 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2019-11-20 03:59:36,978 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2019-11-20 03:59:36,978 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-20 03:59:36,978 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2019-11-20 03:59:36,978 INFO L132 ssoRankerPreferences]: Path of dumped script: [2019-11-20 03:59:36,979 INFO L133 ssoRankerPreferences]: Filename of dumped script: selectionsort-alloca-1.i_Iteration14_Lasso [2019-11-20 03:59:36,979 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2019-11-20 03:59:36,979 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2019-11-20 03:59:36,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-20 03:59:36,983 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-20 03:59:36,989 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-20 03:59:36,991 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-20 03:59:36,994 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-20 03:59:36,996 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-20 03:59:36,998 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-20 03:59:37,000 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-20 03:59:37,003 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-20 03:59:37,004 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-20 03:59:37,005 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-20 03:59:37,159 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-20 03:59:37,161 INFO L168 Benchmark]: Toolchain (without parser) took 17328.64 ms. Allocated memory was 1.0 GB in the beginning and 1.3 GB in the end (delta: 280.5 MB). Free memory was 939.4 MB in the beginning and 843.6 MB in the end (delta: 95.8 MB). Peak memory consumption was 376.3 MB. Max. memory is 11.5 GB. [2019-11-20 03:59:37,161 INFO L168 Benchmark]: CDTParser took 0.18 ms. Allocated memory is still 1.0 GB. Free memory is still 967.6 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-20 03:59:37,161 INFO L168 Benchmark]: CACSL2BoogieTranslator took 525.15 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 131.6 MB). Free memory was 939.4 MB in the beginning and 1.1 GB in the end (delta: -174.7 MB). Peak memory consumption was 18.2 MB. Max. memory is 11.5 GB. [2019-11-20 03:59:37,161 INFO L168 Benchmark]: Boogie Procedure Inliner took 56.23 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-20 03:59:37,162 INFO L168 Benchmark]: Boogie Preprocessor took 24.39 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. [2019-11-20 03:59:37,162 INFO L168 Benchmark]: RCFGBuilder took 331.21 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 17.0 MB). Peak memory consumption was 17.0 MB. Max. memory is 11.5 GB. [2019-11-20 03:59:37,162 INFO L168 Benchmark]: BuchiAutomizer took 16389.14 ms. Allocated memory was 1.2 GB in the beginning and 1.3 GB in the end (delta: 148.9 MB). Free memory was 1.1 GB in the beginning and 843.6 MB in the end (delta: 242.8 MB). Peak memory consumption was 391.7 MB. Max. memory is 11.5 GB. [2019-11-20 03:59:37,164 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.18 ms. Allocated memory is still 1.0 GB. Free memory is still 967.6 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 525.15 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 131.6 MB). Free memory was 939.4 MB in the beginning and 1.1 GB in the end (delta: -174.7 MB). Peak memory consumption was 18.2 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 56.23 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * Boogie Preprocessor took 24.39 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. * RCFGBuilder took 331.21 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 17.0 MB). Peak memory consumption was 17.0 MB. Max. memory is 11.5 GB. * BuchiAutomizer took 16389.14 ms. Allocated memory was 1.2 GB in the beginning and 1.3 GB in the end (delta: 148.9 MB). Free memory was 1.1 GB in the beginning and 843.6 MB in the end (delta: 242.8 MB). Peak memory consumption was 391.7 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 * 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...