./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/working_dir_361178e6-0df0-4e4e-9c5d-0df05eef77a1/bin/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_361178e6-0df0-4e4e-9c5d-0df05eef77a1/bin/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_361178e6-0df0-4e4e-9c5d-0df05eef77a1/bin/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_361178e6-0df0-4e4e-9c5d-0df05eef77a1/bin/uautomizer/config/AutomizerTermination.xml -i ../../sv-benchmarks/c/array-memsafety/bubblesort-alloca-2.i -s /tmp/vcloud-vcloud-master/worker/working_dir_361178e6-0df0-4e4e-9c5d-0df05eef77a1/bin/uautomizer/config/svcomp-Termination-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_361178e6-0df0-4e4e-9c5d-0df05eef77a1/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/working_dir_361178e6-0df0-4e4e-9c5d-0df05eef77a1/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-10-22 09:01:41,145 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-10-22 09:01:41,147 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-10-22 09:01:41,156 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-10-22 09:01:41,156 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-10-22 09:01:41,157 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-10-22 09:01:41,158 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-10-22 09:01:41,159 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-10-22 09:01:41,160 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-10-22 09:01:41,161 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-10-22 09:01:41,162 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-10-22 09:01:41,163 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-10-22 09:01:41,163 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-10-22 09:01:41,164 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-10-22 09:01:41,165 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-10-22 09:01:41,166 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-10-22 09:01:41,167 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-10-22 09:01:41,167 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-10-22 09:01:41,169 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-10-22 09:01:41,170 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-10-22 09:01:41,171 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-10-22 09:01:41,172 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-10-22 09:01:41,173 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-10-22 09:01:41,174 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-10-22 09:01:41,176 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-10-22 09:01:41,176 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-10-22 09:01:41,176 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-10-22 09:01:41,177 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-10-22 09:01:41,177 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-10-22 09:01:41,178 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-10-22 09:01:41,178 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-10-22 09:01:41,179 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-10-22 09:01:41,180 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-10-22 09:01:41,180 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-10-22 09:01:41,181 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-10-22 09:01:41,181 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-10-22 09:01:41,182 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-10-22 09:01:41,182 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-10-22 09:01:41,182 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-10-22 09:01:41,183 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-10-22 09:01:41,184 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-10-22 09:01:41,184 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_361178e6-0df0-4e4e-9c5d-0df05eef77a1/bin/uautomizer/config/svcomp-Termination-32bit-Automizer_Default.epf [2019-10-22 09:01:41,196 INFO L113 SettingsManager]: Loading preferences was successful [2019-10-22 09:01:41,197 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-10-22 09:01:41,198 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-10-22 09:01:41,198 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-10-22 09:01:41,198 INFO L138 SettingsManager]: * Use SBE=true [2019-10-22 09:01:41,198 INFO L136 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2019-10-22 09:01:41,198 INFO L138 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2019-10-22 09:01:41,199 INFO L138 SettingsManager]: * Use old map elimination=false [2019-10-22 09:01:41,199 INFO L138 SettingsManager]: * Use external solver (rank synthesis)=false [2019-10-22 09:01:41,199 INFO L138 SettingsManager]: * Use only trivial implications for array writes=true [2019-10-22 09:01:41,199 INFO L138 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2019-10-22 09:01:41,199 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-10-22 09:01:41,199 INFO L138 SettingsManager]: * sizeof long=4 [2019-10-22 09:01:41,200 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2019-10-22 09:01:41,200 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-10-22 09:01:41,200 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-10-22 09:01:41,200 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-10-22 09:01:41,200 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2019-10-22 09:01:41,200 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2019-10-22 09:01:41,201 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2019-10-22 09:01:41,201 INFO L138 SettingsManager]: * sizeof long double=12 [2019-10-22 09:01:41,201 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-10-22 09:01:41,201 INFO L138 SettingsManager]: * Assume nondeterminstic values are in range=false [2019-10-22 09:01:41,202 INFO L138 SettingsManager]: * Use constant arrays=true [2019-10-22 09:01:41,202 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2019-10-22 09:01:41,202 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-10-22 09:01:41,202 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-10-22 09:01:41,202 INFO L138 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2019-10-22 09:01:41,203 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-10-22 09:01:41,203 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-10-22 09:01:41,203 INFO L138 SettingsManager]: * Dump automata to the following directory=/home/matthias/ultimate/dump/auto [2019-10-22 09:01:41,204 INFO L136 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2019-10-22 09:01:41,204 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/working_dir_361178e6-0df0-4e4e-9c5d-0df05eef77a1/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-10-22 09:01:41,234 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-10-22 09:01:41,252 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-10-22 09:01:41,255 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-10-22 09:01:41,256 INFO L271 PluginConnector]: Initializing CDTParser... [2019-10-22 09:01:41,256 INFO L275 PluginConnector]: CDTParser initialized [2019-10-22 09:01:41,257 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_361178e6-0df0-4e4e-9c5d-0df05eef77a1/bin/uautomizer/../../sv-benchmarks/c/array-memsafety/bubblesort-alloca-2.i [2019-10-22 09:01:41,298 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_361178e6-0df0-4e4e-9c5d-0df05eef77a1/bin/uautomizer/data/9f1b83cd1/2770b03d3e3d4836b892594e3b655cee/FLAGb87982bd5 [2019-10-22 09:01:41,703 INFO L306 CDTParser]: Found 1 translation units. [2019-10-22 09:01:41,704 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_361178e6-0df0-4e4e-9c5d-0df05eef77a1/sv-benchmarks/c/array-memsafety/bubblesort-alloca-2.i [2019-10-22 09:01:41,714 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_361178e6-0df0-4e4e-9c5d-0df05eef77a1/bin/uautomizer/data/9f1b83cd1/2770b03d3e3d4836b892594e3b655cee/FLAGb87982bd5 [2019-10-22 09:01:41,725 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_361178e6-0df0-4e4e-9c5d-0df05eef77a1/bin/uautomizer/data/9f1b83cd1/2770b03d3e3d4836b892594e3b655cee [2019-10-22 09:01:41,728 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-10-22 09:01:41,729 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-10-22 09:01:41,730 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-10-22 09:01:41,730 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-10-22 09:01:41,733 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-10-22 09:01:41,734 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.10 09:01:41" (1/1) ... [2019-10-22 09:01:41,737 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4dde477f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 09:01:41, skipping insertion in model container [2019-10-22 09:01:41,737 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.10 09:01:41" (1/1) ... [2019-10-22 09:01:41,744 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-10-22 09:01:41,775 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-10-22 09:01:42,104 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-22 09:01:42,117 INFO L188 MainTranslator]: Completed pre-run [2019-10-22 09:01:42,182 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-22 09:01:42,221 INFO L192 MainTranslator]: Completed translation [2019-10-22 09:01:42,221 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 09:01:42 WrapperNode [2019-10-22 09:01:42,221 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-10-22 09:01:42,222 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-10-22 09:01:42,222 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-10-22 09:01:42,222 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-10-22 09:01:42,231 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 09:01:42" (1/1) ... [2019-10-22 09:01:42,245 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 09:01:42" (1/1) ... [2019-10-22 09:01:42,263 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-10-22 09:01:42,263 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-10-22 09:01:42,263 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-10-22 09:01:42,263 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-10-22 09:01:42,271 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 09:01:42" (1/1) ... [2019-10-22 09:01:42,271 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 09:01:42" (1/1) ... [2019-10-22 09:01:42,274 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 09:01:42" (1/1) ... [2019-10-22 09:01:42,274 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 09:01:42" (1/1) ... [2019-10-22 09:01:42,279 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 09:01:42" (1/1) ... [2019-10-22 09:01:42,285 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 09:01:42" (1/1) ... [2019-10-22 09:01:42,286 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 09:01:42" (1/1) ... [2019-10-22 09:01:42,288 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-10-22 09:01:42,288 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-10-22 09:01:42,288 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-10-22 09:01:42,288 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-10-22 09:01:42,293 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 09:01:42" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_361178e6-0df0-4e4e-9c5d-0df05eef77a1/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-10-22 09:01:42,351 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2019-10-22 09:01:42,351 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-10-22 09:01:42,352 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-10-22 09:01:42,352 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-10-22 09:01:42,352 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-10-22 09:01:42,352 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-10-22 09:01:42,702 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-10-22 09:01:42,702 INFO L284 CfgBuilder]: Removed 9 assume(true) statements. [2019-10-22 09:01:42,704 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.10 09:01:42 BoogieIcfgContainer [2019-10-22 09:01:42,704 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-10-22 09:01:42,704 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2019-10-22 09:01:42,704 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2019-10-22 09:01:42,709 INFO L275 PluginConnector]: BuchiAutomizer initialized [2019-10-22 09:01:42,710 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-10-22 09:01:42,710 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 22.10 09:01:41" (1/3) ... [2019-10-22 09:01:42,711 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@5ea8257f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 22.10 09:01:42, skipping insertion in model container [2019-10-22 09:01:42,711 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-10-22 09:01:42,712 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 09:01:42" (2/3) ... [2019-10-22 09:01:42,712 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@5ea8257f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 22.10 09:01:42, skipping insertion in model container [2019-10-22 09:01:42,712 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-10-22 09:01:42,713 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.10 09:01:42" (3/3) ... [2019-10-22 09:01:42,714 INFO L371 chiAutomizerObserver]: Analyzing ICFG bubblesort-alloca-2.i [2019-10-22 09:01:42,760 INFO L356 BuchiCegarLoop]: Interprodecural is true [2019-10-22 09:01:42,760 INFO L357 BuchiCegarLoop]: Hoare is false [2019-10-22 09:01:42,760 INFO L358 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2019-10-22 09:01:42,760 INFO L359 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2019-10-22 09:01:42,760 INFO L360 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-10-22 09:01:42,760 INFO L361 BuchiCegarLoop]: Difference is false [2019-10-22 09:01:42,760 INFO L362 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-10-22 09:01:42,760 INFO L365 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2019-10-22 09:01:42,776 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 16 states. [2019-10-22 09:01:42,796 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 7 [2019-10-22 09:01:42,796 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-10-22 09:01:42,796 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-10-22 09:01:42,804 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1] [2019-10-22 09:01:42,804 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2019-10-22 09:01:42,804 INFO L424 BuchiCegarLoop]: ======== Iteration 1============ [2019-10-22 09:01:42,805 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 16 states. [2019-10-22 09:01:42,806 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 7 [2019-10-22 09:01:42,806 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-10-22 09:01:42,806 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-10-22 09:01:42,806 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1] [2019-10-22 09:01:42,807 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2019-10-22 09:01:42,814 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-10-22 09:01:42,815 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-10-22 09:01:42,819 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 09:01:42,820 INFO L82 PathProgramCache]: Analyzing trace with hash 925669, now seen corresponding path program 1 times [2019-10-22 09:01:42,827 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 09:01:42,827 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [955318438] [2019-10-22 09:01:42,828 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:01:42,828 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:01:42,828 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 09:01:42,916 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 09:01:42,924 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 09:01:42,941 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-10-22 09:01:42,942 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 09:01:42,943 INFO L82 PathProgramCache]: Analyzing trace with hash 1507, now seen corresponding path program 1 times [2019-10-22 09:01:42,943 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 09:01:42,943 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [213700517] [2019-10-22 09:01:42,943 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:01:42,943 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:01:42,943 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 09:01:42,950 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 09:01:42,955 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 09:01:42,957 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-10-22 09:01:42,958 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 09:01:42,958 INFO L82 PathProgramCache]: Analyzing trace with hash 889568455, now seen corresponding path program 1 times [2019-10-22 09:01:42,959 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 09:01:42,959 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [72930193] [2019-10-22 09:01:42,959 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:01:42,959 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:01:42,959 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 09:01:42,975 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 09:01:42,986 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 09:01:42,989 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-10-22 09:01:43,184 INFO L210 LassoAnalysis]: Preferences: [2019-10-22 09:01:43,184 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-10-22 09:01:43,185 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-10-22 09:01:43,185 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-10-22 09:01:43,185 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2019-10-22 09:01:43,185 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-10-22 09:01:43,185 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-10-22 09:01:43,185 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-10-22 09:01:43,186 INFO L131 ssoRankerPreferences]: Filename of dumped script: bubblesort-alloca-2.i_Iteration1_Lasso [2019-10-22 09:01:43,186 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-10-22 09:01:43,186 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2019-10-22 09:01:43,208 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 09:01:43,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-10-22 09:01:43,311 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 09:01:43,314 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 09:01:43,317 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 09:01:43,320 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 09:01:43,322 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 09:01:43,325 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 09:01:43,328 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 09:01:43,616 INFO L292 LassoAnalysis]: Preprocessing complete. [2019-10-22 09:01:43,620 INFO L489 LassoAnalysis]: Using template 'affine'. [2019-10-22 09:01:43,622 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-10-22 09:01:43,623 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 09:01:43,624 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 09:01:43,624 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 09:01:43,624 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 09:01:43,624 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 09:01:43,626 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 09:01:43,627 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 09:01:43,631 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 09:01:43,631 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-10-22 09:01:43,632 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 09:01:43,632 INFO L202 nArgumentSynthesizer]: 2 stem disjuncts [2019-10-22 09:01:43,632 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 09:01:43,632 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 09:01:43,635 INFO L400 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2019-10-22 09:01:43,635 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-10-22 09:01:43,653 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 09:01:43,653 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-10-22 09:01:43,654 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 09:01:43,654 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 09:01:43,654 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 09:01:43,654 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 09:01:43,656 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-10-22 09:01:43,656 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-10-22 09:01:43,659 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 09:01:43,659 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-10-22 09:01:43,660 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 09:01:43,660 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 09:01:43,660 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 09:01:43,660 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 09:01:43,663 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-10-22 09:01:43,663 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-10-22 09:01:43,678 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 09:01:43,679 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-10-22 09:01:43,679 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 09:01:43,679 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 09:01:43,680 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 09:01:43,680 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 09:01:43,680 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 09:01:43,680 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 09:01:43,680 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 09:01:43,682 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 09:01:43,683 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-10-22 09:01:43,683 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 09:01:43,684 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 09:01:43,684 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 09:01:43,684 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 09:01:43,690 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-10-22 09:01:43,691 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-10-22 09:01:43,821 INFO L419 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-10-22 09:01:43,884 INFO L443 ModelExtractionUtils]: Simplification made 6 calls to the SMT solver. [2019-10-22 09:01:43,885 INFO L444 ModelExtractionUtils]: 14 out of 22 variables were initially zero. Simplification set additionally 4 variables to zero. [2019-10-22 09:01:43,886 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-10-22 09:01:43,888 INFO L438 nArgumentSynthesizer]: Removed 1 redundant supporting invariants from a total of 2. [2019-10-22 09:01:43,888 INFO L510 LassoAnalysis]: Proved termination. [2019-10-22 09:01:43,889 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-10-22 09:01:43,909 INFO L297 tatePredicateManager]: 2 out of 4 supporting invariants were superfluous and have been removed [2019-10-22 09:01:43,922 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2019-10-22 09:01:43,954 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 09:01:43,971 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 09:01:43,973 INFO L256 TraceCheckSpWp]: Trace formula consists of 25 conjuncts, 6 conjunts are in the unsatisfiable core [2019-10-22 09:01:43,974 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-22 09:01:43,987 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 09:01:43,988 WARN L254 TraceCheckSpWp]: Trace formula consists of 13 conjuncts, 7 conjunts are in the unsatisfiable core [2019-10-22 09:01:43,988 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-22 09:01:44,007 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 09:01:44,019 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-10-22 09:01:44,020 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 16 states. Second operand 3 states. [2019-10-22 09:01:44,098 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-10-22 09:01:44,099 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-10-22 09:01:44,101 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2019-10-22 09:01:44,101 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 34 transitions. [2019-10-22 09:01:44,103 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 34 transitions. Stem has 4 letters. Loop has 2 letters. [2019-10-22 09:01:44,104 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-10-22 09:01:44,104 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 34 transitions. Stem has 6 letters. Loop has 2 letters. [2019-10-22 09:01:44,104 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-10-22 09:01:44,105 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 34 transitions. Stem has 4 letters. Loop has 4 letters. [2019-10-22 09:01:44,105 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-10-22 09:01:44,106 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 35 states and 53 transitions. [2019-10-22 09:01:44,108 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2019-10-22 09:01:44,117 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 35 states to 13 states and 18 transitions. [2019-10-22 09:01:44,118 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 10 [2019-10-22 09:01:44,119 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 11 [2019-10-22 09:01:44,119 INFO L73 IsDeterministic]: Start isDeterministic. Operand 13 states and 18 transitions. [2019-10-22 09:01:44,120 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-10-22 09:01:44,120 INFO L688 BuchiCegarLoop]: Abstraction has 13 states and 18 transitions. [2019-10-22 09:01:44,136 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13 states and 18 transitions. [2019-10-22 09:01:44,145 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13 to 13. [2019-10-22 09:01:44,145 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2019-10-22 09:01:44,145 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 18 transitions. [2019-10-22 09:01:44,147 INFO L711 BuchiCegarLoop]: Abstraction has 13 states and 18 transitions. [2019-10-22 09:01:44,147 INFO L591 BuchiCegarLoop]: Abstraction has 13 states and 18 transitions. [2019-10-22 09:01:44,147 INFO L424 BuchiCegarLoop]: ======== Iteration 2============ [2019-10-22 09:01:44,147 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 13 states and 18 transitions. [2019-10-22 09:01:44,148 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2019-10-22 09:01:44,148 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-10-22 09:01:44,148 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-10-22 09:01:44,148 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1] [2019-10-22 09:01:44,148 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2019-10-22 09:01:44,149 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-10-22 09:01:44,149 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-10-22 09:01:44,149 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 09:01:44,149 INFO L82 PathProgramCache]: Analyzing trace with hash 889568397, now seen corresponding path program 1 times [2019-10-22 09:01:44,150 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 09:01:44,150 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [224612086] [2019-10-22 09:01:44,150 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:01:44,150 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:01:44,150 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 09:01:44,158 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 09:01:44,197 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 09:01:44,197 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [224612086] [2019-10-22 09:01:44,198 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 09:01:44,198 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-22 09:01:44,198 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [521051546] [2019-10-22 09:01:44,200 INFO L796 eck$LassoCheckResult]: stem already infeasible [2019-10-22 09:01:44,200 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 09:01:44,200 INFO L82 PathProgramCache]: Analyzing trace with hash 60779, now seen corresponding path program 1 times [2019-10-22 09:01:44,201 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 09:01:44,201 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [775650789] [2019-10-22 09:01:44,201 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:01:44,201 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:01:44,201 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 09:01:44,204 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 09:01:44,206 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 09:01:44,208 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-10-22 09:01:44,224 INFO L210 LassoAnalysis]: Preferences: [2019-10-22 09:01:44,224 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-10-22 09:01:44,224 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-10-22 09:01:44,224 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-10-22 09:01:44,224 INFO L127 ssoRankerPreferences]: Use exernal solver: true [2019-10-22 09:01:44,224 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-10-22 09:01:44,224 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-10-22 09:01:44,225 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-10-22 09:01:44,225 INFO L131 ssoRankerPreferences]: Filename of dumped script: bubblesort-alloca-2.i_Iteration2_Loop [2019-10-22 09:01:44,225 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-10-22 09:01:44,225 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2019-10-22 09:01:44,226 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 09:01:44,228 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 09:01:44,231 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 09:01:44,239 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 09:01:44,252 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 09:01:44,325 INFO L292 LassoAnalysis]: Preprocessing complete. [2019-10-22 09:01:44,326 INFO L404 LassoAnalysis]: Checking for nontermination... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_361178e6-0df0-4e4e-9c5d-0df05eef77a1/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) Waiting until toolchain timeout for monitored process 2 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-10-22 09:01:44,362 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-10-22 09:01:44,362 INFO L160 nArgumentSynthesizer]: Using integer mode. [2019-10-22 09:01:44,371 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2019-10-22 09:01:44,372 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/working_dir_361178e6-0df0-4e4e-9c5d-0df05eef77a1/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-10-22 09:01:44,398 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-10-22 09:01:44,398 INFO L160 nArgumentSynthesizer]: Using integer mode. [2019-10-22 09:01:44,405 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2019-10-22 09:01:44,406 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/working_dir_361178e6-0df0-4e4e-9c5d-0df05eef77a1/bin/uautomizer/z3 Starting monitored process 4 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-10-22 09:01:44,419 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-10-22 09:01:44,419 INFO L160 nArgumentSynthesizer]: Using integer mode. Waiting until toolchain timeout for monitored process 4 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-10-22 09:01:44,427 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2019-10-22 09:01:44,427 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/working_dir_361178e6-0df0-4e4e-9c5d-0df05eef77a1/bin/uautomizer/z3 Starting monitored process 5 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-10-22 09:01:44,436 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-10-22 09:01:44,436 INFO L160 nArgumentSynthesizer]: Using integer mode. Waiting until toolchain timeout for monitored process 5 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_361178e6-0df0-4e4e-9c5d-0df05eef77a1/bin/uautomizer/z3 Starting monitored process 6 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-10-22 09:01:44,457 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2019-10-22 09:01:44,458 INFO L160 nArgumentSynthesizer]: Using integer mode. Waiting until toolchain timeout for monitored process 6 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-10-22 09:01:44,476 INFO L444 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2019-10-22 09:01:44,478 INFO L210 LassoAnalysis]: Preferences: [2019-10-22 09:01:44,478 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-10-22 09:01:44,478 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-10-22 09:01:44,478 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-10-22 09:01:44,478 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2019-10-22 09:01:44,478 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-10-22 09:01:44,479 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-10-22 09:01:44,479 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-10-22 09:01:44,479 INFO L131 ssoRankerPreferences]: Filename of dumped script: bubblesort-alloca-2.i_Iteration2_Loop [2019-10-22 09:01:44,479 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-10-22 09:01:44,479 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2019-10-22 09:01:44,480 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 09:01:44,493 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 09:01:44,496 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 09:01:44,508 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 09:01:44,512 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 09:01:44,585 INFO L292 LassoAnalysis]: Preprocessing complete. [2019-10-22 09:01:44,586 INFO L489 LassoAnalysis]: Using template 'affine'. [2019-10-22 09:01:44,586 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-10-22 09:01:44,587 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 09:01:44,587 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 09:01:44,587 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 09:01:44,587 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 09:01:44,587 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 09:01:44,588 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 09:01:44,588 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 09:01:44,589 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 09:01:44,591 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-10-22 09:01:44,592 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 09:01:44,593 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 09:01:44,593 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 09:01:44,593 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 09:01:44,595 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-10-22 09:01:44,595 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-10-22 09:01:44,603 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 09:01:44,604 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-10-22 09:01:44,606 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 09:01:44,607 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 09:01:44,607 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 09:01:44,607 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 09:01:44,607 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 09:01:44,608 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 09:01:44,608 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 09:01:44,610 INFO L419 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-10-22 09:01:44,612 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2019-10-22 09:01:44,612 INFO L444 ModelExtractionUtils]: 1 out of 4 variables were initially zero. Simplification set additionally 0 variables to zero. [2019-10-22 09:01:44,625 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-10-22 09:01:44,625 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2019-10-22 09:01:44,625 INFO L510 LassoAnalysis]: Proved termination. [2019-10-22 09:01:44,626 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-10-22 09:01:44,626 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2019-10-22 09:01:44,641 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 09:01:44,654 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 09:01:44,655 INFO L256 TraceCheckSpWp]: Trace formula consists of 40 conjuncts, 2 conjunts are in the unsatisfiable core [2019-10-22 09:01:44,655 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-22 09:01:44,660 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 09:01:44,661 WARN L254 TraceCheckSpWp]: Trace formula consists of 8 conjuncts, 4 conjunts are in the unsatisfiable core [2019-10-22 09:01:44,661 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-22 09:01:44,672 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 09:01:44,672 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-10-22 09:01:44,673 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 13 states and 18 transitions. cyclomatic complexity: 7 Second operand 3 states. [2019-10-22 09:01:44,688 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-10-22 09:01:44,688 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-10-22 09:01:44,689 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2019-10-22 09:01:44,689 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 16 transitions. [2019-10-22 09:01:44,689 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 16 transitions. Stem has 6 letters. Loop has 3 letters. [2019-10-22 09:01:44,690 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-10-22 09:01:44,690 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 16 transitions. Stem has 9 letters. Loop has 3 letters. [2019-10-22 09:01:44,690 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-10-22 09:01:44,690 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 16 transitions. Stem has 6 letters. Loop has 6 letters. [2019-10-22 09:01:44,690 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-10-22 09:01:44,690 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 19 states and 28 transitions. [2019-10-22 09:01:44,691 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2019-10-22 09:01:44,692 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 19 states to 18 states and 26 transitions. [2019-10-22 09:01:44,714 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 10 [2019-10-22 09:01:44,714 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 11 [2019-10-22 09:01:44,714 INFO L73 IsDeterministic]: Start isDeterministic. Operand 18 states and 26 transitions. [2019-10-22 09:01:44,714 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-10-22 09:01:44,714 INFO L688 BuchiCegarLoop]: Abstraction has 18 states and 26 transitions. [2019-10-22 09:01:44,714 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18 states and 26 transitions. [2019-10-22 09:01:44,718 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18 to 17. [2019-10-22 09:01:44,718 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2019-10-22 09:01:44,718 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 25 transitions. [2019-10-22 09:01:44,719 INFO L711 BuchiCegarLoop]: Abstraction has 17 states and 25 transitions. [2019-10-22 09:01:44,719 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-22 09:01:44,721 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-22 09:01:44,722 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-10-22 09:01:44,723 INFO L87 Difference]: Start difference. First operand 17 states and 25 transitions. Second operand 4 states. [2019-10-22 09:01:44,751 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 09:01:44,752 INFO L93 Difference]: Finished difference Result 18 states and 25 transitions. [2019-10-22 09:01:44,753 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-22 09:01:44,753 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 18 states and 25 transitions. [2019-10-22 09:01:44,754 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2019-10-22 09:01:44,754 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 18 states to 18 states and 25 transitions. [2019-10-22 09:01:44,755 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 10 [2019-10-22 09:01:44,755 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 10 [2019-10-22 09:01:44,755 INFO L73 IsDeterministic]: Start isDeterministic. Operand 18 states and 25 transitions. [2019-10-22 09:01:44,755 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-10-22 09:01:44,755 INFO L688 BuchiCegarLoop]: Abstraction has 18 states and 25 transitions. [2019-10-22 09:01:44,755 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18 states and 25 transitions. [2019-10-22 09:01:44,756 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18 to 17. [2019-10-22 09:01:44,756 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2019-10-22 09:01:44,757 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 24 transitions. [2019-10-22 09:01:44,757 INFO L711 BuchiCegarLoop]: Abstraction has 17 states and 24 transitions. [2019-10-22 09:01:44,759 INFO L591 BuchiCegarLoop]: Abstraction has 17 states and 24 transitions. [2019-10-22 09:01:44,759 INFO L424 BuchiCegarLoop]: ======== Iteration 3============ [2019-10-22 09:01:44,759 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 17 states and 24 transitions. [2019-10-22 09:01:44,760 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2019-10-22 09:01:44,760 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-10-22 09:01:44,760 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-10-22 09:01:44,760 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-22 09:01:44,760 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2019-10-22 09:01:44,760 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-10-22 09:01:44,761 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-10-22 09:01:44,761 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 09:01:44,761 INFO L82 PathProgramCache]: Analyzing trace with hash 1185641744, now seen corresponding path program 1 times [2019-10-22 09:01:44,761 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 09:01:44,761 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [193784620] [2019-10-22 09:01:44,762 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:01:44,762 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:01:44,762 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 09:01:44,776 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 09:01:44,787 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 09:01:44,791 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-10-22 09:01:44,794 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 09:01:44,795 INFO L82 PathProgramCache]: Analyzing trace with hash 68618, now seen corresponding path program 1 times [2019-10-22 09:01:44,795 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 09:01:44,796 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1787707331] [2019-10-22 09:01:44,796 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:01:44,796 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:01:44,796 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 09:01:44,804 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 09:01:44,808 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 09:01:44,812 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-10-22 09:01:44,813 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 09:01:44,814 INFO L82 PathProgramCache]: Analyzing trace with hash -357807973, now seen corresponding path program 1 times [2019-10-22 09:01:44,814 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 09:01:44,814 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1229919675] [2019-10-22 09:01:44,814 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:01:44,814 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:01:44,814 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 09:01:44,826 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 09:01:44,888 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 09:01:44,888 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1229919675] [2019-10-22 09:01:44,889 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1752597380] [2019-10-22 09:01:44,889 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_361178e6-0df0-4e4e-9c5d-0df05eef77a1/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-10-22 09:01:44,933 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 09:01:44,934 INFO L256 TraceCheckSpWp]: Trace formula consists of 74 conjuncts, 8 conjunts are in the unsatisfiable core [2019-10-22 09:01:44,935 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-22 09:01:45,006 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 09:01:45,007 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-22 09:01:45,007 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 7] total 11 [2019-10-22 09:01:45,007 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [151744474] [2019-10-22 09:01:45,095 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-22 09:01:45,095 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-10-22 09:01:45,095 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2019-10-22 09:01:45,095 INFO L87 Difference]: Start difference. First operand 17 states and 24 transitions. cyclomatic complexity: 10 Second operand 11 states. [2019-10-22 09:01:45,244 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 09:01:45,244 INFO L93 Difference]: Finished difference Result 30 states and 40 transitions. [2019-10-22 09:01:45,245 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-10-22 09:01:45,245 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 30 states and 40 transitions. [2019-10-22 09:01:45,246 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2019-10-22 09:01:45,246 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 30 states to 20 states and 26 transitions. [2019-10-22 09:01:45,246 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 10 [2019-10-22 09:01:45,246 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 10 [2019-10-22 09:01:45,246 INFO L73 IsDeterministic]: Start isDeterministic. Operand 20 states and 26 transitions. [2019-10-22 09:01:45,247 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-10-22 09:01:45,247 INFO L688 BuchiCegarLoop]: Abstraction has 20 states and 26 transitions. [2019-10-22 09:01:45,247 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20 states and 26 transitions. [2019-10-22 09:01:45,248 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20 to 19. [2019-10-22 09:01:45,248 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2019-10-22 09:01:45,248 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 25 transitions. [2019-10-22 09:01:45,248 INFO L711 BuchiCegarLoop]: Abstraction has 19 states and 25 transitions. [2019-10-22 09:01:45,248 INFO L591 BuchiCegarLoop]: Abstraction has 19 states and 25 transitions. [2019-10-22 09:01:45,248 INFO L424 BuchiCegarLoop]: ======== Iteration 4============ [2019-10-22 09:01:45,248 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 19 states and 25 transitions. [2019-10-22 09:01:45,250 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2019-10-22 09:01:45,252 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-10-22 09:01:45,252 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-10-22 09:01:45,252 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 1, 1, 1, 1, 1, 1, 1] [2019-10-22 09:01:45,252 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2019-10-22 09:01:45,253 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-10-22 09:01:45,253 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-10-22 09:01:45,253 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 09:01:45,253 INFO L82 PathProgramCache]: Analyzing trace with hash 1237095790, now seen corresponding path program 2 times [2019-10-22 09:01:45,253 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 09:01:45,253 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [3503950] [2019-10-22 09:01:45,253 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:01:45,253 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:01:45,254 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 09:01:45,263 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 09:01:45,275 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 09:01:45,280 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-10-22 09:01:45,283 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 09:01:45,283 INFO L82 PathProgramCache]: Analyzing trace with hash 68618, now seen corresponding path program 2 times [2019-10-22 09:01:45,283 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 09:01:45,283 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1328703337] [2019-10-22 09:01:45,283 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:01:45,284 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:01:45,284 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 09:01:45,287 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 09:01:45,292 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 09:01:45,296 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-10-22 09:01:45,298 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 09:01:45,298 INFO L82 PathProgramCache]: Analyzing trace with hash -793648259, now seen corresponding path program 2 times [2019-10-22 09:01:45,298 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 09:01:45,298 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2075579511] [2019-10-22 09:01:45,298 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:01:45,298 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:01:45,298 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 09:01:45,316 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 09:01:45,336 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 09:01:45,340 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-10-22 09:01:45,603 WARN L191 SmtUtils]: Spent 184.00 ms on a formula simplification. DAG size of input: 102 DAG size of output: 82 [2019-10-22 09:01:45,669 INFO L210 LassoAnalysis]: Preferences: [2019-10-22 09:01:45,669 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-10-22 09:01:45,669 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-10-22 09:01:45,670 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-10-22 09:01:45,670 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2019-10-22 09:01:45,670 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-10-22 09:01:45,670 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-10-22 09:01:45,670 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-10-22 09:01:45,670 INFO L131 ssoRankerPreferences]: Filename of dumped script: bubblesort-alloca-2.i_Iteration4_Lasso [2019-10-22 09:01:45,670 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-10-22 09:01:45,670 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2019-10-22 09:01:45,673 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 09:01:45,675 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 09:01:45,677 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 09:01:45,679 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 09:01:45,812 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 09:01:45,815 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 09:01:45,816 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 09:01:45,818 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 09:01:45,820 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 09:01:45,821 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 09:01:45,823 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 09:01:45,824 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 09:01:45,826 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 09:01:45,828 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 09:01:45,829 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 09:01:45,831 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 09:01:46,113 INFO L292 LassoAnalysis]: Preprocessing complete. [2019-10-22 09:01:46,113 INFO L489 LassoAnalysis]: Using template 'affine'. [2019-10-22 09:01:46,114 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-10-22 09:01:46,114 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 09:01:46,114 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 09:01:46,115 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 09:01:46,115 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 09:01:46,115 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 09:01:46,115 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 09:01:46,115 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 09:01:46,116 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 09:01:46,116 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-10-22 09:01:46,116 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 09:01:46,117 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 09:01:46,117 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 09:01:46,117 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 09:01:46,118 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-10-22 09:01:46,118 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-10-22 09:01:46,120 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 09:01:46,120 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-10-22 09:01:46,121 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 09:01:46,124 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 09:01:46,124 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 09:01:46,124 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 09:01:46,124 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 09:01:46,125 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 09:01:46,125 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 09:01:46,125 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 09:01:46,126 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-10-22 09:01:46,126 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 09:01:46,126 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 09:01:46,126 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 09:01:46,127 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 09:01:46,131 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-10-22 09:01:46,131 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-10-22 09:01:46,170 INFO L419 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-10-22 09:01:46,186 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2019-10-22 09:01:46,188 INFO L444 ModelExtractionUtils]: 36 out of 40 variables were initially zero. Simplification set additionally 0 variables to zero. [2019-10-22 09:01:46,189 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-10-22 09:01:46,189 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2019-10-22 09:01:46,190 INFO L510 LassoAnalysis]: Proved termination. [2019-10-22 09:01:46,190 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-10-22 09:01:46,201 INFO L297 tatePredicateManager]: 4 out of 4 supporting invariants were superfluous and have been removed [2019-10-22 09:01:46,212 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 09:01:46,223 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 09:01:46,224 INFO L256 TraceCheckSpWp]: Trace formula consists of 59 conjuncts, 2 conjunts are in the unsatisfiable core [2019-10-22 09:01:46,225 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-22 09:01:46,232 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 09:01:46,233 INFO L256 TraceCheckSpWp]: Trace formula consists of 25 conjuncts, 4 conjunts are in the unsatisfiable core [2019-10-22 09:01:46,233 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-22 09:01:46,242 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 09:01:46,242 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-10-22 09:01:46,242 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 19 states and 25 transitions. cyclomatic complexity: 9 Second operand 3 states. [2019-10-22 09:01:46,265 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-10-22 09:01:46,267 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-10-22 09:01:46,268 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2019-10-22 09:01:46,268 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 15 transitions. [2019-10-22 09:01:46,268 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 15 transitions. Stem has 11 letters. Loop has 3 letters. [2019-10-22 09:01:46,268 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-10-22 09:01:46,268 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 15 transitions. Stem has 14 letters. Loop has 3 letters. [2019-10-22 09:01:46,268 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-10-22 09:01:46,268 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 15 transitions. Stem has 11 letters. Loop has 6 letters. [2019-10-22 09:01:46,269 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-10-22 09:01:46,269 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 34 states and 47 transitions. [2019-10-22 09:01:46,270 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2019-10-22 09:01:46,270 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 34 states to 24 states and 32 transitions. [2019-10-22 09:01:46,270 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 10 [2019-10-22 09:01:46,270 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 10 [2019-10-22 09:01:46,270 INFO L73 IsDeterministic]: Start isDeterministic. Operand 24 states and 32 transitions. [2019-10-22 09:01:46,271 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-10-22 09:01:46,271 INFO L688 BuchiCegarLoop]: Abstraction has 24 states and 32 transitions. [2019-10-22 09:01:46,271 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states and 32 transitions. [2019-10-22 09:01:46,272 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 19. [2019-10-22 09:01:46,272 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2019-10-22 09:01:46,272 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 24 transitions. [2019-10-22 09:01:46,272 INFO L711 BuchiCegarLoop]: Abstraction has 19 states and 24 transitions. [2019-10-22 09:01:46,272 INFO L591 BuchiCegarLoop]: Abstraction has 19 states and 24 transitions. [2019-10-22 09:01:46,272 INFO L424 BuchiCegarLoop]: ======== Iteration 5============ [2019-10-22 09:01:46,273 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 19 states and 24 transitions. [2019-10-22 09:01:46,275 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2019-10-22 09:01:46,276 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-10-22 09:01:46,276 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-10-22 09:01:46,277 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-22 09:01:46,277 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2019-10-22 09:01:46,277 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-10-22 09:01:46,277 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-10-22 09:01:46,277 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 09:01:46,277 INFO L82 PathProgramCache]: Analyzing trace with hash -793649948, now seen corresponding path program 1 times [2019-10-22 09:01:46,277 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 09:01:46,278 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [825005548] [2019-10-22 09:01:46,278 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:01:46,278 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:01:46,278 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 09:01:46,300 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 09:01:46,359 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 3 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 09:01:46,360 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [825005548] [2019-10-22 09:01:46,360 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1533297150] [2019-10-22 09:01:46,360 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_361178e6-0df0-4e4e-9c5d-0df05eef77a1/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-10-22 09:01:46,409 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 09:01:46,410 INFO L256 TraceCheckSpWp]: Trace formula consists of 65 conjuncts, 8 conjunts are in the unsatisfiable core [2019-10-22 09:01:46,411 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-22 09:01:46,449 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 2 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 09:01:46,449 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-22 09:01:46,449 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 7] total 12 [2019-10-22 09:01:46,449 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [197779408] [2019-10-22 09:01:46,450 INFO L796 eck$LassoCheckResult]: stem already infeasible [2019-10-22 09:01:46,450 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 09:01:46,450 INFO L82 PathProgramCache]: Analyzing trace with hash 68618, now seen corresponding path program 3 times [2019-10-22 09:01:46,450 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 09:01:46,450 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1153264314] [2019-10-22 09:01:46,450 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:01:46,450 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:01:46,451 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 09:01:46,455 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 09:01:46,457 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 09:01:46,460 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-10-22 09:01:46,544 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-22 09:01:46,545 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-10-22 09:01:46,545 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=99, Unknown=0, NotChecked=0, Total=132 [2019-10-22 09:01:46,545 INFO L87 Difference]: Start difference. First operand 19 states and 24 transitions. cyclomatic complexity: 8 Second operand 12 states. [2019-10-22 09:01:46,647 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 09:01:46,647 INFO L93 Difference]: Finished difference Result 26 states and 34 transitions. [2019-10-22 09:01:46,648 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-10-22 09:01:46,648 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 26 states and 34 transitions. [2019-10-22 09:01:46,649 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2019-10-22 09:01:46,649 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 26 states to 26 states and 34 transitions. [2019-10-22 09:01:46,649 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 10 [2019-10-22 09:01:46,649 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 10 [2019-10-22 09:01:46,650 INFO L73 IsDeterministic]: Start isDeterministic. Operand 26 states and 34 transitions. [2019-10-22 09:01:46,650 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-10-22 09:01:46,650 INFO L688 BuchiCegarLoop]: Abstraction has 26 states and 34 transitions. [2019-10-22 09:01:46,650 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states and 34 transitions. [2019-10-22 09:01:46,651 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 20. [2019-10-22 09:01:46,651 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2019-10-22 09:01:46,651 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 25 transitions. [2019-10-22 09:01:46,651 INFO L711 BuchiCegarLoop]: Abstraction has 20 states and 25 transitions. [2019-10-22 09:01:46,652 INFO L591 BuchiCegarLoop]: Abstraction has 20 states and 25 transitions. [2019-10-22 09:01:46,652 INFO L424 BuchiCegarLoop]: ======== Iteration 6============ [2019-10-22 09:01:46,652 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 20 states and 25 transitions. [2019-10-22 09:01:46,652 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2019-10-22 09:01:46,652 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-10-22 09:01:46,652 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-10-22 09:01:46,653 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-22 09:01:46,658 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2019-10-22 09:01:46,658 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-10-22 09:01:46,658 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-10-22 09:01:46,658 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 09:01:46,658 INFO L82 PathProgramCache]: Analyzing trace with hash 221564791, now seen corresponding path program 1 times [2019-10-22 09:01:46,658 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 09:01:46,659 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [10407760] [2019-10-22 09:01:46,659 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:01:46,659 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:01:46,659 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 09:01:46,668 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 09:01:46,684 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 09:01:46,691 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-10-22 09:01:46,693 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 09:01:46,693 INFO L82 PathProgramCache]: Analyzing trace with hash 68618, now seen corresponding path program 4 times [2019-10-22 09:01:46,693 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 09:01:46,693 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1449537411] [2019-10-22 09:01:46,693 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:01:46,694 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:01:46,694 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 09:01:46,698 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 09:01:46,700 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 09:01:46,701 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-10-22 09:01:46,701 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 09:01:46,702 INFO L82 PathProgramCache]: Analyzing trace with hash -728006444, now seen corresponding path program 1 times [2019-10-22 09:01:46,702 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 09:01:46,702 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1098942998] [2019-10-22 09:01:46,702 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:01:46,702 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:01:46,702 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 09:01:46,711 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 09:01:46,773 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 5 proven. 4 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-10-22 09:01:46,774 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1098942998] [2019-10-22 09:01:46,774 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [369469733] [2019-10-22 09:01:46,774 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_361178e6-0df0-4e4e-9c5d-0df05eef77a1/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-10-22 09:01:46,821 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 09:01:46,822 INFO L256 TraceCheckSpWp]: Trace formula consists of 102 conjuncts, 10 conjunts are in the unsatisfiable core [2019-10-22 09:01:46,823 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-22 09:01:46,889 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 5 proven. 4 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-10-22 09:01:46,890 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-22 09:01:46,890 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 9] total 15 [2019-10-22 09:01:46,890 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [234642114] [2019-10-22 09:01:46,967 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-22 09:01:46,967 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2019-10-22 09:01:46,968 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=163, Unknown=0, NotChecked=0, Total=210 [2019-10-22 09:01:46,968 INFO L87 Difference]: Start difference. First operand 20 states and 25 transitions. cyclomatic complexity: 8 Second operand 15 states. [2019-10-22 09:01:47,081 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 09:01:47,082 INFO L93 Difference]: Finished difference Result 35 states and 44 transitions. [2019-10-22 09:01:47,082 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-10-22 09:01:47,082 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 35 states and 44 transitions. [2019-10-22 09:01:47,082 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2019-10-22 09:01:47,083 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 35 states to 23 states and 28 transitions. [2019-10-22 09:01:47,083 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 10 [2019-10-22 09:01:47,083 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 10 [2019-10-22 09:01:47,083 INFO L73 IsDeterministic]: Start isDeterministic. Operand 23 states and 28 transitions. [2019-10-22 09:01:47,083 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-10-22 09:01:47,083 INFO L688 BuchiCegarLoop]: Abstraction has 23 states and 28 transitions. [2019-10-22 09:01:47,083 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states and 28 transitions. [2019-10-22 09:01:47,084 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 22. [2019-10-22 09:01:47,084 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22 states. [2019-10-22 09:01:47,084 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 27 transitions. [2019-10-22 09:01:47,084 INFO L711 BuchiCegarLoop]: Abstraction has 22 states and 27 transitions. [2019-10-22 09:01:47,084 INFO L591 BuchiCegarLoop]: Abstraction has 22 states and 27 transitions. [2019-10-22 09:01:47,084 INFO L424 BuchiCegarLoop]: ======== Iteration 7============ [2019-10-22 09:01:47,084 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 22 states and 27 transitions. [2019-10-22 09:01:47,085 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2019-10-22 09:01:47,085 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-10-22 09:01:47,085 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-10-22 09:01:47,085 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-22 09:01:47,085 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2019-10-22 09:01:47,085 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-10-22 09:01:47,086 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-10-22 09:01:47,086 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 09:01:47,086 INFO L82 PathProgramCache]: Analyzing trace with hash 1850126805, now seen corresponding path program 2 times [2019-10-22 09:01:47,086 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 09:01:47,086 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2138042072] [2019-10-22 09:01:47,086 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:01:47,086 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:01:47,086 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 09:01:47,094 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 09:01:47,161 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 6 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 09:01:47,161 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2138042072] [2019-10-22 09:01:47,161 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [604610921] [2019-10-22 09:01:47,161 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_361178e6-0df0-4e4e-9c5d-0df05eef77a1/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-10-22 09:01:47,210 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-10-22 09:01:47,210 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-22 09:01:47,211 INFO L256 TraceCheckSpWp]: Trace formula consists of 87 conjuncts, 10 conjunts are in the unsatisfiable core [2019-10-22 09:01:47,212 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-22 09:01:47,279 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 5 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 09:01:47,279 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-22 09:01:47,279 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 9] total 16 [2019-10-22 09:01:47,279 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1844753057] [2019-10-22 09:01:47,280 INFO L796 eck$LassoCheckResult]: stem already infeasible [2019-10-22 09:01:47,280 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 09:01:47,280 INFO L82 PathProgramCache]: Analyzing trace with hash 68618, now seen corresponding path program 5 times [2019-10-22 09:01:47,280 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 09:01:47,280 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1559961913] [2019-10-22 09:01:47,280 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:01:47,280 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:01:47,281 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 09:01:47,284 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 09:01:47,287 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 09:01:47,288 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-10-22 09:01:47,362 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-22 09:01:47,363 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2019-10-22 09:01:47,363 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=185, Unknown=0, NotChecked=0, Total=240 [2019-10-22 09:01:47,363 INFO L87 Difference]: Start difference. First operand 22 states and 27 transitions. cyclomatic complexity: 8 Second operand 16 states. [2019-10-22 09:01:47,531 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 09:01:47,531 INFO L93 Difference]: Finished difference Result 31 states and 40 transitions. [2019-10-22 09:01:47,532 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-10-22 09:01:47,532 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 31 states and 40 transitions. [2019-10-22 09:01:47,532 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2019-10-22 09:01:47,533 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 31 states to 31 states and 40 transitions. [2019-10-22 09:01:47,533 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 10 [2019-10-22 09:01:47,533 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 10 [2019-10-22 09:01:47,533 INFO L73 IsDeterministic]: Start isDeterministic. Operand 31 states and 40 transitions. [2019-10-22 09:01:47,533 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-10-22 09:01:47,533 INFO L688 BuchiCegarLoop]: Abstraction has 31 states and 40 transitions. [2019-10-22 09:01:47,533 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states and 40 transitions. [2019-10-22 09:01:47,535 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 25. [2019-10-22 09:01:47,535 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25 states. [2019-10-22 09:01:47,535 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 31 transitions. [2019-10-22 09:01:47,535 INFO L711 BuchiCegarLoop]: Abstraction has 25 states and 31 transitions. [2019-10-22 09:01:47,535 INFO L591 BuchiCegarLoop]: Abstraction has 25 states and 31 transitions. [2019-10-22 09:01:47,535 INFO L424 BuchiCegarLoop]: ======== Iteration 8============ [2019-10-22 09:01:47,535 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 25 states and 31 transitions. [2019-10-22 09:01:47,536 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2019-10-22 09:01:47,536 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-10-22 09:01:47,536 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-10-22 09:01:47,536 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-22 09:01:47,536 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2019-10-22 09:01:47,537 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-10-22 09:01:47,537 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-10-22 09:01:47,537 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 09:01:47,537 INFO L82 PathProgramCache]: Analyzing trace with hash -135460634, now seen corresponding path program 3 times [2019-10-22 09:01:47,538 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 09:01:47,538 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1030445160] [2019-10-22 09:01:47,538 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:01:47,538 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:01:47,538 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 09:01:47,550 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 09:01:47,560 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 09:01:47,563 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-10-22 09:01:47,563 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 09:01:47,564 INFO L82 PathProgramCache]: Analyzing trace with hash 68618, now seen corresponding path program 6 times [2019-10-22 09:01:47,564 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 09:01:47,564 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [265091147] [2019-10-22 09:01:47,564 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:01:47,564 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:01:47,564 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 09:01:47,567 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 09:01:47,569 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 09:01:47,570 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-10-22 09:01:47,571 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 09:01:47,571 INFO L82 PathProgramCache]: Analyzing trace with hash 1761549573, now seen corresponding path program 2 times [2019-10-22 09:01:47,571 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 09:01:47,571 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1191982200] [2019-10-22 09:01:47,571 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:01:47,572 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:01:47,572 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 09:01:47,588 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 09:01:47,824 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 6 proven. 14 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-10-22 09:01:47,824 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1191982200] [2019-10-22 09:01:47,824 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [42700097] [2019-10-22 09:01:47,825 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_361178e6-0df0-4e4e-9c5d-0df05eef77a1/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-10-22 09:01:47,884 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-10-22 09:01:47,884 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-22 09:01:47,885 INFO L256 TraceCheckSpWp]: Trace formula consists of 124 conjuncts, 18 conjunts are in the unsatisfiable core [2019-10-22 09:01:47,886 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-22 09:01:47,957 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-10-22 09:01:47,958 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-10-22 09:01:47,958 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-22 09:01:47,960 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-22 09:01:47,961 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-10-22 09:01:47,961 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:26, output treesize:3 [2019-10-22 09:01:47,973 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 6 proven. 5 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2019-10-22 09:01:47,973 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-22 09:01:47,973 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 9] total 13 [2019-10-22 09:01:47,973 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [519423868] [2019-10-22 09:01:48,049 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-22 09:01:48,049 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-10-22 09:01:48,049 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=119, Unknown=0, NotChecked=0, Total=156 [2019-10-22 09:01:48,049 INFO L87 Difference]: Start difference. First operand 25 states and 31 transitions. cyclomatic complexity: 9 Second operand 13 states. [2019-10-22 09:01:48,252 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 09:01:48,252 INFO L93 Difference]: Finished difference Result 47 states and 63 transitions. [2019-10-22 09:01:48,253 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-10-22 09:01:48,253 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 47 states and 63 transitions. [2019-10-22 09:01:48,254 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 6 [2019-10-22 09:01:48,254 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 47 states to 47 states and 63 transitions. [2019-10-22 09:01:48,255 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 18 [2019-10-22 09:01:48,255 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 18 [2019-10-22 09:01:48,255 INFO L73 IsDeterministic]: Start isDeterministic. Operand 47 states and 63 transitions. [2019-10-22 09:01:48,255 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-10-22 09:01:48,255 INFO L688 BuchiCegarLoop]: Abstraction has 47 states and 63 transitions. [2019-10-22 09:01:48,255 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states and 63 transitions. [2019-10-22 09:01:48,257 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 36. [2019-10-22 09:01:48,260 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36 states. [2019-10-22 09:01:48,260 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 48 transitions. [2019-10-22 09:01:48,261 INFO L711 BuchiCegarLoop]: Abstraction has 36 states and 48 transitions. [2019-10-22 09:01:48,261 INFO L591 BuchiCegarLoop]: Abstraction has 36 states and 48 transitions. [2019-10-22 09:01:48,261 INFO L424 BuchiCegarLoop]: ======== Iteration 9============ [2019-10-22 09:01:48,261 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 36 states and 48 transitions. [2019-10-22 09:01:48,261 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2019-10-22 09:01:48,261 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-10-22 09:01:48,262 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-10-22 09:01:48,262 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-22 09:01:48,262 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2019-10-22 09:01:48,262 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-10-22 09:01:48,262 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-10-22 09:01:48,262 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 09:01:48,263 INFO L82 PathProgramCache]: Analyzing trace with hash -137307676, now seen corresponding path program 3 times [2019-10-22 09:01:48,263 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 09:01:48,263 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1961831910] [2019-10-22 09:01:48,263 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:01:48,263 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:01:48,263 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 09:01:48,275 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 09:01:48,284 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 09:01:48,287 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-10-22 09:01:48,288 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 09:01:48,288 INFO L82 PathProgramCache]: Analyzing trace with hash 68618, now seen corresponding path program 7 times [2019-10-22 09:01:48,288 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 09:01:48,288 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [269080271] [2019-10-22 09:01:48,288 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:01:48,288 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:01:48,288 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 09:01:48,291 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 09:01:48,293 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 09:01:48,294 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-10-22 09:01:48,295 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 09:01:48,295 INFO L82 PathProgramCache]: Analyzing trace with hash -1724071097, now seen corresponding path program 4 times [2019-10-22 09:01:48,295 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 09:01:48,295 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [799448354] [2019-10-22 09:01:48,295 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:01:48,295 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:01:48,295 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 09:01:48,309 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 09:01:48,322 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 09:01:48,326 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-10-22 09:01:49,027 WARN L191 SmtUtils]: Spent 635.00 ms on a formula simplification. DAG size of input: 182 DAG size of output: 140 [2019-10-22 09:01:49,142 WARN L191 SmtUtils]: Spent 109.00 ms on a formula simplification that was a NOOP. DAG size: 90 [2019-10-22 09:01:49,144 INFO L210 LassoAnalysis]: Preferences: [2019-10-22 09:01:49,144 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-10-22 09:01:49,144 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-10-22 09:01:49,144 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-10-22 09:01:49,144 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2019-10-22 09:01:49,144 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-10-22 09:01:49,144 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-10-22 09:01:49,144 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-10-22 09:01:49,145 INFO L131 ssoRankerPreferences]: Filename of dumped script: bubblesort-alloca-2.i_Iteration9_Lasso [2019-10-22 09:01:49,145 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-10-22 09:01:49,145 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2019-10-22 09:01:49,147 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 09:01:49,150 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 09:01:49,162 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 09:01:49,163 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 09:01:49,166 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 09:01:49,168 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 09:01:49,170 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 09:01:49,171 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 09:01:49,173 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 09:01:49,176 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 09:01:49,177 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 09:01:49,241 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-10-22 09:01:49,243 INFO L168 Benchmark]: Toolchain (without parser) took 7514.37 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 200.3 MB). Free memory was 939.1 MB in the beginning and 1.0 GB in the end (delta: -77.4 MB). Peak memory consumption was 122.9 MB. Max. memory is 11.5 GB. [2019-10-22 09:01:49,243 INFO L168 Benchmark]: CDTParser took 0.93 ms. Allocated memory is still 1.0 GB. Free memory is still 967.3 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-10-22 09:01:49,244 INFO L168 Benchmark]: CACSL2BoogieTranslator took 491.64 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 146.8 MB). Free memory was 939.1 MB in the beginning and 1.1 GB in the end (delta: -191.5 MB). Peak memory consumption was 17.8 MB. Max. memory is 11.5 GB. [2019-10-22 09:01:49,244 INFO L168 Benchmark]: Boogie Procedure Inliner took 40.88 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-10-22 09:01:49,244 INFO L168 Benchmark]: Boogie Preprocessor took 24.48 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: 6.7 MB). Peak memory consumption was 6.7 MB. Max. memory is 11.5 GB. [2019-10-22 09:01:49,245 INFO L168 Benchmark]: RCFGBuilder took 415.87 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 17.0 MB). Peak memory consumption was 17.0 MB. Max. memory is 11.5 GB. [2019-10-22 09:01:49,245 INFO L168 Benchmark]: BuchiAutomizer took 6537.80 ms. Allocated memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 53.5 MB). Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 85.0 MB). Peak memory consumption was 138.5 MB. Max. memory is 11.5 GB. [2019-10-22 09:01:49,247 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.93 ms. Allocated memory is still 1.0 GB. Free memory is still 967.3 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 491.64 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 146.8 MB). Free memory was 939.1 MB in the beginning and 1.1 GB in the end (delta: -191.5 MB). Peak memory consumption was 17.8 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 40.88 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * Boogie Preprocessor took 24.48 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: 6.7 MB). Peak memory consumption was 6.7 MB. Max. memory is 11.5 GB. * RCFGBuilder took 415.87 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 17.0 MB). Peak memory consumption was 17.0 MB. Max. memory is 11.5 GB. * BuchiAutomizer took 6537.80 ms. Allocated memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 53.5 MB). Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 85.0 MB). Peak memory consumption was 138.5 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...