./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 6b5699aa Calling Ultimate with: /usr/lib/jvm/java-8-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/run_dir_99c1e841-74b8-4f89-a61d-1452bff951cb/bin/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/run_dir_99c1e841-74b8-4f89-a61d-1452bff951cb/bin/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/run_dir_99c1e841-74b8-4f89-a61d-1452bff951cb/bin/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/run_dir_99c1e841-74b8-4f89-a61d-1452bff951cb/bin/uautomizer/config/AutomizerTermination.xml -i ../../sv-benchmarks/c/array-memsafety/bubblesort-alloca-2.i -s /tmp/vcloud-vcloud-master/worker/run_dir_99c1e841-74b8-4f89-a61d-1452bff951cb/bin/uautomizer/config/svcomp-Termination-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/run_dir_99c1e841-74b8-4f89-a61d-1452bff951cb/bin/uautomizer --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(F end) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash a2eb39e0d0d0fa911fcf8a16c5f9511be1d37325 ................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................ Execution finished normally Using bit-precise analysis No suitable file found in config dir /tmp/vcloud-vcloud-master/worker/run_dir_99c1e841-74b8-4f89-a61d-1452bff951cb/bin/uautomizer/config using search string *Termination*32bit*_Bitvector*.epf No suitable settings file found using Termination*32bit*_Bitvector ERROR: UNSUPPORTED PROPERTY Writing output log to file Ultimate.log Result: ERROR: ExceptionOrErrorResult: AssertionError: MapEliminator tries to combine Int and (Array Int Int) --- Real Ultimate output --- This is Ultimate 0.1.24-6b5699a [2019-11-25 08:49:55,287 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-25 08:49:55,289 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-25 08:49:55,304 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-25 08:49:55,304 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-25 08:49:55,305 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-25 08:49:55,307 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-25 08:49:55,315 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-25 08:49:55,320 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-25 08:49:55,324 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-25 08:49:55,325 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-25 08:49:55,326 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-25 08:49:55,326 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-25 08:49:55,328 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-25 08:49:55,330 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-25 08:49:55,331 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-25 08:49:55,332 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-25 08:49:55,333 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-25 08:49:55,335 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-25 08:49:55,339 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-25 08:49:55,343 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-25 08:49:55,347 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-25 08:49:55,350 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-25 08:49:55,351 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-25 08:49:55,354 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-25 08:49:55,354 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-25 08:49:55,354 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-25 08:49:55,356 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-25 08:49:55,356 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-25 08:49:55,357 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-25 08:49:55,358 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-25 08:49:55,358 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-25 08:49:55,359 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-25 08:49:55,360 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-25 08:49:55,360 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-25 08:49:55,361 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-25 08:49:55,361 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-25 08:49:55,361 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-25 08:49:55,362 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-25 08:49:55,362 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-25 08:49:55,364 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-25 08:49:55,364 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/run_dir_99c1e841-74b8-4f89-a61d-1452bff951cb/bin/uautomizer/config/svcomp-Termination-32bit-Automizer_Default.epf [2019-11-25 08:49:55,390 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-25 08:49:55,392 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-25 08:49:55,393 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-11-25 08:49:55,393 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-11-25 08:49:55,394 INFO L138 SettingsManager]: * Use SBE=true [2019-11-25 08:49:55,394 INFO L136 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2019-11-25 08:49:55,394 INFO L138 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2019-11-25 08:49:55,394 INFO L138 SettingsManager]: * Use old map elimination=false [2019-11-25 08:49:55,394 INFO L138 SettingsManager]: * Use external solver (rank synthesis)=false [2019-11-25 08:49:55,395 INFO L138 SettingsManager]: * Use only trivial implications for array writes=true [2019-11-25 08:49:55,396 INFO L138 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2019-11-25 08:49:55,396 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-25 08:49:55,396 INFO L138 SettingsManager]: * sizeof long=4 [2019-11-25 08:49:55,396 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2019-11-25 08:49:55,397 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-11-25 08:49:55,397 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-11-25 08:49:55,397 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-25 08:49:55,397 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2019-11-25 08:49:55,397 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2019-11-25 08:49:55,398 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2019-11-25 08:49:55,398 INFO L138 SettingsManager]: * sizeof long double=12 [2019-11-25 08:49:55,398 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-11-25 08:49:55,398 INFO L138 SettingsManager]: * Assume nondeterminstic values are in range=false [2019-11-25 08:49:55,398 INFO L138 SettingsManager]: * Use constant arrays=true [2019-11-25 08:49:55,399 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2019-11-25 08:49:55,399 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-25 08:49:55,399 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-11-25 08:49:55,399 INFO L138 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2019-11-25 08:49:55,399 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-25 08:49:55,400 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-11-25 08:49:55,400 INFO L138 SettingsManager]: * Dump automata to the following directory=/home/matthias/ultimate/dump/auto [2019-11-25 08:49:55,401 INFO L136 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2019-11-25 08:49:55,401 INFO L138 SettingsManager]: * TransformationType=MODULO_NEIGHBOR Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /tmp/vcloud-vcloud-master/worker/run_dir_99c1e841-74b8-4f89-a61d-1452bff951cb/bin/uautomizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(F end) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> a2eb39e0d0d0fa911fcf8a16c5f9511be1d37325 [2019-11-25 08:49:55,551 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-25 08:49:55,561 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-25 08:49:55,564 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-25 08:49:55,565 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-25 08:49:55,565 INFO L275 PluginConnector]: CDTParser initialized [2019-11-25 08:49:55,566 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/run_dir_99c1e841-74b8-4f89-a61d-1452bff951cb/bin/uautomizer/../../sv-benchmarks/c/array-memsafety/bubblesort-alloca-2.i [2019-11-25 08:49:55,627 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_99c1e841-74b8-4f89-a61d-1452bff951cb/bin/uautomizer/data/d3fe940bc/ee4839c3f3ab418c8c5d02dfd6529dad/FLAG33bf76868 [2019-11-25 08:49:56,114 INFO L306 CDTParser]: Found 1 translation units. [2019-11-25 08:49:56,114 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/run_dir_99c1e841-74b8-4f89-a61d-1452bff951cb/sv-benchmarks/c/array-memsafety/bubblesort-alloca-2.i [2019-11-25 08:49:56,136 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_99c1e841-74b8-4f89-a61d-1452bff951cb/bin/uautomizer/data/d3fe940bc/ee4839c3f3ab418c8c5d02dfd6529dad/FLAG33bf76868 [2019-11-25 08:49:56,647 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/run_dir_99c1e841-74b8-4f89-a61d-1452bff951cb/bin/uautomizer/data/d3fe940bc/ee4839c3f3ab418c8c5d02dfd6529dad [2019-11-25 08:49:56,650 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-25 08:49:56,651 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-11-25 08:49:56,652 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-25 08:49:56,652 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-25 08:49:56,655 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-25 08:49:56,656 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.11 08:49:56" (1/1) ... [2019-11-25 08:49:56,658 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2c31b621 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 08:49:56, skipping insertion in model container [2019-11-25 08:49:56,658 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.11 08:49:56" (1/1) ... [2019-11-25 08:49:56,665 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-11-25 08:49:56,704 INFO L179 MainTranslator]: Built tables and reachable declarations [2019-11-25 08:49:57,054 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-25 08:49:57,065 INFO L201 MainTranslator]: Completed pre-run [2019-11-25 08:49:57,106 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-25 08:49:57,157 INFO L205 MainTranslator]: Completed translation [2019-11-25 08:49:57,157 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 08:49:57 WrapperNode [2019-11-25 08:49:57,157 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-25 08:49:57,158 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-11-25 08:49:57,158 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-11-25 08:49:57,158 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-11-25 08:49:57,166 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 08:49:57" (1/1) ... [2019-11-25 08:49:57,178 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 08:49:57" (1/1) ... [2019-11-25 08:49:57,194 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-11-25 08:49:57,195 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-11-25 08:49:57,195 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-11-25 08:49:57,195 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-11-25 08:49:57,202 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 08:49:57" (1/1) ... [2019-11-25 08:49:57,202 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 08:49:57" (1/1) ... [2019-11-25 08:49:57,204 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 08:49:57" (1/1) ... [2019-11-25 08:49:57,205 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 08:49:57" (1/1) ... [2019-11-25 08:49:57,210 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 08:49:57" (1/1) ... [2019-11-25 08:49:57,215 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 08:49:57" (1/1) ... [2019-11-25 08:49:57,216 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 08:49:57" (1/1) ... [2019-11-25 08:49:57,218 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-11-25 08:49:57,219 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-11-25 08:49:57,219 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-11-25 08:49:57,219 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-11-25 08:49:57,220 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 08:49:57" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_99c1e841-74b8-4f89-a61d-1452bff951cb/bin/uautomizer/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-25 08:49:57,273 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2019-11-25 08:49:57,274 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-11-25 08:49:57,274 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-11-25 08:49:57,274 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-11-25 08:49:57,274 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-11-25 08:49:57,274 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-11-25 08:49:57,516 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-11-25 08:49:57,517 INFO L284 CfgBuilder]: Removed 9 assume(true) statements. [2019-11-25 08:49:57,518 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.11 08:49:57 BoogieIcfgContainer [2019-11-25 08:49:57,518 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-11-25 08:49:57,519 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2019-11-25 08:49:57,519 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2019-11-25 08:49:57,522 INFO L275 PluginConnector]: BuchiAutomizer initialized [2019-11-25 08:49:57,523 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-11-25 08:49:57,523 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 25.11 08:49:56" (1/3) ... [2019-11-25 08:49:57,524 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@72f9273c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 25.11 08:49:57, skipping insertion in model container [2019-11-25 08:49:57,524 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-11-25 08:49:57,524 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 08:49:57" (2/3) ... [2019-11-25 08:49:57,524 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@72f9273c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 25.11 08:49:57, skipping insertion in model container [2019-11-25 08:49:57,524 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-11-25 08:49:57,525 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.11 08:49:57" (3/3) ... [2019-11-25 08:49:57,526 INFO L371 chiAutomizerObserver]: Analyzing ICFG bubblesort-alloca-2.i [2019-11-25 08:49:57,582 INFO L356 BuchiCegarLoop]: Interprodecural is true [2019-11-25 08:49:57,582 INFO L357 BuchiCegarLoop]: Hoare is false [2019-11-25 08:49:57,582 INFO L358 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2019-11-25 08:49:57,588 INFO L359 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2019-11-25 08:49:57,588 INFO L360 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-11-25 08:49:57,588 INFO L361 BuchiCegarLoop]: Difference is false [2019-11-25 08:49:57,589 INFO L362 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-11-25 08:49:57,589 INFO L365 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2019-11-25 08:49:57,602 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 16 states. [2019-11-25 08:49:57,622 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 7 [2019-11-25 08:49:57,622 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-25 08:49:57,622 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-25 08:49:57,628 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1] [2019-11-25 08:49:57,628 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2019-11-25 08:49:57,629 INFO L424 BuchiCegarLoop]: ======== Iteration 1============ [2019-11-25 08:49:57,629 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 16 states. [2019-11-25 08:49:57,630 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 7 [2019-11-25 08:49:57,630 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-25 08:49:57,631 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-25 08:49:57,631 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1] [2019-11-25 08:49:57,631 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2019-11-25 08:49:57,638 INFO L794 eck$LassoCheckResult]: Stem: 10#ULTIMATE.startENTRYtrue #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; 9#L-1true havoc main_#res;havoc main_#t~nondet8, main_#t~malloc9.base, main_#t~malloc9.offset, main_#t~nondet11, main_#t~post10, main_~k~0, main_~array_size~0, main_~numbers~0.base, main_~numbers~0.offset;main_~array_size~0 := main_#t~nondet8;havoc main_#t~nondet8; 18#L527true assume !(main_~array_size~0 < 1 || main_~array_size~0 >= 536870911); 3#L527-2true call main_#t~malloc9.base, main_#t~malloc9.offset := #Ultimate.allocOnStack(4 * main_~array_size~0);main_~numbers~0.base, main_~numbers~0.offset := main_#t~malloc9.base, main_#t~malloc9.offset;main_~k~0 := 0; 13#L532-3true [2019-11-25 08:49:57,638 INFO L796 eck$LassoCheckResult]: Loop: 13#L532-3true assume !!(main_~k~0 < main_~array_size~0);call write~int(main_#t~nondet11, main_~numbers~0.base, main_~numbers~0.offset + 4 * main_~k~0, 4);havoc main_#t~nondet11; 11#L532-2true main_#t~post10 := main_~k~0;main_~k~0 := 1 + main_#t~post10;havoc main_#t~post10; 13#L532-3true [2019-11-25 08:49:57,643 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 08:49:57,643 INFO L82 PathProgramCache]: Analyzing trace with hash 925669, now seen corresponding path program 1 times [2019-11-25 08:49:57,649 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-25 08:49:57,649 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1055751664] [2019-11-25 08:49:57,649 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-25 08:49:57,727 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-25 08:49:57,738 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-25 08:49:57,758 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-25 08:49:57,759 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 08:49:57,759 INFO L82 PathProgramCache]: Analyzing trace with hash 1507, now seen corresponding path program 1 times [2019-11-25 08:49:57,759 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-25 08:49:57,760 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [559120996] [2019-11-25 08:49:57,760 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-25 08:49:57,768 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-25 08:49:57,774 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-25 08:49:57,776 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-25 08:49:57,777 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 08:49:57,778 INFO L82 PathProgramCache]: Analyzing trace with hash 889568455, now seen corresponding path program 1 times [2019-11-25 08:49:57,778 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-25 08:49:57,778 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [294010227] [2019-11-25 08:49:57,778 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-25 08:49:57,795 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-25 08:49:57,809 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-25 08:49:57,813 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-25 08:49:58,015 WARN L192 SmtUtils]: Spent 123.00 ms on a formula simplification. DAG size of input: 44 DAG size of output: 42 [2019-11-25 08:49:58,073 INFO L210 LassoAnalysis]: Preferences: [2019-11-25 08:49:58,074 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2019-11-25 08:49:58,074 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-11-25 08:49:58,075 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2019-11-25 08:49:58,075 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2019-11-25 08:49:58,076 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-25 08:49:58,076 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2019-11-25 08:49:58,076 INFO L132 ssoRankerPreferences]: Path of dumped script: [2019-11-25 08:49:58,076 INFO L133 ssoRankerPreferences]: Filename of dumped script: bubblesort-alloca-2.i_Iteration1_Lasso [2019-11-25 08:49:58,076 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2019-11-25 08:49:58,077 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2019-11-25 08:49:58,104 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-25 08:49:58,242 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-25 08:49:58,245 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-25 08:49:58,248 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-25 08:49:58,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-11-25 08:49:58,257 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-25 08:49:58,260 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-25 08:49:58,265 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-25 08:49:58,269 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-25 08:49:58,542 INFO L292 LassoAnalysis]: Preprocessing complete. [2019-11-25 08:49:58,547 INFO L489 LassoAnalysis]: Using template 'affine'. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_99c1e841-74b8-4f89-a61d-1452bff951cb/bin/uautomizer/z3 Starting monitored process 2 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-11-25 08:49:58,557 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-25 08:49:58,559 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-25 08:49:58,559 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-25 08:49:58,560 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-25 08:49:58,560 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-25 08:49:58,560 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-25 08:49:58,562 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-25 08:49:58,562 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. Waiting until toolchain timeout for monitored process 2 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-25 08:49:58,570 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_99c1e841-74b8-4f89-a61d-1452bff951cb/bin/uautomizer/z3 Starting monitored process 3 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-25 08:49:58,585 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-25 08:49:58,588 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-25 08:49:58,588 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-25 08:49:58,588 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-25 08:49:58,589 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-25 08:49:58,598 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-25 08:49:58,598 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-25 08:49:58,608 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_99c1e841-74b8-4f89-a61d-1452bff951cb/bin/uautomizer/z3 Starting monitored process 4 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-11-25 08:49:58,625 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-25 08:49:58,627 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-25 08:49:58,627 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-25 08:49:58,627 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-25 08:49:58,628 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-25 08:49:58,632 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-25 08:49:58,632 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. Waiting until toolchain timeout for monitored process 4 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-25 08:49:58,637 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_99c1e841-74b8-4f89-a61d-1452bff951cb/bin/uautomizer/z3 Starting monitored process 5 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-11-25 08:49:58,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-11-25 08:49:58,657 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-25 08:49:58,657 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-25 08:49:58,657 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-25 08:49:58,657 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-25 08:49:58,667 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-25 08:49:58,668 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. Waiting until toolchain timeout for monitored process 5 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-25 08:49:58,675 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_99c1e841-74b8-4f89-a61d-1452bff951cb/bin/uautomizer/z3 Starting monitored process 6 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-11-25 08:49:58,693 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-25 08:49:58,695 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-25 08:49:58,695 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-25 08:49:58,696 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-25 08:49:58,696 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-25 08:49:58,696 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-25 08:49:58,697 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-25 08:49:58,697 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. Waiting until toolchain timeout for monitored process 6 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-25 08:49:58,699 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_99c1e841-74b8-4f89-a61d-1452bff951cb/bin/uautomizer/z3 Starting monitored process 7 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-11-25 08:49:58,721 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-25 08:49:58,724 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-25 08:49:58,724 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-25 08:49:58,725 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-25 08:49:58,725 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-25 08:49:58,743 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-25 08:49:58,744 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. Waiting until toolchain timeout for monitored process 7 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-25 08:49:58,764 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-11-25 08:49:58,844 INFO L443 ModelExtractionUtils]: Simplification made 14 calls to the SMT solver. [2019-11-25 08:49:58,844 INFO L444 ModelExtractionUtils]: 7 out of 22 variables were initially zero. Simplification set additionally 11 variables to zero. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_99c1e841-74b8-4f89-a61d-1452bff951cb/bin/uautomizer/z3 Starting monitored process 8 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-11-25 08:49:58,859 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... Waiting until toolchain timeout for monitored process 8 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-25 08:49:58,862 INFO L438 nArgumentSynthesizer]: Removed 1 redundant supporting invariants from a total of 2. [2019-11-25 08:49:58,862 INFO L510 LassoAnalysis]: Proved termination. [2019-11-25 08:49:58,863 INFO L512 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select #length ULTIMATE.start_main_#t~malloc9.base)_1, ULTIMATE.start_main_~k~0) = 1*v_rep(select #length ULTIMATE.start_main_#t~malloc9.base)_1 - 4*ULTIMATE.start_main_~k~0 Supporting invariants [1*ULTIMATE.start_main_~numbers~0.offset >= 0] [2019-11-25 08:49:58,885 INFO L297 tatePredicateManager]: 2 out of 4 supporting invariants were superfluous and have been removed [2019-11-25 08:49:58,900 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2019-11-25 08:49:58,942 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 08:49:58,958 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 08:49:58,960 INFO L255 TraceCheckSpWp]: Trace formula consists of 26 conjuncts, 6 conjunts are in the unsatisfiable core [2019-11-25 08:49:58,961 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-25 08:49:58,974 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 08:49:58,975 WARN L253 TraceCheckSpWp]: Trace formula consists of 13 conjuncts, 7 conjunts are in the unsatisfiable core [2019-11-25 08:49:58,976 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-25 08:49:59,008 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-25 08:49:59,024 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2019-11-25 08:49:59,025 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 16 states. Second operand 3 states. [2019-11-25 08:49:59,126 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 16 states.. Second operand 3 states. Result 35 states and 53 transitions. Complement of second has 8 states. [2019-11-25 08:49:59,128 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 5 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2019-11-25 08:49:59,129 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2019-11-25 08:49:59,130 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 34 transitions. [2019-11-25 08:49:59,131 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 34 transitions. Stem has 4 letters. Loop has 2 letters. [2019-11-25 08:49:59,133 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-25 08:49:59,133 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 34 transitions. Stem has 6 letters. Loop has 2 letters. [2019-11-25 08:49:59,134 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-25 08:49:59,134 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 34 transitions. Stem has 4 letters. Loop has 4 letters. [2019-11-25 08:49:59,134 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-25 08:49:59,135 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 35 states and 53 transitions. [2019-11-25 08:49:59,142 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2019-11-25 08:49:59,146 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 35 states to 13 states and 18 transitions. [2019-11-25 08:49:59,147 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 10 [2019-11-25 08:49:59,147 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 11 [2019-11-25 08:49:59,148 INFO L73 IsDeterministic]: Start isDeterministic. Operand 13 states and 18 transitions. [2019-11-25 08:49:59,149 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-11-25 08:49:59,149 INFO L688 BuchiCegarLoop]: Abstraction has 13 states and 18 transitions. [2019-11-25 08:49:59,165 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13 states and 18 transitions. [2019-11-25 08:49:59,174 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13 to 13. [2019-11-25 08:49:59,174 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2019-11-25 08:49:59,175 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 18 transitions. [2019-11-25 08:49:59,177 INFO L711 BuchiCegarLoop]: Abstraction has 13 states and 18 transitions. [2019-11-25 08:49:59,177 INFO L591 BuchiCegarLoop]: Abstraction has 13 states and 18 transitions. [2019-11-25 08:49:59,177 INFO L424 BuchiCegarLoop]: ======== Iteration 2============ [2019-11-25 08:49:59,177 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 13 states and 18 transitions. [2019-11-25 08:49:59,180 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2019-11-25 08:49:59,180 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-25 08:49:59,180 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-25 08:49:59,181 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1] [2019-11-25 08:49:59,181 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2019-11-25 08:49:59,181 INFO L794 eck$LassoCheckResult]: Stem: 120#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; 118#L-1 havoc main_#res;havoc main_#t~nondet8, main_#t~malloc9.base, main_#t~malloc9.offset, main_#t~nondet11, main_#t~post10, main_~k~0, main_~array_size~0, main_~numbers~0.base, main_~numbers~0.offset;main_~array_size~0 := main_#t~nondet8;havoc main_#t~nondet8; 119#L527 assume !(main_~array_size~0 < 1 || main_~array_size~0 >= 536870911); 121#L527-2 call main_#t~malloc9.base, main_#t~malloc9.offset := #Ultimate.allocOnStack(4 * main_~array_size~0);main_~numbers~0.base, main_~numbers~0.offset := main_#t~malloc9.base, main_#t~malloc9.offset;main_~k~0 := 0; 122#L532-3 assume !(main_~k~0 < main_~array_size~0); 130#L532-4 bubbleSort_#in~numbers.base, bubbleSort_#in~numbers.offset, bubbleSort_#in~array_size := main_~numbers~0.base, main_~numbers~0.offset, main_~array_size~0;havoc bubbleSort_#t~mem4, bubbleSort_#t~mem5, bubbleSort_#t~mem6, bubbleSort_#t~mem7, bubbleSort_#t~post3, bubbleSort_#t~post2, bubbleSort_~numbers.base, bubbleSort_~numbers.offset, bubbleSort_~array_size, bubbleSort_~i~0, bubbleSort_~j~0, bubbleSort_~temp~0;bubbleSort_~numbers.base, bubbleSort_~numbers.offset := bubbleSort_#in~numbers.base, bubbleSort_#in~numbers.offset;bubbleSort_~array_size := bubbleSort_#in~array_size;havoc bubbleSort_~i~0;havoc bubbleSort_~j~0;havoc bubbleSort_~temp~0;bubbleSort_~i~0 := bubbleSort_~array_size - 1; 129#L515-3 [2019-11-25 08:49:59,182 INFO L796 eck$LassoCheckResult]: Loop: 129#L515-3 assume !!(bubbleSort_~i~0 >= 0);bubbleSort_~j~0 := 1; 126#L516-3 assume !(bubbleSort_~j~0 <= bubbleSort_~i~0); 127#L515-2 bubbleSort_#t~post2 := bubbleSort_~i~0;bubbleSort_~i~0 := bubbleSort_#t~post2 - 1;havoc bubbleSort_#t~post2; 129#L515-3 [2019-11-25 08:49:59,182 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 08:49:59,182 INFO L82 PathProgramCache]: Analyzing trace with hash 889568397, now seen corresponding path program 1 times [2019-11-25 08:49:59,182 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-25 08:49:59,183 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [543633297] [2019-11-25 08:49:59,184 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-25 08:49:59,204 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 08:49:59,252 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-25 08:49:59,252 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [543633297] [2019-11-25 08:49:59,253 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-25 08:49:59,253 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-25 08:49:59,254 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1221560877] [2019-11-25 08:49:59,256 INFO L799 eck$LassoCheckResult]: stem already infeasible [2019-11-25 08:49:59,256 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 08:49:59,257 INFO L82 PathProgramCache]: Analyzing trace with hash 60779, now seen corresponding path program 1 times [2019-11-25 08:49:59,257 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-25 08:49:59,257 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1167633897] [2019-11-25 08:49:59,257 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-25 08:49:59,261 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-25 08:49:59,263 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-25 08:49:59,264 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-25 08:49:59,283 INFO L210 LassoAnalysis]: Preferences: [2019-11-25 08:49:59,284 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2019-11-25 08:49:59,284 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-11-25 08:49:59,284 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2019-11-25 08:49:59,284 INFO L129 ssoRankerPreferences]: Use exernal solver: true [2019-11-25 08:49:59,284 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-25 08:49:59,284 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2019-11-25 08:49:59,285 INFO L132 ssoRankerPreferences]: Path of dumped script: [2019-11-25 08:49:59,285 INFO L133 ssoRankerPreferences]: Filename of dumped script: bubblesort-alloca-2.i_Iteration2_Loop [2019-11-25 08:49:59,285 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2019-11-25 08:49:59,285 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2019-11-25 08:49:59,286 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-25 08:49:59,290 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-25 08:49:59,294 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-25 08:49:59,297 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-25 08:49:59,308 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-25 08:49:59,379 INFO L292 LassoAnalysis]: Preprocessing complete. [2019-11-25 08:49:59,380 INFO L404 LassoAnalysis]: Checking for nontermination... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_99c1e841-74b8-4f89-a61d-1452bff951cb/bin/uautomizer/z3 Starting monitored process 9 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-11-25 08:49:59,386 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-11-25 08:49:59,386 INFO L160 nArgumentSynthesizer]: Using integer mode. Waiting until toolchain timeout for monitored process 9 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-25 08:49:59,393 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2019-11-25 08:49:59,393 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_bubbleSort_#t~post2=0} Honda state: {ULTIMATE.start_bubbleSort_#t~post2=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_99c1e841-74b8-4f89-a61d-1452bff951cb/bin/uautomizer/z3 Starting monitored process 10 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-11-25 08:49:59,404 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-11-25 08:49:59,404 INFO L160 nArgumentSynthesizer]: Using integer mode. Waiting until toolchain timeout for monitored process 10 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-25 08:49:59,412 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2019-11-25 08:49:59,413 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {v_rep~unnamed0~0~P_PID_2=1} Honda state: {v_rep~unnamed0~0~P_PID_2=1} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_99c1e841-74b8-4f89-a61d-1452bff951cb/bin/uautomizer/z3 Starting monitored process 11 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-11-25 08:49:59,425 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-11-25 08:49:59,425 INFO L160 nArgumentSynthesizer]: Using integer mode. Waiting until toolchain timeout for monitored process 11 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-25 08:49:59,448 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2019-11-25 08:49:59,449 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {v_rep~unnamed0~0~P_PGID_2=2} Honda state: {v_rep~unnamed0~0~P_PGID_2=2} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_99c1e841-74b8-4f89-a61d-1452bff951cb/bin/uautomizer/z3 Starting monitored process 12 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 12 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-25 08:49:59,537 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-11-25 08:49:59,537 INFO L160 nArgumentSynthesizer]: Using integer mode. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_99c1e841-74b8-4f89-a61d-1452bff951cb/bin/uautomizer/z3 Starting monitored process 13 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-11-25 08:49:59,564 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2019-11-25 08:49:59,564 INFO L160 nArgumentSynthesizer]: Using integer mode. Waiting until toolchain timeout for monitored process 13 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-25 08:49:59,576 INFO L444 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2019-11-25 08:49:59,578 INFO L210 LassoAnalysis]: Preferences: [2019-11-25 08:49:59,578 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2019-11-25 08:49:59,578 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-11-25 08:49:59,578 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2019-11-25 08:49:59,578 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2019-11-25 08:49:59,579 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-25 08:49:59,579 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2019-11-25 08:49:59,579 INFO L132 ssoRankerPreferences]: Path of dumped script: [2019-11-25 08:49:59,579 INFO L133 ssoRankerPreferences]: Filename of dumped script: bubblesort-alloca-2.i_Iteration2_Loop [2019-11-25 08:49:59,579 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2019-11-25 08:49:59,579 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2019-11-25 08:49:59,580 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-25 08:49:59,584 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-25 08:49:59,587 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-25 08:49:59,597 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-25 08:49:59,601 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-25 08:49:59,665 INFO L292 LassoAnalysis]: Preprocessing complete. [2019-11-25 08:49:59,666 INFO L489 LassoAnalysis]: Using template 'affine'. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_99c1e841-74b8-4f89-a61d-1452bff951cb/bin/uautomizer/z3 Starting monitored process 14 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-11-25 08:49:59,685 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-25 08:49:59,687 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-25 08:49:59,687 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-25 08:49:59,687 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-25 08:49:59,687 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-25 08:49:59,687 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-25 08:49:59,688 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-25 08:49:59,688 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. Waiting until toolchain timeout for monitored process 14 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-25 08:49:59,691 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_99c1e841-74b8-4f89-a61d-1452bff951cb/bin/uautomizer/z3 Starting monitored process 15 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 15 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-25 08:49:59,701 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-25 08:49:59,702 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-25 08:49:59,702 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-25 08:49:59,703 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-25 08:49:59,703 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-25 08:49:59,705 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-25 08:49:59,705 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-25 08:49:59,711 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_99c1e841-74b8-4f89-a61d-1452bff951cb/bin/uautomizer/z3 Starting monitored process 16 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 16 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-25 08:49:59,725 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-25 08:49:59,726 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-25 08:49:59,727 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-25 08:49:59,727 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-25 08:49:59,727 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-25 08:49:59,727 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-25 08:49:59,728 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-25 08:49:59,729 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-25 08:49:59,732 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-11-25 08:49:59,740 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2019-11-25 08:49:59,740 INFO L444 ModelExtractionUtils]: 1 out of 4 variables were initially zero. Simplification set additionally 0 variables to zero. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_99c1e841-74b8-4f89-a61d-1452bff951cb/bin/uautomizer/z3 Starting monitored process 17 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-11-25 08:49:59,752 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-11-25 08:49:59,752 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2019-11-25 08:49:59,753 INFO L510 LassoAnalysis]: Proved termination. [2019-11-25 08:49:59,753 INFO L512 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_bubbleSort_~i~0) = 2*ULTIMATE.start_bubbleSort_~i~0 + 1 Supporting invariants [] Waiting until toolchain timeout for monitored process 17 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-25 08:49:59,755 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2019-11-25 08:49:59,780 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 08:49:59,796 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 08:49:59,797 INFO L255 TraceCheckSpWp]: Trace formula consists of 41 conjuncts, 2 conjunts are in the unsatisfiable core [2019-11-25 08:49:59,797 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-25 08:49:59,803 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 08:49:59,803 WARN L253 TraceCheckSpWp]: Trace formula consists of 8 conjuncts, 4 conjunts are in the unsatisfiable core [2019-11-25 08:49:59,804 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-25 08:49:59,819 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-25 08:49:59,820 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2019-11-25 08:49:59,820 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 13 states and 18 transitions. cyclomatic complexity: 7 Second operand 3 states. [2019-11-25 08:49:59,849 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 13 states and 18 transitions. cyclomatic complexity: 7. Second operand 3 states. Result 19 states and 28 transitions. Complement of second has 4 states. [2019-11-25 08:49:59,852 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 3 states 1 stem states 1 non-accepting loop states 1 accepting loop states [2019-11-25 08:49:59,852 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2019-11-25 08:49:59,853 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 16 transitions. [2019-11-25 08:49:59,853 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 16 transitions. Stem has 6 letters. Loop has 3 letters. [2019-11-25 08:49:59,853 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-25 08:49:59,853 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 16 transitions. Stem has 9 letters. Loop has 3 letters. [2019-11-25 08:49:59,853 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-25 08:49:59,853 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 16 transitions. Stem has 6 letters. Loop has 6 letters. [2019-11-25 08:49:59,854 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-25 08:49:59,854 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 19 states and 28 transitions. [2019-11-25 08:49:59,855 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2019-11-25 08:49:59,855 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 19 states to 18 states and 26 transitions. [2019-11-25 08:49:59,856 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 10 [2019-11-25 08:49:59,856 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 11 [2019-11-25 08:49:59,856 INFO L73 IsDeterministic]: Start isDeterministic. Operand 18 states and 26 transitions. [2019-11-25 08:49:59,856 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-11-25 08:49:59,856 INFO L688 BuchiCegarLoop]: Abstraction has 18 states and 26 transitions. [2019-11-25 08:49:59,856 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18 states and 26 transitions. [2019-11-25 08:49:59,857 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18 to 17. [2019-11-25 08:49:59,858 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2019-11-25 08:49:59,858 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 25 transitions. [2019-11-25 08:49:59,858 INFO L711 BuchiCegarLoop]: Abstraction has 17 states and 25 transitions. [2019-11-25 08:49:59,858 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-25 08:49:59,864 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-25 08:49:59,866 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-25 08:49:59,867 INFO L87 Difference]: Start difference. First operand 17 states and 25 transitions. Second operand 4 states. [2019-11-25 08:49:59,897 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-25 08:49:59,897 INFO L93 Difference]: Finished difference Result 18 states and 25 transitions. [2019-11-25 08:49:59,898 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-25 08:49:59,898 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 18 states and 25 transitions. [2019-11-25 08:49:59,899 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2019-11-25 08:49:59,900 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 18 states to 18 states and 25 transitions. [2019-11-25 08:49:59,900 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 10 [2019-11-25 08:49:59,900 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 10 [2019-11-25 08:49:59,900 INFO L73 IsDeterministic]: Start isDeterministic. Operand 18 states and 25 transitions. [2019-11-25 08:49:59,900 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-11-25 08:49:59,901 INFO L688 BuchiCegarLoop]: Abstraction has 18 states and 25 transitions. [2019-11-25 08:49:59,901 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18 states and 25 transitions. [2019-11-25 08:49:59,904 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18 to 17. [2019-11-25 08:49:59,904 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2019-11-25 08:49:59,905 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 24 transitions. [2019-11-25 08:49:59,905 INFO L711 BuchiCegarLoop]: Abstraction has 17 states and 24 transitions. [2019-11-25 08:49:59,905 INFO L591 BuchiCegarLoop]: Abstraction has 17 states and 24 transitions. [2019-11-25 08:49:59,906 INFO L424 BuchiCegarLoop]: ======== Iteration 3============ [2019-11-25 08:49:59,906 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 17 states and 24 transitions. [2019-11-25 08:49:59,906 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2019-11-25 08:49:59,908 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-25 08:49:59,908 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-25 08:49:59,909 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-25 08:49:59,910 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2019-11-25 08:49:59,910 INFO L794 eck$LassoCheckResult]: Stem: 234#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; 232#L-1 havoc main_#res;havoc main_#t~nondet8, main_#t~malloc9.base, main_#t~malloc9.offset, main_#t~nondet11, main_#t~post10, main_~k~0, main_~array_size~0, main_~numbers~0.base, main_~numbers~0.offset;main_~array_size~0 := main_#t~nondet8;havoc main_#t~nondet8; 233#L527 assume !(main_~array_size~0 < 1 || main_~array_size~0 >= 536870911); 235#L527-2 call main_#t~malloc9.base, main_#t~malloc9.offset := #Ultimate.allocOnStack(4 * main_~array_size~0);main_~numbers~0.base, main_~numbers~0.offset := main_#t~malloc9.base, main_#t~malloc9.offset;main_~k~0 := 0; 236#L532-3 assume !!(main_~k~0 < main_~array_size~0);call write~int(main_#t~nondet11, main_~numbers~0.base, main_~numbers~0.offset + 4 * main_~k~0, 4);havoc main_#t~nondet11; 241#L532-2 main_#t~post10 := main_~k~0;main_~k~0 := 1 + main_#t~post10;havoc main_#t~post10; 242#L532-3 assume !(main_~k~0 < main_~array_size~0); 247#L532-4 bubbleSort_#in~numbers.base, bubbleSort_#in~numbers.offset, bubbleSort_#in~array_size := main_~numbers~0.base, main_~numbers~0.offset, main_~array_size~0;havoc bubbleSort_#t~mem4, bubbleSort_#t~mem5, bubbleSort_#t~mem6, bubbleSort_#t~mem7, bubbleSort_#t~post3, bubbleSort_#t~post2, bubbleSort_~numbers.base, bubbleSort_~numbers.offset, bubbleSort_~array_size, bubbleSort_~i~0, bubbleSort_~j~0, bubbleSort_~temp~0;bubbleSort_~numbers.base, bubbleSort_~numbers.offset := bubbleSort_#in~numbers.base, bubbleSort_#in~numbers.offset;bubbleSort_~array_size := bubbleSort_#in~array_size;havoc bubbleSort_~i~0;havoc bubbleSort_~j~0;havoc bubbleSort_~temp~0;bubbleSort_~i~0 := bubbleSort_~array_size - 1; 248#L515-3 assume !!(bubbleSort_~i~0 >= 0);bubbleSort_~j~0 := 1; 238#L516-3 [2019-11-25 08:49:59,911 INFO L796 eck$LassoCheckResult]: Loop: 238#L516-3 assume !!(bubbleSort_~j~0 <= bubbleSort_~i~0);call bubbleSort_#t~mem4 := read~int(bubbleSort_~numbers.base, bubbleSort_~numbers.offset + 4 * (bubbleSort_~j~0 - 1), 4);call bubbleSort_#t~mem5 := read~int(bubbleSort_~numbers.base, bubbleSort_~numbers.offset + 4 * bubbleSort_~j~0, 4); 243#L517 assume bubbleSort_#t~mem4 > bubbleSort_#t~mem5;havoc bubbleSort_#t~mem5;havoc bubbleSort_#t~mem4;call bubbleSort_#t~mem6 := read~int(bubbleSort_~numbers.base, bubbleSort_~numbers.offset + 4 * (bubbleSort_~j~0 - 1), 4);bubbleSort_~temp~0 := bubbleSort_#t~mem6;havoc bubbleSort_#t~mem6;call bubbleSort_#t~mem7 := read~int(bubbleSort_~numbers.base, bubbleSort_~numbers.offset + 4 * bubbleSort_~j~0, 4);call write~int(bubbleSort_#t~mem7, bubbleSort_~numbers.base, bubbleSort_~numbers.offset + 4 * (bubbleSort_~j~0 - 1), 4);havoc bubbleSort_#t~mem7;call write~int(bubbleSort_~temp~0, bubbleSort_~numbers.base, bubbleSort_~numbers.offset + 4 * bubbleSort_~j~0, 4); 237#L516-2 bubbleSort_#t~post3 := bubbleSort_~j~0;bubbleSort_~j~0 := 1 + bubbleSort_#t~post3;havoc bubbleSort_#t~post3; 238#L516-3 [2019-11-25 08:49:59,911 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 08:49:59,911 INFO L82 PathProgramCache]: Analyzing trace with hash 1185641744, now seen corresponding path program 1 times [2019-11-25 08:49:59,911 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-25 08:49:59,912 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1261420990] [2019-11-25 08:49:59,912 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-25 08:49:59,935 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-25 08:49:59,968 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-25 08:49:59,973 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-25 08:49:59,977 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 08:49:59,978 INFO L82 PathProgramCache]: Analyzing trace with hash 68618, now seen corresponding path program 1 times [2019-11-25 08:49:59,979 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-25 08:49:59,980 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [589214396] [2019-11-25 08:49:59,980 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-25 08:49:59,987 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-25 08:49:59,998 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-25 08:50:00,008 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-25 08:50:00,008 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 08:50:00,008 INFO L82 PathProgramCache]: Analyzing trace with hash -357807973, now seen corresponding path program 1 times [2019-11-25 08:50:00,009 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-25 08:50:00,009 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1072270926] [2019-11-25 08:50:00,009 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-25 08:50:00,034 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 08:50:00,135 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-25 08:50:00,136 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1072270926] [2019-11-25 08:50:00,136 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1825923748] [2019-11-25 08:50:00,136 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_99c1e841-74b8-4f89-a61d-1452bff951cb/bin/uautomizer/z3 Starting monitored process 18 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 18 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [MP z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (8)] Exception during sending of exit command (exit): Broken pipe [2019-11-25 08:50:00,213 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 08:50:00,214 INFO L255 TraceCheckSpWp]: Trace formula consists of 75 conjuncts, 8 conjunts are in the unsatisfiable core [2019-11-25 08:50:00,215 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-25 08:50:00,286 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-25 08:50:00,286 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-25 08:50:00,287 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 7] total 11 [2019-11-25 08:50:00,287 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1146630447] [2019-11-25 08:50:00,385 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-25 08:50:00,385 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-11-25 08:50:00,385 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2019-11-25 08:50:00,386 INFO L87 Difference]: Start difference. First operand 17 states and 24 transitions. cyclomatic complexity: 10 Second operand 11 states. [2019-11-25 08:50:00,554 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-25 08:50:00,554 INFO L93 Difference]: Finished difference Result 30 states and 40 transitions. [2019-11-25 08:50:00,554 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-11-25 08:50:00,554 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 30 states and 40 transitions. [2019-11-25 08:50:00,556 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2019-11-25 08:50:00,556 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 30 states to 20 states and 26 transitions. [2019-11-25 08:50:00,556 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 10 [2019-11-25 08:50:00,557 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 10 [2019-11-25 08:50:00,557 INFO L73 IsDeterministic]: Start isDeterministic. Operand 20 states and 26 transitions. [2019-11-25 08:50:00,557 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-11-25 08:50:00,557 INFO L688 BuchiCegarLoop]: Abstraction has 20 states and 26 transitions. [2019-11-25 08:50:00,557 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20 states and 26 transitions. [2019-11-25 08:50:00,558 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20 to 19. [2019-11-25 08:50:00,558 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2019-11-25 08:50:00,559 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 25 transitions. [2019-11-25 08:50:00,559 INFO L711 BuchiCegarLoop]: Abstraction has 19 states and 25 transitions. [2019-11-25 08:50:00,559 INFO L591 BuchiCegarLoop]: Abstraction has 19 states and 25 transitions. [2019-11-25 08:50:00,559 INFO L424 BuchiCegarLoop]: ======== Iteration 4============ [2019-11-25 08:50:00,559 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 19 states and 25 transitions. [2019-11-25 08:50:00,560 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2019-11-25 08:50:00,560 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-25 08:50:00,561 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-25 08:50:00,561 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 1, 1, 1, 1, 1, 1, 1] [2019-11-25 08:50:00,561 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2019-11-25 08:50:00,561 INFO L794 eck$LassoCheckResult]: Stem: 338#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; 336#L-1 havoc main_#res;havoc main_#t~nondet8, main_#t~malloc9.base, main_#t~malloc9.offset, main_#t~nondet11, main_#t~post10, main_~k~0, main_~array_size~0, main_~numbers~0.base, main_~numbers~0.offset;main_~array_size~0 := main_#t~nondet8;havoc main_#t~nondet8; 337#L527 assume !(main_~array_size~0 < 1 || main_~array_size~0 >= 536870911); 339#L527-2 call main_#t~malloc9.base, main_#t~malloc9.offset := #Ultimate.allocOnStack(4 * main_~array_size~0);main_~numbers~0.base, main_~numbers~0.offset := main_#t~malloc9.base, main_#t~malloc9.offset;main_~k~0 := 0; 340#L532-3 assume !!(main_~k~0 < main_~array_size~0);call write~int(main_#t~nondet11, main_~numbers~0.base, main_~numbers~0.offset + 4 * main_~k~0, 4);havoc main_#t~nondet11; 341#L532-2 main_#t~post10 := main_~k~0;main_~k~0 := 1 + main_#t~post10;havoc main_#t~post10; 342#L532-3 assume !!(main_~k~0 < main_~array_size~0);call write~int(main_#t~nondet11, main_~numbers~0.base, main_~numbers~0.offset + 4 * main_~k~0, 4);havoc main_#t~nondet11; 351#L532-2 main_#t~post10 := main_~k~0;main_~k~0 := 1 + main_#t~post10;havoc main_#t~post10; 354#L532-3 assume !(main_~k~0 < main_~array_size~0); 352#L532-4 bubbleSort_#in~numbers.base, bubbleSort_#in~numbers.offset, bubbleSort_#in~array_size := main_~numbers~0.base, main_~numbers~0.offset, main_~array_size~0;havoc bubbleSort_#t~mem4, bubbleSort_#t~mem5, bubbleSort_#t~mem6, bubbleSort_#t~mem7, bubbleSort_#t~post3, bubbleSort_#t~post2, bubbleSort_~numbers.base, bubbleSort_~numbers.offset, bubbleSort_~array_size, bubbleSort_~i~0, bubbleSort_~j~0, bubbleSort_~temp~0;bubbleSort_~numbers.base, bubbleSort_~numbers.offset := bubbleSort_#in~numbers.base, bubbleSort_#in~numbers.offset;bubbleSort_~array_size := bubbleSort_#in~array_size;havoc bubbleSort_~i~0;havoc bubbleSort_~j~0;havoc bubbleSort_~temp~0;bubbleSort_~i~0 := bubbleSort_~array_size - 1; 353#L515-3 assume !!(bubbleSort_~i~0 >= 0);bubbleSort_~j~0 := 1; 344#L516-3 [2019-11-25 08:50:00,562 INFO L796 eck$LassoCheckResult]: Loop: 344#L516-3 assume !!(bubbleSort_~j~0 <= bubbleSort_~i~0);call bubbleSort_#t~mem4 := read~int(bubbleSort_~numbers.base, bubbleSort_~numbers.offset + 4 * (bubbleSort_~j~0 - 1), 4);call bubbleSort_#t~mem5 := read~int(bubbleSort_~numbers.base, bubbleSort_~numbers.offset + 4 * bubbleSort_~j~0, 4); 347#L517 assume bubbleSort_#t~mem4 > bubbleSort_#t~mem5;havoc bubbleSort_#t~mem5;havoc bubbleSort_#t~mem4;call bubbleSort_#t~mem6 := read~int(bubbleSort_~numbers.base, bubbleSort_~numbers.offset + 4 * (bubbleSort_~j~0 - 1), 4);bubbleSort_~temp~0 := bubbleSort_#t~mem6;havoc bubbleSort_#t~mem6;call bubbleSort_#t~mem7 := read~int(bubbleSort_~numbers.base, bubbleSort_~numbers.offset + 4 * bubbleSort_~j~0, 4);call write~int(bubbleSort_#t~mem7, bubbleSort_~numbers.base, bubbleSort_~numbers.offset + 4 * (bubbleSort_~j~0 - 1), 4);havoc bubbleSort_#t~mem7;call write~int(bubbleSort_~temp~0, bubbleSort_~numbers.base, bubbleSort_~numbers.offset + 4 * bubbleSort_~j~0, 4); 343#L516-2 bubbleSort_#t~post3 := bubbleSort_~j~0;bubbleSort_~j~0 := 1 + bubbleSort_#t~post3;havoc bubbleSort_#t~post3; 344#L516-3 [2019-11-25 08:50:00,562 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 08:50:00,562 INFO L82 PathProgramCache]: Analyzing trace with hash 1237095790, now seen corresponding path program 2 times [2019-11-25 08:50:00,562 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-25 08:50:00,562 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1058819732] [2019-11-25 08:50:00,563 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-25 08:50:00,575 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-25 08:50:00,586 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-25 08:50:00,590 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-25 08:50:00,590 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 08:50:00,591 INFO L82 PathProgramCache]: Analyzing trace with hash 68618, now seen corresponding path program 2 times [2019-11-25 08:50:00,591 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-25 08:50:00,591 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [489316117] [2019-11-25 08:50:00,591 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-25 08:50:00,596 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-25 08:50:00,600 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-25 08:50:00,602 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-25 08:50:00,602 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 08:50:00,603 INFO L82 PathProgramCache]: Analyzing trace with hash -793648259, now seen corresponding path program 2 times [2019-11-25 08:50:00,603 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-25 08:50:00,603 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [102807443] [2019-11-25 08:50:00,603 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-25 08:50:00,622 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-25 08:50:00,643 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-25 08:50:00,656 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-25 08:50:01,008 WARN L192 SmtUtils]: Spent 260.00 ms on a formula simplification. DAG size of input: 103 DAG size of output: 81 [2019-11-25 08:50:01,099 INFO L210 LassoAnalysis]: Preferences: [2019-11-25 08:50:01,099 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2019-11-25 08:50:01,099 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-11-25 08:50:01,099 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2019-11-25 08:50:01,099 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2019-11-25 08:50:01,100 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-25 08:50:01,100 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2019-11-25 08:50:01,100 INFO L132 ssoRankerPreferences]: Path of dumped script: [2019-11-25 08:50:01,100 INFO L133 ssoRankerPreferences]: Filename of dumped script: bubblesort-alloca-2.i_Iteration4_Lasso [2019-11-25 08:50:01,100 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2019-11-25 08:50:01,100 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2019-11-25 08:50:01,106 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-25 08:50:01,109 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-25 08:50:01,112 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-25 08:50:01,114 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-25 08:50:01,272 WARN L192 SmtUtils]: Spent 135.00 ms on a formula simplification. DAG size of input: 52 DAG size of output: 49 [2019-11-25 08:50:01,324 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-25 08:50:01,329 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-25 08:50:01,331 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-25 08:50:01,332 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-25 08:50:01,335 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-25 08:50:01,336 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-25 08:50:01,338 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-25 08:50:01,340 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-25 08:50:01,342 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-25 08:50:01,344 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-25 08:50:01,346 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-25 08:50:01,348 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-25 08:50:01,670 INFO L292 LassoAnalysis]: Preprocessing complete. [2019-11-25 08:50:01,670 INFO L489 LassoAnalysis]: Using template 'affine'. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_99c1e841-74b8-4f89-a61d-1452bff951cb/bin/uautomizer/z3 Starting monitored process 19 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 19 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-25 08:50:01,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-11-25 08:50:01,680 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-25 08:50:01,681 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-25 08:50:01,681 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-25 08:50:01,681 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-25 08:50:01,681 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-25 08:50:01,681 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-25 08:50:01,681 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-25 08:50:01,682 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_99c1e841-74b8-4f89-a61d-1452bff951cb/bin/uautomizer/z3 Starting monitored process 20 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 20 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-25 08:50:01,691 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-25 08:50:01,692 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-25 08:50:01,692 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-25 08:50:01,692 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-25 08:50:01,692 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-25 08:50:01,694 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-25 08:50:01,694 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-25 08:50:01,697 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_99c1e841-74b8-4f89-a61d-1452bff951cb/bin/uautomizer/z3 Starting monitored process 21 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 21 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-25 08:50:01,710 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-25 08:50:01,711 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-25 08:50:01,712 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-25 08:50:01,712 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-25 08:50:01,712 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-25 08:50:01,712 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-25 08:50:01,713 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-25 08:50:01,713 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-25 08:50:01,714 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_99c1e841-74b8-4f89-a61d-1452bff951cb/bin/uautomizer/z3 Starting monitored process 22 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 22 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-25 08:50:01,725 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-25 08:50:01,726 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-25 08:50:01,727 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-25 08:50:01,727 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-25 08:50:01,727 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-25 08:50:01,742 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-25 08:50:01,742 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-25 08:50:01,759 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-11-25 08:50:01,819 INFO L443 ModelExtractionUtils]: Simplification made 20 calls to the SMT solver. [2019-11-25 08:50:01,819 INFO L444 ModelExtractionUtils]: 10 out of 40 variables were initially zero. Simplification set additionally 26 variables to zero. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_99c1e841-74b8-4f89-a61d-1452bff951cb/bin/uautomizer/z3 Starting monitored process 23 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 23 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-25 08:50:01,823 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-11-25 08:50:01,828 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2019-11-25 08:50:01,828 INFO L510 LassoAnalysis]: Proved termination. [2019-11-25 08:50:01,829 INFO L512 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_bubbleSort_~numbers.offset, ULTIMATE.start_bubbleSort_~j~0, v_rep(select #length ULTIMATE.start_main_#t~malloc9.base)_2) = -1*ULTIMATE.start_bubbleSort_~numbers.offset - 4*ULTIMATE.start_bubbleSort_~j~0 + 2*v_rep(select #length ULTIMATE.start_main_#t~malloc9.base)_2 Supporting invariants [] [2019-11-25 08:50:01,843 INFO L297 tatePredicateManager]: 3 out of 4 supporting invariants were superfluous and have been removed [2019-11-25 08:50:01,845 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2019-11-25 08:50:01,869 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 08:50:01,884 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 08:50:01,885 INFO L255 TraceCheckSpWp]: Trace formula consists of 60 conjuncts, 8 conjunts are in the unsatisfiable core [2019-11-25 08:50:01,886 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-25 08:50:01,915 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 08:50:01,916 INFO L255 TraceCheckSpWp]: Trace formula consists of 27 conjuncts, 7 conjunts are in the unsatisfiable core [2019-11-25 08:50:01,916 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-25 08:50:01,935 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-25 08:50:01,935 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.3 stem predicates 2 loop predicates [2019-11-25 08:50:01,935 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 19 states and 25 transitions. cyclomatic complexity: 9 Second operand 5 states. [2019-11-25 08:50:01,994 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 19 states and 25 transitions. cyclomatic complexity: 9. Second operand 5 states. Result 34 states and 47 transitions. Complement of second has 9 states. [2019-11-25 08:50:01,995 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 6 states 3 stem states 2 non-accepting loop states 1 accepting loop states [2019-11-25 08:50:01,995 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2019-11-25 08:50:01,995 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 15 transitions. [2019-11-25 08:50:01,996 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 15 transitions. Stem has 11 letters. Loop has 3 letters. [2019-11-25 08:50:01,996 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-25 08:50:01,996 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 15 transitions. Stem has 14 letters. Loop has 3 letters. [2019-11-25 08:50:01,996 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-25 08:50:01,996 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 15 transitions. Stem has 11 letters. Loop has 6 letters. [2019-11-25 08:50:01,997 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-25 08:50:01,997 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 34 states and 47 transitions. [2019-11-25 08:50:01,998 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2019-11-25 08:50:01,998 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 34 states to 24 states and 32 transitions. [2019-11-25 08:50:01,998 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 10 [2019-11-25 08:50:01,998 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 10 [2019-11-25 08:50:01,999 INFO L73 IsDeterministic]: Start isDeterministic. Operand 24 states and 32 transitions. [2019-11-25 08:50:01,999 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-11-25 08:50:01,999 INFO L688 BuchiCegarLoop]: Abstraction has 24 states and 32 transitions. [2019-11-25 08:50:01,999 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states and 32 transitions. [2019-11-25 08:50:02,000 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 19. [2019-11-25 08:50:02,000 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2019-11-25 08:50:02,000 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 24 transitions. [2019-11-25 08:50:02,001 INFO L711 BuchiCegarLoop]: Abstraction has 19 states and 24 transitions. [2019-11-25 08:50:02,001 INFO L591 BuchiCegarLoop]: Abstraction has 19 states and 24 transitions. [2019-11-25 08:50:02,001 INFO L424 BuchiCegarLoop]: ======== Iteration 5============ [2019-11-25 08:50:02,001 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 19 states and 24 transitions. [2019-11-25 08:50:02,001 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2019-11-25 08:50:02,001 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-25 08:50:02,002 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-25 08:50:02,002 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-25 08:50:02,002 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2019-11-25 08:50:02,002 INFO L794 eck$LassoCheckResult]: Stem: 484#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; 482#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; 483#L527 assume !(main_~array_size~0 < 1 || main_~array_size~0 >= 536870911); 485#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; 486#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; 491#L532-2 main_#t~post10 := main_~k~0;main_~k~0 := 1 + main_#t~post10;havoc main_#t~post10; 492#L532-3 assume !!(main_~k~0 < main_~array_size~0);call write~int(main_#t~nondet11, main_~numbers~0.base, main_~numbers~0.offset + 4 * main_~k~0, 4);havoc main_#t~nondet11; 497#L532-2 main_#t~post10 := main_~k~0;main_~k~0 := 1 + main_#t~post10;havoc main_#t~post10; 500#L532-3 assume !(main_~k~0 < main_~array_size~0); 499#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; 498#L515-3 assume !!(bubbleSort_~i~0 >= 0);bubbleSort_~j~0 := 1; 490#L516-3 assume !(bubbleSort_~j~0 <= bubbleSort_~i~0); 494#L515-2 bubbleSort_#t~post2 := bubbleSort_~i~0;bubbleSort_~i~0 := bubbleSort_#t~post2 - 1;havoc bubbleSort_#t~post2; 496#L515-3 assume !!(bubbleSort_~i~0 >= 0);bubbleSort_~j~0 := 1; 488#L516-3 [2019-11-25 08:50:02,002 INFO L796 eck$LassoCheckResult]: Loop: 488#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); 493#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); 487#L516-2 bubbleSort_#t~post3 := bubbleSort_~j~0;bubbleSort_~j~0 := 1 + bubbleSort_#t~post3;havoc bubbleSort_#t~post3; 488#L516-3 [2019-11-25 08:50:02,002 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 08:50:02,003 INFO L82 PathProgramCache]: Analyzing trace with hash -793649948, now seen corresponding path program 1 times [2019-11-25 08:50:02,003 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-25 08:50:02,003 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [562039548] [2019-11-25 08:50:02,003 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-25 08:50:02,013 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 08:50:02,090 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 3 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-25 08:50:02,091 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [562039548] [2019-11-25 08:50:02,091 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [184070273] [2019-11-25 08:50:02,091 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_99c1e841-74b8-4f89-a61d-1452bff951cb/bin/uautomizer/z3 Starting monitored process 24 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 24 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-25 08:50:02,135 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 08:50:02,136 INFO L255 TraceCheckSpWp]: Trace formula consists of 66 conjuncts, 8 conjunts are in the unsatisfiable core [2019-11-25 08:50:02,137 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-25 08:50:02,169 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 2 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-25 08:50:02,169 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-25 08:50:02,170 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 7] total 12 [2019-11-25 08:50:02,170 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1833841154] [2019-11-25 08:50:02,170 INFO L799 eck$LassoCheckResult]: stem already infeasible [2019-11-25 08:50:02,170 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 08:50:02,170 INFO L82 PathProgramCache]: Analyzing trace with hash 68618, now seen corresponding path program 3 times [2019-11-25 08:50:02,170 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-25 08:50:02,170 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1713678015] [2019-11-25 08:50:02,171 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-25 08:50:02,174 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-25 08:50:02,178 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-25 08:50:02,179 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-25 08:50:02,285 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-25 08:50:02,285 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-11-25 08:50:02,286 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=99, Unknown=0, NotChecked=0, Total=132 [2019-11-25 08:50:02,286 INFO L87 Difference]: Start difference. First operand 19 states and 24 transitions. cyclomatic complexity: 8 Second operand 12 states. [2019-11-25 08:50:02,389 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-25 08:50:02,389 INFO L93 Difference]: Finished difference Result 26 states and 34 transitions. [2019-11-25 08:50:02,390 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-11-25 08:50:02,390 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 26 states and 34 transitions. [2019-11-25 08:50:02,391 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2019-11-25 08:50:02,392 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 26 states to 26 states and 34 transitions. [2019-11-25 08:50:02,392 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 10 [2019-11-25 08:50:02,392 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 10 [2019-11-25 08:50:02,392 INFO L73 IsDeterministic]: Start isDeterministic. Operand 26 states and 34 transitions. [2019-11-25 08:50:02,392 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-11-25 08:50:02,392 INFO L688 BuchiCegarLoop]: Abstraction has 26 states and 34 transitions. [2019-11-25 08:50:02,393 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states and 34 transitions. [2019-11-25 08:50:02,394 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 20. [2019-11-25 08:50:02,394 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2019-11-25 08:50:02,394 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 25 transitions. [2019-11-25 08:50:02,394 INFO L711 BuchiCegarLoop]: Abstraction has 20 states and 25 transitions. [2019-11-25 08:50:02,394 INFO L591 BuchiCegarLoop]: Abstraction has 20 states and 25 transitions. [2019-11-25 08:50:02,395 INFO L424 BuchiCegarLoop]: ======== Iteration 6============ [2019-11-25 08:50:02,395 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 20 states and 25 transitions. [2019-11-25 08:50:02,395 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2019-11-25 08:50:02,395 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-25 08:50:02,395 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-25 08:50:02,396 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-25 08:50:02,396 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2019-11-25 08:50:02,396 INFO L794 eck$LassoCheckResult]: Stem: 589#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; 587#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; 588#L527 assume !(main_~array_size~0 < 1 || main_~array_size~0 >= 536870911); 590#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; 591#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; 603#L532-2 main_#t~post10 := main_~k~0;main_~k~0 := 1 + main_#t~post10;havoc main_#t~post10; 604#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; 596#L532-2 main_#t~post10 := main_~k~0;main_~k~0 := 1 + main_#t~post10;havoc main_#t~post10; 597#L532-3 assume !(main_~k~0 < main_~array_size~0); 606#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; 605#L515-3 assume !!(bubbleSort_~i~0 >= 0);bubbleSort_~j~0 := 1; 601#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); 602#L517 assume !(bubbleSort_#t~mem4 > bubbleSort_#t~mem5);havoc bubbleSort_#t~mem5;havoc bubbleSort_#t~mem4; 594#L516-2 bubbleSort_#t~post3 := bubbleSort_~j~0;bubbleSort_~j~0 := 1 + bubbleSort_#t~post3;havoc bubbleSort_#t~post3; 595#L516-3 assume !(bubbleSort_~j~0 <= bubbleSort_~i~0); 598#L515-2 bubbleSort_#t~post2 := bubbleSort_~i~0;bubbleSort_~i~0 := bubbleSort_#t~post2 - 1;havoc bubbleSort_#t~post2; 599#L515-3 assume !!(bubbleSort_~i~0 >= 0);bubbleSort_~j~0 := 1; 593#L516-3 [2019-11-25 08:50:02,396 INFO L796 eck$LassoCheckResult]: Loop: 593#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); 600#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); 592#L516-2 bubbleSort_#t~post3 := bubbleSort_~j~0;bubbleSort_~j~0 := 1 + bubbleSort_#t~post3;havoc bubbleSort_#t~post3; 593#L516-3 [2019-11-25 08:50:02,397 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 08:50:02,397 INFO L82 PathProgramCache]: Analyzing trace with hash 221564791, now seen corresponding path program 1 times [2019-11-25 08:50:02,397 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-25 08:50:02,397 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1431865785] [2019-11-25 08:50:02,397 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-25 08:50:02,423 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-25 08:50:02,444 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-25 08:50:02,449 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-25 08:50:02,450 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 08:50:02,450 INFO L82 PathProgramCache]: Analyzing trace with hash 68618, now seen corresponding path program 4 times [2019-11-25 08:50:02,450 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-25 08:50:02,451 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1530786129] [2019-11-25 08:50:02,451 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-25 08:50:02,455 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-25 08:50:02,458 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-25 08:50:02,460 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-25 08:50:02,460 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 08:50:02,461 INFO L82 PathProgramCache]: Analyzing trace with hash -728006444, now seen corresponding path program 1 times [2019-11-25 08:50:02,461 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-25 08:50:02,461 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1697028266] [2019-11-25 08:50:02,461 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-25 08:50:02,473 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 08:50:02,562 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 5 proven. 4 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-11-25 08:50:02,563 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1697028266] [2019-11-25 08:50:02,563 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1494303188] [2019-11-25 08:50:02,563 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_99c1e841-74b8-4f89-a61d-1452bff951cb/bin/uautomizer/z3 Starting monitored process 25 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 25 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-25 08:50:02,616 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 08:50:02,617 INFO L255 TraceCheckSpWp]: Trace formula consists of 103 conjuncts, 10 conjunts are in the unsatisfiable core [2019-11-25 08:50:02,618 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-25 08:50:02,684 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 5 proven. 4 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-11-25 08:50:02,685 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-25 08:50:02,685 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 9] total 15 [2019-11-25 08:50:02,685 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1532120141] [2019-11-25 08:50:02,753 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-25 08:50:02,754 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2019-11-25 08:50:02,754 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=163, Unknown=0, NotChecked=0, Total=210 [2019-11-25 08:50:02,754 INFO L87 Difference]: Start difference. First operand 20 states and 25 transitions. cyclomatic complexity: 8 Second operand 15 states. [2019-11-25 08:50:02,915 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-25 08:50:02,915 INFO L93 Difference]: Finished difference Result 35 states and 44 transitions. [2019-11-25 08:50:02,916 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-11-25 08:50:02,916 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 35 states and 44 transitions. [2019-11-25 08:50:02,916 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2019-11-25 08:50:02,917 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 35 states to 23 states and 28 transitions. [2019-11-25 08:50:02,917 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 10 [2019-11-25 08:50:02,917 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 10 [2019-11-25 08:50:02,917 INFO L73 IsDeterministic]: Start isDeterministic. Operand 23 states and 28 transitions. [2019-11-25 08:50:02,917 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-11-25 08:50:02,917 INFO L688 BuchiCegarLoop]: Abstraction has 23 states and 28 transitions. [2019-11-25 08:50:02,917 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states and 28 transitions. [2019-11-25 08:50:02,918 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 22. [2019-11-25 08:50:02,918 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22 states. [2019-11-25 08:50:02,918 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 27 transitions. [2019-11-25 08:50:02,919 INFO L711 BuchiCegarLoop]: Abstraction has 22 states and 27 transitions. [2019-11-25 08:50:02,919 INFO L591 BuchiCegarLoop]: Abstraction has 22 states and 27 transitions. [2019-11-25 08:50:02,919 INFO L424 BuchiCegarLoop]: ======== Iteration 7============ [2019-11-25 08:50:02,919 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 22 states and 27 transitions. [2019-11-25 08:50:02,919 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2019-11-25 08:50:02,919 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-25 08:50:02,919 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-25 08:50:02,920 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-25 08:50:02,920 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2019-11-25 08:50:02,920 INFO L794 eck$LassoCheckResult]: Stem: 729#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; 727#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; 728#L527 assume !(main_~array_size~0 < 1 || main_~array_size~0 >= 536870911); 730#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; 731#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; 743#L532-2 main_#t~post10 := main_~k~0;main_~k~0 := 1 + main_#t~post10;havoc main_#t~post10; 744#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; 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; 748#L532-2 main_#t~post10 := main_~k~0;main_~k~0 := 1 + main_#t~post10;havoc main_#t~post10; 747#L532-3 assume !(main_~k~0 < main_~array_size~0); 746#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; 745#L515-3 assume !!(bubbleSort_~i~0 >= 0);bubbleSort_~j~0 := 1; 739#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); 740#L517 assume !(bubbleSort_#t~mem4 > bubbleSort_#t~mem5);havoc bubbleSort_#t~mem5;havoc bubbleSort_#t~mem4; 734#L516-2 bubbleSort_#t~post3 := bubbleSort_~j~0;bubbleSort_~j~0 := 1 + bubbleSort_#t~post3;havoc bubbleSort_#t~post3; 735#L516-3 assume !(bubbleSort_~j~0 <= bubbleSort_~i~0); 741#L515-2 bubbleSort_#t~post2 := bubbleSort_~i~0;bubbleSort_~i~0 := bubbleSort_#t~post2 - 1;havoc bubbleSort_#t~post2; 742#L515-3 assume !!(bubbleSort_~i~0 >= 0);bubbleSort_~j~0 := 1; 733#L516-3 [2019-11-25 08:50:02,921 INFO L796 eck$LassoCheckResult]: Loop: 733#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); 738#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); 732#L516-2 bubbleSort_#t~post3 := bubbleSort_~j~0;bubbleSort_~j~0 := 1 + bubbleSort_#t~post3;havoc bubbleSort_#t~post3; 733#L516-3 [2019-11-25 08:50:02,921 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 08:50:02,921 INFO L82 PathProgramCache]: Analyzing trace with hash 1850126805, now seen corresponding path program 2 times [2019-11-25 08:50:02,921 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-25 08:50:02,921 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [317435524] [2019-11-25 08:50:02,921 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-25 08:50:02,930 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 08:50:03,000 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 6 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-25 08:50:03,001 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [317435524] [2019-11-25 08:50:03,001 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [11764426] [2019-11-25 08:50:03,001 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_99c1e841-74b8-4f89-a61d-1452bff951cb/bin/uautomizer/z3 Starting monitored process 26 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 26 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-25 08:50:03,050 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-11-25 08:50:03,050 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-25 08:50:03,051 INFO L255 TraceCheckSpWp]: Trace formula consists of 88 conjuncts, 10 conjunts are in the unsatisfiable core [2019-11-25 08:50:03,052 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-25 08:50:03,138 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 5 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-25 08:50:03,138 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-25 08:50:03,138 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 9] total 16 [2019-11-25 08:50:03,138 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [86096474] [2019-11-25 08:50:03,138 INFO L799 eck$LassoCheckResult]: stem already infeasible [2019-11-25 08:50:03,138 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 08:50:03,139 INFO L82 PathProgramCache]: Analyzing trace with hash 68618, now seen corresponding path program 5 times [2019-11-25 08:50:03,139 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-25 08:50:03,139 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1889784776] [2019-11-25 08:50:03,139 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-25 08:50:03,142 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-25 08:50:03,144 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-25 08:50:03,146 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-25 08:50:03,214 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-25 08:50:03,214 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2019-11-25 08:50:03,214 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=185, Unknown=0, NotChecked=0, Total=240 [2019-11-25 08:50:03,214 INFO L87 Difference]: Start difference. First operand 22 states and 27 transitions. cyclomatic complexity: 8 Second operand 16 states. [2019-11-25 08:50:03,414 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-25 08:50:03,414 INFO L93 Difference]: Finished difference Result 31 states and 40 transitions. [2019-11-25 08:50:03,415 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-11-25 08:50:03,415 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 31 states and 40 transitions. [2019-11-25 08:50:03,415 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2019-11-25 08:50:03,416 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 31 states to 31 states and 40 transitions. [2019-11-25 08:50:03,416 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 10 [2019-11-25 08:50:03,416 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 10 [2019-11-25 08:50:03,416 INFO L73 IsDeterministic]: Start isDeterministic. Operand 31 states and 40 transitions. [2019-11-25 08:50:03,416 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-11-25 08:50:03,416 INFO L688 BuchiCegarLoop]: Abstraction has 31 states and 40 transitions. [2019-11-25 08:50:03,416 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states and 40 transitions. [2019-11-25 08:50:03,418 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 25. [2019-11-25 08:50:03,418 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25 states. [2019-11-25 08:50:03,418 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 31 transitions. [2019-11-25 08:50:03,418 INFO L711 BuchiCegarLoop]: Abstraction has 25 states and 31 transitions. [2019-11-25 08:50:03,418 INFO L591 BuchiCegarLoop]: Abstraction has 25 states and 31 transitions. [2019-11-25 08:50:03,418 INFO L424 BuchiCegarLoop]: ======== Iteration 8============ [2019-11-25 08:50:03,418 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 25 states and 31 transitions. [2019-11-25 08:50:03,419 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2019-11-25 08:50:03,419 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-25 08:50:03,419 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-25 08:50:03,419 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-25 08:50:03,419 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2019-11-25 08:50:03,420 INFO L794 eck$LassoCheckResult]: Stem: 867#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; 865#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; 866#L527 assume !(main_~array_size~0 < 1 || main_~array_size~0 >= 536870911); 868#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; 869#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; 871#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; 876#L532-2 main_#t~post10 := main_~k~0;main_~k~0 := 1 + main_#t~post10;havoc main_#t~post10; 888#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; 887#L532-2 main_#t~post10 := main_~k~0;main_~k~0 := 1 + main_#t~post10;havoc main_#t~post10; 886#L532-3 assume !(main_~k~0 < main_~array_size~0); 881#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; 882#L515-3 assume !!(bubbleSort_~i~0 >= 0);bubbleSort_~j~0 := 1; 883#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); 889#L517 assume !(bubbleSort_#t~mem4 > bubbleSort_#t~mem5);havoc bubbleSort_#t~mem5;havoc bubbleSort_#t~mem4; 874#L516-2 bubbleSort_#t~post3 := bubbleSort_~j~0;bubbleSort_~j~0 := 1 + bubbleSort_#t~post3;havoc bubbleSort_#t~post3; 875#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; 885#L516-2 bubbleSort_#t~post3 := bubbleSort_~j~0;bubbleSort_~j~0 := 1 + bubbleSort_#t~post3;havoc bubbleSort_#t~post3; 884#L516-3 assume !(bubbleSort_~j~0 <= bubbleSort_~i~0); 879#L515-2 bubbleSort_#t~post2 := bubbleSort_~i~0;bubbleSort_~i~0 := bubbleSort_#t~post2 - 1;havoc bubbleSort_#t~post2; 880#L515-3 assume !!(bubbleSort_~i~0 >= 0);bubbleSort_~j~0 := 1; 873#L516-3 [2019-11-25 08:50:03,420 INFO L796 eck$LassoCheckResult]: Loop: 873#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); 877#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); 872#L516-2 bubbleSort_#t~post3 := bubbleSort_~j~0;bubbleSort_~j~0 := 1 + bubbleSort_#t~post3;havoc bubbleSort_#t~post3; 873#L516-3 [2019-11-25 08:50:03,420 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 08:50:03,420 INFO L82 PathProgramCache]: Analyzing trace with hash -135460634, now seen corresponding path program 3 times [2019-11-25 08:50:03,420 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-25 08:50:03,420 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [785977990] [2019-11-25 08:50:03,420 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-25 08:50:03,436 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-25 08:50:03,451 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-25 08:50:03,456 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-25 08:50:03,456 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 08:50:03,456 INFO L82 PathProgramCache]: Analyzing trace with hash 68618, now seen corresponding path program 6 times [2019-11-25 08:50:03,456 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-25 08:50:03,457 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [403435747] [2019-11-25 08:50:03,457 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-25 08:50:03,460 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-25 08:50:03,463 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-25 08:50:03,464 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-25 08:50:03,465 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 08:50:03,465 INFO L82 PathProgramCache]: Analyzing trace with hash 1761549573, now seen corresponding path program 2 times [2019-11-25 08:50:03,465 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-25 08:50:03,465 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [731448060] [2019-11-25 08:50:03,465 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-25 08:50:03,483 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 08:50:03,697 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 6 proven. 14 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-11-25 08:50:03,697 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [731448060] [2019-11-25 08:50:03,697 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1597662121] [2019-11-25 08:50:03,698 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_99c1e841-74b8-4f89-a61d-1452bff951cb/bin/uautomizer/z3 Starting monitored process 27 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 27 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-25 08:50:03,743 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-11-25 08:50:03,743 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-25 08:50:03,744 INFO L255 TraceCheckSpWp]: Trace formula consists of 125 conjuncts, 18 conjunts are in the unsatisfiable core [2019-11-25 08:50:03,745 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-25 08:50:03,804 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-25 08:50:03,805 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 26 treesize of output 10 [2019-11-25 08:50:03,805 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-25 08:50:03,806 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-25 08:50:03,807 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-25 08:50:03,807 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:26, output treesize:3 [2019-11-25 08:50:03,816 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 6 proven. 5 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2019-11-25 08:50:03,817 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-25 08:50:03,817 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 9] total 13 [2019-11-25 08:50:03,817 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1607249293] [2019-11-25 08:50:03,876 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-25 08:50:03,876 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-11-25 08:50:03,876 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=119, Unknown=0, NotChecked=0, Total=156 [2019-11-25 08:50:03,876 INFO L87 Difference]: Start difference. First operand 25 states and 31 transitions. cyclomatic complexity: 9 Second operand 13 states. [2019-11-25 08:50:04,046 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-25 08:50:04,046 INFO L93 Difference]: Finished difference Result 47 states and 63 transitions. [2019-11-25 08:50:04,047 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-11-25 08:50:04,047 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 47 states and 63 transitions. [2019-11-25 08:50:04,048 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 6 [2019-11-25 08:50:04,048 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 47 states to 47 states and 63 transitions. [2019-11-25 08:50:04,048 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 18 [2019-11-25 08:50:04,049 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 18 [2019-11-25 08:50:04,049 INFO L73 IsDeterministic]: Start isDeterministic. Operand 47 states and 63 transitions. [2019-11-25 08:50:04,049 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-11-25 08:50:04,049 INFO L688 BuchiCegarLoop]: Abstraction has 47 states and 63 transitions. [2019-11-25 08:50:04,049 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states and 63 transitions. [2019-11-25 08:50:04,051 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 36. [2019-11-25 08:50:04,051 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36 states. [2019-11-25 08:50:04,051 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 48 transitions. [2019-11-25 08:50:04,052 INFO L711 BuchiCegarLoop]: Abstraction has 36 states and 48 transitions. [2019-11-25 08:50:04,052 INFO L591 BuchiCegarLoop]: Abstraction has 36 states and 48 transitions. [2019-11-25 08:50:04,052 INFO L424 BuchiCegarLoop]: ======== Iteration 9============ [2019-11-25 08:50:04,052 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 36 states and 48 transitions. [2019-11-25 08:50:04,052 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2019-11-25 08:50:04,052 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-25 08:50:04,052 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-25 08:50:04,053 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-25 08:50:04,053 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2019-11-25 08:50:04,053 INFO L794 eck$LassoCheckResult]: Stem: 1041#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; 1039#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; 1040#L527 assume !(main_~array_size~0 < 1 || main_~array_size~0 >= 536870911); 1042#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; 1043#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; 1048#L532-2 main_#t~post10 := main_~k~0;main_~k~0 := 1 + main_#t~post10;havoc main_#t~post10; 1049#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; 1054#L532-2 main_#t~post10 := main_~k~0;main_~k~0 := 1 + main_#t~post10;havoc main_#t~post10; 1064#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; 1063#L532-2 main_#t~post10 := main_~k~0;main_~k~0 := 1 + main_#t~post10;havoc main_#t~post10; 1062#L532-3 assume !(main_~k~0 < main_~array_size~0); 1058#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; 1055#L515-3 assume !!(bubbleSort_~i~0 >= 0);bubbleSort_~j~0 := 1; 1056#L516-3 assume !!(bubbleSort_~j~0 <= bubbleSort_~i~0);call bubbleSort_#t~mem4 := read~int(bubbleSort_~numbers.base, bubbleSort_~numbers.offset + 4 * (bubbleSort_~j~0 - 1), 4);call bubbleSort_#t~mem5 := read~int(bubbleSort_~numbers.base, bubbleSort_~numbers.offset + 4 * bubbleSort_~j~0, 4); 1060#L517 assume !(bubbleSort_#t~mem4 > bubbleSort_#t~mem5);havoc bubbleSort_#t~mem5;havoc bubbleSort_#t~mem4; 1061#L516-2 bubbleSort_#t~post3 := bubbleSort_~j~0;bubbleSort_~j~0 := 1 + bubbleSort_#t~post3;havoc bubbleSort_#t~post3; 1074#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); 1070#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); 1046#L516-2 bubbleSort_#t~post3 := bubbleSort_~j~0;bubbleSort_~j~0 := 1 + bubbleSort_#t~post3;havoc bubbleSort_#t~post3; 1047#L516-3 assume !(bubbleSort_~j~0 <= bubbleSort_~i~0); 1050#L515-2 bubbleSort_#t~post2 := bubbleSort_~i~0;bubbleSort_~i~0 := bubbleSort_#t~post2 - 1;havoc bubbleSort_#t~post2; 1051#L515-3 assume !!(bubbleSort_~i~0 >= 0);bubbleSort_~j~0 := 1; 1045#L516-3 [2019-11-25 08:50:04,053 INFO L796 eck$LassoCheckResult]: Loop: 1045#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); 1052#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); 1044#L516-2 bubbleSort_#t~post3 := bubbleSort_~j~0;bubbleSort_~j~0 := 1 + bubbleSort_#t~post3;havoc bubbleSort_#t~post3; 1045#L516-3 [2019-11-25 08:50:04,053 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 08:50:04,054 INFO L82 PathProgramCache]: Analyzing trace with hash -137307676, now seen corresponding path program 3 times [2019-11-25 08:50:04,054 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-25 08:50:04,054 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1274987159] [2019-11-25 08:50:04,054 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-25 08:50:04,069 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-25 08:50:04,081 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-25 08:50:04,086 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-25 08:50:04,086 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 08:50:04,086 INFO L82 PathProgramCache]: Analyzing trace with hash 68618, now seen corresponding path program 7 times [2019-11-25 08:50:04,086 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-25 08:50:04,087 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [815480483] [2019-11-25 08:50:04,087 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-25 08:50:04,090 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-25 08:50:04,092 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-25 08:50:04,093 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-25 08:50:04,094 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 08:50:04,094 INFO L82 PathProgramCache]: Analyzing trace with hash -1724071097, now seen corresponding path program 4 times [2019-11-25 08:50:04,094 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-25 08:50:04,094 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [345567917] [2019-11-25 08:50:04,094 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-25 08:50:04,107 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-25 08:50:04,119 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-25 08:50:04,124 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-25 08:50:04,740 WARN L192 SmtUtils]: Spent 548.00 ms on a formula simplification. DAG size of input: 183 DAG size of output: 139 [2019-11-25 08:50:04,884 WARN L192 SmtUtils]: Spent 137.00 ms on a formula simplification that was a NOOP. DAG size: 89 [2019-11-25 08:50:04,887 INFO L210 LassoAnalysis]: Preferences: [2019-11-25 08:50:04,887 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2019-11-25 08:50:04,887 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-11-25 08:50:04,887 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2019-11-25 08:50:04,887 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2019-11-25 08:50:04,887 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-25 08:50:04,887 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2019-11-25 08:50:04,887 INFO L132 ssoRankerPreferences]: Path of dumped script: [2019-11-25 08:50:04,887 INFO L133 ssoRankerPreferences]: Filename of dumped script: bubblesort-alloca-2.i_Iteration9_Lasso [2019-11-25 08:50:04,888 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2019-11-25 08:50:04,888 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2019-11-25 08:50:04,891 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-25 08:50:04,897 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-25 08:50:04,899 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-25 08:50:04,901 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-25 08:50:04,903 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-25 08:50:04,909 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-25 08:50:04,911 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-25 08:50:04,913 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-25 08:50:04,915 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-25 08:50:04,918 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-25 08:50:04,919 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-25 08:50:04,989 FATAL L? ?]: The Plugin de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer has thrown an exception: java.lang.AssertionError: MapEliminator tries to combine Int and (Array Int Int) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.mapelimination.MapEliminator.indexEqualityInequalityImpliesValueEquality(MapEliminator.java:850) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.mapelimination.MapEliminator.replaceSelectStoreTerm(MapEliminator.java:592) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.mapelimination.MapEliminator.replaceStoreTerms(MapEliminator.java:542) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.mapelimination.MapEliminator.getRewrittenTransFormula(MapEliminator.java:330) at de.uni_freiburg.informatik.ultimate.lassoranker.preprocessors.MapEliminationLassoPreprocessor.process(MapEliminationLassoPreprocessor.java:109) at de.uni_freiburg.informatik.ultimate.lassoranker.variables.LassoBuilder.applyPreprocessor(LassoBuilder.java:154) at de.uni_freiburg.informatik.ultimate.lassoranker.variables.LassoBuilder.preprocess(LassoBuilder.java:262) at de.uni_freiburg.informatik.ultimate.lassoranker.LassoAnalysis.preprocess(LassoAnalysis.java:278) at de.uni_freiburg.informatik.ultimate.lassoranker.LassoAnalysis.(LassoAnalysis.java:229) at de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.LassoCheck.synthesize(LassoCheck.java:612) at de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.LassoCheck.access$16(LassoCheck.java:539) at de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.LassoCheck$LassoCheckResult.checkLassoTermination(LassoCheck.java:957) at de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.LassoCheck$LassoCheckResult.(LassoCheck.java:865) at de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.LassoCheck.(LassoCheck.java:251) at de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiCegarLoop.iterate(BuchiCegarLoop.java:458) at de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver.doTerminationAnalysis(BuchiAutomizerObserver.java:141) at de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver.finish(BuchiAutomizerObserver.java:380) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:316) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:55) [2019-11-25 08:50:04,992 INFO L168 Benchmark]: Toolchain (without parser) took 8340.48 ms. Allocated memory was 1.0 GB in the beginning and 1.4 GB in the end (delta: 329.8 MB). Free memory was 939.3 MB in the beginning and 964.8 MB in the end (delta: -25.5 MB). Peak memory consumption was 304.3 MB. Max. memory is 11.5 GB. [2019-11-25 08:50:04,992 INFO L168 Benchmark]: CDTParser took 0.17 ms. Allocated memory is still 1.0 GB. Free memory is still 962.2 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-25 08:50:04,992 INFO L168 Benchmark]: CACSL2BoogieTranslator took 505.72 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 143.1 MB). Free memory was 939.3 MB in the beginning and 1.1 GB in the end (delta: -179.8 MB). Peak memory consumption was 17.9 MB. Max. memory is 11.5 GB. [2019-11-25 08:50:04,993 INFO L168 Benchmark]: Boogie Procedure Inliner took 36.25 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-25 08:50:04,993 INFO L168 Benchmark]: Boogie Preprocessor took 23.87 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-25 08:50:04,993 INFO L168 Benchmark]: RCFGBuilder took 299.38 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: 21.4 MB). Peak memory consumption was 21.4 MB. Max. memory is 11.5 GB. [2019-11-25 08:50:04,994 INFO L168 Benchmark]: BuchiAutomizer took 7471.75 ms. Allocated memory was 1.2 GB in the beginning and 1.4 GB in the end (delta: 186.6 MB). Free memory was 1.1 GB in the beginning and 964.8 MB in the end (delta: 132.9 MB). Peak memory consumption was 319.6 MB. Max. memory is 11.5 GB. [2019-11-25 08:50:04,996 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.17 ms. Allocated memory is still 1.0 GB. Free memory is still 962.2 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 505.72 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 143.1 MB). Free memory was 939.3 MB in the beginning and 1.1 GB in the end (delta: -179.8 MB). Peak memory consumption was 17.9 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 36.25 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 23.87 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. * RCFGBuilder took 299.38 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: 21.4 MB). Peak memory consumption was 21.4 MB. Max. memory is 11.5 GB. * BuchiAutomizer took 7471.75 ms. Allocated memory was 1.2 GB in the beginning and 1.4 GB in the end (delta: 186.6 MB). Free memory was 1.1 GB in the beginning and 964.8 MB in the end (delta: 132.9 MB). Peak memory consumption was 319.6 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer: - ExceptionOrErrorResult: AssertionError: MapEliminator tries to combine Int and (Array Int Int) de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer: AssertionError: MapEliminator tries to combine Int and (Array Int Int): de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.mapelimination.MapEliminator.indexEqualityInequalityImpliesValueEquality(MapEliminator.java:850) RESULT: Ultimate could not prove your program: Toolchain returned no result. Received shutdown request...