./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 cad46833 Calling Ultimate with: /usr/lib/jvm/java-8-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/run_dir_f297173b-1aaf-4164-aac5-2e4426968557/bin/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/run_dir_f297173b-1aaf-4164-aac5-2e4426968557/bin/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/run_dir_f297173b-1aaf-4164-aac5-2e4426968557/bin/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/run_dir_f297173b-1aaf-4164-aac5-2e4426968557/bin/uautomizer/config/AutomizerTermination.xml -i ../../sv-benchmarks/c/array-memsafety/bubblesort-alloca-2.i -s /tmp/vcloud-vcloud-master/worker/run_dir_f297173b-1aaf-4164-aac5-2e4426968557/bin/uautomizer/config/svcomp-Termination-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/run_dir_f297173b-1aaf-4164-aac5-2e4426968557/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_f297173b-1aaf-4164-aac5-2e4426968557/bin/uautomizer/config using search string *Termination*32bit*_Bitvector*.epf No suitable settings file found using Termination*32bit*_Bitvector ERROR: UNSUPPORTED PROPERTY Writing output log to file Ultimate.log Result: ERROR: ExceptionOrErrorResult: AssertionError: MapEliminator tries to combine Int and (Array Int Int) --- Real Ultimate output --- This is Ultimate 0.1.24-cad4683 [2019-11-15 22:13:31,719 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-15 22:13:31,721 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-15 22:13:31,745 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-15 22:13:31,745 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-15 22:13:31,748 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-15 22:13:31,751 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-15 22:13:31,769 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-15 22:13:31,772 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-15 22:13:31,776 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-15 22:13:31,777 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-15 22:13:31,779 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-15 22:13:31,779 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-15 22:13:31,780 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-15 22:13:31,781 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-15 22:13:31,783 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-15 22:13:31,784 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-15 22:13:31,785 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-15 22:13:31,787 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-15 22:13:31,790 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-15 22:13:31,792 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-15 22:13:31,794 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-15 22:13:31,795 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-15 22:13:31,796 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-15 22:13:31,800 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-15 22:13:31,801 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-15 22:13:31,801 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-15 22:13:31,803 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-15 22:13:31,803 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-15 22:13:31,805 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-15 22:13:31,805 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-15 22:13:31,806 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-15 22:13:31,807 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-15 22:13:31,808 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-15 22:13:31,810 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-15 22:13:31,810 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-15 22:13:31,811 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-15 22:13:31,811 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-15 22:13:31,812 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-15 22:13:31,813 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-15 22:13:31,814 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-15 22:13:31,815 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/run_dir_f297173b-1aaf-4164-aac5-2e4426968557/bin/uautomizer/config/svcomp-Termination-32bit-Automizer_Default.epf [2019-11-15 22:13:31,839 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-15 22:13:31,839 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-15 22:13:31,841 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-11-15 22:13:31,841 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-11-15 22:13:31,841 INFO L138 SettingsManager]: * Use SBE=true [2019-11-15 22:13:31,842 INFO L136 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2019-11-15 22:13:31,842 INFO L138 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2019-11-15 22:13:31,843 INFO L138 SettingsManager]: * Use old map elimination=false [2019-11-15 22:13:31,843 INFO L138 SettingsManager]: * Use external solver (rank synthesis)=false [2019-11-15 22:13:31,843 INFO L138 SettingsManager]: * Use only trivial implications for array writes=true [2019-11-15 22:13:31,844 INFO L138 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2019-11-15 22:13:31,844 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-15 22:13:31,844 INFO L138 SettingsManager]: * sizeof long=4 [2019-11-15 22:13:31,845 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2019-11-15 22:13:31,845 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-11-15 22:13:31,846 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-11-15 22:13:31,846 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-15 22:13:31,846 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2019-11-15 22:13:31,847 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2019-11-15 22:13:31,847 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2019-11-15 22:13:31,847 INFO L138 SettingsManager]: * sizeof long double=12 [2019-11-15 22:13:31,848 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-11-15 22:13:31,848 INFO L138 SettingsManager]: * Assume nondeterminstic values are in range=false [2019-11-15 22:13:31,848 INFO L138 SettingsManager]: * Use constant arrays=true [2019-11-15 22:13:31,849 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2019-11-15 22:13:31,849 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-15 22:13:31,849 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-11-15 22:13:31,850 INFO L138 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2019-11-15 22:13:31,850 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-15 22:13:31,850 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-11-15 22:13:31,851 INFO L138 SettingsManager]: * Dump automata to the following directory=/home/matthias/ultimate/dump/auto [2019-11-15 22:13:31,852 INFO L136 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2019-11-15 22:13:31,852 INFO L138 SettingsManager]: * TransformationType=MODULO_NEIGHBOR Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /tmp/vcloud-vcloud-master/worker/run_dir_f297173b-1aaf-4164-aac5-2e4426968557/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 [2019-11-15 22:13:31,892 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-15 22:13:31,906 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-15 22:13:31,910 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-15 22:13:31,912 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-15 22:13:31,912 INFO L275 PluginConnector]: CDTParser initialized [2019-11-15 22:13:31,913 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/run_dir_f297173b-1aaf-4164-aac5-2e4426968557/bin/uautomizer/../../sv-benchmarks/c/array-memsafety/bubblesort-alloca-2.i [2019-11-15 22:13:31,989 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_f297173b-1aaf-4164-aac5-2e4426968557/bin/uautomizer/data/91238f04b/b824130c81f14d9694259219d47676cd/FLAG8348638c1 [2019-11-15 22:13:32,529 INFO L306 CDTParser]: Found 1 translation units. [2019-11-15 22:13:32,534 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/run_dir_f297173b-1aaf-4164-aac5-2e4426968557/sv-benchmarks/c/array-memsafety/bubblesort-alloca-2.i [2019-11-15 22:13:32,554 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_f297173b-1aaf-4164-aac5-2e4426968557/bin/uautomizer/data/91238f04b/b824130c81f14d9694259219d47676cd/FLAG8348638c1 [2019-11-15 22:13:32,783 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/run_dir_f297173b-1aaf-4164-aac5-2e4426968557/bin/uautomizer/data/91238f04b/b824130c81f14d9694259219d47676cd [2019-11-15 22:13:32,786 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-15 22:13:32,788 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-11-15 22:13:32,789 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-15 22:13:32,789 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-15 22:13:32,793 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-15 22:13:32,794 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.11 10:13:32" (1/1) ... [2019-11-15 22:13:32,797 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5f773146 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 10:13:32, skipping insertion in model container [2019-11-15 22:13:32,798 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.11 10:13:32" (1/1) ... [2019-11-15 22:13:32,807 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-11-15 22:13:32,879 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-11-15 22:13:33,436 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-15 22:13:33,452 INFO L188 MainTranslator]: Completed pre-run [2019-11-15 22:13:33,541 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-15 22:13:33,601 INFO L192 MainTranslator]: Completed translation [2019-11-15 22:13:33,601 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 10:13:33 WrapperNode [2019-11-15 22:13:33,601 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-15 22:13:33,604 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-11-15 22:13:33,605 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-11-15 22:13:33,605 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-11-15 22:13:33,615 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 10:13:33" (1/1) ... [2019-11-15 22:13:33,635 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 10:13:33" (1/1) ... [2019-11-15 22:13:33,663 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-11-15 22:13:33,664 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-11-15 22:13:33,664 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-11-15 22:13:33,664 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-11-15 22:13:33,677 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 10:13:33" (1/1) ... [2019-11-15 22:13:33,677 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 10:13:33" (1/1) ... [2019-11-15 22:13:33,681 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 10:13:33" (1/1) ... [2019-11-15 22:13:33,682 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 10:13:33" (1/1) ... [2019-11-15 22:13:33,689 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 10:13:33" (1/1) ... [2019-11-15 22:13:33,695 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 10:13:33" (1/1) ... [2019-11-15 22:13:33,697 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 10:13:33" (1/1) ... [2019-11-15 22:13:33,700 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-11-15 22:13:33,700 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-11-15 22:13:33,700 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-11-15 22:13:33,700 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-11-15 22:13:33,701 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 10:13:33" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_f297173b-1aaf-4164-aac5-2e4426968557/bin/uautomizer/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-15 22:13:33,797 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2019-11-15 22:13:33,797 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-11-15 22:13:33,797 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-11-15 22:13:33,797 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-11-15 22:13:33,798 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-11-15 22:13:33,798 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-11-15 22:13:34,115 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-11-15 22:13:34,116 INFO L284 CfgBuilder]: Removed 9 assume(true) statements. [2019-11-15 22:13:34,117 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.11 10:13:34 BoogieIcfgContainer [2019-11-15 22:13:34,118 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-11-15 22:13:34,118 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2019-11-15 22:13:34,118 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2019-11-15 22:13:34,123 INFO L275 PluginConnector]: BuchiAutomizer initialized [2019-11-15 22:13:34,124 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-11-15 22:13:34,124 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 15.11 10:13:32" (1/3) ... [2019-11-15 22:13:34,126 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@5cdd3b1f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 15.11 10:13:34, skipping insertion in model container [2019-11-15 22:13:34,127 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-11-15 22:13:34,127 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 10:13:33" (2/3) ... [2019-11-15 22:13:34,127 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@5cdd3b1f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 15.11 10:13:34, skipping insertion in model container [2019-11-15 22:13:34,128 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-11-15 22:13:34,128 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.11 10:13:34" (3/3) ... [2019-11-15 22:13:34,130 INFO L371 chiAutomizerObserver]: Analyzing ICFG bubblesort-alloca-2.i [2019-11-15 22:13:34,230 INFO L356 BuchiCegarLoop]: Interprodecural is true [2019-11-15 22:13:34,230 INFO L357 BuchiCegarLoop]: Hoare is false [2019-11-15 22:13:34,230 INFO L358 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2019-11-15 22:13:34,230 INFO L359 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2019-11-15 22:13:34,230 INFO L360 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-11-15 22:13:34,230 INFO L361 BuchiCegarLoop]: Difference is false [2019-11-15 22:13:34,231 INFO L362 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-11-15 22:13:34,231 INFO L365 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2019-11-15 22:13:34,248 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 16 states. [2019-11-15 22:13:34,274 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 7 [2019-11-15 22:13:34,274 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-15 22:13:34,274 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-15 22:13:34,283 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1] [2019-11-15 22:13:34,283 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2019-11-15 22:13:34,283 INFO L424 BuchiCegarLoop]: ======== Iteration 1============ [2019-11-15 22:13:34,283 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 16 states. [2019-11-15 22:13:34,287 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 7 [2019-11-15 22:13:34,287 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-15 22:13:34,288 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-15 22:13:34,288 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1] [2019-11-15 22:13:34,288 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2019-11-15 22:13:34,298 INFO L791 eck$LassoCheckResult]: Stem: 10#ULTIMATE.startENTRYtrue #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 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 [2019-11-15 22:13:34,298 INFO L793 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 [2019-11-15 22:13:34,306 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:13:34,307 INFO L82 PathProgramCache]: Analyzing trace with hash 925669, now seen corresponding path program 1 times [2019-11-15 22:13:34,316 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 22:13:34,317 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [598677176] [2019-11-15 22:13:34,318 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:13:34,318 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:13:34,318 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 22:13:34,445 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 22:13:34,461 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 22:13:34,491 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-15 22:13:34,493 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:13:34,493 INFO L82 PathProgramCache]: Analyzing trace with hash 1507, now seen corresponding path program 1 times [2019-11-15 22:13:34,494 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 22:13:34,495 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2083217162] [2019-11-15 22:13:34,495 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:13:34,495 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:13:34,495 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 22:13:34,506 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 22:13:34,513 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 22:13:34,517 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-15 22:13:34,518 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:13:34,519 INFO L82 PathProgramCache]: Analyzing trace with hash 889568455, now seen corresponding path program 1 times [2019-11-15 22:13:34,519 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 22:13:34,519 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1021781413] [2019-11-15 22:13:34,520 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:13:34,520 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:13:34,520 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 22:13:34,545 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 22:13:34,566 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 22:13:34,575 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-15 22:13:34,857 INFO L210 LassoAnalysis]: Preferences: [2019-11-15 22:13:34,858 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-11-15 22:13:34,858 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-11-15 22:13:34,859 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-11-15 22:13:34,859 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2019-11-15 22:13:34,859 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-15 22:13:34,860 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-11-15 22:13:34,860 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-11-15 22:13:34,860 INFO L131 ssoRankerPreferences]: Filename of dumped script: bubblesort-alloca-2.i_Iteration1_Lasso [2019-11-15 22:13:34,860 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-11-15 22:13:34,861 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2019-11-15 22:13:34,896 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 22:13:35,045 WARN L191 SmtUtils]: Spent 108.00 ms on a formula simplification. DAG size of input: 34 DAG size of output: 32 [2019-11-15 22:13:35,106 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 22:13:35,111 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 22:13:35,114 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 22:13:35,121 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 22:13:35,125 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 22:13:35,129 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 22:13:35,133 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 22:13:35,140 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 22:13:35,555 INFO L292 LassoAnalysis]: Preprocessing complete. [2019-11-15 22:13:35,561 INFO L489 LassoAnalysis]: Using template 'affine'. [2019-11-15 22:13:35,564 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-15 22:13:35,567 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 22:13:35,567 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 22:13:35,568 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 22:13:35,568 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 22:13:35,569 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 22:13:35,571 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 22:13:35,572 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 22:13:35,581 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 22:13:35,584 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-15 22:13:35,588 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 22:13:35,588 INFO L202 nArgumentSynthesizer]: 2 stem disjuncts [2019-11-15 22:13:35,588 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 22:13:35,589 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 22:13:35,609 INFO L400 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2019-11-15 22:13:35,609 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-15 22:13:35,656 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 22:13:35,670 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-15 22:13:35,676 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 22:13:35,677 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 22:13:35,677 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 22:13:35,677 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 22:13:35,680 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-15 22:13:35,680 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-15 22:13:35,689 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 22:13:35,696 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-15 22:13:35,697 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 22:13:35,698 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 22:13:35,698 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 22:13:35,699 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 22:13:35,703 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-15 22:13:35,706 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-15 22:13:35,737 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 22:13:35,744 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-15 22:13:35,746 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 22:13:35,746 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 22:13:35,754 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 22:13:35,756 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 22:13:35,757 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 22:13:35,757 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 22:13:35,758 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 22:13:35,759 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 22:13:35,761 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-15 22:13:35,763 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 22:13:35,764 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 22:13:35,765 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 22:13:35,765 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 22:13:35,771 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-15 22:13:35,779 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-15 22:13:36,002 INFO L419 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-11-15 22:13:36,127 INFO L443 ModelExtractionUtils]: Simplification made 6 calls to the SMT solver. [2019-11-15 22:13:36,128 INFO L444 ModelExtractionUtils]: 14 out of 22 variables were initially zero. Simplification set additionally 4 variables to zero. [2019-11-15 22:13:36,131 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-11-15 22:13:36,140 INFO L438 nArgumentSynthesizer]: Removed 1 redundant supporting invariants from a total of 2. [2019-11-15 22:13:36,141 INFO L510 LassoAnalysis]: Proved termination. [2019-11-15 22:13:36,142 INFO L512 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~k~0, v_rep(select #length ULTIMATE.start_main_#t~malloc9.base)_1) = -4*ULTIMATE.start_main_~k~0 + 1*v_rep(select #length ULTIMATE.start_main_#t~malloc9.base)_1 Supporting invariants [1*ULTIMATE.start_main_~numbers~0.offset >= 0] [2019-11-15 22:13:36,164 INFO L297 tatePredicateManager]: 2 out of 4 supporting invariants were superfluous and have been removed [2019-11-15 22:13:36,187 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2019-11-15 22:13:36,244 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:13:36,269 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:13:36,272 INFO L256 TraceCheckSpWp]: Trace formula consists of 25 conjuncts, 6 conjunts are in the unsatisfiable core [2019-11-15 22:13:36,276 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 22:13:36,298 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:13:36,299 WARN L254 TraceCheckSpWp]: Trace formula consists of 13 conjuncts, 7 conjunts are in the unsatisfiable core [2019-11-15 22:13:36,300 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 22:13:36,352 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 22:13:36,375 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2019-11-15 22:13:36,376 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 16 states. Second operand 3 states. [2019-11-15 22:13:36,521 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 16 states.. Second operand 3 states. Result 35 states and 53 transitions. Complement of second has 8 states. [2019-11-15 22:13:36,522 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 5 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2019-11-15 22:13:36,524 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2019-11-15 22:13:36,525 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 34 transitions. [2019-11-15 22:13:36,527 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 34 transitions. Stem has 4 letters. Loop has 2 letters. [2019-11-15 22:13:36,529 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-15 22:13:36,529 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 34 transitions. Stem has 6 letters. Loop has 2 letters. [2019-11-15 22:13:36,529 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-15 22:13:36,530 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 34 transitions. Stem has 4 letters. Loop has 4 letters. [2019-11-15 22:13:36,530 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-15 22:13:36,532 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 35 states and 53 transitions. [2019-11-15 22:13:36,536 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2019-11-15 22:13:36,541 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 35 states to 13 states and 18 transitions. [2019-11-15 22:13:36,543 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 10 [2019-11-15 22:13:36,543 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 11 [2019-11-15 22:13:36,544 INFO L73 IsDeterministic]: Start isDeterministic. Operand 13 states and 18 transitions. [2019-11-15 22:13:36,545 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-11-15 22:13:36,545 INFO L688 BuchiCegarLoop]: Abstraction has 13 states and 18 transitions. [2019-11-15 22:13:36,568 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13 states and 18 transitions. [2019-11-15 22:13:36,580 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13 to 13. [2019-11-15 22:13:36,581 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2019-11-15 22:13:36,581 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 18 transitions. [2019-11-15 22:13:36,583 INFO L711 BuchiCegarLoop]: Abstraction has 13 states and 18 transitions. [2019-11-15 22:13:36,583 INFO L591 BuchiCegarLoop]: Abstraction has 13 states and 18 transitions. [2019-11-15 22:13:36,584 INFO L424 BuchiCegarLoop]: ======== Iteration 2============ [2019-11-15 22:13:36,584 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 13 states and 18 transitions. [2019-11-15 22:13:36,585 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2019-11-15 22:13:36,585 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-15 22:13:36,586 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-15 22:13:36,586 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1] [2019-11-15 22:13:36,587 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2019-11-15 22:13:36,587 INFO L791 eck$LassoCheckResult]: Stem: 120#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 118#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; 119#L527 assume !(main_~array_size~0 < 1 || main_~array_size~0 >= 536870911); 121#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; 122#L532-3 assume !(main_~k~0 < main_~array_size~0); 130#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; 129#L515-3 [2019-11-15 22:13:36,588 INFO L793 eck$LassoCheckResult]: Loop: 129#L515-3 assume !!(bubbleSort_~i~0 >= 0);bubbleSort_~j~0 := 1; 126#L516-3 assume !(bubbleSort_~j~0 <= bubbleSort_~i~0); 127#L515-2 bubbleSort_#t~post2 := bubbleSort_~i~0;bubbleSort_~i~0 := bubbleSort_#t~post2 - 1;havoc bubbleSort_#t~post2; 129#L515-3 [2019-11-15 22:13:36,588 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:13:36,588 INFO L82 PathProgramCache]: Analyzing trace with hash 889568397, now seen corresponding path program 1 times [2019-11-15 22:13:36,589 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 22:13:36,589 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [545444442] [2019-11-15 22:13:36,589 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:13:36,590 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:13:36,590 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 22:13:36,602 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:13:36,689 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 22:13:36,689 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [545444442] [2019-11-15 22:13:36,690 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 22:13:36,690 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-15 22:13:36,691 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1472044699] [2019-11-15 22:13:36,693 INFO L796 eck$LassoCheckResult]: stem already infeasible [2019-11-15 22:13:36,694 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:13:36,694 INFO L82 PathProgramCache]: Analyzing trace with hash 60779, now seen corresponding path program 1 times [2019-11-15 22:13:36,694 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 22:13:36,694 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [867325154] [2019-11-15 22:13:36,695 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:13:36,695 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:13:36,695 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 22:13:36,702 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 22:13:36,705 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 22:13:36,710 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-15 22:13:36,734 INFO L210 LassoAnalysis]: Preferences: [2019-11-15 22:13:36,735 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-11-15 22:13:36,735 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-11-15 22:13:36,735 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-11-15 22:13:36,735 INFO L127 ssoRankerPreferences]: Use exernal solver: true [2019-11-15 22:13:36,735 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-15 22:13:36,735 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-11-15 22:13:36,736 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-11-15 22:13:36,736 INFO L131 ssoRankerPreferences]: Filename of dumped script: bubblesort-alloca-2.i_Iteration2_Loop [2019-11-15 22:13:36,736 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-11-15 22:13:36,736 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2019-11-15 22:13:36,738 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 22:13:36,742 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 22:13:36,745 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 22:13:36,751 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 22:13:36,763 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 22:13:36,870 INFO L292 LassoAnalysis]: Preprocessing complete. [2019-11-15 22:13:36,871 INFO L404 LassoAnalysis]: Checking for nontermination... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_f297173b-1aaf-4164-aac5-2e4426968557/bin/uautomizer/z3 Starting monitored process 2 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-11-15 22:13:36,888 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-11-15 22:13:36,888 INFO L160 nArgumentSynthesizer]: Using integer mode. Waiting until toolchain timeout for monitored process 2 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-15 22:13:36,896 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2019-11-15 22:13:36,897 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_f297173b-1aaf-4164-aac5-2e4426968557/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) Waiting until toolchain timeout for monitored process 3 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-15 22:13:36,911 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-11-15 22:13:36,911 INFO L160 nArgumentSynthesizer]: Using integer mode. [2019-11-15 22:13:36,917 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2019-11-15 22:13:36,917 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_f297173b-1aaf-4164-aac5-2e4426968557/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) Waiting until toolchain timeout for monitored process 4 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-15 22:13:36,934 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-11-15 22:13:36,934 INFO L160 nArgumentSynthesizer]: Using integer mode. [2019-11-15 22:13:36,941 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2019-11-15 22:13:36,941 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_f297173b-1aaf-4164-aac5-2e4426968557/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 [2019-11-15 22:13:36,967 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-11-15 22:13:36,967 INFO L160 nArgumentSynthesizer]: Using integer mode. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_f297173b-1aaf-4164-aac5-2e4426968557/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 [2019-11-15 22:13:37,069 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2019-11-15 22:13:37,070 INFO L160 nArgumentSynthesizer]: Using integer mode. [2019-11-15 22:13:37,092 INFO L444 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2019-11-15 22:13:37,095 INFO L210 LassoAnalysis]: Preferences: [2019-11-15 22:13:37,095 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-11-15 22:13:37,095 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-11-15 22:13:37,095 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-11-15 22:13:37,095 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2019-11-15 22:13:37,096 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-15 22:13:37,096 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-11-15 22:13:37,096 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-11-15 22:13:37,096 INFO L131 ssoRankerPreferences]: Filename of dumped script: bubblesort-alloca-2.i_Iteration2_Loop [2019-11-15 22:13:37,096 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-11-15 22:13:37,096 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2019-11-15 22:13:37,098 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 22:13:37,116 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 22:13:37,126 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 22:13:37,144 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 22:13:37,151 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 22:13:37,264 INFO L292 LassoAnalysis]: Preprocessing complete. [2019-11-15 22:13:37,265 INFO L489 LassoAnalysis]: Using template 'affine'. [2019-11-15 22:13:37,265 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-15 22:13:37,266 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 22:13:37,266 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 22:13:37,267 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 22:13:37,267 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 22:13:37,267 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 22:13:37,268 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 22:13:37,268 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 22:13:37,269 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 22:13:37,269 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-15 22:13:37,275 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 22:13:37,275 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 22:13:37,276 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 22:13:37,276 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 22:13:37,277 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-15 22:13:37,278 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-15 22:13:37,281 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 22:13:37,282 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-15 22:13:37,283 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 22:13:37,284 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 22:13:37,284 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 22:13:37,284 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 22:13:37,284 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 22:13:37,285 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 22:13:37,286 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 22:13:37,294 INFO L419 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-11-15 22:13:37,298 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2019-11-15 22:13:37,300 INFO L444 ModelExtractionUtils]: 1 out of 4 variables were initially zero. Simplification set additionally 0 variables to zero. [2019-11-15 22:13:37,301 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-11-15 22:13:37,301 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2019-11-15 22:13:37,302 INFO L510 LassoAnalysis]: Proved termination. [2019-11-15 22:13:37,302 INFO L512 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_bubbleSort_~i~0) = 2*ULTIMATE.start_bubbleSort_~i~0 + 1 Supporting invariants [] [2019-11-15 22:13:37,303 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2019-11-15 22:13:37,335 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:13:37,355 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:13:37,356 INFO L256 TraceCheckSpWp]: Trace formula consists of 40 conjuncts, 2 conjunts are in the unsatisfiable core [2019-11-15 22:13:37,358 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 22:13:37,366 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:13:37,367 WARN L254 TraceCheckSpWp]: Trace formula consists of 8 conjuncts, 4 conjunts are in the unsatisfiable core [2019-11-15 22:13:37,367 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 22:13:37,392 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 22:13:37,393 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2019-11-15 22:13:37,393 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 13 states and 18 transitions. cyclomatic complexity: 7 Second operand 3 states. [2019-11-15 22:13:37,418 INFO L76 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. [2019-11-15 22:13:37,420 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 3 states 1 stem states 1 non-accepting loop states 1 accepting loop states [2019-11-15 22:13:37,421 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2019-11-15 22:13:37,421 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 16 transitions. [2019-11-15 22:13:37,421 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 16 transitions. Stem has 6 letters. Loop has 3 letters. [2019-11-15 22:13:37,422 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-15 22:13:37,422 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 16 transitions. Stem has 9 letters. Loop has 3 letters. [2019-11-15 22:13:37,422 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-15 22:13:37,422 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 16 transitions. Stem has 6 letters. Loop has 6 letters. [2019-11-15 22:13:37,423 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-15 22:13:37,423 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 19 states and 28 transitions. [2019-11-15 22:13:37,424 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2019-11-15 22:13:37,425 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 19 states to 18 states and 26 transitions. [2019-11-15 22:13:37,425 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 10 [2019-11-15 22:13:37,426 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 11 [2019-11-15 22:13:37,426 INFO L73 IsDeterministic]: Start isDeterministic. Operand 18 states and 26 transitions. [2019-11-15 22:13:37,426 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-11-15 22:13:37,426 INFO L688 BuchiCegarLoop]: Abstraction has 18 states and 26 transitions. [2019-11-15 22:13:37,427 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18 states and 26 transitions. [2019-11-15 22:13:37,428 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18 to 17. [2019-11-15 22:13:37,429 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2019-11-15 22:13:37,429 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 25 transitions. [2019-11-15 22:13:37,430 INFO L711 BuchiCegarLoop]: Abstraction has 17 states and 25 transitions. [2019-11-15 22:13:37,430 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 22:13:37,433 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-15 22:13:37,434 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-15 22:13:37,435 INFO L87 Difference]: Start difference. First operand 17 states and 25 transitions. Second operand 4 states. [2019-11-15 22:13:37,503 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 22:13:37,503 INFO L93 Difference]: Finished difference Result 18 states and 25 transitions. [2019-11-15 22:13:37,507 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-15 22:13:37,507 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 18 states and 25 transitions. [2019-11-15 22:13:37,508 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2019-11-15 22:13:37,509 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 18 states to 18 states and 25 transitions. [2019-11-15 22:13:37,509 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 10 [2019-11-15 22:13:37,510 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 10 [2019-11-15 22:13:37,510 INFO L73 IsDeterministic]: Start isDeterministic. Operand 18 states and 25 transitions. [2019-11-15 22:13:37,510 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-11-15 22:13:37,510 INFO L688 BuchiCegarLoop]: Abstraction has 18 states and 25 transitions. [2019-11-15 22:13:37,510 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18 states and 25 transitions. [2019-11-15 22:13:37,512 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18 to 17. [2019-11-15 22:13:37,512 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2019-11-15 22:13:37,513 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 24 transitions. [2019-11-15 22:13:37,513 INFO L711 BuchiCegarLoop]: Abstraction has 17 states and 24 transitions. [2019-11-15 22:13:37,513 INFO L591 BuchiCegarLoop]: Abstraction has 17 states and 24 transitions. [2019-11-15 22:13:37,513 INFO L424 BuchiCegarLoop]: ======== Iteration 3============ [2019-11-15 22:13:37,514 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 17 states and 24 transitions. [2019-11-15 22:13:37,515 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2019-11-15 22:13:37,517 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-15 22:13:37,517 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-15 22:13:37,518 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 22:13:37,518 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2019-11-15 22:13:37,522 INFO L791 eck$LassoCheckResult]: Stem: 234#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 232#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; 233#L527 assume !(main_~array_size~0 < 1 || main_~array_size~0 >= 536870911); 235#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; 236#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; 241#L532-2 main_#t~post10 := main_~k~0;main_~k~0 := 1 + main_#t~post10;havoc main_#t~post10; 242#L532-3 assume !(main_~k~0 < main_~array_size~0); 247#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; 248#L515-3 assume !!(bubbleSort_~i~0 >= 0);bubbleSort_~j~0 := 1; 238#L516-3 [2019-11-15 22:13:37,523 INFO L793 eck$LassoCheckResult]: Loop: 238#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); 243#L517 assume bubbleSort_#t~mem4 > bubbleSort_#t~mem5;havoc bubbleSort_#t~mem5;havoc bubbleSort_#t~mem4;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); 237#L516-2 bubbleSort_#t~post3 := bubbleSort_~j~0;bubbleSort_~j~0 := 1 + bubbleSort_#t~post3;havoc bubbleSort_#t~post3; 238#L516-3 [2019-11-15 22:13:37,524 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:13:37,524 INFO L82 PathProgramCache]: Analyzing trace with hash 1185641744, now seen corresponding path program 1 times [2019-11-15 22:13:37,525 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 22:13:37,525 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [480725561] [2019-11-15 22:13:37,525 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:13:37,526 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:13:37,526 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 22:13:37,546 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 22:13:37,569 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 22:13:37,582 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-15 22:13:37,584 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:13:37,584 INFO L82 PathProgramCache]: Analyzing trace with hash 68618, now seen corresponding path program 1 times [2019-11-15 22:13:37,585 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 22:13:37,585 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1294688539] [2019-11-15 22:13:37,585 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:13:37,585 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:13:37,586 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 22:13:37,599 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 22:13:37,608 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 22:13:37,614 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-15 22:13:37,615 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:13:37,615 INFO L82 PathProgramCache]: Analyzing trace with hash -357807973, now seen corresponding path program 1 times [2019-11-15 22:13:37,615 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 22:13:37,616 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1853402643] [2019-11-15 22:13:37,616 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:13:37,616 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:13:37,617 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 22:13:37,642 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:13:37,734 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 22:13:37,735 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1853402643] [2019-11-15 22:13:37,735 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2118867562] [2019-11-15 22:13:37,735 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_f297173b-1aaf-4164-aac5-2e4426968557/bin/uautomizer/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-15 22:13:37,822 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:13:37,823 INFO L256 TraceCheckSpWp]: Trace formula consists of 74 conjuncts, 8 conjunts are in the unsatisfiable core [2019-11-15 22:13:37,824 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 22:13:37,937 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 22:13:37,937 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-15 22:13:37,937 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 7] total 11 [2019-11-15 22:13:37,938 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1605742035] [2019-11-15 22:13:38,081 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 22:13:38,082 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-11-15 22:13:38,082 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2019-11-15 22:13:38,082 INFO L87 Difference]: Start difference. First operand 17 states and 24 transitions. cyclomatic complexity: 10 Second operand 11 states. [2019-11-15 22:13:38,331 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 22:13:38,331 INFO L93 Difference]: Finished difference Result 30 states and 40 transitions. [2019-11-15 22:13:38,332 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-11-15 22:13:38,332 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 30 states and 40 transitions. [2019-11-15 22:13:38,334 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2019-11-15 22:13:38,335 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 30 states to 20 states and 26 transitions. [2019-11-15 22:13:38,335 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 10 [2019-11-15 22:13:38,335 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 10 [2019-11-15 22:13:38,335 INFO L73 IsDeterministic]: Start isDeterministic. Operand 20 states and 26 transitions. [2019-11-15 22:13:38,335 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-11-15 22:13:38,336 INFO L688 BuchiCegarLoop]: Abstraction has 20 states and 26 transitions. [2019-11-15 22:13:38,336 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20 states and 26 transitions. [2019-11-15 22:13:38,337 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20 to 19. [2019-11-15 22:13:38,338 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2019-11-15 22:13:38,338 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 25 transitions. [2019-11-15 22:13:38,338 INFO L711 BuchiCegarLoop]: Abstraction has 19 states and 25 transitions. [2019-11-15 22:13:38,339 INFO L591 BuchiCegarLoop]: Abstraction has 19 states and 25 transitions. [2019-11-15 22:13:38,339 INFO L424 BuchiCegarLoop]: ======== Iteration 4============ [2019-11-15 22:13:38,339 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 19 states and 25 transitions. [2019-11-15 22:13:38,340 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2019-11-15 22:13:38,340 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-15 22:13:38,340 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-15 22:13:38,341 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 22:13:38,341 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2019-11-15 22:13:38,341 INFO L791 eck$LassoCheckResult]: Stem: 338#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 336#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; 337#L527 assume !(main_~array_size~0 < 1 || main_~array_size~0 >= 536870911); 339#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; 340#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; 341#L532-2 main_#t~post10 := main_~k~0;main_~k~0 := 1 + main_#t~post10;havoc main_#t~post10; 342#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; 351#L532-2 main_#t~post10 := main_~k~0;main_~k~0 := 1 + main_#t~post10;havoc main_#t~post10; 354#L532-3 assume !(main_~k~0 < main_~array_size~0); 352#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; 353#L515-3 assume !!(bubbleSort_~i~0 >= 0);bubbleSort_~j~0 := 1; 344#L516-3 [2019-11-15 22:13:38,341 INFO L793 eck$LassoCheckResult]: Loop: 344#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); 347#L517 assume bubbleSort_#t~mem4 > bubbleSort_#t~mem5;havoc bubbleSort_#t~mem5;havoc bubbleSort_#t~mem4;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); 343#L516-2 bubbleSort_#t~post3 := bubbleSort_~j~0;bubbleSort_~j~0 := 1 + bubbleSort_#t~post3;havoc bubbleSort_#t~post3; 344#L516-3 [2019-11-15 22:13:38,341 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:13:38,342 INFO L82 PathProgramCache]: Analyzing trace with hash 1237095790, now seen corresponding path program 2 times [2019-11-15 22:13:38,342 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 22:13:38,343 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [819454853] [2019-11-15 22:13:38,343 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:13:38,343 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:13:38,343 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 22:13:38,356 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 22:13:38,370 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 22:13:38,384 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-15 22:13:38,385 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:13:38,385 INFO L82 PathProgramCache]: Analyzing trace with hash 68618, now seen corresponding path program 2 times [2019-11-15 22:13:38,385 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 22:13:38,386 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [119257478] [2019-11-15 22:13:38,386 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:13:38,386 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:13:38,386 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 22:13:38,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 22:13:38,407 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 22:13:38,410 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-15 22:13:38,413 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:13:38,413 INFO L82 PathProgramCache]: Analyzing trace with hash -793648259, now seen corresponding path program 2 times [2019-11-15 22:13:38,413 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 22:13:38,413 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2079477606] [2019-11-15 22:13:38,414 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:13:38,414 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:13:38,414 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 22:13:38,445 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 22:13:38,467 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 22:13:38,482 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-15 22:13:38,990 WARN L191 SmtUtils]: Spent 365.00 ms on a formula simplification. DAG size of input: 102 DAG size of output: 82 [2019-11-15 22:13:39,101 INFO L210 LassoAnalysis]: Preferences: [2019-11-15 22:13:39,101 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-11-15 22:13:39,101 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-11-15 22:13:39,101 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-11-15 22:13:39,101 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2019-11-15 22:13:39,102 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-15 22:13:39,102 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-11-15 22:13:39,102 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-11-15 22:13:39,102 INFO L131 ssoRankerPreferences]: Filename of dumped script: bubblesort-alloca-2.i_Iteration4_Lasso [2019-11-15 22:13:39,102 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-11-15 22:13:39,102 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2019-11-15 22:13:39,107 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 22:13:39,109 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 22:13:39,119 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 22:13:39,122 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 22:13:39,324 WARN L191 SmtUtils]: Spent 175.00 ms on a formula simplification. DAG size of input: 53 DAG size of output: 50 [2019-11-15 22:13:39,400 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 22:13:39,404 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 22:13:39,406 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 22:13:39,409 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 22:13:39,413 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 22:13:39,415 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 22:13:39,418 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 22:13:39,420 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 22:13:39,424 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 22:13:39,427 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 22:13:39,430 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 22:13:39,433 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 22:13:39,925 INFO L292 LassoAnalysis]: Preprocessing complete. [2019-11-15 22:13:39,925 INFO L489 LassoAnalysis]: Using template 'affine'. [2019-11-15 22:13:39,925 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-15 22:13:39,926 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 22:13:39,926 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 22:13:39,927 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 22:13:39,927 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 22:13:39,927 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 22:13:39,927 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 22:13:39,927 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 22:13:39,928 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 22:13:39,929 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-15 22:13:39,929 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 22:13:39,929 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 22:13:39,929 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 22:13:39,930 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 22:13:39,931 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-15 22:13:39,931 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-15 22:13:39,934 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 22:13:39,935 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-15 22:13:39,935 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 22:13:39,936 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 22:13:39,936 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 22:13:39,936 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 22:13:39,937 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 22:13:39,937 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 22:13:39,937 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 22:13:39,938 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 22:13:39,939 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-15 22:13:39,939 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 22:13:39,940 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 22:13:39,940 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 22:13:39,940 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 22:13:39,945 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-15 22:13:39,946 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-15 22:13:39,983 INFO L419 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-11-15 22:13:39,998 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2019-11-15 22:13:39,998 INFO L444 ModelExtractionUtils]: 36 out of 40 variables were initially zero. Simplification set additionally 0 variables to zero. [2019-11-15 22:13:39,998 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-11-15 22:13:39,999 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2019-11-15 22:13:40,000 INFO L510 LassoAnalysis]: Proved termination. [2019-11-15 22:13:40,000 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 [] [2019-11-15 22:13:40,019 INFO L297 tatePredicateManager]: 4 out of 4 supporting invariants were superfluous and have been removed [2019-11-15 22:13:40,039 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:13:40,058 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:13:40,060 INFO L256 TraceCheckSpWp]: Trace formula consists of 59 conjuncts, 2 conjunts are in the unsatisfiable core [2019-11-15 22:13:40,061 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 22:13:40,074 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:13:40,075 INFO L256 TraceCheckSpWp]: Trace formula consists of 25 conjuncts, 4 conjunts are in the unsatisfiable core [2019-11-15 22:13:40,075 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 22:13:40,095 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 22:13:40,096 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2019-11-15 22:13:40,096 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 19 states and 25 transitions. cyclomatic complexity: 9 Second operand 3 states. [2019-11-15 22:13:40,128 INFO L76 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. [2019-11-15 22:13:40,129 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2019-11-15 22:13:40,129 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2019-11-15 22:13:40,130 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 15 transitions. [2019-11-15 22:13:40,130 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 15 transitions. Stem has 11 letters. Loop has 3 letters. [2019-11-15 22:13:40,131 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-15 22:13:40,131 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 15 transitions. Stem has 14 letters. Loop has 3 letters. [2019-11-15 22:13:40,131 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-15 22:13:40,131 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 15 transitions. Stem has 11 letters. Loop has 6 letters. [2019-11-15 22:13:40,132 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-15 22:13:40,132 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 34 states and 47 transitions. [2019-11-15 22:13:40,134 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2019-11-15 22:13:40,134 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 34 states to 24 states and 32 transitions. [2019-11-15 22:13:40,135 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 10 [2019-11-15 22:13:40,135 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 10 [2019-11-15 22:13:40,135 INFO L73 IsDeterministic]: Start isDeterministic. Operand 24 states and 32 transitions. [2019-11-15 22:13:40,135 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-11-15 22:13:40,135 INFO L688 BuchiCegarLoop]: Abstraction has 24 states and 32 transitions. [2019-11-15 22:13:40,135 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states and 32 transitions. [2019-11-15 22:13:40,137 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 19. [2019-11-15 22:13:40,137 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2019-11-15 22:13:40,138 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 24 transitions. [2019-11-15 22:13:40,138 INFO L711 BuchiCegarLoop]: Abstraction has 19 states and 24 transitions. [2019-11-15 22:13:40,138 INFO L591 BuchiCegarLoop]: Abstraction has 19 states and 24 transitions. [2019-11-15 22:13:40,138 INFO L424 BuchiCegarLoop]: ======== Iteration 5============ [2019-11-15 22:13:40,138 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 19 states and 24 transitions. [2019-11-15 22:13:40,139 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2019-11-15 22:13:40,139 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-15 22:13:40,140 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-15 22:13:40,140 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 22:13:40,141 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2019-11-15 22:13:40,141 INFO L791 eck$LassoCheckResult]: Stem: 473#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 471#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; 472#L527 assume !(main_~array_size~0 < 1 || main_~array_size~0 >= 536870911); 474#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; 475#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; 480#L532-2 main_#t~post10 := main_~k~0;main_~k~0 := 1 + main_#t~post10;havoc main_#t~post10; 481#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; 484#L532-2 main_#t~post10 := main_~k~0;main_~k~0 := 1 + main_#t~post10;havoc main_#t~post10; 489#L532-3 assume !(main_~k~0 < main_~array_size~0); 488#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; 487#L515-3 assume !!(bubbleSort_~i~0 >= 0);bubbleSort_~j~0 := 1; 479#L516-3 assume !(bubbleSort_~j~0 <= bubbleSort_~i~0); 482#L515-2 bubbleSort_#t~post2 := bubbleSort_~i~0;bubbleSort_~i~0 := bubbleSort_#t~post2 - 1;havoc bubbleSort_#t~post2; 483#L515-3 assume !!(bubbleSort_~i~0 >= 0);bubbleSort_~j~0 := 1; 477#L516-3 [2019-11-15 22:13:40,141 INFO L793 eck$LassoCheckResult]: Loop: 477#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); 485#L517 assume bubbleSort_#t~mem4 > bubbleSort_#t~mem5;havoc bubbleSort_#t~mem5;havoc bubbleSort_#t~mem4;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); 476#L516-2 bubbleSort_#t~post3 := bubbleSort_~j~0;bubbleSort_~j~0 := 1 + bubbleSort_#t~post3;havoc bubbleSort_#t~post3; 477#L516-3 [2019-11-15 22:13:40,141 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:13:40,141 INFO L82 PathProgramCache]: Analyzing trace with hash -793649948, now seen corresponding path program 1 times [2019-11-15 22:13:40,143 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 22:13:40,143 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [231137127] [2019-11-15 22:13:40,143 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:13:40,143 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:13:40,144 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 22:13:40,150 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:13:40,271 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 3 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 22:13:40,271 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [231137127] [2019-11-15 22:13:40,272 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [750954223] [2019-11-15 22:13:40,272 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_f297173b-1aaf-4164-aac5-2e4426968557/bin/uautomizer/z3 Starting monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-15 22:13:40,348 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:13:40,349 INFO L256 TraceCheckSpWp]: Trace formula consists of 65 conjuncts, 8 conjunts are in the unsatisfiable core [2019-11-15 22:13:40,350 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 22:13:40,420 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 2 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 22:13:40,420 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-15 22:13:40,420 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 7] total 12 [2019-11-15 22:13:40,421 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1814629342] [2019-11-15 22:13:40,421 INFO L796 eck$LassoCheckResult]: stem already infeasible [2019-11-15 22:13:40,422 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:13:40,422 INFO L82 PathProgramCache]: Analyzing trace with hash 68618, now seen corresponding path program 3 times [2019-11-15 22:13:40,422 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 22:13:40,423 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1240867265] [2019-11-15 22:13:40,423 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:13:40,423 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:13:40,423 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 22:13:40,436 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 22:13:40,444 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 22:13:40,447 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-15 22:13:40,565 WARN L191 SmtUtils]: Spent 116.00 ms on a formula simplification. DAG size of input: 44 DAG size of output: 41 [2019-11-15 22:13:40,605 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 22:13:40,606 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-11-15 22:13:40,606 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=99, Unknown=0, NotChecked=0, Total=132 [2019-11-15 22:13:40,606 INFO L87 Difference]: Start difference. First operand 19 states and 24 transitions. cyclomatic complexity: 8 Second operand 12 states. [2019-11-15 22:13:40,747 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 22:13:40,747 INFO L93 Difference]: Finished difference Result 26 states and 34 transitions. [2019-11-15 22:13:40,747 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-11-15 22:13:40,748 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 26 states and 34 transitions. [2019-11-15 22:13:40,748 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2019-11-15 22:13:40,749 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 26 states to 26 states and 34 transitions. [2019-11-15 22:13:40,749 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 10 [2019-11-15 22:13:40,750 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 10 [2019-11-15 22:13:40,750 INFO L73 IsDeterministic]: Start isDeterministic. Operand 26 states and 34 transitions. [2019-11-15 22:13:40,750 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-11-15 22:13:40,750 INFO L688 BuchiCegarLoop]: Abstraction has 26 states and 34 transitions. [2019-11-15 22:13:40,750 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states and 34 transitions. [2019-11-15 22:13:40,752 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 20. [2019-11-15 22:13:40,752 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2019-11-15 22:13:40,753 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 25 transitions. [2019-11-15 22:13:40,753 INFO L711 BuchiCegarLoop]: Abstraction has 20 states and 25 transitions. [2019-11-15 22:13:40,753 INFO L591 BuchiCegarLoop]: Abstraction has 20 states and 25 transitions. [2019-11-15 22:13:40,753 INFO L424 BuchiCegarLoop]: ======== Iteration 6============ [2019-11-15 22:13:40,753 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 20 states and 25 transitions. [2019-11-15 22:13:40,754 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2019-11-15 22:13:40,754 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-15 22:13:40,754 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-15 22:13:40,755 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 22:13:40,755 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2019-11-15 22:13:40,756 INFO L791 eck$LassoCheckResult]: Stem: 578#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 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~mem5;havoc bubbleSort_#t~mem4; 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 [2019-11-15 22:13:40,756 INFO L793 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~mem5;havoc bubbleSort_#t~mem4;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 [2019-11-15 22:13:40,756 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:13:40,756 INFO L82 PathProgramCache]: Analyzing trace with hash 221564791, now seen corresponding path program 1 times [2019-11-15 22:13:40,757 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 22:13:40,757 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [950071852] [2019-11-15 22:13:40,757 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:13:40,757 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:13:40,758 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 22:13:40,767 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 22:13:40,777 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 22:13:40,781 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-15 22:13:40,782 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:13:40,782 INFO L82 PathProgramCache]: Analyzing trace with hash 68618, now seen corresponding path program 4 times [2019-11-15 22:13:40,783 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 22:13:40,783 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [136862928] [2019-11-15 22:13:40,783 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:13:40,783 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:13:40,783 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 22:13:40,788 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 22:13:40,791 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 22:13:40,793 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-15 22:13:40,793 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:13:40,793 INFO L82 PathProgramCache]: Analyzing trace with hash -728006444, now seen corresponding path program 1 times [2019-11-15 22:13:40,794 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 22:13:40,794 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2095527271] [2019-11-15 22:13:40,794 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:13:40,794 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:13:40,794 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 22:13:40,803 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:13:40,872 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 5 proven. 4 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-11-15 22:13:40,872 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2095527271] [2019-11-15 22:13:40,873 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [839350570] [2019-11-15 22:13:40,873 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_f297173b-1aaf-4164-aac5-2e4426968557/bin/uautomizer/z3 Starting monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-15 22:13:40,951 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:13:40,952 INFO L256 TraceCheckSpWp]: Trace formula consists of 102 conjuncts, 10 conjunts are in the unsatisfiable core [2019-11-15 22:13:40,954 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 22:13:41,055 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 5 proven. 4 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-11-15 22:13:41,055 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-15 22:13:41,055 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 9] total 15 [2019-11-15 22:13:41,056 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1284861097] [2019-11-15 22:13:41,161 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 22:13:41,162 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2019-11-15 22:13:41,162 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=163, Unknown=0, NotChecked=0, Total=210 [2019-11-15 22:13:41,162 INFO L87 Difference]: Start difference. First operand 20 states and 25 transitions. cyclomatic complexity: 8 Second operand 15 states. [2019-11-15 22:13:41,358 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 22:13:41,358 INFO L93 Difference]: Finished difference Result 35 states and 44 transitions. [2019-11-15 22:13:41,359 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-11-15 22:13:41,359 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 35 states and 44 transitions. [2019-11-15 22:13:41,360 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2019-11-15 22:13:41,361 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 35 states to 23 states and 28 transitions. [2019-11-15 22:13:41,361 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 10 [2019-11-15 22:13:41,361 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 10 [2019-11-15 22:13:41,361 INFO L73 IsDeterministic]: Start isDeterministic. Operand 23 states and 28 transitions. [2019-11-15 22:13:41,361 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-11-15 22:13:41,361 INFO L688 BuchiCegarLoop]: Abstraction has 23 states and 28 transitions. [2019-11-15 22:13:41,362 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states and 28 transitions. [2019-11-15 22:13:41,363 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 22. [2019-11-15 22:13:41,363 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22 states. [2019-11-15 22:13:41,364 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 27 transitions. [2019-11-15 22:13:41,364 INFO L711 BuchiCegarLoop]: Abstraction has 22 states and 27 transitions. [2019-11-15 22:13:41,364 INFO L591 BuchiCegarLoop]: Abstraction has 22 states and 27 transitions. [2019-11-15 22:13:41,364 INFO L424 BuchiCegarLoop]: ======== Iteration 7============ [2019-11-15 22:13:41,364 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 22 states and 27 transitions. [2019-11-15 22:13:41,365 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2019-11-15 22:13:41,365 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-15 22:13:41,365 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-15 22:13:41,366 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 22:13:41,366 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2019-11-15 22:13:41,366 INFO L791 eck$LassoCheckResult]: Stem: 718#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 716#L-1 havoc main_#res;havoc main_#t~nondet8, main_#t~malloc9.base, main_#t~malloc9.offset, main_#t~nondet11, main_#t~post10, main_~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; 717#L527 assume !(main_~array_size~0 < 1 || main_~array_size~0 >= 536870911); 719#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; 720#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; 721#L532-2 main_#t~post10 := main_~k~0;main_~k~0 := 1 + main_#t~post10;havoc main_#t~post10; 722#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; 729#L532-2 main_#t~post10 := main_~k~0;main_~k~0 := 1 + main_#t~post10;havoc main_#t~post10; 737#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; 736#L532-2 main_#t~post10 := main_~k~0;main_~k~0 := 1 + main_#t~post10;havoc main_#t~post10; 735#L532-3 assume !(main_~k~0 < main_~array_size~0); 734#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; 733#L515-3 assume !!(bubbleSort_~i~0 >= 0);bubbleSort_~j~0 := 1; 731#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); 732#L517 assume !(bubbleSort_#t~mem4 > bubbleSort_#t~mem5);havoc bubbleSort_#t~mem5;havoc bubbleSort_#t~mem4; 725#L516-2 bubbleSort_#t~post3 := bubbleSort_~j~0;bubbleSort_~j~0 := 1 + bubbleSort_#t~post3;havoc bubbleSort_#t~post3; 726#L516-3 assume !(bubbleSort_~j~0 <= bubbleSort_~i~0); 727#L515-2 bubbleSort_#t~post2 := bubbleSort_~i~0;bubbleSort_~i~0 := bubbleSort_#t~post2 - 1;havoc bubbleSort_#t~post2; 728#L515-3 assume !!(bubbleSort_~i~0 >= 0);bubbleSort_~j~0 := 1; 724#L516-3 [2019-11-15 22:13:41,366 INFO L793 eck$LassoCheckResult]: Loop: 724#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); 730#L517 assume bubbleSort_#t~mem4 > bubbleSort_#t~mem5;havoc bubbleSort_#t~mem5;havoc bubbleSort_#t~mem4;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); 723#L516-2 bubbleSort_#t~post3 := bubbleSort_~j~0;bubbleSort_~j~0 := 1 + bubbleSort_#t~post3;havoc bubbleSort_#t~post3; 724#L516-3 [2019-11-15 22:13:41,366 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:13:41,366 INFO L82 PathProgramCache]: Analyzing trace with hash 1850126805, now seen corresponding path program 2 times [2019-11-15 22:13:41,367 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 22:13:41,367 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [962355759] [2019-11-15 22:13:41,367 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:13:41,367 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:13:41,367 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 22:13:41,379 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:13:41,511 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 6 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 22:13:41,511 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [962355759] [2019-11-15 22:13:41,511 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1841781783] [2019-11-15 22:13:41,512 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_f297173b-1aaf-4164-aac5-2e4426968557/bin/uautomizer/z3 Starting monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-15 22:13:41,602 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-11-15 22:13:41,603 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-15 22:13:41,604 INFO L256 TraceCheckSpWp]: Trace formula consists of 87 conjuncts, 10 conjunts are in the unsatisfiable core [2019-11-15 22:13:41,605 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 22:13:41,705 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 5 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 22:13:41,705 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-15 22:13:41,705 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 9] total 16 [2019-11-15 22:13:41,706 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1889322912] [2019-11-15 22:13:41,706 INFO L796 eck$LassoCheckResult]: stem already infeasible [2019-11-15 22:13:41,706 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:13:41,706 INFO L82 PathProgramCache]: Analyzing trace with hash 68618, now seen corresponding path program 5 times [2019-11-15 22:13:41,707 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 22:13:41,707 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [477065344] [2019-11-15 22:13:41,707 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:13:41,707 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:13:41,707 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 22:13:41,711 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 22:13:41,713 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 22:13:41,715 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-15 22:13:41,832 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 22:13:41,833 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2019-11-15 22:13:41,833 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=185, Unknown=0, NotChecked=0, Total=240 [2019-11-15 22:13:41,833 INFO L87 Difference]: Start difference. First operand 22 states and 27 transitions. cyclomatic complexity: 8 Second operand 16 states. [2019-11-15 22:13:42,064 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 22:13:42,065 INFO L93 Difference]: Finished difference Result 31 states and 40 transitions. [2019-11-15 22:13:42,066 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-11-15 22:13:42,066 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 31 states and 40 transitions. [2019-11-15 22:13:42,067 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2019-11-15 22:13:42,068 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 31 states to 31 states and 40 transitions. [2019-11-15 22:13:42,068 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 10 [2019-11-15 22:13:42,068 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 10 [2019-11-15 22:13:42,068 INFO L73 IsDeterministic]: Start isDeterministic. Operand 31 states and 40 transitions. [2019-11-15 22:13:42,068 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-11-15 22:13:42,068 INFO L688 BuchiCegarLoop]: Abstraction has 31 states and 40 transitions. [2019-11-15 22:13:42,069 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states and 40 transitions. [2019-11-15 22:13:42,070 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 25. [2019-11-15 22:13:42,071 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25 states. [2019-11-15 22:13:42,071 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 31 transitions. [2019-11-15 22:13:42,071 INFO L711 BuchiCegarLoop]: Abstraction has 25 states and 31 transitions. [2019-11-15 22:13:42,071 INFO L591 BuchiCegarLoop]: Abstraction has 25 states and 31 transitions. [2019-11-15 22:13:42,071 INFO L424 BuchiCegarLoop]: ======== Iteration 8============ [2019-11-15 22:13:42,072 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 25 states and 31 transitions. [2019-11-15 22:13:42,072 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2019-11-15 22:13:42,072 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-15 22:13:42,072 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-15 22:13:42,073 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 22:13:42,073 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2019-11-15 22:13:42,076 INFO L791 eck$LassoCheckResult]: Stem: 856#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 854#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; 855#L527 assume !(main_~array_size~0 < 1 || main_~array_size~0 >= 536870911); 857#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; 858#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; 863#L532-2 main_#t~post10 := main_~k~0;main_~k~0 := 1 + main_#t~post10;havoc main_#t~post10; 864#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; 870#L532-2 main_#t~post10 := main_~k~0;main_~k~0 := 1 + main_#t~post10;havoc main_#t~post10; 876#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; 875#L532-2 main_#t~post10 := main_~k~0;main_~k~0 := 1 + main_#t~post10;havoc main_#t~post10; 874#L532-3 assume !(main_~k~0 < main_~array_size~0); 873#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; 871#L515-3 assume !!(bubbleSort_~i~0 >= 0);bubbleSort_~j~0 := 1; 872#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); 878#L517 assume !(bubbleSort_#t~mem4 > bubbleSort_#t~mem5);havoc bubbleSort_#t~mem5;havoc bubbleSort_#t~mem4; 877#L516-2 bubbleSort_#t~post3 := bubbleSort_~j~0;bubbleSort_~j~0 := 1 + bubbleSort_#t~post3;havoc bubbleSort_#t~post3; 866#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); 867#L517 assume !(bubbleSort_#t~mem4 > bubbleSort_#t~mem5);havoc bubbleSort_#t~mem5;havoc bubbleSort_#t~mem4; 861#L516-2 bubbleSort_#t~post3 := bubbleSort_~j~0;bubbleSort_~j~0 := 1 + bubbleSort_#t~post3;havoc bubbleSort_#t~post3; 862#L516-3 assume !(bubbleSort_~j~0 <= bubbleSort_~i~0); 868#L515-2 bubbleSort_#t~post2 := bubbleSort_~i~0;bubbleSort_~i~0 := bubbleSort_#t~post2 - 1;havoc bubbleSort_#t~post2; 869#L515-3 assume !!(bubbleSort_~i~0 >= 0);bubbleSort_~j~0 := 1; 860#L516-3 [2019-11-15 22:13:42,077 INFO L793 eck$LassoCheckResult]: Loop: 860#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); 865#L517 assume bubbleSort_#t~mem4 > bubbleSort_#t~mem5;havoc bubbleSort_#t~mem5;havoc bubbleSort_#t~mem4;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); 859#L516-2 bubbleSort_#t~post3 := bubbleSort_~j~0;bubbleSort_~j~0 := 1 + bubbleSort_#t~post3;havoc bubbleSort_#t~post3; 860#L516-3 [2019-11-15 22:13:42,077 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:13:42,077 INFO L82 PathProgramCache]: Analyzing trace with hash -135460634, now seen corresponding path program 3 times [2019-11-15 22:13:42,078 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 22:13:42,079 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1705046865] [2019-11-15 22:13:42,079 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:13:42,079 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:13:42,079 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 22:13:42,115 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 22:13:42,140 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 22:13:42,145 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-15 22:13:42,145 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:13:42,146 INFO L82 PathProgramCache]: Analyzing trace with hash 68618, now seen corresponding path program 6 times [2019-11-15 22:13:42,146 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 22:13:42,146 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1119406819] [2019-11-15 22:13:42,146 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:13:42,147 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:13:42,147 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 22:13:42,150 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 22:13:42,153 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 22:13:42,155 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-15 22:13:42,155 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:13:42,155 INFO L82 PathProgramCache]: Analyzing trace with hash 1761549573, now seen corresponding path program 2 times [2019-11-15 22:13:42,156 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 22:13:42,156 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [318383849] [2019-11-15 22:13:42,156 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:13:42,156 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:13:42,157 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 22:13:42,181 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:13:42,453 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 6 proven. 14 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-11-15 22:13:42,453 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [318383849] [2019-11-15 22:13:42,453 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [51479370] [2019-11-15 22:13:42,453 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_f297173b-1aaf-4164-aac5-2e4426968557/bin/uautomizer/z3 Starting monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-15 22:13:42,539 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-11-15 22:13:42,539 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-15 22:13:42,541 INFO L256 TraceCheckSpWp]: Trace formula consists of 124 conjuncts, 18 conjunts are in the unsatisfiable core [2019-11-15 22:13:42,543 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 22:13:42,654 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 22:13:42,654 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 26 treesize of output 10 [2019-11-15 22:13:42,656 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 22:13:42,660 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 22:13:42,660 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-15 22:13:42,661 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:26, output treesize:3 [2019-11-15 22:13:42,676 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 6 proven. 5 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2019-11-15 22:13:42,677 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-15 22:13:42,677 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 9] total 13 [2019-11-15 22:13:42,677 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1388918227] [2019-11-15 22:13:42,802 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 22:13:42,802 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-11-15 22:13:42,802 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=119, Unknown=0, NotChecked=0, Total=156 [2019-11-15 22:13:42,802 INFO L87 Difference]: Start difference. First operand 25 states and 31 transitions. cyclomatic complexity: 9 Second operand 13 states. [2019-11-15 22:13:43,040 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 22:13:43,041 INFO L93 Difference]: Finished difference Result 47 states and 63 transitions. [2019-11-15 22:13:43,041 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-11-15 22:13:43,041 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 47 states and 63 transitions. [2019-11-15 22:13:43,043 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 6 [2019-11-15 22:13:43,044 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 47 states to 47 states and 63 transitions. [2019-11-15 22:13:43,044 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 18 [2019-11-15 22:13:43,044 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 18 [2019-11-15 22:13:43,044 INFO L73 IsDeterministic]: Start isDeterministic. Operand 47 states and 63 transitions. [2019-11-15 22:13:43,045 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-11-15 22:13:43,045 INFO L688 BuchiCegarLoop]: Abstraction has 47 states and 63 transitions. [2019-11-15 22:13:43,045 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states and 63 transitions. [2019-11-15 22:13:43,048 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 36. [2019-11-15 22:13:43,048 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36 states. [2019-11-15 22:13:43,048 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 48 transitions. [2019-11-15 22:13:43,049 INFO L711 BuchiCegarLoop]: Abstraction has 36 states and 48 transitions. [2019-11-15 22:13:43,049 INFO L591 BuchiCegarLoop]: Abstraction has 36 states and 48 transitions. [2019-11-15 22:13:43,049 INFO L424 BuchiCegarLoop]: ======== Iteration 9============ [2019-11-15 22:13:43,049 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 36 states and 48 transitions. [2019-11-15 22:13:43,050 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2019-11-15 22:13:43,050 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-15 22:13:43,050 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-15 22:13:43,051 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 22:13:43,051 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2019-11-15 22:13:43,051 INFO L791 eck$LassoCheckResult]: Stem: 1030#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 1028#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; 1029#L527 assume !(main_~array_size~0 < 1 || main_~array_size~0 >= 536870911); 1031#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; 1032#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; 1037#L532-2 main_#t~post10 := main_~k~0;main_~k~0 := 1 + main_#t~post10;havoc main_#t~post10; 1038#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; 1042#L532-2 main_#t~post10 := main_~k~0;main_~k~0 := 1 + main_#t~post10;havoc main_#t~post10; 1053#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; 1052#L532-2 main_#t~post10 := main_~k~0;main_~k~0 := 1 + main_#t~post10;havoc main_#t~post10; 1051#L532-3 assume !(main_~k~0 < main_~array_size~0); 1045#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; 1046#L515-3 assume !!(bubbleSort_~i~0 >= 0);bubbleSort_~j~0 := 1; 1040#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); 1041#L517 assume !(bubbleSort_#t~mem4 > bubbleSort_#t~mem5);havoc bubbleSort_#t~mem5;havoc bubbleSort_#t~mem4; 1035#L516-2 bubbleSort_#t~post3 := bubbleSort_~j~0;bubbleSort_~j~0 := 1 + bubbleSort_#t~post3;havoc bubbleSort_#t~post3; 1036#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); 1062#L517 assume bubbleSort_#t~mem4 > bubbleSort_#t~mem5;havoc bubbleSort_#t~mem5;havoc bubbleSort_#t~mem4;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); 1060#L516-2 bubbleSort_#t~post3 := bubbleSort_~j~0;bubbleSort_~j~0 := 1 + bubbleSort_#t~post3;havoc bubbleSort_#t~post3; 1061#L516-3 assume !(bubbleSort_~j~0 <= bubbleSort_~i~0); 1043#L515-2 bubbleSort_#t~post2 := bubbleSort_~i~0;bubbleSort_~i~0 := bubbleSort_#t~post2 - 1;havoc bubbleSort_#t~post2; 1044#L515-3 assume !!(bubbleSort_~i~0 >= 0);bubbleSort_~j~0 := 1; 1034#L516-3 [2019-11-15 22:13:43,051 INFO L793 eck$LassoCheckResult]: Loop: 1034#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~mem5;havoc bubbleSort_#t~mem4;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); 1033#L516-2 bubbleSort_#t~post3 := bubbleSort_~j~0;bubbleSort_~j~0 := 1 + bubbleSort_#t~post3;havoc bubbleSort_#t~post3; 1034#L516-3 [2019-11-15 22:13:43,052 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:13:43,052 INFO L82 PathProgramCache]: Analyzing trace with hash -137307676, now seen corresponding path program 3 times [2019-11-15 22:13:43,052 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 22:13:43,052 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [307684470] [2019-11-15 22:13:43,052 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:13:43,052 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:13:43,052 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 22:13:43,067 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 22:13:43,079 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 22:13:43,084 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-15 22:13:43,085 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:13:43,085 INFO L82 PathProgramCache]: Analyzing trace with hash 68618, now seen corresponding path program 7 times [2019-11-15 22:13:43,086 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 22:13:43,086 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1274713095] [2019-11-15 22:13:43,086 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:13:43,086 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:13:43,086 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 22:13:43,090 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 22:13:43,092 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 22:13:43,094 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-15 22:13:43,094 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:13:43,094 INFO L82 PathProgramCache]: Analyzing trace with hash -1724071097, now seen corresponding path program 4 times [2019-11-15 22:13:43,095 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 22:13:43,095 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [625830848] [2019-11-15 22:13:43,095 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:13:43,095 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:13:43,096 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 22:13:43,114 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 22:13:43,134 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 22:13:43,140 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-15 22:13:44,049 WARN L191 SmtUtils]: Spent 813.00 ms on a formula simplification. DAG size of input: 182 DAG size of output: 140 [2019-11-15 22:13:44,254 WARN L191 SmtUtils]: Spent 196.00 ms on a formula simplification that was a NOOP. DAG size: 90 [2019-11-15 22:13:44,258 INFO L210 LassoAnalysis]: Preferences: [2019-11-15 22:13:44,258 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-11-15 22:13:44,258 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-11-15 22:13:44,258 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-11-15 22:13:44,258 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2019-11-15 22:13:44,258 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-15 22:13:44,259 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-11-15 22:13:44,259 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-11-15 22:13:44,259 INFO L131 ssoRankerPreferences]: Filename of dumped script: bubblesort-alloca-2.i_Iteration9_Lasso [2019-11-15 22:13:44,259 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-11-15 22:13:44,259 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2019-11-15 22:13:44,263 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 22:13:44,276 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 22:13:44,283 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 22:13:44,285 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 22:13:44,289 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 22:13:44,293 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 22:13:44,296 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 22:13:44,302 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 22:13:44,305 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 22:13:44,309 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 22:13:44,312 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 22:13:44,453 FATAL L? ?]: The Plugin de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer has thrown an exception: java.lang.AssertionError: MapEliminator tries to combine Int and (Array Int Int) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.mapelimination.MapEliminator.indexEqualityInequalityImpliesValueEquality(MapEliminator.java:850) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.mapelimination.MapEliminator.replaceSelectStoreTerm(MapEliminator.java:592) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.mapelimination.MapEliminator.replaceStoreTerms(MapEliminator.java:542) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.mapelimination.MapEliminator.getRewrittenTransFormula(MapEliminator.java:330) at de.uni_freiburg.informatik.ultimate.lassoranker.preprocessors.MapEliminationLassoPreprocessor.process(MapEliminationLassoPreprocessor.java:109) at de.uni_freiburg.informatik.ultimate.lassoranker.variables.LassoBuilder.applyPreprocessor(LassoBuilder.java:154) at de.uni_freiburg.informatik.ultimate.lassoranker.variables.LassoBuilder.preprocess(LassoBuilder.java:262) at de.uni_freiburg.informatik.ultimate.lassoranker.LassoAnalysis.preprocess(LassoAnalysis.java:278) at de.uni_freiburg.informatik.ultimate.lassoranker.LassoAnalysis.(LassoAnalysis.java:229) at de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.LassoCheck.synthesize(LassoCheck.java:609) at de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.LassoCheck.access$16(LassoCheck.java:536) at de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.LassoCheck$LassoCheckResult.checkLassoTermination(LassoCheck.java:951) at de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.LassoCheck$LassoCheckResult.(LassoCheck.java:862) at de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.LassoCheck.(LassoCheck.java:248) at de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiCegarLoop.iterate(BuchiCegarLoop.java:458) at de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver.doTerminationAnalysis(BuchiAutomizerObserver.java:141) at de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver.finish(BuchiAutomizerObserver.java:380) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:316) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:55) [2019-11-15 22:13:44,457 INFO L168 Benchmark]: Toolchain (without parser) took 11669.30 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 213.4 MB). Free memory was 939.4 MB in the beginning and 1.0 GB in the end (delta: -88.0 MB). Peak memory consumption was 125.3 MB. Max. memory is 11.5 GB. [2019-11-15 22:13:44,458 INFO L168 Benchmark]: CDTParser took 0.33 ms. Allocated memory is still 1.0 GB. Free memory is still 967.5 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-15 22:13:44,458 INFO L168 Benchmark]: CACSL2BoogieTranslator took 814.91 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 165.7 MB). Free memory was 939.4 MB in the beginning and 1.1 GB in the end (delta: -208.9 MB). Peak memory consumption was 19.2 MB. Max. memory is 11.5 GB. [2019-11-15 22:13:44,459 INFO L168 Benchmark]: Boogie Procedure Inliner took 59.24 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-15 22:13:44,459 INFO L168 Benchmark]: Boogie Preprocessor took 35.98 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. [2019-11-15 22:13:44,460 INFO L168 Benchmark]: RCFGBuilder took 417.62 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 16.5 MB). Peak memory consumption was 16.5 MB. Max. memory is 11.5 GB. [2019-11-15 22:13:44,461 INFO L168 Benchmark]: BuchiAutomizer took 10337.21 ms. Allocated memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 47.7 MB). Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 93.7 MB). Peak memory consumption was 141.4 MB. Max. memory is 11.5 GB. [2019-11-15 22:13:44,465 INFO L335 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.33 ms. Allocated memory is still 1.0 GB. Free memory is still 967.5 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 814.91 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 165.7 MB). Free memory was 939.4 MB in the beginning and 1.1 GB in the end (delta: -208.9 MB). Peak memory consumption was 19.2 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 59.24 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * Boogie Preprocessor took 35.98 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. * RCFGBuilder took 417.62 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 16.5 MB). Peak memory consumption was 16.5 MB. Max. memory is 11.5 GB. * BuchiAutomizer took 10337.21 ms. Allocated memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 47.7 MB). Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 93.7 MB). Peak memory consumption was 141.4 MB. Max. memory is 11.5 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...