./Ultimate.py --spec ../sv-benchmarks/c/properties/termination.prp --file ../sv-benchmarks/c/termination-memory-alloca/bubblesort-alloca-1.i --full-output -ea --architecture 64bit -------------------------------------------------------------------------------- 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/termination-memory-alloca/bubblesort-alloca-1.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-64bit-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 64bit --witnessprinter.graph.data.programhash cb74f7a1bb788b2c5a3efb057591b3727e299c90 .................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................. Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.25-8bd4bc6 [2020-07-29 01:34:58,038 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-07-29 01:34:58,040 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-07-29 01:34:58,053 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-07-29 01:34:58,053 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-07-29 01:34:58,055 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-07-29 01:34:58,056 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-07-29 01:34:58,058 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-07-29 01:34:58,060 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-07-29 01:34:58,061 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-07-29 01:34:58,063 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-07-29 01:34:58,064 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-07-29 01:34:58,064 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-07-29 01:34:58,065 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-07-29 01:34:58,067 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-07-29 01:34:58,068 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-07-29 01:34:58,069 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-07-29 01:34:58,070 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-07-29 01:34:58,072 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-07-29 01:34:58,074 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-07-29 01:34:58,076 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-07-29 01:34:58,077 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-07-29 01:34:58,079 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-07-29 01:34:58,080 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-07-29 01:34:58,082 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-07-29 01:34:58,083 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-07-29 01:34:58,083 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-07-29 01:34:58,084 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-07-29 01:34:58,085 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-07-29 01:34:58,086 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-07-29 01:34:58,086 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-07-29 01:34:58,087 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-07-29 01:34:58,088 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-07-29 01:34:58,089 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-07-29 01:34:58,091 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-07-29 01:34:58,091 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-07-29 01:34:58,092 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-07-29 01:34:58,092 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-07-29 01:34:58,092 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-07-29 01:34:58,094 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-07-29 01:34:58,094 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-07-29 01:34:58,095 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-64bit-Automizer_Default.epf [2020-07-29 01:34:58,113 INFO L113 SettingsManager]: Loading preferences was successful [2020-07-29 01:34:58,113 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-07-29 01:34:58,115 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2020-07-29 01:34:58,115 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2020-07-29 01:34:58,115 INFO L138 SettingsManager]: * Use SBE=true [2020-07-29 01:34:58,116 INFO L136 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2020-07-29 01:34:58,116 INFO L138 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2020-07-29 01:34:58,116 INFO L138 SettingsManager]: * Use old map elimination=false [2020-07-29 01:34:58,117 INFO L138 SettingsManager]: * Use external solver (rank synthesis)=false [2020-07-29 01:34:58,117 INFO L138 SettingsManager]: * Use only trivial implications for array writes=true [2020-07-29 01:34:58,117 INFO L138 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2020-07-29 01:34:58,117 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-07-29 01:34:58,118 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2020-07-29 01:34:58,118 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-07-29 01:34:58,118 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-07-29 01:34:58,119 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2020-07-29 01:34:58,119 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2020-07-29 01:34:58,119 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2020-07-29 01:34:58,119 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-07-29 01:34:58,120 INFO L138 SettingsManager]: * Assume nondeterminstic values are in range=false [2020-07-29 01:34:58,120 INFO L138 SettingsManager]: * Use constant arrays=true [2020-07-29 01:34:58,120 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2020-07-29 01:34:58,121 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-07-29 01:34:58,121 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2020-07-29 01:34:58,121 INFO L138 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2020-07-29 01:34:58,122 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-07-29 01:34:58,122 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2020-07-29 01:34:58,122 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2020-07-29 01:34:58,122 INFO L138 SettingsManager]: * Dump automata to the following directory=/home/matthias/ultimate/dump/auto [2020-07-29 01:34:58,123 INFO L136 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2020-07-29 01:34:58,124 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 -> 64bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> cb74f7a1bb788b2c5a3efb057591b3727e299c90 [2020-07-29 01:34:58,501 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2020-07-29 01:34:58,523 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-07-29 01:34:58,526 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-07-29 01:34:58,529 INFO L271 PluginConnector]: Initializing CDTParser... [2020-07-29 01:34:58,531 INFO L275 PluginConnector]: CDTParser initialized [2020-07-29 01:34:58,531 INFO L429 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/termination-memory-alloca/bubblesort-alloca-1.i [2020-07-29 01:34:58,599 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d0659c989/85d06add32744c049b4b1bf340d5890c/FLAG0671469fc [2020-07-29 01:34:59,148 INFO L306 CDTParser]: Found 1 translation units. [2020-07-29 01:34:59,149 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/termination-memory-alloca/bubblesort-alloca-1.i [2020-07-29 01:34:59,170 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d0659c989/85d06add32744c049b4b1bf340d5890c/FLAG0671469fc [2020-07-29 01:34:59,354 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d0659c989/85d06add32744c049b4b1bf340d5890c [2020-07-29 01:34:59,358 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-07-29 01:34:59,361 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2020-07-29 01:34:59,362 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-07-29 01:34:59,362 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-07-29 01:34:59,366 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-07-29 01:34:59,368 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 29.07 01:34:59" (1/1) ... [2020-07-29 01:34:59,371 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6d494b33 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.07 01:34:59, skipping insertion in model container [2020-07-29 01:34:59,371 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 29.07 01:34:59" (1/1) ... [2020-07-29 01:34:59,379 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-07-29 01:34:59,416 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-07-29 01:34:59,789 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-07-29 01:34:59,805 INFO L203 MainTranslator]: Completed pre-run [2020-07-29 01:34:59,880 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-07-29 01:34:59,944 INFO L208 MainTranslator]: Completed translation [2020-07-29 01:34:59,945 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.07 01:34:59 WrapperNode [2020-07-29 01:34:59,945 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-07-29 01:34:59,946 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2020-07-29 01:34:59,946 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2020-07-29 01:34:59,946 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2020-07-29 01:34:59,955 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.07 01:34:59" (1/1) ... [2020-07-29 01:34:59,970 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.07 01:34:59" (1/1) ... [2020-07-29 01:34:59,997 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2020-07-29 01:34:59,998 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-07-29 01:34:59,998 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-07-29 01:34:59,998 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-07-29 01:35:00,008 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.07 01:34:59" (1/1) ... [2020-07-29 01:35:00,008 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.07 01:34:59" (1/1) ... [2020-07-29 01:35:00,011 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.07 01:34:59" (1/1) ... [2020-07-29 01:35:00,011 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.07 01:34:59" (1/1) ... [2020-07-29 01:35:00,020 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.07 01:34:59" (1/1) ... [2020-07-29 01:35:00,025 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.07 01:34:59" (1/1) ... [2020-07-29 01:35:00,027 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.07 01:34:59" (1/1) ... [2020-07-29 01:35:00,029 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-07-29 01:35:00,030 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-07-29 01:35:00,030 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-07-29 01:35:00,030 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-07-29 01:35:00,031 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.07 01:34:59" (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 01:35:00,101 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2020-07-29 01:35:00,102 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2020-07-29 01:35:00,104 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2020-07-29 01:35:00,104 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2020-07-29 01:35:00,104 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-07-29 01:35:00,104 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-07-29 01:35:00,482 INFO L290 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-07-29 01:35:00,482 INFO L295 CfgBuilder]: Removed 8 assume(true) statements. [2020-07-29 01:35:00,486 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.07 01:35:00 BoogieIcfgContainer [2020-07-29 01:35:00,486 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-07-29 01:35:00,487 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2020-07-29 01:35:00,488 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2020-07-29 01:35:00,491 INFO L275 PluginConnector]: BuchiAutomizer initialized [2020-07-29 01:35:00,493 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2020-07-29 01:35:00,493 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 29.07 01:34:59" (1/3) ... [2020-07-29 01:35:00,494 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@759ab9ff and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 29.07 01:35:00, skipping insertion in model container [2020-07-29 01:35:00,495 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2020-07-29 01:35:00,495 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.07 01:34:59" (2/3) ... [2020-07-29 01:35:00,496 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@759ab9ff and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 29.07 01:35:00, skipping insertion in model container [2020-07-29 01:35:00,496 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2020-07-29 01:35:00,496 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.07 01:35:00" (3/3) ... [2020-07-29 01:35:00,498 INFO L371 chiAutomizerObserver]: Analyzing ICFG bubblesort-alloca-1.i [2020-07-29 01:35:00,552 INFO L356 BuchiCegarLoop]: Interprodecural is true [2020-07-29 01:35:00,552 INFO L357 BuchiCegarLoop]: Hoare is false [2020-07-29 01:35:00,553 INFO L358 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2020-07-29 01:35:00,553 INFO L359 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2020-07-29 01:35:00,555 INFO L360 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-07-29 01:35:00,555 INFO L361 BuchiCegarLoop]: Difference is false [2020-07-29 01:35:00,555 INFO L362 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-07-29 01:35:00,555 INFO L365 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2020-07-29 01:35:00,569 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 13 states. [2020-07-29 01:35:00,592 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2020-07-29 01:35:00,593 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 01:35:00,593 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 01:35:00,599 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1] [2020-07-29 01:35:00,599 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2020-07-29 01:35:00,599 INFO L424 BuchiCegarLoop]: ======== Iteration 1============ [2020-07-29 01:35:00,600 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 13 states. [2020-07-29 01:35:00,603 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2020-07-29 01:35:00,603 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 01:35:00,603 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 01:35:00,604 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1] [2020-07-29 01:35:00,604 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2020-07-29 01:35:00,613 INFO L794 eck$LassoCheckResult]: Stem: 9#ULTIMATE.startENTRYtrue #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; 8#L-1true havoc main_#res;havoc main_#t~nondet8, main_#t~malloc9.base, main_#t~malloc9.offset, main_~array_size~0, main_~numbers~0.base, main_~numbers~0.offset;main_~array_size~0 := main_#t~nondet8;havoc main_#t~nondet8; 11#L562true assume !(main_~array_size~0 < 1); 13#L562-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;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; 5#L550-3true [2020-07-29 01:35:00,614 INFO L796 eck$LassoCheckResult]: Loop: 5#L550-3true assume !!(bubbleSort_~i~0 >= 0);bubbleSort_~j~0 := 1; 3#L551-3true assume !true; 4#L550-2true bubbleSort_#t~post2 := bubbleSort_~i~0;bubbleSort_~i~0 := bubbleSort_#t~post2 - 1;havoc bubbleSort_#t~post2; 5#L550-3true [2020-07-29 01:35:00,620 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 01:35:00,620 INFO L82 PathProgramCache]: Analyzing trace with hash 925669, now seen corresponding path program 1 times [2020-07-29 01:35:00,628 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 01:35:00,629 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2127334254] [2020-07-29 01:35:00,629 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 01:35:00,728 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 01:35:00,728 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 01:35:00,746 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 01:35:00,746 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 01:35:00,770 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-07-29 01:35:00,771 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 01:35:00,771 INFO L82 PathProgramCache]: Analyzing trace with hash 47218, now seen corresponding path program 1 times [2020-07-29 01:35:00,771 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 01:35:00,772 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [766600526] [2020-07-29 01:35:00,772 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 01:35:00,781 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:35:00,822 INFO L280 TraceCheckUtils]: 0: Hoare triple {19#true} assume !!(bubbleSort_~i~0 >= 0);bubbleSort_~j~0 := 1; {19#true} is VALID [2020-07-29 01:35:00,824 INFO L280 TraceCheckUtils]: 1: Hoare triple {19#true} assume !true; {20#false} is VALID [2020-07-29 01:35:00,825 INFO L280 TraceCheckUtils]: 2: Hoare triple {20#false} bubbleSort_#t~post2 := bubbleSort_~i~0;bubbleSort_~i~0 := bubbleSort_#t~post2 - 1;havoc bubbleSort_#t~post2; {20#false} is VALID [2020-07-29 01:35:00,827 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 01:35:00,828 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [766600526] [2020-07-29 01:35:00,828 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-29 01:35:00,829 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-07-29 01:35:00,829 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1071418727] [2020-07-29 01:35:00,835 INFO L811 eck$LassoCheckResult]: loop already infeasible [2020-07-29 01:35:00,836 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-29 01:35:00,847 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2020-07-29 01:35:00,848 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2020-07-29 01:35:00,850 INFO L87 Difference]: Start difference. First operand 13 states. Second operand 2 states. [2020-07-29 01:35:00,898 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-29 01:35:00,899 INFO L93 Difference]: Finished difference Result 13 states and 16 transitions. [2020-07-29 01:35:00,899 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2020-07-29 01:35:00,900 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 2 states. [2020-07-29 01:35:00,918 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 3 edges. 3 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-29 01:35:00,920 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 13 states and 16 transitions. [2020-07-29 01:35:00,925 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2020-07-29 01:35:00,932 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 13 states to 9 states and 12 transitions. [2020-07-29 01:35:00,934 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 9 [2020-07-29 01:35:00,934 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 9 [2020-07-29 01:35:00,935 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 12 transitions. [2020-07-29 01:35:00,935 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-07-29 01:35:00,936 INFO L688 BuchiCegarLoop]: Abstraction has 9 states and 12 transitions. [2020-07-29 01:35:00,954 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9 states and 12 transitions. [2020-07-29 01:35:00,964 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9 to 9. [2020-07-29 01:35:00,964 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-29 01:35:00,965 INFO L82 GeneralOperation]: Start isEquivalent. First operand 9 states and 12 transitions. Second operand 9 states. [2020-07-29 01:35:00,965 INFO L74 IsIncluded]: Start isIncluded. First operand 9 states and 12 transitions. Second operand 9 states. [2020-07-29 01:35:00,967 INFO L87 Difference]: Start difference. First operand 9 states and 12 transitions. Second operand 9 states. [2020-07-29 01:35:00,969 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-29 01:35:00,969 INFO L93 Difference]: Finished difference Result 9 states and 12 transitions. [2020-07-29 01:35:00,970 INFO L276 IsEmpty]: Start isEmpty. Operand 9 states and 12 transitions. [2020-07-29 01:35:00,971 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-29 01:35:00,971 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-29 01:35:00,971 INFO L74 IsIncluded]: Start isIncluded. First operand 9 states. Second operand 9 states and 12 transitions. [2020-07-29 01:35:00,972 INFO L87 Difference]: Start difference. First operand 9 states. Second operand 9 states and 12 transitions. [2020-07-29 01:35:00,973 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-29 01:35:00,973 INFO L93 Difference]: Finished difference Result 9 states and 12 transitions. [2020-07-29 01:35:00,973 INFO L276 IsEmpty]: Start isEmpty. Operand 9 states and 12 transitions. [2020-07-29 01:35:00,974 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-29 01:35:00,974 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-29 01:35:00,974 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-29 01:35:00,975 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-29 01:35:00,975 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2020-07-29 01:35:00,976 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 12 transitions. [2020-07-29 01:35:00,978 INFO L711 BuchiCegarLoop]: Abstraction has 9 states and 12 transitions. [2020-07-29 01:35:00,978 INFO L591 BuchiCegarLoop]: Abstraction has 9 states and 12 transitions. [2020-07-29 01:35:00,978 INFO L424 BuchiCegarLoop]: ======== Iteration 2============ [2020-07-29 01:35:00,979 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 9 states and 12 transitions. [2020-07-29 01:35:00,979 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2020-07-29 01:35:00,979 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 01:35:00,980 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 01:35:00,980 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1] [2020-07-29 01:35:00,980 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2020-07-29 01:35:00,981 INFO L794 eck$LassoCheckResult]: Stem: 40#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; 34#L-1 havoc main_#res;havoc main_#t~nondet8, main_#t~malloc9.base, main_#t~malloc9.offset, main_~array_size~0, main_~numbers~0.base, main_~numbers~0.offset;main_~array_size~0 := main_#t~nondet8;havoc main_#t~nondet8; 35#L562 assume !(main_~array_size~0 < 1); 42#L562-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;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; 39#L550-3 [2020-07-29 01:35:00,981 INFO L796 eck$LassoCheckResult]: Loop: 39#L550-3 assume !!(bubbleSort_~i~0 >= 0);bubbleSort_~j~0 := 1; 36#L551-3 assume !(bubbleSort_~j~0 <= bubbleSort_~i~0); 37#L550-2 bubbleSort_#t~post2 := bubbleSort_~i~0;bubbleSort_~i~0 := bubbleSort_#t~post2 - 1;havoc bubbleSort_#t~post2; 39#L550-3 [2020-07-29 01:35:00,981 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 01:35:00,982 INFO L82 PathProgramCache]: Analyzing trace with hash 925669, now seen corresponding path program 2 times [2020-07-29 01:35:00,982 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 01:35:00,982 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1199178906] [2020-07-29 01:35:00,983 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 01:35:00,996 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 01:35:00,997 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 01:35:01,008 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 01:35:01,009 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 01:35:01,013 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-07-29 01:35:01,014 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 01:35:01,014 INFO L82 PathProgramCache]: Analyzing trace with hash 46877, now seen corresponding path program 1 times [2020-07-29 01:35:01,015 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 01:35:01,015 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [168345252] [2020-07-29 01:35:01,015 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 01:35:01,021 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 01:35:01,022 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 01:35:01,025 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 01:35:01,026 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 01:35:01,028 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-07-29 01:35:01,028 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 01:35:01,028 INFO L82 PathProgramCache]: Analyzing trace with hash 1806818489, now seen corresponding path program 1 times [2020-07-29 01:35:01,029 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 01:35:01,029 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [145532690] [2020-07-29 01:35:01,029 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 01:35:01,044 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 01:35:01,044 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 01:35:01,057 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 01:35:01,058 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 01:35:01,063 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-07-29 01:35:01,123 INFO L210 LassoAnalysis]: Preferences: [2020-07-29 01:35:01,124 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2020-07-29 01:35:01,124 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2020-07-29 01:35:01,124 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2020-07-29 01:35:01,125 INFO L129 ssoRankerPreferences]: Use exernal solver: true [2020-07-29 01:35:01,125 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:35:01,125 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2020-07-29 01:35:01,125 INFO L132 ssoRankerPreferences]: Path of dumped script: [2020-07-29 01:35:01,126 INFO L133 ssoRankerPreferences]: Filename of dumped script: bubblesort-alloca-1.i_Iteration2_Loop [2020-07-29 01:35:01,126 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2020-07-29 01:35:01,126 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2020-07-29 01:35:01,176 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 01:35:01,186 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 01:35:01,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 01:35:01,213 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 01:35:01,240 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 01:35:01,470 INFO L292 LassoAnalysis]: Preprocessing complete. [2020-07-29 01:35:01,470 INFO L404 LassoAnalysis]: Checking for nontermination... 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 01:35:01,487 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2020-07-29 01:35:01,487 INFO L160 nArgumentSynthesizer]: Using integer mode. Waiting until toolchain timeout for monitored process 2 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:35:01,499 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2020-07-29 01:35:01,500 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 3 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:35:01,542 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2020-07-29 01:35:01,543 INFO L160 nArgumentSynthesizer]: Using integer mode. [2020-07-29 01:35:01,547 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2020-07-29 01:35:01,548 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {v_rep~unnamed0~0~P_PID_1=1} Honda state: {v_rep~unnamed0~0~P_PID_1=1} Generalized eigenvectors: [] Lambdas: [] Nus: [] 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 01:35:01,591 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2020-07-29 01:35:01,591 INFO L160 nArgumentSynthesizer]: Using integer mode. Waiting until toolchain timeout for monitored process 4 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:35:01,596 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2020-07-29 01:35:01,596 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {v_rep~unnamed0~0~P_PGID_1=2} Honda state: {v_rep~unnamed0~0~P_PGID_1=2} Generalized eigenvectors: [] Lambdas: [] Nus: [] 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 01:35:01,640 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2020-07-29 01:35:01,640 INFO L160 nArgumentSynthesizer]: Using integer mode. Waiting until toolchain timeout for monitored process 5 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 No working directory specified, using /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 01:35:01,695 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2020-07-29 01:35:01,695 INFO L160 nArgumentSynthesizer]: Using integer mode. [2020-07-29 01:35:01,737 INFO L444 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2020-07-29 01:35:01,739 INFO L210 LassoAnalysis]: Preferences: [2020-07-29 01:35:01,739 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2020-07-29 01:35:01,739 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2020-07-29 01:35:01,740 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2020-07-29 01:35:01,740 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2020-07-29 01:35:01,740 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:35:01,740 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2020-07-29 01:35:01,740 INFO L132 ssoRankerPreferences]: Path of dumped script: [2020-07-29 01:35:01,741 INFO L133 ssoRankerPreferences]: Filename of dumped script: bubblesort-alloca-1.i_Iteration2_Loop [2020-07-29 01:35:01,741 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2020-07-29 01:35:01,741 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2020-07-29 01:35:01,753 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 01:35:01,758 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 01:35:01,771 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 01:35:01,777 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 01:35:01,783 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 01:35:01,960 INFO L292 LassoAnalysis]: Preprocessing complete. [2020-07-29 01:35:01,966 INFO L489 LassoAnalysis]: Using template 'affine'. 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) [2020-07-29 01:35:01,972 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 01:35:01,975 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 01:35:01,976 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-07-29 01:35:01,977 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 01:35:01,977 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 01:35:01,977 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 01:35:01,980 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-07-29 01:35:01,981 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. Waiting until toolchain timeout for monitored process 7 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:35:01,984 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 8 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2020-07-29 01:35:02,029 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 01:35:02,031 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 01:35:02,032 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-07-29 01:35:02,032 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 01:35:02,032 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 01:35:02,032 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 01:35:02,035 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-07-29 01:35:02,035 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. Waiting until toolchain timeout for monitored process 8 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:35:02,040 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2020-07-29 01:35:02,049 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2020-07-29 01:35:02,049 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 9 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2020-07-29 01:35:02,055 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2020-07-29 01:35:02,056 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2020-07-29 01:35:02,056 INFO L510 LassoAnalysis]: Proved termination. [2020-07-29 01:35:02,057 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 9 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:35:02,104 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2020-07-29 01:35:02,108 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 01:35:02,113 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:35:02,147 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 01:35:02,164 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:35:02,166 INFO L263 TraceCheckSpWp]: Trace formula consists of 37 conjuncts, 2 conjunts are in the unsatisfiable core [2020-07-29 01:35:02,174 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:35:02,175 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-29 01:35:02,187 INFO L280 TraceCheckUtils]: 0: Hoare triple {70#unseeded} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; {70#unseeded} is VALID [2020-07-29 01:35:02,188 INFO L280 TraceCheckUtils]: 1: Hoare triple {70#unseeded} havoc main_#res;havoc main_#t~nondet8, main_#t~malloc9.base, main_#t~malloc9.offset, main_~array_size~0, main_~numbers~0.base, main_~numbers~0.offset;main_~array_size~0 := main_#t~nondet8;havoc main_#t~nondet8; {70#unseeded} is VALID [2020-07-29 01:35:02,189 INFO L280 TraceCheckUtils]: 2: Hoare triple {70#unseeded} assume !(main_~array_size~0 < 1); {70#unseeded} is VALID [2020-07-29 01:35:02,190 INFO L280 TraceCheckUtils]: 3: Hoare triple {70#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;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; {70#unseeded} is VALID [2020-07-29 01:35:02,195 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:35:02,196 WARN L261 TraceCheckSpWp]: Trace formula consists of 8 conjuncts, 4 conjunts are in the unsatisfiable core [2020-07-29 01:35:02,201 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:35:02,202 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-29 01:35:02,223 INFO L280 TraceCheckUtils]: 0: Hoare triple {73#(>= oldRank0 (+ (* 2 ULTIMATE.start_bubbleSort_~i~0) 1))} assume !!(bubbleSort_~i~0 >= 0);bubbleSort_~j~0 := 1; {97#(and (<= 0 ULTIMATE.start_bubbleSort_~i~0) (<= (+ (* 2 ULTIMATE.start_bubbleSort_~i~0) 1) oldRank0))} is VALID [2020-07-29 01:35:02,224 INFO L280 TraceCheckUtils]: 1: Hoare triple {97#(and (<= 0 ULTIMATE.start_bubbleSort_~i~0) (<= (+ (* 2 ULTIMATE.start_bubbleSort_~i~0) 1) oldRank0))} assume !(bubbleSort_~j~0 <= bubbleSort_~i~0); {97#(and (<= 0 ULTIMATE.start_bubbleSort_~i~0) (<= (+ (* 2 ULTIMATE.start_bubbleSort_~i~0) 1) oldRank0))} is VALID [2020-07-29 01:35:02,225 INFO L280 TraceCheckUtils]: 2: Hoare triple {97#(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; {83#(or (and (> oldRank0 (+ (* 2 ULTIMATE.start_bubbleSort_~i~0) 1)) (>= oldRank0 0)) unseeded)} is VALID [2020-07-29 01:35:02,226 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 01:35:02,227 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2020-07-29 01:35:02,237 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 7 edges. 7 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-29 01:35:02,240 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 4 letters. Loop has 3 letters. [2020-07-29 01:35:02,241 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:35:02,245 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 01:35:02,246 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 9 states and 12 transitions. cyclomatic complexity: 4 Second operand 3 states. [2020-07-29 01:35:02,326 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 9 states and 12 transitions. cyclomatic complexity: 4. Second operand 3 states. Result 15 states and 22 transitions. Complement of second has 4 states. [2020-07-29 01:35:02,327 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 01:35:02,327 INFO L123 tractBuchiDifference]: Start testing correctness of buchiDifferenceNCSBLazy3 [2020-07-29 01:35:02,327 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 9 states and 12 transitions. cyclomatic complexity: 4 [2020-07-29 01:35:02,327 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 01:35:02,328 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 01:35:02,328 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 3 states. [2020-07-29 01:35:02,333 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2020-07-29 01:35:02,334 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 01:35:02,334 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 01:35:02,334 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 15 states and 22 transitions. [2020-07-29 01:35:02,335 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2020-07-29 01:35:02,336 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 01:35:02,336 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 01:35:02,338 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 9 states and 12 transitions. cyclomatic complexity: 4 [2020-07-29 01:35:02,340 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 5 examples of accepted words. [2020-07-29 01:35:02,340 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 3 states. [2020-07-29 01:35:02,342 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2020-07-29 01:35:02,343 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 1 examples of accepted words. [2020-07-29 01:35:02,343 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 15 states and 22 transitions. cyclomatic complexity: 9 [2020-07-29 01:35:02,344 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 3 examples of accepted words. [2020-07-29 01:35:02,345 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 9 states and 12 transitions. cyclomatic complexity: 4 Stem has 4 letters. Loop has 3 letters. [2020-07-29 01:35:02,345 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:35:02,345 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 4 letters. Loop has 3 letters. [2020-07-29 01:35:02,346 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:35:02,346 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 15 states and 22 transitions. cyclomatic complexity: 9 Stem has 4 letters. Loop has 3 letters. [2020-07-29 01:35:02,346 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:35:02,347 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 9 states and 12 transitions. cyclomatic complexity: 4 Stem has 1 letters. Loop has 2 letters. [2020-07-29 01:35:02,347 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:35:02,347 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 1 letters. Loop has 2 letters. [2020-07-29 01:35:02,347 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:35:02,348 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 15 states and 22 transitions. cyclomatic complexity: 9 Stem has 1 letters. Loop has 2 letters. [2020-07-29 01:35:02,348 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:35:02,348 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 9 states and 12 transitions. cyclomatic complexity: 4 Stem has 6 letters. Loop has 3 letters. [2020-07-29 01:35:02,349 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:35:02,349 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 6 letters. Loop has 3 letters. [2020-07-29 01:35:02,349 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:35:02,350 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 15 states and 22 transitions. cyclomatic complexity: 9 Stem has 6 letters. Loop has 3 letters. [2020-07-29 01:35:02,350 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:35:02,350 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 9 states and 12 transitions. cyclomatic complexity: 4 Stem has 15 letters. Loop has 15 letters. [2020-07-29 01:35:02,350 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:35:02,351 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 15 letters. Loop has 15 letters. [2020-07-29 01:35:02,351 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:35:02,351 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 15 states and 22 transitions. cyclomatic complexity: 9 Stem has 15 letters. Loop has 15 letters. [2020-07-29 01:35:02,352 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:35:02,352 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 9 states and 12 transitions. cyclomatic complexity: 4 Stem has 9 letters. Loop has 9 letters. [2020-07-29 01:35:02,352 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:35:02,352 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 9 letters. Loop has 9 letters. [2020-07-29 01:35:02,353 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:35:02,353 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 15 states and 22 transitions. cyclomatic complexity: 9 Stem has 9 letters. Loop has 9 letters. [2020-07-29 01:35:02,353 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:35:02,353 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 9 states and 12 transitions. cyclomatic complexity: 4 Stem has 3 letters. Loop has 3 letters. [2020-07-29 01:35:02,354 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:35:02,354 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 3 letters. Loop has 3 letters. [2020-07-29 01:35:02,354 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:35:02,354 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 15 states and 22 transitions. cyclomatic complexity: 9 Stem has 3 letters. Loop has 3 letters. [2020-07-29 01:35:02,355 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:35:02,355 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 9 states and 12 transitions. cyclomatic complexity: 4 Stem has 5 letters. Loop has 3 letters. [2020-07-29 01:35:02,355 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:35:02,356 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 5 letters. Loop has 3 letters. [2020-07-29 01:35:02,356 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:35:02,356 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 15 states and 22 transitions. cyclomatic complexity: 9 Stem has 5 letters. Loop has 3 letters. [2020-07-29 01:35:02,357 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:35:02,357 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 9 states and 12 transitions. cyclomatic complexity: 4 Stem has 6 letters. Loop has 3 letters. [2020-07-29 01:35:02,357 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:35:02,358 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 6 letters. Loop has 3 letters. [2020-07-29 01:35:02,358 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:35:02,358 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 15 states and 22 transitions. cyclomatic complexity: 9 Stem has 6 letters. Loop has 3 letters. [2020-07-29 01:35:02,359 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:35:02,359 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 9 states and 12 transitions. cyclomatic complexity: 4 Stem has 6 letters. Loop has 3 letters. [2020-07-29 01:35:02,359 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:35:02,359 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 6 letters. Loop has 3 letters. [2020-07-29 01:35:02,360 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:35:02,360 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 15 states and 22 transitions. cyclomatic complexity: 9 Stem has 6 letters. Loop has 3 letters. [2020-07-29 01:35:02,360 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:35:02,361 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 9 states and 12 transitions. cyclomatic complexity: 4 Stem has 4 letters. Loop has 3 letters. [2020-07-29 01:35:02,361 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:35:02,361 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 4 letters. Loop has 3 letters. [2020-07-29 01:35:02,362 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:35:02,362 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 15 states and 22 transitions. cyclomatic complexity: 9 Stem has 4 letters. Loop has 3 letters. [2020-07-29 01:35:02,362 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:35:02,363 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 9 states and 12 transitions. cyclomatic complexity: 4 Stem has 7 letters. Loop has 3 letters. [2020-07-29 01:35:02,363 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:35:02,363 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 7 letters. Loop has 3 letters. [2020-07-29 01:35:02,364 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:35:02,364 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 15 states and 22 transitions. cyclomatic complexity: 9 Stem has 7 letters. Loop has 3 letters. [2020-07-29 01:35:02,364 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:35:02,365 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 9 states and 12 transitions. cyclomatic complexity: 4 Stem has 1 letters. Loop has 2 letters. [2020-07-29 01:35:02,365 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:35:02,365 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 1 letters. Loop has 2 letters. [2020-07-29 01:35:02,365 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:35:02,366 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 15 states and 22 transitions. cyclomatic complexity: 9 Stem has 1 letters. Loop has 2 letters. [2020-07-29 01:35:02,366 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:35:02,366 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 9 states and 12 transitions. cyclomatic complexity: 4 Stem has 6 letters. Loop has 3 letters. [2020-07-29 01:35:02,367 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:35:02,367 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 6 letters. Loop has 3 letters. [2020-07-29 01:35:02,367 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:35:02,368 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 15 states and 22 transitions. cyclomatic complexity: 9 Stem has 6 letters. Loop has 3 letters. [2020-07-29 01:35:02,368 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:35:02,368 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 9 states and 12 transitions. cyclomatic complexity: 4 Stem has 7 letters. Loop has 3 letters. [2020-07-29 01:35:02,369 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:35:02,369 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 7 letters. Loop has 3 letters. [2020-07-29 01:35:02,369 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:35:02,369 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 15 states and 22 transitions. cyclomatic complexity: 9 Stem has 7 letters. Loop has 3 letters. [2020-07-29 01:35:02,370 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:35:02,370 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 9 states and 12 transitions. cyclomatic complexity: 4 Stem has 8 letters. Loop has 3 letters. [2020-07-29 01:35:02,370 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:35:02,371 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 8 letters. Loop has 3 letters. [2020-07-29 01:35:02,371 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:35:02,371 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 15 states and 22 transitions. cyclomatic complexity: 9 Stem has 8 letters. Loop has 3 letters. [2020-07-29 01:35:02,372 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:35:02,372 INFO L161 tractBuchiDifference]: Finished testing correctness of buchiDifferenceNCSBLazy3 [2020-07-29 01:35:02,373 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-07-29 01:35:02,375 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 12 transitions. [2020-07-29 01:35:02,375 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 12 transitions. Stem has 4 letters. Loop has 3 letters. [2020-07-29 01:35:02,375 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:35:02,376 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 12 transitions. Stem has 7 letters. Loop has 3 letters. [2020-07-29 01:35:02,376 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:35:02,376 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 12 transitions. Stem has 4 letters. Loop has 6 letters. [2020-07-29 01:35:02,377 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:35:02,377 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 15 states and 22 transitions. cyclomatic complexity: 9 [2020-07-29 01:35:02,379 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2020-07-29 01:35:02,381 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 15 states to 14 states and 20 transitions. [2020-07-29 01:35:02,381 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 8 [2020-07-29 01:35:02,381 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 9 [2020-07-29 01:35:02,382 INFO L73 IsDeterministic]: Start isDeterministic. Operand 14 states and 20 transitions. [2020-07-29 01:35:02,382 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2020-07-29 01:35:02,382 INFO L688 BuchiCegarLoop]: Abstraction has 14 states and 20 transitions. [2020-07-29 01:35:02,382 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14 states and 20 transitions. [2020-07-29 01:35:02,384 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14 to 13. [2020-07-29 01:35:02,384 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-29 01:35:02,384 INFO L82 GeneralOperation]: Start isEquivalent. First operand 14 states and 20 transitions. Second operand 13 states. [2020-07-29 01:35:02,384 INFO L74 IsIncluded]: Start isIncluded. First operand 14 states and 20 transitions. Second operand 13 states. [2020-07-29 01:35:02,385 INFO L87 Difference]: Start difference. First operand 14 states and 20 transitions. Second operand 13 states. [2020-07-29 01:35:02,385 INFO L149 Difference]: Subtrahend was not deterministic. Recomputing result with determinization. [2020-07-29 01:35:02,389 INFO L93 Difference]: Finished difference Result 14 states and 20 transitions. [2020-07-29 01:35:02,389 INFO L276 IsEmpty]: Start isEmpty. Operand 14 states and 20 transitions. [2020-07-29 01:35:02,390 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-29 01:35:02,390 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-29 01:35:02,390 INFO L74 IsIncluded]: Start isIncluded. First operand 13 states. Second operand 14 states and 20 transitions. [2020-07-29 01:35:02,391 INFO L87 Difference]: Start difference. First operand 13 states. Second operand 14 states and 20 transitions. [2020-07-29 01:35:02,391 INFO L149 Difference]: Subtrahend was not deterministic. Recomputing result with determinization. [2020-07-29 01:35:02,394 INFO L93 Difference]: Finished difference Result 15 states and 22 transitions. [2020-07-29 01:35:02,394 INFO L276 IsEmpty]: Start isEmpty. Operand 15 states and 22 transitions. [2020-07-29 01:35:02,394 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-29 01:35:02,395 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-29 01:35:02,395 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-29 01:35:02,395 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-29 01:35:02,395 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2020-07-29 01:35:02,397 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 19 transitions. [2020-07-29 01:35:02,397 INFO L711 BuchiCegarLoop]: Abstraction has 13 states and 19 transitions. [2020-07-29 01:35:02,397 INFO L591 BuchiCegarLoop]: Abstraction has 13 states and 19 transitions. [2020-07-29 01:35:02,398 INFO L424 BuchiCegarLoop]: ======== Iteration 3============ [2020-07-29 01:35:02,398 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 13 states and 19 transitions. [2020-07-29 01:35:02,399 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2020-07-29 01:35:02,399 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 01:35:02,399 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 01:35:02,400 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2020-07-29 01:35:02,400 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2020-07-29 01:35:02,400 INFO L794 eck$LassoCheckResult]: Stem: 133#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; 125#L-1 havoc main_#res;havoc main_#t~nondet8, main_#t~malloc9.base, main_#t~malloc9.offset, main_~array_size~0, main_~numbers~0.base, main_~numbers~0.offset;main_~array_size~0 := main_#t~nondet8;havoc main_#t~nondet8; 126#L562 assume !(main_~array_size~0 < 1); 137#L562-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;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; 134#L550-3 assume !!(bubbleSort_~i~0 >= 0);bubbleSort_~j~0 := 1; 127#L551-3 [2020-07-29 01:35:02,401 INFO L796 eck$LassoCheckResult]: Loop: 127#L551-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); 128#L552 assume bubbleSort_#t~mem4 > bubbleSort_#t~mem5;havoc bubbleSort_#t~mem5;havoc bubbleSort_#t~mem4;call bubbleSort_#t~mem6 := read~int(bubbleSort_~numbers.base, bubbleSort_~numbers.offset + 4 * (bubbleSort_~j~0 - 1), 4);bubbleSort_~temp~0 := bubbleSort_#t~mem6;havoc bubbleSort_#t~mem6;call bubbleSort_#t~mem7 := read~int(bubbleSort_~numbers.base, bubbleSort_~numbers.offset + 4 * bubbleSort_~j~0, 4);call write~int(bubbleSort_#t~mem7, bubbleSort_~numbers.base, bubbleSort_~numbers.offset + 4 * (bubbleSort_~j~0 - 1), 4);havoc bubbleSort_#t~mem7;call write~int(bubbleSort_~temp~0, bubbleSort_~numbers.base, bubbleSort_~numbers.offset + 4 * bubbleSort_~j~0, 4); 135#L551-2 bubbleSort_#t~post3 := bubbleSort_~j~0;bubbleSort_~j~0 := 1 + bubbleSort_#t~post3;havoc bubbleSort_#t~post3; 127#L551-3 [2020-07-29 01:35:02,401 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 01:35:02,401 INFO L82 PathProgramCache]: Analyzing trace with hash 28695756, now seen corresponding path program 1 times [2020-07-29 01:35:02,402 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 01:35:02,402 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [867624733] [2020-07-29 01:35:02,402 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 01:35:02,414 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 01:35:02,414 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 01:35:02,426 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 01:35:02,427 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 01:35:02,431 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-07-29 01:35:02,432 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 01:35:02,432 INFO L82 PathProgramCache]: Analyzing trace with hash 54716, now seen corresponding path program 1 times [2020-07-29 01:35:02,432 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 01:35:02,433 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1800442793] [2020-07-29 01:35:02,433 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 01:35:02,446 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 01:35:02,447 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 01:35:02,457 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 01:35:02,458 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 01:35:02,461 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-07-29 01:35:02,462 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 01:35:02,462 INFO L82 PathProgramCache]: Analyzing trace with hash 176800017, now seen corresponding path program 1 times [2020-07-29 01:35:02,463 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 01:35:02,463 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2020152297] [2020-07-29 01:35:02,463 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 01:35:02,484 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 01:35:02,485 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 01:35:02,504 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 01:35:02,505 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 01:35:02,512 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-07-29 01:35:02,799 WARN L193 SmtUtils]: Spent 129.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 54 [2020-07-29 01:35:02,894 INFO L210 LassoAnalysis]: Preferences: [2020-07-29 01:35:02,894 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2020-07-29 01:35:02,894 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2020-07-29 01:35:02,895 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2020-07-29 01:35:02,895 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2020-07-29 01:35:02,895 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:35:02,895 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2020-07-29 01:35:02,895 INFO L132 ssoRankerPreferences]: Path of dumped script: [2020-07-29 01:35:02,896 INFO L133 ssoRankerPreferences]: Filename of dumped script: bubblesort-alloca-1.i_Iteration3_Lasso [2020-07-29 01:35:02,896 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2020-07-29 01:35:02,896 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2020-07-29 01:35:02,926 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 01:35:02,930 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 01:35:02,934 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 01:35:02,938 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 01:35:02,944 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 01:35:02,948 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 01:35:02,953 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 01:35:03,123 WARN L193 SmtUtils]: Spent 115.00 ms on a formula simplification. DAG size of input: 47 DAG size of output: 44 [2020-07-29 01:35:03,257 WARN L193 SmtUtils]: Spent 110.00 ms on a formula simplification. DAG size of input: 36 DAG size of output: 30 [2020-07-29 01:35:03,264 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 01:35:03,269 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 01:35:03,273 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 01:35:03,278 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 01:35:03,287 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 01:35:03,291 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 01:35:03,294 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 01:35:03,859 INFO L292 LassoAnalysis]: Preprocessing complete. [2020-07-29 01:35:03,860 INFO L489 LassoAnalysis]: Using template 'affine'. 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) Waiting until toolchain timeout for monitored process 10 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:35:03,866 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 01:35:03,868 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 01:35:03,869 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-07-29 01:35:03,869 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 01:35:03,869 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 01:35:03,869 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 01:35:03,870 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-07-29 01:35:03,871 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-07-29 01:35:03,872 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 11 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 11 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:35:03,908 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 01:35:03,910 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 01:35:03,910 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-07-29 01:35:03,910 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 01:35:03,910 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 01:35:03,910 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 01:35:03,911 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-07-29 01:35:03,911 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-07-29 01:35:03,912 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 12 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 12 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:35:03,935 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-07-29 01:35:03,937 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 01:35:03,937 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-07-29 01:35:03,937 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 01:35:03,937 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 01:35:03,937 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 01:35:03,938 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-07-29 01:35:03,938 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-07-29 01:35:03,943 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 13 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 13 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:35:03,965 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 01:35:03,966 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 01:35:03,966 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 01:35:03,967 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 01:35:03,967 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 01:35:03,970 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-07-29 01:35:03,970 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-07-29 01:35:03,974 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 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 01:35:03,996 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 01:35:03,997 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 01:35:03,997 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-07-29 01:35:03,997 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 01:35:03,998 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 01:35:03,998 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 01:35:03,998 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-07-29 01:35:03,999 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-07-29 01:35:04,001 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) Waiting until toolchain timeout for monitored process 15 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:35:04,026 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 01:35:04,028 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 01:35:04,028 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 01:35:04,028 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 01:35:04,028 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 01:35:04,031 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-07-29 01:35:04,031 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-07-29 01:35:04,038 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) Waiting until toolchain timeout for monitored process 16 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:35:04,067 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 01:35:04,070 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 01:35:04,070 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 01:35:04,070 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 01:35:04,070 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 01:35:04,076 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-07-29 01:35:04,076 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-07-29 01:35:04,085 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 17 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 17 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:35:04,110 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 01:35:04,112 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 01:35:04,113 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 01:35:04,113 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 01:35:04,113 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 01:35:04,133 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-07-29 01:35:04,134 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-07-29 01:35:04,159 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2020-07-29 01:35:04,212 INFO L443 ModelExtractionUtils]: Simplification made 14 calls to the SMT solver. [2020-07-29 01:35:04,212 INFO L444 ModelExtractionUtils]: 24 out of 37 variables were initially zero. Simplification set additionally 9 variables to zero. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 18 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2020-07-29 01:35:04,219 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... Waiting until toolchain timeout for monitored process 18 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:35:04,225 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2020-07-29 01:35:04,226 INFO L510 LassoAnalysis]: Proved termination. [2020-07-29 01:35:04,226 INFO L512 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_bubbleSort_~numbers.offset, ULTIMATE.start_bubbleSort_~j~0, v_rep(select #length ULTIMATE.start_bubbleSort_~numbers.base)_1) = -1*ULTIMATE.start_bubbleSort_~numbers.offset - 4*ULTIMATE.start_bubbleSort_~j~0 + 2*v_rep(select #length ULTIMATE.start_bubbleSort_~numbers.base)_1 Supporting invariants [] [2020-07-29 01:35:04,284 INFO L297 tatePredicateManager]: 4 out of 4 supporting invariants were superfluous and have been removed [2020-07-29 01:35:04,290 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~mem5;havoc bubbleSort_#t~mem4;call bubbleSort_#t~mem6 := read~int(bubbleSort_~numbers.base, bubbleSort_~numbers.offset + 4 * (bubbleSort_~j~0 - 1), 4);bubbleSort_~temp~0 := bubbleSort_#t~mem6;havoc bubbleSort_#t~mem6;call bubbleSort_#t~mem7 := read~int(bubbleSort_~numbers.base, bubbleSort_~numbers.offset + 4 * bubbleSort_~j~0, 4);call write~int(bubbleSort_#t~mem7, bubbleSort_~numbers.base, bubbleSort_~numbers.offset + 4 * (bubbleSort_~j~0 - 1), 4);havoc bubbleSort_#t~mem7;call write~int(bubbleSort_~temp~0, bubbleSort_~numbers.base, bubbleSort_~numbers.offset + 4 * bubbleSort_~j~0, 4);" "bubbleSort_#t~post3 := bubbleSort_~j~0;bubbleSort_~j~0 := 1 + bubbleSort_#t~post3;havoc bubbleSort_#t~post3;" [2020-07-29 01:35:04,297 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:35:04,299 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-29 01:35:04,320 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 01:35:04,337 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:35:04,338 INFO L263 TraceCheckSpWp]: Trace formula consists of 40 conjuncts, 2 conjunts are in the unsatisfiable core [2020-07-29 01:35:04,344 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:35:04,345 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-29 01:35:04,354 INFO L280 TraceCheckUtils]: 0: Hoare triple {211#unseeded} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; {211#unseeded} is VALID [2020-07-29 01:35:04,355 INFO L280 TraceCheckUtils]: 1: Hoare triple {211#unseeded} havoc main_#res;havoc main_#t~nondet8, main_#t~malloc9.base, main_#t~malloc9.offset, main_~array_size~0, main_~numbers~0.base, main_~numbers~0.offset;main_~array_size~0 := main_#t~nondet8;havoc main_#t~nondet8; {211#unseeded} is VALID [2020-07-29 01:35:04,356 INFO L280 TraceCheckUtils]: 2: Hoare triple {211#unseeded} assume !(main_~array_size~0 < 1); {211#unseeded} is VALID [2020-07-29 01:35:04,357 INFO L280 TraceCheckUtils]: 3: Hoare triple {211#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;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; {211#unseeded} is VALID [2020-07-29 01:35:04,357 INFO L280 TraceCheckUtils]: 4: Hoare triple {211#unseeded} assume !!(bubbleSort_~i~0 >= 0);bubbleSort_~j~0 := 1; {211#unseeded} is VALID [2020-07-29 01:35:04,374 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:35:04,375 INFO L263 TraceCheckSpWp]: Trace formula consists of 25 conjuncts, 5 conjunts are in the unsatisfiable core [2020-07-29 01:35:04,381 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:35:04,381 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-29 01:35:04,425 INFO L280 TraceCheckUtils]: 0: Hoare triple {214#(>= oldRank0 (+ (* (- 1) ULTIMATE.start_bubbleSort_~numbers.offset) (* (- 4) ULTIMATE.start_bubbleSort_~j~0) (* 2 (select |#length| ULTIMATE.start_bubbleSort_~numbers.base))))} 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); {261#(and (<= (* 2 (select |#length| ULTIMATE.start_bubbleSort_~numbers.base)) (+ ULTIMATE.start_bubbleSort_~numbers.offset (* 4 ULTIMATE.start_bubbleSort_~j~0) oldRank0)) (<= 4 (+ ULTIMATE.start_bubbleSort_~numbers.offset (* 4 ULTIMATE.start_bubbleSort_~j~0))) (<= (+ ULTIMATE.start_bubbleSort_~numbers.offset (* 4 ULTIMATE.start_bubbleSort_~j~0) 4) (select |#length| ULTIMATE.start_bubbleSort_~numbers.base)))} is VALID [2020-07-29 01:35:04,427 INFO L280 TraceCheckUtils]: 1: Hoare triple {261#(and (<= (* 2 (select |#length| ULTIMATE.start_bubbleSort_~numbers.base)) (+ ULTIMATE.start_bubbleSort_~numbers.offset (* 4 ULTIMATE.start_bubbleSort_~j~0) oldRank0)) (<= 4 (+ ULTIMATE.start_bubbleSort_~numbers.offset (* 4 ULTIMATE.start_bubbleSort_~j~0))) (<= (+ ULTIMATE.start_bubbleSort_~numbers.offset (* 4 ULTIMATE.start_bubbleSort_~j~0) 4) (select |#length| ULTIMATE.start_bubbleSort_~numbers.base)))} assume bubbleSort_#t~mem4 > bubbleSort_#t~mem5;havoc bubbleSort_#t~mem5;havoc bubbleSort_#t~mem4;call bubbleSort_#t~mem6 := read~int(bubbleSort_~numbers.base, bubbleSort_~numbers.offset + 4 * (bubbleSort_~j~0 - 1), 4);bubbleSort_~temp~0 := bubbleSort_#t~mem6;havoc bubbleSort_#t~mem6;call bubbleSort_#t~mem7 := read~int(bubbleSort_~numbers.base, bubbleSort_~numbers.offset + 4 * bubbleSort_~j~0, 4);call write~int(bubbleSort_#t~mem7, bubbleSort_~numbers.base, bubbleSort_~numbers.offset + 4 * (bubbleSort_~j~0 - 1), 4);havoc bubbleSort_#t~mem7;call write~int(bubbleSort_~temp~0, bubbleSort_~numbers.base, bubbleSort_~numbers.offset + 4 * bubbleSort_~j~0, 4); {261#(and (<= (* 2 (select |#length| ULTIMATE.start_bubbleSort_~numbers.base)) (+ ULTIMATE.start_bubbleSort_~numbers.offset (* 4 ULTIMATE.start_bubbleSort_~j~0) oldRank0)) (<= 4 (+ ULTIMATE.start_bubbleSort_~numbers.offset (* 4 ULTIMATE.start_bubbleSort_~j~0))) (<= (+ ULTIMATE.start_bubbleSort_~numbers.offset (* 4 ULTIMATE.start_bubbleSort_~j~0) 4) (select |#length| ULTIMATE.start_bubbleSort_~numbers.base)))} is VALID [2020-07-29 01:35:04,429 INFO L280 TraceCheckUtils]: 2: Hoare triple {261#(and (<= (* 2 (select |#length| ULTIMATE.start_bubbleSort_~numbers.base)) (+ ULTIMATE.start_bubbleSort_~numbers.offset (* 4 ULTIMATE.start_bubbleSort_~j~0) oldRank0)) (<= 4 (+ ULTIMATE.start_bubbleSort_~numbers.offset (* 4 ULTIMATE.start_bubbleSort_~j~0))) (<= (+ ULTIMATE.start_bubbleSort_~numbers.offset (* 4 ULTIMATE.start_bubbleSort_~j~0) 4) (select |#length| ULTIMATE.start_bubbleSort_~numbers.base)))} bubbleSort_#t~post3 := bubbleSort_~j~0;bubbleSort_~j~0 := 1 + bubbleSort_#t~post3;havoc bubbleSort_#t~post3; {244#(or (and (> oldRank0 (+ (* (- 1) ULTIMATE.start_bubbleSort_~numbers.offset) (* (- 4) ULTIMATE.start_bubbleSort_~j~0) (* 2 (select |#length| ULTIMATE.start_bubbleSort_~numbers.base)))) (>= oldRank0 0)) unseeded)} is VALID [2020-07-29 01:35:04,429 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 01:35:04,429 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2020-07-29 01:35:04,441 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 8 edges. 8 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-29 01:35:04,441 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 5 letters. Loop has 3 letters. [2020-07-29 01:35:04,441 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:35:04,442 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 01:35:04,442 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 13 states and 19 transitions. cyclomatic complexity: 8 Second operand 3 states. [2020-07-29 01:35:04,521 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 13 states and 19 transitions. cyclomatic complexity: 8. Second operand 3 states. Result 28 states and 41 transitions. Complement of second has 7 states. [2020-07-29 01:35:04,521 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 01:35:04,521 INFO L123 tractBuchiDifference]: Start testing correctness of buchiDifferenceNCSBLazy3 [2020-07-29 01:35:04,521 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 13 states and 19 transitions. cyclomatic complexity: 8 [2020-07-29 01:35:04,521 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 01:35:04,522 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 01:35:04,522 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 3 states. [2020-07-29 01:35:04,523 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2020-07-29 01:35:04,525 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 01:35:04,525 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 01:35:04,525 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 28 states and 41 transitions. [2020-07-29 01:35:04,527 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2020-07-29 01:35:04,527 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 01:35:04,527 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 01:35:04,528 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 13 states and 19 transitions. cyclomatic complexity: 8 [2020-07-29 01:35:04,530 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 3 examples of accepted words. [2020-07-29 01:35:04,531 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 3 states. [2020-07-29 01:35:04,532 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2020-07-29 01:35:04,533 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 1 examples of accepted words. [2020-07-29 01:35:04,533 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 28 states and 41 transitions. cyclomatic complexity: 17 [2020-07-29 01:35:04,535 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 3 examples of accepted words. [2020-07-29 01:35:04,536 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 13 states and 19 transitions. cyclomatic complexity: 8 Stem has 5 letters. Loop has 3 letters. [2020-07-29 01:35:04,536 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:35:04,536 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 5 letters. Loop has 3 letters. [2020-07-29 01:35:04,538 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:35:04,538 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 28 states and 41 transitions. cyclomatic complexity: 17 Stem has 5 letters. Loop has 3 letters. [2020-07-29 01:35:04,538 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:35:04,539 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 13 states and 19 transitions. cyclomatic complexity: 8 Stem has 1 letters. Loop has 2 letters. [2020-07-29 01:35:04,539 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:35:04,539 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 1 letters. Loop has 2 letters. [2020-07-29 01:35:04,539 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:35:04,539 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 28 states and 41 transitions. cyclomatic complexity: 17 Stem has 1 letters. Loop has 2 letters. [2020-07-29 01:35:04,539 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:35:04,539 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 13 states and 19 transitions. cyclomatic complexity: 8 Stem has 8 letters. Loop has 3 letters. [2020-07-29 01:35:04,540 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:35:04,540 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 8 letters. Loop has 3 letters. [2020-07-29 01:35:04,540 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:35:04,540 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 28 states and 41 transitions. cyclomatic complexity: 17 Stem has 8 letters. Loop has 3 letters. [2020-07-29 01:35:04,541 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:35:04,541 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 13 states and 19 transitions. cyclomatic complexity: 8 Stem has 28 letters. Loop has 28 letters. [2020-07-29 01:35:04,541 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:35:04,541 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 28 letters. Loop has 28 letters. [2020-07-29 01:35:04,542 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:35:04,542 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 28 states and 41 transitions. cyclomatic complexity: 17 Stem has 28 letters. Loop has 28 letters. [2020-07-29 01:35:04,542 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:35:04,543 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 13 states and 19 transitions. cyclomatic complexity: 8 Stem has 13 letters. Loop has 13 letters. [2020-07-29 01:35:04,543 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:35:04,543 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 13 letters. Loop has 13 letters. [2020-07-29 01:35:04,543 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:35:04,543 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 28 states and 41 transitions. cyclomatic complexity: 17 Stem has 13 letters. Loop has 13 letters. [2020-07-29 01:35:04,543 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:35:04,543 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 13 states and 19 transitions. cyclomatic complexity: 8 Stem has 4 letters. Loop has 4 letters. [2020-07-29 01:35:04,544 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:35:04,544 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 4 letters. Loop has 4 letters. [2020-07-29 01:35:04,544 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:35:04,544 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 28 states and 41 transitions. cyclomatic complexity: 17 Stem has 4 letters. Loop has 4 letters. [2020-07-29 01:35:04,544 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:35:04,544 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 13 states and 19 transitions. cyclomatic complexity: 8 Stem has 6 letters. Loop has 3 letters. [2020-07-29 01:35:04,545 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:35:04,545 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 6 letters. Loop has 3 letters. [2020-07-29 01:35:04,545 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:35:04,545 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 28 states and 41 transitions. cyclomatic complexity: 17 Stem has 6 letters. Loop has 3 letters. [2020-07-29 01:35:04,546 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:35:04,546 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 13 states and 19 transitions. cyclomatic complexity: 8 Stem has 7 letters. Loop has 3 letters. [2020-07-29 01:35:04,546 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:35:04,546 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 7 letters. Loop has 3 letters. [2020-07-29 01:35:04,547 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:35:04,547 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 28 states and 41 transitions. cyclomatic complexity: 17 Stem has 7 letters. Loop has 3 letters. [2020-07-29 01:35:04,547 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:35:04,547 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 13 states and 19 transitions. cyclomatic complexity: 8 Stem has 5 letters. Loop has 3 letters. [2020-07-29 01:35:04,548 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:35:04,548 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 5 letters. Loop has 3 letters. [2020-07-29 01:35:04,549 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:35:04,550 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 28 states and 41 transitions. cyclomatic complexity: 17 Stem has 5 letters. Loop has 3 letters. [2020-07-29 01:35:04,550 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:35:04,550 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 13 states and 19 transitions. cyclomatic complexity: 8 Stem has 1 letters. Loop has 2 letters. [2020-07-29 01:35:04,550 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:35:04,550 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 1 letters. Loop has 2 letters. [2020-07-29 01:35:04,551 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:35:04,551 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 28 states and 41 transitions. cyclomatic complexity: 17 Stem has 1 letters. Loop has 2 letters. [2020-07-29 01:35:04,551 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:35:04,551 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 13 states and 19 transitions. cyclomatic complexity: 8 Stem has 10 letters. Loop has 3 letters. [2020-07-29 01:35:04,551 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:35:04,552 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 10 letters. Loop has 3 letters. [2020-07-29 01:35:04,552 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:35:04,553 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 28 states and 41 transitions. cyclomatic complexity: 17 Stem has 10 letters. Loop has 3 letters. [2020-07-29 01:35:04,553 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:35:04,553 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 13 states and 19 transitions. cyclomatic complexity: 8 Stem has 8 letters. Loop has 3 letters. [2020-07-29 01:35:04,553 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:35:04,554 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 8 letters. Loop has 3 letters. [2020-07-29 01:35:04,555 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:35:04,555 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 28 states and 41 transitions. cyclomatic complexity: 17 Stem has 8 letters. Loop has 3 letters. [2020-07-29 01:35:04,555 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:35:04,555 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 13 states and 19 transitions. cyclomatic complexity: 8 Stem has 9 letters. Loop has 3 letters. [2020-07-29 01:35:04,555 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:35:04,556 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 9 letters. Loop has 3 letters. [2020-07-29 01:35:04,556 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:35:04,556 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 28 states and 41 transitions. cyclomatic complexity: 17 Stem has 9 letters. Loop has 3 letters. [2020-07-29 01:35:04,556 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:35:04,556 INFO L161 tractBuchiDifference]: Finished testing correctness of buchiDifferenceNCSBLazy3 [2020-07-29 01:35:04,556 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-07-29 01:35:04,557 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 12 transitions. [2020-07-29 01:35:04,559 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 12 transitions. Stem has 5 letters. Loop has 3 letters. [2020-07-29 01:35:04,559 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:35:04,559 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 12 transitions. Stem has 8 letters. Loop has 3 letters. [2020-07-29 01:35:04,559 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:35:04,559 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 12 transitions. Stem has 5 letters. Loop has 6 letters. [2020-07-29 01:35:04,559 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:35:04,560 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 28 states and 41 transitions. cyclomatic complexity: 17 [2020-07-29 01:35:04,575 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2020-07-29 01:35:04,578 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 28 states to 18 states and 26 transitions. [2020-07-29 01:35:04,578 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 8 [2020-07-29 01:35:04,579 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 8 [2020-07-29 01:35:04,579 INFO L73 IsDeterministic]: Start isDeterministic. Operand 18 states and 26 transitions. [2020-07-29 01:35:04,579 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2020-07-29 01:35:04,579 INFO L688 BuchiCegarLoop]: Abstraction has 18 states and 26 transitions. [2020-07-29 01:35:04,579 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18 states and 26 transitions. [2020-07-29 01:35:04,580 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18 to 13. [2020-07-29 01:35:04,581 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-29 01:35:04,581 INFO L82 GeneralOperation]: Start isEquivalent. First operand 18 states and 26 transitions. Second operand 13 states. [2020-07-29 01:35:04,581 INFO L74 IsIncluded]: Start isIncluded. First operand 18 states and 26 transitions. Second operand 13 states. [2020-07-29 01:35:04,581 INFO L87 Difference]: Start difference. First operand 18 states and 26 transitions. Second operand 13 states. [2020-07-29 01:35:04,582 INFO L149 Difference]: Subtrahend was not deterministic. Recomputing result with determinization. [2020-07-29 01:35:04,584 INFO L93 Difference]: Finished difference Result 18 states and 26 transitions. [2020-07-29 01:35:04,585 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 26 transitions. [2020-07-29 01:35:04,586 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-29 01:35:04,586 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-29 01:35:04,586 INFO L74 IsIncluded]: Start isIncluded. First operand 13 states. Second operand 18 states and 26 transitions. [2020-07-29 01:35:04,586 INFO L87 Difference]: Start difference. First operand 13 states. Second operand 18 states and 26 transitions. [2020-07-29 01:35:04,588 INFO L149 Difference]: Subtrahend was not deterministic. Recomputing result with determinization. [2020-07-29 01:35:04,591 INFO L93 Difference]: Finished difference Result 18 states and 26 transitions. [2020-07-29 01:35:04,592 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 26 transitions. [2020-07-29 01:35:04,592 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-29 01:35:04,592 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-29 01:35:04,592 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-29 01:35:04,592 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-29 01:35:04,592 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2020-07-29 01:35:04,594 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 18 transitions. [2020-07-29 01:35:04,594 INFO L711 BuchiCegarLoop]: Abstraction has 13 states and 18 transitions. [2020-07-29 01:35:04,594 INFO L591 BuchiCegarLoop]: Abstraction has 13 states and 18 transitions. [2020-07-29 01:35:04,594 INFO L424 BuchiCegarLoop]: ======== Iteration 4============ [2020-07-29 01:35:04,594 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 13 states and 18 transitions. [2020-07-29 01:35:04,595 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2020-07-29 01:35:04,595 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 01:35:04,595 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 01:35:04,596 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [2, 1, 1, 1, 1, 1, 1] [2020-07-29 01:35:04,596 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2020-07-29 01:35:04,596 INFO L794 eck$LassoCheckResult]: Stem: 315#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; 311#L-1 havoc main_#res;havoc main_#t~nondet8, main_#t~malloc9.base, main_#t~malloc9.offset, main_~array_size~0, main_~numbers~0.base, main_~numbers~0.offset;main_~array_size~0 := main_#t~nondet8;havoc main_#t~nondet8; 312#L562 assume !(main_~array_size~0 < 1); 318#L562-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;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; 314#L550-3 assume !!(bubbleSort_~i~0 >= 0);bubbleSort_~j~0 := 1; 308#L551-3 assume !(bubbleSort_~j~0 <= bubbleSort_~i~0); 309#L550-2 bubbleSort_#t~post2 := bubbleSort_~i~0;bubbleSort_~i~0 := bubbleSort_#t~post2 - 1;havoc bubbleSort_#t~post2; 313#L550-3 assume !!(bubbleSort_~i~0 >= 0);bubbleSort_~j~0 := 1; 306#L551-3 [2020-07-29 01:35:04,596 INFO L796 eck$LassoCheckResult]: Loop: 306#L551-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); 307#L552 assume bubbleSort_#t~mem4 > bubbleSort_#t~mem5;havoc bubbleSort_#t~mem5;havoc bubbleSort_#t~mem4;call bubbleSort_#t~mem6 := read~int(bubbleSort_~numbers.base, bubbleSort_~numbers.offset + 4 * (bubbleSort_~j~0 - 1), 4);bubbleSort_~temp~0 := bubbleSort_#t~mem6;havoc bubbleSort_#t~mem6;call bubbleSort_#t~mem7 := read~int(bubbleSort_~numbers.base, bubbleSort_~numbers.offset + 4 * bubbleSort_~j~0, 4);call write~int(bubbleSort_#t~mem7, bubbleSort_~numbers.base, bubbleSort_~numbers.offset + 4 * (bubbleSort_~j~0 - 1), 4);havoc bubbleSort_#t~mem7;call write~int(bubbleSort_~temp~0, bubbleSort_~numbers.base, bubbleSort_~numbers.offset + 4 * bubbleSort_~j~0, 4); 316#L551-2 bubbleSort_#t~post3 := bubbleSort_~j~0;bubbleSort_~j~0 := 1 + bubbleSort_#t~post3;havoc bubbleSort_#t~post3; 306#L551-3 [2020-07-29 01:35:04,597 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 01:35:04,597 INFO L82 PathProgramCache]: Analyzing trace with hash 176798328, now seen corresponding path program 2 times [2020-07-29 01:35:04,597 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 01:35:04,598 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [496033911] [2020-07-29 01:35:04,598 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 01:35:04,632 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:35:04,691 INFO L280 TraceCheckUtils]: 0: Hoare triple {410#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; {410#true} is VALID [2020-07-29 01:35:04,692 INFO L280 TraceCheckUtils]: 1: Hoare triple {410#true} havoc main_#res;havoc main_#t~nondet8, main_#t~malloc9.base, main_#t~malloc9.offset, main_~array_size~0, main_~numbers~0.base, main_~numbers~0.offset;main_~array_size~0 := main_#t~nondet8;havoc main_#t~nondet8; {410#true} is VALID [2020-07-29 01:35:04,692 INFO L280 TraceCheckUtils]: 2: Hoare triple {410#true} assume !(main_~array_size~0 < 1); {410#true} is VALID [2020-07-29 01:35:04,692 INFO L280 TraceCheckUtils]: 3: Hoare triple {410#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;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; {410#true} is VALID [2020-07-29 01:35:04,693 INFO L280 TraceCheckUtils]: 4: Hoare triple {410#true} assume !!(bubbleSort_~i~0 >= 0);bubbleSort_~j~0 := 1; {412#(= ULTIMATE.start_bubbleSort_~j~0 1)} is VALID [2020-07-29 01:35:04,694 INFO L280 TraceCheckUtils]: 5: Hoare triple {412#(= ULTIMATE.start_bubbleSort_~j~0 1)} assume !(bubbleSort_~j~0 <= bubbleSort_~i~0); {413#(<= ULTIMATE.start_bubbleSort_~i~0 0)} is VALID [2020-07-29 01:35:04,695 INFO L280 TraceCheckUtils]: 6: Hoare triple {413#(<= ULTIMATE.start_bubbleSort_~i~0 0)} bubbleSort_#t~post2 := bubbleSort_~i~0;bubbleSort_~i~0 := bubbleSort_#t~post2 - 1;havoc bubbleSort_#t~post2; {414#(<= (+ ULTIMATE.start_bubbleSort_~i~0 1) 0)} is VALID [2020-07-29 01:35:04,696 INFO L280 TraceCheckUtils]: 7: Hoare triple {414#(<= (+ ULTIMATE.start_bubbleSort_~i~0 1) 0)} assume !!(bubbleSort_~i~0 >= 0);bubbleSort_~j~0 := 1; {411#false} is VALID [2020-07-29 01:35:04,696 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-29 01:35:04,697 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [496033911] [2020-07-29 01:35:04,697 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-29 01:35:04,697 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-07-29 01:35:04,697 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [382955347] [2020-07-29 01:35:04,698 INFO L799 eck$LassoCheckResult]: stem already infeasible [2020-07-29 01:35:04,698 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 01:35:04,698 INFO L82 PathProgramCache]: Analyzing trace with hash 54716, now seen corresponding path program 2 times [2020-07-29 01:35:04,698 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 01:35:04,699 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [143139328] [2020-07-29 01:35:04,699 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 01:35:04,706 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 01:35:04,706 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 01:35:04,711 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 01:35:04,712 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 01:35:04,714 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-07-29 01:35:04,820 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-29 01:35:04,820 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-07-29 01:35:04,820 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2020-07-29 01:35:04,821 INFO L87 Difference]: Start difference. First operand 13 states and 18 transitions. cyclomatic complexity: 7 Second operand 5 states. [2020-07-29 01:35:04,919 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-29 01:35:04,919 INFO L93 Difference]: Finished difference Result 21 states and 28 transitions. [2020-07-29 01:35:04,919 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-07-29 01:35:04,919 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states. [2020-07-29 01:35:04,930 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 8 edges. 8 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-29 01:35:04,931 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 21 states and 28 transitions. [2020-07-29 01:35:04,932 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2020-07-29 01:35:04,933 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 21 states to 19 states and 26 transitions. [2020-07-29 01:35:04,933 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 11 [2020-07-29 01:35:04,934 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 11 [2020-07-29 01:35:04,934 INFO L73 IsDeterministic]: Start isDeterministic. Operand 19 states and 26 transitions. [2020-07-29 01:35:04,934 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2020-07-29 01:35:04,934 INFO L688 BuchiCegarLoop]: Abstraction has 19 states and 26 transitions. [2020-07-29 01:35:04,934 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19 states and 26 transitions. [2020-07-29 01:35:04,935 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19 to 14. [2020-07-29 01:35:04,936 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-29 01:35:04,936 INFO L82 GeneralOperation]: Start isEquivalent. First operand 19 states and 26 transitions. Second operand 14 states. [2020-07-29 01:35:04,936 INFO L74 IsIncluded]: Start isIncluded. First operand 19 states and 26 transitions. Second operand 14 states. [2020-07-29 01:35:04,936 INFO L87 Difference]: Start difference. First operand 19 states and 26 transitions. Second operand 14 states. [2020-07-29 01:35:04,937 INFO L149 Difference]: Subtrahend was not deterministic. Recomputing result with determinization. [2020-07-29 01:35:04,939 INFO L93 Difference]: Finished difference Result 25 states and 35 transitions. [2020-07-29 01:35:04,939 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 35 transitions. [2020-07-29 01:35:04,939 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-29 01:35:04,939 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-29 01:35:04,940 INFO L74 IsIncluded]: Start isIncluded. First operand 14 states. Second operand 19 states and 26 transitions. [2020-07-29 01:35:04,940 INFO L87 Difference]: Start difference. First operand 14 states. Second operand 19 states and 26 transitions. [2020-07-29 01:35:04,941 INFO L149 Difference]: Subtrahend was not deterministic. Recomputing result with determinization. [2020-07-29 01:35:04,943 INFO L93 Difference]: Finished difference Result 25 states and 35 transitions. [2020-07-29 01:35:04,943 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 35 transitions. [2020-07-29 01:35:04,943 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-29 01:35:04,943 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-29 01:35:04,944 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-29 01:35:04,944 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-29 01:35:04,944 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2020-07-29 01:35:04,945 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 19 transitions. [2020-07-29 01:35:04,945 INFO L711 BuchiCegarLoop]: Abstraction has 14 states and 19 transitions. [2020-07-29 01:35:04,945 INFO L591 BuchiCegarLoop]: Abstraction has 14 states and 19 transitions. [2020-07-29 01:35:04,945 INFO L424 BuchiCegarLoop]: ======== Iteration 5============ [2020-07-29 01:35:04,945 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 14 states and 19 transitions. [2020-07-29 01:35:04,946 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2020-07-29 01:35:04,946 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 01:35:04,946 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 01:35:04,946 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-29 01:35:04,946 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2020-07-29 01:35:04,947 INFO L794 eck$LassoCheckResult]: Stem: 450#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; 442#L-1 havoc main_#res;havoc main_#t~nondet8, main_#t~malloc9.base, main_#t~malloc9.offset, main_~array_size~0, main_~numbers~0.base, main_~numbers~0.offset;main_~array_size~0 := main_#t~nondet8;havoc main_#t~nondet8; 443#L562 assume !(main_~array_size~0 < 1); 454#L562-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;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; 451#L550-3 assume !!(bubbleSort_~i~0 >= 0);bubbleSort_~j~0 := 1; 446#L551-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); 447#L552 assume !(bubbleSort_#t~mem4 > bubbleSort_#t~mem5);havoc bubbleSort_#t~mem5;havoc bubbleSort_#t~mem4; 453#L551-2 bubbleSort_#t~post3 := bubbleSort_~j~0;bubbleSort_~j~0 := 1 + bubbleSort_#t~post3;havoc bubbleSort_#t~post3; 455#L551-3 assume !(bubbleSort_~j~0 <= bubbleSort_~i~0); 448#L550-2 bubbleSort_#t~post2 := bubbleSort_~i~0;bubbleSort_~i~0 := bubbleSort_#t~post2 - 1;havoc bubbleSort_#t~post2; 449#L550-3 assume !!(bubbleSort_~i~0 >= 0);bubbleSort_~j~0 := 1; 444#L551-3 [2020-07-29 01:35:04,947 INFO L796 eck$LassoCheckResult]: Loop: 444#L551-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); 445#L552 assume bubbleSort_#t~mem4 > bubbleSort_#t~mem5;havoc bubbleSort_#t~mem5;havoc bubbleSort_#t~mem4;call bubbleSort_#t~mem6 := read~int(bubbleSort_~numbers.base, bubbleSort_~numbers.offset + 4 * (bubbleSort_~j~0 - 1), 4);bubbleSort_~temp~0 := bubbleSort_#t~mem6;havoc bubbleSort_#t~mem6;call bubbleSort_#t~mem7 := read~int(bubbleSort_~numbers.base, bubbleSort_~numbers.offset + 4 * bubbleSort_~j~0, 4);call write~int(bubbleSort_#t~mem7, bubbleSort_~numbers.base, bubbleSort_~numbers.offset + 4 * (bubbleSort_~j~0 - 1), 4);havoc bubbleSort_#t~mem7;call write~int(bubbleSort_~temp~0, bubbleSort_~numbers.base, bubbleSort_~numbers.offset + 4 * bubbleSort_~j~0, 4); 452#L551-2 bubbleSort_#t~post3 := bubbleSort_~j~0;bubbleSort_~j~0 := 1 + bubbleSort_#t~post3;havoc bubbleSort_#t~post3; 444#L551-3 [2020-07-29 01:35:04,947 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 01:35:04,947 INFO L82 PathProgramCache]: Analyzing trace with hash 1421271829, now seen corresponding path program 1 times [2020-07-29 01:35:04,947 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 01:35:04,948 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [317378917] [2020-07-29 01:35:04,948 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 01:35:04,961 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 01:35:04,961 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 01:35:04,972 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 01:35:04,972 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 01:35:04,976 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-07-29 01:35:04,977 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 01:35:04,977 INFO L82 PathProgramCache]: Analyzing trace with hash 54716, now seen corresponding path program 3 times [2020-07-29 01:35:04,977 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 01:35:04,978 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1477258280] [2020-07-29 01:35:04,978 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 01:35:04,984 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 01:35:04,984 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 01:35:04,989 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 01:35:04,989 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 01:35:04,992 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-07-29 01:35:04,992 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 01:35:04,992 INFO L82 PathProgramCache]: Analyzing trace with hash 1321478696, now seen corresponding path program 1 times [2020-07-29 01:35:04,993 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 01:35:04,993 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1275849717] [2020-07-29 01:35:04,993 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 01:35:05,007 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:35:05,090 INFO L280 TraceCheckUtils]: 0: Hoare triple {577#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; {577#true} is VALID [2020-07-29 01:35:05,091 INFO L280 TraceCheckUtils]: 1: Hoare triple {577#true} havoc main_#res;havoc main_#t~nondet8, main_#t~malloc9.base, main_#t~malloc9.offset, main_~array_size~0, main_~numbers~0.base, main_~numbers~0.offset;main_~array_size~0 := main_#t~nondet8;havoc main_#t~nondet8; {577#true} is VALID [2020-07-29 01:35:05,091 INFO L280 TraceCheckUtils]: 2: Hoare triple {577#true} assume !(main_~array_size~0 < 1); {577#true} is VALID [2020-07-29 01:35:05,091 INFO L280 TraceCheckUtils]: 3: Hoare triple {577#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;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; {577#true} is VALID [2020-07-29 01:35:05,092 INFO L280 TraceCheckUtils]: 4: Hoare triple {577#true} assume !!(bubbleSort_~i~0 >= 0);bubbleSort_~j~0 := 1; {579#(= ULTIMATE.start_bubbleSort_~j~0 1)} is VALID [2020-07-29 01:35:05,093 INFO L280 TraceCheckUtils]: 5: Hoare triple {579#(= 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); {579#(= ULTIMATE.start_bubbleSort_~j~0 1)} is VALID [2020-07-29 01:35:05,094 INFO L280 TraceCheckUtils]: 6: Hoare triple {579#(= ULTIMATE.start_bubbleSort_~j~0 1)} assume !(bubbleSort_#t~mem4 > bubbleSort_#t~mem5);havoc bubbleSort_#t~mem5;havoc bubbleSort_#t~mem4; {579#(= ULTIMATE.start_bubbleSort_~j~0 1)} is VALID [2020-07-29 01:35:05,095 INFO L280 TraceCheckUtils]: 7: Hoare triple {579#(= ULTIMATE.start_bubbleSort_~j~0 1)} bubbleSort_#t~post3 := bubbleSort_~j~0;bubbleSort_~j~0 := 1 + bubbleSort_#t~post3;havoc bubbleSort_#t~post3; {580#(<= ULTIMATE.start_bubbleSort_~j~0 2)} is VALID [2020-07-29 01:35:05,096 INFO L280 TraceCheckUtils]: 8: Hoare triple {580#(<= ULTIMATE.start_bubbleSort_~j~0 2)} assume !(bubbleSort_~j~0 <= bubbleSort_~i~0); {581#(<= ULTIMATE.start_bubbleSort_~i~0 1)} is VALID [2020-07-29 01:35:05,097 INFO L280 TraceCheckUtils]: 9: Hoare triple {581#(<= ULTIMATE.start_bubbleSort_~i~0 1)} bubbleSort_#t~post2 := bubbleSort_~i~0;bubbleSort_~i~0 := bubbleSort_#t~post2 - 1;havoc bubbleSort_#t~post2; {582#(<= ULTIMATE.start_bubbleSort_~i~0 0)} is VALID [2020-07-29 01:35:05,098 INFO L280 TraceCheckUtils]: 10: Hoare triple {582#(<= ULTIMATE.start_bubbleSort_~i~0 0)} assume !!(bubbleSort_~i~0 >= 0);bubbleSort_~j~0 := 1; {583#(and (<= ULTIMATE.start_bubbleSort_~i~0 0) (= ULTIMATE.start_bubbleSort_~j~0 1))} is VALID [2020-07-29 01:35:05,100 INFO L280 TraceCheckUtils]: 11: Hoare triple {583#(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); {578#false} is VALID [2020-07-29 01:35:05,100 INFO L280 TraceCheckUtils]: 12: Hoare triple {578#false} assume bubbleSort_#t~mem4 > bubbleSort_#t~mem5;havoc bubbleSort_#t~mem5;havoc bubbleSort_#t~mem4;call bubbleSort_#t~mem6 := read~int(bubbleSort_~numbers.base, bubbleSort_~numbers.offset + 4 * (bubbleSort_~j~0 - 1), 4);bubbleSort_~temp~0 := bubbleSort_#t~mem6;havoc bubbleSort_#t~mem6;call bubbleSort_#t~mem7 := read~int(bubbleSort_~numbers.base, bubbleSort_~numbers.offset + 4 * bubbleSort_~j~0, 4);call write~int(bubbleSort_#t~mem7, bubbleSort_~numbers.base, bubbleSort_~numbers.offset + 4 * (bubbleSort_~j~0 - 1), 4);havoc bubbleSort_#t~mem7;call write~int(bubbleSort_~temp~0, bubbleSort_~numbers.base, bubbleSort_~numbers.offset + 4 * bubbleSort_~j~0, 4); {578#false} is VALID [2020-07-29 01:35:05,101 INFO L280 TraceCheckUtils]: 13: Hoare triple {578#false} bubbleSort_#t~post3 := bubbleSort_~j~0;bubbleSort_~j~0 := 1 + bubbleSort_#t~post3;havoc bubbleSort_#t~post3; {578#false} is VALID [2020-07-29 01:35:05,102 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 5 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-29 01:35:05,102 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1275849717] [2020-07-29 01:35:05,102 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [66225270] [2020-07-29 01:35:05,102 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 19 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 19 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-07-29 01:35:05,149 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:35:05,150 INFO L263 TraceCheckSpWp]: Trace formula consists of 83 conjuncts, 6 conjunts are in the unsatisfiable core [2020-07-29 01:35:05,159 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:35:05,160 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-29 01:35:05,333 INFO L280 TraceCheckUtils]: 0: Hoare triple {577#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; {577#true} is VALID [2020-07-29 01:35:05,333 INFO L280 TraceCheckUtils]: 1: Hoare triple {577#true} havoc main_#res;havoc main_#t~nondet8, main_#t~malloc9.base, main_#t~malloc9.offset, main_~array_size~0, main_~numbers~0.base, main_~numbers~0.offset;main_~array_size~0 := main_#t~nondet8;havoc main_#t~nondet8; {577#true} is VALID [2020-07-29 01:35:05,333 INFO L280 TraceCheckUtils]: 2: Hoare triple {577#true} assume !(main_~array_size~0 < 1); {577#true} is VALID [2020-07-29 01:35:05,334 INFO L280 TraceCheckUtils]: 3: Hoare triple {577#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;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; {577#true} is VALID [2020-07-29 01:35:05,335 INFO L280 TraceCheckUtils]: 4: Hoare triple {577#true} assume !!(bubbleSort_~i~0 >= 0);bubbleSort_~j~0 := 1; {599#(<= ULTIMATE.start_bubbleSort_~j~0 1)} is VALID [2020-07-29 01:35:05,335 INFO L280 TraceCheckUtils]: 5: Hoare triple {599#(<= 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); {599#(<= ULTIMATE.start_bubbleSort_~j~0 1)} is VALID [2020-07-29 01:35:05,336 INFO L280 TraceCheckUtils]: 6: Hoare triple {599#(<= ULTIMATE.start_bubbleSort_~j~0 1)} assume !(bubbleSort_#t~mem4 > bubbleSort_#t~mem5);havoc bubbleSort_#t~mem5;havoc bubbleSort_#t~mem4; {599#(<= ULTIMATE.start_bubbleSort_~j~0 1)} is VALID [2020-07-29 01:35:05,337 INFO L280 TraceCheckUtils]: 7: Hoare triple {599#(<= ULTIMATE.start_bubbleSort_~j~0 1)} bubbleSort_#t~post3 := bubbleSort_~j~0;bubbleSort_~j~0 := 1 + bubbleSort_#t~post3;havoc bubbleSort_#t~post3; {580#(<= ULTIMATE.start_bubbleSort_~j~0 2)} is VALID [2020-07-29 01:35:05,338 INFO L280 TraceCheckUtils]: 8: Hoare triple {580#(<= ULTIMATE.start_bubbleSort_~j~0 2)} assume !(bubbleSort_~j~0 <= bubbleSort_~i~0); {581#(<= ULTIMATE.start_bubbleSort_~i~0 1)} is VALID [2020-07-29 01:35:05,339 INFO L280 TraceCheckUtils]: 9: Hoare triple {581#(<= ULTIMATE.start_bubbleSort_~i~0 1)} bubbleSort_#t~post2 := bubbleSort_~i~0;bubbleSort_~i~0 := bubbleSort_#t~post2 - 1;havoc bubbleSort_#t~post2; {582#(<= ULTIMATE.start_bubbleSort_~i~0 0)} is VALID [2020-07-29 01:35:05,341 INFO L280 TraceCheckUtils]: 10: Hoare triple {582#(<= ULTIMATE.start_bubbleSort_~i~0 0)} assume !!(bubbleSort_~i~0 >= 0);bubbleSort_~j~0 := 1; {618#(and (<= 1 ULTIMATE.start_bubbleSort_~j~0) (<= ULTIMATE.start_bubbleSort_~i~0 0))} is VALID [2020-07-29 01:35:05,342 INFO L280 TraceCheckUtils]: 11: Hoare triple {618#(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); {578#false} is VALID [2020-07-29 01:35:05,343 INFO L280 TraceCheckUtils]: 12: Hoare triple {578#false} assume bubbleSort_#t~mem4 > bubbleSort_#t~mem5;havoc bubbleSort_#t~mem5;havoc bubbleSort_#t~mem4;call bubbleSort_#t~mem6 := read~int(bubbleSort_~numbers.base, bubbleSort_~numbers.offset + 4 * (bubbleSort_~j~0 - 1), 4);bubbleSort_~temp~0 := bubbleSort_#t~mem6;havoc bubbleSort_#t~mem6;call bubbleSort_#t~mem7 := read~int(bubbleSort_~numbers.base, bubbleSort_~numbers.offset + 4 * bubbleSort_~j~0, 4);call write~int(bubbleSort_#t~mem7, bubbleSort_~numbers.base, bubbleSort_~numbers.offset + 4 * (bubbleSort_~j~0 - 1), 4);havoc bubbleSort_#t~mem7;call write~int(bubbleSort_~temp~0, bubbleSort_~numbers.base, bubbleSort_~numbers.offset + 4 * bubbleSort_~j~0, 4); {578#false} is VALID [2020-07-29 01:35:05,343 INFO L280 TraceCheckUtils]: 13: Hoare triple {578#false} bubbleSort_#t~post3 := bubbleSort_~j~0;bubbleSort_~j~0 := 1 + bubbleSort_#t~post3;havoc bubbleSort_#t~post3; {578#false} is VALID [2020-07-29 01:35:05,344 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-29 01:35:05,344 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-07-29 01:35:05,344 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 9 [2020-07-29 01:35:05,347 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [869565733] [2020-07-29 01:35:05,474 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-29 01:35:05,474 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-07-29 01:35:05,475 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2020-07-29 01:35:05,475 INFO L87 Difference]: Start difference. First operand 14 states and 19 transitions. cyclomatic complexity: 7 Second operand 9 states. [2020-07-29 01:35:05,632 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-29 01:35:05,632 INFO L93 Difference]: Finished difference Result 29 states and 38 transitions. [2020-07-29 01:35:05,632 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-07-29 01:35:05,633 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 9 states. [2020-07-29 01:35:05,660 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 20 edges. 20 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-29 01:35:05,661 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 29 states and 38 transitions. [2020-07-29 01:35:05,663 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2020-07-29 01:35:05,664 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 29 states to 25 states and 34 transitions. [2020-07-29 01:35:05,664 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 14 [2020-07-29 01:35:05,665 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 14 [2020-07-29 01:35:05,665 INFO L73 IsDeterministic]: Start isDeterministic. Operand 25 states and 34 transitions. [2020-07-29 01:35:05,665 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2020-07-29 01:35:05,665 INFO L688 BuchiCegarLoop]: Abstraction has 25 states and 34 transitions. [2020-07-29 01:35:05,665 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states and 34 transitions. [2020-07-29 01:35:05,667 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 17. [2020-07-29 01:35:05,667 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-29 01:35:05,668 INFO L82 GeneralOperation]: Start isEquivalent. First operand 25 states and 34 transitions. Second operand 17 states. [2020-07-29 01:35:05,668 INFO L74 IsIncluded]: Start isIncluded. First operand 25 states and 34 transitions. Second operand 17 states. [2020-07-29 01:35:05,668 INFO L87 Difference]: Start difference. First operand 25 states and 34 transitions. Second operand 17 states. [2020-07-29 01:35:05,669 INFO L149 Difference]: Subtrahend was not deterministic. Recomputing result with determinization. [2020-07-29 01:35:05,672 INFO L93 Difference]: Finished difference Result 34 states and 47 transitions. [2020-07-29 01:35:05,672 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 47 transitions. [2020-07-29 01:35:05,673 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-29 01:35:05,673 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-29 01:35:05,673 INFO L74 IsIncluded]: Start isIncluded. First operand 17 states. Second operand 25 states and 34 transitions. [2020-07-29 01:35:05,673 INFO L87 Difference]: Start difference. First operand 17 states. Second operand 25 states and 34 transitions. [2020-07-29 01:35:05,674 INFO L149 Difference]: Subtrahend was not deterministic. Recomputing result with determinization. [2020-07-29 01:35:05,677 INFO L93 Difference]: Finished difference Result 34 states and 47 transitions. [2020-07-29 01:35:05,678 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 47 transitions. [2020-07-29 01:35:05,678 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-29 01:35:05,678 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-29 01:35:05,679 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-29 01:35:05,679 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-29 01:35:05,679 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2020-07-29 01:35:05,680 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 23 transitions. [2020-07-29 01:35:05,680 INFO L711 BuchiCegarLoop]: Abstraction has 17 states and 23 transitions. [2020-07-29 01:35:05,680 INFO L591 BuchiCegarLoop]: Abstraction has 17 states and 23 transitions. [2020-07-29 01:35:05,681 INFO L424 BuchiCegarLoop]: ======== Iteration 6============ [2020-07-29 01:35:05,681 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 17 states and 23 transitions. [2020-07-29 01:35:05,681 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2020-07-29 01:35:05,681 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 01:35:05,682 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 01:35:05,682 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1] [2020-07-29 01:35:05,682 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2020-07-29 01:35:05,683 INFO L794 eck$LassoCheckResult]: Stem: 668#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; 664#L-1 havoc main_#res;havoc main_#t~nondet8, main_#t~malloc9.base, main_#t~malloc9.offset, main_~array_size~0, main_~numbers~0.base, main_~numbers~0.offset;main_~array_size~0 := main_#t~nondet8;havoc main_#t~nondet8; 665#L562 assume !(main_~array_size~0 < 1); 672#L562-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;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; 666#L550-3 assume !!(bubbleSort_~i~0 >= 0);bubbleSort_~j~0 := 1; 667#L551-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); 670#L552 assume !(bubbleSort_#t~mem4 > bubbleSort_#t~mem5);havoc bubbleSort_#t~mem5;havoc bubbleSort_#t~mem4; 671#L551-2 bubbleSort_#t~post3 := bubbleSort_~j~0;bubbleSort_~j~0 := 1 + bubbleSort_#t~post3;havoc bubbleSort_#t~post3; 660#L551-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); 661#L552 assume !(bubbleSort_#t~mem4 > bubbleSort_#t~mem5);havoc bubbleSort_#t~mem5;havoc bubbleSort_#t~mem4; 674#L551-2 bubbleSort_#t~post3 := bubbleSort_~j~0;bubbleSort_~j~0 := 1 + bubbleSort_#t~post3;havoc bubbleSort_#t~post3; 673#L551-3 assume !(bubbleSort_~j~0 <= bubbleSort_~i~0); 662#L550-2 bubbleSort_#t~post2 := bubbleSort_~i~0;bubbleSort_~i~0 := bubbleSort_#t~post2 - 1;havoc bubbleSort_#t~post2; 663#L550-3 assume !!(bubbleSort_~i~0 >= 0);bubbleSort_~j~0 := 1; 658#L551-3 [2020-07-29 01:35:05,683 INFO L796 eck$LassoCheckResult]: Loop: 658#L551-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); 659#L552 assume bubbleSort_#t~mem4 > bubbleSort_#t~mem5;havoc bubbleSort_#t~mem5;havoc bubbleSort_#t~mem4;call bubbleSort_#t~mem6 := read~int(bubbleSort_~numbers.base, bubbleSort_~numbers.offset + 4 * (bubbleSort_~j~0 - 1), 4);bubbleSort_~temp~0 := bubbleSort_#t~mem6;havoc bubbleSort_#t~mem6;call bubbleSort_#t~mem7 := read~int(bubbleSort_~numbers.base, bubbleSort_~numbers.offset + 4 * bubbleSort_~j~0, 4);call write~int(bubbleSort_#t~mem7, bubbleSort_~numbers.base, bubbleSort_~numbers.offset + 4 * (bubbleSort_~j~0 - 1), 4);havoc bubbleSort_#t~mem7;call write~int(bubbleSort_~temp~0, bubbleSort_~numbers.base, bubbleSort_~numbers.offset + 4 * bubbleSort_~j~0, 4); 669#L551-2 bubbleSort_#t~post3 := bubbleSort_~j~0;bubbleSort_~j~0 := 1 + bubbleSort_#t~post3;havoc bubbleSort_#t~post3; 658#L551-3 [2020-07-29 01:35:05,683 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 01:35:05,684 INFO L82 PathProgramCache]: Analyzing trace with hash 1373641048, now seen corresponding path program 2 times [2020-07-29 01:35:05,684 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 01:35:05,684 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2138566578] [2020-07-29 01:35:05,684 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 01:35:05,701 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 01:35:05,702 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 01:35:05,716 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 01:35:05,716 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 01:35:05,721 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-07-29 01:35:05,722 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 01:35:05,722 INFO L82 PathProgramCache]: Analyzing trace with hash 54716, now seen corresponding path program 4 times [2020-07-29 01:35:05,722 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 01:35:05,723 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [6622218] [2020-07-29 01:35:05,723 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 01:35:05,729 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 01:35:05,729 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 01:35:05,733 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 01:35:05,734 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 01:35:05,736 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-07-29 01:35:05,737 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 01:35:05,737 INFO L82 PathProgramCache]: Analyzing trace with hash -307910395, now seen corresponding path program 2 times [2020-07-29 01:35:05,738 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 01:35:05,738 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [632106594] [2020-07-29 01:35:05,738 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 01:35:05,758 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:35:06,124 INFO L280 TraceCheckUtils]: 0: Hoare triple {832#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; {832#true} is VALID [2020-07-29 01:35:06,125 INFO L280 TraceCheckUtils]: 1: Hoare triple {832#true} havoc main_#res;havoc main_#t~nondet8, main_#t~malloc9.base, main_#t~malloc9.offset, main_~array_size~0, main_~numbers~0.base, main_~numbers~0.offset;main_~array_size~0 := main_#t~nondet8;havoc main_#t~nondet8; {832#true} is VALID [2020-07-29 01:35:06,125 INFO L280 TraceCheckUtils]: 2: Hoare triple {832#true} assume !(main_~array_size~0 < 1); {832#true} is VALID [2020-07-29 01:35:06,127 INFO L280 TraceCheckUtils]: 3: Hoare triple {832#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;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; {834#(= 0 ULTIMATE.start_bubbleSort_~numbers.offset)} is VALID [2020-07-29 01:35:06,128 INFO L280 TraceCheckUtils]: 4: Hoare triple {834#(= 0 ULTIMATE.start_bubbleSort_~numbers.offset)} assume !!(bubbleSort_~i~0 >= 0);bubbleSort_~j~0 := 1; {835#(and (= 0 ULTIMATE.start_bubbleSort_~numbers.offset) (= ULTIMATE.start_bubbleSort_~j~0 1))} is VALID [2020-07-29 01:35:06,130 INFO L280 TraceCheckUtils]: 5: Hoare triple {835#(and (= 0 ULTIMATE.start_bubbleSort_~numbers.offset) (= 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); {836#(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 01:35:06,131 INFO L280 TraceCheckUtils]: 6: Hoare triple {836#(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~mem5;havoc bubbleSort_#t~mem4; {837#(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 01:35:06,134 INFO L280 TraceCheckUtils]: 7: Hoare triple {837#(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; {838#(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)))) (= 8 (* 4 ULTIMATE.start_bubbleSort_~j~0)))} is VALID [2020-07-29 01:35:06,136 INFO L280 TraceCheckUtils]: 8: Hoare triple {838#(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)))) (= 8 (* 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); {839#(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 4))))} is VALID [2020-07-29 01:35:06,138 INFO L280 TraceCheckUtils]: 9: Hoare triple {839#(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 4))))} assume !(bubbleSort_#t~mem4 > bubbleSort_#t~mem5);havoc bubbleSort_#t~mem5;havoc bubbleSort_#t~mem4; {839#(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 4))))} is VALID [2020-07-29 01:35:06,140 INFO L280 TraceCheckUtils]: 10: Hoare triple {839#(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 4))))} bubbleSort_#t~post3 := bubbleSort_~j~0;bubbleSort_~j~0 := 1 + bubbleSort_#t~post3;havoc bubbleSort_#t~post3; {839#(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 4))))} is VALID [2020-07-29 01:35:06,140 INFO L280 TraceCheckUtils]: 11: Hoare triple {839#(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 4))))} assume !(bubbleSort_~j~0 <= bubbleSort_~i~0); {839#(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 4))))} is VALID [2020-07-29 01:35:06,141 INFO L280 TraceCheckUtils]: 12: Hoare triple {839#(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 4))))} bubbleSort_#t~post2 := bubbleSort_~i~0;bubbleSort_~i~0 := bubbleSort_#t~post2 - 1;havoc bubbleSort_#t~post2; {839#(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 4))))} is VALID [2020-07-29 01:35:06,142 INFO L280 TraceCheckUtils]: 13: Hoare triple {839#(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 4))))} assume !!(bubbleSort_~i~0 >= 0);bubbleSort_~j~0 := 1; {837#(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 01:35:06,143 INFO L280 TraceCheckUtils]: 14: Hoare triple {837#(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); {840#(<= |ULTIMATE.start_bubbleSort_#t~mem4| |ULTIMATE.start_bubbleSort_#t~mem5|)} is VALID [2020-07-29 01:35:06,144 INFO L280 TraceCheckUtils]: 15: Hoare triple {840#(<= |ULTIMATE.start_bubbleSort_#t~mem4| |ULTIMATE.start_bubbleSort_#t~mem5|)} assume bubbleSort_#t~mem4 > bubbleSort_#t~mem5;havoc bubbleSort_#t~mem5;havoc bubbleSort_#t~mem4;call bubbleSort_#t~mem6 := read~int(bubbleSort_~numbers.base, bubbleSort_~numbers.offset + 4 * (bubbleSort_~j~0 - 1), 4);bubbleSort_~temp~0 := bubbleSort_#t~mem6;havoc bubbleSort_#t~mem6;call bubbleSort_#t~mem7 := read~int(bubbleSort_~numbers.base, bubbleSort_~numbers.offset + 4 * bubbleSort_~j~0, 4);call write~int(bubbleSort_#t~mem7, bubbleSort_~numbers.base, bubbleSort_~numbers.offset + 4 * (bubbleSort_~j~0 - 1), 4);havoc bubbleSort_#t~mem7;call write~int(bubbleSort_~temp~0, bubbleSort_~numbers.base, bubbleSort_~numbers.offset + 4 * bubbleSort_~j~0, 4); {833#false} is VALID [2020-07-29 01:35:06,144 INFO L280 TraceCheckUtils]: 16: Hoare triple {833#false} bubbleSort_#t~post3 := bubbleSort_~j~0;bubbleSort_~j~0 := 1 + bubbleSort_#t~post3;havoc bubbleSort_#t~post3; {833#false} is VALID [2020-07-29 01:35:06,147 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 5 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-29 01:35:06,147 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [632106594] [2020-07-29 01:35:06,148 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [563151599] [2020-07-29 01:35:06,148 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 20 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 20 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-07-29 01:35:06,231 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2020-07-29 01:35:06,232 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-07-29 01:35:06,233 INFO L263 TraceCheckSpWp]: Trace formula consists of 97 conjuncts, 10 conjunts are in the unsatisfiable core [2020-07-29 01:35:06,242 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:35:06,243 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-29 01:35:06,465 INFO L350 Elim1Store]: treesize reduction 9, result has 10.0 percent of original size [2020-07-29 01:35:06,466 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 01:35:06,492 INFO L544 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-07-29 01:35:06,495 INFO L624 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-07-29 01:35:06,495 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 01:35:06,495 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:30, output treesize:3 [2020-07-29 01:35:06,499 WARN L406 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2020-07-29 01:35:06,499 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 01:35:06,500 WARN L408 uantifierElimination]: ElimStorePlain result: ∃ []. (<= |ULTIMATE.start_bubbleSort_#t~mem4| |ULTIMATE.start_bubbleSort_#t~mem5|) [2020-07-29 01:35:06,540 INFO L280 TraceCheckUtils]: 0: Hoare triple {832#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; {832#true} is VALID [2020-07-29 01:35:06,541 INFO L280 TraceCheckUtils]: 1: Hoare triple {832#true} havoc main_#res;havoc main_#t~nondet8, main_#t~malloc9.base, main_#t~malloc9.offset, main_~array_size~0, main_~numbers~0.base, main_~numbers~0.offset;main_~array_size~0 := main_#t~nondet8;havoc main_#t~nondet8; {832#true} is VALID [2020-07-29 01:35:06,541 INFO L280 TraceCheckUtils]: 2: Hoare triple {832#true} assume !(main_~array_size~0 < 1); {832#true} is VALID [2020-07-29 01:35:06,541 INFO L280 TraceCheckUtils]: 3: Hoare triple {832#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;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; {832#true} is VALID [2020-07-29 01:35:06,542 INFO L280 TraceCheckUtils]: 4: Hoare triple {832#true} assume !!(bubbleSort_~i~0 >= 0);bubbleSort_~j~0 := 1; {856#(= 1 ULTIMATE.start_bubbleSort_~j~0)} is VALID [2020-07-29 01:35:06,544 INFO L280 TraceCheckUtils]: 5: Hoare triple {856#(= 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); {860#(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 01:35:06,546 INFO L280 TraceCheckUtils]: 6: Hoare triple {860#(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~mem5;havoc bubbleSort_#t~mem4; {864#(<= (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 01:35:06,547 INFO L280 TraceCheckUtils]: 7: Hoare triple {864#(<= (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; {864#(<= (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 01:35:06,547 INFO L280 TraceCheckUtils]: 8: Hoare triple {864#(<= (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); {864#(<= (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 01:35:06,548 INFO L280 TraceCheckUtils]: 9: Hoare triple {864#(<= (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~mem5;havoc bubbleSort_#t~mem4; {864#(<= (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 01:35:06,549 INFO L280 TraceCheckUtils]: 10: Hoare triple {864#(<= (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; {864#(<= (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 01:35:06,549 INFO L280 TraceCheckUtils]: 11: Hoare triple {864#(<= (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); {864#(<= (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 01:35:06,550 INFO L280 TraceCheckUtils]: 12: Hoare triple {864#(<= (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; {864#(<= (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 01:35:06,551 INFO L280 TraceCheckUtils]: 13: Hoare triple {864#(<= (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; {886#(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 01:35:06,553 INFO L280 TraceCheckUtils]: 14: Hoare triple {886#(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); {840#(<= |ULTIMATE.start_bubbleSort_#t~mem4| |ULTIMATE.start_bubbleSort_#t~mem5|)} is VALID [2020-07-29 01:35:06,554 INFO L280 TraceCheckUtils]: 15: Hoare triple {840#(<= |ULTIMATE.start_bubbleSort_#t~mem4| |ULTIMATE.start_bubbleSort_#t~mem5|)} assume bubbleSort_#t~mem4 > bubbleSort_#t~mem5;havoc bubbleSort_#t~mem5;havoc bubbleSort_#t~mem4;call bubbleSort_#t~mem6 := read~int(bubbleSort_~numbers.base, bubbleSort_~numbers.offset + 4 * (bubbleSort_~j~0 - 1), 4);bubbleSort_~temp~0 := bubbleSort_#t~mem6;havoc bubbleSort_#t~mem6;call bubbleSort_#t~mem7 := read~int(bubbleSort_~numbers.base, bubbleSort_~numbers.offset + 4 * bubbleSort_~j~0, 4);call write~int(bubbleSort_#t~mem7, bubbleSort_~numbers.base, bubbleSort_~numbers.offset + 4 * (bubbleSort_~j~0 - 1), 4);havoc bubbleSort_#t~mem7;call write~int(bubbleSort_~temp~0, bubbleSort_~numbers.base, bubbleSort_~numbers.offset + 4 * bubbleSort_~j~0, 4); {833#false} is VALID [2020-07-29 01:35:06,555 INFO L280 TraceCheckUtils]: 16: Hoare triple {833#false} bubbleSort_#t~post3 := bubbleSort_~j~0;bubbleSort_~j~0 := 1 + bubbleSort_#t~post3;havoc bubbleSort_#t~post3; {833#false} is VALID [2020-07-29 01:35:06,556 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 6 proven. 5 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2020-07-29 01:35:06,556 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-07-29 01:35:06,556 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 7] total 13 [2020-07-29 01:35:06,556 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1101291931] [2020-07-29 01:35:06,660 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-29 01:35:06,661 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2020-07-29 01:35:06,661 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=114, Unknown=0, NotChecked=0, Total=156 [2020-07-29 01:35:06,661 INFO L87 Difference]: Start difference. First operand 17 states and 23 transitions. cyclomatic complexity: 8 Second operand 13 states. [2020-07-29 01:35:06,999 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-29 01:35:06,999 INFO L93 Difference]: Finished difference Result 37 states and 50 transitions. [2020-07-29 01:35:06,999 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-07-29 01:35:06,999 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 13 states. [2020-07-29 01:35:07,049 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 28 edges. 28 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-29 01:35:07,050 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 37 states and 50 transitions. [2020-07-29 01:35:07,053 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 6 [2020-07-29 01:35:07,055 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 37 states to 37 states and 50 transitions. [2020-07-29 01:35:07,055 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 19 [2020-07-29 01:35:07,055 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 19 [2020-07-29 01:35:07,055 INFO L73 IsDeterministic]: Start isDeterministic. Operand 37 states and 50 transitions. [2020-07-29 01:35:07,056 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2020-07-29 01:35:07,056 INFO L688 BuchiCegarLoop]: Abstraction has 37 states and 50 transitions. [2020-07-29 01:35:07,056 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states and 50 transitions. [2020-07-29 01:35:07,059 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 26. [2020-07-29 01:35:07,059 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-29 01:35:07,059 INFO L82 GeneralOperation]: Start isEquivalent. First operand 37 states and 50 transitions. Second operand 26 states. [2020-07-29 01:35:07,060 INFO L74 IsIncluded]: Start isIncluded. First operand 37 states and 50 transitions. Second operand 26 states. [2020-07-29 01:35:07,060 INFO L87 Difference]: Start difference. First operand 37 states and 50 transitions. Second operand 26 states. [2020-07-29 01:35:07,061 INFO L149 Difference]: Subtrahend was not deterministic. Recomputing result with determinization. [2020-07-29 01:35:07,064 INFO L93 Difference]: Finished difference Result 49 states and 68 transitions. [2020-07-29 01:35:07,064 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 68 transitions. [2020-07-29 01:35:07,065 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-29 01:35:07,065 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-29 01:35:07,065 INFO L74 IsIncluded]: Start isIncluded. First operand 26 states. Second operand 37 states and 50 transitions. [2020-07-29 01:35:07,065 INFO L87 Difference]: Start difference. First operand 26 states. Second operand 37 states and 50 transitions. [2020-07-29 01:35:07,066 INFO L149 Difference]: Subtrahend was not deterministic. Recomputing result with determinization. [2020-07-29 01:35:07,069 INFO L93 Difference]: Finished difference Result 49 states and 68 transitions. [2020-07-29 01:35:07,070 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 68 transitions. [2020-07-29 01:35:07,070 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-29 01:35:07,070 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-29 01:35:07,070 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-29 01:35:07,070 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-29 01:35:07,071 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26 states. [2020-07-29 01:35:07,072 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 35 transitions. [2020-07-29 01:35:07,072 INFO L711 BuchiCegarLoop]: Abstraction has 26 states and 35 transitions. [2020-07-29 01:35:07,072 INFO L591 BuchiCegarLoop]: Abstraction has 26 states and 35 transitions. [2020-07-29 01:35:07,072 INFO L424 BuchiCegarLoop]: ======== Iteration 7============ [2020-07-29 01:35:07,072 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 26 states and 35 transitions. [2020-07-29 01:35:07,073 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2020-07-29 01:35:07,073 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 01:35:07,073 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 01:35:07,073 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-29 01:35:07,073 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2020-07-29 01:35:07,074 INFO L794 eck$LassoCheckResult]: Stem: 944#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; 938#L-1 havoc main_#res;havoc main_#t~nondet8, main_#t~malloc9.base, main_#t~malloc9.offset, main_~array_size~0, main_~numbers~0.base, main_~numbers~0.offset;main_~array_size~0 := main_#t~nondet8;havoc main_#t~nondet8; 939#L562 assume !(main_~array_size~0 < 1); 948#L562-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;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; 940#L550-3 assume !!(bubbleSort_~i~0 >= 0);bubbleSort_~j~0 := 1; 941#L551-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); 954#L552 assume !(bubbleSort_#t~mem4 > bubbleSort_#t~mem5);havoc bubbleSort_#t~mem5;havoc bubbleSort_#t~mem4; 950#L551-2 bubbleSort_#t~post3 := bubbleSort_~j~0;bubbleSort_~j~0 := 1 + bubbleSort_#t~post3;havoc bubbleSort_#t~post3; 934#L551-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); 935#L552 assume bubbleSort_#t~mem4 > bubbleSort_#t~mem5;havoc bubbleSort_#t~mem5;havoc bubbleSort_#t~mem4;call bubbleSort_#t~mem6 := read~int(bubbleSort_~numbers.base, bubbleSort_~numbers.offset + 4 * (bubbleSort_~j~0 - 1), 4);bubbleSort_~temp~0 := bubbleSort_#t~mem6;havoc bubbleSort_#t~mem6;call bubbleSort_#t~mem7 := read~int(bubbleSort_~numbers.base, bubbleSort_~numbers.offset + 4 * bubbleSort_~j~0, 4);call write~int(bubbleSort_#t~mem7, bubbleSort_~numbers.base, bubbleSort_~numbers.offset + 4 * (bubbleSort_~j~0 - 1), 4);havoc bubbleSort_#t~mem7;call write~int(bubbleSort_~temp~0, bubbleSort_~numbers.base, bubbleSort_~numbers.offset + 4 * bubbleSort_~j~0, 4); 946#L551-2 bubbleSort_#t~post3 := bubbleSort_~j~0;bubbleSort_~j~0 := 1 + bubbleSort_#t~post3;havoc bubbleSort_#t~post3; 953#L551-3 assume !(bubbleSort_~j~0 <= bubbleSort_~i~0); 936#L550-2 bubbleSort_#t~post2 := bubbleSort_~i~0;bubbleSort_~i~0 := bubbleSort_#t~post2 - 1;havoc bubbleSort_#t~post2; 937#L550-3 assume !!(bubbleSort_~i~0 >= 0);bubbleSort_~j~0 := 1; 949#L551-3 [2020-07-29 01:35:07,074 INFO L796 eck$LassoCheckResult]: Loop: 949#L551-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); 957#L552 assume bubbleSort_#t~mem4 > bubbleSort_#t~mem5;havoc bubbleSort_#t~mem5;havoc bubbleSort_#t~mem4;call bubbleSort_#t~mem6 := read~int(bubbleSort_~numbers.base, bubbleSort_~numbers.offset + 4 * (bubbleSort_~j~0 - 1), 4);bubbleSort_~temp~0 := bubbleSort_#t~mem6;havoc bubbleSort_#t~mem6;call bubbleSort_#t~mem7 := read~int(bubbleSort_~numbers.base, bubbleSort_~numbers.offset + 4 * bubbleSort_~j~0, 4);call write~int(bubbleSort_#t~mem7, bubbleSort_~numbers.base, bubbleSort_~numbers.offset + 4 * (bubbleSort_~j~0 - 1), 4);havoc bubbleSort_#t~mem7;call write~int(bubbleSort_~temp~0, bubbleSort_~numbers.base, bubbleSort_~numbers.offset + 4 * bubbleSort_~j~0, 4); 945#L551-2 bubbleSort_#t~post3 := bubbleSort_~j~0;bubbleSort_~j~0 := 1 + bubbleSort_#t~post3;havoc bubbleSort_#t~post3; 949#L551-3 [2020-07-29 01:35:07,074 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 01:35:07,074 INFO L82 PathProgramCache]: Analyzing trace with hash 1371794006, now seen corresponding path program 3 times [2020-07-29 01:35:07,074 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 01:35:07,075 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1458321414] [2020-07-29 01:35:07,075 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 01:35:07,087 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 01:35:07,088 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 01:35:07,099 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 01:35:07,099 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 01:35:07,104 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-07-29 01:35:07,104 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 01:35:07,104 INFO L82 PathProgramCache]: Analyzing trace with hash 54716, now seen corresponding path program 5 times [2020-07-29 01:35:07,104 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 01:35:07,105 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1390879772] [2020-07-29 01:35:07,105 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 01:35:07,109 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 01:35:07,109 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 01:35:07,112 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 01:35:07,113 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 01:35:07,115 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-07-29 01:35:07,115 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 01:35:07,115 INFO L82 PathProgramCache]: Analyzing trace with hash 501436231, now seen corresponding path program 4 times [2020-07-29 01:35:07,116 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 01:35:07,116 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2052290452] [2020-07-29 01:35:07,116 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 01:35:07,134 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 01:35:07,135 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 01:35:07,148 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 01:35:07,148 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 01:35:07,154 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-07-29 01:35:07,668 WARN L193 SmtUtils]: Spent 374.00 ms on a formula simplification. DAG size of input: 122 DAG size of output: 101 [2020-07-29 01:35:07,822 WARN L193 SmtUtils]: Spent 107.00 ms on a formula simplification that was a NOOP. DAG size: 75 [2020-07-29 01:35:07,825 INFO L210 LassoAnalysis]: Preferences: [2020-07-29 01:35:07,825 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2020-07-29 01:35:07,825 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2020-07-29 01:35:07,825 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2020-07-29 01:35:07,825 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2020-07-29 01:35:07,825 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:35:07,825 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2020-07-29 01:35:07,826 INFO L132 ssoRankerPreferences]: Path of dumped script: [2020-07-29 01:35:07,826 INFO L133 ssoRankerPreferences]: Filename of dumped script: bubblesort-alloca-1.i_Iteration7_Lasso [2020-07-29 01:35:07,826 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2020-07-29 01:35:07,826 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2020-07-29 01:35:07,863 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 01:35:07,867 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 01:35:07,871 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 01:35:07,874 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 01:35:08,086 WARN L193 SmtUtils]: Spent 107.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 54 [2020-07-29 01:35:08,191 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 01:35:08,194 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 01:35:08,198 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 01:35:08,202 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 01:35:08,206 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 01:35:08,210 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 01:35:08,213 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 01:35:08,217 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 01:35:08,220 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 01:35:08,224 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 01:35:08,888 INFO L292 LassoAnalysis]: Preprocessing complete. [2020-07-29 01:35:08,888 INFO L489 LassoAnalysis]: Using template 'affine'. 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 01:35:08,892 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 01:35:08,893 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 01:35:08,893 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-07-29 01:35:08,894 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 01:35:08,894 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 01:35:08,894 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 01:35:08,894 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-07-29 01:35:08,894 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-07-29 01:35:08,895 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) [2020-07-29 01:35:08,922 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 01:35:08,924 INFO L338 nArgumentSynthesizer]: Template has degree 0. Waiting until toolchain timeout for monitored process 22 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:35:08,924 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 01:35:08,924 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 01:35:08,924 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 01:35:08,926 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-07-29 01:35:08,926 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-07-29 01:35:08,930 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 23 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2020-07-29 01:35:08,956 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false Waiting until toolchain timeout for monitored process 23 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:35:08,958 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 01:35:08,958 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-07-29 01:35:08,958 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 01:35:08,958 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 01:35:08,958 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 01:35:08,960 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-07-29 01:35:08,960 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-07-29 01:35:08,961 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 24 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 24 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:35:08,985 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 01:35:08,987 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 01:35:08,988 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 01:35:08,988 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 01:35:08,988 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 01:35:08,999 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-07-29 01:35:08,999 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-07-29 01:35:09,018 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2020-07-29 01:35:09,091 INFO L443 ModelExtractionUtils]: Simplification made 12 calls to the SMT solver. [2020-07-29 01:35:09,092 INFO L444 ModelExtractionUtils]: 10 out of 37 variables were initially zero. Simplification set additionally 23 variables to zero. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 25 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2020-07-29 01:35:09,096 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... Waiting until toolchain timeout for monitored process 25 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:35:09,099 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2020-07-29 01:35:09,099 INFO L510 LassoAnalysis]: Proved termination. [2020-07-29 01:35:09,099 INFO L512 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_bubbleSort_~numbers.offset, ULTIMATE.start_bubbleSort_~j~0, v_rep(select #length ULTIMATE.start_main_#t~malloc9.base)_2) = -1*ULTIMATE.start_bubbleSort_~numbers.offset - 4*ULTIMATE.start_bubbleSort_~j~0 + 2*v_rep(select #length ULTIMATE.start_main_#t~malloc9.base)_2 Supporting invariants [] [2020-07-29 01:35:09,165 INFO L297 tatePredicateManager]: 6 out of 7 supporting invariants were superfluous and have been removed [2020-07-29 01:35:09,171 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~mem5;havoc bubbleSort_#t~mem4;call bubbleSort_#t~mem6 := read~int(bubbleSort_~numbers.base, bubbleSort_~numbers.offset + 4 * (bubbleSort_~j~0 - 1), 4);bubbleSort_~temp~0 := bubbleSort_#t~mem6;havoc bubbleSort_#t~mem6;call bubbleSort_#t~mem7 := read~int(bubbleSort_~numbers.base, bubbleSort_~numbers.offset + 4 * bubbleSort_~j~0, 4);call write~int(bubbleSort_#t~mem7, bubbleSort_~numbers.base, bubbleSort_~numbers.offset + 4 * (bubbleSort_~j~0 - 1), 4);havoc bubbleSort_#t~mem7;call write~int(bubbleSort_~temp~0, bubbleSort_~numbers.base, bubbleSort_~numbers.offset + 4 * bubbleSort_~j~0, 4);" "bubbleSort_#t~post3 := bubbleSort_~j~0;bubbleSort_~j~0 := 1 + bubbleSort_#t~post3;havoc bubbleSort_#t~post3;" [2020-07-29 01:35:09,176 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:35:09,178 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-29 01:35:09,212 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 01:35:09,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:35:09,254 INFO L263 TraceCheckSpWp]: Trace formula consists of 83 conjuncts, 8 conjunts are in the unsatisfiable core [2020-07-29 01:35:09,275 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:35:09,276 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-29 01:35:09,294 INFO L280 TraceCheckUtils]: 0: Hoare triple {1177#unseeded} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; {1177#unseeded} is VALID [2020-07-29 01:35:09,295 INFO L280 TraceCheckUtils]: 1: Hoare triple {1177#unseeded} havoc main_#res;havoc main_#t~nondet8, main_#t~malloc9.base, main_#t~malloc9.offset, main_~array_size~0, main_~numbers~0.base, main_~numbers~0.offset;main_~array_size~0 := main_#t~nondet8;havoc main_#t~nondet8; {1177#unseeded} is VALID [2020-07-29 01:35:09,296 INFO L280 TraceCheckUtils]: 2: Hoare triple {1177#unseeded} assume !(main_~array_size~0 < 1); {1177#unseeded} is VALID [2020-07-29 01:35:09,297 INFO L280 TraceCheckUtils]: 3: Hoare triple {1177#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;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; {1226#(and (= ULTIMATE.start_bubbleSort_~numbers.base |ULTIMATE.start_main_#t~malloc9.base|) unseeded)} is VALID [2020-07-29 01:35:09,297 INFO L280 TraceCheckUtils]: 4: Hoare triple {1226#(and (= ULTIMATE.start_bubbleSort_~numbers.base |ULTIMATE.start_main_#t~malloc9.base|) unseeded)} assume !!(bubbleSort_~i~0 >= 0);bubbleSort_~j~0 := 1; {1226#(and (= ULTIMATE.start_bubbleSort_~numbers.base |ULTIMATE.start_main_#t~malloc9.base|) unseeded)} is VALID [2020-07-29 01:35:09,299 INFO L280 TraceCheckUtils]: 5: Hoare triple {1226#(and (= ULTIMATE.start_bubbleSort_~numbers.base |ULTIMATE.start_main_#t~malloc9.base|) unseeded)} 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); {1226#(and (= ULTIMATE.start_bubbleSort_~numbers.base |ULTIMATE.start_main_#t~malloc9.base|) unseeded)} is VALID [2020-07-29 01:35:09,299 INFO L280 TraceCheckUtils]: 6: Hoare triple {1226#(and (= ULTIMATE.start_bubbleSort_~numbers.base |ULTIMATE.start_main_#t~malloc9.base|) unseeded)} assume !(bubbleSort_#t~mem4 > bubbleSort_#t~mem5);havoc bubbleSort_#t~mem5;havoc bubbleSort_#t~mem4; {1226#(and (= ULTIMATE.start_bubbleSort_~numbers.base |ULTIMATE.start_main_#t~malloc9.base|) unseeded)} is VALID [2020-07-29 01:35:09,300 INFO L280 TraceCheckUtils]: 7: Hoare triple {1226#(and (= ULTIMATE.start_bubbleSort_~numbers.base |ULTIMATE.start_main_#t~malloc9.base|) unseeded)} bubbleSort_#t~post3 := bubbleSort_~j~0;bubbleSort_~j~0 := 1 + bubbleSort_#t~post3;havoc bubbleSort_#t~post3; {1226#(and (= ULTIMATE.start_bubbleSort_~numbers.base |ULTIMATE.start_main_#t~malloc9.base|) unseeded)} is VALID [2020-07-29 01:35:09,301 INFO L280 TraceCheckUtils]: 8: Hoare triple {1226#(and (= ULTIMATE.start_bubbleSort_~numbers.base |ULTIMATE.start_main_#t~malloc9.base|) unseeded)} 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); {1226#(and (= ULTIMATE.start_bubbleSort_~numbers.base |ULTIMATE.start_main_#t~malloc9.base|) unseeded)} is VALID [2020-07-29 01:35:09,303 INFO L280 TraceCheckUtils]: 9: Hoare triple {1226#(and (= ULTIMATE.start_bubbleSort_~numbers.base |ULTIMATE.start_main_#t~malloc9.base|) unseeded)} assume bubbleSort_#t~mem4 > bubbleSort_#t~mem5;havoc bubbleSort_#t~mem5;havoc bubbleSort_#t~mem4;call bubbleSort_#t~mem6 := read~int(bubbleSort_~numbers.base, bubbleSort_~numbers.offset + 4 * (bubbleSort_~j~0 - 1), 4);bubbleSort_~temp~0 := bubbleSort_#t~mem6;havoc bubbleSort_#t~mem6;call bubbleSort_#t~mem7 := read~int(bubbleSort_~numbers.base, bubbleSort_~numbers.offset + 4 * bubbleSort_~j~0, 4);call write~int(bubbleSort_#t~mem7, bubbleSort_~numbers.base, bubbleSort_~numbers.offset + 4 * (bubbleSort_~j~0 - 1), 4);havoc bubbleSort_#t~mem7;call write~int(bubbleSort_~temp~0, bubbleSort_~numbers.base, bubbleSort_~numbers.offset + 4 * bubbleSort_~j~0, 4); {1226#(and (= ULTIMATE.start_bubbleSort_~numbers.base |ULTIMATE.start_main_#t~malloc9.base|) unseeded)} is VALID [2020-07-29 01:35:09,304 INFO L280 TraceCheckUtils]: 10: Hoare triple {1226#(and (= ULTIMATE.start_bubbleSort_~numbers.base |ULTIMATE.start_main_#t~malloc9.base|) unseeded)} bubbleSort_#t~post3 := bubbleSort_~j~0;bubbleSort_~j~0 := 1 + bubbleSort_#t~post3;havoc bubbleSort_#t~post3; {1226#(and (= ULTIMATE.start_bubbleSort_~numbers.base |ULTIMATE.start_main_#t~malloc9.base|) unseeded)} is VALID [2020-07-29 01:35:09,305 INFO L280 TraceCheckUtils]: 11: Hoare triple {1226#(and (= ULTIMATE.start_bubbleSort_~numbers.base |ULTIMATE.start_main_#t~malloc9.base|) unseeded)} assume !(bubbleSort_~j~0 <= bubbleSort_~i~0); {1226#(and (= ULTIMATE.start_bubbleSort_~numbers.base |ULTIMATE.start_main_#t~malloc9.base|) unseeded)} is VALID [2020-07-29 01:35:09,306 INFO L280 TraceCheckUtils]: 12: Hoare triple {1226#(and (= ULTIMATE.start_bubbleSort_~numbers.base |ULTIMATE.start_main_#t~malloc9.base|) unseeded)} bubbleSort_#t~post2 := bubbleSort_~i~0;bubbleSort_~i~0 := bubbleSort_#t~post2 - 1;havoc bubbleSort_#t~post2; {1226#(and (= ULTIMATE.start_bubbleSort_~numbers.base |ULTIMATE.start_main_#t~malloc9.base|) unseeded)} is VALID [2020-07-29 01:35:09,306 INFO L280 TraceCheckUtils]: 13: Hoare triple {1226#(and (= ULTIMATE.start_bubbleSort_~numbers.base |ULTIMATE.start_main_#t~malloc9.base|) unseeded)} assume !!(bubbleSort_~i~0 >= 0);bubbleSort_~j~0 := 1; {1226#(and (= ULTIMATE.start_bubbleSort_~numbers.base |ULTIMATE.start_main_#t~malloc9.base|) unseeded)} is VALID [2020-07-29 01:35:09,315 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:35:09,316 INFO L263 TraceCheckSpWp]: Trace formula consists of 27 conjuncts, 7 conjunts are in the unsatisfiable core [2020-07-29 01:35:09,320 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:35:09,321 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-29 01:35:09,352 INFO L280 TraceCheckUtils]: 0: Hoare triple {1227#(and (= ULTIMATE.start_bubbleSort_~numbers.base |ULTIMATE.start_main_#t~malloc9.base|) (>= oldRank0 (+ (* (- 1) ULTIMATE.start_bubbleSort_~numbers.offset) (* (- 4) ULTIMATE.start_bubbleSort_~j~0) (* 2 (select |#length| |ULTIMATE.start_main_#t~malloc9.base|)))))} 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); {1274#(and (= ULTIMATE.start_bubbleSort_~numbers.base |ULTIMATE.start_main_#t~malloc9.base|) (<= 4 (+ ULTIMATE.start_bubbleSort_~numbers.offset (* 4 ULTIMATE.start_bubbleSort_~j~0))) (<= (+ ULTIMATE.start_bubbleSort_~numbers.offset (* 4 ULTIMATE.start_bubbleSort_~j~0) 4) (select |#length| ULTIMATE.start_bubbleSort_~numbers.base)) (<= (* 2 (select |#length| |ULTIMATE.start_main_#t~malloc9.base|)) (+ ULTIMATE.start_bubbleSort_~numbers.offset (* 4 ULTIMATE.start_bubbleSort_~j~0) oldRank0)))} is VALID [2020-07-29 01:35:09,354 INFO L280 TraceCheckUtils]: 1: Hoare triple {1274#(and (= ULTIMATE.start_bubbleSort_~numbers.base |ULTIMATE.start_main_#t~malloc9.base|) (<= 4 (+ ULTIMATE.start_bubbleSort_~numbers.offset (* 4 ULTIMATE.start_bubbleSort_~j~0))) (<= (+ ULTIMATE.start_bubbleSort_~numbers.offset (* 4 ULTIMATE.start_bubbleSort_~j~0) 4) (select |#length| ULTIMATE.start_bubbleSort_~numbers.base)) (<= (* 2 (select |#length| |ULTIMATE.start_main_#t~malloc9.base|)) (+ ULTIMATE.start_bubbleSort_~numbers.offset (* 4 ULTIMATE.start_bubbleSort_~j~0) oldRank0)))} assume bubbleSort_#t~mem4 > bubbleSort_#t~mem5;havoc bubbleSort_#t~mem5;havoc bubbleSort_#t~mem4;call bubbleSort_#t~mem6 := read~int(bubbleSort_~numbers.base, bubbleSort_~numbers.offset + 4 * (bubbleSort_~j~0 - 1), 4);bubbleSort_~temp~0 := bubbleSort_#t~mem6;havoc bubbleSort_#t~mem6;call bubbleSort_#t~mem7 := read~int(bubbleSort_~numbers.base, bubbleSort_~numbers.offset + 4 * bubbleSort_~j~0, 4);call write~int(bubbleSort_#t~mem7, bubbleSort_~numbers.base, bubbleSort_~numbers.offset + 4 * (bubbleSort_~j~0 - 1), 4);havoc bubbleSort_#t~mem7;call write~int(bubbleSort_~temp~0, bubbleSort_~numbers.base, bubbleSort_~numbers.offset + 4 * bubbleSort_~j~0, 4); {1274#(and (= ULTIMATE.start_bubbleSort_~numbers.base |ULTIMATE.start_main_#t~malloc9.base|) (<= 4 (+ ULTIMATE.start_bubbleSort_~numbers.offset (* 4 ULTIMATE.start_bubbleSort_~j~0))) (<= (+ ULTIMATE.start_bubbleSort_~numbers.offset (* 4 ULTIMATE.start_bubbleSort_~j~0) 4) (select |#length| ULTIMATE.start_bubbleSort_~numbers.base)) (<= (* 2 (select |#length| |ULTIMATE.start_main_#t~malloc9.base|)) (+ ULTIMATE.start_bubbleSort_~numbers.offset (* 4 ULTIMATE.start_bubbleSort_~j~0) oldRank0)))} is VALID [2020-07-29 01:35:09,355 INFO L280 TraceCheckUtils]: 2: Hoare triple {1274#(and (= ULTIMATE.start_bubbleSort_~numbers.base |ULTIMATE.start_main_#t~malloc9.base|) (<= 4 (+ ULTIMATE.start_bubbleSort_~numbers.offset (* 4 ULTIMATE.start_bubbleSort_~j~0))) (<= (+ ULTIMATE.start_bubbleSort_~numbers.offset (* 4 ULTIMATE.start_bubbleSort_~j~0) 4) (select |#length| ULTIMATE.start_bubbleSort_~numbers.base)) (<= (* 2 (select |#length| |ULTIMATE.start_main_#t~malloc9.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; {1229#(and (= ULTIMATE.start_bubbleSort_~numbers.base |ULTIMATE.start_main_#t~malloc9.base|) (or unseeded (and (> oldRank0 (+ (* (- 1) ULTIMATE.start_bubbleSort_~numbers.offset) (* (- 4) ULTIMATE.start_bubbleSort_~j~0) (* 2 (select |#length| |ULTIMATE.start_main_#t~malloc9.base|)))) (>= oldRank0 0))))} is VALID [2020-07-29 01:35:09,356 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 01:35:09,356 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states. [2020-07-29 01:35:09,371 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 15 edges. 15 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-29 01:35:09,371 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 14 letters. Loop has 3 letters. [2020-07-29 01:35:09,372 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:35:09,372 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.2 stem predicates 2 loop predicates [2020-07-29 01:35:09,374 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 26 states and 35 transitions. cyclomatic complexity: 11 Second operand 4 states. [2020-07-29 01:35:09,469 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 26 states and 35 transitions. cyclomatic complexity: 11. Second operand 4 states. Result 50 states and 70 transitions. Complement of second has 8 states. [2020-07-29 01:35:09,470 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 5 states 2 stem states 2 non-accepting loop states 1 accepting loop states [2020-07-29 01:35:09,470 INFO L123 tractBuchiDifference]: Start testing correctness of buchiDifferenceNCSBLazy3 [2020-07-29 01:35:09,470 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 26 states and 35 transitions. cyclomatic complexity: 11 [2020-07-29 01:35:09,470 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 01:35:09,470 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 01:35:09,470 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 4 states. [2020-07-29 01:35:09,471 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2020-07-29 01:35:09,471 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 01:35:09,471 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 01:35:09,471 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 50 states and 70 transitions. [2020-07-29 01:35:09,472 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2020-07-29 01:35:09,473 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 01:35:09,473 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 01:35:09,474 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 26 states and 35 transitions. cyclomatic complexity: 11 [2020-07-29 01:35:09,477 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 3 examples of accepted words. [2020-07-29 01:35:09,480 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 4 states. [2020-07-29 01:35:09,481 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2020-07-29 01:35:09,482 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 1 examples of accepted words. [2020-07-29 01:35:09,482 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 50 states and 70 transitions. cyclomatic complexity: 24 [2020-07-29 01:35:09,483 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 3 examples of accepted words. [2020-07-29 01:35:09,487 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 26 states and 35 transitions. cyclomatic complexity: 11 Stem has 14 letters. Loop has 3 letters. [2020-07-29 01:35:09,488 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:35:09,488 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 14 letters. Loop has 3 letters. [2020-07-29 01:35:09,489 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:35:09,489 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 50 states and 70 transitions. cyclomatic complexity: 24 Stem has 14 letters. Loop has 3 letters. [2020-07-29 01:35:09,490 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:35:09,490 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 26 states and 35 transitions. cyclomatic complexity: 11 Stem has 2 letters. Loop has 2 letters. [2020-07-29 01:35:09,490 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:35:09,491 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 2 letters. Loop has 2 letters. [2020-07-29 01:35:09,491 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:35:09,491 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 50 states and 70 transitions. cyclomatic complexity: 24 Stem has 2 letters. Loop has 2 letters. [2020-07-29 01:35:09,492 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:35:09,492 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 26 states and 35 transitions. cyclomatic complexity: 11 Stem has 14 letters. Loop has 3 letters. [2020-07-29 01:35:09,492 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:35:09,492 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 14 letters. Loop has 3 letters. [2020-07-29 01:35:09,493 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:35:09,493 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 50 states and 70 transitions. cyclomatic complexity: 24 Stem has 14 letters. Loop has 3 letters. [2020-07-29 01:35:09,493 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:35:09,493 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 26 states and 35 transitions. cyclomatic complexity: 11 Stem has 50 letters. Loop has 50 letters. [2020-07-29 01:35:09,493 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:35:09,494 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 50 letters. Loop has 50 letters. [2020-07-29 01:35:09,494 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:35:09,494 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 50 states and 70 transitions. cyclomatic complexity: 24 Stem has 50 letters. Loop has 50 letters. [2020-07-29 01:35:09,494 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:35:09,494 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 26 states and 35 transitions. cyclomatic complexity: 11 Stem has 26 letters. Loop has 26 letters. [2020-07-29 01:35:09,495 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:35:09,495 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 26 letters. Loop has 26 letters. [2020-07-29 01:35:09,495 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:35:09,495 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 50 states and 70 transitions. cyclomatic complexity: 24 Stem has 26 letters. Loop has 26 letters. [2020-07-29 01:35:09,495 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:35:09,495 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 26 states and 35 transitions. cyclomatic complexity: 11 Stem has 5 letters. Loop has 5 letters. [2020-07-29 01:35:09,496 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:35:09,496 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 5 letters. Loop has 5 letters. [2020-07-29 01:35:09,496 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:35:09,496 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 50 states and 70 transitions. cyclomatic complexity: 24 Stem has 5 letters. Loop has 5 letters. [2020-07-29 01:35:09,497 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:35:09,497 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 26 states and 35 transitions. cyclomatic complexity: 11 Stem has 16 letters. Loop has 3 letters. [2020-07-29 01:35:09,497 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:35:09,497 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 16 letters. Loop has 3 letters. [2020-07-29 01:35:09,497 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:35:09,498 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 50 states and 70 transitions. cyclomatic complexity: 24 Stem has 16 letters. Loop has 3 letters. [2020-07-29 01:35:09,498 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:35:09,498 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 26 states and 35 transitions. cyclomatic complexity: 11 Stem has 14 letters. Loop has 3 letters. [2020-07-29 01:35:09,498 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:35:09,499 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 14 letters. Loop has 3 letters. [2020-07-29 01:35:09,499 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:35:09,499 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 50 states and 70 transitions. cyclomatic complexity: 24 Stem has 14 letters. Loop has 3 letters. [2020-07-29 01:35:09,499 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:35:09,499 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 26 states and 35 transitions. cyclomatic complexity: 11 Stem has 15 letters. Loop has 3 letters. [2020-07-29 01:35:09,500 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:35:09,500 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 15 letters. Loop has 3 letters. [2020-07-29 01:35:09,500 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:35:09,500 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 50 states and 70 transitions. cyclomatic complexity: 24 Stem has 15 letters. Loop has 3 letters. [2020-07-29 01:35:09,500 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:35:09,501 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 26 states and 35 transitions. cyclomatic complexity: 11 Stem has 2 letters. Loop has 2 letters. [2020-07-29 01:35:09,501 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:35:09,501 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 2 letters. Loop has 2 letters. [2020-07-29 01:35:09,501 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:35:09,501 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 50 states and 70 transitions. cyclomatic complexity: 24 Stem has 2 letters. Loop has 2 letters. [2020-07-29 01:35:09,502 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:35:09,502 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 26 states and 35 transitions. cyclomatic complexity: 11 Stem has 16 letters. Loop has 3 letters. [2020-07-29 01:35:09,502 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:35:09,502 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 16 letters. Loop has 3 letters. [2020-07-29 01:35:09,502 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:35:09,503 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 50 states and 70 transitions. cyclomatic complexity: 24 Stem has 16 letters. Loop has 3 letters. [2020-07-29 01:35:09,503 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:35:09,503 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 26 states and 35 transitions. cyclomatic complexity: 11 Stem has 14 letters. Loop has 3 letters. [2020-07-29 01:35:09,503 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:35:09,504 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 14 letters. Loop has 3 letters. [2020-07-29 01:35:09,504 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:35:09,505 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 50 states and 70 transitions. cyclomatic complexity: 24 Stem has 14 letters. Loop has 3 letters. [2020-07-29 01:35:09,505 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:35:09,505 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 26 states and 35 transitions. cyclomatic complexity: 11 Stem has 15 letters. Loop has 3 letters. [2020-07-29 01:35:09,505 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:35:09,506 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 15 letters. Loop has 3 letters. [2020-07-29 01:35:09,506 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:35:09,506 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 50 states and 70 transitions. cyclomatic complexity: 24 Stem has 15 letters. Loop has 3 letters. [2020-07-29 01:35:09,506 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:35:09,506 INFO L161 tractBuchiDifference]: Finished testing correctness of buchiDifferenceNCSBLazy3 [2020-07-29 01:35:09,507 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2020-07-29 01:35:09,508 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 12 transitions. [2020-07-29 01:35:09,509 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 12 transitions. Stem has 14 letters. Loop has 3 letters. [2020-07-29 01:35:09,509 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:35:09,509 INFO L639 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2020-07-29 01:35:09,536 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 01:35:09,552 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:35:09,553 INFO L263 TraceCheckSpWp]: Trace formula consists of 83 conjuncts, 8 conjunts are in the unsatisfiable core [2020-07-29 01:35:09,560 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:35:09,561 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-29 01:35:09,577 INFO L280 TraceCheckUtils]: 0: Hoare triple {1177#unseeded} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; {1177#unseeded} is VALID [2020-07-29 01:35:09,577 INFO L280 TraceCheckUtils]: 1: Hoare triple {1177#unseeded} havoc main_#res;havoc main_#t~nondet8, main_#t~malloc9.base, main_#t~malloc9.offset, main_~array_size~0, main_~numbers~0.base, main_~numbers~0.offset;main_~array_size~0 := main_#t~nondet8;havoc main_#t~nondet8; {1177#unseeded} is VALID [2020-07-29 01:35:09,582 INFO L280 TraceCheckUtils]: 2: Hoare triple {1177#unseeded} assume !(main_~array_size~0 < 1); {1177#unseeded} is VALID [2020-07-29 01:35:09,583 INFO L280 TraceCheckUtils]: 3: Hoare triple {1177#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;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; {1226#(and (= ULTIMATE.start_bubbleSort_~numbers.base |ULTIMATE.start_main_#t~malloc9.base|) unseeded)} is VALID [2020-07-29 01:35:09,584 INFO L280 TraceCheckUtils]: 4: Hoare triple {1226#(and (= ULTIMATE.start_bubbleSort_~numbers.base |ULTIMATE.start_main_#t~malloc9.base|) unseeded)} assume !!(bubbleSort_~i~0 >= 0);bubbleSort_~j~0 := 1; {1226#(and (= ULTIMATE.start_bubbleSort_~numbers.base |ULTIMATE.start_main_#t~malloc9.base|) unseeded)} is VALID [2020-07-29 01:35:09,584 INFO L280 TraceCheckUtils]: 5: Hoare triple {1226#(and (= ULTIMATE.start_bubbleSort_~numbers.base |ULTIMATE.start_main_#t~malloc9.base|) unseeded)} 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); {1226#(and (= ULTIMATE.start_bubbleSort_~numbers.base |ULTIMATE.start_main_#t~malloc9.base|) unseeded)} is VALID [2020-07-29 01:35:09,585 INFO L280 TraceCheckUtils]: 6: Hoare triple {1226#(and (= ULTIMATE.start_bubbleSort_~numbers.base |ULTIMATE.start_main_#t~malloc9.base|) unseeded)} assume !(bubbleSort_#t~mem4 > bubbleSort_#t~mem5);havoc bubbleSort_#t~mem5;havoc bubbleSort_#t~mem4; {1226#(and (= ULTIMATE.start_bubbleSort_~numbers.base |ULTIMATE.start_main_#t~malloc9.base|) unseeded)} is VALID [2020-07-29 01:35:09,591 INFO L280 TraceCheckUtils]: 7: Hoare triple {1226#(and (= ULTIMATE.start_bubbleSort_~numbers.base |ULTIMATE.start_main_#t~malloc9.base|) unseeded)} bubbleSort_#t~post3 := bubbleSort_~j~0;bubbleSort_~j~0 := 1 + bubbleSort_#t~post3;havoc bubbleSort_#t~post3; {1226#(and (= ULTIMATE.start_bubbleSort_~numbers.base |ULTIMATE.start_main_#t~malloc9.base|) unseeded)} is VALID [2020-07-29 01:35:09,593 INFO L280 TraceCheckUtils]: 8: Hoare triple {1226#(and (= ULTIMATE.start_bubbleSort_~numbers.base |ULTIMATE.start_main_#t~malloc9.base|) unseeded)} 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); {1226#(and (= ULTIMATE.start_bubbleSort_~numbers.base |ULTIMATE.start_main_#t~malloc9.base|) unseeded)} is VALID [2020-07-29 01:35:09,594 INFO L280 TraceCheckUtils]: 9: Hoare triple {1226#(and (= ULTIMATE.start_bubbleSort_~numbers.base |ULTIMATE.start_main_#t~malloc9.base|) unseeded)} assume bubbleSort_#t~mem4 > bubbleSort_#t~mem5;havoc bubbleSort_#t~mem5;havoc bubbleSort_#t~mem4;call bubbleSort_#t~mem6 := read~int(bubbleSort_~numbers.base, bubbleSort_~numbers.offset + 4 * (bubbleSort_~j~0 - 1), 4);bubbleSort_~temp~0 := bubbleSort_#t~mem6;havoc bubbleSort_#t~mem6;call bubbleSort_#t~mem7 := read~int(bubbleSort_~numbers.base, bubbleSort_~numbers.offset + 4 * bubbleSort_~j~0, 4);call write~int(bubbleSort_#t~mem7, bubbleSort_~numbers.base, bubbleSort_~numbers.offset + 4 * (bubbleSort_~j~0 - 1), 4);havoc bubbleSort_#t~mem7;call write~int(bubbleSort_~temp~0, bubbleSort_~numbers.base, bubbleSort_~numbers.offset + 4 * bubbleSort_~j~0, 4); {1226#(and (= ULTIMATE.start_bubbleSort_~numbers.base |ULTIMATE.start_main_#t~malloc9.base|) unseeded)} is VALID [2020-07-29 01:35:09,594 INFO L280 TraceCheckUtils]: 10: Hoare triple {1226#(and (= ULTIMATE.start_bubbleSort_~numbers.base |ULTIMATE.start_main_#t~malloc9.base|) unseeded)} bubbleSort_#t~post3 := bubbleSort_~j~0;bubbleSort_~j~0 := 1 + bubbleSort_#t~post3;havoc bubbleSort_#t~post3; {1226#(and (= ULTIMATE.start_bubbleSort_~numbers.base |ULTIMATE.start_main_#t~malloc9.base|) unseeded)} is VALID [2020-07-29 01:35:09,596 INFO L280 TraceCheckUtils]: 11: Hoare triple {1226#(and (= ULTIMATE.start_bubbleSort_~numbers.base |ULTIMATE.start_main_#t~malloc9.base|) unseeded)} assume !(bubbleSort_~j~0 <= bubbleSort_~i~0); {1226#(and (= ULTIMATE.start_bubbleSort_~numbers.base |ULTIMATE.start_main_#t~malloc9.base|) unseeded)} is VALID [2020-07-29 01:35:09,597 INFO L280 TraceCheckUtils]: 12: Hoare triple {1226#(and (= ULTIMATE.start_bubbleSort_~numbers.base |ULTIMATE.start_main_#t~malloc9.base|) unseeded)} bubbleSort_#t~post2 := bubbleSort_~i~0;bubbleSort_~i~0 := bubbleSort_#t~post2 - 1;havoc bubbleSort_#t~post2; {1226#(and (= ULTIMATE.start_bubbleSort_~numbers.base |ULTIMATE.start_main_#t~malloc9.base|) unseeded)} is VALID [2020-07-29 01:35:09,597 INFO L280 TraceCheckUtils]: 13: Hoare triple {1226#(and (= ULTIMATE.start_bubbleSort_~numbers.base |ULTIMATE.start_main_#t~malloc9.base|) unseeded)} assume !!(bubbleSort_~i~0 >= 0);bubbleSort_~j~0 := 1; {1226#(and (= ULTIMATE.start_bubbleSort_~numbers.base |ULTIMATE.start_main_#t~malloc9.base|) unseeded)} is VALID [2020-07-29 01:35:09,604 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:35:09,605 INFO L263 TraceCheckSpWp]: Trace formula consists of 27 conjuncts, 7 conjunts are in the unsatisfiable core [2020-07-29 01:35:09,609 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:35:09,609 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-29 01:35:09,642 INFO L280 TraceCheckUtils]: 0: Hoare triple {1227#(and (= ULTIMATE.start_bubbleSort_~numbers.base |ULTIMATE.start_main_#t~malloc9.base|) (>= oldRank0 (+ (* (- 1) ULTIMATE.start_bubbleSort_~numbers.offset) (* (- 4) ULTIMATE.start_bubbleSort_~j~0) (* 2 (select |#length| |ULTIMATE.start_main_#t~malloc9.base|)))))} 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); {1388#(and (= ULTIMATE.start_bubbleSort_~numbers.base |ULTIMATE.start_main_#t~malloc9.base|) (<= 4 (+ ULTIMATE.start_bubbleSort_~numbers.offset (* 4 ULTIMATE.start_bubbleSort_~j~0))) (<= (+ ULTIMATE.start_bubbleSort_~numbers.offset (* 4 ULTIMATE.start_bubbleSort_~j~0) 4) (select |#length| ULTIMATE.start_bubbleSort_~numbers.base)) (<= (* 2 (select |#length| |ULTIMATE.start_main_#t~malloc9.base|)) (+ ULTIMATE.start_bubbleSort_~numbers.offset (* 4 ULTIMATE.start_bubbleSort_~j~0) oldRank0)))} is VALID [2020-07-29 01:35:09,645 INFO L280 TraceCheckUtils]: 1: Hoare triple {1388#(and (= ULTIMATE.start_bubbleSort_~numbers.base |ULTIMATE.start_main_#t~malloc9.base|) (<= 4 (+ ULTIMATE.start_bubbleSort_~numbers.offset (* 4 ULTIMATE.start_bubbleSort_~j~0))) (<= (+ ULTIMATE.start_bubbleSort_~numbers.offset (* 4 ULTIMATE.start_bubbleSort_~j~0) 4) (select |#length| ULTIMATE.start_bubbleSort_~numbers.base)) (<= (* 2 (select |#length| |ULTIMATE.start_main_#t~malloc9.base|)) (+ ULTIMATE.start_bubbleSort_~numbers.offset (* 4 ULTIMATE.start_bubbleSort_~j~0) oldRank0)))} assume bubbleSort_#t~mem4 > bubbleSort_#t~mem5;havoc bubbleSort_#t~mem5;havoc bubbleSort_#t~mem4;call bubbleSort_#t~mem6 := read~int(bubbleSort_~numbers.base, bubbleSort_~numbers.offset + 4 * (bubbleSort_~j~0 - 1), 4);bubbleSort_~temp~0 := bubbleSort_#t~mem6;havoc bubbleSort_#t~mem6;call bubbleSort_#t~mem7 := read~int(bubbleSort_~numbers.base, bubbleSort_~numbers.offset + 4 * bubbleSort_~j~0, 4);call write~int(bubbleSort_#t~mem7, bubbleSort_~numbers.base, bubbleSort_~numbers.offset + 4 * (bubbleSort_~j~0 - 1), 4);havoc bubbleSort_#t~mem7;call write~int(bubbleSort_~temp~0, bubbleSort_~numbers.base, bubbleSort_~numbers.offset + 4 * bubbleSort_~j~0, 4); {1388#(and (= ULTIMATE.start_bubbleSort_~numbers.base |ULTIMATE.start_main_#t~malloc9.base|) (<= 4 (+ ULTIMATE.start_bubbleSort_~numbers.offset (* 4 ULTIMATE.start_bubbleSort_~j~0))) (<= (+ ULTIMATE.start_bubbleSort_~numbers.offset (* 4 ULTIMATE.start_bubbleSort_~j~0) 4) (select |#length| ULTIMATE.start_bubbleSort_~numbers.base)) (<= (* 2 (select |#length| |ULTIMATE.start_main_#t~malloc9.base|)) (+ ULTIMATE.start_bubbleSort_~numbers.offset (* 4 ULTIMATE.start_bubbleSort_~j~0) oldRank0)))} is VALID [2020-07-29 01:35:09,658 INFO L280 TraceCheckUtils]: 2: Hoare triple {1388#(and (= ULTIMATE.start_bubbleSort_~numbers.base |ULTIMATE.start_main_#t~malloc9.base|) (<= 4 (+ ULTIMATE.start_bubbleSort_~numbers.offset (* 4 ULTIMATE.start_bubbleSort_~j~0))) (<= (+ ULTIMATE.start_bubbleSort_~numbers.offset (* 4 ULTIMATE.start_bubbleSort_~j~0) 4) (select |#length| ULTIMATE.start_bubbleSort_~numbers.base)) (<= (* 2 (select |#length| |ULTIMATE.start_main_#t~malloc9.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; {1229#(and (= ULTIMATE.start_bubbleSort_~numbers.base |ULTIMATE.start_main_#t~malloc9.base|) (or unseeded (and (> oldRank0 (+ (* (- 1) ULTIMATE.start_bubbleSort_~numbers.offset) (* (- 4) ULTIMATE.start_bubbleSort_~j~0) (* 2 (select |#length| |ULTIMATE.start_main_#t~malloc9.base|)))) (>= oldRank0 0))))} is VALID [2020-07-29 01:35:09,658 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 01:35:09,659 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states. [2020-07-29 01:35:09,673 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 15 edges. 15 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-29 01:35:09,674 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 14 letters. Loop has 3 letters. [2020-07-29 01:35:09,674 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:35:09,674 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and with honda bouncer for loop.2 stem predicates 2 loop predicates [2020-07-29 01:35:09,675 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 26 states and 35 transitions. cyclomatic complexity: 11 Second operand 4 states. [2020-07-29 01:35:09,748 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 26 states and 35 transitions. cyclomatic complexity: 11. Second operand 4 states. Result 50 states and 70 transitions. Complement of second has 8 states. [2020-07-29 01:35:09,748 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 5 states 2 stem states 2 non-accepting loop states 1 accepting loop states [2020-07-29 01:35:09,748 INFO L123 tractBuchiDifference]: Start testing correctness of buchiDifferenceNCSBLazy3 [2020-07-29 01:35:09,748 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 26 states and 35 transitions. cyclomatic complexity: 11 [2020-07-29 01:35:09,749 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 01:35:09,749 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 01:35:09,749 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 4 states. [2020-07-29 01:35:09,750 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2020-07-29 01:35:09,750 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 01:35:09,750 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 01:35:09,751 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 50 states and 70 transitions. [2020-07-29 01:35:09,751 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2020-07-29 01:35:09,751 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 01:35:09,752 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 01:35:09,752 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 26 states and 35 transitions. cyclomatic complexity: 11 [2020-07-29 01:35:09,752 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 3 examples of accepted words. [2020-07-29 01:35:09,753 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 4 states. [2020-07-29 01:35:09,753 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2020-07-29 01:35:09,753 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 1 examples of accepted words. [2020-07-29 01:35:09,754 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 50 states and 70 transitions. cyclomatic complexity: 24 [2020-07-29 01:35:09,754 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 3 examples of accepted words. [2020-07-29 01:35:09,754 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 26 states and 35 transitions. cyclomatic complexity: 11 Stem has 14 letters. Loop has 3 letters. [2020-07-29 01:35:09,755 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:35:09,755 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 14 letters. Loop has 3 letters. [2020-07-29 01:35:09,755 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:35:09,755 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 50 states and 70 transitions. cyclomatic complexity: 24 Stem has 14 letters. Loop has 3 letters. [2020-07-29 01:35:09,756 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:35:09,756 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 26 states and 35 transitions. cyclomatic complexity: 11 Stem has 2 letters. Loop has 2 letters. [2020-07-29 01:35:09,756 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:35:09,756 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 2 letters. Loop has 2 letters. [2020-07-29 01:35:09,756 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:35:09,757 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 50 states and 70 transitions. cyclomatic complexity: 24 Stem has 2 letters. Loop has 2 letters. [2020-07-29 01:35:09,757 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:35:09,757 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 26 states and 35 transitions. cyclomatic complexity: 11 Stem has 14 letters. Loop has 3 letters. [2020-07-29 01:35:09,757 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:35:09,757 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 14 letters. Loop has 3 letters. [2020-07-29 01:35:09,758 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:35:09,758 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 50 states and 70 transitions. cyclomatic complexity: 24 Stem has 14 letters. Loop has 3 letters. [2020-07-29 01:35:09,758 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:35:09,758 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 26 states and 35 transitions. cyclomatic complexity: 11 Stem has 50 letters. Loop has 50 letters. [2020-07-29 01:35:09,759 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:35:09,759 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 50 letters. Loop has 50 letters. [2020-07-29 01:35:09,759 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:35:09,759 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 50 states and 70 transitions. cyclomatic complexity: 24 Stem has 50 letters. Loop has 50 letters. [2020-07-29 01:35:09,759 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:35:09,760 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 26 states and 35 transitions. cyclomatic complexity: 11 Stem has 26 letters. Loop has 26 letters. [2020-07-29 01:35:09,760 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:35:09,760 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 26 letters. Loop has 26 letters. [2020-07-29 01:35:09,760 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:35:09,760 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 50 states and 70 transitions. cyclomatic complexity: 24 Stem has 26 letters. Loop has 26 letters. [2020-07-29 01:35:09,761 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:35:09,761 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 26 states and 35 transitions. cyclomatic complexity: 11 Stem has 5 letters. Loop has 5 letters. [2020-07-29 01:35:09,761 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:35:09,761 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 5 letters. Loop has 5 letters. [2020-07-29 01:35:09,761 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:35:09,761 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 50 states and 70 transitions. cyclomatic complexity: 24 Stem has 5 letters. Loop has 5 letters. [2020-07-29 01:35:09,762 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:35:09,762 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 26 states and 35 transitions. cyclomatic complexity: 11 Stem has 16 letters. Loop has 3 letters. [2020-07-29 01:35:09,762 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:35:09,762 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 16 letters. Loop has 3 letters. [2020-07-29 01:35:09,762 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:35:09,763 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 50 states and 70 transitions. cyclomatic complexity: 24 Stem has 16 letters. Loop has 3 letters. [2020-07-29 01:35:09,763 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:35:09,763 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 26 states and 35 transitions. cyclomatic complexity: 11 Stem has 14 letters. Loop has 3 letters. [2020-07-29 01:35:09,763 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:35:09,764 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 14 letters. Loop has 3 letters. [2020-07-29 01:35:09,764 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:35:09,764 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 50 states and 70 transitions. cyclomatic complexity: 24 Stem has 14 letters. Loop has 3 letters. [2020-07-29 01:35:09,764 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:35:09,764 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 26 states and 35 transitions. cyclomatic complexity: 11 Stem has 15 letters. Loop has 3 letters. [2020-07-29 01:35:09,765 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:35:09,765 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 15 letters. Loop has 3 letters. [2020-07-29 01:35:09,765 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:35:09,765 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 50 states and 70 transitions. cyclomatic complexity: 24 Stem has 15 letters. Loop has 3 letters. [2020-07-29 01:35:09,765 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:35:09,766 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 26 states and 35 transitions. cyclomatic complexity: 11 Stem has 2 letters. Loop has 2 letters. [2020-07-29 01:35:09,766 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:35:09,766 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 2 letters. Loop has 2 letters. [2020-07-29 01:35:09,766 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:35:09,766 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 50 states and 70 transitions. cyclomatic complexity: 24 Stem has 2 letters. Loop has 2 letters. [2020-07-29 01:35:09,767 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:35:09,767 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 26 states and 35 transitions. cyclomatic complexity: 11 Stem has 15 letters. Loop has 3 letters. [2020-07-29 01:35:09,767 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:35:09,767 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 15 letters. Loop has 3 letters. [2020-07-29 01:35:09,767 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:35:09,768 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 50 states and 70 transitions. cyclomatic complexity: 24 Stem has 15 letters. Loop has 3 letters. [2020-07-29 01:35:09,768 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:35:09,768 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 26 states and 35 transitions. cyclomatic complexity: 11 Stem has 16 letters. Loop has 3 letters. [2020-07-29 01:35:09,768 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:35:09,769 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 16 letters. Loop has 3 letters. [2020-07-29 01:35:09,769 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:35:09,769 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 50 states and 70 transitions. cyclomatic complexity: 24 Stem has 16 letters. Loop has 3 letters. [2020-07-29 01:35:09,769 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:35:09,769 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 26 states and 35 transitions. cyclomatic complexity: 11 Stem has 14 letters. Loop has 3 letters. [2020-07-29 01:35:09,770 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:35:09,770 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 14 letters. Loop has 3 letters. [2020-07-29 01:35:09,770 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:35:09,770 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 50 states and 70 transitions. cyclomatic complexity: 24 Stem has 14 letters. Loop has 3 letters. [2020-07-29 01:35:09,771 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:35:09,771 INFO L161 tractBuchiDifference]: Finished testing correctness of buchiDifferenceNCSBLazy3 [2020-07-29 01:35:09,771 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2020-07-29 01:35:09,772 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 12 transitions. [2020-07-29 01:35:09,772 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 12 transitions. Stem has 14 letters. Loop has 3 letters. [2020-07-29 01:35:09,772 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:35:09,772 INFO L639 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2020-07-29 01:35:09,797 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 01:35:09,811 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:35:09,812 INFO L263 TraceCheckSpWp]: Trace formula consists of 83 conjuncts, 8 conjunts are in the unsatisfiable core [2020-07-29 01:35:09,819 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:35:09,820 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-29 01:35:09,840 INFO L280 TraceCheckUtils]: 0: Hoare triple {1177#unseeded} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; {1177#unseeded} is VALID [2020-07-29 01:35:09,847 INFO L280 TraceCheckUtils]: 1: Hoare triple {1177#unseeded} havoc main_#res;havoc main_#t~nondet8, main_#t~malloc9.base, main_#t~malloc9.offset, main_~array_size~0, main_~numbers~0.base, main_~numbers~0.offset;main_~array_size~0 := main_#t~nondet8;havoc main_#t~nondet8; {1177#unseeded} is VALID [2020-07-29 01:35:09,849 INFO L280 TraceCheckUtils]: 2: Hoare triple {1177#unseeded} assume !(main_~array_size~0 < 1); {1177#unseeded} is VALID [2020-07-29 01:35:09,850 INFO L280 TraceCheckUtils]: 3: Hoare triple {1177#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;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; {1226#(and (= ULTIMATE.start_bubbleSort_~numbers.base |ULTIMATE.start_main_#t~malloc9.base|) unseeded)} is VALID [2020-07-29 01:35:09,851 INFO L280 TraceCheckUtils]: 4: Hoare triple {1226#(and (= ULTIMATE.start_bubbleSort_~numbers.base |ULTIMATE.start_main_#t~malloc9.base|) unseeded)} assume !!(bubbleSort_~i~0 >= 0);bubbleSort_~j~0 := 1; {1226#(and (= ULTIMATE.start_bubbleSort_~numbers.base |ULTIMATE.start_main_#t~malloc9.base|) unseeded)} is VALID [2020-07-29 01:35:09,851 INFO L280 TraceCheckUtils]: 5: Hoare triple {1226#(and (= ULTIMATE.start_bubbleSort_~numbers.base |ULTIMATE.start_main_#t~malloc9.base|) unseeded)} 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); {1226#(and (= ULTIMATE.start_bubbleSort_~numbers.base |ULTIMATE.start_main_#t~malloc9.base|) unseeded)} is VALID [2020-07-29 01:35:09,854 INFO L280 TraceCheckUtils]: 6: Hoare triple {1226#(and (= ULTIMATE.start_bubbleSort_~numbers.base |ULTIMATE.start_main_#t~malloc9.base|) unseeded)} assume !(bubbleSort_#t~mem4 > bubbleSort_#t~mem5);havoc bubbleSort_#t~mem5;havoc bubbleSort_#t~mem4; {1226#(and (= ULTIMATE.start_bubbleSort_~numbers.base |ULTIMATE.start_main_#t~malloc9.base|) unseeded)} is VALID [2020-07-29 01:35:09,855 INFO L280 TraceCheckUtils]: 7: Hoare triple {1226#(and (= ULTIMATE.start_bubbleSort_~numbers.base |ULTIMATE.start_main_#t~malloc9.base|) unseeded)} bubbleSort_#t~post3 := bubbleSort_~j~0;bubbleSort_~j~0 := 1 + bubbleSort_#t~post3;havoc bubbleSort_#t~post3; {1226#(and (= ULTIMATE.start_bubbleSort_~numbers.base |ULTIMATE.start_main_#t~malloc9.base|) unseeded)} is VALID [2020-07-29 01:35:09,856 INFO L280 TraceCheckUtils]: 8: Hoare triple {1226#(and (= ULTIMATE.start_bubbleSort_~numbers.base |ULTIMATE.start_main_#t~malloc9.base|) unseeded)} 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); {1226#(and (= ULTIMATE.start_bubbleSort_~numbers.base |ULTIMATE.start_main_#t~malloc9.base|) unseeded)} is VALID [2020-07-29 01:35:09,856 INFO L280 TraceCheckUtils]: 9: Hoare triple {1226#(and (= ULTIMATE.start_bubbleSort_~numbers.base |ULTIMATE.start_main_#t~malloc9.base|) unseeded)} assume bubbleSort_#t~mem4 > bubbleSort_#t~mem5;havoc bubbleSort_#t~mem5;havoc bubbleSort_#t~mem4;call bubbleSort_#t~mem6 := read~int(bubbleSort_~numbers.base, bubbleSort_~numbers.offset + 4 * (bubbleSort_~j~0 - 1), 4);bubbleSort_~temp~0 := bubbleSort_#t~mem6;havoc bubbleSort_#t~mem6;call bubbleSort_#t~mem7 := read~int(bubbleSort_~numbers.base, bubbleSort_~numbers.offset + 4 * bubbleSort_~j~0, 4);call write~int(bubbleSort_#t~mem7, bubbleSort_~numbers.base, bubbleSort_~numbers.offset + 4 * (bubbleSort_~j~0 - 1), 4);havoc bubbleSort_#t~mem7;call write~int(bubbleSort_~temp~0, bubbleSort_~numbers.base, bubbleSort_~numbers.offset + 4 * bubbleSort_~j~0, 4); {1226#(and (= ULTIMATE.start_bubbleSort_~numbers.base |ULTIMATE.start_main_#t~malloc9.base|) unseeded)} is VALID [2020-07-29 01:35:09,857 INFO L280 TraceCheckUtils]: 10: Hoare triple {1226#(and (= ULTIMATE.start_bubbleSort_~numbers.base |ULTIMATE.start_main_#t~malloc9.base|) unseeded)} bubbleSort_#t~post3 := bubbleSort_~j~0;bubbleSort_~j~0 := 1 + bubbleSort_#t~post3;havoc bubbleSort_#t~post3; {1226#(and (= ULTIMATE.start_bubbleSort_~numbers.base |ULTIMATE.start_main_#t~malloc9.base|) unseeded)} is VALID [2020-07-29 01:35:09,857 INFO L280 TraceCheckUtils]: 11: Hoare triple {1226#(and (= ULTIMATE.start_bubbleSort_~numbers.base |ULTIMATE.start_main_#t~malloc9.base|) unseeded)} assume !(bubbleSort_~j~0 <= bubbleSort_~i~0); {1226#(and (= ULTIMATE.start_bubbleSort_~numbers.base |ULTIMATE.start_main_#t~malloc9.base|) unseeded)} is VALID [2020-07-29 01:35:09,858 INFO L280 TraceCheckUtils]: 12: Hoare triple {1226#(and (= ULTIMATE.start_bubbleSort_~numbers.base |ULTIMATE.start_main_#t~malloc9.base|) unseeded)} bubbleSort_#t~post2 := bubbleSort_~i~0;bubbleSort_~i~0 := bubbleSort_#t~post2 - 1;havoc bubbleSort_#t~post2; {1226#(and (= ULTIMATE.start_bubbleSort_~numbers.base |ULTIMATE.start_main_#t~malloc9.base|) unseeded)} is VALID [2020-07-29 01:35:09,860 INFO L280 TraceCheckUtils]: 13: Hoare triple {1226#(and (= ULTIMATE.start_bubbleSort_~numbers.base |ULTIMATE.start_main_#t~malloc9.base|) unseeded)} assume !!(bubbleSort_~i~0 >= 0);bubbleSort_~j~0 := 1; {1226#(and (= ULTIMATE.start_bubbleSort_~numbers.base |ULTIMATE.start_main_#t~malloc9.base|) unseeded)} is VALID [2020-07-29 01:35:09,867 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:35:09,867 INFO L263 TraceCheckSpWp]: Trace formula consists of 27 conjuncts, 7 conjunts are in the unsatisfiable core [2020-07-29 01:35:09,872 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:35:09,873 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-29 01:35:09,913 INFO L280 TraceCheckUtils]: 0: Hoare triple {1227#(and (= ULTIMATE.start_bubbleSort_~numbers.base |ULTIMATE.start_main_#t~malloc9.base|) (>= oldRank0 (+ (* (- 1) ULTIMATE.start_bubbleSort_~numbers.offset) (* (- 4) ULTIMATE.start_bubbleSort_~j~0) (* 2 (select |#length| |ULTIMATE.start_main_#t~malloc9.base|)))))} 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); {1502#(and (= ULTIMATE.start_bubbleSort_~numbers.base |ULTIMATE.start_main_#t~malloc9.base|) (<= 4 (+ ULTIMATE.start_bubbleSort_~numbers.offset (* 4 ULTIMATE.start_bubbleSort_~j~0))) (<= (+ ULTIMATE.start_bubbleSort_~numbers.offset (* 4 ULTIMATE.start_bubbleSort_~j~0) 4) (select |#length| ULTIMATE.start_bubbleSort_~numbers.base)) (<= (* 2 (select |#length| |ULTIMATE.start_main_#t~malloc9.base|)) (+ ULTIMATE.start_bubbleSort_~numbers.offset (* 4 ULTIMATE.start_bubbleSort_~j~0) oldRank0)))} is VALID [2020-07-29 01:35:09,914 INFO L280 TraceCheckUtils]: 1: Hoare triple {1502#(and (= ULTIMATE.start_bubbleSort_~numbers.base |ULTIMATE.start_main_#t~malloc9.base|) (<= 4 (+ ULTIMATE.start_bubbleSort_~numbers.offset (* 4 ULTIMATE.start_bubbleSort_~j~0))) (<= (+ ULTIMATE.start_bubbleSort_~numbers.offset (* 4 ULTIMATE.start_bubbleSort_~j~0) 4) (select |#length| ULTIMATE.start_bubbleSort_~numbers.base)) (<= (* 2 (select |#length| |ULTIMATE.start_main_#t~malloc9.base|)) (+ ULTIMATE.start_bubbleSort_~numbers.offset (* 4 ULTIMATE.start_bubbleSort_~j~0) oldRank0)))} assume bubbleSort_#t~mem4 > bubbleSort_#t~mem5;havoc bubbleSort_#t~mem5;havoc bubbleSort_#t~mem4;call bubbleSort_#t~mem6 := read~int(bubbleSort_~numbers.base, bubbleSort_~numbers.offset + 4 * (bubbleSort_~j~0 - 1), 4);bubbleSort_~temp~0 := bubbleSort_#t~mem6;havoc bubbleSort_#t~mem6;call bubbleSort_#t~mem7 := read~int(bubbleSort_~numbers.base, bubbleSort_~numbers.offset + 4 * bubbleSort_~j~0, 4);call write~int(bubbleSort_#t~mem7, bubbleSort_~numbers.base, bubbleSort_~numbers.offset + 4 * (bubbleSort_~j~0 - 1), 4);havoc bubbleSort_#t~mem7;call write~int(bubbleSort_~temp~0, bubbleSort_~numbers.base, bubbleSort_~numbers.offset + 4 * bubbleSort_~j~0, 4); {1502#(and (= ULTIMATE.start_bubbleSort_~numbers.base |ULTIMATE.start_main_#t~malloc9.base|) (<= 4 (+ ULTIMATE.start_bubbleSort_~numbers.offset (* 4 ULTIMATE.start_bubbleSort_~j~0))) (<= (+ ULTIMATE.start_bubbleSort_~numbers.offset (* 4 ULTIMATE.start_bubbleSort_~j~0) 4) (select |#length| ULTIMATE.start_bubbleSort_~numbers.base)) (<= (* 2 (select |#length| |ULTIMATE.start_main_#t~malloc9.base|)) (+ ULTIMATE.start_bubbleSort_~numbers.offset (* 4 ULTIMATE.start_bubbleSort_~j~0) oldRank0)))} is VALID [2020-07-29 01:35:09,915 INFO L280 TraceCheckUtils]: 2: Hoare triple {1502#(and (= ULTIMATE.start_bubbleSort_~numbers.base |ULTIMATE.start_main_#t~malloc9.base|) (<= 4 (+ ULTIMATE.start_bubbleSort_~numbers.offset (* 4 ULTIMATE.start_bubbleSort_~j~0))) (<= (+ ULTIMATE.start_bubbleSort_~numbers.offset (* 4 ULTIMATE.start_bubbleSort_~j~0) 4) (select |#length| ULTIMATE.start_bubbleSort_~numbers.base)) (<= (* 2 (select |#length| |ULTIMATE.start_main_#t~malloc9.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; {1229#(and (= ULTIMATE.start_bubbleSort_~numbers.base |ULTIMATE.start_main_#t~malloc9.base|) (or unseeded (and (> oldRank0 (+ (* (- 1) ULTIMATE.start_bubbleSort_~numbers.offset) (* (- 4) ULTIMATE.start_bubbleSort_~j~0) (* 2 (select |#length| |ULTIMATE.start_main_#t~malloc9.base|)))) (>= oldRank0 0))))} is VALID [2020-07-29 01:35:09,916 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 01:35:09,916 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states. [2020-07-29 01:35:09,930 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 15 edges. 15 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-29 01:35:09,930 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 14 letters. Loop has 3 letters. [2020-07-29 01:35:09,930 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:35:09,931 INFO L152 lantAutomatonBouncer]: Defining Buchi interpolant automaton with scrooge nondeterminism in stemwith honda bouncer for stem and without honda bouncer for loop.2 stem predicates 2 loop predicates [2020-07-29 01:35:09,931 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 26 states and 35 transitions. cyclomatic complexity: 11 Second operand 4 states. [2020-07-29 01:35:10,022 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 26 states and 35 transitions. cyclomatic complexity: 11. Second operand 4 states. Result 41 states and 58 transitions. Complement of second has 7 states. [2020-07-29 01:35:10,022 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 5 states 2 stem states 2 non-accepting loop states 1 accepting loop states [2020-07-29 01:35:10,022 INFO L123 tractBuchiDifference]: Start testing correctness of buchiDifferenceNCSBLazy3 [2020-07-29 01:35:10,022 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 26 states and 35 transitions. cyclomatic complexity: 11 [2020-07-29 01:35:10,022 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 01:35:10,022 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 01:35:10,022 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 4 states. [2020-07-29 01:35:10,023 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2020-07-29 01:35:10,023 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 01:35:10,024 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 01:35:10,024 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 41 states and 58 transitions. [2020-07-29 01:35:10,024 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2020-07-29 01:35:10,024 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2020-07-29 01:35:10,025 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 26 states and 35 transitions. cyclomatic complexity: 11 [2020-07-29 01:35:10,025 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 3 examples of accepted words. [2020-07-29 01:35:10,025 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 4 states. [2020-07-29 01:35:10,026 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2020-07-29 01:35:10,026 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 1 examples of accepted words. [2020-07-29 01:35:10,026 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 41 states and 58 transitions. cyclomatic complexity: 19 [2020-07-29 01:35:10,026 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 41 states and 58 transitions. cyclomatic complexity: 19 [2020-07-29 01:35:10,026 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2020-07-29 01:35:10,026 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 0 examples of accepted words. [2020-07-29 01:35:10,026 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 26 states and 35 transitions. cyclomatic complexity: 11 Stem has 14 letters. Loop has 3 letters. [2020-07-29 01:35:10,027 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:35:10,027 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 14 letters. Loop has 3 letters. [2020-07-29 01:35:10,027 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:35:10,027 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 41 states and 58 transitions. cyclomatic complexity: 19 Stem has 14 letters. Loop has 3 letters. [2020-07-29 01:35:10,027 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:35:10,027 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 26 states and 35 transitions. cyclomatic complexity: 11 Stem has 2 letters. Loop has 2 letters. [2020-07-29 01:35:10,028 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:35:10,028 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 2 letters. Loop has 2 letters. [2020-07-29 01:35:10,028 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:35:10,028 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 41 states and 58 transitions. cyclomatic complexity: 19 Stem has 2 letters. Loop has 2 letters. [2020-07-29 01:35:10,028 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:35:10,028 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 26 states and 35 transitions. cyclomatic complexity: 11 Stem has 41 letters. Loop has 41 letters. [2020-07-29 01:35:10,028 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:35:10,028 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 41 letters. Loop has 41 letters. [2020-07-29 01:35:10,028 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:35:10,029 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 41 states and 58 transitions. cyclomatic complexity: 19 Stem has 41 letters. Loop has 41 letters. [2020-07-29 01:35:10,029 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:35:10,029 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 26 states and 35 transitions. cyclomatic complexity: 11 Stem has 26 letters. Loop has 26 letters. [2020-07-29 01:35:10,029 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:35:10,029 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 26 letters. Loop has 26 letters. [2020-07-29 01:35:10,029 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:35:10,029 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 41 states and 58 transitions. cyclomatic complexity: 19 Stem has 26 letters. Loop has 26 letters. [2020-07-29 01:35:10,029 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:35:10,029 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 26 states and 35 transitions. cyclomatic complexity: 11 Stem has 5 letters. Loop has 5 letters. [2020-07-29 01:35:10,030 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:35:10,030 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 5 letters. Loop has 5 letters. [2020-07-29 01:35:10,030 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:35:10,030 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 41 states and 58 transitions. cyclomatic complexity: 19 Stem has 5 letters. Loop has 5 letters. [2020-07-29 01:35:10,030 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:35:10,030 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 26 states and 35 transitions. cyclomatic complexity: 11 Stem has 16 letters. Loop has 3 letters. [2020-07-29 01:35:10,030 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:35:10,030 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 16 letters. Loop has 3 letters. [2020-07-29 01:35:10,031 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:35:10,031 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 41 states and 58 transitions. cyclomatic complexity: 19 Stem has 16 letters. Loop has 3 letters. [2020-07-29 01:35:10,031 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:35:10,031 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 26 states and 35 transitions. cyclomatic complexity: 11 Stem has 14 letters. Loop has 3 letters. [2020-07-29 01:35:10,031 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:35:10,031 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 14 letters. Loop has 3 letters. [2020-07-29 01:35:10,031 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:35:10,032 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 41 states and 58 transitions. cyclomatic complexity: 19 Stem has 14 letters. Loop has 3 letters. [2020-07-29 01:35:10,032 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:35:10,032 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 26 states and 35 transitions. cyclomatic complexity: 11 Stem has 15 letters. Loop has 3 letters. [2020-07-29 01:35:10,032 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:35:10,032 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 15 letters. Loop has 3 letters. [2020-07-29 01:35:10,032 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:35:10,033 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 41 states and 58 transitions. cyclomatic complexity: 19 Stem has 15 letters. Loop has 3 letters. [2020-07-29 01:35:10,033 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:35:10,033 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 26 states and 35 transitions. cyclomatic complexity: 11 Stem has 2 letters. Loop has 2 letters. [2020-07-29 01:35:10,033 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:35:10,033 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 2 letters. Loop has 2 letters. [2020-07-29 01:35:10,033 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:35:10,033 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 41 states and 58 transitions. cyclomatic complexity: 19 Stem has 2 letters. Loop has 2 letters. [2020-07-29 01:35:10,034 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:35:10,034 INFO L161 tractBuchiDifference]: Finished testing correctness of buchiDifferenceNCSBLazy3 [2020-07-29 01:35:10,034 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2020-07-29 01:35:10,035 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 19 transitions. [2020-07-29 01:35:10,035 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 19 transitions. Stem has 14 letters. Loop has 3 letters. [2020-07-29 01:35:10,035 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:35:10,035 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 19 transitions. Stem has 17 letters. Loop has 3 letters. [2020-07-29 01:35:10,035 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:35:10,035 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 19 transitions. Stem has 14 letters. Loop has 6 letters. [2020-07-29 01:35:10,036 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:35:10,036 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 41 states and 58 transitions. cyclomatic complexity: 19 [2020-07-29 01:35:10,037 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2020-07-29 01:35:10,038 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 41 states to 0 states and 0 transitions. [2020-07-29 01:35:10,038 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2020-07-29 01:35:10,038 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2020-07-29 01:35:10,038 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2020-07-29 01:35:10,038 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-07-29 01:35:10,038 INFO L688 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2020-07-29 01:35:10,038 INFO L711 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2020-07-29 01:35:10,038 INFO L591 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2020-07-29 01:35:10,039 INFO L424 BuchiCegarLoop]: ======== Iteration 8============ [2020-07-29 01:35:10,039 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2020-07-29 01:35:10,039 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2020-07-29 01:35:10,039 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2020-07-29 01:35:10,046 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 29.07 01:35:10 BoogieIcfgContainer [2020-07-29 01:35:10,046 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2020-07-29 01:35:10,046 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2020-07-29 01:35:10,047 INFO L271 PluginConnector]: Initializing Witness Printer... [2020-07-29 01:35:10,047 INFO L275 PluginConnector]: Witness Printer initialized [2020-07-29 01:35:10,047 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.07 01:35:00" (3/4) ... [2020-07-29 01:35:10,051 INFO L140 WitnessPrinter]: No result that supports witness generation found [2020-07-29 01:35:10,051 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2020-07-29 01:35:10,053 INFO L168 Benchmark]: Toolchain (without parser) took 10694.22 ms. Allocated memory was 1.0 GB in the beginning and 1.3 GB in the end (delta: 263.2 MB). Free memory was 961.6 MB in the beginning and 1.1 GB in the end (delta: -154.8 MB). Peak memory consumption was 108.4 MB. Max. memory is 11.5 GB. [2020-07-29 01:35:10,054 INFO L168 Benchmark]: CDTParser took 0.29 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 01:35:10,055 INFO L168 Benchmark]: CACSL2BoogieTranslator took 583.70 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 87.6 MB). Free memory was 956.2 MB in the beginning and 1.1 GB in the end (delta: -112.6 MB). Peak memory consumption was 20.8 MB. Max. memory is 11.5 GB. [2020-07-29 01:35:10,055 INFO L168 Benchmark]: Boogie Procedure Inliner took 51.42 ms. Allocated memory is still 1.1 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2020-07-29 01:35:10,056 INFO L168 Benchmark]: Boogie Preprocessor took 31.92 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 7.0 MB). Peak memory consumption was 7.0 MB. Max. memory is 11.5 GB. [2020-07-29 01:35:10,056 INFO L168 Benchmark]: RCFGBuilder took 456.78 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 28.5 MB). Peak memory consumption was 28.5 MB. Max. memory is 11.5 GB. [2020-07-29 01:35:10,057 INFO L168 Benchmark]: BuchiAutomizer took 9558.81 ms. Allocated memory was 1.1 GB in the beginning and 1.3 GB in the end (delta: 175.6 MB). Free memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: -83.1 MB). Peak memory consumption was 92.5 MB. Max. memory is 11.5 GB. [2020-07-29 01:35:10,057 INFO L168 Benchmark]: Witness Printer took 5.06 ms. Allocated memory is still 1.3 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2020-07-29 01:35:10,064 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.29 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 583.70 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 87.6 MB). Free memory was 956.2 MB in the beginning and 1.1 GB in the end (delta: -112.6 MB). Peak memory consumption was 20.8 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 51.42 ms. Allocated memory is still 1.1 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * Boogie Preprocessor took 31.92 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 7.0 MB). Peak memory consumption was 7.0 MB. Max. memory is 11.5 GB. * RCFGBuilder took 456.78 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 28.5 MB). Peak memory consumption was 28.5 MB. Max. memory is 11.5 GB. * BuchiAutomizer took 9558.81 ms. Allocated memory was 1.1 GB in the beginning and 1.3 GB in the end (delta: 175.6 MB). Free memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: -83.1 MB). Peak memory consumption was 92.5 MB. Max. memory is 11.5 GB. * Witness Printer took 5.06 ms. Allocated memory is still 1.3 GB. Free memory is still 1.1 GB. There was no memory consumed. 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.traceabstraction: - StatisticsResult: Constructed decomposition of program Your program was decomposed into 7 terminating modules (4 trivial, 2 deterministic, 1 nondeterministic). One deterministic module has affine ranking function 2 * i + 1 and consists of 3 locations. One deterministic module has affine ranking function -1 * numbers + -4 * j + 2 * unknown-#length-unknown[numbers] and consists of 4 locations. One nondeterministic module has affine ranking function -1 * numbers + -4 * j + 2 * unknown-#length-unknown[__builtin_alloca (array_size * sizeof(int))] and consists of 5 locations. 4 modules have a trivial ranking function, the largest among these consists of 13 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 9.5s and 8 iterations. TraceHistogramMax:2. Analysis of lassos took 7.0s. Construction of modules took 0.3s. Büchi inclusion checks took 1.7s. Highest rank in rank-based complementation 3. Minimization of det autom 2. Minimization of nondet autom 5. Automata minimization 0.0s AutomataMinimizationTime, 6 MinimizatonAttempts, 30 StatesRemovedByMinimization, 5 NontrivialMinimizations. Non-live state removal took 0.0s Buchi closure took 0.0s. Biggest automaton had 26 states and ocurred in iteration 6. Nontrivial modules had stage [2, 0, 1, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 90 SDtfs, 95 SDslu, 97 SDs, 0 SdLazy, 161 SolverSat, 35 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.3s Time LassoAnalysisResults: nont0 unkn0 SFLI1 SFLT1 conc2 concLT0 SILN0 SILU1 SILI0 SILT0 lasso2 LassoPreprocessingBenchmarks: Lassos: inital111 mio100 ax157 hnf98 lsp67 ukn79 mio100 lsp80 div100 bol100 ite100 ukn100 eq171 hnf90 smp87 dnf100 smp100 tf104 neg100 sie104 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 0 Time: 11ms VariablesStem: 1 VariablesLoop: 0 DisjunctsStem: 1 DisjunctsLoop: 1 SupportingInvariants: 2 MotzkinApplications: 6 LassoTerminationAnalysisBenchmarks: LassoNonterminationAnalysisSatFixpoint: 3 LassoNonterminationAnalysisSatUnbounded: 0 LassoNonterminationAnalysisUnsat: 1 LassoNonterminationAnalysisUnknown: 0 LassoNonterminationAnalysisTime: 0.1s - TerminationAnalysisResult: Termination proven Buchi Automizer proved that your program is terminating RESULT: Ultimate proved your program to be correct! Received shutdown request...