./Ultimate.py --spec /storage/repos/svcomp/c/properties/termination.prp --file /storage/repos/svcomp/c/termination-memory-alloca/bubblesort-alloca_true-termination.c.i --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for termination Using default analysis Version 91b1670e Calling Ultimate with: java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx12G -Xms1G -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 /storage/repos/svcomp/c/termination-memory-alloca/bubblesort-alloca_true-termination.c.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.24-91b1670 [2018-11-28 23:19:56,017 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-28 23:19:56,020 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-28 23:19:56,037 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-28 23:19:56,038 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-28 23:19:56,040 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-28 23:19:56,042 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-28 23:19:56,045 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-28 23:19:56,048 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-28 23:19:56,055 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-28 23:19:56,057 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-28 23:19:56,060 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-28 23:19:56,061 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-28 23:19:56,062 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-28 23:19:56,067 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-28 23:19:56,069 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-28 23:19:56,072 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-28 23:19:56,075 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-28 23:19:56,080 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-28 23:19:56,081 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-28 23:19:56,083 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-28 23:19:56,084 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-28 23:19:56,087 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-28 23:19:56,087 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-28 23:19:56,087 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-28 23:19:56,088 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-28 23:19:56,089 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-28 23:19:56,090 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-28 23:19:56,091 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-28 23:19:56,093 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-28 23:19:56,093 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-28 23:19:56,094 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-28 23:19:56,094 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-28 23:19:56,094 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-28 23:19:56,095 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-28 23:19:56,096 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-28 23:19:56,096 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-64bit-Automizer_Default.epf [2018-11-28 23:19:56,113 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-28 23:19:56,113 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-28 23:19:56,115 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-11-28 23:19:56,115 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-11-28 23:19:56,115 INFO L133 SettingsManager]: * Use SBE=true [2018-11-28 23:19:56,116 INFO L131 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2018-11-28 23:19:56,116 INFO L133 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2018-11-28 23:19:56,116 INFO L133 SettingsManager]: * Use old map elimination=false [2018-11-28 23:19:56,116 INFO L133 SettingsManager]: * Use external solver (rank synthesis)=false [2018-11-28 23:19:56,116 INFO L133 SettingsManager]: * Use only trivial implications for array writes=true [2018-11-28 23:19:56,116 INFO L133 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2018-11-28 23:19:56,117 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-28 23:19:56,117 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-11-28 23:19:56,117 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-28 23:19:56,117 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-28 23:19:56,117 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2018-11-28 23:19:56,117 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2018-11-28 23:19:56,119 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2018-11-28 23:19:56,119 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-28 23:19:56,119 INFO L133 SettingsManager]: * Assume nondeterminstic values are in range=false [2018-11-28 23:19:56,120 INFO L133 SettingsManager]: * Use constant arrays=true [2018-11-28 23:19:56,120 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2018-11-28 23:19:56,120 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-28 23:19:56,121 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-28 23:19:56,121 INFO L133 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2018-11-28 23:19:56,121 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-28 23:19:56,121 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-11-28 23:19:56,121 INFO L133 SettingsManager]: * Dump automata to the following directory=/home/matthias/ultimate/dump/auto [2018-11-28 23:19:56,122 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2018-11-28 23:19:56,122 INFO L133 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 [2018-11-28 23:19:56,159 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-28 23:19:56,174 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-28 23:19:56,178 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-28 23:19:56,181 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-28 23:19:56,181 INFO L276 PluginConnector]: CDTParser initialized [2018-11-28 23:19:56,183 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/svcomp/c/termination-memory-alloca/bubblesort-alloca_true-termination.c.i [2018-11-28 23:19:56,259 INFO L221 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/993a16bc8/91144a9971ec42e98cd4a530f4f4a4fa/FLAG032c6e545 [2018-11-28 23:19:56,817 INFO L307 CDTParser]: Found 1 translation units. [2018-11-28 23:19:56,818 INFO L161 CDTParser]: Scanning /storage/repos/svcomp/c/termination-memory-alloca/bubblesort-alloca_true-termination.c.i [2018-11-28 23:19:56,841 INFO L355 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/993a16bc8/91144a9971ec42e98cd4a530f4f4a4fa/FLAG032c6e545 [2018-11-28 23:19:57,064 INFO L363 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/993a16bc8/91144a9971ec42e98cd4a530f4f4a4fa [2018-11-28 23:19:57,069 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-28 23:19:57,070 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-11-28 23:19:57,071 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-28 23:19:57,071 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-28 23:19:57,075 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-28 23:19:57,076 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.11 11:19:57" (1/1) ... [2018-11-28 23:19:57,081 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4e541561 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 11:19:57, skipping insertion in model container [2018-11-28 23:19:57,082 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.11 11:19:57" (1/1) ... [2018-11-28 23:19:57,090 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-28 23:19:57,150 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-11-28 23:19:57,563 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-11-28 23:19:57,575 INFO L191 MainTranslator]: Completed pre-run [2018-11-28 23:19:57,638 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-11-28 23:19:57,775 INFO L195 MainTranslator]: Completed translation [2018-11-28 23:19:57,776 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 11:19:57 WrapperNode [2018-11-28 23:19:57,776 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-28 23:19:57,777 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-28 23:19:57,777 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-28 23:19:57,777 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-28 23:19:57,787 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 11:19:57" (1/1) ... [2018-11-28 23:19:57,813 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 11:19:57" (1/1) ... [2018-11-28 23:19:57,842 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-28 23:19:57,843 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-28 23:19:57,843 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-28 23:19:57,843 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-28 23:19:57,854 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 11:19:57" (1/1) ... [2018-11-28 23:19:57,855 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 11:19:57" (1/1) ... [2018-11-28 23:19:57,862 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 11:19:57" (1/1) ... [2018-11-28 23:19:57,868 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 11:19:57" (1/1) ... [2018-11-28 23:19:57,879 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 11:19:57" (1/1) ... [2018-11-28 23:19:57,883 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 11:19:57" (1/1) ... [2018-11-28 23:19:57,886 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 11:19:57" (1/1) ... [2018-11-28 23:19:57,889 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-28 23:19:57,889 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-28 23:19:57,889 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-28 23:19:57,889 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-28 23:19:57,891 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 11:19:57" (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 [2018-11-28 23:19:57,950 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-11-28 23:19:57,950 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2018-11-28 23:19:57,950 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2018-11-28 23:19:57,951 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-11-28 23:19:57,951 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-28 23:19:57,951 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-28 23:19:58,336 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-28 23:19:58,336 INFO L280 CfgBuilder]: Removed 8 assue(true) statements. [2018-11-28 23:19:58,336 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 11:19:58 BoogieIcfgContainer [2018-11-28 23:19:58,337 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-28 23:19:58,337 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2018-11-28 23:19:58,337 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2018-11-28 23:19:58,342 INFO L276 PluginConnector]: BuchiAutomizer initialized [2018-11-28 23:19:58,343 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-11-28 23:19:58,344 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 28.11 11:19:57" (1/3) ... [2018-11-28 23:19:58,345 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@576beed9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 28.11 11:19:58, skipping insertion in model container [2018-11-28 23:19:58,345 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-11-28 23:19:58,346 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 11:19:57" (2/3) ... [2018-11-28 23:19:58,346 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@576beed9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 28.11 11:19:58, skipping insertion in model container [2018-11-28 23:19:58,346 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-11-28 23:19:58,346 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 11:19:58" (3/3) ... [2018-11-28 23:19:58,349 INFO L375 chiAutomizerObserver]: Analyzing ICFG bubblesort-alloca_true-termination.c.i [2018-11-28 23:19:58,410 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-11-28 23:19:58,411 INFO L374 BuchiCegarLoop]: Interprodecural is true [2018-11-28 23:19:58,411 INFO L375 BuchiCegarLoop]: Hoare is false [2018-11-28 23:19:58,411 INFO L376 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2018-11-28 23:19:58,412 INFO L377 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-28 23:19:58,412 INFO L378 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-28 23:19:58,413 INFO L379 BuchiCegarLoop]: Difference is false [2018-11-28 23:19:58,413 INFO L380 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-28 23:19:58,413 INFO L383 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2018-11-28 23:19:58,429 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 13 states. [2018-11-28 23:19:58,451 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2018-11-28 23:19:58,451 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-28 23:19:58,451 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-28 23:19:58,457 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1] [2018-11-28 23:19:58,458 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2018-11-28 23:19:58,458 INFO L442 BuchiCegarLoop]: ======== Iteration 1============ [2018-11-28 23:19:58,458 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 13 states. [2018-11-28 23:19:58,459 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2018-11-28 23:19:58,460 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-28 23:19:58,460 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-28 23:19:58,460 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1] [2018-11-28 23:19:58,460 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2018-11-28 23:19:58,469 INFO L794 eck$LassoCheckResult]: Stem: 9#ULTIMATE.startENTRYtrue #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 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.alloc(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 [2018-11-28 23:19:58,470 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 [2018-11-28 23:19:58,477 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 23:19:58,478 INFO L82 PathProgramCache]: Analyzing trace with hash 925669, now seen corresponding path program 1 times [2018-11-28 23:19:58,480 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 23:19:58,481 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 23:19:58,537 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:19:58,537 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 23:19:58,537 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:19:58,576 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 23:19:58,593 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 23:19:58,616 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 23:19:58,616 INFO L82 PathProgramCache]: Analyzing trace with hash 47218, now seen corresponding path program 1 times [2018-11-28 23:19:58,616 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 23:19:58,616 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 23:19:58,618 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:19:58,619 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 23:19:58,619 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:19:58,621 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 23:19:58,647 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 23:19:58,649 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 23:19:58,650 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-11-28 23:19:58,654 INFO L811 eck$LassoCheckResult]: loop already infeasible [2018-11-28 23:19:58,670 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2018-11-28 23:19:58,670 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-11-28 23:19:58,672 INFO L87 Difference]: Start difference. First operand 13 states. Second operand 2 states. [2018-11-28 23:19:58,679 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 23:19:58,679 INFO L93 Difference]: Finished difference Result 13 states and 16 transitions. [2018-11-28 23:19:58,679 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-11-28 23:19:58,682 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 13 states and 16 transitions. [2018-11-28 23:19:58,683 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2018-11-28 23:19:58,690 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 13 states to 9 states and 12 transitions. [2018-11-28 23:19:58,691 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 9 [2018-11-28 23:19:58,692 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 9 [2018-11-28 23:19:58,692 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 12 transitions. [2018-11-28 23:19:58,693 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-28 23:19:58,693 INFO L705 BuchiCegarLoop]: Abstraction has 9 states and 12 transitions. [2018-11-28 23:19:58,713 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9 states and 12 transitions. [2018-11-28 23:19:58,723 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9 to 9. [2018-11-28 23:19:58,724 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2018-11-28 23:19:58,725 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 12 transitions. [2018-11-28 23:19:58,728 INFO L728 BuchiCegarLoop]: Abstraction has 9 states and 12 transitions. [2018-11-28 23:19:58,729 INFO L608 BuchiCegarLoop]: Abstraction has 9 states and 12 transitions. [2018-11-28 23:19:58,729 INFO L442 BuchiCegarLoop]: ======== Iteration 2============ [2018-11-28 23:19:58,729 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 9 states and 12 transitions. [2018-11-28 23:19:58,730 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2018-11-28 23:19:58,732 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-28 23:19:58,732 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-28 23:19:58,733 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1] [2018-11-28 23:19:58,734 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2018-11-28 23:19:58,734 INFO L794 eck$LassoCheckResult]: Stem: 40#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 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.alloc(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 [2018-11-28 23:19:58,734 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 [2018-11-28 23:19:58,734 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 23:19:58,736 INFO L82 PathProgramCache]: Analyzing trace with hash 925669, now seen corresponding path program 2 times [2018-11-28 23:19:58,736 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 23:19:58,736 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 23:19:58,741 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:19:58,742 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 23:19:58,742 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:19:58,751 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 23:19:58,768 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 23:19:58,775 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 23:19:58,777 INFO L82 PathProgramCache]: Analyzing trace with hash 46877, now seen corresponding path program 1 times [2018-11-28 23:19:58,777 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 23:19:58,777 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 23:19:58,779 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:19:58,781 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-28 23:19:58,781 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:19:58,787 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 23:19:58,797 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 23:19:58,799 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 23:19:58,799 INFO L82 PathProgramCache]: Analyzing trace with hash 1806818489, now seen corresponding path program 1 times [2018-11-28 23:19:58,799 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 23:19:58,799 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 23:19:58,802 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:19:58,803 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 23:19:58,803 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:19:58,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 23:19:58,824 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 23:19:58,909 INFO L216 LassoAnalysis]: Preferences: [2018-11-28 23:19:58,910 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-28 23:19:58,911 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-28 23:19:58,911 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-28 23:19:58,911 INFO L127 ssoRankerPreferences]: Use exernal solver: true [2018-11-28 23:19:58,911 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-28 23:19:58,911 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-28 23:19:58,911 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-28 23:19:58,911 INFO L131 ssoRankerPreferences]: Filename of dumped script: bubblesort-alloca_true-termination.c.i_Iteration2_Loop [2018-11-28 23:19:58,912 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-28 23:19:58,912 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-11-28 23:19:58,938 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:19:58,950 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:19:58,958 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:19:58,983 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:19:58,998 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:19:59,290 WARN L180 SmtUtils]: Spent 167.00 ms on a formula simplification. DAG size of input: 13 DAG size of output: 12 [2018-11-28 23:19:59,383 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-11-28 23:19:59,384 INFO L412 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) [2018-11-28 23:19:59,392 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-28 23:19:59,392 INFO L163 nArgumentSynthesizer]: Using integer mode. Waiting until toolchain timeout for monitored process 2 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-28 23:19:59,408 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-11-28 23:19:59,408 INFO L448 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) [2018-11-28 23:19:59,441 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-28 23:19:59,442 INFO L163 nArgumentSynthesizer]: Using integer mode. Waiting until toolchain timeout for monitored process 3 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-28 23:19:59,468 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-11-28 23:19:59,468 INFO L448 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) [2018-11-28 23:19:59,473 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-28 23:19:59,473 INFO L163 nArgumentSynthesizer]: Using integer mode. Waiting until toolchain timeout for monitored process 4 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-28 23:19:59,496 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-11-28 23:19:59,496 INFO L448 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) Waiting until toolchain timeout for monitored process 5 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-28 23:19:59,502 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-28 23:19:59,502 INFO L163 nArgumentSynthesizer]: Using integer mode. 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 [2018-11-28 23:19:59,529 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2018-11-28 23:19:59,529 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-28 23:19:59,555 INFO L452 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2018-11-28 23:19:59,557 INFO L216 LassoAnalysis]: Preferences: [2018-11-28 23:19:59,557 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-28 23:19:59,558 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-28 23:19:59,558 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-28 23:19:59,558 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-11-28 23:19:59,558 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-28 23:19:59,558 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-28 23:19:59,559 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-28 23:19:59,559 INFO L131 ssoRankerPreferences]: Filename of dumped script: bubblesort-alloca_true-termination.c.i_Iteration2_Loop [2018-11-28 23:19:59,559 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-28 23:19:59,559 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-11-28 23:19:59,561 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:19:59,567 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:19:59,594 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:19:59,606 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:19:59,630 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:19:59,777 WARN L180 SmtUtils]: Spent 127.00 ms on a formula simplification. DAG size of input: 13 DAG size of output: 12 [2018-11-28 23:19:59,854 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-11-28 23:19:59,858 INFO L497 LassoAnalysis]: Using template 'affine'. [2018-11-28 23:19:59,860 INFO L122 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 [2018-11-28 23:19:59,861 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:19:59,862 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 23:19:59,862 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:19:59,863 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:19:59,863 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:19:59,865 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 23:19:59,865 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 23:19:59,869 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:19:59,869 INFO L122 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 [2018-11-28 23:19:59,870 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:19:59,870 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 23:19:59,871 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:19:59,871 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:19:59,871 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:19:59,872 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 23:19:59,872 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 23:19:59,879 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-11-28 23:19:59,885 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2018-11-28 23:19:59,886 INFO L444 ModelExtractionUtils]: 1 out of 4 variables were initially zero. Simplification set additionally 0 variables to zero. [2018-11-28 23:19:59,888 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-11-28 23:19:59,888 INFO L440 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2018-11-28 23:19:59,889 INFO L518 LassoAnalysis]: Proved termination. [2018-11-28 23:19:59,889 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_bubbleSort_~i~0) = 2*ULTIMATE.start_bubbleSort_~i~0 + 1 Supporting invariants [] [2018-11-28 23:19:59,891 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2018-11-28 23:20:00,053 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 23:20:00,087 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 23:20:00,090 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 23:20:00,114 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 23:20:00,115 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 23:20:00,292 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 23:20:00,296 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 [2018-11-28 23:20:00,297 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 9 states and 12 transitions. cyclomatic complexity: 4 Second operand 3 states. [2018-11-28 23:20:00,404 INFO L76 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. [2018-11-28 23:20:00,405 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 3 states 1 stem states 1 non-accepting loop states 1 accepting loop states [2018-11-28 23:20:00,406 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-28 23:20:00,407 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 12 transitions. [2018-11-28 23:20:00,408 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 12 transitions. Stem has 4 letters. Loop has 3 letters. [2018-11-28 23:20:00,409 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-28 23:20:00,410 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 12 transitions. Stem has 7 letters. Loop has 3 letters. [2018-11-28 23:20:00,410 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-28 23:20:00,410 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 12 transitions. Stem has 4 letters. Loop has 6 letters. [2018-11-28 23:20:00,410 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-28 23:20:00,411 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 15 states and 22 transitions. [2018-11-28 23:20:00,412 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2018-11-28 23:20:00,413 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 15 states to 14 states and 20 transitions. [2018-11-28 23:20:00,413 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 8 [2018-11-28 23:20:00,413 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 9 [2018-11-28 23:20:00,413 INFO L73 IsDeterministic]: Start isDeterministic. Operand 14 states and 20 transitions. [2018-11-28 23:20:00,413 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-28 23:20:00,414 INFO L705 BuchiCegarLoop]: Abstraction has 14 states and 20 transitions. [2018-11-28 23:20:00,414 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14 states and 20 transitions. [2018-11-28 23:20:00,415 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14 to 13. [2018-11-28 23:20:00,415 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2018-11-28 23:20:00,416 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 19 transitions. [2018-11-28 23:20:00,416 INFO L728 BuchiCegarLoop]: Abstraction has 13 states and 19 transitions. [2018-11-28 23:20:00,416 INFO L608 BuchiCegarLoop]: Abstraction has 13 states and 19 transitions. [2018-11-28 23:20:00,416 INFO L442 BuchiCegarLoop]: ======== Iteration 3============ [2018-11-28 23:20:00,416 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 13 states and 19 transitions. [2018-11-28 23:20:00,417 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2018-11-28 23:20:00,417 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-28 23:20:00,417 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-28 23:20:00,418 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2018-11-28 23:20:00,418 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2018-11-28 23:20:00,418 INFO L794 eck$LassoCheckResult]: Stem: 107#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 104#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; 105#L562 assume !(main_~array_size~0 < 1); 111#L562-2 call main_#t~malloc9.base, main_#t~malloc9.offset := #Ultimate.alloc(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; 108#L550-3 assume !!(bubbleSort_~i~0 >= 0);bubbleSort_~j~0 := 1; 99#L551-3 [2018-11-28 23:20:00,419 INFO L796 eck$LassoCheckResult]: Loop: 99#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); 100#L552 assume bubbleSort_#t~mem4 > bubbleSort_#t~mem5;havoc bubbleSort_#t~mem4;havoc bubbleSort_#t~mem5;call bubbleSort_#t~mem6 := read~int(bubbleSort_~numbers.base, bubbleSort_~numbers.offset + 4 * (bubbleSort_~j~0 - 1), 4);bubbleSort_~temp~0 := bubbleSort_#t~mem6;havoc bubbleSort_#t~mem6;call bubbleSort_#t~mem7 := read~int(bubbleSort_~numbers.base, bubbleSort_~numbers.offset + 4 * bubbleSort_~j~0, 4);call write~int(bubbleSort_#t~mem7, bubbleSort_~numbers.base, bubbleSort_~numbers.offset + 4 * (bubbleSort_~j~0 - 1), 4);havoc bubbleSort_#t~mem7;call write~int(bubbleSort_~temp~0, bubbleSort_~numbers.base, bubbleSort_~numbers.offset + 4 * bubbleSort_~j~0, 4); 109#L551-2 bubbleSort_#t~post3 := bubbleSort_~j~0;bubbleSort_~j~0 := 1 + bubbleSort_#t~post3;havoc bubbleSort_#t~post3; 99#L551-3 [2018-11-28 23:20:00,419 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 23:20:00,419 INFO L82 PathProgramCache]: Analyzing trace with hash 28695756, now seen corresponding path program 1 times [2018-11-28 23:20:00,419 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 23:20:00,419 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 23:20:00,421 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:20:00,421 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 23:20:00,421 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:20:00,429 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 23:20:00,436 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 23:20:00,440 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 23:20:00,440 INFO L82 PathProgramCache]: Analyzing trace with hash 54716, now seen corresponding path program 1 times [2018-11-28 23:20:00,440 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 23:20:00,441 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 23:20:00,442 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:20:00,442 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 23:20:00,442 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:20:00,455 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 23:20:00,462 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 23:20:00,467 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 23:20:00,467 INFO L82 PathProgramCache]: Analyzing trace with hash 176800017, now seen corresponding path program 1 times [2018-11-28 23:20:00,468 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 23:20:00,468 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 23:20:00,470 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:20:00,471 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 23:20:00,471 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:20:00,494 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 23:20:00,506 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 23:20:00,899 WARN L180 SmtUtils]: Spent 386.00 ms on a formula simplification. DAG size of input: 42 DAG size of output: 39 [2018-11-28 23:20:01,126 WARN L180 SmtUtils]: Spent 224.00 ms on a formula simplification that was a NOOP. DAG size: 35 [2018-11-28 23:20:01,443 WARN L180 SmtUtils]: Spent 315.00 ms on a formula simplification. DAG size of input: 55 DAG size of output: 53 [2018-11-28 23:20:01,501 INFO L216 LassoAnalysis]: Preferences: [2018-11-28 23:20:01,502 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-28 23:20:01,502 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-28 23:20:01,502 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-28 23:20:01,502 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-11-28 23:20:01,503 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-28 23:20:01,503 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-28 23:20:01,503 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-28 23:20:01,503 INFO L131 ssoRankerPreferences]: Filename of dumped script: bubblesort-alloca_true-termination.c.i_Iteration3_Lasso [2018-11-28 23:20:01,504 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-28 23:20:01,505 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-11-28 23:20:01,511 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:20:01,519 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:20:01,718 WARN L180 SmtUtils]: Spent 157.00 ms on a formula simplification. DAG size of input: 46 DAG size of output: 43 [2018-11-28 23:20:01,801 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:20:01,818 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:20:01,848 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:20:01,878 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:20:01,881 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:20:01,886 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:20:01,889 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:20:01,892 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:20:01,894 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:20:01,899 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:20:01,901 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:20:01,904 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:20:02,476 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-11-28 23:20:02,480 INFO L497 LassoAnalysis]: Using template 'affine'. [2018-11-28 23:20:02,480 INFO L122 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 [2018-11-28 23:20:02,482 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:20:02,482 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 23:20:02,482 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:20:02,482 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:20:02,484 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:20:02,485 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 23:20:02,485 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 23:20:02,486 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:20:02,487 INFO L122 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 [2018-11-28 23:20:02,487 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:20:02,487 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:20:02,487 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:20:02,488 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:20:02,502 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-28 23:20:02,502 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 23:20:02,596 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-11-28 23:20:02,625 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2018-11-28 23:20:02,625 INFO L444 ModelExtractionUtils]: 33 out of 37 variables were initially zero. Simplification set additionally 0 variables to zero. [2018-11-28 23:20:02,626 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-11-28 23:20:02,630 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2018-11-28 23:20:02,630 INFO L518 LassoAnalysis]: Proved termination. [2018-11-28 23:20:02,630 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_bubbleSort_~i~0, ULTIMATE.start_bubbleSort_~j~0) = 2*ULTIMATE.start_bubbleSort_~i~0 - 2*ULTIMATE.start_bubbleSort_~j~0 + 1 Supporting invariants [] [2018-11-28 23:20:02,666 INFO L297 tatePredicateManager]: 4 out of 4 supporting invariants were superfluous and have been removed [2018-11-28 23:20:02,710 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 23:20:02,724 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 23:20:02,725 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 23:20:02,741 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 23:20:02,742 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 23:20:02,759 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 23:20:02,759 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 [2018-11-28 23:20:02,760 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 13 states and 19 transitions. cyclomatic complexity: 8 Second operand 3 states. [2018-11-28 23:20:02,799 INFO L76 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. [2018-11-28 23:20:02,802 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2018-11-28 23:20:02,802 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-28 23:20:02,803 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 12 transitions. [2018-11-28 23:20:02,803 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 12 transitions. Stem has 5 letters. Loop has 3 letters. [2018-11-28 23:20:02,803 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-28 23:20:02,803 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 12 transitions. Stem has 8 letters. Loop has 3 letters. [2018-11-28 23:20:02,803 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-28 23:20:02,804 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 12 transitions. Stem has 5 letters. Loop has 6 letters. [2018-11-28 23:20:02,804 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-28 23:20:02,804 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 28 states and 41 transitions. [2018-11-28 23:20:02,807 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2018-11-28 23:20:02,808 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 28 states to 18 states and 26 transitions. [2018-11-28 23:20:02,808 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 8 [2018-11-28 23:20:02,808 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 8 [2018-11-28 23:20:02,808 INFO L73 IsDeterministic]: Start isDeterministic. Operand 18 states and 26 transitions. [2018-11-28 23:20:02,808 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-28 23:20:02,809 INFO L705 BuchiCegarLoop]: Abstraction has 18 states and 26 transitions. [2018-11-28 23:20:02,809 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18 states and 26 transitions. [2018-11-28 23:20:02,810 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18 to 13. [2018-11-28 23:20:02,810 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2018-11-28 23:20:02,811 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 18 transitions. [2018-11-28 23:20:02,811 INFO L728 BuchiCegarLoop]: Abstraction has 13 states and 18 transitions. [2018-11-28 23:20:02,811 INFO L608 BuchiCegarLoop]: Abstraction has 13 states and 18 transitions. [2018-11-28 23:20:02,811 INFO L442 BuchiCegarLoop]: ======== Iteration 4============ [2018-11-28 23:20:02,811 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 13 states and 18 transitions. [2018-11-28 23:20:02,812 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2018-11-28 23:20:02,812 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-28 23:20:02,812 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-28 23:20:02,813 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [2, 1, 1, 1, 1, 1, 1] [2018-11-28 23:20:02,813 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2018-11-28 23:20:02,813 INFO L794 eck$LassoCheckResult]: Stem: 212#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 209#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; 210#L562 assume !(main_~array_size~0 < 1); 216#L562-2 call main_#t~malloc9.base, main_#t~malloc9.offset := #Ultimate.alloc(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; 213#L550-3 assume !!(bubbleSort_~i~0 >= 0);bubbleSort_~j~0 := 1; 206#L551-3 assume !(bubbleSort_~j~0 <= bubbleSort_~i~0); 207#L550-2 bubbleSort_#t~post2 := bubbleSort_~i~0;bubbleSort_~i~0 := bubbleSort_#t~post2 - 1;havoc bubbleSort_#t~post2; 211#L550-3 assume !!(bubbleSort_~i~0 >= 0);bubbleSort_~j~0 := 1; 204#L551-3 [2018-11-28 23:20:02,813 INFO L796 eck$LassoCheckResult]: Loop: 204#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); 205#L552 assume bubbleSort_#t~mem4 > bubbleSort_#t~mem5;havoc bubbleSort_#t~mem4;havoc bubbleSort_#t~mem5;call bubbleSort_#t~mem6 := read~int(bubbleSort_~numbers.base, bubbleSort_~numbers.offset + 4 * (bubbleSort_~j~0 - 1), 4);bubbleSort_~temp~0 := bubbleSort_#t~mem6;havoc bubbleSort_#t~mem6;call bubbleSort_#t~mem7 := read~int(bubbleSort_~numbers.base, bubbleSort_~numbers.offset + 4 * bubbleSort_~j~0, 4);call write~int(bubbleSort_#t~mem7, bubbleSort_~numbers.base, bubbleSort_~numbers.offset + 4 * (bubbleSort_~j~0 - 1), 4);havoc bubbleSort_#t~mem7;call write~int(bubbleSort_~temp~0, bubbleSort_~numbers.base, bubbleSort_~numbers.offset + 4 * bubbleSort_~j~0, 4); 214#L551-2 bubbleSort_#t~post3 := bubbleSort_~j~0;bubbleSort_~j~0 := 1 + bubbleSort_#t~post3;havoc bubbleSort_#t~post3; 204#L551-3 [2018-11-28 23:20:02,814 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 23:20:02,815 INFO L82 PathProgramCache]: Analyzing trace with hash 176798328, now seen corresponding path program 2 times [2018-11-28 23:20:02,815 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 23:20:02,815 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 23:20:02,817 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:20:02,817 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 23:20:02,817 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:20:02,823 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 23:20:02,874 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 23:20:02,874 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 23:20:02,874 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-28 23:20:02,875 INFO L799 eck$LassoCheckResult]: stem already infeasible [2018-11-28 23:20:02,875 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 23:20:02,875 INFO L82 PathProgramCache]: Analyzing trace with hash 54716, now seen corresponding path program 2 times [2018-11-28 23:20:02,875 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 23:20:02,875 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 23:20:02,877 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:20:02,878 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-28 23:20:02,878 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:20:02,882 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 23:20:02,888 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 23:20:03,006 WARN L180 SmtUtils]: Spent 114.00 ms on a formula simplification. DAG size of input: 42 DAG size of output: 39 [2018-11-28 23:20:03,032 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-28 23:20:03,033 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2018-11-28 23:20:03,033 INFO L87 Difference]: Start difference. First operand 13 states and 18 transitions. cyclomatic complexity: 7 Second operand 5 states. [2018-11-28 23:20:03,096 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 23:20:03,096 INFO L93 Difference]: Finished difference Result 21 states and 28 transitions. [2018-11-28 23:20:03,097 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-28 23:20:03,097 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 21 states and 28 transitions. [2018-11-28 23:20:03,100 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2018-11-28 23:20:03,102 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 21 states to 19 states and 26 transitions. [2018-11-28 23:20:03,102 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 11 [2018-11-28 23:20:03,102 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 11 [2018-11-28 23:20:03,103 INFO L73 IsDeterministic]: Start isDeterministic. Operand 19 states and 26 transitions. [2018-11-28 23:20:03,103 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-28 23:20:03,103 INFO L705 BuchiCegarLoop]: Abstraction has 19 states and 26 transitions. [2018-11-28 23:20:03,103 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19 states and 26 transitions. [2018-11-28 23:20:03,105 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19 to 14. [2018-11-28 23:20:03,105 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2018-11-28 23:20:03,105 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 19 transitions. [2018-11-28 23:20:03,105 INFO L728 BuchiCegarLoop]: Abstraction has 14 states and 19 transitions. [2018-11-28 23:20:03,106 INFO L608 BuchiCegarLoop]: Abstraction has 14 states and 19 transitions. [2018-11-28 23:20:03,106 INFO L442 BuchiCegarLoop]: ======== Iteration 5============ [2018-11-28 23:20:03,106 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 14 states and 19 transitions. [2018-11-28 23:20:03,106 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2018-11-28 23:20:03,107 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-28 23:20:03,107 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-28 23:20:03,107 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 23:20:03,107 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2018-11-28 23:20:03,108 INFO L794 eck$LassoCheckResult]: Stem: 258#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 250#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; 251#L562 assume !(main_~array_size~0 < 1); 262#L562-2 call main_#t~malloc9.base, main_#t~malloc9.offset := #Ultimate.alloc(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; 259#L550-3 assume !!(bubbleSort_~i~0 >= 0);bubbleSort_~j~0 := 1; 254#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); 255#L552 assume !(bubbleSort_#t~mem4 > bubbleSort_#t~mem5);havoc bubbleSort_#t~mem4;havoc bubbleSort_#t~mem5; 261#L551-2 bubbleSort_#t~post3 := bubbleSort_~j~0;bubbleSort_~j~0 := 1 + bubbleSort_#t~post3;havoc bubbleSort_#t~post3; 263#L551-3 assume !(bubbleSort_~j~0 <= bubbleSort_~i~0); 256#L550-2 bubbleSort_#t~post2 := bubbleSort_~i~0;bubbleSort_~i~0 := bubbleSort_#t~post2 - 1;havoc bubbleSort_#t~post2; 257#L550-3 assume !!(bubbleSort_~i~0 >= 0);bubbleSort_~j~0 := 1; 252#L551-3 [2018-11-28 23:20:03,108 INFO L796 eck$LassoCheckResult]: Loop: 252#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); 253#L552 assume bubbleSort_#t~mem4 > bubbleSort_#t~mem5;havoc bubbleSort_#t~mem4;havoc bubbleSort_#t~mem5;call bubbleSort_#t~mem6 := read~int(bubbleSort_~numbers.base, bubbleSort_~numbers.offset + 4 * (bubbleSort_~j~0 - 1), 4);bubbleSort_~temp~0 := bubbleSort_#t~mem6;havoc bubbleSort_#t~mem6;call bubbleSort_#t~mem7 := read~int(bubbleSort_~numbers.base, bubbleSort_~numbers.offset + 4 * bubbleSort_~j~0, 4);call write~int(bubbleSort_#t~mem7, bubbleSort_~numbers.base, bubbleSort_~numbers.offset + 4 * (bubbleSort_~j~0 - 1), 4);havoc bubbleSort_#t~mem7;call write~int(bubbleSort_~temp~0, bubbleSort_~numbers.base, bubbleSort_~numbers.offset + 4 * bubbleSort_~j~0, 4); 260#L551-2 bubbleSort_#t~post3 := bubbleSort_~j~0;bubbleSort_~j~0 := 1 + bubbleSort_#t~post3;havoc bubbleSort_#t~post3; 252#L551-3 [2018-11-28 23:20:03,108 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 23:20:03,108 INFO L82 PathProgramCache]: Analyzing trace with hash 1421271829, now seen corresponding path program 1 times [2018-11-28 23:20:03,108 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 23:20:03,108 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 23:20:03,110 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:20:03,110 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-28 23:20:03,110 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:20:03,117 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 23:20:03,125 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 23:20:03,131 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 23:20:03,136 INFO L82 PathProgramCache]: Analyzing trace with hash 54716, now seen corresponding path program 3 times [2018-11-28 23:20:03,136 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 23:20:03,136 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 23:20:03,138 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:20:03,138 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 23:20:03,138 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:20:03,142 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 23:20:03,156 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 23:20:03,158 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 23:20:03,158 INFO L82 PathProgramCache]: Analyzing trace with hash 1321478696, now seen corresponding path program 1 times [2018-11-28 23:20:03,158 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 23:20:03,158 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 23:20:03,161 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:20:03,162 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-28 23:20:03,162 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:20:03,178 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 23:20:03,374 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 23:20:03,375 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-28 23:20:03,375 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-28 23:20:03,413 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 23:20:03,442 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 23:20:03,443 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 23:20:03,550 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 23:20:03,570 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-28 23:20:03,570 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 12 [2018-11-28 23:20:03,697 WARN L180 SmtUtils]: Spent 125.00 ms on a formula simplification. DAG size of input: 42 DAG size of output: 39 [2018-11-28 23:20:03,722 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-11-28 23:20:03,722 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=95, Unknown=0, NotChecked=0, Total=132 [2018-11-28 23:20:03,723 INFO L87 Difference]: Start difference. First operand 14 states and 19 transitions. cyclomatic complexity: 7 Second operand 12 states. [2018-11-28 23:20:03,824 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 23:20:03,824 INFO L93 Difference]: Finished difference Result 29 states and 38 transitions. [2018-11-28 23:20:03,825 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-11-28 23:20:03,825 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 29 states and 38 transitions. [2018-11-28 23:20:03,827 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2018-11-28 23:20:03,828 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 29 states to 25 states and 34 transitions. [2018-11-28 23:20:03,828 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 14 [2018-11-28 23:20:03,828 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 14 [2018-11-28 23:20:03,828 INFO L73 IsDeterministic]: Start isDeterministic. Operand 25 states and 34 transitions. [2018-11-28 23:20:03,828 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-28 23:20:03,828 INFO L705 BuchiCegarLoop]: Abstraction has 25 states and 34 transitions. [2018-11-28 23:20:03,829 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states and 34 transitions. [2018-11-28 23:20:03,830 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 17. [2018-11-28 23:20:03,830 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2018-11-28 23:20:03,831 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 23 transitions. [2018-11-28 23:20:03,831 INFO L728 BuchiCegarLoop]: Abstraction has 17 states and 23 transitions. [2018-11-28 23:20:03,831 INFO L608 BuchiCegarLoop]: Abstraction has 17 states and 23 transitions. [2018-11-28 23:20:03,831 INFO L442 BuchiCegarLoop]: ======== Iteration 6============ [2018-11-28 23:20:03,831 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 17 states and 23 transitions. [2018-11-28 23:20:03,832 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2018-11-28 23:20:03,832 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-28 23:20:03,832 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-28 23:20:03,833 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1] [2018-11-28 23:20:03,833 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2018-11-28 23:20:03,833 INFO L794 eck$LassoCheckResult]: Stem: 363#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 355#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; 356#L562 assume !(main_~array_size~0 < 1); 369#L562-2 call main_#t~malloc9.base, main_#t~malloc9.offset := #Ultimate.alloc(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; 364#L550-3 assume !!(bubbleSort_~i~0 >= 0);bubbleSort_~j~0 := 1; 365#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); 367#L552 assume !(bubbleSort_#t~mem4 > bubbleSort_#t~mem5);havoc bubbleSort_#t~mem4;havoc bubbleSort_#t~mem5; 368#L551-2 bubbleSort_#t~post3 := bubbleSort_~j~0;bubbleSort_~j~0 := 1 + bubbleSort_#t~post3;havoc bubbleSort_#t~post3; 359#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); 360#L552 assume !(bubbleSort_#t~mem4 > bubbleSort_#t~mem5);havoc bubbleSort_#t~mem4;havoc bubbleSort_#t~mem5; 371#L551-2 bubbleSort_#t~post3 := bubbleSort_~j~0;bubbleSort_~j~0 := 1 + bubbleSort_#t~post3;havoc bubbleSort_#t~post3; 370#L551-3 assume !(bubbleSort_~j~0 <= bubbleSort_~i~0); 361#L550-2 bubbleSort_#t~post2 := bubbleSort_~i~0;bubbleSort_~i~0 := bubbleSort_#t~post2 - 1;havoc bubbleSort_#t~post2; 362#L550-3 assume !!(bubbleSort_~i~0 >= 0);bubbleSort_~j~0 := 1; 357#L551-3 [2018-11-28 23:20:03,833 INFO L796 eck$LassoCheckResult]: Loop: 357#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); 358#L552 assume bubbleSort_#t~mem4 > bubbleSort_#t~mem5;havoc bubbleSort_#t~mem4;havoc bubbleSort_#t~mem5;call bubbleSort_#t~mem6 := read~int(bubbleSort_~numbers.base, bubbleSort_~numbers.offset + 4 * (bubbleSort_~j~0 - 1), 4);bubbleSort_~temp~0 := bubbleSort_#t~mem6;havoc bubbleSort_#t~mem6;call bubbleSort_#t~mem7 := read~int(bubbleSort_~numbers.base, bubbleSort_~numbers.offset + 4 * bubbleSort_~j~0, 4);call write~int(bubbleSort_#t~mem7, bubbleSort_~numbers.base, bubbleSort_~numbers.offset + 4 * (bubbleSort_~j~0 - 1), 4);havoc bubbleSort_#t~mem7;call write~int(bubbleSort_~temp~0, bubbleSort_~numbers.base, bubbleSort_~numbers.offset + 4 * bubbleSort_~j~0, 4); 366#L551-2 bubbleSort_#t~post3 := bubbleSort_~j~0;bubbleSort_~j~0 := 1 + bubbleSort_#t~post3;havoc bubbleSort_#t~post3; 357#L551-3 [2018-11-28 23:20:03,833 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 23:20:03,833 INFO L82 PathProgramCache]: Analyzing trace with hash 1373641048, now seen corresponding path program 2 times [2018-11-28 23:20:03,834 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 23:20:03,834 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 23:20:03,835 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:20:03,835 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 23:20:03,835 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:20:03,843 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 23:20:03,851 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 23:20:03,855 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 23:20:03,855 INFO L82 PathProgramCache]: Analyzing trace with hash 54716, now seen corresponding path program 4 times [2018-11-28 23:20:03,855 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 23:20:03,855 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 23:20:03,856 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:20:03,857 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-28 23:20:03,857 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:20:03,860 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 23:20:03,863 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 23:20:03,865 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 23:20:03,866 INFO L82 PathProgramCache]: Analyzing trace with hash -307910395, now seen corresponding path program 2 times [2018-11-28 23:20:03,866 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 23:20:03,866 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 23:20:03,867 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:20:03,867 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-28 23:20:03,867 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:20:03,879 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 23:20:04,416 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 5 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 23:20:04,417 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-28 23:20:04,417 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-28 23:20:04,435 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-11-28 23:20:04,482 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-11-28 23:20:04,482 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-28 23:20:04,485 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 23:20:04,721 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 18 [2018-11-28 23:20:04,730 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 10 [2018-11-28 23:20:04,731 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-28 23:20:04,733 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 23:20:04,735 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-28 23:20:04,735 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:26, output treesize:3 [2018-11-28 23:20:04,754 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 6 proven. 5 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-11-28 23:20:04,774 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-28 23:20:04,774 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 8] total 12 [2018-11-28 23:20:04,884 WARN L180 SmtUtils]: Spent 108.00 ms on a formula simplification. DAG size of input: 42 DAG size of output: 39 [2018-11-28 23:20:04,920 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-11-28 23:20:04,920 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=94, Unknown=0, NotChecked=0, Total=132 [2018-11-28 23:20:04,921 INFO L87 Difference]: Start difference. First operand 17 states and 23 transitions. cyclomatic complexity: 8 Second operand 12 states. [2018-11-28 23:20:05,091 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 23:20:05,091 INFO L93 Difference]: Finished difference Result 37 states and 50 transitions. [2018-11-28 23:20:05,093 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-11-28 23:20:05,094 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 37 states and 50 transitions. [2018-11-28 23:20:05,095 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 6 [2018-11-28 23:20:05,098 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 37 states to 37 states and 50 transitions. [2018-11-28 23:20:05,098 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 19 [2018-11-28 23:20:05,098 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 19 [2018-11-28 23:20:05,098 INFO L73 IsDeterministic]: Start isDeterministic. Operand 37 states and 50 transitions. [2018-11-28 23:20:05,099 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-28 23:20:05,099 INFO L705 BuchiCegarLoop]: Abstraction has 37 states and 50 transitions. [2018-11-28 23:20:05,099 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states and 50 transitions. [2018-11-28 23:20:05,102 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 26. [2018-11-28 23:20:05,102 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26 states. [2018-11-28 23:20:05,103 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 35 transitions. [2018-11-28 23:20:05,103 INFO L728 BuchiCegarLoop]: Abstraction has 26 states and 35 transitions. [2018-11-28 23:20:05,103 INFO L608 BuchiCegarLoop]: Abstraction has 26 states and 35 transitions. [2018-11-28 23:20:05,103 INFO L442 BuchiCegarLoop]: ======== Iteration 7============ [2018-11-28 23:20:05,103 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 26 states and 35 transitions. [2018-11-28 23:20:05,104 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2018-11-28 23:20:05,104 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-28 23:20:05,104 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-28 23:20:05,105 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 23:20:05,105 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2018-11-28 23:20:05,105 INFO L794 eck$LassoCheckResult]: Stem: 488#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 482#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; 483#L562 assume !(main_~array_size~0 < 1); 492#L562-2 call main_#t~malloc9.base, main_#t~malloc9.offset := #Ultimate.alloc(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; 484#L550-3 assume !!(bubbleSort_~i~0 >= 0);bubbleSort_~j~0 := 1; 485#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); 498#L552 assume !(bubbleSort_#t~mem4 > bubbleSort_#t~mem5);havoc bubbleSort_#t~mem4;havoc bubbleSort_#t~mem5; 494#L551-2 bubbleSort_#t~post3 := bubbleSort_~j~0;bubbleSort_~j~0 := 1 + bubbleSort_#t~post3;havoc bubbleSort_#t~post3; 478#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); 479#L552 assume bubbleSort_#t~mem4 > bubbleSort_#t~mem5;havoc bubbleSort_#t~mem4;havoc bubbleSort_#t~mem5;call bubbleSort_#t~mem6 := read~int(bubbleSort_~numbers.base, bubbleSort_~numbers.offset + 4 * (bubbleSort_~j~0 - 1), 4);bubbleSort_~temp~0 := bubbleSort_#t~mem6;havoc bubbleSort_#t~mem6;call bubbleSort_#t~mem7 := read~int(bubbleSort_~numbers.base, bubbleSort_~numbers.offset + 4 * bubbleSort_~j~0, 4);call write~int(bubbleSort_#t~mem7, bubbleSort_~numbers.base, bubbleSort_~numbers.offset + 4 * (bubbleSort_~j~0 - 1), 4);havoc bubbleSort_#t~mem7;call write~int(bubbleSort_~temp~0, bubbleSort_~numbers.base, bubbleSort_~numbers.offset + 4 * bubbleSort_~j~0, 4); 490#L551-2 bubbleSort_#t~post3 := bubbleSort_~j~0;bubbleSort_~j~0 := 1 + bubbleSort_#t~post3;havoc bubbleSort_#t~post3; 497#L551-3 assume !(bubbleSort_~j~0 <= bubbleSort_~i~0); 480#L550-2 bubbleSort_#t~post2 := bubbleSort_~i~0;bubbleSort_~i~0 := bubbleSort_#t~post2 - 1;havoc bubbleSort_#t~post2; 481#L550-3 assume !!(bubbleSort_~i~0 >= 0);bubbleSort_~j~0 := 1; 493#L551-3 [2018-11-28 23:20:05,105 INFO L796 eck$LassoCheckResult]: Loop: 493#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); 501#L552 assume bubbleSort_#t~mem4 > bubbleSort_#t~mem5;havoc bubbleSort_#t~mem4;havoc bubbleSort_#t~mem5;call bubbleSort_#t~mem6 := read~int(bubbleSort_~numbers.base, bubbleSort_~numbers.offset + 4 * (bubbleSort_~j~0 - 1), 4);bubbleSort_~temp~0 := bubbleSort_#t~mem6;havoc bubbleSort_#t~mem6;call bubbleSort_#t~mem7 := read~int(bubbleSort_~numbers.base, bubbleSort_~numbers.offset + 4 * bubbleSort_~j~0, 4);call write~int(bubbleSort_#t~mem7, bubbleSort_~numbers.base, bubbleSort_~numbers.offset + 4 * (bubbleSort_~j~0 - 1), 4);havoc bubbleSort_#t~mem7;call write~int(bubbleSort_~temp~0, bubbleSort_~numbers.base, bubbleSort_~numbers.offset + 4 * bubbleSort_~j~0, 4); 489#L551-2 bubbleSort_#t~post3 := bubbleSort_~j~0;bubbleSort_~j~0 := 1 + bubbleSort_#t~post3;havoc bubbleSort_#t~post3; 493#L551-3 [2018-11-28 23:20:05,105 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 23:20:05,105 INFO L82 PathProgramCache]: Analyzing trace with hash 1371794006, now seen corresponding path program 3 times [2018-11-28 23:20:05,106 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 23:20:05,106 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 23:20:05,107 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:20:05,107 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-28 23:20:05,107 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:20:05,114 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 23:20:05,122 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 23:20:05,126 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 23:20:05,126 INFO L82 PathProgramCache]: Analyzing trace with hash 54716, now seen corresponding path program 5 times [2018-11-28 23:20:05,126 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 23:20:05,126 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 23:20:05,127 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:20:05,127 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-28 23:20:05,127 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:20:05,130 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 23:20:05,133 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 23:20:05,135 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 23:20:05,135 INFO L82 PathProgramCache]: Analyzing trace with hash 501436231, now seen corresponding path program 4 times [2018-11-28 23:20:05,135 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 23:20:05,135 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 23:20:05,136 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:20:05,136 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-28 23:20:05,136 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:20:05,156 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 23:20:05,170 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 23:20:05,284 WARN L180 SmtUtils]: Spent 108.00 ms on a formula simplification. DAG size of input: 42 DAG size of output: 39 [2018-11-28 23:20:05,675 WARN L180 SmtUtils]: Spent 331.00 ms on a formula simplification. DAG size of input: 115 DAG size of output: 99 [2018-11-28 23:20:05,752 INFO L216 LassoAnalysis]: Preferences: [2018-11-28 23:20:05,752 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-28 23:20:05,752 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-28 23:20:05,752 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-28 23:20:05,753 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-11-28 23:20:05,753 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-28 23:20:05,753 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-28 23:20:05,753 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-28 23:20:05,753 INFO L131 ssoRankerPreferences]: Filename of dumped script: bubblesort-alloca_true-termination.c.i_Iteration7_Lasso [2018-11-28 23:20:05,753 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-28 23:20:05,754 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-11-28 23:20:05,758 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:20:05,788 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:20:05,813 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:20:05,815 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:20:05,821 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:20:05,822 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:20:05,828 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:20:05,830 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:20:05,831 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:20:06,067 WARN L180 SmtUtils]: Spent 116.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 53 [2018-11-28 23:20:06,206 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:20:06,208 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:20:06,212 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:20:06,216 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:20:06,218 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:20:06,596 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-11-28 23:20:06,597 INFO L497 LassoAnalysis]: Using template 'affine'. [2018-11-28 23:20:06,597 INFO L122 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 [2018-11-28 23:20:06,598 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:20:06,598 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 23:20:06,598 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:20:06,598 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:20:06,598 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:20:06,602 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 23:20:06,602 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 23:20:06,603 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:20:06,605 INFO L122 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 [2018-11-28 23:20:06,605 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:20:06,605 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:20:06,605 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:20:06,605 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:20:06,609 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-28 23:20:06,609 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 23:20:06,611 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:20:06,612 INFO L122 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 [2018-11-28 23:20:06,612 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:20:06,613 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 23:20:06,613 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:20:06,613 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:20:06,613 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:20:06,613 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 23:20:06,613 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 23:20:06,617 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:20:06,618 INFO L122 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 [2018-11-28 23:20:06,618 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:20:06,618 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:20:06,619 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:20:06,619 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:20:06,623 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-28 23:20:06,623 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 23:20:06,626 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:20:06,626 INFO L122 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 [2018-11-28 23:20:06,627 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:20:06,627 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 23:20:06,627 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:20:06,627 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:20:06,627 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:20:06,631 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 23:20:06,631 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 23:20:06,632 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:20:06,632 INFO L122 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 [2018-11-28 23:20:06,632 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:20:06,635 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:20:06,635 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:20:06,635 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:20:06,636 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-28 23:20:06,637 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 23:20:06,640 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:20:06,640 INFO L122 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 [2018-11-28 23:20:06,641 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:20:06,641 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 23:20:06,641 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:20:06,641 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:20:06,641 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:20:06,642 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 23:20:06,642 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 23:20:06,642 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:20:06,646 INFO L122 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 [2018-11-28 23:20:06,646 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:20:06,647 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:20:06,647 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:20:06,647 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:20:06,651 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-28 23:20:06,651 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 23:20:06,652 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:20:06,654 INFO L122 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 [2018-11-28 23:20:06,654 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:20:06,657 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:20:06,657 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:20:06,657 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:20:06,661 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-28 23:20:06,661 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 23:20:06,680 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-11-28 23:20:06,699 INFO L443 ModelExtractionUtils]: Simplification made 4 calls to the SMT solver. [2018-11-28 23:20:06,699 INFO L444 ModelExtractionUtils]: 32 out of 37 variables were initially zero. Simplification set additionally 1 variables to zero. [2018-11-28 23:20:06,700 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-11-28 23:20:06,702 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2018-11-28 23:20:06,702 INFO L518 LassoAnalysis]: Proved termination. [2018-11-28 23:20:06,702 INFO L520 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)_2) = -1*ULTIMATE.start_bubbleSort_~numbers.offset - 4*ULTIMATE.start_bubbleSort_~j~0 + 1*v_rep(select #length ULTIMATE.start_bubbleSort_~numbers.base)_2 Supporting invariants [] [2018-11-28 23:20:06,883 INFO L297 tatePredicateManager]: 7 out of 7 supporting invariants were superfluous and have been removed [2018-11-28 23:20:06,897 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2018-11-28 23:20:07,072 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 23:20:07,093 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 23:20:07,096 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 23:20:07,106 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 23:20:07,107 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 23:20:07,120 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 23:20:07,121 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 [2018-11-28 23:20:07,121 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 26 states and 35 transitions. cyclomatic complexity: 11 Second operand 3 states. [2018-11-28 23:20:07,159 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 26 states and 35 transitions. cyclomatic complexity: 11. Second operand 3 states. Result 50 states and 70 transitions. Complement of second has 7 states. [2018-11-28 23:20:07,159 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2018-11-28 23:20:07,160 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-28 23:20:07,160 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 12 transitions. [2018-11-28 23:20:07,161 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 12 transitions. Stem has 14 letters. Loop has 3 letters. [2018-11-28 23:20:07,161 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-28 23:20:07,161 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2018-11-28 23:20:07,173 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 23:20:07,192 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 23:20:07,194 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 23:20:07,202 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 23:20:07,205 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 23:20:07,231 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 23:20:07,231 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and with honda bouncer for loop.1 stem predicates 2 loop predicates [2018-11-28 23:20:07,232 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 26 states and 35 transitions. cyclomatic complexity: 11 Second operand 3 states. [2018-11-28 23:20:07,256 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 26 states and 35 transitions. cyclomatic complexity: 11. Second operand 3 states. Result 50 states and 70 transitions. Complement of second has 7 states. [2018-11-28 23:20:07,258 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2018-11-28 23:20:07,258 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-28 23:20:07,258 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 12 transitions. [2018-11-28 23:20:07,259 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 12 transitions. Stem has 14 letters. Loop has 3 letters. [2018-11-28 23:20:07,259 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-28 23:20:07,259 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2018-11-28 23:20:07,278 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 23:20:07,295 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 23:20:07,297 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 23:20:07,305 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 23:20:07,306 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 23:20:07,331 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 23:20:07,331 INFO L152 lantAutomatonBouncer]: Defining Buchi interpolant automaton with scrooge nondeterminism in stemwith honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2018-11-28 23:20:07,332 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 26 states and 35 transitions. cyclomatic complexity: 11 Second operand 3 states. [2018-11-28 23:20:07,356 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 26 states and 35 transitions. cyclomatic complexity: 11. Second operand 3 states. Result 41 states and 58 transitions. Complement of second has 6 states. [2018-11-28 23:20:07,357 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2018-11-28 23:20:07,357 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-28 23:20:07,358 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 19 transitions. [2018-11-28 23:20:07,358 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 19 transitions. Stem has 14 letters. Loop has 3 letters. [2018-11-28 23:20:07,358 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-28 23:20:07,358 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 19 transitions. Stem has 17 letters. Loop has 3 letters. [2018-11-28 23:20:07,359 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-28 23:20:07,359 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 19 transitions. Stem has 14 letters. Loop has 6 letters. [2018-11-28 23:20:07,359 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-28 23:20:07,361 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 41 states and 58 transitions. [2018-11-28 23:20:07,362 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2018-11-28 23:20:07,362 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 41 states to 0 states and 0 transitions. [2018-11-28 23:20:07,362 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2018-11-28 23:20:07,362 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2018-11-28 23:20:07,363 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2018-11-28 23:20:07,363 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-28 23:20:07,363 INFO L705 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-28 23:20:07,363 INFO L728 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-28 23:20:07,363 INFO L608 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-28 23:20:07,363 INFO L442 BuchiCegarLoop]: ======== Iteration 8============ [2018-11-28 23:20:07,363 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2018-11-28 23:20:07,363 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2018-11-28 23:20:07,363 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2018-11-28 23:20:07,372 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 28.11 11:20:07 BoogieIcfgContainer [2018-11-28 23:20:07,372 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2018-11-28 23:20:07,373 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-11-28 23:20:07,373 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-11-28 23:20:07,373 INFO L276 PluginConnector]: Witness Printer initialized [2018-11-28 23:20:07,374 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 11:19:58" (3/4) ... [2018-11-28 23:20:07,377 INFO L147 WitnessPrinter]: No result that supports witness generation found [2018-11-28 23:20:07,378 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-11-28 23:20:07,379 INFO L168 Benchmark]: Toolchain (without parser) took 10309.32 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 198.7 MB). Free memory was 951.3 MB in the beginning and 792.1 MB in the end (delta: 159.2 MB). Peak memory consumption was 358.0 MB. Max. memory is 11.5 GB. [2018-11-28 23:20:07,380 INFO L168 Benchmark]: CDTParser took 0.24 ms. Allocated memory is still 1.0 GB. Free memory is still 978.2 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-28 23:20:07,380 INFO L168 Benchmark]: CACSL2BoogieTranslator took 705.58 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 119.5 MB). Free memory was 951.3 MB in the beginning and 1.1 GB in the end (delta: -153.7 MB). Peak memory consumption was 36.9 MB. Max. memory is 11.5 GB. [2018-11-28 23:20:07,383 INFO L168 Benchmark]: Boogie Procedure Inliner took 65.47 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. [2018-11-28 23:20:07,383 INFO L168 Benchmark]: Boogie Preprocessor took 46.01 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. [2018-11-28 23:20:07,384 INFO L168 Benchmark]: RCFGBuilder took 447.64 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: 19.2 MB). Peak memory consumption was 19.2 MB. Max. memory is 11.5 GB. [2018-11-28 23:20:07,385 INFO L168 Benchmark]: BuchiAutomizer took 9035.04 ms. Allocated memory was 1.1 GB in the beginning and 1.2 GB in the end (delta: 79.2 MB). Free memory was 1.1 GB in the beginning and 792.1 MB in the end (delta: 293.8 MB). Peak memory consumption was 372.9 MB. Max. memory is 11.5 GB. [2018-11-28 23:20:07,387 INFO L168 Benchmark]: Witness Printer took 5.09 ms. Allocated memory is still 1.2 GB. Free memory is still 792.1 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-28 23:20:07,393 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.24 ms. Allocated memory is still 1.0 GB. Free memory is still 978.2 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 705.58 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 119.5 MB). Free memory was 951.3 MB in the beginning and 1.1 GB in the end (delta: -153.7 MB). Peak memory consumption was 36.9 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 65.47 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 46.01 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. * RCFGBuilder took 447.64 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: 19.2 MB). Peak memory consumption was 19.2 MB. Max. memory is 11.5 GB. * BuchiAutomizer took 9035.04 ms. Allocated memory was 1.1 GB in the beginning and 1.2 GB in the end (delta: 79.2 MB). Free memory was 1.1 GB in the beginning and 792.1 MB in the end (delta: 293.8 MB). Peak memory consumption was 372.9 MB. Max. memory is 11.5 GB. * Witness Printer took 5.09 ms. Allocated memory is still 1.2 GB. Free memory is still 792.1 MB. 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 * 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 2 * i + -2 * j + 1 and consists of 4 locations. One nondeterministic module has affine ranking function -1 * numbers + -4 * j + unknown-#length-unknown[numbers] and consists of 4 locations. 4 modules have a trivial ranking function, the largest among these consists of 12 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 8.9s and 8 iterations. TraceHistogramMax:2. Analysis of lassos took 7.3s. Construction of modules took 0.3s. Büchi inclusion checks took 1.1s. 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: 89 SDtfs, 99 SDslu, 96 SDs, 0 SdLazy, 166 SolverSat, 30 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.3s Time LassoAnalysisResults: nont0 unkn0 SFLI1 SFLT1 conc2 concLT0 SILN0 SILU1 SILI0 SILT0 lasso2 LassoPreprocessingBenchmarks: Lassos: inital109 mio100 ax157 hnf98 lsp67 ukn80 mio100 lsp81 div100 bol100 ite100 ukn100 eq171 hnf90 smp88 dnf100 smp100 tf104 neg100 sie104 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: sat Degree: 0 Time: 143ms VariablesStem: 11 VariablesLoop: 6 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...