./Ultimate.py --spec ../sv-benchmarks/c/properties/termination.prp --file ../sv-benchmarks/c/array-memsafety/bubblesort-alloca-2.i --full-output -ea --architecture 32bit -------------------------------------------------------------------------------- Checking for termination Using default analysis Version 8bd4bc60 Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx12G -Xms1G -ea -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerTermination.xml -i ../sv-benchmarks/c/array-memsafety/bubblesort-alloca-2.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --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 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/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.25-8bd4bc6 [2020-07-29 03:25:19,013 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-07-29 03:25:19,016 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-07-29 03:25:19,034 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-07-29 03:25:19,034 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-07-29 03:25:19,035 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-07-29 03:25:19,037 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-07-29 03:25:19,039 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-07-29 03:25:19,041 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-07-29 03:25:19,042 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-07-29 03:25:19,044 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-07-29 03:25:19,045 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-07-29 03:25:19,046 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-07-29 03:25:19,047 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-07-29 03:25:19,049 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-07-29 03:25:19,051 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-07-29 03:25:19,053 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-07-29 03:25:19,054 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-07-29 03:25:19,056 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-07-29 03:25:19,059 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-07-29 03:25:19,062 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-07-29 03:25:19,064 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-07-29 03:25:19,066 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-07-29 03:25:19,068 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-07-29 03:25:19,074 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-07-29 03:25:19,075 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-07-29 03:25:19,075 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-07-29 03:25:19,076 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-07-29 03:25:19,078 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-07-29 03:25:19,079 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-07-29 03:25:19,079 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-07-29 03:25:19,081 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-07-29 03:25:19,082 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-07-29 03:25:19,085 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-07-29 03:25:19,089 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-07-29 03:25:19,091 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-07-29 03:25:19,092 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-07-29 03:25:19,092 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-07-29 03:25:19,093 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-07-29 03:25:19,094 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-07-29 03:25:19,096 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-07-29 03:25:19,097 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-32bit-Automizer_Default.epf [2020-07-29 03:25:19,113 INFO L113 SettingsManager]: Loading preferences was successful [2020-07-29 03:25:19,114 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-07-29 03:25:19,115 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2020-07-29 03:25:19,116 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2020-07-29 03:25:19,116 INFO L138 SettingsManager]: * Use SBE=true [2020-07-29 03:25:19,116 INFO L136 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2020-07-29 03:25:19,117 INFO L138 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2020-07-29 03:25:19,117 INFO L138 SettingsManager]: * Use old map elimination=false [2020-07-29 03:25:19,117 INFO L138 SettingsManager]: * Use external solver (rank synthesis)=false [2020-07-29 03:25:19,117 INFO L138 SettingsManager]: * Use only trivial implications for array writes=true [2020-07-29 03:25:19,118 INFO L138 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2020-07-29 03:25:19,118 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-07-29 03:25:19,118 INFO L138 SettingsManager]: * sizeof long=4 [2020-07-29 03:25:19,119 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2020-07-29 03:25:19,119 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-07-29 03:25:19,119 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-07-29 03:25:19,120 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-07-29 03:25:19,120 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2020-07-29 03:25:19,120 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2020-07-29 03:25:19,121 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2020-07-29 03:25:19,121 INFO L138 SettingsManager]: * sizeof long double=12 [2020-07-29 03:25:19,121 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-07-29 03:25:19,121 INFO L138 SettingsManager]: * Assume nondeterminstic values are in range=false [2020-07-29 03:25:19,122 INFO L138 SettingsManager]: * Use constant arrays=true [2020-07-29 03:25:19,122 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2020-07-29 03:25:19,122 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-07-29 03:25:19,123 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2020-07-29 03:25:19,123 INFO L138 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2020-07-29 03:25:19,123 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-07-29 03:25:19,123 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2020-07-29 03:25:19,124 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2020-07-29 03:25:19,124 INFO L138 SettingsManager]: * Dump automata to the following directory=/home/matthias/ultimate/dump/auto [2020-07-29 03:25:19,125 INFO L136 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2020-07-29 03:25:19,125 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 -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(F end) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> a2eb39e0d0d0fa911fcf8a16c5f9511be1d37325 [2020-07-29 03:25:19,473 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2020-07-29 03:25:19,486 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-07-29 03:25:19,490 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-07-29 03:25:19,491 INFO L271 PluginConnector]: Initializing CDTParser... [2020-07-29 03:25:19,492 INFO L275 PluginConnector]: CDTParser initialized [2020-07-29 03:25:19,493 INFO L429 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/array-memsafety/bubblesort-alloca-2.i [2020-07-29 03:25:19,557 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ed93e5b6b/cd03efaa320049f69d5743ac1cebeb50/FLAG1a14a1351 [2020-07-29 03:25:20,112 INFO L306 CDTParser]: Found 1 translation units. [2020-07-29 03:25:20,113 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/array-memsafety/bubblesort-alloca-2.i [2020-07-29 03:25:20,129 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ed93e5b6b/cd03efaa320049f69d5743ac1cebeb50/FLAG1a14a1351 [2020-07-29 03:25:20,450 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ed93e5b6b/cd03efaa320049f69d5743ac1cebeb50 [2020-07-29 03:25:20,454 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-07-29 03:25:20,460 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2020-07-29 03:25:20,462 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-07-29 03:25:20,462 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-07-29 03:25:20,466 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-07-29 03:25:20,468 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 29.07 03:25:20" (1/1) ... [2020-07-29 03:25:20,471 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1728e5ee and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.07 03:25:20, skipping insertion in model container [2020-07-29 03:25:20,472 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 29.07 03:25:20" (1/1) ... [2020-07-29 03:25:20,481 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-07-29 03:25:20,523 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-07-29 03:25:20,900 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-07-29 03:25:20,912 INFO L203 MainTranslator]: Completed pre-run [2020-07-29 03:25:20,963 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-07-29 03:25:21,014 INFO L208 MainTranslator]: Completed translation [2020-07-29 03:25:21,014 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.07 03:25:21 WrapperNode [2020-07-29 03:25:21,015 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-07-29 03:25:21,016 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2020-07-29 03:25:21,016 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2020-07-29 03:25:21,016 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2020-07-29 03:25:21,023 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.07 03:25:21" (1/1) ... [2020-07-29 03:25:21,040 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.07 03:25:21" (1/1) ... [2020-07-29 03:25:21,066 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2020-07-29 03:25:21,067 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-07-29 03:25:21,067 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-07-29 03:25:21,067 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-07-29 03:25:21,077 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.07 03:25:21" (1/1) ... [2020-07-29 03:25:21,077 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.07 03:25:21" (1/1) ... [2020-07-29 03:25:21,081 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.07 03:25:21" (1/1) ... [2020-07-29 03:25:21,081 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.07 03:25:21" (1/1) ... [2020-07-29 03:25:21,090 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.07 03:25:21" (1/1) ... [2020-07-29 03:25:21,095 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.07 03:25:21" (1/1) ... [2020-07-29 03:25:21,097 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.07 03:25:21" (1/1) ... [2020-07-29 03:25:21,104 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-07-29 03:25:21,105 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-07-29 03:25:21,105 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-07-29 03:25:21,105 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-07-29 03:25:21,106 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.07 03:25:21" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 03:25:21,188 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2020-07-29 03:25:21,188 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2020-07-29 03:25:21,188 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2020-07-29 03:25:21,188 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2020-07-29 03:25:21,189 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-07-29 03:25:21,189 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-07-29 03:25:21,637 INFO L290 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-07-29 03:25:21,638 INFO L295 CfgBuilder]: Removed 9 assume(true) statements. [2020-07-29 03:25:21,641 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.07 03:25:21 BoogieIcfgContainer [2020-07-29 03:25:21,642 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-07-29 03:25:21,643 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2020-07-29 03:25:21,643 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2020-07-29 03:25:21,647 INFO L275 PluginConnector]: BuchiAutomizer initialized [2020-07-29 03:25:21,648 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2020-07-29 03:25:21,649 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 29.07 03:25:20" (1/3) ... [2020-07-29 03:25:21,650 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@3808bcea and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 29.07 03:25:21, skipping insertion in model container [2020-07-29 03:25:21,650 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2020-07-29 03:25:21,650 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.07 03:25:21" (2/3) ... [2020-07-29 03:25:21,651 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@3808bcea and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 29.07 03:25:21, skipping insertion in model container [2020-07-29 03:25:21,651 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2020-07-29 03:25:21,651 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.07 03:25:21" (3/3) ... [2020-07-29 03:25:21,653 INFO L371 chiAutomizerObserver]: Analyzing ICFG bubblesort-alloca-2.i [2020-07-29 03:25:21,701 INFO L356 BuchiCegarLoop]: Interprodecural is true [2020-07-29 03:25:21,702 INFO L357 BuchiCegarLoop]: Hoare is false [2020-07-29 03:25:21,702 INFO L358 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2020-07-29 03:25:21,702 INFO L359 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2020-07-29 03:25:21,703 INFO L360 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-07-29 03:25:21,703 INFO L361 BuchiCegarLoop]: Difference is false [2020-07-29 03:25:21,703 INFO L362 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-07-29 03:25:21,703 INFO L365 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2020-07-29 03:25:21,714 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 16 states. [2020-07-29 03:25:21,742 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 7 [2020-07-29 03:25:21,742 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 03:25:21,742 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 03:25:21,748 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1] [2020-07-29 03:25:21,748 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2020-07-29 03:25:21,749 INFO L424 BuchiCegarLoop]: ======== Iteration 1============ [2020-07-29 03:25:21,749 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 16 states. [2020-07-29 03:25:21,753 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 7 [2020-07-29 03:25:21,753 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 03:25:21,753 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 03:25:21,754 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1] [2020-07-29 03:25:21,754 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2020-07-29 03:25:21,763 INFO L794 eck$LassoCheckResult]: Stem: 10#ULTIMATE.startENTRYtrue #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; 9#L-1true havoc main_#res;havoc main_#t~nondet8, main_#t~malloc9.base, main_#t~malloc9.offset, main_#t~nondet11, main_#t~post10, main_~k~0, main_~array_size~0, main_~numbers~0.base, main_~numbers~0.offset;main_~array_size~0 := main_#t~nondet8;havoc main_#t~nondet8; 18#L527true assume !(main_~array_size~0 < 1 || main_~array_size~0 >= 536870911); 3#L527-2true call main_#t~malloc9.base, main_#t~malloc9.offset := #Ultimate.allocOnStack(4 * main_~array_size~0);main_~numbers~0.base, main_~numbers~0.offset := main_#t~malloc9.base, main_#t~malloc9.offset;main_~k~0 := 0; 13#L532-3true [2020-07-29 03:25:21,764 INFO L796 eck$LassoCheckResult]: Loop: 13#L532-3true assume !!(main_~k~0 < main_~array_size~0);call write~int(main_#t~nondet11, main_~numbers~0.base, main_~numbers~0.offset + 4 * main_~k~0, 4);havoc main_#t~nondet11; 11#L532-2true main_#t~post10 := main_~k~0;main_~k~0 := 1 + main_#t~post10;havoc main_#t~post10; 13#L532-3true [2020-07-29 03:25:21,770 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 03:25:21,771 INFO L82 PathProgramCache]: Analyzing trace with hash 925669, now seen corresponding path program 1 times [2020-07-29 03:25:21,786 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 03:25:21,787 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [628670889] [2020-07-29 03:25:21,788 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 03:25:21,881 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 03:25:21,882 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 03:25:21,894 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 03:25:21,894 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 03:25:21,917 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-07-29 03:25:21,919 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 03:25:21,920 INFO L82 PathProgramCache]: Analyzing trace with hash 1507, now seen corresponding path program 1 times [2020-07-29 03:25:21,920 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 03:25:21,920 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019409988] [2020-07-29 03:25:21,921 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 03:25:21,932 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 03:25:21,932 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 03:25:21,941 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 03:25:21,941 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 03:25:21,945 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-07-29 03:25:21,947 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 03:25:21,947 INFO L82 PathProgramCache]: Analyzing trace with hash 889568455, now seen corresponding path program 1 times [2020-07-29 03:25:21,948 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 03:25:21,948 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1653827479] [2020-07-29 03:25:21,948 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 03:25:21,981 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 03:25:21,981 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 03:25:22,009 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 03:25:22,012 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 03:25:22,021 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-07-29 03:25:22,351 INFO L210 LassoAnalysis]: Preferences: [2020-07-29 03:25:22,352 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2020-07-29 03:25:22,352 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2020-07-29 03:25:22,353 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2020-07-29 03:25:22,353 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2020-07-29 03:25:22,353 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 03:25:22,353 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2020-07-29 03:25:22,353 INFO L132 ssoRankerPreferences]: Path of dumped script: [2020-07-29 03:25:22,354 INFO L133 ssoRankerPreferences]: Filename of dumped script: bubblesort-alloca-2.i_Iteration1_Lasso [2020-07-29 03:25:22,354 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2020-07-29 03:25:22,354 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2020-07-29 03:25:22,405 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 03:25:22,582 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 03:25:22,587 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 03:25:22,592 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 03:25:22,599 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 03:25:22,605 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 03:25:22,611 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 03:25:22,618 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 03:25:22,624 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 03:25:23,155 INFO L292 LassoAnalysis]: Preprocessing complete. [2020-07-29 03:25:23,160 INFO L489 LassoAnalysis]: Using template 'affine'. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2020-07-29 03:25:23,166 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-07-29 03:25:23,169 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 03:25:23,170 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-07-29 03:25:23,171 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 03:25:23,171 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 03:25:23,171 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 03:25:23,174 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-07-29 03:25:23,174 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. Waiting until toolchain timeout for monitored process 2 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 03:25:23,178 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2020-07-29 03:25:23,233 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-07-29 03:25:23,236 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 03:25:23,237 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 03:25:23,237 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 03:25:23,237 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 03:25:23,250 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-07-29 03:25:23,250 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. Waiting until toolchain timeout for monitored process 3 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 03:25:23,267 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2020-07-29 03:25:23,319 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-07-29 03:25:23,322 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 03:25:23,322 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 03:25:23,322 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 03:25:23,322 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. Waiting until toolchain timeout for monitored process 4 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 03:25:23,327 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-07-29 03:25:23,327 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-07-29 03:25:23,332 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2020-07-29 03:25:23,368 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-07-29 03:25:23,370 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 03:25:23,370 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 03:25:23,371 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 03:25:23,371 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 03:25:23,376 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-07-29 03:25:23,376 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 [2020-07-29 03:25:23,384 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 6 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 03:25:23,418 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-07-29 03:25:23,419 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 03:25:23,420 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-07-29 03:25:23,420 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 03:25:23,420 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 03:25:23,420 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 03:25:23,422 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-07-29 03:25:23,422 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-07-29 03:25:23,424 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 7 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 03:25:23,449 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-07-29 03:25:23,451 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 03:25:23,452 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 03:25:23,452 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 03:25:23,452 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 03:25:23,465 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-07-29 03:25:23,466 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-07-29 03:25:23,480 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2020-07-29 03:25:23,660 INFO L443 ModelExtractionUtils]: Simplification made 16 calls to the SMT solver. [2020-07-29 03:25:23,660 INFO L444 ModelExtractionUtils]: 1 out of 22 variables were initially zero. Simplification set additionally 17 variables to zero. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 8 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2020-07-29 03:25:23,666 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 [2020-07-29 03:25:23,672 INFO L438 nArgumentSynthesizer]: Removed 1 redundant supporting invariants from a total of 2. [2020-07-29 03:25:23,672 INFO L510 LassoAnalysis]: Proved termination. [2020-07-29 03:25:23,673 INFO L512 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~k~0, v_rep(select #length ULTIMATE.start_main_~numbers~0.base)_1) = -4*ULTIMATE.start_main_~k~0 + 1*v_rep(select #length ULTIMATE.start_main_~numbers~0.base)_1 Supporting invariants [1*ULTIMATE.start_main_~numbers~0.offset >= 0] [2020-07-29 03:25:23,740 INFO L297 tatePredicateManager]: 3 out of 4 supporting invariants were superfluous and have been removed [2020-07-29 03:25:23,746 INFO L393 LassoCheck]: Loop: "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;" "main_#t~post10 := main_~k~0;main_~k~0 := 1 + main_#t~post10;havoc main_#t~post10;" [2020-07-29 03:25:23,765 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 03:25:23,776 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-29 03:25:23,815 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 03:25:23,831 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 03:25:23,833 INFO L263 TraceCheckSpWp]: Trace formula consists of 26 conjuncts, 4 conjunts are in the unsatisfiable core [2020-07-29 03:25:23,844 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 03:25:23,845 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-29 03:25:23,860 INFO L280 TraceCheckUtils]: 0: Hoare triple {26#unseeded} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; {26#unseeded} is VALID [2020-07-29 03:25:23,861 INFO L280 TraceCheckUtils]: 1: Hoare triple {26#unseeded} 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; {26#unseeded} is VALID [2020-07-29 03:25:23,862 INFO L280 TraceCheckUtils]: 2: Hoare triple {26#unseeded} assume !(main_~array_size~0 < 1 || main_~array_size~0 >= 536870911); {26#unseeded} is VALID [2020-07-29 03:25:23,864 INFO L280 TraceCheckUtils]: 3: Hoare triple {26#unseeded} 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; {60#(and (>= ULTIMATE.start_main_~numbers~0.offset 0) unseeded)} is VALID [2020-07-29 03:25:23,873 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 03:25:23,874 INFO L263 TraceCheckSpWp]: Trace formula consists of 11 conjuncts, 5 conjunts are in the unsatisfiable core [2020-07-29 03:25:23,880 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 03:25:23,880 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-29 03:25:23,921 INFO L280 TraceCheckUtils]: 0: Hoare triple {61#(and (>= ULTIMATE.start_main_~numbers~0.offset 0) (>= oldRank0 (+ (* (- 4) ULTIMATE.start_main_~k~0) (select |#length| ULTIMATE.start_main_~numbers~0.base))))} 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; {78#(and (<= (+ ULTIMATE.start_main_~numbers~0.offset (* 4 ULTIMATE.start_main_~k~0) 4) (select |#length| ULTIMATE.start_main_~numbers~0.base)) (<= (select |#length| ULTIMATE.start_main_~numbers~0.base) (+ oldRank0 (* 4 ULTIMATE.start_main_~k~0))) (<= 0 ULTIMATE.start_main_~numbers~0.offset))} is VALID [2020-07-29 03:25:23,923 INFO L280 TraceCheckUtils]: 1: Hoare triple {78#(and (<= (+ ULTIMATE.start_main_~numbers~0.offset (* 4 ULTIMATE.start_main_~k~0) 4) (select |#length| ULTIMATE.start_main_~numbers~0.base)) (<= (select |#length| ULTIMATE.start_main_~numbers~0.base) (+ oldRank0 (* 4 ULTIMATE.start_main_~k~0))) (<= 0 ULTIMATE.start_main_~numbers~0.offset))} main_#t~post10 := main_~k~0;main_~k~0 := 1 + main_#t~post10;havoc main_#t~post10; {63#(and (or unseeded (and (>= oldRank0 0) (> oldRank0 (+ (* (- 4) ULTIMATE.start_main_~k~0) (select |#length| ULTIMATE.start_main_~numbers~0.base))))) (>= ULTIMATE.start_main_~numbers~0.offset 0))} is VALID [2020-07-29 03:25:23,923 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-29 03:25:23,935 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2020-07-29 03:25:23,954 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 6 edges. 6 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-29 03:25:23,956 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 4 letters. Loop has 2 letters. [2020-07-29 03:25:23,960 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:25:23,966 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2020-07-29 03:25:23,968 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 16 states. Second operand 3 states. [2020-07-29 03:25:24,155 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 16 states.. Second operand 3 states. Result 38 states and 56 transitions. Complement of second has 7 states. [2020-07-29 03:25:24,155 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 5 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2020-07-29 03:25:24,156 INFO L123 tractBuchiDifference]: Start testing correctness of buchiDifferenceNCSBLazy3 [2020-07-29 03:25:24,156 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 16 states. [2020-07-29 03:25:24,159 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 7 [2020-07-29 03:25:24,159 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 03:25:24,159 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 03:25:24,159 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 3 states. [2020-07-29 03:25:24,165 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 3 [2020-07-29 03:25:24,166 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 03:25:24,166 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 03:25:24,166 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 38 states and 56 transitions. [2020-07-29 03:25:24,168 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2020-07-29 03:25:24,168 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 03:25:24,168 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 03:25:24,171 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 16 states. [2020-07-29 03:25:24,173 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 7 [2020-07-29 03:25:24,175 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 7 examples of accepted words. [2020-07-29 03:25:24,176 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 3 states. [2020-07-29 03:25:24,179 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 3 [2020-07-29 03:25:24,180 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 2 examples of accepted words. [2020-07-29 03:25:24,180 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 38 states and 56 transitions. cyclomatic complexity: 22 [2020-07-29 03:25:24,182 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 5 examples of accepted words. [2020-07-29 03:25:24,182 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 16 states. Stem has 4 letters. Loop has 2 letters. [2020-07-29 03:25:24,182 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:25:24,183 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 4 letters. Loop has 2 letters. [2020-07-29 03:25:24,183 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:25:24,183 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 38 states and 56 transitions. cyclomatic complexity: 22 Stem has 4 letters. Loop has 2 letters. [2020-07-29 03:25:24,183 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:25:24,184 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 16 states. Stem has 1 letters. Loop has 2 letters. [2020-07-29 03:25:24,184 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:25:24,184 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 1 letters. Loop has 2 letters. [2020-07-29 03:25:24,184 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:25:24,184 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 38 states and 56 transitions. cyclomatic complexity: 22 Stem has 1 letters. Loop has 2 letters. [2020-07-29 03:25:24,185 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:25:24,185 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 16 states. Stem has 6 letters. Loop has 3 letters. [2020-07-29 03:25:24,185 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:25:24,185 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 6 letters. Loop has 3 letters. [2020-07-29 03:25:24,186 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:25:24,186 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 38 states and 56 transitions. cyclomatic complexity: 22 Stem has 6 letters. Loop has 3 letters. [2020-07-29 03:25:24,186 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:25:24,186 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 16 states. Stem has 38 letters. Loop has 38 letters. [2020-07-29 03:25:24,187 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:25:24,187 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 38 letters. Loop has 38 letters. [2020-07-29 03:25:24,187 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:25:24,187 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 38 states and 56 transitions. cyclomatic complexity: 22 Stem has 38 letters. Loop has 38 letters. [2020-07-29 03:25:24,190 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:25:24,190 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 16 states. Stem has 16 letters. Loop has 16 letters. [2020-07-29 03:25:24,191 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:25:24,191 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 16 letters. Loop has 16 letters. [2020-07-29 03:25:24,191 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:25:24,191 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 38 states and 56 transitions. cyclomatic complexity: 22 Stem has 16 letters. Loop has 16 letters. [2020-07-29 03:25:24,192 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:25:24,192 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 16 states. Stem has 5 letters. Loop has 5 letters. [2020-07-29 03:25:24,192 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:25:24,192 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 5 letters. Loop has 5 letters. [2020-07-29 03:25:24,192 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:25:24,193 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 38 states and 56 transitions. cyclomatic complexity: 22 Stem has 5 letters. Loop has 5 letters. [2020-07-29 03:25:24,193 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:25:24,193 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 16 states. Stem has 8 letters. Loop has 3 letters. [2020-07-29 03:25:24,193 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:25:24,193 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 8 letters. Loop has 3 letters. [2020-07-29 03:25:24,194 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:25:24,194 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 38 states and 56 transitions. cyclomatic complexity: 22 Stem has 8 letters. Loop has 3 letters. [2020-07-29 03:25:24,194 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:25:24,195 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 16 states. Stem has 9 letters. Loop has 3 letters. [2020-07-29 03:25:24,195 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:25:24,195 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 9 letters. Loop has 3 letters. [2020-07-29 03:25:24,196 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:25:24,196 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 38 states and 56 transitions. cyclomatic complexity: 22 Stem has 9 letters. Loop has 3 letters. [2020-07-29 03:25:24,196 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:25:24,196 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 16 states. Stem has 7 letters. Loop has 3 letters. [2020-07-29 03:25:24,197 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:25:24,197 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 7 letters. Loop has 3 letters. [2020-07-29 03:25:24,197 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:25:24,197 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 38 states and 56 transitions. cyclomatic complexity: 22 Stem has 7 letters. Loop has 3 letters. [2020-07-29 03:25:24,198 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:25:24,198 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 16 states. Stem has 8 letters. Loop has 3 letters. [2020-07-29 03:25:24,198 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:25:24,198 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 8 letters. Loop has 3 letters. [2020-07-29 03:25:24,199 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:25:24,199 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 38 states and 56 transitions. cyclomatic complexity: 22 Stem has 8 letters. Loop has 3 letters. [2020-07-29 03:25:24,199 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:25:24,199 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 16 states. Stem has 6 letters. Loop has 3 letters. [2020-07-29 03:25:24,200 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:25:24,200 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 6 letters. Loop has 3 letters. [2020-07-29 03:25:24,200 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:25:24,200 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 38 states and 56 transitions. cyclomatic complexity: 22 Stem has 6 letters. Loop has 3 letters. [2020-07-29 03:25:24,202 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:25:24,202 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 16 states. Stem has 5 letters. Loop has 2 letters. [2020-07-29 03:25:24,202 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:25:24,202 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 5 letters. Loop has 2 letters. [2020-07-29 03:25:24,203 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:25:24,203 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 38 states and 56 transitions. cyclomatic complexity: 22 Stem has 5 letters. Loop has 2 letters. [2020-07-29 03:25:24,203 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:25:24,203 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 16 states. Stem has 4 letters. Loop has 2 letters. [2020-07-29 03:25:24,203 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:25:24,204 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 4 letters. Loop has 2 letters. [2020-07-29 03:25:24,204 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:25:24,204 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 38 states and 56 transitions. cyclomatic complexity: 22 Stem has 4 letters. Loop has 2 letters. [2020-07-29 03:25:24,204 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:25:24,205 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 16 states. Stem has 2 letters. Loop has 1 letters. [2020-07-29 03:25:24,205 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:25:24,205 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 2 letters. Loop has 1 letters. [2020-07-29 03:25:24,205 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:25:24,205 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 38 states and 56 transitions. cyclomatic complexity: 22 Stem has 2 letters. Loop has 1 letters. [2020-07-29 03:25:24,206 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:25:24,206 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 16 states. Stem has 1 letters. Loop has 2 letters. [2020-07-29 03:25:24,206 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:25:24,206 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 1 letters. Loop has 2 letters. [2020-07-29 03:25:24,206 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:25:24,207 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 38 states and 56 transitions. cyclomatic complexity: 22 Stem has 1 letters. Loop has 2 letters. [2020-07-29 03:25:24,207 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:25:24,207 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 16 states. Stem has 7 letters. Loop has 3 letters. [2020-07-29 03:25:24,207 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:25:24,207 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 7 letters. Loop has 3 letters. [2020-07-29 03:25:24,208 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:25:24,208 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 38 states and 56 transitions. cyclomatic complexity: 22 Stem has 7 letters. Loop has 3 letters. [2020-07-29 03:25:24,208 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:25:24,208 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 16 states. Stem has 8 letters. Loop has 3 letters. [2020-07-29 03:25:24,209 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:25:24,209 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 8 letters. Loop has 3 letters. [2020-07-29 03:25:24,209 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:25:24,209 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 38 states and 56 transitions. cyclomatic complexity: 22 Stem has 8 letters. Loop has 3 letters. [2020-07-29 03:25:24,210 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:25:24,210 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 16 states. Stem has 8 letters. Loop has 3 letters. [2020-07-29 03:25:24,210 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:25:24,210 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 8 letters. Loop has 3 letters. [2020-07-29 03:25:24,211 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:25:24,211 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 38 states and 56 transitions. cyclomatic complexity: 22 Stem has 8 letters. Loop has 3 letters. [2020-07-29 03:25:24,211 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:25:24,211 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 16 states. Stem has 6 letters. Loop has 3 letters. [2020-07-29 03:25:24,211 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:25:24,212 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 6 letters. Loop has 3 letters. [2020-07-29 03:25:24,212 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:25:24,212 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 38 states and 56 transitions. cyclomatic complexity: 22 Stem has 6 letters. Loop has 3 letters. [2020-07-29 03:25:24,212 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:25:24,213 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 16 states. Stem has 9 letters. Loop has 3 letters. [2020-07-29 03:25:24,213 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:25:24,213 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 9 letters. Loop has 3 letters. [2020-07-29 03:25:24,213 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:25:24,214 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 38 states and 56 transitions. cyclomatic complexity: 22 Stem has 9 letters. Loop has 3 letters. [2020-07-29 03:25:24,214 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:25:24,214 INFO L161 tractBuchiDifference]: Finished testing correctness of buchiDifferenceNCSBLazy3 [2020-07-29 03:25:24,216 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-07-29 03:25:24,218 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 37 transitions. [2020-07-29 03:25:24,220 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 37 transitions. Stem has 4 letters. Loop has 2 letters. [2020-07-29 03:25:24,221 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:25:24,221 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 37 transitions. Stem has 6 letters. Loop has 2 letters. [2020-07-29 03:25:24,221 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:25:24,221 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 37 transitions. Stem has 4 letters. Loop has 4 letters. [2020-07-29 03:25:24,222 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:25:24,223 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 38 states and 56 transitions. cyclomatic complexity: 22 [2020-07-29 03:25:24,228 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2020-07-29 03:25:24,233 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 38 states to 13 states and 18 transitions. [2020-07-29 03:25:24,235 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 10 [2020-07-29 03:25:24,235 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 11 [2020-07-29 03:25:24,236 INFO L73 IsDeterministic]: Start isDeterministic. Operand 13 states and 18 transitions. [2020-07-29 03:25:24,236 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-07-29 03:25:24,236 INFO L688 BuchiCegarLoop]: Abstraction has 13 states and 18 transitions. [2020-07-29 03:25:24,255 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13 states and 18 transitions. [2020-07-29 03:25:24,265 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13 to 13. [2020-07-29 03:25:24,265 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-29 03:25:24,266 INFO L82 GeneralOperation]: Start isEquivalent. First operand 13 states and 18 transitions. Second operand 13 states. [2020-07-29 03:25:24,267 INFO L74 IsIncluded]: Start isIncluded. First operand 13 states and 18 transitions. Second operand 13 states. [2020-07-29 03:25:24,269 INFO L87 Difference]: Start difference. First operand 13 states and 18 transitions. Second operand 13 states. [2020-07-29 03:25:24,274 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-29 03:25:24,274 INFO L93 Difference]: Finished difference Result 13 states and 18 transitions. [2020-07-29 03:25:24,275 INFO L276 IsEmpty]: Start isEmpty. Operand 13 states and 18 transitions. [2020-07-29 03:25:24,276 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-29 03:25:24,276 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-29 03:25:24,276 INFO L74 IsIncluded]: Start isIncluded. First operand 13 states. Second operand 13 states and 18 transitions. [2020-07-29 03:25:24,276 INFO L87 Difference]: Start difference. First operand 13 states. Second operand 13 states and 18 transitions. [2020-07-29 03:25:24,278 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-29 03:25:24,278 INFO L93 Difference]: Finished difference Result 13 states and 18 transitions. [2020-07-29 03:25:24,278 INFO L276 IsEmpty]: Start isEmpty. Operand 13 states and 18 transitions. [2020-07-29 03:25:24,279 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-29 03:25:24,279 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-29 03:25:24,279 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-29 03:25:24,279 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-29 03:25:24,280 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2020-07-29 03:25:24,281 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 18 transitions. [2020-07-29 03:25:24,282 INFO L711 BuchiCegarLoop]: Abstraction has 13 states and 18 transitions. [2020-07-29 03:25:24,282 INFO L591 BuchiCegarLoop]: Abstraction has 13 states and 18 transitions. [2020-07-29 03:25:24,282 INFO L424 BuchiCegarLoop]: ======== Iteration 2============ [2020-07-29 03:25:24,283 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 13 states and 18 transitions. [2020-07-29 03:25:24,286 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2020-07-29 03:25:24,287 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 03:25:24,287 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 03:25:24,287 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1] [2020-07-29 03:25:24,288 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2020-07-29 03:25:24,288 INFO L794 eck$LassoCheckResult]: Stem: 133#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; 131#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; 132#L527 assume !(main_~array_size~0 < 1 || main_~array_size~0 >= 536870911); 134#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; 135#L532-3 assume !(main_~k~0 < main_~array_size~0); 140#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; 143#L515-3 [2020-07-29 03:25:24,288 INFO L796 eck$LassoCheckResult]: Loop: 143#L515-3 assume !!(bubbleSort_~i~0 >= 0);bubbleSort_~j~0 := 1; 139#L516-3 assume !(bubbleSort_~j~0 <= bubbleSort_~i~0); 141#L515-2 bubbleSort_#t~post2 := bubbleSort_~i~0;bubbleSort_~i~0 := bubbleSort_#t~post2 - 1;havoc bubbleSort_#t~post2; 143#L515-3 [2020-07-29 03:25:24,289 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 03:25:24,289 INFO L82 PathProgramCache]: Analyzing trace with hash 889568397, now seen corresponding path program 1 times [2020-07-29 03:25:24,289 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 03:25:24,289 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1217637693] [2020-07-29 03:25:24,290 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 03:25:24,327 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 03:25:24,429 INFO L280 TraceCheckUtils]: 0: Hoare triple {173#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; {173#true} is VALID [2020-07-29 03:25:24,429 INFO L280 TraceCheckUtils]: 1: Hoare triple {173#true} 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; {173#true} is VALID [2020-07-29 03:25:24,430 INFO L280 TraceCheckUtils]: 2: Hoare triple {173#true} assume !(main_~array_size~0 < 1 || main_~array_size~0 >= 536870911); {175#(<= 1 ULTIMATE.start_main_~array_size~0)} is VALID [2020-07-29 03:25:24,431 INFO L280 TraceCheckUtils]: 3: Hoare triple {175#(<= 1 ULTIMATE.start_main_~array_size~0)} 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; {176#(and (<= 1 ULTIMATE.start_main_~array_size~0) (= 0 ULTIMATE.start_main_~k~0))} is VALID [2020-07-29 03:25:24,432 INFO L280 TraceCheckUtils]: 4: Hoare triple {176#(and (<= 1 ULTIMATE.start_main_~array_size~0) (= 0 ULTIMATE.start_main_~k~0))} assume !(main_~k~0 < main_~array_size~0); {174#false} is VALID [2020-07-29 03:25:24,432 INFO L280 TraceCheckUtils]: 5: Hoare triple {174#false} 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; {174#false} is VALID [2020-07-29 03:25:24,433 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-29 03:25:24,434 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1217637693] [2020-07-29 03:25:24,435 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-29 03:25:24,435 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-07-29 03:25:24,436 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2028555648] [2020-07-29 03:25:24,441 INFO L799 eck$LassoCheckResult]: stem already infeasible [2020-07-29 03:25:24,441 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 03:25:24,442 INFO L82 PathProgramCache]: Analyzing trace with hash 60779, now seen corresponding path program 1 times [2020-07-29 03:25:24,442 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 03:25:24,442 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [723067834] [2020-07-29 03:25:24,442 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 03:25:24,460 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 03:25:24,461 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 03:25:24,468 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 03:25:24,468 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 03:25:24,470 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-07-29 03:25:24,497 INFO L210 LassoAnalysis]: Preferences: [2020-07-29 03:25:24,497 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2020-07-29 03:25:24,497 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2020-07-29 03:25:24,497 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2020-07-29 03:25:24,497 INFO L129 ssoRankerPreferences]: Use exernal solver: true [2020-07-29 03:25:24,497 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 03:25:24,497 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2020-07-29 03:25:24,498 INFO L132 ssoRankerPreferences]: Path of dumped script: [2020-07-29 03:25:24,498 INFO L133 ssoRankerPreferences]: Filename of dumped script: bubblesort-alloca-2.i_Iteration2_Loop [2020-07-29 03:25:24,498 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2020-07-29 03:25:24,498 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2020-07-29 03:25:24,507 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 03:25:24,510 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 03:25:24,515 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 03:25:24,520 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 03:25:24,535 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 03:25:24,660 INFO L292 LassoAnalysis]: Preprocessing complete. [2020-07-29 03:25:24,661 INFO L404 LassoAnalysis]: Checking for nontermination... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 9 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2020-07-29 03:25:24,666 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2020-07-29 03:25:24,666 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 [2020-07-29 03:25:24,671 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2020-07-29 03:25:24,671 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 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 10 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2020-07-29 03:25:24,713 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2020-07-29 03:25:24,714 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 [2020-07-29 03:25:24,719 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2020-07-29 03:25:24,719 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 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 11 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2020-07-29 03:25:24,769 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2020-07-29 03:25:24,769 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 [2020-07-29 03:25:24,775 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2020-07-29 03:25:24,775 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 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 12 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2020-07-29 03:25:24,829 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2020-07-29 03:25:24,829 INFO L160 nArgumentSynthesizer]: Using integer mode. Waiting until toolchain timeout for monitored process 12 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 13 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2020-07-29 03:25:24,887 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2020-07-29 03:25:24,887 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 [2020-07-29 03:25:24,929 INFO L444 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2020-07-29 03:25:24,931 INFO L210 LassoAnalysis]: Preferences: [2020-07-29 03:25:24,931 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2020-07-29 03:25:24,932 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2020-07-29 03:25:24,932 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2020-07-29 03:25:24,932 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2020-07-29 03:25:24,932 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 03:25:24,932 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2020-07-29 03:25:24,932 INFO L132 ssoRankerPreferences]: Path of dumped script: [2020-07-29 03:25:24,932 INFO L133 ssoRankerPreferences]: Filename of dumped script: bubblesort-alloca-2.i_Iteration2_Loop [2020-07-29 03:25:24,932 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2020-07-29 03:25:24,932 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2020-07-29 03:25:24,941 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 03:25:24,945 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 03:25:24,949 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 03:25:24,960 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 03:25:24,966 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 03:25:25,110 INFO L292 LassoAnalysis]: Preprocessing complete. [2020-07-29 03:25:25,110 INFO L489 LassoAnalysis]: Using template 'affine'. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 14 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 14 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 03:25:25,115 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-07-29 03:25:25,119 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 03:25:25,120 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-07-29 03:25:25,120 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 03:25:25,120 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 03:25:25,120 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 03:25:25,121 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-07-29 03:25:25,121 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-07-29 03:25:25,122 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 15 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2020-07-29 03:25:25,176 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-07-29 03:25:25,178 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 03:25:25,178 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 03:25:25,179 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 03:25:25,179 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. Waiting until toolchain timeout for monitored process 15 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 03:25:25,184 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-07-29 03:25:25,184 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-07-29 03:25:25,189 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 16 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2020-07-29 03:25:25,240 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-07-29 03:25:25,242 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 03:25:25,242 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-07-29 03:25:25,242 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 03:25:25,242 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 03:25:25,243 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 03:25:25,245 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-07-29 03:25:25,245 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. Waiting until toolchain timeout for monitored process 16 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 03:25:25,248 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2020-07-29 03:25:25,252 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2020-07-29 03:25:25,252 INFO L444 ModelExtractionUtils]: 1 out of 4 variables were initially zero. Simplification set additionally 0 variables to zero. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 17 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2020-07-29 03:25:25,256 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2020-07-29 03:25:25,256 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2020-07-29 03:25:25,257 INFO L510 LassoAnalysis]: Proved termination. [2020-07-29 03:25:25,257 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 [2020-07-29 03:25:25,283 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2020-07-29 03:25:25,286 INFO L393 LassoCheck]: Loop: "assume !!(bubbleSort_~i~0 >= 0);bubbleSort_~j~0 := 1;" "assume !(bubbleSort_~j~0 <= bubbleSort_~i~0);" "bubbleSort_#t~post2 := bubbleSort_~i~0;bubbleSort_~i~0 := bubbleSort_#t~post2 - 1;havoc bubbleSort_#t~post2;" [2020-07-29 03:25:25,289 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 03:25:25,304 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 03:25:25,319 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 03:25:25,320 INFO L263 TraceCheckSpWp]: Trace formula consists of 41 conjuncts, 2 conjunts are in the unsatisfiable core [2020-07-29 03:25:25,325 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 03:25:25,326 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-29 03:25:25,332 INFO L280 TraceCheckUtils]: 0: Hoare triple {179#unseeded} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; {179#unseeded} is VALID [2020-07-29 03:25:25,333 INFO L280 TraceCheckUtils]: 1: Hoare triple {179#unseeded} 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; {179#unseeded} is VALID [2020-07-29 03:25:25,334 INFO L280 TraceCheckUtils]: 2: Hoare triple {179#unseeded} assume !(main_~array_size~0 < 1 || main_~array_size~0 >= 536870911); {179#unseeded} is VALID [2020-07-29 03:25:25,334 INFO L280 TraceCheckUtils]: 3: Hoare triple {179#unseeded} 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; {179#unseeded} is VALID [2020-07-29 03:25:25,335 INFO L280 TraceCheckUtils]: 4: Hoare triple {179#unseeded} assume !(main_~k~0 < main_~array_size~0); {179#unseeded} is VALID [2020-07-29 03:25:25,335 INFO L280 TraceCheckUtils]: 5: Hoare triple {179#unseeded} 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; {179#unseeded} is VALID [2020-07-29 03:25:25,340 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 03:25:25,341 WARN L261 TraceCheckSpWp]: Trace formula consists of 8 conjuncts, 4 conjunts are in the unsatisfiable core [2020-07-29 03:25:25,345 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 03:25:25,345 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-29 03:25:25,367 INFO L280 TraceCheckUtils]: 0: Hoare triple {182#(>= oldRank0 (+ (* 2 ULTIMATE.start_bubbleSort_~i~0) 1))} assume !!(bubbleSort_~i~0 >= 0);bubbleSort_~j~0 := 1; {212#(and (<= 0 ULTIMATE.start_bubbleSort_~i~0) (<= (+ (* 2 ULTIMATE.start_bubbleSort_~i~0) 1) oldRank0))} is VALID [2020-07-29 03:25:25,367 INFO L280 TraceCheckUtils]: 1: Hoare triple {212#(and (<= 0 ULTIMATE.start_bubbleSort_~i~0) (<= (+ (* 2 ULTIMATE.start_bubbleSort_~i~0) 1) oldRank0))} assume !(bubbleSort_~j~0 <= bubbleSort_~i~0); {212#(and (<= 0 ULTIMATE.start_bubbleSort_~i~0) (<= (+ (* 2 ULTIMATE.start_bubbleSort_~i~0) 1) oldRank0))} is VALID [2020-07-29 03:25:25,368 INFO L280 TraceCheckUtils]: 2: Hoare triple {212#(and (<= 0 ULTIMATE.start_bubbleSort_~i~0) (<= (+ (* 2 ULTIMATE.start_bubbleSort_~i~0) 1) oldRank0))} bubbleSort_#t~post2 := bubbleSort_~i~0;bubbleSort_~i~0 := bubbleSort_#t~post2 - 1;havoc bubbleSort_#t~post2; {192#(or (and (> oldRank0 (+ (* 2 ULTIMATE.start_bubbleSort_~i~0) 1)) (>= oldRank0 0)) unseeded)} is VALID [2020-07-29 03:25:25,369 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-29 03:25:25,369 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2020-07-29 03:25:25,376 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 9 edges. 9 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-29 03:25:25,377 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 6 letters. Loop has 3 letters. [2020-07-29 03:25:25,377 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:25:25,377 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2020-07-29 03:25:25,377 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 13 states and 18 transitions. cyclomatic complexity: 7 Second operand 3 states. [2020-07-29 03:25:25,429 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 13 states and 18 transitions. cyclomatic complexity: 7. Second operand 3 states. Result 19 states and 28 transitions. Complement of second has 4 states. [2020-07-29 03:25:25,429 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 3 states 1 stem states 1 non-accepting loop states 1 accepting loop states [2020-07-29 03:25:25,429 INFO L123 tractBuchiDifference]: Start testing correctness of buchiDifferenceNCSBLazy3 [2020-07-29 03:25:25,429 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 13 states and 18 transitions. cyclomatic complexity: 7 [2020-07-29 03:25:25,430 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 03:25:25,430 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 03:25:25,430 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 3 states. [2020-07-29 03:25:25,431 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2020-07-29 03:25:25,431 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 03:25:25,432 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 03:25:25,432 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 19 states and 28 transitions. [2020-07-29 03:25:25,433 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2020-07-29 03:25:25,433 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 03:25:25,433 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 03:25:25,433 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 13 states and 18 transitions. cyclomatic complexity: 7 [2020-07-29 03:25:25,435 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 5 examples of accepted words. [2020-07-29 03:25:25,435 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 3 states. [2020-07-29 03:25:25,436 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2020-07-29 03:25:25,436 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 1 examples of accepted words. [2020-07-29 03:25:25,436 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 19 states and 28 transitions. cyclomatic complexity: 12 [2020-07-29 03:25:25,437 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 3 examples of accepted words. [2020-07-29 03:25:25,437 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 13 states and 18 transitions. cyclomatic complexity: 7 Stem has 6 letters. Loop has 3 letters. [2020-07-29 03:25:25,437 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:25:25,437 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 6 letters. Loop has 3 letters. [2020-07-29 03:25:25,438 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:25:25,438 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 19 states and 28 transitions. cyclomatic complexity: 12 Stem has 6 letters. Loop has 3 letters. [2020-07-29 03:25:25,438 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:25:25,438 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 13 states and 18 transitions. cyclomatic complexity: 7 Stem has 1 letters. Loop has 2 letters. [2020-07-29 03:25:25,438 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:25:25,438 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 1 letters. Loop has 2 letters. [2020-07-29 03:25:25,439 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:25:25,439 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 19 states and 28 transitions. cyclomatic complexity: 12 Stem has 1 letters. Loop has 2 letters. [2020-07-29 03:25:25,439 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:25:25,439 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 13 states and 18 transitions. cyclomatic complexity: 7 Stem has 8 letters. Loop has 3 letters. [2020-07-29 03:25:25,439 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:25:25,439 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 8 letters. Loop has 3 letters. [2020-07-29 03:25:25,439 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:25:25,440 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 19 states and 28 transitions. cyclomatic complexity: 12 Stem has 8 letters. Loop has 3 letters. [2020-07-29 03:25:25,440 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:25:25,440 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 13 states and 18 transitions. cyclomatic complexity: 7 Stem has 19 letters. Loop has 19 letters. [2020-07-29 03:25:25,440 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:25:25,440 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 19 letters. Loop has 19 letters. [2020-07-29 03:25:25,440 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:25:25,440 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 19 states and 28 transitions. cyclomatic complexity: 12 Stem has 19 letters. Loop has 19 letters. [2020-07-29 03:25:25,441 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:25:25,441 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 13 states and 18 transitions. cyclomatic complexity: 7 Stem has 13 letters. Loop has 13 letters. [2020-07-29 03:25:25,441 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:25:25,441 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 13 letters. Loop has 13 letters. [2020-07-29 03:25:25,441 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:25:25,441 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 19 states and 28 transitions. cyclomatic complexity: 12 Stem has 13 letters. Loop has 13 letters. [2020-07-29 03:25:25,441 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:25:25,441 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 13 states and 18 transitions. cyclomatic complexity: 7 Stem has 3 letters. Loop has 3 letters. [2020-07-29 03:25:25,442 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:25:25,442 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 3 letters. Loop has 3 letters. [2020-07-29 03:25:25,442 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:25:25,442 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 19 states and 28 transitions. cyclomatic complexity: 12 Stem has 3 letters. Loop has 3 letters. [2020-07-29 03:25:25,442 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:25:25,442 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 13 states and 18 transitions. cyclomatic complexity: 7 Stem has 9 letters. Loop has 3 letters. [2020-07-29 03:25:25,442 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:25:25,442 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 9 letters. Loop has 3 letters. [2020-07-29 03:25:25,443 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:25:25,443 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 19 states and 28 transitions. cyclomatic complexity: 12 Stem has 9 letters. Loop has 3 letters. [2020-07-29 03:25:25,443 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:25:25,443 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 13 states and 18 transitions. cyclomatic complexity: 7 Stem has 7 letters. Loop has 3 letters. [2020-07-29 03:25:25,443 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:25:25,443 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 7 letters. Loop has 3 letters. [2020-07-29 03:25:25,444 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:25:25,444 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 19 states and 28 transitions. cyclomatic complexity: 12 Stem has 7 letters. Loop has 3 letters. [2020-07-29 03:25:25,444 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:25:25,444 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 13 states and 18 transitions. cyclomatic complexity: 7 Stem has 8 letters. Loop has 3 letters. [2020-07-29 03:25:25,444 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:25:25,444 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 8 letters. Loop has 3 letters. [2020-07-29 03:25:25,445 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:25:25,445 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 19 states and 28 transitions. cyclomatic complexity: 12 Stem has 8 letters. Loop has 3 letters. [2020-07-29 03:25:25,445 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:25:25,445 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 13 states and 18 transitions. cyclomatic complexity: 7 Stem has 8 letters. Loop has 3 letters. [2020-07-29 03:25:25,445 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:25:25,445 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 8 letters. Loop has 3 letters. [2020-07-29 03:25:25,446 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:25:25,446 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 19 states and 28 transitions. cyclomatic complexity: 12 Stem has 8 letters. Loop has 3 letters. [2020-07-29 03:25:25,446 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:25:25,446 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 13 states and 18 transitions. cyclomatic complexity: 7 Stem has 6 letters. Loop has 3 letters. [2020-07-29 03:25:25,446 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:25:25,446 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 6 letters. Loop has 3 letters. [2020-07-29 03:25:25,446 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:25:25,447 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 19 states and 28 transitions. cyclomatic complexity: 12 Stem has 6 letters. Loop has 3 letters. [2020-07-29 03:25:25,447 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:25:25,447 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 13 states and 18 transitions. cyclomatic complexity: 7 Stem has 1 letters. Loop has 2 letters. [2020-07-29 03:25:25,447 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:25:25,447 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 1 letters. Loop has 2 letters. [2020-07-29 03:25:25,447 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:25:25,447 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 19 states and 28 transitions. cyclomatic complexity: 12 Stem has 1 letters. Loop has 2 letters. [2020-07-29 03:25:25,447 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:25:25,448 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 13 states and 18 transitions. cyclomatic complexity: 7 Stem has 9 letters. Loop has 3 letters. [2020-07-29 03:25:25,448 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:25:25,448 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 9 letters. Loop has 3 letters. [2020-07-29 03:25:25,448 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:25:25,448 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 19 states and 28 transitions. cyclomatic complexity: 12 Stem has 9 letters. Loop has 3 letters. [2020-07-29 03:25:25,448 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:25:25,449 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 13 states and 18 transitions. cyclomatic complexity: 7 Stem has 10 letters. Loop has 3 letters. [2020-07-29 03:25:25,449 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:25:25,449 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 10 letters. Loop has 3 letters. [2020-07-29 03:25:25,449 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:25:25,449 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 19 states and 28 transitions. cyclomatic complexity: 12 Stem has 10 letters. Loop has 3 letters. [2020-07-29 03:25:25,449 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:25:25,449 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 13 states and 18 transitions. cyclomatic complexity: 7 Stem has 8 letters. Loop has 3 letters. [2020-07-29 03:25:25,450 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:25:25,450 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 8 letters. Loop has 3 letters. [2020-07-29 03:25:25,450 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:25:25,450 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 19 states and 28 transitions. cyclomatic complexity: 12 Stem has 8 letters. Loop has 3 letters. [2020-07-29 03:25:25,450 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:25:25,450 INFO L161 tractBuchiDifference]: Finished testing correctness of buchiDifferenceNCSBLazy3 [2020-07-29 03:25:25,451 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-07-29 03:25:25,452 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 16 transitions. [2020-07-29 03:25:25,452 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 16 transitions. Stem has 6 letters. Loop has 3 letters. [2020-07-29 03:25:25,452 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:25:25,453 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 16 transitions. Stem has 9 letters. Loop has 3 letters. [2020-07-29 03:25:25,453 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:25:25,453 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 16 transitions. Stem has 6 letters. Loop has 6 letters. [2020-07-29 03:25:25,453 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:25:25,453 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 19 states and 28 transitions. cyclomatic complexity: 12 [2020-07-29 03:25:25,455 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2020-07-29 03:25:25,456 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 19 states to 18 states and 26 transitions. [2020-07-29 03:25:25,456 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 10 [2020-07-29 03:25:25,457 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 11 [2020-07-29 03:25:25,457 INFO L73 IsDeterministic]: Start isDeterministic. Operand 18 states and 26 transitions. [2020-07-29 03:25:25,457 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2020-07-29 03:25:25,457 INFO L688 BuchiCegarLoop]: Abstraction has 18 states and 26 transitions. [2020-07-29 03:25:25,457 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18 states and 26 transitions. [2020-07-29 03:25:25,458 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18 to 17. [2020-07-29 03:25:25,459 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-29 03:25:25,459 INFO L82 GeneralOperation]: Start isEquivalent. First operand 18 states and 26 transitions. Second operand 17 states. [2020-07-29 03:25:25,459 INFO L74 IsIncluded]: Start isIncluded. First operand 18 states and 26 transitions. Second operand 17 states. [2020-07-29 03:25:25,459 INFO L87 Difference]: Start difference. First operand 18 states and 26 transitions. Second operand 17 states. [2020-07-29 03:25:25,460 INFO L149 Difference]: Subtrahend was not deterministic. Recomputing result with determinization. [2020-07-29 03:25:25,463 INFO L93 Difference]: Finished difference Result 18 states and 26 transitions. [2020-07-29 03:25:25,463 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 26 transitions. [2020-07-29 03:25:25,463 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-29 03:25:25,463 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-29 03:25:25,464 INFO L74 IsIncluded]: Start isIncluded. First operand 17 states. Second operand 18 states and 26 transitions. [2020-07-29 03:25:25,464 INFO L87 Difference]: Start difference. First operand 17 states. Second operand 18 states and 26 transitions. [2020-07-29 03:25:25,464 INFO L149 Difference]: Subtrahend was not deterministic. Recomputing result with determinization. [2020-07-29 03:25:25,466 INFO L93 Difference]: Finished difference Result 19 states and 28 transitions. [2020-07-29 03:25:25,467 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 28 transitions. [2020-07-29 03:25:25,467 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-29 03:25:25,467 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-29 03:25:25,467 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-29 03:25:25,467 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-29 03:25:25,467 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2020-07-29 03:25:25,468 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 25 transitions. [2020-07-29 03:25:25,469 INFO L711 BuchiCegarLoop]: Abstraction has 17 states and 25 transitions. [2020-07-29 03:25:25,469 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-29 03:25:25,472 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-07-29 03:25:25,473 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2020-07-29 03:25:25,473 INFO L87 Difference]: Start difference. First operand 17 states and 25 transitions. Second operand 4 states. [2020-07-29 03:25:25,532 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-29 03:25:25,532 INFO L93 Difference]: Finished difference Result 18 states and 25 transitions. [2020-07-29 03:25:25,532 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-07-29 03:25:25,532 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states. [2020-07-29 03:25:25,540 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 6 edges. 6 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-29 03:25:25,541 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 18 states and 25 transitions. [2020-07-29 03:25:25,542 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2020-07-29 03:25:25,543 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 18 states to 18 states and 25 transitions. [2020-07-29 03:25:25,544 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 10 [2020-07-29 03:25:25,544 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 10 [2020-07-29 03:25:25,544 INFO L73 IsDeterministic]: Start isDeterministic. Operand 18 states and 25 transitions. [2020-07-29 03:25:25,544 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2020-07-29 03:25:25,544 INFO L688 BuchiCegarLoop]: Abstraction has 18 states and 25 transitions. [2020-07-29 03:25:25,544 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18 states and 25 transitions. [2020-07-29 03:25:25,546 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18 to 17. [2020-07-29 03:25:25,546 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-29 03:25:25,546 INFO L82 GeneralOperation]: Start isEquivalent. First operand 18 states and 25 transitions. Second operand 17 states. [2020-07-29 03:25:25,546 INFO L74 IsIncluded]: Start isIncluded. First operand 18 states and 25 transitions. Second operand 17 states. [2020-07-29 03:25:25,546 INFO L87 Difference]: Start difference. First operand 18 states and 25 transitions. Second operand 17 states. [2020-07-29 03:25:25,547 INFO L149 Difference]: Subtrahend was not deterministic. Recomputing result with determinization. [2020-07-29 03:25:25,548 INFO L93 Difference]: Finished difference Result 18 states and 25 transitions. [2020-07-29 03:25:25,548 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 25 transitions. [2020-07-29 03:25:25,549 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-29 03:25:25,549 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-29 03:25:25,549 INFO L74 IsIncluded]: Start isIncluded. First operand 17 states. Second operand 18 states and 25 transitions. [2020-07-29 03:25:25,549 INFO L87 Difference]: Start difference. First operand 17 states. Second operand 18 states and 25 transitions. [2020-07-29 03:25:25,550 INFO L149 Difference]: Subtrahend was not deterministic. Recomputing result with determinization. [2020-07-29 03:25:25,551 INFO L93 Difference]: Finished difference Result 18 states and 25 transitions. [2020-07-29 03:25:25,552 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 25 transitions. [2020-07-29 03:25:25,552 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-29 03:25:25,552 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-29 03:25:25,552 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-29 03:25:25,552 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-29 03:25:25,552 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2020-07-29 03:25:25,553 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 24 transitions. [2020-07-29 03:25:25,553 INFO L711 BuchiCegarLoop]: Abstraction has 17 states and 24 transitions. [2020-07-29 03:25:25,553 INFO L591 BuchiCegarLoop]: Abstraction has 17 states and 24 transitions. [2020-07-29 03:25:25,553 INFO L424 BuchiCegarLoop]: ======== Iteration 3============ [2020-07-29 03:25:25,554 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 17 states and 24 transitions. [2020-07-29 03:25:25,554 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2020-07-29 03:25:25,554 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 03:25:25,555 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 03:25:25,555 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-29 03:25:25,555 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2020-07-29 03:25:25,555 INFO L794 eck$LassoCheckResult]: Stem: 371#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; 369#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; 370#L527 assume !(main_~array_size~0 < 1 || main_~array_size~0 >= 536870911); 372#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; 373#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; 374#L532-2 main_#t~post10 := main_~k~0;main_~k~0 := 1 + main_#t~post10;havoc main_#t~post10; 375#L532-3 assume !(main_~k~0 < main_~array_size~0); 380#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; 385#L515-3 assume !!(bubbleSort_~i~0 >= 0);bubbleSort_~j~0 := 1; 377#L516-3 [2020-07-29 03:25:25,556 INFO L796 eck$LassoCheckResult]: Loop: 377#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); 381#L517 assume bubbleSort_#t~mem4 > bubbleSort_#t~mem5;havoc bubbleSort_#t~mem4;havoc bubbleSort_#t~mem5;call bubbleSort_#t~mem6 := read~int(bubbleSort_~numbers.base, bubbleSort_~numbers.offset + 4 * (bubbleSort_~j~0 - 1), 4);bubbleSort_~temp~0 := bubbleSort_#t~mem6;havoc bubbleSort_#t~mem6;call bubbleSort_#t~mem7 := read~int(bubbleSort_~numbers.base, bubbleSort_~numbers.offset + 4 * bubbleSort_~j~0, 4);call write~int(bubbleSort_#t~mem7, bubbleSort_~numbers.base, bubbleSort_~numbers.offset + 4 * (bubbleSort_~j~0 - 1), 4);havoc bubbleSort_#t~mem7;call write~int(bubbleSort_~temp~0, bubbleSort_~numbers.base, bubbleSort_~numbers.offset + 4 * bubbleSort_~j~0, 4); 376#L516-2 bubbleSort_#t~post3 := bubbleSort_~j~0;bubbleSort_~j~0 := 1 + bubbleSort_#t~post3;havoc bubbleSort_#t~post3; 377#L516-3 [2020-07-29 03:25:25,556 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 03:25:25,556 INFO L82 PathProgramCache]: Analyzing trace with hash 1185641744, now seen corresponding path program 1 times [2020-07-29 03:25:25,556 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 03:25:25,556 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [665002387] [2020-07-29 03:25:25,556 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 03:25:25,572 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 03:25:25,572 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 03:25:25,585 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 03:25:25,585 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 03:25:25,589 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-07-29 03:25:25,590 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 03:25:25,590 INFO L82 PathProgramCache]: Analyzing trace with hash 68618, now seen corresponding path program 1 times [2020-07-29 03:25:25,590 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 03:25:25,590 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1562557983] [2020-07-29 03:25:25,590 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 03:25:25,597 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 03:25:25,598 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 03:25:25,603 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 03:25:25,604 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 03:25:25,606 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-07-29 03:25:25,607 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 03:25:25,607 INFO L82 PathProgramCache]: Analyzing trace with hash -357807973, now seen corresponding path program 1 times [2020-07-29 03:25:25,607 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 03:25:25,607 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1595321861] [2020-07-29 03:25:25,607 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 03:25:25,626 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 03:25:25,716 INFO L280 TraceCheckUtils]: 0: Hoare triple {482#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; {482#true} is VALID [2020-07-29 03:25:25,717 INFO L280 TraceCheckUtils]: 1: Hoare triple {482#true} 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; {482#true} is VALID [2020-07-29 03:25:25,717 INFO L280 TraceCheckUtils]: 2: Hoare triple {482#true} assume !(main_~array_size~0 < 1 || main_~array_size~0 >= 536870911); {482#true} is VALID [2020-07-29 03:25:25,718 INFO L280 TraceCheckUtils]: 3: Hoare triple {482#true} 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; {484#(= 0 ULTIMATE.start_main_~k~0)} is VALID [2020-07-29 03:25:25,719 INFO L280 TraceCheckUtils]: 4: Hoare triple {484#(= 0 ULTIMATE.start_main_~k~0)} assume !!(main_~k~0 < main_~array_size~0);call write~int(main_#t~nondet11, main_~numbers~0.base, main_~numbers~0.offset + 4 * main_~k~0, 4);havoc main_#t~nondet11; {484#(= 0 ULTIMATE.start_main_~k~0)} is VALID [2020-07-29 03:25:25,720 INFO L280 TraceCheckUtils]: 5: Hoare triple {484#(= 0 ULTIMATE.start_main_~k~0)} main_#t~post10 := main_~k~0;main_~k~0 := 1 + main_#t~post10;havoc main_#t~post10; {485#(<= ULTIMATE.start_main_~k~0 1)} is VALID [2020-07-29 03:25:25,720 INFO L280 TraceCheckUtils]: 6: Hoare triple {485#(<= ULTIMATE.start_main_~k~0 1)} assume !(main_~k~0 < main_~array_size~0); {486#(<= ULTIMATE.start_main_~array_size~0 1)} is VALID [2020-07-29 03:25:25,722 INFO L280 TraceCheckUtils]: 7: Hoare triple {486#(<= ULTIMATE.start_main_~array_size~0 1)} bubbleSort_#in~numbers.base, bubbleSort_#in~numbers.offset, bubbleSort_#in~array_size := main_~numbers~0.base, main_~numbers~0.offset, main_~array_size~0;havoc bubbleSort_#t~mem4, bubbleSort_#t~mem5, bubbleSort_#t~mem6, bubbleSort_#t~mem7, bubbleSort_#t~post3, bubbleSort_#t~post2, bubbleSort_~numbers.base, bubbleSort_~numbers.offset, bubbleSort_~array_size, bubbleSort_~i~0, bubbleSort_~j~0, bubbleSort_~temp~0;bubbleSort_~numbers.base, bubbleSort_~numbers.offset := bubbleSort_#in~numbers.base, bubbleSort_#in~numbers.offset;bubbleSort_~array_size := bubbleSort_#in~array_size;havoc bubbleSort_~i~0;havoc bubbleSort_~j~0;havoc bubbleSort_~temp~0;bubbleSort_~i~0 := bubbleSort_~array_size - 1; {487#(<= ULTIMATE.start_bubbleSort_~i~0 0)} is VALID [2020-07-29 03:25:25,723 INFO L280 TraceCheckUtils]: 8: Hoare triple {487#(<= ULTIMATE.start_bubbleSort_~i~0 0)} assume !!(bubbleSort_~i~0 >= 0);bubbleSort_~j~0 := 1; {488#(and (<= ULTIMATE.start_bubbleSort_~i~0 0) (= ULTIMATE.start_bubbleSort_~j~0 1))} is VALID [2020-07-29 03:25:25,724 INFO L280 TraceCheckUtils]: 9: Hoare triple {488#(and (<= ULTIMATE.start_bubbleSort_~i~0 0) (= ULTIMATE.start_bubbleSort_~j~0 1))} 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); {483#false} is VALID [2020-07-29 03:25:25,724 INFO L280 TraceCheckUtils]: 10: Hoare triple {483#false} assume bubbleSort_#t~mem4 > bubbleSort_#t~mem5;havoc bubbleSort_#t~mem4;havoc bubbleSort_#t~mem5;call bubbleSort_#t~mem6 := read~int(bubbleSort_~numbers.base, bubbleSort_~numbers.offset + 4 * (bubbleSort_~j~0 - 1), 4);bubbleSort_~temp~0 := bubbleSort_#t~mem6;havoc bubbleSort_#t~mem6;call bubbleSort_#t~mem7 := read~int(bubbleSort_~numbers.base, bubbleSort_~numbers.offset + 4 * bubbleSort_~j~0, 4);call write~int(bubbleSort_#t~mem7, bubbleSort_~numbers.base, bubbleSort_~numbers.offset + 4 * (bubbleSort_~j~0 - 1), 4);havoc bubbleSort_#t~mem7;call write~int(bubbleSort_~temp~0, bubbleSort_~numbers.base, bubbleSort_~numbers.offset + 4 * bubbleSort_~j~0, 4); {483#false} is VALID [2020-07-29 03:25:25,725 INFO L280 TraceCheckUtils]: 11: Hoare triple {483#false} bubbleSort_#t~post3 := bubbleSort_~j~0;bubbleSort_~j~0 := 1 + bubbleSort_#t~post3;havoc bubbleSort_#t~post3; {483#false} is VALID [2020-07-29 03:25:25,726 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-29 03:25:25,726 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1595321861] [2020-07-29 03:25:25,726 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1367503110] [2020-07-29 03:25:25,726 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/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 [2020-07-29 03:25:25,765 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 03:25:25,766 INFO L263 TraceCheckSpWp]: Trace formula consists of 75 conjuncts, 8 conjunts are in the unsatisfiable core [2020-07-29 03:25:25,774 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 03:25:25,775 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-29 03:25:25,991 INFO L280 TraceCheckUtils]: 0: Hoare triple {482#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; {482#true} is VALID [2020-07-29 03:25:25,992 INFO L280 TraceCheckUtils]: 1: Hoare triple {482#true} 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; {482#true} is VALID [2020-07-29 03:25:25,992 INFO L280 TraceCheckUtils]: 2: Hoare triple {482#true} assume !(main_~array_size~0 < 1 || main_~array_size~0 >= 536870911); {482#true} is VALID [2020-07-29 03:25:25,993 INFO L280 TraceCheckUtils]: 3: Hoare triple {482#true} 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; {501#(<= ULTIMATE.start_main_~k~0 0)} is VALID [2020-07-29 03:25:25,994 INFO L280 TraceCheckUtils]: 4: Hoare triple {501#(<= ULTIMATE.start_main_~k~0 0)} 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; {501#(<= ULTIMATE.start_main_~k~0 0)} is VALID [2020-07-29 03:25:25,995 INFO L280 TraceCheckUtils]: 5: Hoare triple {501#(<= ULTIMATE.start_main_~k~0 0)} main_#t~post10 := main_~k~0;main_~k~0 := 1 + main_#t~post10;havoc main_#t~post10; {485#(<= ULTIMATE.start_main_~k~0 1)} is VALID [2020-07-29 03:25:25,996 INFO L280 TraceCheckUtils]: 6: Hoare triple {485#(<= ULTIMATE.start_main_~k~0 1)} assume !(main_~k~0 < main_~array_size~0); {486#(<= ULTIMATE.start_main_~array_size~0 1)} is VALID [2020-07-29 03:25:25,997 INFO L280 TraceCheckUtils]: 7: Hoare triple {486#(<= ULTIMATE.start_main_~array_size~0 1)} bubbleSort_#in~numbers.base, bubbleSort_#in~numbers.offset, bubbleSort_#in~array_size := main_~numbers~0.base, main_~numbers~0.offset, main_~array_size~0;havoc bubbleSort_#t~mem4, bubbleSort_#t~mem5, bubbleSort_#t~mem6, bubbleSort_#t~mem7, bubbleSort_#t~post3, bubbleSort_#t~post2, bubbleSort_~numbers.base, bubbleSort_~numbers.offset, bubbleSort_~array_size, bubbleSort_~i~0, bubbleSort_~j~0, bubbleSort_~temp~0;bubbleSort_~numbers.base, bubbleSort_~numbers.offset := bubbleSort_#in~numbers.base, bubbleSort_#in~numbers.offset;bubbleSort_~array_size := bubbleSort_#in~array_size;havoc bubbleSort_~i~0;havoc bubbleSort_~j~0;havoc bubbleSort_~temp~0;bubbleSort_~i~0 := bubbleSort_~array_size - 1; {487#(<= ULTIMATE.start_bubbleSort_~i~0 0)} is VALID [2020-07-29 03:25:25,997 INFO L280 TraceCheckUtils]: 8: Hoare triple {487#(<= ULTIMATE.start_bubbleSort_~i~0 0)} assume !!(bubbleSort_~i~0 >= 0);bubbleSort_~j~0 := 1; {517#(and (<= 1 ULTIMATE.start_bubbleSort_~j~0) (<= ULTIMATE.start_bubbleSort_~i~0 0))} is VALID [2020-07-29 03:25:25,999 INFO L280 TraceCheckUtils]: 9: Hoare triple {517#(and (<= 1 ULTIMATE.start_bubbleSort_~j~0) (<= ULTIMATE.start_bubbleSort_~i~0 0))} 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); {483#false} is VALID [2020-07-29 03:25:25,999 INFO L280 TraceCheckUtils]: 10: Hoare triple {483#false} assume bubbleSort_#t~mem4 > bubbleSort_#t~mem5;havoc bubbleSort_#t~mem4;havoc bubbleSort_#t~mem5;call bubbleSort_#t~mem6 := read~int(bubbleSort_~numbers.base, bubbleSort_~numbers.offset + 4 * (bubbleSort_~j~0 - 1), 4);bubbleSort_~temp~0 := bubbleSort_#t~mem6;havoc bubbleSort_#t~mem6;call bubbleSort_#t~mem7 := read~int(bubbleSort_~numbers.base, bubbleSort_~numbers.offset + 4 * bubbleSort_~j~0, 4);call write~int(bubbleSort_#t~mem7, bubbleSort_~numbers.base, bubbleSort_~numbers.offset + 4 * (bubbleSort_~j~0 - 1), 4);havoc bubbleSort_#t~mem7;call write~int(bubbleSort_~temp~0, bubbleSort_~numbers.base, bubbleSort_~numbers.offset + 4 * bubbleSort_~j~0, 4); {483#false} is VALID [2020-07-29 03:25:25,999 INFO L280 TraceCheckUtils]: 11: Hoare triple {483#false} bubbleSort_#t~post3 := bubbleSort_~j~0;bubbleSort_~j~0 := 1 + bubbleSort_#t~post3;havoc bubbleSort_#t~post3; {483#false} is VALID [2020-07-29 03:25:26,000 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-29 03:25:26,001 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-07-29 03:25:26,001 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 9 [2020-07-29 03:25:26,001 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1139955598] [2020-07-29 03:25:26,127 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-29 03:25:26,127 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-07-29 03:25:26,128 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2020-07-29 03:25:26,128 INFO L87 Difference]: Start difference. First operand 17 states and 24 transitions. cyclomatic complexity: 10 Second operand 9 states. [2020-07-29 03:25:26,392 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-29 03:25:26,393 INFO L93 Difference]: Finished difference Result 31 states and 41 transitions. [2020-07-29 03:25:26,393 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-07-29 03:25:26,393 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 9 states. [2020-07-29 03:25:26,414 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 17 edges. 17 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-29 03:25:26,414 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 31 states and 41 transitions. [2020-07-29 03:25:26,416 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2020-07-29 03:25:26,417 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 31 states to 20 states and 26 transitions. [2020-07-29 03:25:26,417 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 10 [2020-07-29 03:25:26,418 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 10 [2020-07-29 03:25:26,418 INFO L73 IsDeterministic]: Start isDeterministic. Operand 20 states and 26 transitions. [2020-07-29 03:25:26,418 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2020-07-29 03:25:26,418 INFO L688 BuchiCegarLoop]: Abstraction has 20 states and 26 transitions. [2020-07-29 03:25:26,418 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20 states and 26 transitions. [2020-07-29 03:25:26,420 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20 to 19. [2020-07-29 03:25:26,420 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-29 03:25:26,420 INFO L82 GeneralOperation]: Start isEquivalent. First operand 20 states and 26 transitions. Second operand 19 states. [2020-07-29 03:25:26,420 INFO L74 IsIncluded]: Start isIncluded. First operand 20 states and 26 transitions. Second operand 19 states. [2020-07-29 03:25:26,421 INFO L87 Difference]: Start difference. First operand 20 states and 26 transitions. Second operand 19 states. [2020-07-29 03:25:26,422 INFO L149 Difference]: Subtrahend was not deterministic. Recomputing result with determinization. [2020-07-29 03:25:26,423 INFO L93 Difference]: Finished difference Result 20 states and 26 transitions. [2020-07-29 03:25:26,423 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 26 transitions. [2020-07-29 03:25:26,424 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-29 03:25:26,424 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-29 03:25:26,424 INFO L74 IsIncluded]: Start isIncluded. First operand 19 states. Second operand 20 states and 26 transitions. [2020-07-29 03:25:26,424 INFO L87 Difference]: Start difference. First operand 19 states. Second operand 20 states and 26 transitions. [2020-07-29 03:25:26,425 INFO L149 Difference]: Subtrahend was not deterministic. Recomputing result with determinization. [2020-07-29 03:25:26,427 INFO L93 Difference]: Finished difference Result 20 states and 26 transitions. [2020-07-29 03:25:26,427 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 26 transitions. [2020-07-29 03:25:26,427 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-29 03:25:26,427 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-29 03:25:26,428 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-29 03:25:26,428 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-29 03:25:26,428 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2020-07-29 03:25:26,429 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 25 transitions. [2020-07-29 03:25:26,429 INFO L711 BuchiCegarLoop]: Abstraction has 19 states and 25 transitions. [2020-07-29 03:25:26,429 INFO L591 BuchiCegarLoop]: Abstraction has 19 states and 25 transitions. [2020-07-29 03:25:26,429 INFO L424 BuchiCegarLoop]: ======== Iteration 4============ [2020-07-29 03:25:26,430 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 19 states and 25 transitions. [2020-07-29 03:25:26,430 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2020-07-29 03:25:26,430 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 03:25:26,431 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 03:25:26,431 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 1, 1, 1, 1, 1, 1, 1] [2020-07-29 03:25:26,431 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2020-07-29 03:25:26,431 INFO L794 eck$LassoCheckResult]: Stem: 567#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; 565#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; 566#L527 assume !(main_~array_size~0 < 1 || main_~array_size~0 >= 536870911); 568#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; 569#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; 570#L532-2 main_#t~post10 := main_~k~0;main_~k~0 := 1 + main_#t~post10;havoc main_#t~post10; 571#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; 576#L532-2 main_#t~post10 := main_~k~0;main_~k~0 := 1 + main_#t~post10;havoc main_#t~post10; 583#L532-3 assume !(main_~k~0 < main_~array_size~0); 581#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; 582#L515-3 assume !!(bubbleSort_~i~0 >= 0);bubbleSort_~j~0 := 1; 573#L516-3 [2020-07-29 03:25:26,432 INFO L796 eck$LassoCheckResult]: Loop: 573#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); 577#L517 assume bubbleSort_#t~mem4 > bubbleSort_#t~mem5;havoc bubbleSort_#t~mem4;havoc bubbleSort_#t~mem5;call bubbleSort_#t~mem6 := read~int(bubbleSort_~numbers.base, bubbleSort_~numbers.offset + 4 * (bubbleSort_~j~0 - 1), 4);bubbleSort_~temp~0 := bubbleSort_#t~mem6;havoc bubbleSort_#t~mem6;call bubbleSort_#t~mem7 := read~int(bubbleSort_~numbers.base, bubbleSort_~numbers.offset + 4 * bubbleSort_~j~0, 4);call write~int(bubbleSort_#t~mem7, bubbleSort_~numbers.base, bubbleSort_~numbers.offset + 4 * (bubbleSort_~j~0 - 1), 4);havoc bubbleSort_#t~mem7;call write~int(bubbleSort_~temp~0, bubbleSort_~numbers.base, bubbleSort_~numbers.offset + 4 * bubbleSort_~j~0, 4); 572#L516-2 bubbleSort_#t~post3 := bubbleSort_~j~0;bubbleSort_~j~0 := 1 + bubbleSort_#t~post3;havoc bubbleSort_#t~post3; 573#L516-3 [2020-07-29 03:25:26,432 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 03:25:26,432 INFO L82 PathProgramCache]: Analyzing trace with hash 1237095790, now seen corresponding path program 2 times [2020-07-29 03:25:26,432 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 03:25:26,433 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1861029989] [2020-07-29 03:25:26,433 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 03:25:26,448 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 03:25:26,448 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 03:25:26,461 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 03:25:26,462 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 03:25:26,470 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-07-29 03:25:26,470 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 03:25:26,471 INFO L82 PathProgramCache]: Analyzing trace with hash 68618, now seen corresponding path program 2 times [2020-07-29 03:25:26,471 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 03:25:26,473 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1285687332] [2020-07-29 03:25:26,474 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 03:25:26,485 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 03:25:26,487 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 03:25:26,499 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 03:25:26,500 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 03:25:26,502 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-07-29 03:25:26,503 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 03:25:26,504 INFO L82 PathProgramCache]: Analyzing trace with hash -793648259, now seen corresponding path program 2 times [2020-07-29 03:25:26,505 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 03:25:26,505 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [819958860] [2020-07-29 03:25:26,505 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 03:25:26,551 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 03:25:26,553 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 03:25:26,586 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 03:25:26,589 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 03:25:26,596 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-07-29 03:25:26,989 WARN L193 SmtUtils]: Spent 285.00 ms on a formula simplification. DAG size of input: 103 DAG size of output: 86 [2020-07-29 03:25:27,158 INFO L210 LassoAnalysis]: Preferences: [2020-07-29 03:25:27,158 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2020-07-29 03:25:27,158 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2020-07-29 03:25:27,159 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2020-07-29 03:25:27,159 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2020-07-29 03:25:27,159 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 03:25:27,159 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2020-07-29 03:25:27,159 INFO L132 ssoRankerPreferences]: Path of dumped script: [2020-07-29 03:25:27,159 INFO L133 ssoRankerPreferences]: Filename of dumped script: bubblesort-alloca-2.i_Iteration4_Lasso [2020-07-29 03:25:27,159 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2020-07-29 03:25:27,159 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2020-07-29 03:25:27,188 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 03:25:27,199 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 03:25:27,204 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 03:25:27,208 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 03:25:27,457 WARN L193 SmtUtils]: Spent 190.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 52 [2020-07-29 03:25:27,553 WARN L257 bleTransFormulaUtils]: 2 quantified variables [2020-07-29 03:25:27,556 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 03:25:27,560 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 03:25:27,563 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 03:25:27,566 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 03:25:27,570 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 03:25:27,573 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 03:25:27,576 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 03:25:27,579 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 03:25:27,584 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 03:25:27,587 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 03:25:27,591 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 03:25:27,594 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 03:25:27,907 WARN L193 SmtUtils]: Spent 118.00 ms on a formula simplification. DAG size of input: 47 DAG size of output: 45 [2020-07-29 03:25:28,314 INFO L292 LassoAnalysis]: Preprocessing complete. [2020-07-29 03:25:28,316 INFO L489 LassoAnalysis]: Using template 'affine'. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 19 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2020-07-29 03:25:28,323 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-07-29 03:25:28,325 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 03:25:28,325 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-07-29 03:25:28,325 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 03:25:28,325 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 03:25:28,325 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 03:25:28,326 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-07-29 03:25:28,326 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. Waiting until toolchain timeout for monitored process 19 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 03:25:28,328 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/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 [2020-07-29 03:25:28,357 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-07-29 03:25:28,358 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 03:25:28,358 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 03:25:28,359 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 03:25:28,359 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 03:25:28,361 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-07-29 03:25:28,361 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-07-29 03:25:28,365 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/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 [2020-07-29 03:25:28,403 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-07-29 03:25:28,405 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 03:25:28,405 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-07-29 03:25:28,405 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 03:25:28,405 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 03:25:28,405 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 03:25:28,406 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-07-29 03:25:28,406 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-07-29 03:25:28,407 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 22 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 22 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 03:25:28,433 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-07-29 03:25:28,435 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 03:25:28,436 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 03:25:28,436 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 03:25:28,436 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 03:25:28,450 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-07-29 03:25:28,450 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-07-29 03:25:28,471 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2020-07-29 03:25:28,547 INFO L443 ModelExtractionUtils]: Simplification made 26 calls to the SMT solver. [2020-07-29 03:25:28,547 INFO L444 ModelExtractionUtils]: 10 out of 43 variables were initially zero. Simplification set additionally 29 variables to zero. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 23 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2020-07-29 03:25:28,554 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... Waiting until toolchain timeout for monitored process 23 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 03:25:28,557 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2020-07-29 03:25:28,557 INFO L510 LassoAnalysis]: Proved termination. [2020-07-29 03:25:28,557 INFO L512 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select #length ULTIMATE.start_bubbleSort_~numbers.base)_1, ULTIMATE.start_bubbleSort_~numbers.offset, ULTIMATE.start_bubbleSort_~j~0) = 1*v_rep(select #length ULTIMATE.start_bubbleSort_~numbers.base)_1 - 1*ULTIMATE.start_bubbleSort_~numbers.offset - 4*ULTIMATE.start_bubbleSort_~j~0 Supporting invariants [] [2020-07-29 03:25:28,618 INFO L297 tatePredicateManager]: 6 out of 6 supporting invariants were superfluous and have been removed [2020-07-29 03:25:28,624 INFO L393 LassoCheck]: Loop: "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);" "assume bubbleSort_#t~mem4 > bubbleSort_#t~mem5;havoc bubbleSort_#t~mem4;havoc bubbleSort_#t~mem5;call bubbleSort_#t~mem6 := read~int(bubbleSort_~numbers.base, bubbleSort_~numbers.offset + 4 * (bubbleSort_~j~0 - 1), 4);bubbleSort_~temp~0 := bubbleSort_#t~mem6;havoc bubbleSort_#t~mem6;call bubbleSort_#t~mem7 := read~int(bubbleSort_~numbers.base, bubbleSort_~numbers.offset + 4 * bubbleSort_~j~0, 4);call write~int(bubbleSort_#t~mem7, bubbleSort_~numbers.base, bubbleSort_~numbers.offset + 4 * (bubbleSort_~j~0 - 1), 4);havoc bubbleSort_#t~mem7;call write~int(bubbleSort_~temp~0, bubbleSort_~numbers.base, bubbleSort_~numbers.offset + 4 * bubbleSort_~j~0, 4);" "bubbleSort_#t~post3 := bubbleSort_~j~0;bubbleSort_~j~0 := 1 + bubbleSort_#t~post3;havoc bubbleSort_#t~post3;" [2020-07-29 03:25:28,632 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 03:25:28,634 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-29 03:25:28,650 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 03:25:28,664 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 03:25:28,665 INFO L263 TraceCheckSpWp]: Trace formula consists of 60 conjuncts, 2 conjunts are in the unsatisfiable core [2020-07-29 03:25:28,674 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 03:25:28,675 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-29 03:25:28,686 INFO L280 TraceCheckUtils]: 0: Hoare triple {694#unseeded} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; {694#unseeded} is VALID [2020-07-29 03:25:28,687 INFO L280 TraceCheckUtils]: 1: Hoare triple {694#unseeded} 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; {694#unseeded} is VALID [2020-07-29 03:25:28,688 INFO L280 TraceCheckUtils]: 2: Hoare triple {694#unseeded} assume !(main_~array_size~0 < 1 || main_~array_size~0 >= 536870911); {694#unseeded} is VALID [2020-07-29 03:25:28,689 INFO L280 TraceCheckUtils]: 3: Hoare triple {694#unseeded} 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; {694#unseeded} is VALID [2020-07-29 03:25:28,689 INFO L280 TraceCheckUtils]: 4: Hoare triple {694#unseeded} 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; {694#unseeded} is VALID [2020-07-29 03:25:28,690 INFO L280 TraceCheckUtils]: 5: Hoare triple {694#unseeded} main_#t~post10 := main_~k~0;main_~k~0 := 1 + main_#t~post10;havoc main_#t~post10; {694#unseeded} is VALID [2020-07-29 03:25:28,691 INFO L280 TraceCheckUtils]: 6: Hoare triple {694#unseeded} 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; {694#unseeded} is VALID [2020-07-29 03:25:28,696 INFO L280 TraceCheckUtils]: 7: Hoare triple {694#unseeded} main_#t~post10 := main_~k~0;main_~k~0 := 1 + main_#t~post10;havoc main_#t~post10; {694#unseeded} is VALID [2020-07-29 03:25:28,696 INFO L280 TraceCheckUtils]: 8: Hoare triple {694#unseeded} assume !(main_~k~0 < main_~array_size~0); {694#unseeded} is VALID [2020-07-29 03:25:28,697 INFO L280 TraceCheckUtils]: 9: Hoare triple {694#unseeded} 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; {694#unseeded} is VALID [2020-07-29 03:25:28,698 INFO L280 TraceCheckUtils]: 10: Hoare triple {694#unseeded} assume !!(bubbleSort_~i~0 >= 0);bubbleSort_~j~0 := 1; {694#unseeded} is VALID [2020-07-29 03:25:28,704 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 03:25:28,705 INFO L263 TraceCheckSpWp]: Trace formula consists of 25 conjuncts, 4 conjunts are in the unsatisfiable core [2020-07-29 03:25:28,711 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 03:25:28,712 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-29 03:25:28,731 INFO L280 TraceCheckUtils]: 0: Hoare triple {697#(>= oldRank0 (+ (select |#length| ULTIMATE.start_bubbleSort_~numbers.base) (* (- 1) ULTIMATE.start_bubbleSort_~numbers.offset) (* (- 4) ULTIMATE.start_bubbleSort_~j~0)))} 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); {772#(and (<= (+ ULTIMATE.start_bubbleSort_~numbers.offset (* 4 ULTIMATE.start_bubbleSort_~j~0) 4) (select |#length| ULTIMATE.start_bubbleSort_~numbers.base)) (<= (select |#length| ULTIMATE.start_bubbleSort_~numbers.base) (+ ULTIMATE.start_bubbleSort_~numbers.offset (* 4 ULTIMATE.start_bubbleSort_~j~0) oldRank0)))} is VALID [2020-07-29 03:25:28,733 INFO L280 TraceCheckUtils]: 1: Hoare triple {772#(and (<= (+ ULTIMATE.start_bubbleSort_~numbers.offset (* 4 ULTIMATE.start_bubbleSort_~j~0) 4) (select |#length| ULTIMATE.start_bubbleSort_~numbers.base)) (<= (select |#length| ULTIMATE.start_bubbleSort_~numbers.base) (+ ULTIMATE.start_bubbleSort_~numbers.offset (* 4 ULTIMATE.start_bubbleSort_~j~0) oldRank0)))} assume bubbleSort_#t~mem4 > bubbleSort_#t~mem5;havoc bubbleSort_#t~mem4;havoc bubbleSort_#t~mem5;call bubbleSort_#t~mem6 := read~int(bubbleSort_~numbers.base, bubbleSort_~numbers.offset + 4 * (bubbleSort_~j~0 - 1), 4);bubbleSort_~temp~0 := bubbleSort_#t~mem6;havoc bubbleSort_#t~mem6;call bubbleSort_#t~mem7 := read~int(bubbleSort_~numbers.base, bubbleSort_~numbers.offset + 4 * bubbleSort_~j~0, 4);call write~int(bubbleSort_#t~mem7, bubbleSort_~numbers.base, bubbleSort_~numbers.offset + 4 * (bubbleSort_~j~0 - 1), 4);havoc bubbleSort_#t~mem7;call write~int(bubbleSort_~temp~0, bubbleSort_~numbers.base, bubbleSort_~numbers.offset + 4 * bubbleSort_~j~0, 4); {772#(and (<= (+ ULTIMATE.start_bubbleSort_~numbers.offset (* 4 ULTIMATE.start_bubbleSort_~j~0) 4) (select |#length| ULTIMATE.start_bubbleSort_~numbers.base)) (<= (select |#length| ULTIMATE.start_bubbleSort_~numbers.base) (+ ULTIMATE.start_bubbleSort_~numbers.offset (* 4 ULTIMATE.start_bubbleSort_~j~0) oldRank0)))} is VALID [2020-07-29 03:25:28,734 INFO L280 TraceCheckUtils]: 2: Hoare triple {772#(and (<= (+ ULTIMATE.start_bubbleSort_~numbers.offset (* 4 ULTIMATE.start_bubbleSort_~j~0) 4) (select |#length| ULTIMATE.start_bubbleSort_~numbers.base)) (<= (select |#length| ULTIMATE.start_bubbleSort_~numbers.base) (+ ULTIMATE.start_bubbleSort_~numbers.offset (* 4 ULTIMATE.start_bubbleSort_~j~0) oldRank0)))} bubbleSort_#t~post3 := bubbleSort_~j~0;bubbleSort_~j~0 := 1 + bubbleSort_#t~post3;havoc bubbleSort_#t~post3; {737#(or (and (> oldRank0 (+ (select |#length| ULTIMATE.start_bubbleSort_~numbers.base) (* (- 1) ULTIMATE.start_bubbleSort_~numbers.offset) (* (- 4) ULTIMATE.start_bubbleSort_~j~0))) (>= oldRank0 0)) unseeded)} is VALID [2020-07-29 03:25:28,735 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-29 03:25:28,735 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2020-07-29 03:25:28,743 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 12 edges. 12 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-29 03:25:28,744 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 11 letters. Loop has 3 letters. [2020-07-29 03:25:28,744 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:25:28,744 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2020-07-29 03:25:28,744 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 19 states and 25 transitions. cyclomatic complexity: 9 Second operand 3 states. [2020-07-29 03:25:28,800 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 19 states and 25 transitions. cyclomatic complexity: 9. Second operand 3 states. Result 34 states and 47 transitions. Complement of second has 7 states. [2020-07-29 03:25:28,800 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2020-07-29 03:25:28,801 INFO L123 tractBuchiDifference]: Start testing correctness of buchiDifferenceNCSBLazy3 [2020-07-29 03:25:28,801 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 19 states and 25 transitions. cyclomatic complexity: 9 [2020-07-29 03:25:28,801 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 03:25:28,801 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 03:25:28,801 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 3 states. [2020-07-29 03:25:28,802 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2020-07-29 03:25:28,802 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 03:25:28,802 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 03:25:28,802 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 34 states and 47 transitions. [2020-07-29 03:25:28,803 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2020-07-29 03:25:28,803 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 03:25:28,803 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 03:25:28,804 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 19 states and 25 transitions. cyclomatic complexity: 9 [2020-07-29 03:25:28,805 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 3 examples of accepted words. [2020-07-29 03:25:28,805 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 3 states. [2020-07-29 03:25:28,806 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2020-07-29 03:25:28,806 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 1 examples of accepted words. [2020-07-29 03:25:28,806 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 34 states and 47 transitions. cyclomatic complexity: 18 [2020-07-29 03:25:28,807 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 3 examples of accepted words. [2020-07-29 03:25:28,807 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 19 states and 25 transitions. cyclomatic complexity: 9 Stem has 11 letters. Loop has 3 letters. [2020-07-29 03:25:28,807 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:25:28,808 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 11 letters. Loop has 3 letters. [2020-07-29 03:25:28,808 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:25:28,808 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 34 states and 47 transitions. cyclomatic complexity: 18 Stem has 11 letters. Loop has 3 letters. [2020-07-29 03:25:28,808 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:25:28,808 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 19 states and 25 transitions. cyclomatic complexity: 9 Stem has 1 letters. Loop has 2 letters. [2020-07-29 03:25:28,808 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:25:28,808 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 1 letters. Loop has 2 letters. [2020-07-29 03:25:28,809 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:25:28,809 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 34 states and 47 transitions. cyclomatic complexity: 18 Stem has 1 letters. Loop has 2 letters. [2020-07-29 03:25:28,809 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:25:28,809 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 19 states and 25 transitions. cyclomatic complexity: 9 Stem has 14 letters. Loop has 3 letters. [2020-07-29 03:25:28,809 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:25:28,809 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 14 letters. Loop has 3 letters. [2020-07-29 03:25:28,809 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:25:28,809 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 34 states and 47 transitions. cyclomatic complexity: 18 Stem has 14 letters. Loop has 3 letters. [2020-07-29 03:25:28,810 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:25:28,810 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 19 states and 25 transitions. cyclomatic complexity: 9 Stem has 34 letters. Loop has 34 letters. [2020-07-29 03:25:28,810 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:25:28,810 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 34 letters. Loop has 34 letters. [2020-07-29 03:25:28,810 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:25:28,810 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 34 states and 47 transitions. cyclomatic complexity: 18 Stem has 34 letters. Loop has 34 letters. [2020-07-29 03:25:28,810 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:25:28,810 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 19 states and 25 transitions. cyclomatic complexity: 9 Stem has 19 letters. Loop has 19 letters. [2020-07-29 03:25:28,811 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:25:28,811 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 19 letters. Loop has 19 letters. [2020-07-29 03:25:28,811 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:25:28,811 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 34 states and 47 transitions. cyclomatic complexity: 18 Stem has 19 letters. Loop has 19 letters. [2020-07-29 03:25:28,811 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:25:28,811 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 19 states and 25 transitions. cyclomatic complexity: 9 Stem has 4 letters. Loop has 4 letters. [2020-07-29 03:25:28,811 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:25:28,811 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 4 letters. Loop has 4 letters. [2020-07-29 03:25:28,812 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:25:28,812 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 34 states and 47 transitions. cyclomatic complexity: 18 Stem has 4 letters. Loop has 4 letters. [2020-07-29 03:25:28,812 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:25:28,812 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 19 states and 25 transitions. cyclomatic complexity: 9 Stem has 12 letters. Loop has 3 letters. [2020-07-29 03:25:28,812 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:25:28,812 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 12 letters. Loop has 3 letters. [2020-07-29 03:25:28,812 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:25:28,812 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 34 states and 47 transitions. cyclomatic complexity: 18 Stem has 12 letters. Loop has 3 letters. [2020-07-29 03:25:28,813 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:25:28,813 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 19 states and 25 transitions. cyclomatic complexity: 9 Stem has 13 letters. Loop has 3 letters. [2020-07-29 03:25:28,813 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:25:28,813 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 13 letters. Loop has 3 letters. [2020-07-29 03:25:28,813 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:25:28,813 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 34 states and 47 transitions. cyclomatic complexity: 18 Stem has 13 letters. Loop has 3 letters. [2020-07-29 03:25:28,814 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:25:28,814 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 19 states and 25 transitions. cyclomatic complexity: 9 Stem has 11 letters. Loop has 3 letters. [2020-07-29 03:25:28,814 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:25:28,814 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 11 letters. Loop has 3 letters. [2020-07-29 03:25:28,814 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:25:28,814 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 34 states and 47 transitions. cyclomatic complexity: 18 Stem has 11 letters. Loop has 3 letters. [2020-07-29 03:25:28,815 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:25:28,815 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 19 states and 25 transitions. cyclomatic complexity: 9 Stem has 1 letters. Loop has 2 letters. [2020-07-29 03:25:28,815 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:25:28,815 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 1 letters. Loop has 2 letters. [2020-07-29 03:25:28,815 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:25:28,815 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 34 states and 47 transitions. cyclomatic complexity: 18 Stem has 1 letters. Loop has 2 letters. [2020-07-29 03:25:28,815 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:25:28,816 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 19 states and 25 transitions. cyclomatic complexity: 9 Stem has 15 letters. Loop has 3 letters. [2020-07-29 03:25:28,816 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:25:28,816 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 15 letters. Loop has 3 letters. [2020-07-29 03:25:28,816 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:25:28,816 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 34 states and 47 transitions. cyclomatic complexity: 18 Stem has 15 letters. Loop has 3 letters. [2020-07-29 03:25:28,816 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:25:28,816 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 19 states and 25 transitions. cyclomatic complexity: 9 Stem has 16 letters. Loop has 3 letters. [2020-07-29 03:25:28,817 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:25:28,817 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 16 letters. Loop has 3 letters. [2020-07-29 03:25:28,817 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:25:28,817 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 34 states and 47 transitions. cyclomatic complexity: 18 Stem has 16 letters. Loop has 3 letters. [2020-07-29 03:25:28,817 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:25:28,817 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 19 states and 25 transitions. cyclomatic complexity: 9 Stem has 14 letters. Loop has 3 letters. [2020-07-29 03:25:28,817 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:25:28,817 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 14 letters. Loop has 3 letters. [2020-07-29 03:25:28,818 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:25:28,818 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 34 states and 47 transitions. cyclomatic complexity: 18 Stem has 14 letters. Loop has 3 letters. [2020-07-29 03:25:28,818 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:25:28,818 INFO L161 tractBuchiDifference]: Finished testing correctness of buchiDifferenceNCSBLazy3 [2020-07-29 03:25:28,818 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-07-29 03:25:28,819 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 15 transitions. [2020-07-29 03:25:28,819 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 15 transitions. Stem has 11 letters. Loop has 3 letters. [2020-07-29 03:25:28,819 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:25:28,819 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 15 transitions. Stem has 14 letters. Loop has 3 letters. [2020-07-29 03:25:28,819 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:25:28,820 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 15 transitions. Stem has 11 letters. Loop has 6 letters. [2020-07-29 03:25:28,820 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:25:28,820 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 34 states and 47 transitions. cyclomatic complexity: 18 [2020-07-29 03:25:28,822 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2020-07-29 03:25:28,823 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 34 states to 24 states and 32 transitions. [2020-07-29 03:25:28,823 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 10 [2020-07-29 03:25:28,823 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 10 [2020-07-29 03:25:28,823 INFO L73 IsDeterministic]: Start isDeterministic. Operand 24 states and 32 transitions. [2020-07-29 03:25:28,823 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2020-07-29 03:25:28,824 INFO L688 BuchiCegarLoop]: Abstraction has 24 states and 32 transitions. [2020-07-29 03:25:28,824 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states and 32 transitions. [2020-07-29 03:25:28,825 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 19. [2020-07-29 03:25:28,825 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-29 03:25:28,825 INFO L82 GeneralOperation]: Start isEquivalent. First operand 24 states and 32 transitions. Second operand 19 states. [2020-07-29 03:25:28,825 INFO L74 IsIncluded]: Start isIncluded. First operand 24 states and 32 transitions. Second operand 19 states. [2020-07-29 03:25:28,826 INFO L87 Difference]: Start difference. First operand 24 states and 32 transitions. Second operand 19 states. [2020-07-29 03:25:28,826 INFO L149 Difference]: Subtrahend was not deterministic. Recomputing result with determinization. [2020-07-29 03:25:28,828 INFO L93 Difference]: Finished difference Result 24 states and 32 transitions. [2020-07-29 03:25:28,828 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 32 transitions. [2020-07-29 03:25:28,829 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-29 03:25:28,829 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-29 03:25:28,829 INFO L74 IsIncluded]: Start isIncluded. First operand 19 states. Second operand 24 states and 32 transitions. [2020-07-29 03:25:28,829 INFO L87 Difference]: Start difference. First operand 19 states. Second operand 24 states and 32 transitions. [2020-07-29 03:25:28,830 INFO L149 Difference]: Subtrahend was not deterministic. Recomputing result with determinization. [2020-07-29 03:25:28,832 INFO L93 Difference]: Finished difference Result 24 states and 32 transitions. [2020-07-29 03:25:28,832 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 32 transitions. [2020-07-29 03:25:28,832 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-29 03:25:28,832 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-29 03:25:28,832 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-29 03:25:28,832 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-29 03:25:28,833 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2020-07-29 03:25:28,833 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 24 transitions. [2020-07-29 03:25:28,833 INFO L711 BuchiCegarLoop]: Abstraction has 19 states and 24 transitions. [2020-07-29 03:25:28,834 INFO L591 BuchiCegarLoop]: Abstraction has 19 states and 24 transitions. [2020-07-29 03:25:28,834 INFO L424 BuchiCegarLoop]: ======== Iteration 5============ [2020-07-29 03:25:28,834 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 19 states and 24 transitions. [2020-07-29 03:25:28,834 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2020-07-29 03:25:28,834 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 03:25:28,834 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 03:25:28,835 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-29 03:25:28,835 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2020-07-29 03:25:28,835 INFO L794 eck$LassoCheckResult]: Stem: 825#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; 823#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; 824#L527 assume !(main_~array_size~0 < 1 || main_~array_size~0 >= 536870911); 826#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; 827#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; 832#L532-2 main_#t~post10 := main_~k~0;main_~k~0 := 1 + main_#t~post10;havoc main_#t~post10; 833#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; 836#L532-2 main_#t~post10 := main_~k~0;main_~k~0 := 1 + main_#t~post10;havoc main_#t~post10; 841#L532-3 assume !(main_~k~0 < main_~array_size~0); 840#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; 839#L515-3 assume !!(bubbleSort_~i~0 >= 0);bubbleSort_~j~0 := 1; 831#L516-3 assume !(bubbleSort_~j~0 <= bubbleSort_~i~0); 834#L515-2 bubbleSort_#t~post2 := bubbleSort_~i~0;bubbleSort_~i~0 := bubbleSort_#t~post2 - 1;havoc bubbleSort_#t~post2; 835#L515-3 assume !!(bubbleSort_~i~0 >= 0);bubbleSort_~j~0 := 1; 829#L516-3 [2020-07-29 03:25:28,835 INFO L796 eck$LassoCheckResult]: Loop: 829#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); 837#L517 assume bubbleSort_#t~mem4 > bubbleSort_#t~mem5;havoc bubbleSort_#t~mem4;havoc bubbleSort_#t~mem5;call bubbleSort_#t~mem6 := read~int(bubbleSort_~numbers.base, bubbleSort_~numbers.offset + 4 * (bubbleSort_~j~0 - 1), 4);bubbleSort_~temp~0 := bubbleSort_#t~mem6;havoc bubbleSort_#t~mem6;call bubbleSort_#t~mem7 := read~int(bubbleSort_~numbers.base, bubbleSort_~numbers.offset + 4 * bubbleSort_~j~0, 4);call write~int(bubbleSort_#t~mem7, bubbleSort_~numbers.base, bubbleSort_~numbers.offset + 4 * (bubbleSort_~j~0 - 1), 4);havoc bubbleSort_#t~mem7;call write~int(bubbleSort_~temp~0, bubbleSort_~numbers.base, bubbleSort_~numbers.offset + 4 * bubbleSort_~j~0, 4); 828#L516-2 bubbleSort_#t~post3 := bubbleSort_~j~0;bubbleSort_~j~0 := 1 + bubbleSort_#t~post3;havoc bubbleSort_#t~post3; 829#L516-3 [2020-07-29 03:25:28,835 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 03:25:28,836 INFO L82 PathProgramCache]: Analyzing trace with hash -793649948, now seen corresponding path program 1 times [2020-07-29 03:25:28,836 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 03:25:28,836 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1012410582] [2020-07-29 03:25:28,836 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 03:25:28,847 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 03:25:28,891 INFO L280 TraceCheckUtils]: 0: Hoare triple {969#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; {969#true} is VALID [2020-07-29 03:25:28,891 INFO L280 TraceCheckUtils]: 1: Hoare triple {969#true} 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; {969#true} is VALID [2020-07-29 03:25:28,891 INFO L280 TraceCheckUtils]: 2: Hoare triple {969#true} assume !(main_~array_size~0 < 1 || main_~array_size~0 >= 536870911); {969#true} is VALID [2020-07-29 03:25:28,892 INFO L280 TraceCheckUtils]: 3: Hoare triple {969#true} 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; {969#true} is VALID [2020-07-29 03:25:28,892 INFO L280 TraceCheckUtils]: 4: Hoare triple {969#true} 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; {969#true} is VALID [2020-07-29 03:25:28,894 INFO L280 TraceCheckUtils]: 5: Hoare triple {969#true} main_#t~post10 := main_~k~0;main_~k~0 := 1 + main_#t~post10;havoc main_#t~post10; {969#true} is VALID [2020-07-29 03:25:28,894 INFO L280 TraceCheckUtils]: 6: Hoare triple {969#true} 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; {969#true} is VALID [2020-07-29 03:25:28,895 INFO L280 TraceCheckUtils]: 7: Hoare triple {969#true} main_#t~post10 := main_~k~0;main_~k~0 := 1 + main_#t~post10;havoc main_#t~post10; {969#true} is VALID [2020-07-29 03:25:28,895 INFO L280 TraceCheckUtils]: 8: Hoare triple {969#true} assume !(main_~k~0 < main_~array_size~0); {969#true} is VALID [2020-07-29 03:25:28,895 INFO L280 TraceCheckUtils]: 9: Hoare triple {969#true} 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; {969#true} is VALID [2020-07-29 03:25:28,896 INFO L280 TraceCheckUtils]: 10: Hoare triple {969#true} assume !!(bubbleSort_~i~0 >= 0);bubbleSort_~j~0 := 1; {971#(= ULTIMATE.start_bubbleSort_~j~0 1)} is VALID [2020-07-29 03:25:28,897 INFO L280 TraceCheckUtils]: 11: Hoare triple {971#(= ULTIMATE.start_bubbleSort_~j~0 1)} assume !(bubbleSort_~j~0 <= bubbleSort_~i~0); {972#(<= ULTIMATE.start_bubbleSort_~i~0 0)} is VALID [2020-07-29 03:25:28,898 INFO L280 TraceCheckUtils]: 12: Hoare triple {972#(<= ULTIMATE.start_bubbleSort_~i~0 0)} bubbleSort_#t~post2 := bubbleSort_~i~0;bubbleSort_~i~0 := bubbleSort_#t~post2 - 1;havoc bubbleSort_#t~post2; {973#(<= (+ ULTIMATE.start_bubbleSort_~i~0 1) 0)} is VALID [2020-07-29 03:25:28,898 INFO L280 TraceCheckUtils]: 13: Hoare triple {973#(<= (+ ULTIMATE.start_bubbleSort_~i~0 1) 0)} assume !!(bubbleSort_~i~0 >= 0);bubbleSort_~j~0 := 1; {970#false} is VALID [2020-07-29 03:25:28,899 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2020-07-29 03:25:28,899 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1012410582] [2020-07-29 03:25:28,899 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-29 03:25:28,899 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-07-29 03:25:28,900 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1467336668] [2020-07-29 03:25:28,900 INFO L799 eck$LassoCheckResult]: stem already infeasible [2020-07-29 03:25:28,900 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 03:25:28,900 INFO L82 PathProgramCache]: Analyzing trace with hash 68618, now seen corresponding path program 3 times [2020-07-29 03:25:28,900 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 03:25:28,901 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1456892815] [2020-07-29 03:25:28,901 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 03:25:28,910 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 03:25:28,910 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 03:25:28,914 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 03:25:28,914 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 03:25:28,916 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-07-29 03:25:29,015 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-29 03:25:29,015 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-07-29 03:25:29,015 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2020-07-29 03:25:29,016 INFO L87 Difference]: Start difference. First operand 19 states and 24 transitions. cyclomatic complexity: 8 Second operand 5 states. [2020-07-29 03:25:29,105 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-29 03:25:29,105 INFO L93 Difference]: Finished difference Result 27 states and 34 transitions. [2020-07-29 03:25:29,106 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-07-29 03:25:29,106 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states. [2020-07-29 03:25:29,125 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 12 edges. 12 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-29 03:25:29,126 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 27 states and 34 transitions. [2020-07-29 03:25:29,128 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2020-07-29 03:25:29,129 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 27 states to 25 states and 32 transitions. [2020-07-29 03:25:29,129 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 13 [2020-07-29 03:25:29,129 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 13 [2020-07-29 03:25:29,129 INFO L73 IsDeterministic]: Start isDeterministic. Operand 25 states and 32 transitions. [2020-07-29 03:25:29,129 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2020-07-29 03:25:29,129 INFO L688 BuchiCegarLoop]: Abstraction has 25 states and 32 transitions. [2020-07-29 03:25:29,130 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states and 32 transitions. [2020-07-29 03:25:29,131 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 20. [2020-07-29 03:25:29,131 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-29 03:25:29,131 INFO L82 GeneralOperation]: Start isEquivalent. First operand 25 states and 32 transitions. Second operand 20 states. [2020-07-29 03:25:29,131 INFO L74 IsIncluded]: Start isIncluded. First operand 25 states and 32 transitions. Second operand 20 states. [2020-07-29 03:25:29,131 INFO L87 Difference]: Start difference. First operand 25 states and 32 transitions. Second operand 20 states. [2020-07-29 03:25:29,132 INFO L149 Difference]: Subtrahend was not deterministic. Recomputing result with determinization. [2020-07-29 03:25:29,134 INFO L93 Difference]: Finished difference Result 31 states and 41 transitions. [2020-07-29 03:25:29,134 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 41 transitions. [2020-07-29 03:25:29,134 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-29 03:25:29,135 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-29 03:25:29,135 INFO L74 IsIncluded]: Start isIncluded. First operand 20 states. Second operand 25 states and 32 transitions. [2020-07-29 03:25:29,135 INFO L87 Difference]: Start difference. First operand 20 states. Second operand 25 states and 32 transitions. [2020-07-29 03:25:29,136 INFO L149 Difference]: Subtrahend was not deterministic. Recomputing result with determinization. [2020-07-29 03:25:29,137 INFO L93 Difference]: Finished difference Result 31 states and 41 transitions. [2020-07-29 03:25:29,138 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 41 transitions. [2020-07-29 03:25:29,138 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-29 03:25:29,138 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-29 03:25:29,138 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-29 03:25:29,138 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-29 03:25:29,138 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2020-07-29 03:25:29,139 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 25 transitions. [2020-07-29 03:25:29,139 INFO L711 BuchiCegarLoop]: Abstraction has 20 states and 25 transitions. [2020-07-29 03:25:29,139 INFO L591 BuchiCegarLoop]: Abstraction has 20 states and 25 transitions. [2020-07-29 03:25:29,139 INFO L424 BuchiCegarLoop]: ======== Iteration 6============ [2020-07-29 03:25:29,140 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 20 states and 25 transitions. [2020-07-29 03:25:29,140 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2020-07-29 03:25:29,140 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 03:25:29,140 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 03:25:29,141 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-29 03:25:29,141 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2020-07-29 03:25:29,141 INFO L794 eck$LassoCheckResult]: Stem: 1009#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; 1007#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; 1008#L527 assume !(main_~array_size~0 < 1 || main_~array_size~0 >= 536870911); 1010#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; 1011#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; 1012#L532-2 main_#t~post10 := main_~k~0;main_~k~0 := 1 + main_#t~post10;havoc main_#t~post10; 1013#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; 1018#L532-2 main_#t~post10 := main_~k~0;main_~k~0 := 1 + main_#t~post10;havoc main_#t~post10; 1026#L532-3 assume !(main_~k~0 < main_~array_size~0); 1024#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; 1025#L515-3 assume !!(bubbleSort_~i~0 >= 0);bubbleSort_~j~0 := 1; 1020#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); 1021#L517 assume !(bubbleSort_#t~mem4 > bubbleSort_#t~mem5);havoc bubbleSort_#t~mem4;havoc bubbleSort_#t~mem5; 1016#L516-2 bubbleSort_#t~post3 := bubbleSort_~j~0;bubbleSort_~j~0 := 1 + bubbleSort_#t~post3;havoc bubbleSort_#t~post3; 1017#L516-3 assume !(bubbleSort_~j~0 <= bubbleSort_~i~0); 1022#L515-2 bubbleSort_#t~post2 := bubbleSort_~i~0;bubbleSort_~i~0 := bubbleSort_#t~post2 - 1;havoc bubbleSort_#t~post2; 1023#L515-3 assume !!(bubbleSort_~i~0 >= 0);bubbleSort_~j~0 := 1; 1015#L516-3 [2020-07-29 03:25:29,141 INFO L796 eck$LassoCheckResult]: Loop: 1015#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); 1019#L517 assume bubbleSort_#t~mem4 > bubbleSort_#t~mem5;havoc bubbleSort_#t~mem4;havoc bubbleSort_#t~mem5;call bubbleSort_#t~mem6 := read~int(bubbleSort_~numbers.base, bubbleSort_~numbers.offset + 4 * (bubbleSort_~j~0 - 1), 4);bubbleSort_~temp~0 := bubbleSort_#t~mem6;havoc bubbleSort_#t~mem6;call bubbleSort_#t~mem7 := read~int(bubbleSort_~numbers.base, bubbleSort_~numbers.offset + 4 * bubbleSort_~j~0, 4);call write~int(bubbleSort_#t~mem7, bubbleSort_~numbers.base, bubbleSort_~numbers.offset + 4 * (bubbleSort_~j~0 - 1), 4);havoc bubbleSort_#t~mem7;call write~int(bubbleSort_~temp~0, bubbleSort_~numbers.base, bubbleSort_~numbers.offset + 4 * bubbleSort_~j~0, 4); 1014#L516-2 bubbleSort_#t~post3 := bubbleSort_~j~0;bubbleSort_~j~0 := 1 + bubbleSort_#t~post3;havoc bubbleSort_#t~post3; 1015#L516-3 [2020-07-29 03:25:29,141 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 03:25:29,142 INFO L82 PathProgramCache]: Analyzing trace with hash 221564791, now seen corresponding path program 1 times [2020-07-29 03:25:29,142 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 03:25:29,142 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1472528688] [2020-07-29 03:25:29,142 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 03:25:29,157 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 03:25:29,157 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 03:25:29,171 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 03:25:29,171 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 03:25:29,175 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-07-29 03:25:29,176 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 03:25:29,176 INFO L82 PathProgramCache]: Analyzing trace with hash 68618, now seen corresponding path program 4 times [2020-07-29 03:25:29,176 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 03:25:29,176 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1451331411] [2020-07-29 03:25:29,176 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 03:25:29,181 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 03:25:29,181 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 03:25:29,185 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 03:25:29,185 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 03:25:29,186 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-07-29 03:25:29,187 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 03:25:29,187 INFO L82 PathProgramCache]: Analyzing trace with hash -728006444, now seen corresponding path program 1 times [2020-07-29 03:25:29,187 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 03:25:29,187 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [331870687] [2020-07-29 03:25:29,188 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 03:25:29,203 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 03:25:29,293 INFO L280 TraceCheckUtils]: 0: Hoare triple {1184#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; {1184#true} is VALID [2020-07-29 03:25:29,293 INFO L280 TraceCheckUtils]: 1: Hoare triple {1184#true} 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; {1184#true} is VALID [2020-07-29 03:25:29,294 INFO L280 TraceCheckUtils]: 2: Hoare triple {1184#true} assume !(main_~array_size~0 < 1 || main_~array_size~0 >= 536870911); {1184#true} is VALID [2020-07-29 03:25:29,294 INFO L280 TraceCheckUtils]: 3: Hoare triple {1184#true} 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; {1186#(= 0 ULTIMATE.start_main_~k~0)} is VALID [2020-07-29 03:25:29,295 INFO L280 TraceCheckUtils]: 4: Hoare triple {1186#(= 0 ULTIMATE.start_main_~k~0)} 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; {1186#(= 0 ULTIMATE.start_main_~k~0)} is VALID [2020-07-29 03:25:29,295 INFO L280 TraceCheckUtils]: 5: Hoare triple {1186#(= 0 ULTIMATE.start_main_~k~0)} main_#t~post10 := main_~k~0;main_~k~0 := 1 + main_#t~post10;havoc main_#t~post10; {1187#(<= ULTIMATE.start_main_~k~0 1)} is VALID [2020-07-29 03:25:29,296 INFO L280 TraceCheckUtils]: 6: Hoare triple {1187#(<= ULTIMATE.start_main_~k~0 1)} 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; {1187#(<= ULTIMATE.start_main_~k~0 1)} is VALID [2020-07-29 03:25:29,297 INFO L280 TraceCheckUtils]: 7: Hoare triple {1187#(<= ULTIMATE.start_main_~k~0 1)} main_#t~post10 := main_~k~0;main_~k~0 := 1 + main_#t~post10;havoc main_#t~post10; {1188#(<= ULTIMATE.start_main_~k~0 2)} is VALID [2020-07-29 03:25:29,297 INFO L280 TraceCheckUtils]: 8: Hoare triple {1188#(<= ULTIMATE.start_main_~k~0 2)} assume !(main_~k~0 < main_~array_size~0); {1189#(<= ULTIMATE.start_main_~array_size~0 2)} is VALID [2020-07-29 03:25:29,298 INFO L280 TraceCheckUtils]: 9: Hoare triple {1189#(<= ULTIMATE.start_main_~array_size~0 2)} 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; {1190#(<= ULTIMATE.start_bubbleSort_~i~0 1)} is VALID [2020-07-29 03:25:29,299 INFO L280 TraceCheckUtils]: 10: Hoare triple {1190#(<= ULTIMATE.start_bubbleSort_~i~0 1)} assume !!(bubbleSort_~i~0 >= 0);bubbleSort_~j~0 := 1; {1190#(<= ULTIMATE.start_bubbleSort_~i~0 1)} is VALID [2020-07-29 03:25:29,300 INFO L280 TraceCheckUtils]: 11: Hoare triple {1190#(<= ULTIMATE.start_bubbleSort_~i~0 1)} 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); {1190#(<= ULTIMATE.start_bubbleSort_~i~0 1)} is VALID [2020-07-29 03:25:29,300 INFO L280 TraceCheckUtils]: 12: Hoare triple {1190#(<= ULTIMATE.start_bubbleSort_~i~0 1)} assume !(bubbleSort_#t~mem4 > bubbleSort_#t~mem5);havoc bubbleSort_#t~mem4;havoc bubbleSort_#t~mem5; {1190#(<= ULTIMATE.start_bubbleSort_~i~0 1)} is VALID [2020-07-29 03:25:29,301 INFO L280 TraceCheckUtils]: 13: Hoare triple {1190#(<= ULTIMATE.start_bubbleSort_~i~0 1)} bubbleSort_#t~post3 := bubbleSort_~j~0;bubbleSort_~j~0 := 1 + bubbleSort_#t~post3;havoc bubbleSort_#t~post3; {1190#(<= ULTIMATE.start_bubbleSort_~i~0 1)} is VALID [2020-07-29 03:25:29,301 INFO L280 TraceCheckUtils]: 14: Hoare triple {1190#(<= ULTIMATE.start_bubbleSort_~i~0 1)} assume !(bubbleSort_~j~0 <= bubbleSort_~i~0); {1190#(<= ULTIMATE.start_bubbleSort_~i~0 1)} is VALID [2020-07-29 03:25:29,302 INFO L280 TraceCheckUtils]: 15: Hoare triple {1190#(<= ULTIMATE.start_bubbleSort_~i~0 1)} bubbleSort_#t~post2 := bubbleSort_~i~0;bubbleSort_~i~0 := bubbleSort_#t~post2 - 1;havoc bubbleSort_#t~post2; {1191#(<= ULTIMATE.start_bubbleSort_~i~0 0)} is VALID [2020-07-29 03:25:29,302 INFO L280 TraceCheckUtils]: 16: Hoare triple {1191#(<= ULTIMATE.start_bubbleSort_~i~0 0)} assume !!(bubbleSort_~i~0 >= 0);bubbleSort_~j~0 := 1; {1192#(and (<= ULTIMATE.start_bubbleSort_~i~0 0) (= ULTIMATE.start_bubbleSort_~j~0 1))} is VALID [2020-07-29 03:25:29,304 INFO L280 TraceCheckUtils]: 17: Hoare triple {1192#(and (<= ULTIMATE.start_bubbleSort_~i~0 0) (= ULTIMATE.start_bubbleSort_~j~0 1))} 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); {1185#false} is VALID [2020-07-29 03:25:29,304 INFO L280 TraceCheckUtils]: 18: Hoare triple {1185#false} assume bubbleSort_#t~mem4 > bubbleSort_#t~mem5;havoc bubbleSort_#t~mem4;havoc bubbleSort_#t~mem5;call bubbleSort_#t~mem6 := read~int(bubbleSort_~numbers.base, bubbleSort_~numbers.offset + 4 * (bubbleSort_~j~0 - 1), 4);bubbleSort_~temp~0 := bubbleSort_#t~mem6;havoc bubbleSort_#t~mem6;call bubbleSort_#t~mem7 := read~int(bubbleSort_~numbers.base, bubbleSort_~numbers.offset + 4 * bubbleSort_~j~0, 4);call write~int(bubbleSort_#t~mem7, bubbleSort_~numbers.base, bubbleSort_~numbers.offset + 4 * (bubbleSort_~j~0 - 1), 4);havoc bubbleSort_#t~mem7;call write~int(bubbleSort_~temp~0, bubbleSort_~numbers.base, bubbleSort_~numbers.offset + 4 * bubbleSort_~j~0, 4); {1185#false} is VALID [2020-07-29 03:25:29,305 INFO L280 TraceCheckUtils]: 19: Hoare triple {1185#false} bubbleSort_#t~post3 := bubbleSort_~j~0;bubbleSort_~j~0 := 1 + bubbleSort_#t~post3;havoc bubbleSort_#t~post3; {1185#false} is VALID [2020-07-29 03:25:29,306 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 5 proven. 4 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2020-07-29 03:25:29,306 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [331870687] [2020-07-29 03:25:29,307 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1742248773] [2020-07-29 03:25:29,307 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/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 [2020-07-29 03:25:29,347 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 03:25:29,348 INFO L263 TraceCheckSpWp]: Trace formula consists of 103 conjuncts, 10 conjunts are in the unsatisfiable core [2020-07-29 03:25:29,355 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 03:25:29,356 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-29 03:25:29,589 INFO L280 TraceCheckUtils]: 0: Hoare triple {1184#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; {1184#true} is VALID [2020-07-29 03:25:29,590 INFO L280 TraceCheckUtils]: 1: Hoare triple {1184#true} 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; {1184#true} is VALID [2020-07-29 03:25:29,590 INFO L280 TraceCheckUtils]: 2: Hoare triple {1184#true} assume !(main_~array_size~0 < 1 || main_~array_size~0 >= 536870911); {1184#true} is VALID [2020-07-29 03:25:29,591 INFO L280 TraceCheckUtils]: 3: Hoare triple {1184#true} 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; {1205#(<= ULTIMATE.start_main_~k~0 0)} is VALID [2020-07-29 03:25:29,593 INFO L280 TraceCheckUtils]: 4: Hoare triple {1205#(<= ULTIMATE.start_main_~k~0 0)} 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; {1205#(<= ULTIMATE.start_main_~k~0 0)} is VALID [2020-07-29 03:25:29,593 INFO L280 TraceCheckUtils]: 5: Hoare triple {1205#(<= ULTIMATE.start_main_~k~0 0)} main_#t~post10 := main_~k~0;main_~k~0 := 1 + main_#t~post10;havoc main_#t~post10; {1187#(<= ULTIMATE.start_main_~k~0 1)} is VALID [2020-07-29 03:25:29,594 INFO L280 TraceCheckUtils]: 6: Hoare triple {1187#(<= ULTIMATE.start_main_~k~0 1)} 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; {1187#(<= ULTIMATE.start_main_~k~0 1)} is VALID [2020-07-29 03:25:29,595 INFO L280 TraceCheckUtils]: 7: Hoare triple {1187#(<= ULTIMATE.start_main_~k~0 1)} main_#t~post10 := main_~k~0;main_~k~0 := 1 + main_#t~post10;havoc main_#t~post10; {1188#(<= ULTIMATE.start_main_~k~0 2)} is VALID [2020-07-29 03:25:29,596 INFO L280 TraceCheckUtils]: 8: Hoare triple {1188#(<= ULTIMATE.start_main_~k~0 2)} assume !(main_~k~0 < main_~array_size~0); {1189#(<= ULTIMATE.start_main_~array_size~0 2)} is VALID [2020-07-29 03:25:29,597 INFO L280 TraceCheckUtils]: 9: Hoare triple {1189#(<= ULTIMATE.start_main_~array_size~0 2)} 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; {1190#(<= ULTIMATE.start_bubbleSort_~i~0 1)} is VALID [2020-07-29 03:25:29,598 INFO L280 TraceCheckUtils]: 10: Hoare triple {1190#(<= ULTIMATE.start_bubbleSort_~i~0 1)} assume !!(bubbleSort_~i~0 >= 0);bubbleSort_~j~0 := 1; {1190#(<= ULTIMATE.start_bubbleSort_~i~0 1)} is VALID [2020-07-29 03:25:29,599 INFO L280 TraceCheckUtils]: 11: Hoare triple {1190#(<= ULTIMATE.start_bubbleSort_~i~0 1)} 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); {1190#(<= ULTIMATE.start_bubbleSort_~i~0 1)} is VALID [2020-07-29 03:25:29,600 INFO L280 TraceCheckUtils]: 12: Hoare triple {1190#(<= ULTIMATE.start_bubbleSort_~i~0 1)} assume !(bubbleSort_#t~mem4 > bubbleSort_#t~mem5);havoc bubbleSort_#t~mem4;havoc bubbleSort_#t~mem5; {1190#(<= ULTIMATE.start_bubbleSort_~i~0 1)} is VALID [2020-07-29 03:25:29,600 INFO L280 TraceCheckUtils]: 13: Hoare triple {1190#(<= ULTIMATE.start_bubbleSort_~i~0 1)} bubbleSort_#t~post3 := bubbleSort_~j~0;bubbleSort_~j~0 := 1 + bubbleSort_#t~post3;havoc bubbleSort_#t~post3; {1190#(<= ULTIMATE.start_bubbleSort_~i~0 1)} is VALID [2020-07-29 03:25:29,604 INFO L280 TraceCheckUtils]: 14: Hoare triple {1190#(<= ULTIMATE.start_bubbleSort_~i~0 1)} assume !(bubbleSort_~j~0 <= bubbleSort_~i~0); {1190#(<= ULTIMATE.start_bubbleSort_~i~0 1)} is VALID [2020-07-29 03:25:29,605 INFO L280 TraceCheckUtils]: 15: Hoare triple {1190#(<= ULTIMATE.start_bubbleSort_~i~0 1)} bubbleSort_#t~post2 := bubbleSort_~i~0;bubbleSort_~i~0 := bubbleSort_#t~post2 - 1;havoc bubbleSort_#t~post2; {1191#(<= ULTIMATE.start_bubbleSort_~i~0 0)} is VALID [2020-07-29 03:25:29,606 INFO L280 TraceCheckUtils]: 16: Hoare triple {1191#(<= ULTIMATE.start_bubbleSort_~i~0 0)} assume !!(bubbleSort_~i~0 >= 0);bubbleSort_~j~0 := 1; {1245#(and (<= 1 ULTIMATE.start_bubbleSort_~j~0) (<= ULTIMATE.start_bubbleSort_~i~0 0))} is VALID [2020-07-29 03:25:29,607 INFO L280 TraceCheckUtils]: 17: Hoare triple {1245#(and (<= 1 ULTIMATE.start_bubbleSort_~j~0) (<= ULTIMATE.start_bubbleSort_~i~0 0))} 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); {1185#false} is VALID [2020-07-29 03:25:29,607 INFO L280 TraceCheckUtils]: 18: Hoare triple {1185#false} assume bubbleSort_#t~mem4 > bubbleSort_#t~mem5;havoc bubbleSort_#t~mem4;havoc bubbleSort_#t~mem5;call bubbleSort_#t~mem6 := read~int(bubbleSort_~numbers.base, bubbleSort_~numbers.offset + 4 * (bubbleSort_~j~0 - 1), 4);bubbleSort_~temp~0 := bubbleSort_#t~mem6;havoc bubbleSort_#t~mem6;call bubbleSort_#t~mem7 := read~int(bubbleSort_~numbers.base, bubbleSort_~numbers.offset + 4 * bubbleSort_~j~0, 4);call write~int(bubbleSort_#t~mem7, bubbleSort_~numbers.base, bubbleSort_~numbers.offset + 4 * (bubbleSort_~j~0 - 1), 4);havoc bubbleSort_#t~mem7;call write~int(bubbleSort_~temp~0, bubbleSort_~numbers.base, bubbleSort_~numbers.offset + 4 * bubbleSort_~j~0, 4); {1185#false} is VALID [2020-07-29 03:25:29,607 INFO L280 TraceCheckUtils]: 19: Hoare triple {1185#false} bubbleSort_#t~post3 := bubbleSort_~j~0;bubbleSort_~j~0 := 1 + bubbleSort_#t~post3;havoc bubbleSort_#t~post3; {1185#false} is VALID [2020-07-29 03:25:29,608 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 5 proven. 4 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2020-07-29 03:25:29,609 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-07-29 03:25:29,609 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 11 [2020-07-29 03:25:29,609 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1175745007] [2020-07-29 03:25:29,716 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-29 03:25:29,717 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-07-29 03:25:29,717 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=79, Unknown=0, NotChecked=0, Total=110 [2020-07-29 03:25:29,717 INFO L87 Difference]: Start difference. First operand 20 states and 25 transitions. cyclomatic complexity: 8 Second operand 11 states. [2020-07-29 03:25:29,985 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-29 03:25:29,986 INFO L93 Difference]: Finished difference Result 33 states and 40 transitions. [2020-07-29 03:25:29,986 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-07-29 03:25:29,986 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 11 states. [2020-07-29 03:25:30,027 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 25 edges. 25 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-29 03:25:30,028 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 33 states and 40 transitions. [2020-07-29 03:25:30,030 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2020-07-29 03:25:30,032 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 33 states to 23 states and 28 transitions. [2020-07-29 03:25:30,032 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 10 [2020-07-29 03:25:30,032 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 10 [2020-07-29 03:25:30,032 INFO L73 IsDeterministic]: Start isDeterministic. Operand 23 states and 28 transitions. [2020-07-29 03:25:30,033 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2020-07-29 03:25:30,033 INFO L688 BuchiCegarLoop]: Abstraction has 23 states and 28 transitions. [2020-07-29 03:25:30,033 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states and 28 transitions. [2020-07-29 03:25:30,034 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 22. [2020-07-29 03:25:30,035 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-29 03:25:30,035 INFO L82 GeneralOperation]: Start isEquivalent. First operand 23 states and 28 transitions. Second operand 22 states. [2020-07-29 03:25:30,035 INFO L74 IsIncluded]: Start isIncluded. First operand 23 states and 28 transitions. Second operand 22 states. [2020-07-29 03:25:30,035 INFO L87 Difference]: Start difference. First operand 23 states and 28 transitions. Second operand 22 states. [2020-07-29 03:25:30,036 INFO L149 Difference]: Subtrahend was not deterministic. Recomputing result with determinization. [2020-07-29 03:25:30,038 INFO L93 Difference]: Finished difference Result 28 states and 35 transitions. [2020-07-29 03:25:30,038 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 35 transitions. [2020-07-29 03:25:30,038 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-29 03:25:30,038 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-29 03:25:30,038 INFO L74 IsIncluded]: Start isIncluded. First operand 22 states. Second operand 23 states and 28 transitions. [2020-07-29 03:25:30,039 INFO L87 Difference]: Start difference. First operand 22 states. Second operand 23 states and 28 transitions. [2020-07-29 03:25:30,039 INFO L149 Difference]: Subtrahend was not deterministic. Recomputing result with determinization. [2020-07-29 03:25:30,041 INFO L93 Difference]: Finished difference Result 28 states and 35 transitions. [2020-07-29 03:25:30,041 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 35 transitions. [2020-07-29 03:25:30,042 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-29 03:25:30,042 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-29 03:25:30,042 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-29 03:25:30,042 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-29 03:25:30,042 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22 states. [2020-07-29 03:25:30,043 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 27 transitions. [2020-07-29 03:25:30,043 INFO L711 BuchiCegarLoop]: Abstraction has 22 states and 27 transitions. [2020-07-29 03:25:30,043 INFO L591 BuchiCegarLoop]: Abstraction has 22 states and 27 transitions. [2020-07-29 03:25:30,043 INFO L424 BuchiCegarLoop]: ======== Iteration 7============ [2020-07-29 03:25:30,044 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 22 states and 27 transitions. [2020-07-29 03:25:30,044 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2020-07-29 03:25:30,044 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 03:25:30,044 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 03:25:30,045 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-29 03:25:30,045 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2020-07-29 03:25:30,045 INFO L794 eck$LassoCheckResult]: Stem: 1295#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; 1293#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; 1294#L527 assume !(main_~array_size~0 < 1 || main_~array_size~0 >= 536870911); 1296#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; 1297#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; 1309#L532-2 main_#t~post10 := main_~k~0;main_~k~0 := 1 + main_#t~post10;havoc main_#t~post10; 1310#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; 1298#L532-2 main_#t~post10 := main_~k~0;main_~k~0 := 1 + main_#t~post10;havoc main_#t~post10; 1299#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; 1314#L532-2 main_#t~post10 := main_~k~0;main_~k~0 := 1 + main_#t~post10;havoc main_#t~post10; 1313#L532-3 assume !(main_~k~0 < main_~array_size~0); 1312#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; 1311#L515-3 assume !!(bubbleSort_~i~0 >= 0);bubbleSort_~j~0 := 1; 1305#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); 1306#L517 assume !(bubbleSort_#t~mem4 > bubbleSort_#t~mem5);havoc bubbleSort_#t~mem4;havoc bubbleSort_#t~mem5; 1302#L516-2 bubbleSort_#t~post3 := bubbleSort_~j~0;bubbleSort_~j~0 := 1 + bubbleSort_#t~post3;havoc bubbleSort_#t~post3; 1303#L516-3 assume !(bubbleSort_~j~0 <= bubbleSort_~i~0); 1307#L515-2 bubbleSort_#t~post2 := bubbleSort_~i~0;bubbleSort_~i~0 := bubbleSort_#t~post2 - 1;havoc bubbleSort_#t~post2; 1308#L515-3 assume !!(bubbleSort_~i~0 >= 0);bubbleSort_~j~0 := 1; 1301#L516-3 [2020-07-29 03:25:30,045 INFO L796 eck$LassoCheckResult]: Loop: 1301#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); 1304#L517 assume bubbleSort_#t~mem4 > bubbleSort_#t~mem5;havoc bubbleSort_#t~mem4;havoc bubbleSort_#t~mem5;call bubbleSort_#t~mem6 := read~int(bubbleSort_~numbers.base, bubbleSort_~numbers.offset + 4 * (bubbleSort_~j~0 - 1), 4);bubbleSort_~temp~0 := bubbleSort_#t~mem6;havoc bubbleSort_#t~mem6;call bubbleSort_#t~mem7 := read~int(bubbleSort_~numbers.base, bubbleSort_~numbers.offset + 4 * bubbleSort_~j~0, 4);call write~int(bubbleSort_#t~mem7, bubbleSort_~numbers.base, bubbleSort_~numbers.offset + 4 * (bubbleSort_~j~0 - 1), 4);havoc bubbleSort_#t~mem7;call write~int(bubbleSort_~temp~0, bubbleSort_~numbers.base, bubbleSort_~numbers.offset + 4 * bubbleSort_~j~0, 4); 1300#L516-2 bubbleSort_#t~post3 := bubbleSort_~j~0;bubbleSort_~j~0 := 1 + bubbleSort_#t~post3;havoc bubbleSort_#t~post3; 1301#L516-3 [2020-07-29 03:25:30,046 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 03:25:30,046 INFO L82 PathProgramCache]: Analyzing trace with hash 1850126805, now seen corresponding path program 2 times [2020-07-29 03:25:30,046 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 03:25:30,046 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1673444474] [2020-07-29 03:25:30,046 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 03:25:30,061 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 03:25:30,221 INFO L280 TraceCheckUtils]: 0: Hoare triple {1465#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; {1465#true} is VALID [2020-07-29 03:25:30,221 INFO L280 TraceCheckUtils]: 1: Hoare triple {1465#true} 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; {1465#true} is VALID [2020-07-29 03:25:30,222 INFO L280 TraceCheckUtils]: 2: Hoare triple {1465#true} assume !(main_~array_size~0 < 1 || main_~array_size~0 >= 536870911); {1465#true} is VALID [2020-07-29 03:25:30,224 INFO L280 TraceCheckUtils]: 3: Hoare triple {1465#true} 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; {1467#(and (= 0 ULTIMATE.start_main_~numbers~0.offset) (= 0 ULTIMATE.start_main_~k~0) (= (select |#length| ULTIMATE.start_main_~numbers~0.base) (* 4 ULTIMATE.start_main_~array_size~0)))} is VALID [2020-07-29 03:25:30,225 INFO L280 TraceCheckUtils]: 4: Hoare triple {1467#(and (= 0 ULTIMATE.start_main_~numbers~0.offset) (= 0 ULTIMATE.start_main_~k~0) (= (select |#length| ULTIMATE.start_main_~numbers~0.base) (* 4 ULTIMATE.start_main_~array_size~0)))} 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; {1467#(and (= 0 ULTIMATE.start_main_~numbers~0.offset) (= 0 ULTIMATE.start_main_~k~0) (= (select |#length| ULTIMATE.start_main_~numbers~0.base) (* 4 ULTIMATE.start_main_~array_size~0)))} is VALID [2020-07-29 03:25:30,226 INFO L280 TraceCheckUtils]: 5: Hoare triple {1467#(and (= 0 ULTIMATE.start_main_~numbers~0.offset) (= 0 ULTIMATE.start_main_~k~0) (= (select |#length| ULTIMATE.start_main_~numbers~0.base) (* 4 ULTIMATE.start_main_~array_size~0)))} main_#t~post10 := main_~k~0;main_~k~0 := 1 + main_#t~post10;havoc main_#t~post10; {1468#(and (= 0 ULTIMATE.start_main_~numbers~0.offset) (<= 1 ULTIMATE.start_main_~k~0) (= (select |#length| ULTIMATE.start_main_~numbers~0.base) (* 4 ULTIMATE.start_main_~array_size~0)))} is VALID [2020-07-29 03:25:30,228 INFO L280 TraceCheckUtils]: 6: Hoare triple {1468#(and (= 0 ULTIMATE.start_main_~numbers~0.offset) (<= 1 ULTIMATE.start_main_~k~0) (= (select |#length| ULTIMATE.start_main_~numbers~0.base) (* 4 ULTIMATE.start_main_~array_size~0)))} 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; {1468#(and (= 0 ULTIMATE.start_main_~numbers~0.offset) (<= 1 ULTIMATE.start_main_~k~0) (= (select |#length| ULTIMATE.start_main_~numbers~0.base) (* 4 ULTIMATE.start_main_~array_size~0)))} is VALID [2020-07-29 03:25:30,229 INFO L280 TraceCheckUtils]: 7: Hoare triple {1468#(and (= 0 ULTIMATE.start_main_~numbers~0.offset) (<= 1 ULTIMATE.start_main_~k~0) (= (select |#length| ULTIMATE.start_main_~numbers~0.base) (* 4 ULTIMATE.start_main_~array_size~0)))} main_#t~post10 := main_~k~0;main_~k~0 := 1 + main_#t~post10;havoc main_#t~post10; {1469#(and (= 0 ULTIMATE.start_main_~numbers~0.offset) (<= 2 ULTIMATE.start_main_~k~0) (= (select |#length| ULTIMATE.start_main_~numbers~0.base) (* 4 ULTIMATE.start_main_~array_size~0)))} is VALID [2020-07-29 03:25:30,230 INFO L280 TraceCheckUtils]: 8: Hoare triple {1469#(and (= 0 ULTIMATE.start_main_~numbers~0.offset) (<= 2 ULTIMATE.start_main_~k~0) (= (select |#length| ULTIMATE.start_main_~numbers~0.base) (* 4 ULTIMATE.start_main_~array_size~0)))} 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; {1470#(<= 3 ULTIMATE.start_main_~array_size~0)} is VALID [2020-07-29 03:25:30,231 INFO L280 TraceCheckUtils]: 9: Hoare triple {1470#(<= 3 ULTIMATE.start_main_~array_size~0)} main_#t~post10 := main_~k~0;main_~k~0 := 1 + main_#t~post10;havoc main_#t~post10; {1470#(<= 3 ULTIMATE.start_main_~array_size~0)} is VALID [2020-07-29 03:25:30,242 INFO L280 TraceCheckUtils]: 10: Hoare triple {1470#(<= 3 ULTIMATE.start_main_~array_size~0)} assume !(main_~k~0 < main_~array_size~0); {1470#(<= 3 ULTIMATE.start_main_~array_size~0)} is VALID [2020-07-29 03:25:30,247 INFO L280 TraceCheckUtils]: 11: Hoare triple {1470#(<= 3 ULTIMATE.start_main_~array_size~0)} 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; {1471#(<= 2 ULTIMATE.start_bubbleSort_~i~0)} is VALID [2020-07-29 03:25:30,248 INFO L280 TraceCheckUtils]: 12: Hoare triple {1471#(<= 2 ULTIMATE.start_bubbleSort_~i~0)} assume !!(bubbleSort_~i~0 >= 0);bubbleSort_~j~0 := 1; {1472#(and (<= 2 ULTIMATE.start_bubbleSort_~i~0) (= ULTIMATE.start_bubbleSort_~j~0 1))} is VALID [2020-07-29 03:25:30,249 INFO L280 TraceCheckUtils]: 13: Hoare triple {1472#(and (<= 2 ULTIMATE.start_bubbleSort_~i~0) (= ULTIMATE.start_bubbleSort_~j~0 1))} 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); {1472#(and (<= 2 ULTIMATE.start_bubbleSort_~i~0) (= ULTIMATE.start_bubbleSort_~j~0 1))} is VALID [2020-07-29 03:25:30,250 INFO L280 TraceCheckUtils]: 14: Hoare triple {1472#(and (<= 2 ULTIMATE.start_bubbleSort_~i~0) (= ULTIMATE.start_bubbleSort_~j~0 1))} assume !(bubbleSort_#t~mem4 > bubbleSort_#t~mem5);havoc bubbleSort_#t~mem4;havoc bubbleSort_#t~mem5; {1472#(and (<= 2 ULTIMATE.start_bubbleSort_~i~0) (= ULTIMATE.start_bubbleSort_~j~0 1))} is VALID [2020-07-29 03:25:30,258 INFO L280 TraceCheckUtils]: 15: Hoare triple {1472#(and (<= 2 ULTIMATE.start_bubbleSort_~i~0) (= ULTIMATE.start_bubbleSort_~j~0 1))} bubbleSort_#t~post3 := bubbleSort_~j~0;bubbleSort_~j~0 := 1 + bubbleSort_#t~post3;havoc bubbleSort_#t~post3; {1473#(<= ULTIMATE.start_bubbleSort_~j~0 ULTIMATE.start_bubbleSort_~i~0)} is VALID [2020-07-29 03:25:30,283 INFO L280 TraceCheckUtils]: 16: Hoare triple {1473#(<= ULTIMATE.start_bubbleSort_~j~0 ULTIMATE.start_bubbleSort_~i~0)} assume !(bubbleSort_~j~0 <= bubbleSort_~i~0); {1466#false} is VALID [2020-07-29 03:25:30,283 INFO L280 TraceCheckUtils]: 17: Hoare triple {1466#false} bubbleSort_#t~post2 := bubbleSort_~i~0;bubbleSort_~i~0 := bubbleSort_#t~post2 - 1;havoc bubbleSort_#t~post2; {1466#false} is VALID [2020-07-29 03:25:30,283 INFO L280 TraceCheckUtils]: 18: Hoare triple {1466#false} assume !!(bubbleSort_~i~0 >= 0);bubbleSort_~j~0 := 1; {1466#false} is VALID [2020-07-29 03:25:30,284 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 2 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-29 03:25:30,285 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1673444474] [2020-07-29 03:25:30,285 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1556490209] [2020-07-29 03:25:30,285 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 25 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 25 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-07-29 03:25:30,349 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2020-07-29 03:25:30,350 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-07-29 03:25:30,350 INFO L263 TraceCheckSpWp]: Trace formula consists of 88 conjuncts, 10 conjunts are in the unsatisfiable core [2020-07-29 03:25:30,362 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 03:25:30,363 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-29 03:25:30,638 INFO L280 TraceCheckUtils]: 0: Hoare triple {1465#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; {1465#true} is VALID [2020-07-29 03:25:30,638 INFO L280 TraceCheckUtils]: 1: Hoare triple {1465#true} 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; {1465#true} is VALID [2020-07-29 03:25:30,638 INFO L280 TraceCheckUtils]: 2: Hoare triple {1465#true} assume !(main_~array_size~0 < 1 || main_~array_size~0 >= 536870911); {1465#true} is VALID [2020-07-29 03:25:30,639 INFO L280 TraceCheckUtils]: 3: Hoare triple {1465#true} 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; {1486#(<= 0 ULTIMATE.start_main_~k~0)} is VALID [2020-07-29 03:25:30,640 INFO L280 TraceCheckUtils]: 4: Hoare triple {1486#(<= 0 ULTIMATE.start_main_~k~0)} 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; {1486#(<= 0 ULTIMATE.start_main_~k~0)} is VALID [2020-07-29 03:25:30,640 INFO L280 TraceCheckUtils]: 5: Hoare triple {1486#(<= 0 ULTIMATE.start_main_~k~0)} main_#t~post10 := main_~k~0;main_~k~0 := 1 + main_#t~post10;havoc main_#t~post10; {1493#(<= 1 ULTIMATE.start_main_~k~0)} is VALID [2020-07-29 03:25:30,641 INFO L280 TraceCheckUtils]: 6: Hoare triple {1493#(<= 1 ULTIMATE.start_main_~k~0)} 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; {1493#(<= 1 ULTIMATE.start_main_~k~0)} is VALID [2020-07-29 03:25:30,641 INFO L280 TraceCheckUtils]: 7: Hoare triple {1493#(<= 1 ULTIMATE.start_main_~k~0)} main_#t~post10 := main_~k~0;main_~k~0 := 1 + main_#t~post10;havoc main_#t~post10; {1500#(<= 2 ULTIMATE.start_main_~k~0)} is VALID [2020-07-29 03:25:30,642 INFO L280 TraceCheckUtils]: 8: Hoare triple {1500#(<= 2 ULTIMATE.start_main_~k~0)} 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; {1470#(<= 3 ULTIMATE.start_main_~array_size~0)} is VALID [2020-07-29 03:25:30,643 INFO L280 TraceCheckUtils]: 9: Hoare triple {1470#(<= 3 ULTIMATE.start_main_~array_size~0)} main_#t~post10 := main_~k~0;main_~k~0 := 1 + main_#t~post10;havoc main_#t~post10; {1470#(<= 3 ULTIMATE.start_main_~array_size~0)} is VALID [2020-07-29 03:25:30,643 INFO L280 TraceCheckUtils]: 10: Hoare triple {1470#(<= 3 ULTIMATE.start_main_~array_size~0)} assume !(main_~k~0 < main_~array_size~0); {1470#(<= 3 ULTIMATE.start_main_~array_size~0)} is VALID [2020-07-29 03:25:30,644 INFO L280 TraceCheckUtils]: 11: Hoare triple {1470#(<= 3 ULTIMATE.start_main_~array_size~0)} 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; {1471#(<= 2 ULTIMATE.start_bubbleSort_~i~0)} is VALID [2020-07-29 03:25:30,644 INFO L280 TraceCheckUtils]: 12: Hoare triple {1471#(<= 2 ULTIMATE.start_bubbleSort_~i~0)} assume !!(bubbleSort_~i~0 >= 0);bubbleSort_~j~0 := 1; {1516#(and (<= 2 ULTIMATE.start_bubbleSort_~i~0) (<= ULTIMATE.start_bubbleSort_~j~0 1))} is VALID [2020-07-29 03:25:30,645 INFO L280 TraceCheckUtils]: 13: Hoare triple {1516#(and (<= 2 ULTIMATE.start_bubbleSort_~i~0) (<= ULTIMATE.start_bubbleSort_~j~0 1))} 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); {1516#(and (<= 2 ULTIMATE.start_bubbleSort_~i~0) (<= ULTIMATE.start_bubbleSort_~j~0 1))} is VALID [2020-07-29 03:25:30,646 INFO L280 TraceCheckUtils]: 14: Hoare triple {1516#(and (<= 2 ULTIMATE.start_bubbleSort_~i~0) (<= ULTIMATE.start_bubbleSort_~j~0 1))} assume !(bubbleSort_#t~mem4 > bubbleSort_#t~mem5);havoc bubbleSort_#t~mem4;havoc bubbleSort_#t~mem5; {1516#(and (<= 2 ULTIMATE.start_bubbleSort_~i~0) (<= ULTIMATE.start_bubbleSort_~j~0 1))} is VALID [2020-07-29 03:25:30,646 INFO L280 TraceCheckUtils]: 15: Hoare triple {1516#(and (<= 2 ULTIMATE.start_bubbleSort_~i~0) (<= ULTIMATE.start_bubbleSort_~j~0 1))} bubbleSort_#t~post3 := bubbleSort_~j~0;bubbleSort_~j~0 := 1 + bubbleSort_#t~post3;havoc bubbleSort_#t~post3; {1526#(and (<= 2 ULTIMATE.start_bubbleSort_~i~0) (<= ULTIMATE.start_bubbleSort_~j~0 2))} is VALID [2020-07-29 03:25:30,648 INFO L280 TraceCheckUtils]: 16: Hoare triple {1526#(and (<= 2 ULTIMATE.start_bubbleSort_~i~0) (<= ULTIMATE.start_bubbleSort_~j~0 2))} assume !(bubbleSort_~j~0 <= bubbleSort_~i~0); {1466#false} is VALID [2020-07-29 03:25:30,648 INFO L280 TraceCheckUtils]: 17: Hoare triple {1466#false} bubbleSort_#t~post2 := bubbleSort_~i~0;bubbleSort_~i~0 := bubbleSort_#t~post2 - 1;havoc bubbleSort_#t~post2; {1466#false} is VALID [2020-07-29 03:25:30,649 INFO L280 TraceCheckUtils]: 18: Hoare triple {1466#false} assume !!(bubbleSort_~i~0 >= 0);bubbleSort_~j~0 := 1; {1466#false} is VALID [2020-07-29 03:25:30,649 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 5 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-29 03:25:30,649 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-07-29 03:25:30,650 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 14 [2020-07-29 03:25:30,650 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1557544630] [2020-07-29 03:25:30,650 INFO L799 eck$LassoCheckResult]: stem already infeasible [2020-07-29 03:25:30,650 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 03:25:30,651 INFO L82 PathProgramCache]: Analyzing trace with hash 68618, now seen corresponding path program 5 times [2020-07-29 03:25:30,651 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 03:25:30,651 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [574350569] [2020-07-29 03:25:30,651 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 03:25:30,656 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 03:25:30,656 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 03:25:30,660 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 03:25:30,660 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 03:25:30,661 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-07-29 03:25:30,783 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-29 03:25:30,784 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2020-07-29 03:25:30,784 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=138, Unknown=0, NotChecked=0, Total=182 [2020-07-29 03:25:30,784 INFO L87 Difference]: Start difference. First operand 22 states and 27 transitions. cyclomatic complexity: 8 Second operand 14 states. [2020-07-29 03:25:31,350 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-29 03:25:31,350 INFO L93 Difference]: Finished difference Result 32 states and 41 transitions. [2020-07-29 03:25:31,350 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-07-29 03:25:31,350 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 14 states. [2020-07-29 03:25:31,406 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 30 edges. 30 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-29 03:25:31,407 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 32 states and 41 transitions. [2020-07-29 03:25:31,408 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2020-07-29 03:25:31,409 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 32 states to 32 states and 41 transitions. [2020-07-29 03:25:31,409 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 10 [2020-07-29 03:25:31,409 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 10 [2020-07-29 03:25:31,409 INFO L73 IsDeterministic]: Start isDeterministic. Operand 32 states and 41 transitions. [2020-07-29 03:25:31,409 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2020-07-29 03:25:31,410 INFO L688 BuchiCegarLoop]: Abstraction has 32 states and 41 transitions. [2020-07-29 03:25:31,410 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states and 41 transitions. [2020-07-29 03:25:31,412 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 25. [2020-07-29 03:25:31,412 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-29 03:25:31,412 INFO L82 GeneralOperation]: Start isEquivalent. First operand 32 states and 41 transitions. Second operand 25 states. [2020-07-29 03:25:31,413 INFO L74 IsIncluded]: Start isIncluded. First operand 32 states and 41 transitions. Second operand 25 states. [2020-07-29 03:25:31,413 INFO L87 Difference]: Start difference. First operand 32 states and 41 transitions. Second operand 25 states. [2020-07-29 03:25:31,414 INFO L149 Difference]: Subtrahend was not deterministic. Recomputing result with determinization. [2020-07-29 03:25:31,415 INFO L93 Difference]: Finished difference Result 33 states and 42 transitions. [2020-07-29 03:25:31,415 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 42 transitions. [2020-07-29 03:25:31,416 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-29 03:25:31,416 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-29 03:25:31,416 INFO L74 IsIncluded]: Start isIncluded. First operand 25 states. Second operand 32 states and 41 transitions. [2020-07-29 03:25:31,416 INFO L87 Difference]: Start difference. First operand 25 states. Second operand 32 states and 41 transitions. [2020-07-29 03:25:31,417 INFO L149 Difference]: Subtrahend was not deterministic. Recomputing result with determinization. [2020-07-29 03:25:31,418 INFO L93 Difference]: Finished difference Result 33 states and 42 transitions. [2020-07-29 03:25:31,418 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 42 transitions. [2020-07-29 03:25:31,419 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-29 03:25:31,419 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-29 03:25:31,419 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-29 03:25:31,419 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-29 03:25:31,419 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25 states. [2020-07-29 03:25:31,420 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 31 transitions. [2020-07-29 03:25:31,420 INFO L711 BuchiCegarLoop]: Abstraction has 25 states and 31 transitions. [2020-07-29 03:25:31,420 INFO L591 BuchiCegarLoop]: Abstraction has 25 states and 31 transitions. [2020-07-29 03:25:31,420 INFO L424 BuchiCegarLoop]: ======== Iteration 8============ [2020-07-29 03:25:31,420 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 25 states and 31 transitions. [2020-07-29 03:25:31,421 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2020-07-29 03:25:31,421 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 03:25:31,421 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 03:25:31,421 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-29 03:25:31,421 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2020-07-29 03:25:31,421 INFO L794 eck$LassoCheckResult]: Stem: 1581#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; 1579#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; 1580#L527 assume !(main_~array_size~0 < 1 || main_~array_size~0 >= 536870911); 1582#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; 1583#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; 1584#L532-2 main_#t~post10 := main_~k~0;main_~k~0 := 1 + main_#t~post10;havoc main_#t~post10; 1585#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; 1590#L532-2 main_#t~post10 := main_~k~0;main_~k~0 := 1 + main_#t~post10;havoc main_#t~post10; 1601#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; 1600#L532-2 main_#t~post10 := main_~k~0;main_~k~0 := 1 + main_#t~post10;havoc main_#t~post10; 1599#L532-3 assume !(main_~k~0 < main_~array_size~0); 1595#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; 1596#L515-3 assume !!(bubbleSort_~i~0 >= 0);bubbleSort_~j~0 := 1; 1597#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); 1603#L517 assume !(bubbleSort_#t~mem4 > bubbleSort_#t~mem5);havoc bubbleSort_#t~mem4;havoc bubbleSort_#t~mem5; 1588#L516-2 bubbleSort_#t~post3 := bubbleSort_~j~0;bubbleSort_~j~0 := 1 + bubbleSort_#t~post3;havoc bubbleSort_#t~post3; 1589#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); 1592#L517 assume !(bubbleSort_#t~mem4 > bubbleSort_#t~mem5);havoc bubbleSort_#t~mem4;havoc bubbleSort_#t~mem5; 1598#L516-2 bubbleSort_#t~post3 := bubbleSort_~j~0;bubbleSort_~j~0 := 1 + bubbleSort_#t~post3;havoc bubbleSort_#t~post3; 1602#L516-3 assume !(bubbleSort_~j~0 <= bubbleSort_~i~0); 1593#L515-2 bubbleSort_#t~post2 := bubbleSort_~i~0;bubbleSort_~i~0 := bubbleSort_#t~post2 - 1;havoc bubbleSort_#t~post2; 1594#L515-3 assume !!(bubbleSort_~i~0 >= 0);bubbleSort_~j~0 := 1; 1587#L516-3 [2020-07-29 03:25:31,422 INFO L796 eck$LassoCheckResult]: Loop: 1587#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); 1591#L517 assume bubbleSort_#t~mem4 > bubbleSort_#t~mem5;havoc bubbleSort_#t~mem4;havoc bubbleSort_#t~mem5;call bubbleSort_#t~mem6 := read~int(bubbleSort_~numbers.base, bubbleSort_~numbers.offset + 4 * (bubbleSort_~j~0 - 1), 4);bubbleSort_~temp~0 := bubbleSort_#t~mem6;havoc bubbleSort_#t~mem6;call bubbleSort_#t~mem7 := read~int(bubbleSort_~numbers.base, bubbleSort_~numbers.offset + 4 * bubbleSort_~j~0, 4);call write~int(bubbleSort_#t~mem7, bubbleSort_~numbers.base, bubbleSort_~numbers.offset + 4 * (bubbleSort_~j~0 - 1), 4);havoc bubbleSort_#t~mem7;call write~int(bubbleSort_~temp~0, bubbleSort_~numbers.base, bubbleSort_~numbers.offset + 4 * bubbleSort_~j~0, 4); 1586#L516-2 bubbleSort_#t~post3 := bubbleSort_~j~0;bubbleSort_~j~0 := 1 + bubbleSort_#t~post3;havoc bubbleSort_#t~post3; 1587#L516-3 [2020-07-29 03:25:31,422 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 03:25:31,422 INFO L82 PathProgramCache]: Analyzing trace with hash -135460634, now seen corresponding path program 3 times [2020-07-29 03:25:31,422 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 03:25:31,422 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [528288073] [2020-07-29 03:25:31,422 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 03:25:31,440 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 03:25:31,440 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 03:25:31,462 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 03:25:31,462 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 03:25:31,467 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-07-29 03:25:31,467 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 03:25:31,467 INFO L82 PathProgramCache]: Analyzing trace with hash 68618, now seen corresponding path program 6 times [2020-07-29 03:25:31,468 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 03:25:31,468 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [105280508] [2020-07-29 03:25:31,468 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 03:25:31,472 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 03:25:31,472 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 03:25:31,475 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 03:25:31,475 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 03:25:31,477 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-07-29 03:25:31,477 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 03:25:31,477 INFO L82 PathProgramCache]: Analyzing trace with hash 1761549573, now seen corresponding path program 2 times [2020-07-29 03:25:31,477 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 03:25:31,478 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [289041830] [2020-07-29 03:25:31,478 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 03:25:31,499 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 03:25:31,830 INFO L280 TraceCheckUtils]: 0: Hoare triple {1784#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; {1784#true} is VALID [2020-07-29 03:25:31,830 INFO L280 TraceCheckUtils]: 1: Hoare triple {1784#true} 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; {1784#true} is VALID [2020-07-29 03:25:31,831 INFO L280 TraceCheckUtils]: 2: Hoare triple {1784#true} assume !(main_~array_size~0 < 1 || main_~array_size~0 >= 536870911); {1784#true} is VALID [2020-07-29 03:25:31,832 INFO L280 TraceCheckUtils]: 3: Hoare triple {1784#true} 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; {1786#(and (= 0 ULTIMATE.start_main_~numbers~0.offset) (= 0 ULTIMATE.start_main_~k~0))} is VALID [2020-07-29 03:25:31,832 INFO L280 TraceCheckUtils]: 4: Hoare triple {1786#(and (= 0 ULTIMATE.start_main_~numbers~0.offset) (= 0 ULTIMATE.start_main_~k~0))} 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; {1786#(and (= 0 ULTIMATE.start_main_~numbers~0.offset) (= 0 ULTIMATE.start_main_~k~0))} is VALID [2020-07-29 03:25:31,833 INFO L280 TraceCheckUtils]: 5: Hoare triple {1786#(and (= 0 ULTIMATE.start_main_~numbers~0.offset) (= 0 ULTIMATE.start_main_~k~0))} main_#t~post10 := main_~k~0;main_~k~0 := 1 + main_#t~post10;havoc main_#t~post10; {1787#(= 0 ULTIMATE.start_main_~numbers~0.offset)} is VALID [2020-07-29 03:25:31,833 INFO L280 TraceCheckUtils]: 6: Hoare triple {1787#(= 0 ULTIMATE.start_main_~numbers~0.offset)} 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; {1787#(= 0 ULTIMATE.start_main_~numbers~0.offset)} is VALID [2020-07-29 03:25:31,834 INFO L280 TraceCheckUtils]: 7: Hoare triple {1787#(= 0 ULTIMATE.start_main_~numbers~0.offset)} main_#t~post10 := main_~k~0;main_~k~0 := 1 + main_#t~post10;havoc main_#t~post10; {1787#(= 0 ULTIMATE.start_main_~numbers~0.offset)} is VALID [2020-07-29 03:25:31,834 INFO L280 TraceCheckUtils]: 8: Hoare triple {1787#(= 0 ULTIMATE.start_main_~numbers~0.offset)} 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; {1787#(= 0 ULTIMATE.start_main_~numbers~0.offset)} is VALID [2020-07-29 03:25:31,834 INFO L280 TraceCheckUtils]: 9: Hoare triple {1787#(= 0 ULTIMATE.start_main_~numbers~0.offset)} main_#t~post10 := main_~k~0;main_~k~0 := 1 + main_#t~post10;havoc main_#t~post10; {1787#(= 0 ULTIMATE.start_main_~numbers~0.offset)} is VALID [2020-07-29 03:25:31,835 INFO L280 TraceCheckUtils]: 10: Hoare triple {1787#(= 0 ULTIMATE.start_main_~numbers~0.offset)} assume !(main_~k~0 < main_~array_size~0); {1787#(= 0 ULTIMATE.start_main_~numbers~0.offset)} is VALID [2020-07-29 03:25:31,836 INFO L280 TraceCheckUtils]: 11: Hoare triple {1787#(= 0 ULTIMATE.start_main_~numbers~0.offset)} 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; {1788#(= 0 ULTIMATE.start_bubbleSort_~numbers.offset)} is VALID [2020-07-29 03:25:31,836 INFO L280 TraceCheckUtils]: 12: Hoare triple {1788#(= 0 ULTIMATE.start_bubbleSort_~numbers.offset)} assume !!(bubbleSort_~i~0 >= 0);bubbleSort_~j~0 := 1; {1789#(and (= 0 ULTIMATE.start_bubbleSort_~numbers.offset) (= 1 ULTIMATE.start_bubbleSort_~j~0))} is VALID [2020-07-29 03:25:31,837 INFO L280 TraceCheckUtils]: 13: Hoare triple {1789#(and (= 0 ULTIMATE.start_bubbleSort_~numbers.offset) (= 1 ULTIMATE.start_bubbleSort_~j~0))} 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); {1790#(and (= 0 ULTIMATE.start_bubbleSort_~numbers.offset) (= (select (select |#memory_int| ULTIMATE.start_bubbleSort_~numbers.base) (+ ULTIMATE.start_bubbleSort_~numbers.offset (* ULTIMATE.start_bubbleSort_~j~0 4))) |ULTIMATE.start_bubbleSort_#t~mem5|) (= (select (select |#memory_int| ULTIMATE.start_bubbleSort_~numbers.base) (+ ULTIMATE.start_bubbleSort_~numbers.offset (* ULTIMATE.start_bubbleSort_~j~0 4) (- 4))) |ULTIMATE.start_bubbleSort_#t~mem4|) (= 1 ULTIMATE.start_bubbleSort_~j~0))} is VALID [2020-07-29 03:25:31,838 INFO L280 TraceCheckUtils]: 14: Hoare triple {1790#(and (= 0 ULTIMATE.start_bubbleSort_~numbers.offset) (= (select (select |#memory_int| ULTIMATE.start_bubbleSort_~numbers.base) (+ ULTIMATE.start_bubbleSort_~numbers.offset (* ULTIMATE.start_bubbleSort_~j~0 4))) |ULTIMATE.start_bubbleSort_#t~mem5|) (= (select (select |#memory_int| ULTIMATE.start_bubbleSort_~numbers.base) (+ ULTIMATE.start_bubbleSort_~numbers.offset (* ULTIMATE.start_bubbleSort_~j~0 4) (- 4))) |ULTIMATE.start_bubbleSort_#t~mem4|) (= 1 ULTIMATE.start_bubbleSort_~j~0))} assume !(bubbleSort_#t~mem4 > bubbleSort_#t~mem5);havoc bubbleSort_#t~mem4;havoc bubbleSort_#t~mem5; {1791#(and (= 0 ULTIMATE.start_bubbleSort_~numbers.offset) (= 1 ULTIMATE.start_bubbleSort_~j~0) (<= (select (select |#memory_int| ULTIMATE.start_bubbleSort_~numbers.base) (+ ULTIMATE.start_bubbleSort_~numbers.offset (* ULTIMATE.start_bubbleSort_~j~0 4) (- 4))) (select (select |#memory_int| ULTIMATE.start_bubbleSort_~numbers.base) (+ ULTIMATE.start_bubbleSort_~numbers.offset (* ULTIMATE.start_bubbleSort_~j~0 4)))))} is VALID [2020-07-29 03:25:31,838 INFO L280 TraceCheckUtils]: 15: Hoare triple {1791#(and (= 0 ULTIMATE.start_bubbleSort_~numbers.offset) (= 1 ULTIMATE.start_bubbleSort_~j~0) (<= (select (select |#memory_int| ULTIMATE.start_bubbleSort_~numbers.base) (+ ULTIMATE.start_bubbleSort_~numbers.offset (* ULTIMATE.start_bubbleSort_~j~0 4) (- 4))) (select (select |#memory_int| ULTIMATE.start_bubbleSort_~numbers.base) (+ ULTIMATE.start_bubbleSort_~numbers.offset (* ULTIMATE.start_bubbleSort_~j~0 4)))))} bubbleSort_#t~post3 := bubbleSort_~j~0;bubbleSort_~j~0 := 1 + bubbleSort_#t~post3;havoc bubbleSort_#t~post3; {1792#(and (= 0 ULTIMATE.start_bubbleSort_~numbers.offset) (<= (select (select |#memory_int| ULTIMATE.start_bubbleSort_~numbers.base) 0) (select (select |#memory_int| ULTIMATE.start_bubbleSort_~numbers.base) (+ ULTIMATE.start_bubbleSort_~numbers.offset (* ULTIMATE.start_bubbleSort_~j~0 4) (- 4)))) (= (+ ULTIMATE.start_bubbleSort_~numbers.offset (* 4 ULTIMATE.start_bubbleSort_~j~0)) 8))} is VALID [2020-07-29 03:25:31,840 INFO L280 TraceCheckUtils]: 16: Hoare triple {1792#(and (= 0 ULTIMATE.start_bubbleSort_~numbers.offset) (<= (select (select |#memory_int| ULTIMATE.start_bubbleSort_~numbers.base) 0) (select (select |#memory_int| ULTIMATE.start_bubbleSort_~numbers.base) (+ ULTIMATE.start_bubbleSort_~numbers.offset (* ULTIMATE.start_bubbleSort_~j~0 4) (- 4)))) (= (+ ULTIMATE.start_bubbleSort_~numbers.offset (* 4 ULTIMATE.start_bubbleSort_~j~0)) 8))} 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); {1793#(and (= 0 ULTIMATE.start_bubbleSort_~numbers.offset) (<= (select (select |#memory_int| ULTIMATE.start_bubbleSort_~numbers.base) 0) (select (select |#memory_int| ULTIMATE.start_bubbleSort_~numbers.base) 4)))} is VALID [2020-07-29 03:25:31,841 INFO L280 TraceCheckUtils]: 17: Hoare triple {1793#(and (= 0 ULTIMATE.start_bubbleSort_~numbers.offset) (<= (select (select |#memory_int| ULTIMATE.start_bubbleSort_~numbers.base) 0) (select (select |#memory_int| ULTIMATE.start_bubbleSort_~numbers.base) 4)))} assume !(bubbleSort_#t~mem4 > bubbleSort_#t~mem5);havoc bubbleSort_#t~mem4;havoc bubbleSort_#t~mem5; {1793#(and (= 0 ULTIMATE.start_bubbleSort_~numbers.offset) (<= (select (select |#memory_int| ULTIMATE.start_bubbleSort_~numbers.base) 0) (select (select |#memory_int| ULTIMATE.start_bubbleSort_~numbers.base) 4)))} is VALID [2020-07-29 03:25:31,842 INFO L280 TraceCheckUtils]: 18: Hoare triple {1793#(and (= 0 ULTIMATE.start_bubbleSort_~numbers.offset) (<= (select (select |#memory_int| ULTIMATE.start_bubbleSort_~numbers.base) 0) (select (select |#memory_int| ULTIMATE.start_bubbleSort_~numbers.base) 4)))} bubbleSort_#t~post3 := bubbleSort_~j~0;bubbleSort_~j~0 := 1 + bubbleSort_#t~post3;havoc bubbleSort_#t~post3; {1793#(and (= 0 ULTIMATE.start_bubbleSort_~numbers.offset) (<= (select (select |#memory_int| ULTIMATE.start_bubbleSort_~numbers.base) 0) (select (select |#memory_int| ULTIMATE.start_bubbleSort_~numbers.base) 4)))} is VALID [2020-07-29 03:25:31,842 INFO L280 TraceCheckUtils]: 19: Hoare triple {1793#(and (= 0 ULTIMATE.start_bubbleSort_~numbers.offset) (<= (select (select |#memory_int| ULTIMATE.start_bubbleSort_~numbers.base) 0) (select (select |#memory_int| ULTIMATE.start_bubbleSort_~numbers.base) 4)))} assume !(bubbleSort_~j~0 <= bubbleSort_~i~0); {1793#(and (= 0 ULTIMATE.start_bubbleSort_~numbers.offset) (<= (select (select |#memory_int| ULTIMATE.start_bubbleSort_~numbers.base) 0) (select (select |#memory_int| ULTIMATE.start_bubbleSort_~numbers.base) 4)))} is VALID [2020-07-29 03:25:31,843 INFO L280 TraceCheckUtils]: 20: Hoare triple {1793#(and (= 0 ULTIMATE.start_bubbleSort_~numbers.offset) (<= (select (select |#memory_int| ULTIMATE.start_bubbleSort_~numbers.base) 0) (select (select |#memory_int| ULTIMATE.start_bubbleSort_~numbers.base) 4)))} bubbleSort_#t~post2 := bubbleSort_~i~0;bubbleSort_~i~0 := bubbleSort_#t~post2 - 1;havoc bubbleSort_#t~post2; {1793#(and (= 0 ULTIMATE.start_bubbleSort_~numbers.offset) (<= (select (select |#memory_int| ULTIMATE.start_bubbleSort_~numbers.base) 0) (select (select |#memory_int| ULTIMATE.start_bubbleSort_~numbers.base) 4)))} is VALID [2020-07-29 03:25:31,844 INFO L280 TraceCheckUtils]: 21: Hoare triple {1793#(and (= 0 ULTIMATE.start_bubbleSort_~numbers.offset) (<= (select (select |#memory_int| ULTIMATE.start_bubbleSort_~numbers.base) 0) (select (select |#memory_int| ULTIMATE.start_bubbleSort_~numbers.base) 4)))} assume !!(bubbleSort_~i~0 >= 0);bubbleSort_~j~0 := 1; {1791#(and (= 0 ULTIMATE.start_bubbleSort_~numbers.offset) (= 1 ULTIMATE.start_bubbleSort_~j~0) (<= (select (select |#memory_int| ULTIMATE.start_bubbleSort_~numbers.base) (+ ULTIMATE.start_bubbleSort_~numbers.offset (* ULTIMATE.start_bubbleSort_~j~0 4) (- 4))) (select (select |#memory_int| ULTIMATE.start_bubbleSort_~numbers.base) (+ ULTIMATE.start_bubbleSort_~numbers.offset (* ULTIMATE.start_bubbleSort_~j~0 4)))))} is VALID [2020-07-29 03:25:31,844 INFO L280 TraceCheckUtils]: 22: Hoare triple {1791#(and (= 0 ULTIMATE.start_bubbleSort_~numbers.offset) (= 1 ULTIMATE.start_bubbleSort_~j~0) (<= (select (select |#memory_int| ULTIMATE.start_bubbleSort_~numbers.base) (+ ULTIMATE.start_bubbleSort_~numbers.offset (* ULTIMATE.start_bubbleSort_~j~0 4) (- 4))) (select (select |#memory_int| ULTIMATE.start_bubbleSort_~numbers.base) (+ ULTIMATE.start_bubbleSort_~numbers.offset (* ULTIMATE.start_bubbleSort_~j~0 4)))))} 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); {1794#(<= |ULTIMATE.start_bubbleSort_#t~mem4| |ULTIMATE.start_bubbleSort_#t~mem5|)} is VALID [2020-07-29 03:25:31,845 INFO L280 TraceCheckUtils]: 23: Hoare triple {1794#(<= |ULTIMATE.start_bubbleSort_#t~mem4| |ULTIMATE.start_bubbleSort_#t~mem5|)} assume bubbleSort_#t~mem4 > bubbleSort_#t~mem5;havoc bubbleSort_#t~mem4;havoc bubbleSort_#t~mem5;call bubbleSort_#t~mem6 := read~int(bubbleSort_~numbers.base, bubbleSort_~numbers.offset + 4 * (bubbleSort_~j~0 - 1), 4);bubbleSort_~temp~0 := bubbleSort_#t~mem6;havoc bubbleSort_#t~mem6;call bubbleSort_#t~mem7 := read~int(bubbleSort_~numbers.base, bubbleSort_~numbers.offset + 4 * bubbleSort_~j~0, 4);call write~int(bubbleSort_#t~mem7, bubbleSort_~numbers.base, bubbleSort_~numbers.offset + 4 * (bubbleSort_~j~0 - 1), 4);havoc bubbleSort_#t~mem7;call write~int(bubbleSort_~temp~0, bubbleSort_~numbers.base, bubbleSort_~numbers.offset + 4 * bubbleSort_~j~0, 4); {1785#false} is VALID [2020-07-29 03:25:31,845 INFO L280 TraceCheckUtils]: 24: Hoare triple {1785#false} bubbleSort_#t~post3 := bubbleSort_~j~0;bubbleSort_~j~0 := 1 + bubbleSort_#t~post3;havoc bubbleSort_#t~post3; {1785#false} is VALID [2020-07-29 03:25:31,847 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 5 proven. 13 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2020-07-29 03:25:31,847 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [289041830] [2020-07-29 03:25:31,848 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1530017691] [2020-07-29 03:25:31,848 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/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 [2020-07-29 03:25:31,896 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2020-07-29 03:25:31,897 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-07-29 03:25:31,898 INFO L263 TraceCheckSpWp]: Trace formula consists of 125 conjuncts, 18 conjunts are in the unsatisfiable core [2020-07-29 03:25:31,907 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 03:25:31,908 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-29 03:25:32,143 INFO L350 Elim1Store]: treesize reduction 9, result has 10.0 percent of original size [2020-07-29 03:25:32,143 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 30 treesize of output 10 [2020-07-29 03:25:32,178 INFO L544 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-07-29 03:25:32,181 INFO L624 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-07-29 03:25:32,181 INFO L544 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-07-29 03:25:32,181 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:30, output treesize:3 [2020-07-29 03:25:32,185 WARN L406 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2020-07-29 03:25:32,185 WARN L407 uantifierElimination]: Input elimination task: ∃ [|#memory_int|, ULTIMATE.start_bubbleSort_~numbers.base, ULTIMATE.start_bubbleSort_~numbers.offset]. (let ((.cse2 (select |#memory_int| ULTIMATE.start_bubbleSort_~numbers.base))) (let ((.cse0 (select .cse2 (+ ULTIMATE.start_bubbleSort_~numbers.offset 4))) (.cse1 (select .cse2 ULTIMATE.start_bubbleSort_~numbers.offset))) (and (<= .cse0 |ULTIMATE.start_bubbleSort_#t~mem5|) (<= .cse1 .cse0) (<= |ULTIMATE.start_bubbleSort_#t~mem4| .cse1)))) [2020-07-29 03:25:32,186 WARN L408 uantifierElimination]: ElimStorePlain result: ∃ []. (<= |ULTIMATE.start_bubbleSort_#t~mem4| |ULTIMATE.start_bubbleSort_#t~mem5|) [2020-07-29 03:25:32,224 INFO L280 TraceCheckUtils]: 0: Hoare triple {1784#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; {1784#true} is VALID [2020-07-29 03:25:32,224 INFO L280 TraceCheckUtils]: 1: Hoare triple {1784#true} 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; {1784#true} is VALID [2020-07-29 03:25:32,225 INFO L280 TraceCheckUtils]: 2: Hoare triple {1784#true} assume !(main_~array_size~0 < 1 || main_~array_size~0 >= 536870911); {1784#true} is VALID [2020-07-29 03:25:32,226 INFO L280 TraceCheckUtils]: 3: Hoare triple {1784#true} 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; {1807#(= 0 ULTIMATE.start_main_~k~0)} is VALID [2020-07-29 03:25:32,226 INFO L280 TraceCheckUtils]: 4: Hoare triple {1807#(= 0 ULTIMATE.start_main_~k~0)} 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; {1807#(= 0 ULTIMATE.start_main_~k~0)} is VALID [2020-07-29 03:25:32,226 INFO L280 TraceCheckUtils]: 5: Hoare triple {1807#(= 0 ULTIMATE.start_main_~k~0)} main_#t~post10 := main_~k~0;main_~k~0 := 1 + main_#t~post10;havoc main_#t~post10; {1784#true} is VALID [2020-07-29 03:25:32,226 INFO L280 TraceCheckUtils]: 6: Hoare triple {1784#true} 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; {1784#true} is VALID [2020-07-29 03:25:32,227 INFO L280 TraceCheckUtils]: 7: Hoare triple {1784#true} main_#t~post10 := main_~k~0;main_~k~0 := 1 + main_#t~post10;havoc main_#t~post10; {1784#true} is VALID [2020-07-29 03:25:32,227 INFO L280 TraceCheckUtils]: 8: Hoare triple {1784#true} 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; {1784#true} is VALID [2020-07-29 03:25:32,227 INFO L280 TraceCheckUtils]: 9: Hoare triple {1784#true} main_#t~post10 := main_~k~0;main_~k~0 := 1 + main_#t~post10;havoc main_#t~post10; {1784#true} is VALID [2020-07-29 03:25:32,227 INFO L280 TraceCheckUtils]: 10: Hoare triple {1784#true} assume !(main_~k~0 < main_~array_size~0); {1784#true} is VALID [2020-07-29 03:25:32,228 INFO L280 TraceCheckUtils]: 11: Hoare triple {1784#true} 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; {1784#true} is VALID [2020-07-29 03:25:32,231 INFO L280 TraceCheckUtils]: 12: Hoare triple {1784#true} assume !!(bubbleSort_~i~0 >= 0);bubbleSort_~j~0 := 1; {1835#(= 1 ULTIMATE.start_bubbleSort_~j~0)} is VALID [2020-07-29 03:25:32,233 INFO L280 TraceCheckUtils]: 13: Hoare triple {1835#(= 1 ULTIMATE.start_bubbleSort_~j~0)} 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); {1839#(and (<= (select (select |#memory_int| ULTIMATE.start_bubbleSort_~numbers.base) ULTIMATE.start_bubbleSort_~numbers.offset) |ULTIMATE.start_bubbleSort_#t~mem4|) (<= |ULTIMATE.start_bubbleSort_#t~mem5| (select (select |#memory_int| ULTIMATE.start_bubbleSort_~numbers.base) (+ ULTIMATE.start_bubbleSort_~numbers.offset 4))))} is VALID [2020-07-29 03:25:32,234 INFO L280 TraceCheckUtils]: 14: Hoare triple {1839#(and (<= (select (select |#memory_int| ULTIMATE.start_bubbleSort_~numbers.base) ULTIMATE.start_bubbleSort_~numbers.offset) |ULTIMATE.start_bubbleSort_#t~mem4|) (<= |ULTIMATE.start_bubbleSort_#t~mem5| (select (select |#memory_int| ULTIMATE.start_bubbleSort_~numbers.base) (+ ULTIMATE.start_bubbleSort_~numbers.offset 4))))} assume !(bubbleSort_#t~mem4 > bubbleSort_#t~mem5);havoc bubbleSort_#t~mem4;havoc bubbleSort_#t~mem5; {1843#(<= (select (select |#memory_int| ULTIMATE.start_bubbleSort_~numbers.base) ULTIMATE.start_bubbleSort_~numbers.offset) (select (select |#memory_int| ULTIMATE.start_bubbleSort_~numbers.base) (+ ULTIMATE.start_bubbleSort_~numbers.offset 4)))} is VALID [2020-07-29 03:25:32,235 INFO L280 TraceCheckUtils]: 15: Hoare triple {1843#(<= (select (select |#memory_int| ULTIMATE.start_bubbleSort_~numbers.base) ULTIMATE.start_bubbleSort_~numbers.offset) (select (select |#memory_int| ULTIMATE.start_bubbleSort_~numbers.base) (+ ULTIMATE.start_bubbleSort_~numbers.offset 4)))} bubbleSort_#t~post3 := bubbleSort_~j~0;bubbleSort_~j~0 := 1 + bubbleSort_#t~post3;havoc bubbleSort_#t~post3; {1843#(<= (select (select |#memory_int| ULTIMATE.start_bubbleSort_~numbers.base) ULTIMATE.start_bubbleSort_~numbers.offset) (select (select |#memory_int| ULTIMATE.start_bubbleSort_~numbers.base) (+ ULTIMATE.start_bubbleSort_~numbers.offset 4)))} is VALID [2020-07-29 03:25:32,236 INFO L280 TraceCheckUtils]: 16: Hoare triple {1843#(<= (select (select |#memory_int| ULTIMATE.start_bubbleSort_~numbers.base) ULTIMATE.start_bubbleSort_~numbers.offset) (select (select |#memory_int| ULTIMATE.start_bubbleSort_~numbers.base) (+ ULTIMATE.start_bubbleSort_~numbers.offset 4)))} 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); {1843#(<= (select (select |#memory_int| ULTIMATE.start_bubbleSort_~numbers.base) ULTIMATE.start_bubbleSort_~numbers.offset) (select (select |#memory_int| ULTIMATE.start_bubbleSort_~numbers.base) (+ ULTIMATE.start_bubbleSort_~numbers.offset 4)))} is VALID [2020-07-29 03:25:32,236 INFO L280 TraceCheckUtils]: 17: Hoare triple {1843#(<= (select (select |#memory_int| ULTIMATE.start_bubbleSort_~numbers.base) ULTIMATE.start_bubbleSort_~numbers.offset) (select (select |#memory_int| ULTIMATE.start_bubbleSort_~numbers.base) (+ ULTIMATE.start_bubbleSort_~numbers.offset 4)))} assume !(bubbleSort_#t~mem4 > bubbleSort_#t~mem5);havoc bubbleSort_#t~mem4;havoc bubbleSort_#t~mem5; {1843#(<= (select (select |#memory_int| ULTIMATE.start_bubbleSort_~numbers.base) ULTIMATE.start_bubbleSort_~numbers.offset) (select (select |#memory_int| ULTIMATE.start_bubbleSort_~numbers.base) (+ ULTIMATE.start_bubbleSort_~numbers.offset 4)))} is VALID [2020-07-29 03:25:32,237 INFO L280 TraceCheckUtils]: 18: Hoare triple {1843#(<= (select (select |#memory_int| ULTIMATE.start_bubbleSort_~numbers.base) ULTIMATE.start_bubbleSort_~numbers.offset) (select (select |#memory_int| ULTIMATE.start_bubbleSort_~numbers.base) (+ ULTIMATE.start_bubbleSort_~numbers.offset 4)))} bubbleSort_#t~post3 := bubbleSort_~j~0;bubbleSort_~j~0 := 1 + bubbleSort_#t~post3;havoc bubbleSort_#t~post3; {1843#(<= (select (select |#memory_int| ULTIMATE.start_bubbleSort_~numbers.base) ULTIMATE.start_bubbleSort_~numbers.offset) (select (select |#memory_int| ULTIMATE.start_bubbleSort_~numbers.base) (+ ULTIMATE.start_bubbleSort_~numbers.offset 4)))} is VALID [2020-07-29 03:25:32,238 INFO L280 TraceCheckUtils]: 19: Hoare triple {1843#(<= (select (select |#memory_int| ULTIMATE.start_bubbleSort_~numbers.base) ULTIMATE.start_bubbleSort_~numbers.offset) (select (select |#memory_int| ULTIMATE.start_bubbleSort_~numbers.base) (+ ULTIMATE.start_bubbleSort_~numbers.offset 4)))} assume !(bubbleSort_~j~0 <= bubbleSort_~i~0); {1843#(<= (select (select |#memory_int| ULTIMATE.start_bubbleSort_~numbers.base) ULTIMATE.start_bubbleSort_~numbers.offset) (select (select |#memory_int| ULTIMATE.start_bubbleSort_~numbers.base) (+ ULTIMATE.start_bubbleSort_~numbers.offset 4)))} is VALID [2020-07-29 03:25:32,238 INFO L280 TraceCheckUtils]: 20: Hoare triple {1843#(<= (select (select |#memory_int| ULTIMATE.start_bubbleSort_~numbers.base) ULTIMATE.start_bubbleSort_~numbers.offset) (select (select |#memory_int| ULTIMATE.start_bubbleSort_~numbers.base) (+ ULTIMATE.start_bubbleSort_~numbers.offset 4)))} bubbleSort_#t~post2 := bubbleSort_~i~0;bubbleSort_~i~0 := bubbleSort_#t~post2 - 1;havoc bubbleSort_#t~post2; {1843#(<= (select (select |#memory_int| ULTIMATE.start_bubbleSort_~numbers.base) ULTIMATE.start_bubbleSort_~numbers.offset) (select (select |#memory_int| ULTIMATE.start_bubbleSort_~numbers.base) (+ ULTIMATE.start_bubbleSort_~numbers.offset 4)))} is VALID [2020-07-29 03:25:32,239 INFO L280 TraceCheckUtils]: 21: Hoare triple {1843#(<= (select (select |#memory_int| ULTIMATE.start_bubbleSort_~numbers.base) ULTIMATE.start_bubbleSort_~numbers.offset) (select (select |#memory_int| ULTIMATE.start_bubbleSort_~numbers.base) (+ ULTIMATE.start_bubbleSort_~numbers.offset 4)))} assume !!(bubbleSort_~i~0 >= 0);bubbleSort_~j~0 := 1; {1865#(and (= 1 ULTIMATE.start_bubbleSort_~j~0) (<= (select (select |#memory_int| ULTIMATE.start_bubbleSort_~numbers.base) ULTIMATE.start_bubbleSort_~numbers.offset) (select (select |#memory_int| ULTIMATE.start_bubbleSort_~numbers.base) (+ ULTIMATE.start_bubbleSort_~numbers.offset 4))))} is VALID [2020-07-29 03:25:32,242 INFO L280 TraceCheckUtils]: 22: Hoare triple {1865#(and (= 1 ULTIMATE.start_bubbleSort_~j~0) (<= (select (select |#memory_int| ULTIMATE.start_bubbleSort_~numbers.base) ULTIMATE.start_bubbleSort_~numbers.offset) (select (select |#memory_int| ULTIMATE.start_bubbleSort_~numbers.base) (+ ULTIMATE.start_bubbleSort_~numbers.offset 4))))} 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); {1794#(<= |ULTIMATE.start_bubbleSort_#t~mem4| |ULTIMATE.start_bubbleSort_#t~mem5|)} is VALID [2020-07-29 03:25:32,243 INFO L280 TraceCheckUtils]: 23: Hoare triple {1794#(<= |ULTIMATE.start_bubbleSort_#t~mem4| |ULTIMATE.start_bubbleSort_#t~mem5|)} assume bubbleSort_#t~mem4 > bubbleSort_#t~mem5;havoc bubbleSort_#t~mem4;havoc bubbleSort_#t~mem5;call bubbleSort_#t~mem6 := read~int(bubbleSort_~numbers.base, bubbleSort_~numbers.offset + 4 * (bubbleSort_~j~0 - 1), 4);bubbleSort_~temp~0 := bubbleSort_#t~mem6;havoc bubbleSort_#t~mem6;call bubbleSort_#t~mem7 := read~int(bubbleSort_~numbers.base, bubbleSort_~numbers.offset + 4 * bubbleSort_~j~0, 4);call write~int(bubbleSort_#t~mem7, bubbleSort_~numbers.base, bubbleSort_~numbers.offset + 4 * (bubbleSort_~j~0 - 1), 4);havoc bubbleSort_#t~mem7;call write~int(bubbleSort_~temp~0, bubbleSort_~numbers.base, bubbleSort_~numbers.offset + 4 * bubbleSort_~j~0, 4); {1785#false} is VALID [2020-07-29 03:25:32,243 INFO L280 TraceCheckUtils]: 24: Hoare triple {1785#false} bubbleSort_#t~post3 := bubbleSort_~j~0;bubbleSort_~j~0 := 1 + bubbleSort_#t~post3;havoc bubbleSort_#t~post3; {1785#false} is VALID [2020-07-29 03:25:32,244 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 6 proven. 10 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2020-07-29 03:25:32,245 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-07-29 03:25:32,245 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 8] total 16 [2020-07-29 03:25:32,245 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1394662235] [2020-07-29 03:25:32,356 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-29 03:25:32,357 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2020-07-29 03:25:32,357 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=50, Invalid=190, Unknown=0, NotChecked=0, Total=240 [2020-07-29 03:25:32,357 INFO L87 Difference]: Start difference. First operand 25 states and 31 transitions. cyclomatic complexity: 9 Second operand 16 states. [2020-07-29 03:25:32,981 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-29 03:25:32,982 INFO L93 Difference]: Finished difference Result 51 states and 67 transitions. [2020-07-29 03:25:32,982 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-07-29 03:25:32,982 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 16 states. [2020-07-29 03:25:33,045 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 40 edges. 40 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-29 03:25:33,045 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 51 states and 67 transitions. [2020-07-29 03:25:33,047 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 6 [2020-07-29 03:25:33,048 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 51 states to 51 states and 67 transitions. [2020-07-29 03:25:33,048 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 21 [2020-07-29 03:25:33,048 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 21 [2020-07-29 03:25:33,049 INFO L73 IsDeterministic]: Start isDeterministic. Operand 51 states and 67 transitions. [2020-07-29 03:25:33,049 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2020-07-29 03:25:33,049 INFO L688 BuchiCegarLoop]: Abstraction has 51 states and 67 transitions. [2020-07-29 03:25:33,049 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states and 67 transitions. [2020-07-29 03:25:33,052 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 36. [2020-07-29 03:25:33,052 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-29 03:25:33,053 INFO L82 GeneralOperation]: Start isEquivalent. First operand 51 states and 67 transitions. Second operand 36 states. [2020-07-29 03:25:33,053 INFO L74 IsIncluded]: Start isIncluded. First operand 51 states and 67 transitions. Second operand 36 states. [2020-07-29 03:25:33,053 INFO L87 Difference]: Start difference. First operand 51 states and 67 transitions. Second operand 36 states. [2020-07-29 03:25:33,054 INFO L149 Difference]: Subtrahend was not deterministic. Recomputing result with determinization. [2020-07-29 03:25:33,056 INFO L93 Difference]: Finished difference Result 59 states and 80 transitions. [2020-07-29 03:25:33,057 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 80 transitions. [2020-07-29 03:25:33,058 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-29 03:25:33,061 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-29 03:25:33,061 INFO L74 IsIncluded]: Start isIncluded. First operand 36 states. Second operand 51 states and 67 transitions. [2020-07-29 03:25:33,061 INFO L87 Difference]: Start difference. First operand 36 states. Second operand 51 states and 67 transitions. [2020-07-29 03:25:33,062 INFO L149 Difference]: Subtrahend was not deterministic. Recomputing result with determinization. [2020-07-29 03:25:33,064 INFO L93 Difference]: Finished difference Result 59 states and 80 transitions. [2020-07-29 03:25:33,065 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 80 transitions. [2020-07-29 03:25:33,065 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-29 03:25:33,065 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-29 03:25:33,065 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-29 03:25:33,066 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-29 03:25:33,066 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36 states. [2020-07-29 03:25:33,067 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 46 transitions. [2020-07-29 03:25:33,068 INFO L711 BuchiCegarLoop]: Abstraction has 36 states and 46 transitions. [2020-07-29 03:25:33,068 INFO L591 BuchiCegarLoop]: Abstraction has 36 states and 46 transitions. [2020-07-29 03:25:33,068 INFO L424 BuchiCegarLoop]: ======== Iteration 9============ [2020-07-29 03:25:33,068 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 36 states and 46 transitions. [2020-07-29 03:25:33,069 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2020-07-29 03:25:33,069 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 03:25:33,069 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 03:25:33,072 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-29 03:25:33,072 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2020-07-29 03:25:33,072 INFO L794 eck$LassoCheckResult]: Stem: 1940#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; 1938#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; 1939#L527 assume !(main_~array_size~0 < 1 || main_~array_size~0 >= 536870911); 1941#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; 1942#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; 1947#L532-2 main_#t~post10 := main_~k~0;main_~k~0 := 1 + main_#t~post10;havoc main_#t~post10; 1948#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; 1953#L532-2 main_#t~post10 := main_~k~0;main_~k~0 := 1 + main_#t~post10;havoc main_#t~post10; 1964#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; 1963#L532-2 main_#t~post10 := main_~k~0;main_~k~0 := 1 + main_#t~post10;havoc main_#t~post10; 1962#L532-3 assume !(main_~k~0 < main_~array_size~0); 1958#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; 1954#L515-3 assume !!(bubbleSort_~i~0 >= 0);bubbleSort_~j~0 := 1; 1955#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); 1966#L517 assume !(bubbleSort_#t~mem4 > bubbleSort_#t~mem5);havoc bubbleSort_#t~mem4;havoc bubbleSort_#t~mem5; 1945#L516-2 bubbleSort_#t~post3 := bubbleSort_~j~0;bubbleSort_~j~0 := 1 + bubbleSort_#t~post3;havoc bubbleSort_#t~post3; 1946#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); 1950#L517 assume bubbleSort_#t~mem4 > bubbleSort_#t~mem5;havoc bubbleSort_#t~mem4;havoc bubbleSort_#t~mem5;call bubbleSort_#t~mem6 := read~int(bubbleSort_~numbers.base, bubbleSort_~numbers.offset + 4 * (bubbleSort_~j~0 - 1), 4);bubbleSort_~temp~0 := bubbleSort_#t~mem6;havoc bubbleSort_#t~mem6;call bubbleSort_#t~mem7 := read~int(bubbleSort_~numbers.base, bubbleSort_~numbers.offset + 4 * bubbleSort_~j~0, 4);call write~int(bubbleSort_#t~mem7, bubbleSort_~numbers.base, bubbleSort_~numbers.offset + 4 * (bubbleSort_~j~0 - 1), 4);havoc bubbleSort_#t~mem7;call write~int(bubbleSort_~temp~0, bubbleSort_~numbers.base, bubbleSort_~numbers.offset + 4 * bubbleSort_~j~0, 4); 1972#L516-2 bubbleSort_#t~post3 := bubbleSort_~j~0;bubbleSort_~j~0 := 1 + bubbleSort_#t~post3;havoc bubbleSort_#t~post3; 1970#L516-3 assume !(bubbleSort_~j~0 <= bubbleSort_~i~0); 1969#L515-2 bubbleSort_#t~post2 := bubbleSort_~i~0;bubbleSort_~i~0 := bubbleSort_#t~post2 - 1;havoc bubbleSort_#t~post2; 1956#L515-3 assume !!(bubbleSort_~i~0 >= 0);bubbleSort_~j~0 := 1; 1944#L516-3 [2020-07-29 03:25:33,072 INFO L796 eck$LassoCheckResult]: Loop: 1944#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); 1949#L517 assume bubbleSort_#t~mem4 > bubbleSort_#t~mem5;havoc bubbleSort_#t~mem4;havoc bubbleSort_#t~mem5;call bubbleSort_#t~mem6 := read~int(bubbleSort_~numbers.base, bubbleSort_~numbers.offset + 4 * (bubbleSort_~j~0 - 1), 4);bubbleSort_~temp~0 := bubbleSort_#t~mem6;havoc bubbleSort_#t~mem6;call bubbleSort_#t~mem7 := read~int(bubbleSort_~numbers.base, bubbleSort_~numbers.offset + 4 * bubbleSort_~j~0, 4);call write~int(bubbleSort_#t~mem7, bubbleSort_~numbers.base, bubbleSort_~numbers.offset + 4 * (bubbleSort_~j~0 - 1), 4);havoc bubbleSort_#t~mem7;call write~int(bubbleSort_~temp~0, bubbleSort_~numbers.base, bubbleSort_~numbers.offset + 4 * bubbleSort_~j~0, 4); 1943#L516-2 bubbleSort_#t~post3 := bubbleSort_~j~0;bubbleSort_~j~0 := 1 + bubbleSort_#t~post3;havoc bubbleSort_#t~post3; 1944#L516-3 [2020-07-29 03:25:33,072 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 03:25:33,072 INFO L82 PathProgramCache]: Analyzing trace with hash -137307676, now seen corresponding path program 3 times [2020-07-29 03:25:33,073 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 03:25:33,073 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1492690362] [2020-07-29 03:25:33,073 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 03:25:33,112 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 03:25:33,112 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 03:25:33,142 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 03:25:33,143 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 03:25:33,154 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-07-29 03:25:33,154 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 03:25:33,155 INFO L82 PathProgramCache]: Analyzing trace with hash 68618, now seen corresponding path program 7 times [2020-07-29 03:25:33,155 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 03:25:33,155 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2052251023] [2020-07-29 03:25:33,155 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 03:25:33,159 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 03:25:33,159 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 03:25:33,163 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 03:25:33,163 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 03:25:33,166 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-07-29 03:25:33,167 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 03:25:33,167 INFO L82 PathProgramCache]: Analyzing trace with hash -1724071097, now seen corresponding path program 4 times [2020-07-29 03:25:33,167 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 03:25:33,167 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1045855017] [2020-07-29 03:25:33,167 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 03:25:33,197 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 03:25:33,197 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 03:25:33,216 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 03:25:33,216 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 03:25:33,234 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-07-29 03:25:34,401 WARN L193 SmtUtils]: Spent 1.04 s on a formula simplification. DAG size of input: 183 DAG size of output: 139 [2020-07-29 03:25:35,081 WARN L193 SmtUtils]: Spent 332.00 ms on a formula simplification that was a NOOP. DAG size: 105 [2020-07-29 03:25:35,084 INFO L210 LassoAnalysis]: Preferences: [2020-07-29 03:25:35,084 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2020-07-29 03:25:35,085 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2020-07-29 03:25:35,085 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2020-07-29 03:25:35,085 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2020-07-29 03:25:35,085 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 03:25:35,085 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2020-07-29 03:25:35,085 INFO L132 ssoRankerPreferences]: Path of dumped script: [2020-07-29 03:25:35,085 INFO L133 ssoRankerPreferences]: Filename of dumped script: bubblesort-alloca-2.i_Iteration9_Lasso [2020-07-29 03:25:35,085 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2020-07-29 03:25:35,085 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2020-07-29 03:25:35,110 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 03:25:35,114 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 03:25:35,122 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 03:25:35,125 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 03:25:35,130 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 03:25:35,133 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 03:25:35,136 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 03:25:35,141 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 03:25:35,144 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 03:25:35,148 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 03:25:35,152 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 03:25:35,156 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 03:25:35,159 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 03:25:35,162 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 03:25:35,166 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 03:25:35,228 FATAL L? ?]: The Plugin de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer has thrown an exception: java.lang.AssertionError: MapEliminator tries to combine Int and (Array Int Int) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.mapelimination.MapEliminator.indexEqualityInequalityImpliesValueEquality(MapEliminator.java:850) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.mapelimination.MapEliminator.replaceSelectStoreTerm(MapEliminator.java:592) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.mapelimination.MapEliminator.replaceStoreTerms(MapEliminator.java:542) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.mapelimination.MapEliminator.getRewrittenTransFormula(MapEliminator.java:330) at de.uni_freiburg.informatik.ultimate.lassoranker.preprocessors.MapEliminationLassoPreprocessor.process(MapEliminationLassoPreprocessor.java:109) at de.uni_freiburg.informatik.ultimate.lassoranker.variables.LassoBuilder.applyPreprocessor(LassoBuilder.java:154) at de.uni_freiburg.informatik.ultimate.lassoranker.variables.LassoBuilder.preprocess(LassoBuilder.java:262) at de.uni_freiburg.informatik.ultimate.lassoranker.LassoAnalysis.preprocess(LassoAnalysis.java:278) at de.uni_freiburg.informatik.ultimate.lassoranker.LassoAnalysis.(LassoAnalysis.java:229) at de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.LassoCheck.synthesize(LassoCheck.java:612) at de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.LassoCheck.access$16(LassoCheck.java:539) at de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.LassoCheck$LassoCheckResult.checkLassoTermination(LassoCheck.java:957) at de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.LassoCheck$LassoCheckResult.(LassoCheck.java:865) at de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.LassoCheck.(LassoCheck.java:251) at de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiCegarLoop.iterate(BuchiCegarLoop.java: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:317) 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) [2020-07-29 03:25:35,233 INFO L168 Benchmark]: Toolchain (without parser) took 14775.43 ms. Allocated memory was 1.0 GB in the beginning and 1.4 GB in the end (delta: 382.7 MB). Free memory was 958.9 MB in the beginning and 1.2 GB in the end (delta: -216.4 MB). Peak memory consumption was 450.8 MB. Max. memory is 11.5 GB. [2020-07-29 03:25:35,233 INFO L168 Benchmark]: CDTParser took 0.30 ms. Allocated memory is still 1.0 GB. Free memory is still 987.1 MB. There was no memory consumed. Max. memory is 11.5 GB. [2020-07-29 03:25:35,234 INFO L168 Benchmark]: CACSL2BoogieTranslator took 553.54 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 132.1 MB). Free memory was 953.5 MB in the beginning and 1.1 GB in the end (delta: -154.1 MB). Peak memory consumption was 15.3 MB. Max. memory is 11.5 GB. [2020-07-29 03:25:35,235 INFO L168 Benchmark]: Boogie Procedure Inliner took 50.98 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 6.8 MB). Peak memory consumption was 6.8 MB. Max. memory is 11.5 GB. [2020-07-29 03:25:35,235 INFO L168 Benchmark]: Boogie Preprocessor took 37.42 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. [2020-07-29 03:25:35,235 INFO L168 Benchmark]: RCFGBuilder took 537.55 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: 32.7 MB). Peak memory consumption was 32.7 MB. Max. memory is 11.5 GB. [2020-07-29 03:25:35,236 INFO L168 Benchmark]: BuchiAutomizer took 13588.53 ms. Allocated memory was 1.2 GB in the beginning and 1.4 GB in the end (delta: 250.6 MB). Free memory was 1.1 GB in the beginning and 1.2 GB in the end (delta: -107.2 MB). Peak memory consumption was 427.9 MB. Max. memory is 11.5 GB. [2020-07-29 03:25:35,239 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - AssertionsEnabledResult: Assertions are enabled Assertions are enabled - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.30 ms. Allocated memory is still 1.0 GB. Free memory is still 987.1 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 553.54 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 132.1 MB). Free memory was 953.5 MB in the beginning and 1.1 GB in the end (delta: -154.1 MB). Peak memory consumption was 15.3 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 50.98 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 6.8 MB). Peak memory consumption was 6.8 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 37.42 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 537.55 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: 32.7 MB). Peak memory consumption was 32.7 MB. Max. memory is 11.5 GB. * BuchiAutomizer took 13588.53 ms. Allocated memory was 1.2 GB in the beginning and 1.4 GB in the end (delta: 250.6 MB). Free memory was 1.1 GB in the beginning and 1.2 GB in the end (delta: -107.2 MB). Peak memory consumption was 427.9 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...