./Ultimate.py --spec ../../sv-benchmarks/c/properties/termination.prp --file ../../sv-benchmarks/c/array-memsafety/bubblesort-alloca-2.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for termination Using default analysis Version a4ecdabc Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/run_dir_4e71fa68-d1ff-4e8c-8bed-4ff7652a5c28/bin/uautomizer/data/config -Xmx15G -Xms4m -jar /tmp/vcloud-vcloud-master/worker/run_dir_4e71fa68-d1ff-4e8c-8bed-4ff7652a5c28/bin/uautomizer/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/run_dir_4e71fa68-d1ff-4e8c-8bed-4ff7652a5c28/bin/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/run_dir_4e71fa68-d1ff-4e8c-8bed-4ff7652a5c28/bin/uautomizer/config/AutomizerTermination.xml -i ../../sv-benchmarks/c/array-memsafety/bubblesort-alloca-2.i -s /tmp/vcloud-vcloud-master/worker/run_dir_4e71fa68-d1ff-4e8c-8bed-4ff7652a5c28/bin/uautomizer/config/svcomp-Termination-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/run_dir_4e71fa68-d1ff-4e8c-8bed-4ff7652a5c28/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 a2eb39e0d0d0fa911fcf8a16c5f9511be1d37325 .................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................. Execution finished normally Using bit-precise analysis No suitable file found in config dir /tmp/vcloud-vcloud-master/worker/run_dir_4e71fa68-d1ff-4e8c-8bed-4ff7652a5c28/bin/uautomizer/config using search string *Termination*32bit*_Bitvector*.epf No suitable settings file found using Termination*32bit*_Bitvector ERROR: UNSUPPORTED PROPERTY Writing output log to file Ultimate.log Result: ERROR: ExceptionOrErrorResult: AssertionError: MapEliminator tries to combine Int and (Array Int Int) --- Real Ultimate output --- This is Ultimate 0.2.0-a4ecdab [2020-11-30 00:08:40,596 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-11-30 00:08:40,598 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-11-30 00:08:40,653 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-11-30 00:08:40,679 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-11-30 00:08:40,681 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-11-30 00:08:40,683 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-11-30 00:08:40,686 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-11-30 00:08:40,689 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-11-30 00:08:40,696 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-11-30 00:08:40,697 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-11-30 00:08:40,699 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-11-30 00:08:40,699 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-11-30 00:08:40,701 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-11-30 00:08:40,703 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-11-30 00:08:40,704 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-11-30 00:08:40,707 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-11-30 00:08:40,714 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-11-30 00:08:40,720 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-11-30 00:08:40,727 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-11-30 00:08:40,729 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-11-30 00:08:40,732 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-11-30 00:08:40,735 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-11-30 00:08:40,737 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-11-30 00:08:40,751 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-11-30 00:08:40,752 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-11-30 00:08:40,752 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-11-30 00:08:40,754 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-11-30 00:08:40,755 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-11-30 00:08:40,756 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-11-30 00:08:40,757 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-11-30 00:08:40,758 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-11-30 00:08:40,761 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-11-30 00:08:40,762 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-11-30 00:08:40,763 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-11-30 00:08:40,764 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-11-30 00:08:40,765 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-11-30 00:08:40,765 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-11-30 00:08:40,765 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-11-30 00:08:40,766 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-11-30 00:08:40,767 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-11-30 00:08:40,773 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/run_dir_4e71fa68-d1ff-4e8c-8bed-4ff7652a5c28/bin/uautomizer/config/svcomp-Termination-32bit-Automizer_Default.epf [2020-11-30 00:08:40,828 INFO L113 SettingsManager]: Loading preferences was successful [2020-11-30 00:08:40,829 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-11-30 00:08:40,831 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2020-11-30 00:08:40,831 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2020-11-30 00:08:40,831 INFO L138 SettingsManager]: * Use SBE=true [2020-11-30 00:08:40,832 INFO L136 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2020-11-30 00:08:40,832 INFO L138 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2020-11-30 00:08:40,832 INFO L138 SettingsManager]: * Use old map elimination=false [2020-11-30 00:08:40,833 INFO L138 SettingsManager]: * Use external solver (rank synthesis)=false [2020-11-30 00:08:40,833 INFO L138 SettingsManager]: * Use only trivial implications for array writes=true [2020-11-30 00:08:40,834 INFO L138 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2020-11-30 00:08:40,835 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-11-30 00:08:40,835 INFO L138 SettingsManager]: * sizeof long=4 [2020-11-30 00:08:40,835 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2020-11-30 00:08:40,836 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-11-30 00:08:40,836 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-11-30 00:08:40,836 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-11-30 00:08:40,836 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2020-11-30 00:08:40,837 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2020-11-30 00:08:40,837 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2020-11-30 00:08:40,837 INFO L138 SettingsManager]: * sizeof long double=12 [2020-11-30 00:08:40,837 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-11-30 00:08:40,838 INFO L138 SettingsManager]: * Assume nondeterminstic values are in range=false [2020-11-30 00:08:40,838 INFO L138 SettingsManager]: * Use constant arrays=true [2020-11-30 00:08:40,838 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2020-11-30 00:08:40,839 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-11-30 00:08:40,839 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2020-11-30 00:08:40,839 INFO L138 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2020-11-30 00:08:40,840 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-11-30 00:08:40,841 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2020-11-30 00:08:40,842 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2020-11-30 00:08:40,843 INFO L138 SettingsManager]: * Dump automata to the following directory=/home/matthias/ultimate/dump/auto [2020-11-30 00:08:40,844 INFO L136 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2020-11-30 00:08:40,845 INFO L138 SettingsManager]: * TransformationType=MODULO_NEIGHBOR WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/tmp/vcloud-vcloud-master/worker/run_dir_4e71fa68-d1ff-4e8c-8bed-4ff7652a5c28/bin/uautomizer/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /tmp/vcloud-vcloud-master/worker/run_dir_4e71fa68-d1ff-4e8c-8bed-4ff7652a5c28/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 -> a2eb39e0d0d0fa911fcf8a16c5f9511be1d37325 [2020-11-30 00:08:41,219 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2020-11-30 00:08:41,264 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-11-30 00:08:41,270 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-11-30 00:08:41,271 INFO L271 PluginConnector]: Initializing CDTParser... [2020-11-30 00:08:41,272 INFO L275 PluginConnector]: CDTParser initialized [2020-11-30 00:08:41,286 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/run_dir_4e71fa68-d1ff-4e8c-8bed-4ff7652a5c28/bin/uautomizer/../../sv-benchmarks/c/array-memsafety/bubblesort-alloca-2.i [2020-11-30 00:08:41,371 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_4e71fa68-d1ff-4e8c-8bed-4ff7652a5c28/bin/uautomizer/data/b304f3634/18dd1667e2a84a538aeabf00ff3b3b09/FLAG0374fa6ba [2020-11-30 00:08:42,150 INFO L306 CDTParser]: Found 1 translation units. [2020-11-30 00:08:42,151 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/run_dir_4e71fa68-d1ff-4e8c-8bed-4ff7652a5c28/sv-benchmarks/c/array-memsafety/bubblesort-alloca-2.i [2020-11-30 00:08:42,167 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_4e71fa68-d1ff-4e8c-8bed-4ff7652a5c28/bin/uautomizer/data/b304f3634/18dd1667e2a84a538aeabf00ff3b3b09/FLAG0374fa6ba [2020-11-30 00:08:42,377 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/run_dir_4e71fa68-d1ff-4e8c-8bed-4ff7652a5c28/bin/uautomizer/data/b304f3634/18dd1667e2a84a538aeabf00ff3b3b09 [2020-11-30 00:08:42,380 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-11-30 00:08:42,382 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2020-11-30 00:08:42,396 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-11-30 00:08:42,396 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-11-30 00:08:42,400 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-11-30 00:08:42,401 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 30.11 12:08:42" (1/1) ... [2020-11-30 00:08:42,404 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@59681571 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.11 12:08:42, skipping insertion in model container [2020-11-30 00:08:42,404 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 30.11 12:08:42" (1/1) ... [2020-11-30 00:08:42,413 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-11-30 00:08:42,480 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-11-30 00:08:42,875 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-11-30 00:08:42,886 INFO L203 MainTranslator]: Completed pre-run [2020-11-30 00:08:42,971 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-11-30 00:08:43,049 INFO L208 MainTranslator]: Completed translation [2020-11-30 00:08:43,051 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.11 12:08:43 WrapperNode [2020-11-30 00:08:43,053 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-11-30 00:08:43,054 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2020-11-30 00:08:43,054 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2020-11-30 00:08:43,055 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2020-11-30 00:08:43,064 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.11 12:08:43" (1/1) ... [2020-11-30 00:08:43,096 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.11 12:08:43" (1/1) ... [2020-11-30 00:08:43,132 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2020-11-30 00:08:43,133 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-11-30 00:08:43,133 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-11-30 00:08:43,133 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-11-30 00:08:43,143 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.11 12:08:43" (1/1) ... [2020-11-30 00:08:43,143 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.11 12:08:43" (1/1) ... [2020-11-30 00:08:43,147 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.11 12:08:43" (1/1) ... [2020-11-30 00:08:43,147 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.11 12:08:43" (1/1) ... [2020-11-30 00:08:43,154 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.11 12:08:43" (1/1) ... [2020-11-30 00:08:43,159 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.11 12:08:43" (1/1) ... [2020-11-30 00:08:43,161 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.11 12:08:43" (1/1) ... [2020-11-30 00:08:43,164 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-11-30 00:08:43,166 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-11-30 00:08:43,166 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-11-30 00:08:43,166 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-11-30 00:08:43,167 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.11 12:08:43" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_4e71fa68-d1ff-4e8c-8bed-4ff7652a5c28/bin/uautomizer/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-11-30 00:08:43,245 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2020-11-30 00:08:43,246 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2020-11-30 00:08:43,246 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2020-11-30 00:08:43,246 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2020-11-30 00:08:43,246 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-11-30 00:08:43,246 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-11-30 00:08:43,751 INFO L293 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-11-30 00:08:43,751 INFO L298 CfgBuilder]: Removed 9 assume(true) statements. [2020-11-30 00:08:43,754 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 30.11 12:08:43 BoogieIcfgContainer [2020-11-30 00:08:43,754 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-11-30 00:08:43,755 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2020-11-30 00:08:43,755 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2020-11-30 00:08:43,759 INFO L275 PluginConnector]: BuchiAutomizer initialized [2020-11-30 00:08:43,760 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2020-11-30 00:08:43,761 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 30.11 12:08:42" (1/3) ... [2020-11-30 00:08:43,762 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@5db4c8a6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 30.11 12:08:43, skipping insertion in model container [2020-11-30 00:08:43,762 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2020-11-30 00:08:43,763 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.11 12:08:43" (2/3) ... [2020-11-30 00:08:43,763 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@5db4c8a6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 30.11 12:08:43, skipping insertion in model container [2020-11-30 00:08:43,763 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2020-11-30 00:08:43,764 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 30.11 12:08:43" (3/3) ... [2020-11-30 00:08:43,766 INFO L373 chiAutomizerObserver]: Analyzing ICFG bubblesort-alloca-2.i [2020-11-30 00:08:43,838 INFO L359 BuchiCegarLoop]: Interprodecural is true [2020-11-30 00:08:43,839 INFO L360 BuchiCegarLoop]: Hoare is false [2020-11-30 00:08:43,839 INFO L361 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2020-11-30 00:08:43,839 INFO L362 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2020-11-30 00:08:43,839 INFO L363 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-11-30 00:08:43,839 INFO L364 BuchiCegarLoop]: Difference is false [2020-11-30 00:08:43,840 INFO L365 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-11-30 00:08:43,840 INFO L368 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2020-11-30 00:08:43,857 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 16 states. [2020-11-30 00:08:43,883 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 7 [2020-11-30 00:08:43,884 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-11-30 00:08:43,884 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-11-30 00:08:43,892 INFO L852 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1] [2020-11-30 00:08:43,893 INFO L853 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2020-11-30 00:08:43,893 INFO L427 BuchiCegarLoop]: ======== Iteration 1============ [2020-11-30 00:08:43,893 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 16 states. [2020-11-30 00:08:43,897 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 7 [2020-11-30 00:08:43,897 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-11-30 00:08:43,897 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-11-30 00:08:43,898 INFO L852 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1] [2020-11-30 00:08:43,898 INFO L853 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2020-11-30 00:08:43,928 INFO L794 eck$LassoCheckResult]: Stem: 10#ULTIMATE.startENTRYtrue #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; 9#L-1true havoc main_#res;havoc main_#t~nondet8, main_#t~malloc9.base, main_#t~malloc9.offset, main_#t~nondet11, main_#t~post10, main_~k~0, main_~array_size~0, main_~numbers~0.base, main_~numbers~0.offset;main_~array_size~0 := main_#t~nondet8;havoc main_#t~nondet8; 18#L527true assume !(main_~array_size~0 < 1 || main_~array_size~0 >= 536870911); 3#L527-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_~k~0 := 0; 13#L532-3true [2020-11-30 00:08:43,929 INFO L796 eck$LassoCheckResult]: Loop: 13#L532-3true assume !!(main_~k~0 < main_~array_size~0);call write~int(main_#t~nondet11, main_~numbers~0.base, main_~numbers~0.offset + 4 * main_~k~0, 4);havoc main_#t~nondet11; 11#L532-2true main_#t~post10 := main_~k~0;main_~k~0 := 1 + main_#t~post10;havoc main_#t~post10; 13#L532-3true [2020-11-30 00:08:43,938 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-30 00:08:43,939 INFO L82 PathProgramCache]: Analyzing trace with hash 925669, now seen corresponding path program 1 times [2020-11-30 00:08:43,959 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-30 00:08:43,961 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1481464427] [2020-11-30 00:08:43,961 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-30 00:08:44,119 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-11-30 00:08:44,120 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-11-30 00:08:44,147 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-11-30 00:08:44,147 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-11-30 00:08:44,173 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-11-30 00:08:44,178 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-30 00:08:44,179 INFO L82 PathProgramCache]: Analyzing trace with hash 1507, now seen corresponding path program 1 times [2020-11-30 00:08:44,180 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-30 00:08:44,180 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [945003415] [2020-11-30 00:08:44,181 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-30 00:08:44,203 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-11-30 00:08:44,206 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-11-30 00:08:44,222 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-11-30 00:08:44,223 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-11-30 00:08:44,236 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-11-30 00:08:44,245 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-30 00:08:44,251 INFO L82 PathProgramCache]: Analyzing trace with hash 889568455, now seen corresponding path program 1 times [2020-11-30 00:08:44,251 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-30 00:08:44,252 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [511170600] [2020-11-30 00:08:44,252 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-30 00:08:44,291 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-11-30 00:08:44,292 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-11-30 00:08:44,324 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-11-30 00:08:44,328 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-11-30 00:08:44,333 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-11-30 00:08:44,681 WARN L193 SmtUtils]: Spent 208.00 ms on a formula simplification. DAG size of input: 44 DAG size of output: 42 [2020-11-30 00:08:44,771 INFO L210 LassoAnalysis]: Preferences: [2020-11-30 00:08:44,772 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2020-11-30 00:08:44,772 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2020-11-30 00:08:44,773 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2020-11-30 00:08:44,773 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2020-11-30 00:08:44,773 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-11-30 00:08:44,773 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2020-11-30 00:08:44,774 INFO L132 ssoRankerPreferences]: Path of dumped script: [2020-11-30 00:08:44,774 INFO L133 ssoRankerPreferences]: Filename of dumped script: bubblesort-alloca-2.i_Iteration1_Lasso [2020-11-30 00:08:44,774 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2020-11-30 00:08:44,774 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2020-11-30 00:08:44,807 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-11-30 00:08:44,815 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-11-30 00:08:44,819 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-11-30 00:08:44,824 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-11-30 00:08:44,828 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-11-30 00:08:44,834 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-11-30 00:08:44,842 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-11-30 00:08:44,848 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-11-30 00:08:45,152 WARN L193 SmtUtils]: Spent 278.00 ms on a formula simplification. DAG size of input: 33 DAG size of output: 31 [2020-11-30 00:08:45,186 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-11-30 00:08:45,587 INFO L292 LassoAnalysis]: Preprocessing complete. [2020-11-30 00:08:45,593 INFO L489 LassoAnalysis]: Using template 'affine'. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_4e71fa68-d1ff-4e8c-8bed-4ff7652a5c28/bin/uautomizer/z3 Starting monitored process 2 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2020-11-30 00:08:45,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 [2020-11-30 00:08:45,609 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-11-30 00:08:45,609 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-11-30 00:08:45,610 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-11-30 00:08:45,610 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-11-30 00:08:45,610 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-11-30 00:08:45,614 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-11-30 00:08:45,615 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. Waiting until toolchain timeout for monitored process 2 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-11-30 00:08:45,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_4e71fa68-d1ff-4e8c-8bed-4ff7652a5c28/bin/uautomizer/z3 Starting monitored process 3 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2020-11-30 00:08:45,671 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-11-30 00:08:45,673 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-11-30 00:08:45,673 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-11-30 00:08:45,673 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-11-30 00:08:45,674 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-11-30 00:08:45,674 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-11-30 00:08:45,676 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-11-30 00:08:45,676 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. Waiting until toolchain timeout for monitored process 3 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-11-30 00:08:45,680 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_4e71fa68-d1ff-4e8c-8bed-4ff7652a5c28/bin/uautomizer/z3 Starting monitored process 4 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2020-11-30 00:08:45,733 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-11-30 00:08:45,736 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-11-30 00:08:45,736 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-11-30 00:08:45,736 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-11-30 00:08:45,736 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-11-30 00:08:45,743 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-11-30 00:08:45,747 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. Waiting until toolchain timeout for monitored process 4 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-11-30 00:08:45,754 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_4e71fa68-d1ff-4e8c-8bed-4ff7652a5c28/bin/uautomizer/z3 Starting monitored process 5 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-11-30 00:08:45,785 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-11-30 00:08:45,787 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-11-30 00:08:45,787 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-11-30 00:08:45,788 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-11-30 00:08:45,788 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-11-30 00:08:45,792 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-11-30 00:08:45,793 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-11-30 00:08:45,799 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_4e71fa68-d1ff-4e8c-8bed-4ff7652a5c28/bin/uautomizer/z3 Starting monitored process 6 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-11-30 00:08:45,837 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-11-30 00:08:45,839 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-11-30 00:08:45,839 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-11-30 00:08:45,839 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-11-30 00:08:45,840 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-11-30 00:08:45,840 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-11-30 00:08:45,841 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-11-30 00:08:45,841 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-11-30 00:08:45,854 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_4e71fa68-d1ff-4e8c-8bed-4ff7652a5c28/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) Waiting until toolchain timeout for monitored process 7 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-11-30 00:08:45,895 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-11-30 00:08:45,897 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-11-30 00:08:45,897 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-11-30 00:08:45,897 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-11-30 00:08:45,897 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-11-30 00:08:45,902 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-11-30 00:08:45,902 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-11-30 00:08:45,915 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_4e71fa68-d1ff-4e8c-8bed-4ff7652a5c28/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) Waiting until toolchain timeout for monitored process 8 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-11-30 00:08:45,945 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-11-30 00:08:45,947 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-11-30 00:08:45,947 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-11-30 00:08:45,947 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-11-30 00:08:45,947 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-11-30 00:08:45,953 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-11-30 00:08:45,953 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-11-30 00:08:45,978 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_4e71fa68-d1ff-4e8c-8bed-4ff7652a5c28/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) Waiting until toolchain timeout for monitored process 9 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-11-30 00:08:46,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 [2020-11-30 00:08:46,012 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-11-30 00:08:46,012 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-11-30 00:08:46,012 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-11-30 00:08:46,013 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-11-30 00:08:46,013 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-11-30 00:08:46,014 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-11-30 00:08:46,014 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-11-30 00:08:46,021 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_4e71fa68-d1ff-4e8c-8bed-4ff7652a5c28/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) [2020-11-30 00:08:46,081 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-11-30 00:08:46,084 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-11-30 00:08:46,084 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-11-30 00:08:46,084 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-11-30 00:08:46,084 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-11-30 00:08:46,100 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-11-30 00:08:46,101 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. Waiting until toolchain timeout for monitored process 10 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-11-30 00:08:46,119 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_4e71fa68-d1ff-4e8c-8bed-4ff7652a5c28/bin/uautomizer/z3 Starting monitored process 11 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 11 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-11-30 00:08:46,150 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-11-30 00:08:46,151 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-11-30 00:08:46,151 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-11-30 00:08:46,152 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-11-30 00:08:46,152 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-11-30 00:08:46,155 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-11-30 00:08:46,155 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-11-30 00:08:46,163 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_4e71fa68-d1ff-4e8c-8bed-4ff7652a5c28/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 [2020-11-30 00:08:46,198 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-11-30 00:08:46,199 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-11-30 00:08:46,199 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-11-30 00:08:46,200 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-11-30 00:08:46,200 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-11-30 00:08:46,206 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-11-30 00:08:46,206 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-11-30 00:08:46,217 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_4e71fa68-d1ff-4e8c-8bed-4ff7652a5c28/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) [2020-11-30 00:08:46,246 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-11-30 00:08:46,249 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-11-30 00:08:46,249 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-11-30 00:08:46,249 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-11-30 00:08:46,250 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-11-30 00:08:46,250 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-11-30 00:08:46,251 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-11-30 00:08:46,251 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-11-30 00:08:46,253 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. Waiting until toolchain timeout for monitored process 13 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_4e71fa68-d1ff-4e8c-8bed-4ff7652a5c28/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) Waiting until toolchain timeout for monitored process 14 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-11-30 00:08:46,288 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-11-30 00:08:46,291 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-11-30 00:08:46,292 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-11-30 00:08:46,292 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-11-30 00:08:46,292 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-11-30 00:08:46,305 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-11-30 00:08:46,305 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-11-30 00:08:46,327 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2020-11-30 00:08:46,388 INFO L443 ModelExtractionUtils]: Simplification made 9 calls to the SMT solver. [2020-11-30 00:08:46,388 INFO L444 ModelExtractionUtils]: 8 out of 22 variables were initially zero. Simplification set additionally 10 variables to zero. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_4e71fa68-d1ff-4e8c-8bed-4ff7652a5c28/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) [2020-11-30 00:08:46,432 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... Waiting until toolchain timeout for monitored process 15 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-11-30 00:08:46,436 INFO L438 nArgumentSynthesizer]: Removed 1 redundant supporting invariants from a total of 2. [2020-11-30 00:08:46,436 INFO L510 LassoAnalysis]: Proved termination. [2020-11-30 00:08:46,437 INFO L512 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~k~0, v_rep(select #length ULTIMATE.start_main_~numbers~0.base)_1) = -4*ULTIMATE.start_main_~k~0 + 1*v_rep(select #length ULTIMATE.start_main_~numbers~0.base)_1 Supporting invariants [1*ULTIMATE.start_main_~numbers~0.offset >= 0] [2020-11-30 00:08:46,505 INFO L297 tatePredicateManager]: 3 out of 4 supporting invariants were superfluous and have been removed [2020-11-30 00:08:46,515 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-11-30 00:08:46,556 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-30 00:08:46,581 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-30 00:08:46,583 INFO L263 TraceCheckSpWp]: Trace formula consists of 26 conjuncts, 4 conjunts are in the unsatisfiable core [2020-11-30 00:08:46,584 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-11-30 00:08:46,631 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-30 00:08:46,632 INFO L263 TraceCheckSpWp]: Trace formula consists of 11 conjuncts, 5 conjunts are in the unsatisfiable core [2020-11-30 00:08:46,633 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-11-30 00:08:46,746 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-30 00:08:46,763 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2020-11-30 00:08:46,765 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 16 states. Second operand 3 states. [2020-11-30 00:08:46,945 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 16 states.. Second operand 3 states. Result 38 states and 56 transitions. Complement of second has 7 states. [2020-11-30 00:08:46,947 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 5 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2020-11-30 00:08:46,948 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-11-30 00:08:46,949 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 37 transitions. [2020-11-30 00:08:46,950 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 37 transitions. Stem has 4 letters. Loop has 2 letters. [2020-11-30 00:08:46,950 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-11-30 00:08:46,950 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 37 transitions. Stem has 6 letters. Loop has 2 letters. [2020-11-30 00:08:46,951 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-11-30 00:08:46,951 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 37 transitions. Stem has 4 letters. Loop has 4 letters. [2020-11-30 00:08:46,951 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-11-30 00:08:46,952 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 38 states and 56 transitions. [2020-11-30 00:08:46,955 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2020-11-30 00:08:46,959 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 38 states to 13 states and 18 transitions. [2020-11-30 00:08:46,960 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 10 [2020-11-30 00:08:46,960 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 11 [2020-11-30 00:08:46,961 INFO L73 IsDeterministic]: Start isDeterministic. Operand 13 states and 18 transitions. [2020-11-30 00:08:46,961 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-11-30 00:08:46,961 INFO L691 BuchiCegarLoop]: Abstraction has 13 states and 18 transitions. [2020-11-30 00:08:46,976 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13 states and 18 transitions. [2020-11-30 00:08:46,985 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13 to 13. [2020-11-30 00:08:46,985 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2020-11-30 00:08:46,986 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 18 transitions. [2020-11-30 00:08:46,987 INFO L714 BuchiCegarLoop]: Abstraction has 13 states and 18 transitions. [2020-11-30 00:08:46,987 INFO L594 BuchiCegarLoop]: Abstraction has 13 states and 18 transitions. [2020-11-30 00:08:46,987 INFO L427 BuchiCegarLoop]: ======== Iteration 2============ [2020-11-30 00:08:46,988 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 13 states and 18 transitions. [2020-11-30 00:08:46,989 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2020-11-30 00:08:46,989 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-11-30 00:08:46,989 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-11-30 00:08:46,989 INFO L852 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1] [2020-11-30 00:08:46,989 INFO L853 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2020-11-30 00:08:46,990 INFO L794 eck$LassoCheckResult]: Stem: 122#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; 120#L-1 havoc main_#res;havoc main_#t~nondet8, main_#t~malloc9.base, main_#t~malloc9.offset, main_#t~nondet11, main_#t~post10, main_~k~0, main_~array_size~0, main_~numbers~0.base, main_~numbers~0.offset;main_~array_size~0 := main_#t~nondet8;havoc main_#t~nondet8; 121#L527 assume !(main_~array_size~0 < 1 || main_~array_size~0 >= 536870911); 123#L527-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_~k~0 := 0; 124#L532-3 assume !(main_~k~0 < main_~array_size~0); 132#L532-4 bubbleSort_#in~numbers.base, bubbleSort_#in~numbers.offset, bubbleSort_#in~array_size := main_~numbers~0.base, main_~numbers~0.offset, main_~array_size~0;havoc bubbleSort_#t~mem4, bubbleSort_#t~mem5, bubbleSort_#t~mem6, bubbleSort_#t~mem7, bubbleSort_#t~post3, bubbleSort_#t~post2, bubbleSort_~numbers.base, bubbleSort_~numbers.offset, bubbleSort_~array_size, bubbleSort_~i~0, bubbleSort_~j~0, bubbleSort_~temp~0;bubbleSort_~numbers.base, bubbleSort_~numbers.offset := bubbleSort_#in~numbers.base, bubbleSort_#in~numbers.offset;bubbleSort_~array_size := bubbleSort_#in~array_size;havoc bubbleSort_~i~0;havoc bubbleSort_~j~0;havoc bubbleSort_~temp~0;bubbleSort_~i~0 := bubbleSort_~array_size - 1; 131#L515-3 [2020-11-30 00:08:46,990 INFO L796 eck$LassoCheckResult]: Loop: 131#L515-3 assume !!(bubbleSort_~i~0 >= 0);bubbleSort_~j~0 := 1; 128#L516-3 assume !(bubbleSort_~j~0 <= bubbleSort_~i~0); 129#L515-2 bubbleSort_#t~post2 := bubbleSort_~i~0;bubbleSort_~i~0 := bubbleSort_#t~post2 - 1;havoc bubbleSort_#t~post2; 131#L515-3 [2020-11-30 00:08:46,990 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-30 00:08:46,991 INFO L82 PathProgramCache]: Analyzing trace with hash 889568397, now seen corresponding path program 1 times [2020-11-30 00:08:46,991 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-30 00:08:46,991 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [693256369] [2020-11-30 00:08:46,991 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-30 00:08:47,003 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-30 00:08:47,058 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-30 00:08:47,058 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [693256369] [2020-11-30 00:08:47,059 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-30 00:08:47,059 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-11-30 00:08:47,060 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [335148283] [2020-11-30 00:08:47,063 INFO L799 eck$LassoCheckResult]: stem already infeasible [2020-11-30 00:08:47,064 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-30 00:08:47,064 INFO L82 PathProgramCache]: Analyzing trace with hash 60779, now seen corresponding path program 1 times [2020-11-30 00:08:47,064 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-30 00:08:47,064 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [351581103] [2020-11-30 00:08:47,065 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-30 00:08:47,082 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-11-30 00:08:47,083 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-11-30 00:08:47,086 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-11-30 00:08:47,086 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-11-30 00:08:47,088 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-11-30 00:08:47,131 INFO L210 LassoAnalysis]: Preferences: [2020-11-30 00:08:47,131 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2020-11-30 00:08:47,131 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2020-11-30 00:08:47,131 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2020-11-30 00:08:47,132 INFO L129 ssoRankerPreferences]: Use exernal solver: true [2020-11-30 00:08:47,132 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-11-30 00:08:47,132 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2020-11-30 00:08:47,132 INFO L132 ssoRankerPreferences]: Path of dumped script: [2020-11-30 00:08:47,132 INFO L133 ssoRankerPreferences]: Filename of dumped script: bubblesort-alloca-2.i_Iteration2_Loop [2020-11-30 00:08:47,132 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2020-11-30 00:08:47,132 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2020-11-30 00:08:47,134 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-11-30 00:08:47,140 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-11-30 00:08:47,145 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-11-30 00:08:47,150 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-11-30 00:08:47,163 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-11-30 00:08:47,255 INFO L292 LassoAnalysis]: Preprocessing complete. [2020-11-30 00:08:47,256 INFO L404 LassoAnalysis]: Checking for nontermination... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_4e71fa68-d1ff-4e8c-8bed-4ff7652a5c28/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) [2020-11-30 00:08:47,268 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2020-11-30 00:08:47,268 INFO L160 nArgumentSynthesizer]: Using integer mode. Waiting until toolchain timeout for monitored process 16 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-11-30 00:08:47,281 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2020-11-30 00:08:47,281 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_bubbleSort_#t~post2=0} Honda state: {ULTIMATE.start_bubbleSort_#t~post2=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_4e71fa68-d1ff-4e8c-8bed-4ff7652a5c28/bin/uautomizer/z3 Starting monitored process 17 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2020-11-30 00:08:47,329 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2020-11-30 00:08:47,330 INFO L160 nArgumentSynthesizer]: Using integer mode. Waiting until toolchain timeout for monitored process 17 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-11-30 00:08:47,334 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2020-11-30 00:08:47,334 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {v_rep~unnamed0~0~P_PID_2=1} Honda state: {v_rep~unnamed0~0~P_PID_2=1} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_4e71fa68-d1ff-4e8c-8bed-4ff7652a5c28/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) [2020-11-30 00:08:47,383 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2020-11-30 00:08:47,383 INFO L160 nArgumentSynthesizer]: Using integer mode. Waiting until toolchain timeout for monitored process 18 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-11-30 00:08:47,388 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2020-11-30 00:08:47,389 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {v_rep~unnamed0~0~P_PGID_2=2} Honda state: {v_rep~unnamed0~0~P_PGID_2=2} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_4e71fa68-d1ff-4e8c-8bed-4ff7652a5c28/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) [2020-11-30 00:08:47,441 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2020-11-30 00:08:47,441 INFO L160 nArgumentSynthesizer]: Using integer mode. Waiting until toolchain timeout for monitored process 19 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_4e71fa68-d1ff-4e8c-8bed-4ff7652a5c28/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) [2020-11-30 00:08:47,505 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2020-11-30 00:08:47,505 INFO L160 nArgumentSynthesizer]: Using integer mode. Waiting until toolchain timeout for monitored process 20 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-11-30 00:08:47,550 INFO L444 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2020-11-30 00:08:47,552 INFO L210 LassoAnalysis]: Preferences: [2020-11-30 00:08:47,552 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2020-11-30 00:08:47,552 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2020-11-30 00:08:47,552 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2020-11-30 00:08:47,552 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2020-11-30 00:08:47,552 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-11-30 00:08:47,552 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2020-11-30 00:08:47,552 INFO L132 ssoRankerPreferences]: Path of dumped script: [2020-11-30 00:08:47,553 INFO L133 ssoRankerPreferences]: Filename of dumped script: bubblesort-alloca-2.i_Iteration2_Loop [2020-11-30 00:08:47,553 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2020-11-30 00:08:47,553 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2020-11-30 00:08:47,554 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-11-30 00:08:47,563 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-11-30 00:08:47,567 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-11-30 00:08:47,577 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-11-30 00:08:47,581 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-11-30 00:08:47,681 INFO L292 LassoAnalysis]: Preprocessing complete. [2020-11-30 00:08:47,681 INFO L489 LassoAnalysis]: Using template 'affine'. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_4e71fa68-d1ff-4e8c-8bed-4ff7652a5c28/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) [2020-11-30 00:08:47,701 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-11-30 00:08:47,703 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-11-30 00:08:47,703 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-11-30 00:08:47,703 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-11-30 00:08:47,703 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-11-30 00:08:47,703 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-11-30 00:08:47,704 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-11-30 00:08:47,704 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-11-30 00:08:47,709 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. Waiting until toolchain timeout for monitored process 21 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_4e71fa68-d1ff-4e8c-8bed-4ff7652a5c28/bin/uautomizer/z3 Starting monitored process 22 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 22 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-11-30 00:08:47,741 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-11-30 00:08:47,743 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-11-30 00:08:47,743 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-11-30 00:08:47,743 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-11-30 00:08:47,743 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-11-30 00:08:47,747 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-11-30 00:08:47,748 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-11-30 00:08:47,755 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_4e71fa68-d1ff-4e8c-8bed-4ff7652a5c28/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) [2020-11-30 00:08:47,804 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-11-30 00:08:47,807 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-11-30 00:08:47,807 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-11-30 00:08:47,808 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-11-30 00:08:47,808 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-11-30 00:08:47,808 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-11-30 00:08:47,811 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-11-30 00:08:47,811 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. Waiting until toolchain timeout for monitored process 23 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-11-30 00:08:47,822 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2020-11-30 00:08:47,827 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2020-11-30 00:08:47,827 INFO L444 ModelExtractionUtils]: 1 out of 4 variables were initially zero. Simplification set additionally 0 variables to zero. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_4e71fa68-d1ff-4e8c-8bed-4ff7652a5c28/bin/uautomizer/z3 Starting monitored process 24 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2020-11-30 00:08:47,832 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2020-11-30 00:08:47,832 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2020-11-30 00:08:47,832 INFO L510 LassoAnalysis]: Proved termination. [2020-11-30 00:08:47,833 INFO L512 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_bubbleSort_~i~0) = 2*ULTIMATE.start_bubbleSort_~i~0 + 1 Supporting invariants [] Waiting until toolchain timeout for monitored process 24 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-11-30 00:08:47,865 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2020-11-30 00:08:47,945 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-30 00:08:47,971 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-30 00:08:47,972 INFO L263 TraceCheckSpWp]: Trace formula consists of 41 conjuncts, 2 conjunts are in the unsatisfiable core [2020-11-30 00:08:47,973 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-11-30 00:08:47,981 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-30 00:08:47,982 WARN L261 TraceCheckSpWp]: Trace formula consists of 8 conjuncts, 4 conjunts are in the unsatisfiable core [2020-11-30 00:08:47,982 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-11-30 00:08:48,013 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-30 00:08:48,014 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2020-11-30 00:08:48,014 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 13 states and 18 transitions. cyclomatic complexity: 7 Second operand 3 states. [2020-11-30 00:08:48,046 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 13 states and 18 transitions. cyclomatic complexity: 7. Second operand 3 states. Result 19 states and 28 transitions. Complement of second has 4 states. [2020-11-30 00:08:48,049 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 3 states 1 stem states 1 non-accepting loop states 1 accepting loop states [2020-11-30 00:08:48,050 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-11-30 00:08:48,050 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 16 transitions. [2020-11-30 00:08:48,050 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 16 transitions. Stem has 6 letters. Loop has 3 letters. [2020-11-30 00:08:48,051 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-11-30 00:08:48,051 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 16 transitions. Stem has 9 letters. Loop has 3 letters. [2020-11-30 00:08:48,051 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-11-30 00:08:48,051 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 16 transitions. Stem has 6 letters. Loop has 6 letters. [2020-11-30 00:08:48,052 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-11-30 00:08:48,052 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 19 states and 28 transitions. [2020-11-30 00:08:48,053 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2020-11-30 00:08:48,054 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 19 states to 18 states and 26 transitions. [2020-11-30 00:08:48,054 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 10 [2020-11-30 00:08:48,054 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 11 [2020-11-30 00:08:48,054 INFO L73 IsDeterministic]: Start isDeterministic. Operand 18 states and 26 transitions. [2020-11-30 00:08:48,055 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2020-11-30 00:08:48,055 INFO L691 BuchiCegarLoop]: Abstraction has 18 states and 26 transitions. [2020-11-30 00:08:48,055 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18 states and 26 transitions. [2020-11-30 00:08:48,060 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18 to 17. [2020-11-30 00:08:48,061 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2020-11-30 00:08:48,062 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 25 transitions. [2020-11-30 00:08:48,063 INFO L714 BuchiCegarLoop]: Abstraction has 17 states and 25 transitions. [2020-11-30 00:08:48,063 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-30 00:08:48,066 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-11-30 00:08:48,069 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2020-11-30 00:08:48,070 INFO L87 Difference]: Start difference. First operand 17 states and 25 transitions. Second operand 4 states. [2020-11-30 00:08:48,109 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-30 00:08:48,109 INFO L93 Difference]: Finished difference Result 18 states and 25 transitions. [2020-11-30 00:08:48,111 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-11-30 00:08:48,111 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 18 states and 25 transitions. [2020-11-30 00:08:48,112 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2020-11-30 00:08:48,113 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 18 states to 18 states and 25 transitions. [2020-11-30 00:08:48,113 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 10 [2020-11-30 00:08:48,114 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 10 [2020-11-30 00:08:48,114 INFO L73 IsDeterministic]: Start isDeterministic. Operand 18 states and 25 transitions. [2020-11-30 00:08:48,114 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2020-11-30 00:08:48,114 INFO L691 BuchiCegarLoop]: Abstraction has 18 states and 25 transitions. [2020-11-30 00:08:48,114 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18 states and 25 transitions. [2020-11-30 00:08:48,115 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18 to 17. [2020-11-30 00:08:48,116 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2020-11-30 00:08:48,116 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 24 transitions. [2020-11-30 00:08:48,116 INFO L714 BuchiCegarLoop]: Abstraction has 17 states and 24 transitions. [2020-11-30 00:08:48,116 INFO L594 BuchiCegarLoop]: Abstraction has 17 states and 24 transitions. [2020-11-30 00:08:48,116 INFO L427 BuchiCegarLoop]: ======== Iteration 3============ [2020-11-30 00:08:48,116 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 17 states and 24 transitions. [2020-11-30 00:08:48,117 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2020-11-30 00:08:48,117 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-11-30 00:08:48,117 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-11-30 00:08:48,118 INFO L852 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-30 00:08:48,118 INFO L853 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2020-11-30 00:08:48,118 INFO L794 eck$LassoCheckResult]: Stem: 236#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; 234#L-1 havoc main_#res;havoc main_#t~nondet8, main_#t~malloc9.base, main_#t~malloc9.offset, main_#t~nondet11, main_#t~post10, main_~k~0, main_~array_size~0, main_~numbers~0.base, main_~numbers~0.offset;main_~array_size~0 := main_#t~nondet8;havoc main_#t~nondet8; 235#L527 assume !(main_~array_size~0 < 1 || main_~array_size~0 >= 536870911); 237#L527-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_~k~0 := 0; 238#L532-3 assume !!(main_~k~0 < main_~array_size~0);call write~int(main_#t~nondet11, main_~numbers~0.base, main_~numbers~0.offset + 4 * main_~k~0, 4);havoc main_#t~nondet11; 243#L532-2 main_#t~post10 := main_~k~0;main_~k~0 := 1 + main_#t~post10;havoc main_#t~post10; 244#L532-3 assume !(main_~k~0 < main_~array_size~0); 249#L532-4 bubbleSort_#in~numbers.base, bubbleSort_#in~numbers.offset, bubbleSort_#in~array_size := main_~numbers~0.base, main_~numbers~0.offset, main_~array_size~0;havoc bubbleSort_#t~mem4, bubbleSort_#t~mem5, bubbleSort_#t~mem6, bubbleSort_#t~mem7, bubbleSort_#t~post3, bubbleSort_#t~post2, bubbleSort_~numbers.base, bubbleSort_~numbers.offset, bubbleSort_~array_size, bubbleSort_~i~0, bubbleSort_~j~0, bubbleSort_~temp~0;bubbleSort_~numbers.base, bubbleSort_~numbers.offset := bubbleSort_#in~numbers.base, bubbleSort_#in~numbers.offset;bubbleSort_~array_size := bubbleSort_#in~array_size;havoc bubbleSort_~i~0;havoc bubbleSort_~j~0;havoc bubbleSort_~temp~0;bubbleSort_~i~0 := bubbleSort_~array_size - 1; 250#L515-3 assume !!(bubbleSort_~i~0 >= 0);bubbleSort_~j~0 := 1; 240#L516-3 [2020-11-30 00:08:48,119 INFO L796 eck$LassoCheckResult]: Loop: 240#L516-3 assume !!(bubbleSort_~j~0 <= bubbleSort_~i~0);call bubbleSort_#t~mem4 := read~int(bubbleSort_~numbers.base, bubbleSort_~numbers.offset + 4 * (bubbleSort_~j~0 - 1), 4);call bubbleSort_#t~mem5 := read~int(bubbleSort_~numbers.base, bubbleSort_~numbers.offset + 4 * bubbleSort_~j~0, 4); 245#L517 assume bubbleSort_#t~mem4 > bubbleSort_#t~mem5;havoc bubbleSort_#t~mem4;havoc bubbleSort_#t~mem5;call bubbleSort_#t~mem6 := read~int(bubbleSort_~numbers.base, bubbleSort_~numbers.offset + 4 * (bubbleSort_~j~0 - 1), 4);bubbleSort_~temp~0 := bubbleSort_#t~mem6;havoc bubbleSort_#t~mem6;call bubbleSort_#t~mem7 := read~int(bubbleSort_~numbers.base, bubbleSort_~numbers.offset + 4 * bubbleSort_~j~0, 4);call write~int(bubbleSort_#t~mem7, bubbleSort_~numbers.base, bubbleSort_~numbers.offset + 4 * (bubbleSort_~j~0 - 1), 4);havoc bubbleSort_#t~mem7;call write~int(bubbleSort_~temp~0, bubbleSort_~numbers.base, bubbleSort_~numbers.offset + 4 * bubbleSort_~j~0, 4); 239#L516-2 bubbleSort_#t~post3 := bubbleSort_~j~0;bubbleSort_~j~0 := 1 + bubbleSort_#t~post3;havoc bubbleSort_#t~post3; 240#L516-3 [2020-11-30 00:08:48,119 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-30 00:08:48,122 INFO L82 PathProgramCache]: Analyzing trace with hash 1185641744, now seen corresponding path program 1 times [2020-11-30 00:08:48,122 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-30 00:08:48,123 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1079687784] [2020-11-30 00:08:48,123 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-30 00:08:48,141 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-11-30 00:08:48,142 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-11-30 00:08:48,178 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-11-30 00:08:48,178 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-11-30 00:08:48,189 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-11-30 00:08:48,190 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-30 00:08:48,190 INFO L82 PathProgramCache]: Analyzing trace with hash 68618, now seen corresponding path program 1 times [2020-11-30 00:08:48,190 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-30 00:08:48,190 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [450357378] [2020-11-30 00:08:48,191 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-30 00:08:48,205 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-11-30 00:08:48,206 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-11-30 00:08:48,219 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-11-30 00:08:48,219 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-11-30 00:08:48,225 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-11-30 00:08:48,226 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-30 00:08:48,226 INFO L82 PathProgramCache]: Analyzing trace with hash -357807973, now seen corresponding path program 1 times [2020-11-30 00:08:48,226 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-30 00:08:48,227 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [187557948] [2020-11-30 00:08:48,229 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-30 00:08:48,258 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-30 00:08:48,335 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-30 00:08:48,336 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [187557948] [2020-11-30 00:08:48,336 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [386729674] [2020-11-30 00:08:48,336 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_4e71fa68-d1ff-4e8c-8bed-4ff7652a5c28/bin/uautomizer/z3 Starting monitored process 25 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 25 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-11-30 00:08:48,390 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-30 00:08:48,391 INFO L263 TraceCheckSpWp]: Trace formula consists of 75 conjuncts, 8 conjunts are in the unsatisfiable core [2020-11-30 00:08:48,392 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-11-30 00:08:48,488 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-30 00:08:48,488 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-11-30 00:08:48,489 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 9 [2020-11-30 00:08:48,489 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [270814255] [2020-11-30 00:08:48,629 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-30 00:08:48,630 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-11-30 00:08:48,630 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2020-11-30 00:08:48,630 INFO L87 Difference]: Start difference. First operand 17 states and 24 transitions. cyclomatic complexity: 10 Second operand 9 states. [2020-11-30 00:08:48,839 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-30 00:08:48,839 INFO L93 Difference]: Finished difference Result 31 states and 41 transitions. [2020-11-30 00:08:48,839 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-11-30 00:08:48,840 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 31 states and 41 transitions. [2020-11-30 00:08:48,841 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2020-11-30 00:08:48,842 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 31 states to 20 states and 26 transitions. [2020-11-30 00:08:48,842 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 10 [2020-11-30 00:08:48,843 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 10 [2020-11-30 00:08:48,843 INFO L73 IsDeterministic]: Start isDeterministic. Operand 20 states and 26 transitions. [2020-11-30 00:08:48,843 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2020-11-30 00:08:48,843 INFO L691 BuchiCegarLoop]: Abstraction has 20 states and 26 transitions. [2020-11-30 00:08:48,843 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20 states and 26 transitions. [2020-11-30 00:08:48,845 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20 to 19. [2020-11-30 00:08:48,845 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2020-11-30 00:08:48,845 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 25 transitions. [2020-11-30 00:08:48,846 INFO L714 BuchiCegarLoop]: Abstraction has 19 states and 25 transitions. [2020-11-30 00:08:48,846 INFO L594 BuchiCegarLoop]: Abstraction has 19 states and 25 transitions. [2020-11-30 00:08:48,846 INFO L427 BuchiCegarLoop]: ======== Iteration 4============ [2020-11-30 00:08:48,846 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 19 states and 25 transitions. [2020-11-30 00:08:48,847 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2020-11-30 00:08:48,847 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-11-30 00:08:48,850 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-11-30 00:08:48,850 INFO L852 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 1, 1, 1, 1, 1, 1, 1] [2020-11-30 00:08:48,851 INFO L853 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2020-11-30 00:08:48,851 INFO L794 eck$LassoCheckResult]: Stem: 341#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; 339#L-1 havoc main_#res;havoc main_#t~nondet8, main_#t~malloc9.base, main_#t~malloc9.offset, main_#t~nondet11, main_#t~post10, main_~k~0, main_~array_size~0, main_~numbers~0.base, main_~numbers~0.offset;main_~array_size~0 := main_#t~nondet8;havoc main_#t~nondet8; 340#L527 assume !(main_~array_size~0 < 1 || main_~array_size~0 >= 536870911); 342#L527-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_~k~0 := 0; 343#L532-3 assume !!(main_~k~0 < main_~array_size~0);call write~int(main_#t~nondet11, main_~numbers~0.base, main_~numbers~0.offset + 4 * main_~k~0, 4);havoc main_#t~nondet11; 344#L532-2 main_#t~post10 := main_~k~0;main_~k~0 := 1 + main_#t~post10;havoc main_#t~post10; 345#L532-3 assume !!(main_~k~0 < main_~array_size~0);call write~int(main_#t~nondet11, main_~numbers~0.base, main_~numbers~0.offset + 4 * main_~k~0, 4);havoc main_#t~nondet11; 350#L532-2 main_#t~post10 := main_~k~0;main_~k~0 := 1 + main_#t~post10;havoc main_#t~post10; 357#L532-3 assume !(main_~k~0 < main_~array_size~0); 355#L532-4 bubbleSort_#in~numbers.base, bubbleSort_#in~numbers.offset, bubbleSort_#in~array_size := main_~numbers~0.base, main_~numbers~0.offset, main_~array_size~0;havoc bubbleSort_#t~mem4, bubbleSort_#t~mem5, bubbleSort_#t~mem6, bubbleSort_#t~mem7, bubbleSort_#t~post3, bubbleSort_#t~post2, bubbleSort_~numbers.base, bubbleSort_~numbers.offset, bubbleSort_~array_size, bubbleSort_~i~0, bubbleSort_~j~0, bubbleSort_~temp~0;bubbleSort_~numbers.base, bubbleSort_~numbers.offset := bubbleSort_#in~numbers.base, bubbleSort_#in~numbers.offset;bubbleSort_~array_size := bubbleSort_#in~array_size;havoc bubbleSort_~i~0;havoc bubbleSort_~j~0;havoc bubbleSort_~temp~0;bubbleSort_~i~0 := bubbleSort_~array_size - 1; 356#L515-3 assume !!(bubbleSort_~i~0 >= 0);bubbleSort_~j~0 := 1; 347#L516-3 [2020-11-30 00:08:48,851 INFO L796 eck$LassoCheckResult]: Loop: 347#L516-3 assume !!(bubbleSort_~j~0 <= bubbleSort_~i~0);call bubbleSort_#t~mem4 := read~int(bubbleSort_~numbers.base, bubbleSort_~numbers.offset + 4 * (bubbleSort_~j~0 - 1), 4);call bubbleSort_#t~mem5 := read~int(bubbleSort_~numbers.base, bubbleSort_~numbers.offset + 4 * bubbleSort_~j~0, 4); 351#L517 assume bubbleSort_#t~mem4 > bubbleSort_#t~mem5;havoc bubbleSort_#t~mem4;havoc bubbleSort_#t~mem5;call bubbleSort_#t~mem6 := read~int(bubbleSort_~numbers.base, bubbleSort_~numbers.offset + 4 * (bubbleSort_~j~0 - 1), 4);bubbleSort_~temp~0 := bubbleSort_#t~mem6;havoc bubbleSort_#t~mem6;call bubbleSort_#t~mem7 := read~int(bubbleSort_~numbers.base, bubbleSort_~numbers.offset + 4 * bubbleSort_~j~0, 4);call write~int(bubbleSort_#t~mem7, bubbleSort_~numbers.base, bubbleSort_~numbers.offset + 4 * (bubbleSort_~j~0 - 1), 4);havoc bubbleSort_#t~mem7;call write~int(bubbleSort_~temp~0, bubbleSort_~numbers.base, bubbleSort_~numbers.offset + 4 * bubbleSort_~j~0, 4); 346#L516-2 bubbleSort_#t~post3 := bubbleSort_~j~0;bubbleSort_~j~0 := 1 + bubbleSort_#t~post3;havoc bubbleSort_#t~post3; 347#L516-3 [2020-11-30 00:08:48,851 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-30 00:08:48,852 INFO L82 PathProgramCache]: Analyzing trace with hash 1237095790, now seen corresponding path program 2 times [2020-11-30 00:08:48,852 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-30 00:08:48,852 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [645976305] [2020-11-30 00:08:48,852 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-30 00:08:48,878 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-11-30 00:08:48,879 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-11-30 00:08:48,912 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-11-30 00:08:48,913 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-11-30 00:08:48,917 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-11-30 00:08:48,918 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-30 00:08:48,918 INFO L82 PathProgramCache]: Analyzing trace with hash 68618, now seen corresponding path program 2 times [2020-11-30 00:08:48,918 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-30 00:08:48,918 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [248158647] [2020-11-30 00:08:48,919 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-30 00:08:48,945 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-11-30 00:08:48,945 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-11-30 00:08:48,959 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-11-30 00:08:48,959 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-11-30 00:08:48,961 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-11-30 00:08:48,962 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-30 00:08:48,962 INFO L82 PathProgramCache]: Analyzing trace with hash -793648259, now seen corresponding path program 2 times [2020-11-30 00:08:48,962 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-30 00:08:48,962 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [974124693] [2020-11-30 00:08:48,962 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-30 00:08:49,000 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-11-30 00:08:49,000 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-11-30 00:08:49,027 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-11-30 00:08:49,027 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-11-30 00:08:49,037 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-11-30 00:08:49,498 WARN L193 SmtUtils]: Spent 343.00 ms on a formula simplification. DAG size of input: 103 DAG size of output: 81 [2020-11-30 00:08:49,611 INFO L210 LassoAnalysis]: Preferences: [2020-11-30 00:08:49,612 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2020-11-30 00:08:49,612 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2020-11-30 00:08:49,612 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2020-11-30 00:08:49,612 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2020-11-30 00:08:49,612 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-11-30 00:08:49,612 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2020-11-30 00:08:49,612 INFO L132 ssoRankerPreferences]: Path of dumped script: [2020-11-30 00:08:49,612 INFO L133 ssoRankerPreferences]: Filename of dumped script: bubblesort-alloca-2.i_Iteration4_Lasso [2020-11-30 00:08:49,612 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2020-11-30 00:08:49,612 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2020-11-30 00:08:49,616 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-11-30 00:08:49,623 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-11-30 00:08:49,627 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-11-30 00:08:49,630 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-11-30 00:08:49,635 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-11-30 00:08:49,638 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-11-30 00:08:49,641 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-11-30 00:08:49,645 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-11-30 00:08:49,821 WARN L193 SmtUtils]: Spent 143.00 ms on a formula simplification. DAG size of input: 52 DAG size of output: 49 [2020-11-30 00:08:49,882 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-11-30 00:08:49,886 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-11-30 00:08:49,890 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-11-30 00:08:49,893 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-11-30 00:08:49,901 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-11-30 00:08:49,904 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-11-30 00:08:49,906 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-11-30 00:08:49,909 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-11-30 00:08:50,301 INFO L292 LassoAnalysis]: Preprocessing complete. [2020-11-30 00:08:50,301 INFO L489 LassoAnalysis]: Using template 'affine'. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_4e71fa68-d1ff-4e8c-8bed-4ff7652a5c28/bin/uautomizer/z3 Starting monitored process 26 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 26 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-11-30 00:08:50,309 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-11-30 00:08:50,310 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-11-30 00:08:50,311 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-11-30 00:08:50,311 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-11-30 00:08:50,311 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-11-30 00:08:50,311 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-11-30 00:08:50,312 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-11-30 00:08:50,312 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-11-30 00:08:50,313 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_4e71fa68-d1ff-4e8c-8bed-4ff7652a5c28/bin/uautomizer/z3 Starting monitored process 27 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 27 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-11-30 00:08:50,335 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-11-30 00:08:50,336 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-11-30 00:08:50,336 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-11-30 00:08:50,337 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-11-30 00:08:50,337 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-11-30 00:08:50,339 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-11-30 00:08:50,339 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-11-30 00:08:50,341 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_4e71fa68-d1ff-4e8c-8bed-4ff7652a5c28/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) [2020-11-30 00:08:50,388 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-11-30 00:08:50,390 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-11-30 00:08:50,390 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-11-30 00:08:50,390 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-11-30 00:08:50,390 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-11-30 00:08:50,391 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-11-30 00:08:50,391 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-11-30 00:08:50,391 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. Waiting until toolchain timeout for monitored process 28 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-11-30 00:08:50,393 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_4e71fa68-d1ff-4e8c-8bed-4ff7652a5c28/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 [2020-11-30 00:08:50,417 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-11-30 00:08:50,419 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-11-30 00:08:50,419 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-11-30 00:08:50,419 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-11-30 00:08:50,419 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-11-30 00:08:50,420 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-11-30 00:08:50,420 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-11-30 00:08:50,438 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_4e71fa68-d1ff-4e8c-8bed-4ff7652a5c28/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) [2020-11-30 00:08:50,485 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 30 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-11-30 00:08:50,487 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-11-30 00:08:50,487 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-11-30 00:08:50,487 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-11-30 00:08:50,487 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-11-30 00:08:50,487 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-11-30 00:08:50,488 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-11-30 00:08:50,488 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-11-30 00:08:50,489 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_4e71fa68-d1ff-4e8c-8bed-4ff7652a5c28/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 [2020-11-30 00:08:50,511 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-11-30 00:08:50,512 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-11-30 00:08:50,513 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-11-30 00:08:50,513 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-11-30 00:08:50,513 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-11-30 00:08:50,513 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-11-30 00:08:50,513 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-11-30 00:08:50,513 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-11-30 00:08:50,515 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_4e71fa68-d1ff-4e8c-8bed-4ff7652a5c28/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 [2020-11-30 00:08:50,537 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-11-30 00:08:50,539 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-11-30 00:08:50,539 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-11-30 00:08:50,539 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-11-30 00:08:50,539 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-11-30 00:08:50,541 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-11-30 00:08:50,541 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-11-30 00:08:50,546 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_4e71fa68-d1ff-4e8c-8bed-4ff7652a5c28/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 [2020-11-30 00:08:50,569 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-11-30 00:08:50,571 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-11-30 00:08:50,571 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-11-30 00:08:50,571 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-11-30 00:08:50,571 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-11-30 00:08:50,580 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-11-30 00:08:50,580 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-11-30 00:08:50,599 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2020-11-30 00:08:50,622 INFO L443 ModelExtractionUtils]: Simplification made 7 calls to the SMT solver. [2020-11-30 00:08:50,622 INFO L444 ModelExtractionUtils]: 10 out of 40 variables were initially zero. Simplification set additionally 26 variables to zero. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_4e71fa68-d1ff-4e8c-8bed-4ff7652a5c28/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 [2020-11-30 00:08:50,624 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2020-11-30 00:08:50,626 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2020-11-30 00:08:50,627 INFO L510 LassoAnalysis]: Proved termination. [2020-11-30 00:08:50,627 INFO L512 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_bubbleSort_~i~0, ULTIMATE.start_bubbleSort_~j~0) = 2*ULTIMATE.start_bubbleSort_~i~0 - 2*ULTIMATE.start_bubbleSort_~j~0 + 1 Supporting invariants [] [2020-11-30 00:08:50,667 INFO L297 tatePredicateManager]: 4 out of 4 supporting invariants were superfluous and have been removed [2020-11-30 00:08:50,683 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-30 00:08:50,702 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-30 00:08:50,703 INFO L263 TraceCheckSpWp]: Trace formula consists of 60 conjuncts, 2 conjunts are in the unsatisfiable core [2020-11-30 00:08:50,704 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-11-30 00:08:50,724 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-30 00:08:50,725 INFO L263 TraceCheckSpWp]: Trace formula consists of 25 conjuncts, 4 conjunts are in the unsatisfiable core [2020-11-30 00:08:50,725 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-11-30 00:08:50,757 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-30 00:08:50,757 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2020-11-30 00:08:50,758 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 19 states and 25 transitions. cyclomatic complexity: 9 Second operand 3 states. [2020-11-30 00:08:50,803 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 19 states and 25 transitions. cyclomatic complexity: 9. Second operand 3 states. Result 34 states and 47 transitions. Complement of second has 7 states. [2020-11-30 00:08:50,805 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2020-11-30 00:08:50,805 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-11-30 00:08:50,805 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 15 transitions. [2020-11-30 00:08:50,805 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 15 transitions. Stem has 11 letters. Loop has 3 letters. [2020-11-30 00:08:50,806 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-11-30 00:08:50,806 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 15 transitions. Stem has 14 letters. Loop has 3 letters. [2020-11-30 00:08:50,806 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-11-30 00:08:50,806 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 15 transitions. Stem has 11 letters. Loop has 6 letters. [2020-11-30 00:08:50,806 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-11-30 00:08:50,806 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 34 states and 47 transitions. [2020-11-30 00:08:50,808 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2020-11-30 00:08:50,809 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 34 states to 24 states and 32 transitions. [2020-11-30 00:08:50,809 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 10 [2020-11-30 00:08:50,809 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 10 [2020-11-30 00:08:50,809 INFO L73 IsDeterministic]: Start isDeterministic. Operand 24 states and 32 transitions. [2020-11-30 00:08:50,809 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2020-11-30 00:08:50,809 INFO L691 BuchiCegarLoop]: Abstraction has 24 states and 32 transitions. [2020-11-30 00:08:50,809 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states and 32 transitions. [2020-11-30 00:08:50,811 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 19. [2020-11-30 00:08:50,811 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2020-11-30 00:08:50,811 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 24 transitions. [2020-11-30 00:08:50,811 INFO L714 BuchiCegarLoop]: Abstraction has 19 states and 24 transitions. [2020-11-30 00:08:50,811 INFO L594 BuchiCegarLoop]: Abstraction has 19 states and 24 transitions. [2020-11-30 00:08:50,812 INFO L427 BuchiCegarLoop]: ======== Iteration 5============ [2020-11-30 00:08:50,812 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 19 states and 24 transitions. [2020-11-30 00:08:50,817 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2020-11-30 00:08:50,818 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-11-30 00:08:50,818 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-11-30 00:08:50,818 INFO L852 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-30 00:08:50,819 INFO L853 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2020-11-30 00:08:50,819 INFO L794 eck$LassoCheckResult]: Stem: 476#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; 474#L-1 havoc main_#res;havoc main_#t~nondet8, main_#t~malloc9.base, main_#t~malloc9.offset, main_#t~nondet11, main_#t~post10, main_~k~0, main_~array_size~0, main_~numbers~0.base, main_~numbers~0.offset;main_~array_size~0 := main_#t~nondet8;havoc main_#t~nondet8; 475#L527 assume !(main_~array_size~0 < 1 || main_~array_size~0 >= 536870911); 477#L527-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_~k~0 := 0; 478#L532-3 assume !!(main_~k~0 < main_~array_size~0);call write~int(main_#t~nondet11, main_~numbers~0.base, main_~numbers~0.offset + 4 * main_~k~0, 4);havoc main_#t~nondet11; 483#L532-2 main_#t~post10 := main_~k~0;main_~k~0 := 1 + main_#t~post10;havoc main_#t~post10; 484#L532-3 assume !!(main_~k~0 < main_~array_size~0);call write~int(main_#t~nondet11, main_~numbers~0.base, main_~numbers~0.offset + 4 * main_~k~0, 4);havoc main_#t~nondet11; 487#L532-2 main_#t~post10 := main_~k~0;main_~k~0 := 1 + main_#t~post10;havoc main_#t~post10; 492#L532-3 assume !(main_~k~0 < main_~array_size~0); 491#L532-4 bubbleSort_#in~numbers.base, bubbleSort_#in~numbers.offset, bubbleSort_#in~array_size := main_~numbers~0.base, main_~numbers~0.offset, main_~array_size~0;havoc bubbleSort_#t~mem4, bubbleSort_#t~mem5, bubbleSort_#t~mem6, bubbleSort_#t~mem7, bubbleSort_#t~post3, bubbleSort_#t~post2, bubbleSort_~numbers.base, bubbleSort_~numbers.offset, bubbleSort_~array_size, bubbleSort_~i~0, bubbleSort_~j~0, bubbleSort_~temp~0;bubbleSort_~numbers.base, bubbleSort_~numbers.offset := bubbleSort_#in~numbers.base, bubbleSort_#in~numbers.offset;bubbleSort_~array_size := bubbleSort_#in~array_size;havoc bubbleSort_~i~0;havoc bubbleSort_~j~0;havoc bubbleSort_~temp~0;bubbleSort_~i~0 := bubbleSort_~array_size - 1; 490#L515-3 assume !!(bubbleSort_~i~0 >= 0);bubbleSort_~j~0 := 1; 482#L516-3 assume !(bubbleSort_~j~0 <= bubbleSort_~i~0); 485#L515-2 bubbleSort_#t~post2 := bubbleSort_~i~0;bubbleSort_~i~0 := bubbleSort_#t~post2 - 1;havoc bubbleSort_#t~post2; 486#L515-3 assume !!(bubbleSort_~i~0 >= 0);bubbleSort_~j~0 := 1; 480#L516-3 [2020-11-30 00:08:50,819 INFO L796 eck$LassoCheckResult]: Loop: 480#L516-3 assume !!(bubbleSort_~j~0 <= bubbleSort_~i~0);call bubbleSort_#t~mem4 := read~int(bubbleSort_~numbers.base, bubbleSort_~numbers.offset + 4 * (bubbleSort_~j~0 - 1), 4);call bubbleSort_#t~mem5 := read~int(bubbleSort_~numbers.base, bubbleSort_~numbers.offset + 4 * bubbleSort_~j~0, 4); 488#L517 assume bubbleSort_#t~mem4 > bubbleSort_#t~mem5;havoc bubbleSort_#t~mem4;havoc bubbleSort_#t~mem5;call bubbleSort_#t~mem6 := read~int(bubbleSort_~numbers.base, bubbleSort_~numbers.offset + 4 * (bubbleSort_~j~0 - 1), 4);bubbleSort_~temp~0 := bubbleSort_#t~mem6;havoc bubbleSort_#t~mem6;call bubbleSort_#t~mem7 := read~int(bubbleSort_~numbers.base, bubbleSort_~numbers.offset + 4 * bubbleSort_~j~0, 4);call write~int(bubbleSort_#t~mem7, bubbleSort_~numbers.base, bubbleSort_~numbers.offset + 4 * (bubbleSort_~j~0 - 1), 4);havoc bubbleSort_#t~mem7;call write~int(bubbleSort_~temp~0, bubbleSort_~numbers.base, bubbleSort_~numbers.offset + 4 * bubbleSort_~j~0, 4); 479#L516-2 bubbleSort_#t~post3 := bubbleSort_~j~0;bubbleSort_~j~0 := 1 + bubbleSort_#t~post3;havoc bubbleSort_#t~post3; 480#L516-3 [2020-11-30 00:08:50,820 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-30 00:08:50,820 INFO L82 PathProgramCache]: Analyzing trace with hash -793649948, now seen corresponding path program 1 times [2020-11-30 00:08:50,820 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-30 00:08:50,820 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1298638973] [2020-11-30 00:08:50,820 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-30 00:08:50,837 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-30 00:08:50,902 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 1 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-30 00:08:50,902 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1298638973] [2020-11-30 00:08:50,902 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1322589146] [2020-11-30 00:08:50,902 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_4e71fa68-d1ff-4e8c-8bed-4ff7652a5c28/bin/uautomizer/z3 Starting monitored process 35 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 35 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-11-30 00:08:50,947 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-30 00:08:50,948 INFO L263 TraceCheckSpWp]: Trace formula consists of 66 conjuncts, 8 conjunts are in the unsatisfiable core [2020-11-30 00:08:50,949 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-11-30 00:08:51,055 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 2 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-30 00:08:51,055 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-11-30 00:08:51,056 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 9 [2020-11-30 00:08:51,056 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [884573792] [2020-11-30 00:08:51,056 INFO L799 eck$LassoCheckResult]: stem already infeasible [2020-11-30 00:08:51,056 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-30 00:08:51,057 INFO L82 PathProgramCache]: Analyzing trace with hash 68618, now seen corresponding path program 3 times [2020-11-30 00:08:51,057 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-30 00:08:51,057 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [47813940] [2020-11-30 00:08:51,057 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-30 00:08:51,061 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-11-30 00:08:51,061 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-11-30 00:08:51,065 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-11-30 00:08:51,066 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-11-30 00:08:51,068 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-11-30 00:08:51,144 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-30 00:08:51,145 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-11-30 00:08:51,145 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2020-11-30 00:08:51,145 INFO L87 Difference]: Start difference. First operand 19 states and 24 transitions. cyclomatic complexity: 8 Second operand 9 states. [2020-11-30 00:08:51,247 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-30 00:08:51,247 INFO L93 Difference]: Finished difference Result 26 states and 34 transitions. [2020-11-30 00:08:51,248 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-11-30 00:08:51,248 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 26 states and 34 transitions. [2020-11-30 00:08:51,249 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2020-11-30 00:08:51,250 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 26 states to 26 states and 34 transitions. [2020-11-30 00:08:51,250 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 10 [2020-11-30 00:08:51,250 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 10 [2020-11-30 00:08:51,250 INFO L73 IsDeterministic]: Start isDeterministic. Operand 26 states and 34 transitions. [2020-11-30 00:08:51,250 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2020-11-30 00:08:51,250 INFO L691 BuchiCegarLoop]: Abstraction has 26 states and 34 transitions. [2020-11-30 00:08:51,251 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states and 34 transitions. [2020-11-30 00:08:51,252 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 20. [2020-11-30 00:08:51,252 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2020-11-30 00:08:51,253 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 25 transitions. [2020-11-30 00:08:51,253 INFO L714 BuchiCegarLoop]: Abstraction has 20 states and 25 transitions. [2020-11-30 00:08:51,253 INFO L594 BuchiCegarLoop]: Abstraction has 20 states and 25 transitions. [2020-11-30 00:08:51,253 INFO L427 BuchiCegarLoop]: ======== Iteration 6============ [2020-11-30 00:08:51,253 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 20 states and 25 transitions. [2020-11-30 00:08:51,254 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2020-11-30 00:08:51,254 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-11-30 00:08:51,254 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-11-30 00:08:51,255 INFO L852 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-30 00:08:51,255 INFO L853 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2020-11-30 00:08:51,255 INFO L794 eck$LassoCheckResult]: Stem: 578#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; 576#L-1 havoc main_#res;havoc main_#t~nondet8, main_#t~malloc9.base, main_#t~malloc9.offset, main_#t~nondet11, main_#t~post10, main_~k~0, main_~array_size~0, main_~numbers~0.base, main_~numbers~0.offset;main_~array_size~0 := main_#t~nondet8;havoc main_#t~nondet8; 577#L527 assume !(main_~array_size~0 < 1 || main_~array_size~0 >= 536870911); 579#L527-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_~k~0 := 0; 580#L532-3 assume !!(main_~k~0 < main_~array_size~0);call write~int(main_#t~nondet11, main_~numbers~0.base, main_~numbers~0.offset + 4 * main_~k~0, 4);havoc main_#t~nondet11; 587#L532-2 main_#t~post10 := main_~k~0;main_~k~0 := 1 + main_#t~post10;havoc main_#t~post10; 588#L532-3 assume !!(main_~k~0 < main_~array_size~0);call write~int(main_#t~nondet11, main_~numbers~0.base, main_~numbers~0.offset + 4 * main_~k~0, 4);havoc main_#t~nondet11; 581#L532-2 main_#t~post10 := main_~k~0;main_~k~0 := 1 + main_#t~post10;havoc main_#t~post10; 582#L532-3 assume !(main_~k~0 < main_~array_size~0); 594#L532-4 bubbleSort_#in~numbers.base, bubbleSort_#in~numbers.offset, bubbleSort_#in~array_size := main_~numbers~0.base, main_~numbers~0.offset, main_~array_size~0;havoc bubbleSort_#t~mem4, bubbleSort_#t~mem5, bubbleSort_#t~mem6, bubbleSort_#t~mem7, bubbleSort_#t~post3, bubbleSort_#t~post2, bubbleSort_~numbers.base, bubbleSort_~numbers.offset, bubbleSort_~array_size, bubbleSort_~i~0, bubbleSort_~j~0, bubbleSort_~temp~0;bubbleSort_~numbers.base, bubbleSort_~numbers.offset := bubbleSort_#in~numbers.base, bubbleSort_#in~numbers.offset;bubbleSort_~array_size := bubbleSort_#in~array_size;havoc bubbleSort_~i~0;havoc bubbleSort_~j~0;havoc bubbleSort_~temp~0;bubbleSort_~i~0 := bubbleSort_~array_size - 1; 595#L515-3 assume !!(bubbleSort_~i~0 >= 0);bubbleSort_~j~0 := 1; 590#L516-3 assume !!(bubbleSort_~j~0 <= bubbleSort_~i~0);call bubbleSort_#t~mem4 := read~int(bubbleSort_~numbers.base, bubbleSort_~numbers.offset + 4 * (bubbleSort_~j~0 - 1), 4);call bubbleSort_#t~mem5 := read~int(bubbleSort_~numbers.base, bubbleSort_~numbers.offset + 4 * bubbleSort_~j~0, 4); 591#L517 assume !(bubbleSort_#t~mem4 > bubbleSort_#t~mem5);havoc bubbleSort_#t~mem4;havoc bubbleSort_#t~mem5; 585#L516-2 bubbleSort_#t~post3 := bubbleSort_~j~0;bubbleSort_~j~0 := 1 + bubbleSort_#t~post3;havoc bubbleSort_#t~post3; 586#L516-3 assume !(bubbleSort_~j~0 <= bubbleSort_~i~0); 592#L515-2 bubbleSort_#t~post2 := bubbleSort_~i~0;bubbleSort_~i~0 := bubbleSort_#t~post2 - 1;havoc bubbleSort_#t~post2; 593#L515-3 assume !!(bubbleSort_~i~0 >= 0);bubbleSort_~j~0 := 1; 584#L516-3 [2020-11-30 00:08:51,255 INFO L796 eck$LassoCheckResult]: Loop: 584#L516-3 assume !!(bubbleSort_~j~0 <= bubbleSort_~i~0);call bubbleSort_#t~mem4 := read~int(bubbleSort_~numbers.base, bubbleSort_~numbers.offset + 4 * (bubbleSort_~j~0 - 1), 4);call bubbleSort_#t~mem5 := read~int(bubbleSort_~numbers.base, bubbleSort_~numbers.offset + 4 * bubbleSort_~j~0, 4); 589#L517 assume bubbleSort_#t~mem4 > bubbleSort_#t~mem5;havoc bubbleSort_#t~mem4;havoc bubbleSort_#t~mem5;call bubbleSort_#t~mem6 := read~int(bubbleSort_~numbers.base, bubbleSort_~numbers.offset + 4 * (bubbleSort_~j~0 - 1), 4);bubbleSort_~temp~0 := bubbleSort_#t~mem6;havoc bubbleSort_#t~mem6;call bubbleSort_#t~mem7 := read~int(bubbleSort_~numbers.base, bubbleSort_~numbers.offset + 4 * bubbleSort_~j~0, 4);call write~int(bubbleSort_#t~mem7, bubbleSort_~numbers.base, bubbleSort_~numbers.offset + 4 * (bubbleSort_~j~0 - 1), 4);havoc bubbleSort_#t~mem7;call write~int(bubbleSort_~temp~0, bubbleSort_~numbers.base, bubbleSort_~numbers.offset + 4 * bubbleSort_~j~0, 4); 583#L516-2 bubbleSort_#t~post3 := bubbleSort_~j~0;bubbleSort_~j~0 := 1 + bubbleSort_#t~post3;havoc bubbleSort_#t~post3; 584#L516-3 [2020-11-30 00:08:51,256 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-30 00:08:51,256 INFO L82 PathProgramCache]: Analyzing trace with hash 221564791, now seen corresponding path program 1 times [2020-11-30 00:08:51,256 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-30 00:08:51,256 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [66234787] [2020-11-30 00:08:51,256 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-30 00:08:51,270 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-11-30 00:08:51,270 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-11-30 00:08:51,281 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-11-30 00:08:51,281 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-11-30 00:08:51,286 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-11-30 00:08:51,286 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-30 00:08:51,286 INFO L82 PathProgramCache]: Analyzing trace with hash 68618, now seen corresponding path program 4 times [2020-11-30 00:08:51,286 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-30 00:08:51,287 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2041670931] [2020-11-30 00:08:51,287 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-30 00:08:51,291 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-11-30 00:08:51,292 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-11-30 00:08:51,295 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-11-30 00:08:51,295 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-11-30 00:08:51,297 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-11-30 00:08:51,298 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-30 00:08:51,298 INFO L82 PathProgramCache]: Analyzing trace with hash -728006444, now seen corresponding path program 1 times [2020-11-30 00:08:51,298 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-30 00:08:51,298 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1415442145] [2020-11-30 00:08:51,298 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-30 00:08:51,310 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-30 00:08:51,375 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 5 proven. 4 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2020-11-30 00:08:51,375 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1415442145] [2020-11-30 00:08:51,375 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2030240078] [2020-11-30 00:08:51,375 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_4e71fa68-d1ff-4e8c-8bed-4ff7652a5c28/bin/uautomizer/z3 Starting monitored process 36 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 36 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-11-30 00:08:51,423 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-30 00:08:51,424 INFO L263 TraceCheckSpWp]: Trace formula consists of 103 conjuncts, 10 conjunts are in the unsatisfiable core [2020-11-30 00:08:51,425 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-11-30 00:08:51,474 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 5 proven. 4 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2020-11-30 00:08:51,474 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-11-30 00:08:51,475 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 11 [2020-11-30 00:08:51,475 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [764165436] [2020-11-30 00:08:51,575 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-30 00:08:51,576 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-11-30 00:08:51,576 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=79, Unknown=0, NotChecked=0, Total=110 [2020-11-30 00:08:51,576 INFO L87 Difference]: Start difference. First operand 20 states and 25 transitions. cyclomatic complexity: 8 Second operand 11 states. [2020-11-30 00:08:51,722 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-30 00:08:51,722 INFO L93 Difference]: Finished difference Result 35 states and 44 transitions. [2020-11-30 00:08:51,723 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-11-30 00:08:51,723 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 35 states and 44 transitions. [2020-11-30 00:08:51,724 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2020-11-30 00:08:51,725 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 35 states to 23 states and 28 transitions. [2020-11-30 00:08:51,725 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 10 [2020-11-30 00:08:51,725 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 10 [2020-11-30 00:08:51,725 INFO L73 IsDeterministic]: Start isDeterministic. Operand 23 states and 28 transitions. [2020-11-30 00:08:51,725 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2020-11-30 00:08:51,725 INFO L691 BuchiCegarLoop]: Abstraction has 23 states and 28 transitions. [2020-11-30 00:08:51,726 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states and 28 transitions. [2020-11-30 00:08:51,729 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 22. [2020-11-30 00:08:51,729 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22 states. [2020-11-30 00:08:51,729 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 27 transitions. [2020-11-30 00:08:51,730 INFO L714 BuchiCegarLoop]: Abstraction has 22 states and 27 transitions. [2020-11-30 00:08:51,730 INFO L594 BuchiCegarLoop]: Abstraction has 22 states and 27 transitions. [2020-11-30 00:08:51,730 INFO L427 BuchiCegarLoop]: ======== Iteration 7============ [2020-11-30 00:08:51,730 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 22 states and 27 transitions. [2020-11-30 00:08:51,731 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2020-11-30 00:08:51,731 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-11-30 00:08:51,731 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-11-30 00:08:51,732 INFO L852 BuchiCegarLoop]: Counterexample stem histogram [3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-30 00:08:51,732 INFO L853 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2020-11-30 00:08:51,732 INFO L794 eck$LassoCheckResult]: Stem: 714#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; 712#L-1 havoc main_#res;havoc main_#t~nondet8, main_#t~malloc9.base, main_#t~malloc9.offset, main_#t~nondet11, main_#t~post10, main_~k~0, main_~array_size~0, main_~numbers~0.base, main_~numbers~0.offset;main_~array_size~0 := main_#t~nondet8;havoc main_#t~nondet8; 713#L527 assume !(main_~array_size~0 < 1 || main_~array_size~0 >= 536870911); 715#L527-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_~k~0 := 0; 716#L532-3 assume !!(main_~k~0 < main_~array_size~0);call write~int(main_#t~nondet11, main_~numbers~0.base, main_~numbers~0.offset + 4 * main_~k~0, 4);havoc main_#t~nondet11; 723#L532-2 main_#t~post10 := main_~k~0;main_~k~0 := 1 + main_#t~post10;havoc main_#t~post10; 724#L532-3 assume !!(main_~k~0 < main_~array_size~0);call write~int(main_#t~nondet11, main_~numbers~0.base, main_~numbers~0.offset + 4 * main_~k~0, 4);havoc main_#t~nondet11; 717#L532-2 main_#t~post10 := main_~k~0;main_~k~0 := 1 + main_#t~post10;havoc main_#t~post10; 718#L532-3 assume !!(main_~k~0 < main_~array_size~0);call write~int(main_#t~nondet11, main_~numbers~0.base, main_~numbers~0.offset + 4 * main_~k~0, 4);havoc main_#t~nondet11; 733#L532-2 main_#t~post10 := main_~k~0;main_~k~0 := 1 + main_#t~post10;havoc main_#t~post10; 732#L532-3 assume !(main_~k~0 < main_~array_size~0); 731#L532-4 bubbleSort_#in~numbers.base, bubbleSort_#in~numbers.offset, bubbleSort_#in~array_size := main_~numbers~0.base, main_~numbers~0.offset, main_~array_size~0;havoc bubbleSort_#t~mem4, bubbleSort_#t~mem5, bubbleSort_#t~mem6, bubbleSort_#t~mem7, bubbleSort_#t~post3, bubbleSort_#t~post2, bubbleSort_~numbers.base, bubbleSort_~numbers.offset, bubbleSort_~array_size, bubbleSort_~i~0, bubbleSort_~j~0, bubbleSort_~temp~0;bubbleSort_~numbers.base, bubbleSort_~numbers.offset := bubbleSort_#in~numbers.base, bubbleSort_#in~numbers.offset;bubbleSort_~array_size := bubbleSort_#in~array_size;havoc bubbleSort_~i~0;havoc bubbleSort_~j~0;havoc bubbleSort_~temp~0;bubbleSort_~i~0 := bubbleSort_~array_size - 1; 730#L515-3 assume !!(bubbleSort_~i~0 >= 0);bubbleSort_~j~0 := 1; 726#L516-3 assume !!(bubbleSort_~j~0 <= bubbleSort_~i~0);call bubbleSort_#t~mem4 := read~int(bubbleSort_~numbers.base, bubbleSort_~numbers.offset + 4 * (bubbleSort_~j~0 - 1), 4);call bubbleSort_#t~mem5 := read~int(bubbleSort_~numbers.base, bubbleSort_~numbers.offset + 4 * bubbleSort_~j~0, 4); 727#L517 assume !(bubbleSort_#t~mem4 > bubbleSort_#t~mem5);havoc bubbleSort_#t~mem4;havoc bubbleSort_#t~mem5; 721#L516-2 bubbleSort_#t~post3 := bubbleSort_~j~0;bubbleSort_~j~0 := 1 + bubbleSort_#t~post3;havoc bubbleSort_#t~post3; 722#L516-3 assume !(bubbleSort_~j~0 <= bubbleSort_~i~0); 728#L515-2 bubbleSort_#t~post2 := bubbleSort_~i~0;bubbleSort_~i~0 := bubbleSort_#t~post2 - 1;havoc bubbleSort_#t~post2; 729#L515-3 assume !!(bubbleSort_~i~0 >= 0);bubbleSort_~j~0 := 1; 720#L516-3 [2020-11-30 00:08:51,733 INFO L796 eck$LassoCheckResult]: Loop: 720#L516-3 assume !!(bubbleSort_~j~0 <= bubbleSort_~i~0);call bubbleSort_#t~mem4 := read~int(bubbleSort_~numbers.base, bubbleSort_~numbers.offset + 4 * (bubbleSort_~j~0 - 1), 4);call bubbleSort_#t~mem5 := read~int(bubbleSort_~numbers.base, bubbleSort_~numbers.offset + 4 * bubbleSort_~j~0, 4); 725#L517 assume bubbleSort_#t~mem4 > bubbleSort_#t~mem5;havoc bubbleSort_#t~mem4;havoc bubbleSort_#t~mem5;call bubbleSort_#t~mem6 := read~int(bubbleSort_~numbers.base, bubbleSort_~numbers.offset + 4 * (bubbleSort_~j~0 - 1), 4);bubbleSort_~temp~0 := bubbleSort_#t~mem6;havoc bubbleSort_#t~mem6;call bubbleSort_#t~mem7 := read~int(bubbleSort_~numbers.base, bubbleSort_~numbers.offset + 4 * bubbleSort_~j~0, 4);call write~int(bubbleSort_#t~mem7, bubbleSort_~numbers.base, bubbleSort_~numbers.offset + 4 * (bubbleSort_~j~0 - 1), 4);havoc bubbleSort_#t~mem7;call write~int(bubbleSort_~temp~0, bubbleSort_~numbers.base, bubbleSort_~numbers.offset + 4 * bubbleSort_~j~0, 4); 719#L516-2 bubbleSort_#t~post3 := bubbleSort_~j~0;bubbleSort_~j~0 := 1 + bubbleSort_#t~post3;havoc bubbleSort_#t~post3; 720#L516-3 [2020-11-30 00:08:51,733 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-30 00:08:51,733 INFO L82 PathProgramCache]: Analyzing trace with hash 1850126805, now seen corresponding path program 2 times [2020-11-30 00:08:51,733 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-30 00:08:51,734 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [46920193] [2020-11-30 00:08:51,734 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-30 00:08:51,752 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-30 00:08:51,875 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 2 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-30 00:08:51,876 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [46920193] [2020-11-30 00:08:51,876 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1977820826] [2020-11-30 00:08:51,876 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_4e71fa68-d1ff-4e8c-8bed-4ff7652a5c28/bin/uautomizer/z3 Starting monitored process 37 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 37 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-11-30 00:08:51,938 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2020-11-30 00:08:51,938 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-11-30 00:08:51,939 INFO L263 TraceCheckSpWp]: Trace formula consists of 88 conjuncts, 10 conjunts are in the unsatisfiable core [2020-11-30 00:08:51,940 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-11-30 00:08:52,103 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 5 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-30 00:08:52,103 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-11-30 00:08:52,104 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 12 [2020-11-30 00:08:52,104 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2009392163] [2020-11-30 00:08:52,104 INFO L799 eck$LassoCheckResult]: stem already infeasible [2020-11-30 00:08:52,105 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-30 00:08:52,105 INFO L82 PathProgramCache]: Analyzing trace with hash 68618, now seen corresponding path program 5 times [2020-11-30 00:08:52,105 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-30 00:08:52,105 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1976067578] [2020-11-30 00:08:52,105 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-30 00:08:52,110 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-11-30 00:08:52,110 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-11-30 00:08:52,113 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-11-30 00:08:52,114 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-11-30 00:08:52,129 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-11-30 00:08:52,214 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-30 00:08:52,215 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-11-30 00:08:52,215 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=98, Unknown=0, NotChecked=0, Total=132 [2020-11-30 00:08:52,215 INFO L87 Difference]: Start difference. First operand 22 states and 27 transitions. cyclomatic complexity: 8 Second operand 12 states. [2020-11-30 00:08:52,438 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-30 00:08:52,438 INFO L93 Difference]: Finished difference Result 31 states and 40 transitions. [2020-11-30 00:08:52,439 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-11-30 00:08:52,439 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 31 states and 40 transitions. [2020-11-30 00:08:52,440 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2020-11-30 00:08:52,441 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 31 states to 31 states and 40 transitions. [2020-11-30 00:08:52,441 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 10 [2020-11-30 00:08:52,441 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 10 [2020-11-30 00:08:52,441 INFO L73 IsDeterministic]: Start isDeterministic. Operand 31 states and 40 transitions. [2020-11-30 00:08:52,441 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2020-11-30 00:08:52,441 INFO L691 BuchiCegarLoop]: Abstraction has 31 states and 40 transitions. [2020-11-30 00:08:52,441 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states and 40 transitions. [2020-11-30 00:08:52,444 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 25. [2020-11-30 00:08:52,444 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25 states. [2020-11-30 00:08:52,445 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 31 transitions. [2020-11-30 00:08:52,445 INFO L714 BuchiCegarLoop]: Abstraction has 25 states and 31 transitions. [2020-11-30 00:08:52,445 INFO L594 BuchiCegarLoop]: Abstraction has 25 states and 31 transitions. [2020-11-30 00:08:52,445 INFO L427 BuchiCegarLoop]: ======== Iteration 8============ [2020-11-30 00:08:52,445 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 25 states and 31 transitions. [2020-11-30 00:08:52,446 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2020-11-30 00:08:52,446 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-11-30 00:08:52,446 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-11-30 00:08:52,447 INFO L852 BuchiCegarLoop]: Counterexample stem histogram [3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-30 00:08:52,447 INFO L853 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2020-11-30 00:08:52,448 INFO L794 eck$LassoCheckResult]: Stem: 848#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_~k~0, main_~array_size~0, main_~numbers~0.base, main_~numbers~0.offset;main_~array_size~0 := main_#t~nondet8;havoc main_#t~nondet8; 847#L527 assume !(main_~array_size~0 < 1 || main_~array_size~0 >= 536870911); 849#L527-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_~k~0 := 0; 850#L532-3 assume !!(main_~k~0 < main_~array_size~0);call write~int(main_#t~nondet11, main_~numbers~0.base, main_~numbers~0.offset + 4 * main_~k~0, 4);havoc main_#t~nondet11; 855#L532-2 main_#t~post10 := main_~k~0;main_~k~0 := 1 + main_#t~post10;havoc main_#t~post10; 856#L532-3 assume !!(main_~k~0 < main_~array_size~0);call write~int(main_#t~nondet11, main_~numbers~0.base, main_~numbers~0.offset + 4 * main_~k~0, 4);havoc main_#t~nondet11; 862#L532-2 main_#t~post10 := main_~k~0;main_~k~0 := 1 + main_#t~post10;havoc main_#t~post10; 868#L532-3 assume !!(main_~k~0 < main_~array_size~0);call write~int(main_#t~nondet11, main_~numbers~0.base, main_~numbers~0.offset + 4 * main_~k~0, 4);havoc main_#t~nondet11; 867#L532-2 main_#t~post10 := main_~k~0;main_~k~0 := 1 + main_#t~post10;havoc main_#t~post10; 866#L532-3 assume !(main_~k~0 < main_~array_size~0); 865#L532-4 bubbleSort_#in~numbers.base, bubbleSort_#in~numbers.offset, bubbleSort_#in~array_size := main_~numbers~0.base, main_~numbers~0.offset, main_~array_size~0;havoc bubbleSort_#t~mem4, bubbleSort_#t~mem5, bubbleSort_#t~mem6, bubbleSort_#t~mem7, bubbleSort_#t~post3, bubbleSort_#t~post2, bubbleSort_~numbers.base, bubbleSort_~numbers.offset, bubbleSort_~array_size, bubbleSort_~i~0, bubbleSort_~j~0, bubbleSort_~temp~0;bubbleSort_~numbers.base, bubbleSort_~numbers.offset := bubbleSort_#in~numbers.base, bubbleSort_#in~numbers.offset;bubbleSort_~array_size := bubbleSort_#in~array_size;havoc bubbleSort_~i~0;havoc bubbleSort_~j~0;havoc bubbleSort_~temp~0;bubbleSort_~i~0 := bubbleSort_~array_size - 1; 863#L515-3 assume !!(bubbleSort_~i~0 >= 0);bubbleSort_~j~0 := 1; 864#L516-3 assume !!(bubbleSort_~j~0 <= bubbleSort_~i~0);call bubbleSort_#t~mem4 := read~int(bubbleSort_~numbers.base, bubbleSort_~numbers.offset + 4 * (bubbleSort_~j~0 - 1), 4);call bubbleSort_#t~mem5 := read~int(bubbleSort_~numbers.base, bubbleSort_~numbers.offset + 4 * bubbleSort_~j~0, 4); 870#L517 assume !(bubbleSort_#t~mem4 > bubbleSort_#t~mem5);havoc bubbleSort_#t~mem4;havoc bubbleSort_#t~mem5; 869#L516-2 bubbleSort_#t~post3 := bubbleSort_~j~0;bubbleSort_~j~0 := 1 + bubbleSort_#t~post3;havoc bubbleSort_#t~post3; 858#L516-3 assume !!(bubbleSort_~j~0 <= bubbleSort_~i~0);call bubbleSort_#t~mem4 := read~int(bubbleSort_~numbers.base, bubbleSort_~numbers.offset + 4 * (bubbleSort_~j~0 - 1), 4);call bubbleSort_#t~mem5 := read~int(bubbleSort_~numbers.base, bubbleSort_~numbers.offset + 4 * bubbleSort_~j~0, 4); 859#L517 assume !(bubbleSort_#t~mem4 > bubbleSort_#t~mem5);havoc bubbleSort_#t~mem4;havoc bubbleSort_#t~mem5; 853#L516-2 bubbleSort_#t~post3 := bubbleSort_~j~0;bubbleSort_~j~0 := 1 + bubbleSort_#t~post3;havoc bubbleSort_#t~post3; 854#L516-3 assume !(bubbleSort_~j~0 <= bubbleSort_~i~0); 860#L515-2 bubbleSort_#t~post2 := bubbleSort_~i~0;bubbleSort_~i~0 := bubbleSort_#t~post2 - 1;havoc bubbleSort_#t~post2; 861#L515-3 assume !!(bubbleSort_~i~0 >= 0);bubbleSort_~j~0 := 1; 852#L516-3 [2020-11-30 00:08:52,448 INFO L796 eck$LassoCheckResult]: Loop: 852#L516-3 assume !!(bubbleSort_~j~0 <= bubbleSort_~i~0);call bubbleSort_#t~mem4 := read~int(bubbleSort_~numbers.base, bubbleSort_~numbers.offset + 4 * (bubbleSort_~j~0 - 1), 4);call bubbleSort_#t~mem5 := read~int(bubbleSort_~numbers.base, bubbleSort_~numbers.offset + 4 * bubbleSort_~j~0, 4); 857#L517 assume bubbleSort_#t~mem4 > bubbleSort_#t~mem5;havoc bubbleSort_#t~mem4;havoc bubbleSort_#t~mem5;call bubbleSort_#t~mem6 := read~int(bubbleSort_~numbers.base, bubbleSort_~numbers.offset + 4 * (bubbleSort_~j~0 - 1), 4);bubbleSort_~temp~0 := bubbleSort_#t~mem6;havoc bubbleSort_#t~mem6;call bubbleSort_#t~mem7 := read~int(bubbleSort_~numbers.base, bubbleSort_~numbers.offset + 4 * bubbleSort_~j~0, 4);call write~int(bubbleSort_#t~mem7, bubbleSort_~numbers.base, bubbleSort_~numbers.offset + 4 * (bubbleSort_~j~0 - 1), 4);havoc bubbleSort_#t~mem7;call write~int(bubbleSort_~temp~0, bubbleSort_~numbers.base, bubbleSort_~numbers.offset + 4 * bubbleSort_~j~0, 4); 851#L516-2 bubbleSort_#t~post3 := bubbleSort_~j~0;bubbleSort_~j~0 := 1 + bubbleSort_#t~post3;havoc bubbleSort_#t~post3; 852#L516-3 [2020-11-30 00:08:52,449 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-30 00:08:52,449 INFO L82 PathProgramCache]: Analyzing trace with hash -135460634, now seen corresponding path program 3 times [2020-11-30 00:08:52,449 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-30 00:08:52,449 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [667636819] [2020-11-30 00:08:52,449 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-30 00:08:52,493 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-11-30 00:08:52,494 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-11-30 00:08:52,515 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-11-30 00:08:52,516 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-11-30 00:08:52,522 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-11-30 00:08:52,522 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-30 00:08:52,522 INFO L82 PathProgramCache]: Analyzing trace with hash 68618, now seen corresponding path program 6 times [2020-11-30 00:08:52,523 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-30 00:08:52,523 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [899537913] [2020-11-30 00:08:52,523 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-30 00:08:52,528 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-11-30 00:08:52,528 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-11-30 00:08:52,532 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-11-30 00:08:52,532 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-11-30 00:08:52,534 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-11-30 00:08:52,535 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-30 00:08:52,535 INFO L82 PathProgramCache]: Analyzing trace with hash 1761549573, now seen corresponding path program 2 times [2020-11-30 00:08:52,535 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-30 00:08:52,535 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1693247107] [2020-11-30 00:08:52,536 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-30 00:08:52,561 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-30 00:08:52,837 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 6 proven. 10 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2020-11-30 00:08:52,838 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1693247107] [2020-11-30 00:08:52,838 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1913505108] [2020-11-30 00:08:52,838 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_4e71fa68-d1ff-4e8c-8bed-4ff7652a5c28/bin/uautomizer/z3 Starting monitored process 38 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 38 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-11-30 00:08:52,928 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2020-11-30 00:08:52,928 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-11-30 00:08:52,929 INFO L263 TraceCheckSpWp]: Trace formula consists of 125 conjuncts, 20 conjunts are in the unsatisfiable core [2020-11-30 00:08:52,935 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-11-30 00:08:53,130 INFO L350 Elim1Store]: treesize reduction 9, result has 10.0 percent of original size [2020-11-30 00:08:53,131 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 30 treesize of output 10 [2020-11-30 00:08:53,132 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-11-30 00:08:53,145 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-11-30 00:08:53,146 INFO L545 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-11-30 00:08:53,146 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:30, output treesize:3 [2020-11-30 00:08:53,156 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 6 proven. 11 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2020-11-30 00:08:53,156 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-11-30 00:08:53,156 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 8] total 15 [2020-11-30 00:08:53,157 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [999543115] [2020-11-30 00:08:53,272 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-30 00:08:53,272 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2020-11-30 00:08:53,273 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=167, Unknown=0, NotChecked=0, Total=210 [2020-11-30 00:08:53,273 INFO L87 Difference]: Start difference. First operand 25 states and 31 transitions. cyclomatic complexity: 9 Second operand 15 states. [2020-11-30 00:08:53,632 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-30 00:08:53,632 INFO L93 Difference]: Finished difference Result 47 states and 63 transitions. [2020-11-30 00:08:53,634 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-11-30 00:08:53,634 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 47 states and 63 transitions. [2020-11-30 00:08:53,635 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 6 [2020-11-30 00:08:53,636 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 47 states to 47 states and 63 transitions. [2020-11-30 00:08:53,636 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 18 [2020-11-30 00:08:53,636 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 18 [2020-11-30 00:08:53,636 INFO L73 IsDeterministic]: Start isDeterministic. Operand 47 states and 63 transitions. [2020-11-30 00:08:53,637 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2020-11-30 00:08:53,637 INFO L691 BuchiCegarLoop]: Abstraction has 47 states and 63 transitions. [2020-11-30 00:08:53,637 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states and 63 transitions. [2020-11-30 00:08:53,640 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 36. [2020-11-30 00:08:53,640 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36 states. [2020-11-30 00:08:53,640 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 48 transitions. [2020-11-30 00:08:53,641 INFO L714 BuchiCegarLoop]: Abstraction has 36 states and 48 transitions. [2020-11-30 00:08:53,641 INFO L594 BuchiCegarLoop]: Abstraction has 36 states and 48 transitions. [2020-11-30 00:08:53,641 INFO L427 BuchiCegarLoop]: ======== Iteration 9============ [2020-11-30 00:08:53,641 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 36 states and 48 transitions. [2020-11-30 00:08:53,641 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2020-11-30 00:08:53,642 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-11-30 00:08:53,642 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-11-30 00:08:53,643 INFO L852 BuchiCegarLoop]: Counterexample stem histogram [3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-30 00:08:53,643 INFO L853 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2020-11-30 00:08:53,643 INFO L794 eck$LassoCheckResult]: Stem: 1025#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; 1023#L-1 havoc main_#res;havoc main_#t~nondet8, main_#t~malloc9.base, main_#t~malloc9.offset, main_#t~nondet11, main_#t~post10, main_~k~0, main_~array_size~0, main_~numbers~0.base, main_~numbers~0.offset;main_~array_size~0 := main_#t~nondet8;havoc main_#t~nondet8; 1024#L527 assume !(main_~array_size~0 < 1 || main_~array_size~0 >= 536870911); 1026#L527-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_~k~0 := 0; 1027#L532-3 assume !!(main_~k~0 < main_~array_size~0);call write~int(main_#t~nondet11, main_~numbers~0.base, main_~numbers~0.offset + 4 * main_~k~0, 4);havoc main_#t~nondet11; 1034#L532-2 main_#t~post10 := main_~k~0;main_~k~0 := 1 + main_#t~post10;havoc main_#t~post10; 1035#L532-3 assume !!(main_~k~0 < main_~array_size~0);call write~int(main_#t~nondet11, main_~numbers~0.base, main_~numbers~0.offset + 4 * main_~k~0, 4);havoc main_#t~nondet11; 1028#L532-2 main_#t~post10 := main_~k~0;main_~k~0 := 1 + main_#t~post10;havoc main_#t~post10; 1029#L532-3 assume !!(main_~k~0 < main_~array_size~0);call write~int(main_#t~nondet11, main_~numbers~0.base, main_~numbers~0.offset + 4 * main_~k~0, 4);havoc main_#t~nondet11; 1047#L532-2 main_#t~post10 := main_~k~0;main_~k~0 := 1 + main_#t~post10;havoc main_#t~post10; 1046#L532-3 assume !(main_~k~0 < main_~array_size~0); 1042#L532-4 bubbleSort_#in~numbers.base, bubbleSort_#in~numbers.offset, bubbleSort_#in~array_size := main_~numbers~0.base, main_~numbers~0.offset, main_~array_size~0;havoc bubbleSort_#t~mem4, bubbleSort_#t~mem5, bubbleSort_#t~mem6, bubbleSort_#t~mem7, bubbleSort_#t~post3, bubbleSort_#t~post2, bubbleSort_~numbers.base, bubbleSort_~numbers.offset, bubbleSort_~array_size, bubbleSort_~i~0, bubbleSort_~j~0, bubbleSort_~temp~0;bubbleSort_~numbers.base, bubbleSort_~numbers.offset := bubbleSort_#in~numbers.base, bubbleSort_#in~numbers.offset;bubbleSort_~array_size := bubbleSort_#in~array_size;havoc bubbleSort_~i~0;havoc bubbleSort_~j~0;havoc bubbleSort_~temp~0;bubbleSort_~i~0 := bubbleSort_~array_size - 1; 1043#L515-3 assume !!(bubbleSort_~i~0 >= 0);bubbleSort_~j~0 := 1; 1038#L516-3 assume !!(bubbleSort_~j~0 <= bubbleSort_~i~0);call bubbleSort_#t~mem4 := read~int(bubbleSort_~numbers.base, bubbleSort_~numbers.offset + 4 * (bubbleSort_~j~0 - 1), 4);call bubbleSort_#t~mem5 := read~int(bubbleSort_~numbers.base, bubbleSort_~numbers.offset + 4 * bubbleSort_~j~0, 4); 1039#L517 assume !(bubbleSort_#t~mem4 > bubbleSort_#t~mem5);havoc bubbleSort_#t~mem4;havoc bubbleSort_#t~mem5; 1055#L516-2 bubbleSort_#t~post3 := bubbleSort_~j~0;bubbleSort_~j~0 := 1 + bubbleSort_#t~post3;havoc bubbleSort_#t~post3; 1056#L516-3 assume !!(bubbleSort_~j~0 <= bubbleSort_~i~0);call bubbleSort_#t~mem4 := read~int(bubbleSort_~numbers.base, bubbleSort_~numbers.offset + 4 * (bubbleSort_~j~0 - 1), 4);call bubbleSort_#t~mem5 := read~int(bubbleSort_~numbers.base, bubbleSort_~numbers.offset + 4 * bubbleSort_~j~0, 4); 1058#L517 assume bubbleSort_#t~mem4 > bubbleSort_#t~mem5;havoc bubbleSort_#t~mem4;havoc bubbleSort_#t~mem5;call bubbleSort_#t~mem6 := read~int(bubbleSort_~numbers.base, bubbleSort_~numbers.offset + 4 * (bubbleSort_~j~0 - 1), 4);bubbleSort_~temp~0 := bubbleSort_#t~mem6;havoc bubbleSort_#t~mem6;call bubbleSort_#t~mem7 := read~int(bubbleSort_~numbers.base, bubbleSort_~numbers.offset + 4 * bubbleSort_~j~0, 4);call write~int(bubbleSort_#t~mem7, bubbleSort_~numbers.base, bubbleSort_~numbers.offset + 4 * (bubbleSort_~j~0 - 1), 4);havoc bubbleSort_#t~mem7;call write~int(bubbleSort_~temp~0, bubbleSort_~numbers.base, bubbleSort_~numbers.offset + 4 * bubbleSort_~j~0, 4); 1032#L516-2 bubbleSort_#t~post3 := bubbleSort_~j~0;bubbleSort_~j~0 := 1 + bubbleSort_#t~post3;havoc bubbleSort_#t~post3; 1033#L516-3 assume !(bubbleSort_~j~0 <= bubbleSort_~i~0); 1040#L515-2 bubbleSort_#t~post2 := bubbleSort_~i~0;bubbleSort_~i~0 := bubbleSort_#t~post2 - 1;havoc bubbleSort_#t~post2; 1041#L515-3 assume !!(bubbleSort_~i~0 >= 0);bubbleSort_~j~0 := 1; 1031#L516-3 [2020-11-30 00:08:53,643 INFO L796 eck$LassoCheckResult]: Loop: 1031#L516-3 assume !!(bubbleSort_~j~0 <= bubbleSort_~i~0);call bubbleSort_#t~mem4 := read~int(bubbleSort_~numbers.base, bubbleSort_~numbers.offset + 4 * (bubbleSort_~j~0 - 1), 4);call bubbleSort_#t~mem5 := read~int(bubbleSort_~numbers.base, bubbleSort_~numbers.offset + 4 * bubbleSort_~j~0, 4); 1048#L517 assume bubbleSort_#t~mem4 > bubbleSort_#t~mem5;havoc bubbleSort_#t~mem4;havoc bubbleSort_#t~mem5;call bubbleSort_#t~mem6 := read~int(bubbleSort_~numbers.base, bubbleSort_~numbers.offset + 4 * (bubbleSort_~j~0 - 1), 4);bubbleSort_~temp~0 := bubbleSort_#t~mem6;havoc bubbleSort_#t~mem6;call bubbleSort_#t~mem7 := read~int(bubbleSort_~numbers.base, bubbleSort_~numbers.offset + 4 * bubbleSort_~j~0, 4);call write~int(bubbleSort_#t~mem7, bubbleSort_~numbers.base, bubbleSort_~numbers.offset + 4 * (bubbleSort_~j~0 - 1), 4);havoc bubbleSort_#t~mem7;call write~int(bubbleSort_~temp~0, bubbleSort_~numbers.base, bubbleSort_~numbers.offset + 4 * bubbleSort_~j~0, 4); 1030#L516-2 bubbleSort_#t~post3 := bubbleSort_~j~0;bubbleSort_~j~0 := 1 + bubbleSort_#t~post3;havoc bubbleSort_#t~post3; 1031#L516-3 [2020-11-30 00:08:53,644 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-30 00:08:53,644 INFO L82 PathProgramCache]: Analyzing trace with hash -137307676, now seen corresponding path program 3 times [2020-11-30 00:08:53,644 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-30 00:08:53,644 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2081536598] [2020-11-30 00:08:53,644 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-30 00:08:53,669 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-11-30 00:08:53,669 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-11-30 00:08:53,704 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-11-30 00:08:53,704 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-11-30 00:08:53,715 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-11-30 00:08:53,717 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-30 00:08:53,718 INFO L82 PathProgramCache]: Analyzing trace with hash 68618, now seen corresponding path program 7 times [2020-11-30 00:08:53,718 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-30 00:08:53,718 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [854780558] [2020-11-30 00:08:53,718 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-30 00:08:53,727 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-11-30 00:08:53,727 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-11-30 00:08:53,742 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-11-30 00:08:53,742 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-11-30 00:08:53,744 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-11-30 00:08:53,745 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-30 00:08:53,746 INFO L82 PathProgramCache]: Analyzing trace with hash -1724071097, now seen corresponding path program 4 times [2020-11-30 00:08:53,746 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-30 00:08:53,747 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [57661385] [2020-11-30 00:08:53,747 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-30 00:08:53,787 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-11-30 00:08:53,788 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-11-30 00:08:53,818 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-11-30 00:08:53,818 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-11-30 00:08:53,841 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-11-30 00:08:54,898 WARN L193 SmtUtils]: Spent 974.00 ms on a formula simplification. DAG size of input: 183 DAG size of output: 140 [2020-11-30 00:08:55,111 WARN L193 SmtUtils]: Spent 183.00 ms on a formula simplification that was a NOOP. DAG size: 89 [2020-11-30 00:08:55,113 INFO L210 LassoAnalysis]: Preferences: [2020-11-30 00:08:55,113 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2020-11-30 00:08:55,113 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2020-11-30 00:08:55,113 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2020-11-30 00:08:55,113 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2020-11-30 00:08:55,114 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-11-30 00:08:55,114 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2020-11-30 00:08:55,114 INFO L132 ssoRankerPreferences]: Path of dumped script: [2020-11-30 00:08:55,114 INFO L133 ssoRankerPreferences]: Filename of dumped script: bubblesort-alloca-2.i_Iteration9_Lasso [2020-11-30 00:08:55,114 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2020-11-30 00:08:55,114 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2020-11-30 00:08:55,118 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-11-30 00:08:55,124 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-11-30 00:08:55,126 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-11-30 00:08:55,129 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-11-30 00:08:55,132 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-11-30 00:08:55,134 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-11-30 00:08:55,228 FATAL L? ?]: The Plugin de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer has thrown an exception: java.lang.AssertionError: MapEliminator tries to combine Int and (Array Int Int) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.mapelimination.MapEliminator.indexEqualityInequalityImpliesValueEquality(MapEliminator.java:850) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.mapelimination.MapEliminator.replaceSelectStoreTerm(MapEliminator.java:592) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.mapelimination.MapEliminator.replaceStoreTerms(MapEliminator.java:542) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.mapelimination.MapEliminator.getRewrittenTransFormula(MapEliminator.java:330) at de.uni_freiburg.informatik.ultimate.lassoranker.preprocessors.MapEliminationLassoPreprocessor.process(MapEliminationLassoPreprocessor.java:109) at de.uni_freiburg.informatik.ultimate.lassoranker.variables.LassoBuilder.applyPreprocessor(LassoBuilder.java:154) at de.uni_freiburg.informatik.ultimate.lassoranker.variables.LassoBuilder.preprocess(LassoBuilder.java:262) at de.uni_freiburg.informatik.ultimate.lassoranker.LassoAnalysis.preprocess(LassoAnalysis.java:278) at de.uni_freiburg.informatik.ultimate.lassoranker.LassoAnalysis.(LassoAnalysis.java:229) at de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.LassoCheck.synthesize(LassoCheck.java:612) at de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.LassoCheck.access$16(LassoCheck.java:539) at de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.LassoCheck$LassoCheckResult.checkLassoTermination(LassoCheck.java:957) at de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.LassoCheck$LassoCheckResult.(LassoCheck.java:865) at de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.LassoCheck.(LassoCheck.java:251) at de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiCegarLoop.iterate(BuchiCegarLoop.java:461) at de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver.doTerminationAnalysis(BuchiAutomizerObserver.java:141) at de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver.finish(BuchiAutomizerObserver.java:382) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2020-11-30 00:08:55,232 INFO L168 Benchmark]: Toolchain (without parser) took 12849.36 ms. Allocated memory was 96.5 MB in the beginning and 155.2 MB in the end (delta: 58.7 MB). Free memory was 59.7 MB in the beginning and 45.2 MB in the end (delta: 14.5 MB). Peak memory consumption was 79.3 MB. Max. memory is 16.1 GB. [2020-11-30 00:08:55,232 INFO L168 Benchmark]: CDTParser took 0.91 ms. Allocated memory is still 96.5 MB. Free memory is still 77.1 MB. There was no memory consumed. Max. memory is 16.1 GB. [2020-11-30 00:08:55,232 INFO L168 Benchmark]: CACSL2BoogieTranslator took 657.53 ms. Allocated memory is still 96.5 MB. Free memory was 59.6 MB in the beginning and 61.5 MB in the end (delta: -1.9 MB). Peak memory consumption was 10.5 MB. Max. memory is 16.1 GB. [2020-11-30 00:08:55,233 INFO L168 Benchmark]: Boogie Procedure Inliner took 77.80 ms. Allocated memory is still 96.5 MB. Free memory was 61.5 MB in the beginning and 59.5 MB in the end (delta: 1.9 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. [2020-11-30 00:08:55,233 INFO L168 Benchmark]: Boogie Preprocessor took 31.96 ms. Allocated memory is still 96.5 MB. Free memory was 59.5 MB in the beginning and 58.2 MB in the end (delta: 1.3 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. [2020-11-30 00:08:55,234 INFO L168 Benchmark]: RCFGBuilder took 588.49 ms. Allocated memory is still 96.5 MB. Free memory was 58.2 MB in the beginning and 43.5 MB in the end (delta: 14.7 MB). Peak memory consumption was 14.7 MB. Max. memory is 16.1 GB. [2020-11-30 00:08:55,234 INFO L168 Benchmark]: BuchiAutomizer took 11475.40 ms. Allocated memory was 96.5 MB in the beginning and 155.2 MB in the end (delta: 58.7 MB). Free memory was 43.5 MB in the beginning and 45.2 MB in the end (delta: -1.7 MB). Peak memory consumption was 64.8 MB. Max. memory is 16.1 GB. [2020-11-30 00:08:55,237 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.91 ms. Allocated memory is still 96.5 MB. Free memory is still 77.1 MB. There was no memory consumed. Max. memory is 16.1 GB. * CACSL2BoogieTranslator took 657.53 ms. Allocated memory is still 96.5 MB. Free memory was 59.6 MB in the beginning and 61.5 MB in the end (delta: -1.9 MB). Peak memory consumption was 10.5 MB. Max. memory is 16.1 GB. * Boogie Procedure Inliner took 77.80 ms. Allocated memory is still 96.5 MB. Free memory was 61.5 MB in the beginning and 59.5 MB in the end (delta: 1.9 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. * Boogie Preprocessor took 31.96 ms. Allocated memory is still 96.5 MB. Free memory was 59.5 MB in the beginning and 58.2 MB in the end (delta: 1.3 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. * RCFGBuilder took 588.49 ms. Allocated memory is still 96.5 MB. Free memory was 58.2 MB in the beginning and 43.5 MB in the end (delta: 14.7 MB). Peak memory consumption was 14.7 MB. Max. memory is 16.1 GB. * BuchiAutomizer took 11475.40 ms. Allocated memory was 96.5 MB in the beginning and 155.2 MB in the end (delta: 58.7 MB). Free memory was 43.5 MB in the beginning and 45.2 MB in the end (delta: -1.7 MB). Peak memory consumption was 64.8 MB. Max. memory is 16.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResult: Unfinished Backtranslation unknown boogie variable #length * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer: - ExceptionOrErrorResult: AssertionError: MapEliminator tries to combine Int and (Array Int Int) de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer: AssertionError: MapEliminator tries to combine Int and (Array Int Int): de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.mapelimination.MapEliminator.indexEqualityInequalityImpliesValueEquality(MapEliminator.java:850) RESULT: Ultimate could not prove your program: Toolchain returned no result. Received shutdown request...