./Ultimate.py --spec /storage/repos/svcomp/c/properties/termination.prp --file /storage/repos/svcomp/c/array-memsafety/bubblesort-alloca_true-valid-memsafety_true-termination.i --full-output --architecture 32bit -------------------------------------------------------------------------------- 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/array-memsafety/bubblesort-alloca_true-valid-memsafety_true-termination.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(F end) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash c685955ff6c809f32f6abe44f773ce6a6ae39f94 ....................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.24-91b1670 [2018-11-29 00:10:43,775 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-29 00:10:43,776 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-29 00:10:43,789 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-29 00:10:43,790 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-29 00:10:43,791 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-29 00:10:43,792 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-29 00:10:43,794 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-29 00:10:43,796 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-29 00:10:43,797 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-29 00:10:43,798 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-29 00:10:43,798 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-29 00:10:43,799 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-29 00:10:43,801 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-29 00:10:43,802 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-29 00:10:43,802 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-29 00:10:43,804 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-29 00:10:43,806 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-29 00:10:43,808 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-29 00:10:43,810 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-29 00:10:43,811 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-29 00:10:43,812 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-29 00:10:43,815 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-29 00:10:43,815 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-29 00:10:43,815 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-29 00:10:43,816 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-29 00:10:43,818 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-29 00:10:43,819 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-29 00:10:43,820 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-29 00:10:43,821 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-29 00:10:43,821 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-29 00:10:43,822 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-29 00:10:43,822 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-29 00:10:43,823 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-29 00:10:43,823 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-29 00:10:43,824 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-29 00:10:43,825 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-32bit-Automizer_Default.epf [2018-11-29 00:10:43,854 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-29 00:10:43,854 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-29 00:10:43,855 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-11-29 00:10:43,855 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-11-29 00:10:43,857 INFO L133 SettingsManager]: * Use SBE=true [2018-11-29 00:10:43,857 INFO L131 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2018-11-29 00:10:43,857 INFO L133 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2018-11-29 00:10:43,857 INFO L133 SettingsManager]: * Use old map elimination=false [2018-11-29 00:10:43,857 INFO L133 SettingsManager]: * Use external solver (rank synthesis)=false [2018-11-29 00:10:43,858 INFO L133 SettingsManager]: * Use only trivial implications for array writes=true [2018-11-29 00:10:43,858 INFO L133 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2018-11-29 00:10:43,858 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-29 00:10:43,858 INFO L133 SettingsManager]: * sizeof long=4 [2018-11-29 00:10:43,858 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-11-29 00:10:43,858 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-29 00:10:43,860 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-11-29 00:10:43,860 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-29 00:10:43,861 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2018-11-29 00:10:43,861 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2018-11-29 00:10:43,861 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2018-11-29 00:10:43,861 INFO L133 SettingsManager]: * sizeof long double=12 [2018-11-29 00:10:43,861 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-29 00:10:43,861 INFO L133 SettingsManager]: * Assume nondeterminstic values are in range=false [2018-11-29 00:10:43,863 INFO L133 SettingsManager]: * Use constant arrays=true [2018-11-29 00:10:43,864 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2018-11-29 00:10:43,864 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-29 00:10:43,864 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-29 00:10:43,865 INFO L133 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2018-11-29 00:10:43,865 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-29 00:10:43,865 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-11-29 00:10:43,865 INFO L133 SettingsManager]: * Dump automata to the following directory=/home/matthias/ultimate/dump/auto [2018-11-29 00:10:43,866 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2018-11-29 00:10:43,866 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 -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> c685955ff6c809f32f6abe44f773ce6a6ae39f94 [2018-11-29 00:10:43,930 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-29 00:10:43,946 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-29 00:10:43,951 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-29 00:10:43,953 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-29 00:10:43,953 INFO L276 PluginConnector]: CDTParser initialized [2018-11-29 00:10:43,954 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/svcomp/c/array-memsafety/bubblesort-alloca_true-valid-memsafety_true-termination.i [2018-11-29 00:10:44,022 INFO L221 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b335483db/b5a2b676d0744717849b848ee6a1344c/FLAGe1662fb03 [2018-11-29 00:10:44,596 INFO L307 CDTParser]: Found 1 translation units. [2018-11-29 00:10:44,597 INFO L161 CDTParser]: Scanning /storage/repos/svcomp/c/array-memsafety/bubblesort-alloca_true-valid-memsafety_true-termination.i [2018-11-29 00:10:44,614 INFO L355 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b335483db/b5a2b676d0744717849b848ee6a1344c/FLAGe1662fb03 [2018-11-29 00:10:44,831 INFO L363 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b335483db/b5a2b676d0744717849b848ee6a1344c [2018-11-29 00:10:44,836 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-29 00:10:44,838 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-11-29 00:10:44,839 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-29 00:10:44,839 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-29 00:10:44,843 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-29 00:10:44,844 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 29.11 12:10:44" (1/1) ... [2018-11-29 00:10:44,847 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3613db22 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 12:10:44, skipping insertion in model container [2018-11-29 00:10:44,848 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 29.11 12:10:44" (1/1) ... [2018-11-29 00:10:44,856 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-29 00:10:44,898 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-11-29 00:10:45,256 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-11-29 00:10:45,271 INFO L191 MainTranslator]: Completed pre-run [2018-11-29 00:10:45,314 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-11-29 00:10:45,373 INFO L195 MainTranslator]: Completed translation [2018-11-29 00:10:45,374 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 12:10:45 WrapperNode [2018-11-29 00:10:45,374 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-29 00:10:45,375 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-29 00:10:45,375 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-29 00:10:45,375 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-29 00:10:45,456 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 12:10:45" (1/1) ... [2018-11-29 00:10:45,473 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 12:10:45" (1/1) ... [2018-11-29 00:10:45,496 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-29 00:10:45,496 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-29 00:10:45,496 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-29 00:10:45,496 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-29 00:10:45,506 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 12:10:45" (1/1) ... [2018-11-29 00:10:45,506 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 12:10:45" (1/1) ... [2018-11-29 00:10:45,510 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 12:10:45" (1/1) ... [2018-11-29 00:10:45,510 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 12:10:45" (1/1) ... [2018-11-29 00:10:45,518 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 12:10:45" (1/1) ... [2018-11-29 00:10:45,523 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 12:10:45" (1/1) ... [2018-11-29 00:10:45,525 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 12:10:45" (1/1) ... [2018-11-29 00:10:45,528 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-29 00:10:45,528 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-29 00:10:45,528 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-29 00:10:45,529 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-29 00:10:45,529 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 12:10:45" (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-29 00:10:45,587 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-11-29 00:10:45,587 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2018-11-29 00:10:45,587 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2018-11-29 00:10:45,587 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-11-29 00:10:45,588 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-29 00:10:45,588 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-29 00:10:45,949 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-29 00:10:45,950 INFO L280 CfgBuilder]: Removed 8 assue(true) statements. [2018-11-29 00:10:45,950 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.11 12:10:45 BoogieIcfgContainer [2018-11-29 00:10:45,950 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-29 00:10:45,951 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2018-11-29 00:10:45,951 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2018-11-29 00:10:45,955 INFO L276 PluginConnector]: BuchiAutomizer initialized [2018-11-29 00:10:45,956 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-11-29 00:10:45,957 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 29.11 12:10:44" (1/3) ... [2018-11-29 00:10:45,958 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@6192f8c9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 29.11 12:10:45, skipping insertion in model container [2018-11-29 00:10:45,958 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-11-29 00:10:45,958 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 12:10:45" (2/3) ... [2018-11-29 00:10:45,958 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@6192f8c9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 29.11 12:10:45, skipping insertion in model container [2018-11-29 00:10:45,959 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-11-29 00:10:45,959 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.11 12:10:45" (3/3) ... [2018-11-29 00:10:45,960 INFO L375 chiAutomizerObserver]: Analyzing ICFG bubblesort-alloca_true-valid-memsafety_true-termination.i [2018-11-29 00:10:46,034 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-11-29 00:10:46,034 INFO L374 BuchiCegarLoop]: Interprodecural is true [2018-11-29 00:10:46,035 INFO L375 BuchiCegarLoop]: Hoare is false [2018-11-29 00:10:46,035 INFO L376 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2018-11-29 00:10:46,036 INFO L377 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-29 00:10:46,036 INFO L378 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-29 00:10:46,036 INFO L379 BuchiCegarLoop]: Difference is false [2018-11-29 00:10:46,036 INFO L380 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-29 00:10:46,036 INFO L383 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2018-11-29 00:10:46,051 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 13 states. [2018-11-29 00:10:46,073 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2018-11-29 00:10:46,073 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-29 00:10:46,074 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-29 00:10:46,080 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1] [2018-11-29 00:10:46,080 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2018-11-29 00:10:46,080 INFO L442 BuchiCegarLoop]: ======== Iteration 1============ [2018-11-29 00:10:46,080 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 13 states. [2018-11-29 00:10:46,082 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2018-11-29 00:10:46,082 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-29 00:10:46,082 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-29 00:10:46,083 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1] [2018-11-29 00:10:46,083 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2018-11-29 00:10:46,091 INFO L794 eck$LassoCheckResult]: Stem: 8#ULTIMATE.startENTRYtrue #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 5#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; 4#L555true assume !(main_~array_size~0 < 1 || main_~array_size~0 >= 536870911); 6#L555-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; 11#L543-3true [2018-11-29 00:10:46,091 INFO L796 eck$LassoCheckResult]: Loop: 11#L543-3true assume !!(bubbleSort_~i~0 >= 0);bubbleSort_~j~0 := 1; 9#L544-3true assume !true; 10#L543-2true bubbleSort_#t~post2 := bubbleSort_~i~0;bubbleSort_~i~0 := bubbleSort_#t~post2 - 1;havoc bubbleSort_#t~post2; 11#L543-3true [2018-11-29 00:10:46,097 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-29 00:10:46,098 INFO L82 PathProgramCache]: Analyzing trace with hash 925669, now seen corresponding path program 1 times [2018-11-29 00:10:46,099 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-29 00:10:46,100 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-29 00:10:46,144 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-29 00:10:46,144 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-29 00:10:46,144 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-29 00:10:46,188 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-29 00:10:46,204 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-29 00:10:46,228 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-29 00:10:46,229 INFO L82 PathProgramCache]: Analyzing trace with hash 47218, now seen corresponding path program 1 times [2018-11-29 00:10:46,229 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-29 00:10:46,229 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-29 00:10:46,230 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-29 00:10:46,230 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-29 00:10:46,230 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-29 00:10:46,233 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-29 00:10:46,262 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-29 00:10:46,264 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-29 00:10:46,265 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-11-29 00:10:46,270 INFO L811 eck$LassoCheckResult]: loop already infeasible [2018-11-29 00:10:46,288 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2018-11-29 00:10:46,288 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-11-29 00:10:46,291 INFO L87 Difference]: Start difference. First operand 13 states. Second operand 2 states. [2018-11-29 00:10:46,302 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-29 00:10:46,303 INFO L93 Difference]: Finished difference Result 13 states and 16 transitions. [2018-11-29 00:10:46,303 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-11-29 00:10:46,306 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 13 states and 16 transitions. [2018-11-29 00:10:46,307 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2018-11-29 00:10:46,312 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 13 states to 9 states and 12 transitions. [2018-11-29 00:10:46,316 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 9 [2018-11-29 00:10:46,317 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 9 [2018-11-29 00:10:46,317 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 12 transitions. [2018-11-29 00:10:46,318 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-29 00:10:46,319 INFO L705 BuchiCegarLoop]: Abstraction has 9 states and 12 transitions. [2018-11-29 00:10:46,338 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9 states and 12 transitions. [2018-11-29 00:10:46,349 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9 to 9. [2018-11-29 00:10:46,350 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2018-11-29 00:10:46,351 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 12 transitions. [2018-11-29 00:10:46,354 INFO L728 BuchiCegarLoop]: Abstraction has 9 states and 12 transitions. [2018-11-29 00:10:46,354 INFO L608 BuchiCegarLoop]: Abstraction has 9 states and 12 transitions. [2018-11-29 00:10:46,354 INFO L442 BuchiCegarLoop]: ======== Iteration 2============ [2018-11-29 00:10:46,355 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 9 states and 12 transitions. [2018-11-29 00:10:46,356 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2018-11-29 00:10:46,357 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-29 00:10:46,358 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-29 00:10:46,358 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1] [2018-11-29 00:10:46,358 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2018-11-29 00:10:46,358 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#L555 assume !(main_~array_size~0 < 1 || main_~array_size~0 >= 536870911); 36#L555-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; 37#L543-3 [2018-11-29 00:10:46,359 INFO L796 eck$LassoCheckResult]: Loop: 37#L543-3 assume !!(bubbleSort_~i~0 >= 0);bubbleSort_~j~0 := 1; 39#L544-3 assume !(bubbleSort_~j~0 <= bubbleSort_~i~0); 41#L543-2 bubbleSort_#t~post2 := bubbleSort_~i~0;bubbleSort_~i~0 := bubbleSort_#t~post2 - 1;havoc bubbleSort_#t~post2; 37#L543-3 [2018-11-29 00:10:46,359 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-29 00:10:46,359 INFO L82 PathProgramCache]: Analyzing trace with hash 925669, now seen corresponding path program 2 times [2018-11-29 00:10:46,359 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-29 00:10:46,359 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-29 00:10:46,363 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-29 00:10:46,366 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-29 00:10:46,366 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-29 00:10:46,385 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-29 00:10:46,407 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-29 00:10:46,416 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-29 00:10:46,417 INFO L82 PathProgramCache]: Analyzing trace with hash 46877, now seen corresponding path program 1 times [2018-11-29 00:10:46,417 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-29 00:10:46,417 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-29 00:10:46,418 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-29 00:10:46,419 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-29 00:10:46,419 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-29 00:10:46,422 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-29 00:10:46,427 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-29 00:10:46,434 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-29 00:10:46,434 INFO L82 PathProgramCache]: Analyzing trace with hash 1806818489, now seen corresponding path program 1 times [2018-11-29 00:10:46,434 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-29 00:10:46,434 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-29 00:10:46,435 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-29 00:10:46,436 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-29 00:10:46,438 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-29 00:10:46,459 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-29 00:10:46,485 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-29 00:10:46,608 WARN L180 SmtUtils]: Spent 107.00 ms on a formula simplification that was a NOOP. DAG size: 12 [2018-11-29 00:10:46,642 INFO L216 LassoAnalysis]: Preferences: [2018-11-29 00:10:46,643 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-29 00:10:46,644 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-29 00:10:46,644 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-29 00:10:46,644 INFO L127 ssoRankerPreferences]: Use exernal solver: true [2018-11-29 00:10:46,644 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-29 00:10:46,644 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-29 00:10:46,645 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-29 00:10:46,645 INFO L131 ssoRankerPreferences]: Filename of dumped script: bubblesort-alloca_true-valid-memsafety_true-termination.i_Iteration2_Loop [2018-11-29 00:10:46,645 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-29 00:10:46,645 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-11-29 00:10:46,668 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-29 00:10:46,676 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-29 00:10:46,843 WARN L180 SmtUtils]: Spent 128.00 ms on a formula simplification. DAG size of input: 13 DAG size of output: 12 [2018-11-29 00:10:46,887 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-11-29 00:10:46,888 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) Waiting until toolchain timeout for monitored process 2 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-29 00:10:46,893 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-29 00:10:46,893 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-29 00:10:46,915 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-11-29 00:10:46,915 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-29 00:10:46,937 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-29 00:10:46,937 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 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-29 00:10:46,981 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2018-11-29 00:10:46,981 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-29 00:10:47,039 INFO L452 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2018-11-29 00:10:47,042 INFO L216 LassoAnalysis]: Preferences: [2018-11-29 00:10:47,042 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-29 00:10:47,042 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-29 00:10:47,042 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-29 00:10:47,043 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-11-29 00:10:47,043 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-29 00:10:47,043 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-29 00:10:47,043 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-29 00:10:47,043 INFO L131 ssoRankerPreferences]: Filename of dumped script: bubblesort-alloca_true-valid-memsafety_true-termination.i_Iteration2_Loop [2018-11-29 00:10:47,043 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-29 00:10:47,043 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-11-29 00:10:47,047 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-29 00:10:47,077 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-29 00:10:47,298 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-11-29 00:10:47,304 INFO L497 LassoAnalysis]: Using template 'affine'. [2018-11-29 00:10:47,306 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-29 00:10:47,308 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-29 00:10:47,308 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-29 00:10:47,308 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-29 00:10:47,309 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-29 00:10:47,309 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-29 00:10:47,311 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-29 00:10:47,311 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-29 00:10:47,315 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-29 00:10:47,315 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-29 00:10:47,316 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-29 00:10:47,316 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-29 00:10:47,317 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-29 00:10:47,317 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-29 00:10:47,317 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-29 00:10:47,318 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-29 00:10:47,318 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-29 00:10:47,324 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-11-29 00:10:47,330 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2018-11-29 00:10:47,331 INFO L444 ModelExtractionUtils]: 1 out of 4 variables were initially zero. Simplification set additionally 0 variables to zero. [2018-11-29 00:10:47,333 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-11-29 00:10:47,333 INFO L440 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2018-11-29 00:10:47,333 INFO L518 LassoAnalysis]: Proved termination. [2018-11-29 00:10:47,334 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-29 00:10:47,335 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2018-11-29 00:10:47,387 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-29 00:10:47,422 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-29 00:10:47,425 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-29 00:10:47,453 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-29 00:10:47,454 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-29 00:10:47,546 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-29 00:10:47,549 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-29 00:10:47,550 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 9 states and 12 transitions. cyclomatic complexity: 4 Second operand 3 states. [2018-11-29 00:10:47,644 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-29 00:10:47,645 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-29 00:10:47,646 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-29 00:10:47,647 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 12 transitions. [2018-11-29 00:10:47,649 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 12 transitions. Stem has 4 letters. Loop has 3 letters. [2018-11-29 00:10:47,650 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-29 00:10:47,650 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 12 transitions. Stem has 7 letters. Loop has 3 letters. [2018-11-29 00:10:47,651 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-29 00:10:47,651 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 12 transitions. Stem has 4 letters. Loop has 6 letters. [2018-11-29 00:10:47,651 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-29 00:10:47,651 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 15 states and 22 transitions. [2018-11-29 00:10:47,653 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2018-11-29 00:10:47,653 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 15 states to 14 states and 20 transitions. [2018-11-29 00:10:47,654 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 8 [2018-11-29 00:10:47,654 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 9 [2018-11-29 00:10:47,654 INFO L73 IsDeterministic]: Start isDeterministic. Operand 14 states and 20 transitions. [2018-11-29 00:10:47,654 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-29 00:10:47,655 INFO L705 BuchiCegarLoop]: Abstraction has 14 states and 20 transitions. [2018-11-29 00:10:47,655 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14 states and 20 transitions. [2018-11-29 00:10:47,656 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14 to 13. [2018-11-29 00:10:47,656 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2018-11-29 00:10:47,657 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 19 transitions. [2018-11-29 00:10:47,657 INFO L728 BuchiCegarLoop]: Abstraction has 13 states and 19 transitions. [2018-11-29 00:10:47,657 INFO L608 BuchiCegarLoop]: Abstraction has 13 states and 19 transitions. [2018-11-29 00:10:47,657 INFO L442 BuchiCegarLoop]: ======== Iteration 3============ [2018-11-29 00:10:47,657 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 13 states and 19 transitions. [2018-11-29 00:10:47,658 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2018-11-29 00:10:47,658 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-29 00:10:47,659 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-29 00:10:47,659 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2018-11-29 00:10:47,659 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2018-11-29 00:10:47,659 INFO L794 eck$LassoCheckResult]: Stem: 107#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 99#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; 100#L555 assume !(main_~array_size~0 < 1 || main_~array_size~0 >= 536870911); 101#L555-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; 102#L543-3 assume !!(bubbleSort_~i~0 >= 0);bubbleSort_~j~0 := 1; 104#L544-3 [2018-11-29 00:10:47,660 INFO L796 eck$LassoCheckResult]: Loop: 104#L544-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); 108#L545 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); 103#L544-2 bubbleSort_#t~post3 := bubbleSort_~j~0;bubbleSort_~j~0 := 1 + bubbleSort_#t~post3;havoc bubbleSort_#t~post3; 104#L544-3 [2018-11-29 00:10:47,660 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-29 00:10:47,660 INFO L82 PathProgramCache]: Analyzing trace with hash 28695756, now seen corresponding path program 1 times [2018-11-29 00:10:47,660 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-29 00:10:47,660 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-29 00:10:47,661 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-29 00:10:47,661 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-29 00:10:47,662 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-29 00:10:47,670 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-29 00:10:47,677 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-29 00:10:47,681 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-29 00:10:47,682 INFO L82 PathProgramCache]: Analyzing trace with hash 54716, now seen corresponding path program 1 times [2018-11-29 00:10:47,682 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-29 00:10:47,682 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-29 00:10:47,683 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-29 00:10:47,683 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-29 00:10:47,683 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-29 00:10:47,691 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-29 00:10:47,699 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-29 00:10:47,702 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-29 00:10:47,702 INFO L82 PathProgramCache]: Analyzing trace with hash 176800017, now seen corresponding path program 1 times [2018-11-29 00:10:47,702 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-29 00:10:47,702 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-29 00:10:47,703 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-29 00:10:47,703 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-29 00:10:47,703 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-29 00:10:47,721 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-29 00:10:47,736 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-29 00:10:47,969 WARN L180 SmtUtils]: Spent 225.00 ms on a formula simplification. DAG size of input: 42 DAG size of output: 39 [2018-11-29 00:10:48,078 WARN L180 SmtUtils]: Spent 106.00 ms on a formula simplification that was a NOOP. DAG size: 35 [2018-11-29 00:10:48,669 WARN L180 SmtUtils]: Spent 589.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 56 [2018-11-29 00:10:48,842 WARN L180 SmtUtils]: Spent 170.00 ms on a formula simplification that was a NOOP. DAG size: 52 [2018-11-29 00:10:48,845 INFO L216 LassoAnalysis]: Preferences: [2018-11-29 00:10:48,845 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-29 00:10:48,845 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-29 00:10:48,845 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-29 00:10:48,845 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-11-29 00:10:48,846 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-29 00:10:48,846 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-29 00:10:48,846 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-29 00:10:48,846 INFO L131 ssoRankerPreferences]: Filename of dumped script: bubblesort-alloca_true-valid-memsafety_true-termination.i_Iteration3_Lasso [2018-11-29 00:10:48,847 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-29 00:10:48,847 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-11-29 00:10:48,853 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-29 00:10:48,864 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-29 00:10:49,033 WARN L180 SmtUtils]: Spent 136.00 ms on a formula simplification. DAG size of input: 48 DAG size of output: 45 [2018-11-29 00:10:49,120 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-29 00:10:49,123 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-29 00:10:49,125 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-29 00:10:49,129 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-29 00:10:49,143 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-29 00:10:49,149 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-29 00:10:49,154 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-29 00:10:49,157 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-29 00:10:49,159 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-29 00:10:49,306 WARN L180 SmtUtils]: Spent 107.00 ms on a formula simplification that was a NOOP. DAG size: 40 [2018-11-29 00:10:49,648 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-11-29 00:10:49,648 INFO L497 LassoAnalysis]: Using template 'affine'. [2018-11-29 00:10:49,651 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-29 00:10:49,652 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-29 00:10:49,652 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-29 00:10:49,652 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-29 00:10:49,652 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-29 00:10:49,653 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-29 00:10:49,653 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-29 00:10:49,653 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-29 00:10:49,657 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-29 00:10:49,657 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-29 00:10:49,658 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-29 00:10:49,658 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-29 00:10:49,659 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-29 00:10:49,660 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-29 00:10:49,671 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-29 00:10:49,671 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-29 00:10:49,734 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-11-29 00:10:49,795 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2018-11-29 00:10:49,797 INFO L444 ModelExtractionUtils]: 33 out of 37 variables were initially zero. Simplification set additionally 0 variables to zero. [2018-11-29 00:10:49,798 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-11-29 00:10:49,800 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2018-11-29 00:10:49,800 INFO L518 LassoAnalysis]: Proved termination. [2018-11-29 00:10:49,801 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-29 00:10:49,890 INFO L297 tatePredicateManager]: 4 out of 4 supporting invariants were superfluous and have been removed [2018-11-29 00:10:49,912 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-29 00:10:49,930 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-29 00:10:49,932 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-29 00:10:49,947 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-29 00:10:49,948 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-29 00:10:49,966 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-29 00:10:49,966 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2018-11-29 00:10:49,966 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 13 states and 19 transitions. cyclomatic complexity: 8 Second operand 3 states. [2018-11-29 00:10:50,006 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-29 00:10:50,008 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-29 00:10:50,009 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-29 00:10:50,009 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 12 transitions. [2018-11-29 00:10:50,009 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 12 transitions. Stem has 5 letters. Loop has 3 letters. [2018-11-29 00:10:50,010 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-29 00:10:50,010 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 12 transitions. Stem has 8 letters. Loop has 3 letters. [2018-11-29 00:10:50,010 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-29 00:10:50,010 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 12 transitions. Stem has 5 letters. Loop has 6 letters. [2018-11-29 00:10:50,011 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-29 00:10:50,011 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 28 states and 41 transitions. [2018-11-29 00:10:50,014 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2018-11-29 00:10:50,014 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 28 states to 18 states and 26 transitions. [2018-11-29 00:10:50,015 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 8 [2018-11-29 00:10:50,015 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 8 [2018-11-29 00:10:50,015 INFO L73 IsDeterministic]: Start isDeterministic. Operand 18 states and 26 transitions. [2018-11-29 00:10:50,015 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-29 00:10:50,015 INFO L705 BuchiCegarLoop]: Abstraction has 18 states and 26 transitions. [2018-11-29 00:10:50,016 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18 states and 26 transitions. [2018-11-29 00:10:50,017 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18 to 13. [2018-11-29 00:10:50,017 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2018-11-29 00:10:50,017 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 18 transitions. [2018-11-29 00:10:50,018 INFO L728 BuchiCegarLoop]: Abstraction has 13 states and 18 transitions. [2018-11-29 00:10:50,018 INFO L608 BuchiCegarLoop]: Abstraction has 13 states and 18 transitions. [2018-11-29 00:10:50,018 INFO L442 BuchiCegarLoop]: ======== Iteration 4============ [2018-11-29 00:10:50,018 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 13 states and 18 transitions. [2018-11-29 00:10:50,019 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2018-11-29 00:10:50,019 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-29 00:10:50,019 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-29 00:10:50,019 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [2, 1, 1, 1, 1, 1, 1] [2018-11-29 00:10:50,020 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2018-11-29 00:10:50,020 INFO L794 eck$LassoCheckResult]: Stem: 212#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 204#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; 205#L555 assume !(main_~array_size~0 < 1 || main_~array_size~0 >= 536870911); 206#L555-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; 207#L543-3 assume !!(bubbleSort_~i~0 >= 0);bubbleSort_~j~0 := 1; 211#L544-3 assume !(bubbleSort_~j~0 <= bubbleSort_~i~0); 214#L543-2 bubbleSort_#t~post2 := bubbleSort_~i~0;bubbleSort_~i~0 := bubbleSort_#t~post2 - 1;havoc bubbleSort_#t~post2; 216#L543-3 assume !!(bubbleSort_~i~0 >= 0);bubbleSort_~j~0 := 1; 209#L544-3 [2018-11-29 00:10:50,020 INFO L796 eck$LassoCheckResult]: Loop: 209#L544-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); 213#L545 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); 208#L544-2 bubbleSort_#t~post3 := bubbleSort_~j~0;bubbleSort_~j~0 := 1 + bubbleSort_#t~post3;havoc bubbleSort_#t~post3; 209#L544-3 [2018-11-29 00:10:50,020 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-29 00:10:50,020 INFO L82 PathProgramCache]: Analyzing trace with hash 176798328, now seen corresponding path program 2 times [2018-11-29 00:10:50,021 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-29 00:10:50,021 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-29 00:10:50,022 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-29 00:10:50,022 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-29 00:10:50,022 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-29 00:10:50,036 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-29 00:10:50,098 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-29 00:10:50,098 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-29 00:10:50,098 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-29 00:10:50,099 INFO L799 eck$LassoCheckResult]: stem already infeasible [2018-11-29 00:10:50,099 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-29 00:10:50,099 INFO L82 PathProgramCache]: Analyzing trace with hash 54716, now seen corresponding path program 2 times [2018-11-29 00:10:50,099 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-29 00:10:50,099 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-29 00:10:50,100 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-29 00:10:50,100 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-29 00:10:50,100 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-29 00:10:50,105 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-29 00:10:50,109 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-29 00:10:50,239 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-29 00:10:50,239 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2018-11-29 00:10:50,240 INFO L87 Difference]: Start difference. First operand 13 states and 18 transitions. cyclomatic complexity: 7 Second operand 5 states. [2018-11-29 00:10:50,282 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-29 00:10:50,282 INFO L93 Difference]: Finished difference Result 21 states and 28 transitions. [2018-11-29 00:10:50,283 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-29 00:10:50,283 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 21 states and 28 transitions. [2018-11-29 00:10:50,285 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2018-11-29 00:10:50,286 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 21 states to 19 states and 26 transitions. [2018-11-29 00:10:50,286 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 11 [2018-11-29 00:10:50,286 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 11 [2018-11-29 00:10:50,286 INFO L73 IsDeterministic]: Start isDeterministic. Operand 19 states and 26 transitions. [2018-11-29 00:10:50,286 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-29 00:10:50,286 INFO L705 BuchiCegarLoop]: Abstraction has 19 states and 26 transitions. [2018-11-29 00:10:50,287 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19 states and 26 transitions. [2018-11-29 00:10:50,288 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19 to 14. [2018-11-29 00:10:50,288 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2018-11-29 00:10:50,288 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 19 transitions. [2018-11-29 00:10:50,289 INFO L728 BuchiCegarLoop]: Abstraction has 14 states and 19 transitions. [2018-11-29 00:10:50,289 INFO L608 BuchiCegarLoop]: Abstraction has 14 states and 19 transitions. [2018-11-29 00:10:50,289 INFO L442 BuchiCegarLoop]: ======== Iteration 5============ [2018-11-29 00:10:50,289 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 14 states and 19 transitions. [2018-11-29 00:10:50,290 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2018-11-29 00:10:50,290 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-29 00:10:50,290 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-29 00:10:50,290 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-29 00:10:50,290 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2018-11-29 00:10:50,291 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#L555 assume !(main_~array_size~0 < 1 || main_~array_size~0 >= 536870911); 252#L555-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; 253#L543-3 assume !!(bubbleSort_~i~0 >= 0);bubbleSort_~j~0 := 1; 260#L544-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); 261#L545 assume !(bubbleSort_#t~mem4 > bubbleSort_#t~mem5);havoc bubbleSort_#t~mem4;havoc bubbleSort_#t~mem5; 256#L544-2 bubbleSort_#t~post3 := bubbleSort_~j~0;bubbleSort_~j~0 := 1 + bubbleSort_#t~post3;havoc bubbleSort_#t~post3; 257#L544-3 assume !(bubbleSort_~j~0 <= bubbleSort_~i~0); 262#L543-2 bubbleSort_#t~post2 := bubbleSort_~i~0;bubbleSort_~i~0 := bubbleSort_#t~post2 - 1;havoc bubbleSort_#t~post2; 263#L543-3 assume !!(bubbleSort_~i~0 >= 0);bubbleSort_~j~0 := 1; 255#L544-3 [2018-11-29 00:10:50,291 INFO L796 eck$LassoCheckResult]: Loop: 255#L544-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); 259#L545 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); 254#L544-2 bubbleSort_#t~post3 := bubbleSort_~j~0;bubbleSort_~j~0 := 1 + bubbleSort_#t~post3;havoc bubbleSort_#t~post3; 255#L544-3 [2018-11-29 00:10:50,291 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-29 00:10:50,291 INFO L82 PathProgramCache]: Analyzing trace with hash 1421271829, now seen corresponding path program 1 times [2018-11-29 00:10:50,291 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-29 00:10:50,291 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-29 00:10:50,292 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-29 00:10:50,292 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-29 00:10:50,292 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-29 00:10:50,300 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-29 00:10:50,308 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-29 00:10:50,313 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-29 00:10:50,313 INFO L82 PathProgramCache]: Analyzing trace with hash 54716, now seen corresponding path program 3 times [2018-11-29 00:10:50,313 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-29 00:10:50,314 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-29 00:10:50,314 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-29 00:10:50,315 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-29 00:10:50,315 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-29 00:10:50,319 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-29 00:10:50,323 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-29 00:10:50,325 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-29 00:10:50,325 INFO L82 PathProgramCache]: Analyzing trace with hash 1321478696, now seen corresponding path program 1 times [2018-11-29 00:10:50,325 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-29 00:10:50,325 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-29 00:10:50,326 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-29 00:10:50,326 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-29 00:10:50,326 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-29 00:10:50,335 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-29 00:10:50,452 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-29 00:10:50,452 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-29 00:10:50,452 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-29 00:10:50,470 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-29 00:10:50,492 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-29 00:10:50,494 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-29 00:10:50,586 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-29 00:10:50,609 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-29 00:10:50,610 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 12 [2018-11-29 00:10:50,910 WARN L180 SmtUtils]: Spent 297.00 ms on a formula simplification. DAG size of input: 42 DAG size of output: 39 [2018-11-29 00:10:50,938 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-11-29 00:10:50,939 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=95, Unknown=0, NotChecked=0, Total=132 [2018-11-29 00:10:50,940 INFO L87 Difference]: Start difference. First operand 14 states and 19 transitions. cyclomatic complexity: 7 Second operand 12 states. [2018-11-29 00:10:51,155 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-29 00:10:51,155 INFO L93 Difference]: Finished difference Result 29 states and 38 transitions. [2018-11-29 00:10:51,155 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-11-29 00:10:51,156 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 29 states and 38 transitions. [2018-11-29 00:10:51,158 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2018-11-29 00:10:51,159 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 29 states to 25 states and 34 transitions. [2018-11-29 00:10:51,159 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 14 [2018-11-29 00:10:51,159 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 14 [2018-11-29 00:10:51,159 INFO L73 IsDeterministic]: Start isDeterministic. Operand 25 states and 34 transitions. [2018-11-29 00:10:51,160 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-29 00:10:51,160 INFO L705 BuchiCegarLoop]: Abstraction has 25 states and 34 transitions. [2018-11-29 00:10:51,160 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states and 34 transitions. [2018-11-29 00:10:51,161 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 17. [2018-11-29 00:10:51,161 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2018-11-29 00:10:51,162 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 23 transitions. [2018-11-29 00:10:51,162 INFO L728 BuchiCegarLoop]: Abstraction has 17 states and 23 transitions. [2018-11-29 00:10:51,162 INFO L608 BuchiCegarLoop]: Abstraction has 17 states and 23 transitions. [2018-11-29 00:10:51,162 INFO L442 BuchiCegarLoop]: ======== Iteration 6============ [2018-11-29 00:10:51,162 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 17 states and 23 transitions. [2018-11-29 00:10:51,163 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2018-11-29 00:10:51,163 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-29 00:10:51,163 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-29 00:10:51,164 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1] [2018-11-29 00:10:51,164 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2018-11-29 00:10:51,164 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#L555 assume !(main_~array_size~0 < 1 || main_~array_size~0 >= 536870911); 357#L555-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; 358#L543-3 assume !!(bubbleSort_~i~0 >= 0);bubbleSort_~j~0 := 1; 368#L544-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); 371#L545 assume !(bubbleSort_#t~mem4 > bubbleSort_#t~mem5);havoc bubbleSort_#t~mem4;havoc bubbleSort_#t~mem5; 361#L544-2 bubbleSort_#t~post3 := bubbleSort_~j~0;bubbleSort_~j~0 := 1 + bubbleSort_#t~post3;havoc bubbleSort_#t~post3; 362#L544-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); 365#L545 assume !(bubbleSort_#t~mem4 > bubbleSort_#t~mem5);havoc bubbleSort_#t~mem4;havoc bubbleSort_#t~mem5; 369#L544-2 bubbleSort_#t~post3 := bubbleSort_~j~0;bubbleSort_~j~0 := 1 + bubbleSort_#t~post3;havoc bubbleSort_#t~post3; 370#L544-3 assume !(bubbleSort_~j~0 <= bubbleSort_~i~0); 366#L543-2 bubbleSort_#t~post2 := bubbleSort_~i~0;bubbleSort_~i~0 := bubbleSort_#t~post2 - 1;havoc bubbleSort_#t~post2; 367#L543-3 assume !!(bubbleSort_~i~0 >= 0);bubbleSort_~j~0 := 1; 360#L544-3 [2018-11-29 00:10:51,164 INFO L796 eck$LassoCheckResult]: Loop: 360#L544-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); 364#L545 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); 359#L544-2 bubbleSort_#t~post3 := bubbleSort_~j~0;bubbleSort_~j~0 := 1 + bubbleSort_#t~post3;havoc bubbleSort_#t~post3; 360#L544-3 [2018-11-29 00:10:51,165 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-29 00:10:51,165 INFO L82 PathProgramCache]: Analyzing trace with hash 1373641048, now seen corresponding path program 2 times [2018-11-29 00:10:51,165 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-29 00:10:51,165 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-29 00:10:51,166 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-29 00:10:51,166 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-29 00:10:51,166 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-29 00:10:51,176 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-29 00:10:51,186 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-29 00:10:51,190 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-29 00:10:51,190 INFO L82 PathProgramCache]: Analyzing trace with hash 54716, now seen corresponding path program 4 times [2018-11-29 00:10:51,190 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-29 00:10:51,190 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-29 00:10:51,191 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-29 00:10:51,191 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-29 00:10:51,192 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-29 00:10:51,195 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-29 00:10:51,199 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-29 00:10:51,201 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-29 00:10:51,201 INFO L82 PathProgramCache]: Analyzing trace with hash -307910395, now seen corresponding path program 2 times [2018-11-29 00:10:51,201 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-29 00:10:51,202 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-29 00:10:51,202 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-29 00:10:51,202 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-29 00:10:51,202 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-29 00:10:51,217 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-29 00:10:51,514 WARN L180 SmtUtils]: Spent 116.00 ms on a formula simplification. DAG size of input: 31 DAG size of output: 21 [2018-11-29 00:10:51,739 WARN L180 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 28 DAG size of output: 18 [2018-11-29 00:10:51,976 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-29 00:10:51,976 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-29 00:10:51,976 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-29 00:10:51,992 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-11-29 00:10:52,012 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-11-29 00:10:52,012 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-29 00:10:52,014 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-29 00:10:52,141 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-29 00:10:52,146 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-29 00:10:52,148 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-29 00:10:52,155 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-29 00:10:52,157 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-29 00:10:52,157 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:26, output treesize:3 [2018-11-29 00:10:52,169 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-29 00:10:52,188 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-29 00:10:52,189 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 8] total 12 [2018-11-29 00:10:52,327 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-11-29 00:10:52,327 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=94, Unknown=0, NotChecked=0, Total=132 [2018-11-29 00:10:52,328 INFO L87 Difference]: Start difference. First operand 17 states and 23 transitions. cyclomatic complexity: 8 Second operand 12 states. [2018-11-29 00:10:52,504 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-29 00:10:52,504 INFO L93 Difference]: Finished difference Result 37 states and 50 transitions. [2018-11-29 00:10:52,505 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-11-29 00:10:52,505 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 37 states and 50 transitions. [2018-11-29 00:10:52,507 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 6 [2018-11-29 00:10:52,510 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 37 states to 37 states and 50 transitions. [2018-11-29 00:10:52,510 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 19 [2018-11-29 00:10:52,511 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 19 [2018-11-29 00:10:52,511 INFO L73 IsDeterministic]: Start isDeterministic. Operand 37 states and 50 transitions. [2018-11-29 00:10:52,511 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-29 00:10:52,511 INFO L705 BuchiCegarLoop]: Abstraction has 37 states and 50 transitions. [2018-11-29 00:10:52,511 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states and 50 transitions. [2018-11-29 00:10:52,514 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 26. [2018-11-29 00:10:52,515 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26 states. [2018-11-29 00:10:52,515 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 35 transitions. [2018-11-29 00:10:52,515 INFO L728 BuchiCegarLoop]: Abstraction has 26 states and 35 transitions. [2018-11-29 00:10:52,515 INFO L608 BuchiCegarLoop]: Abstraction has 26 states and 35 transitions. [2018-11-29 00:10:52,516 INFO L442 BuchiCegarLoop]: ======== Iteration 7============ [2018-11-29 00:10:52,516 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 26 states and 35 transitions. [2018-11-29 00:10:52,516 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2018-11-29 00:10:52,516 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-29 00:10:52,516 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-29 00:10:52,517 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-29 00:10:52,517 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2018-11-29 00:10:52,517 INFO L794 eck$LassoCheckResult]: Stem: 484#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 476#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; 477#L555 assume !(main_~array_size~0 < 1 || main_~array_size~0 >= 536870911); 478#L555-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; 479#L543-3 assume !!(bubbleSort_~i~0 >= 0);bubbleSort_~j~0 := 1; 490#L544-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#L545 assume !(bubbleSort_#t~mem4 > bubbleSort_#t~mem5);havoc bubbleSort_#t~mem4;havoc bubbleSort_#t~mem5; 482#L544-2 bubbleSort_#t~post3 := bubbleSort_~j~0;bubbleSort_~j~0 := 1 + bubbleSort_#t~post3;havoc bubbleSort_#t~post3; 483#L544-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); 487#L545 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); 493#L544-2 bubbleSort_#t~post3 := bubbleSort_~j~0;bubbleSort_~j~0 := 1 + bubbleSort_#t~post3;havoc bubbleSort_#t~post3; 497#L544-3 assume !(bubbleSort_~j~0 <= bubbleSort_~i~0); 488#L543-2 bubbleSort_#t~post2 := bubbleSort_~i~0;bubbleSort_~i~0 := bubbleSort_#t~post2 - 1;havoc bubbleSort_#t~post2; 489#L543-3 assume !!(bubbleSort_~i~0 >= 0);bubbleSort_~j~0 := 1; 481#L544-3 [2018-11-29 00:10:52,518 INFO L796 eck$LassoCheckResult]: Loop: 481#L544-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#L545 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); 480#L544-2 bubbleSort_#t~post3 := bubbleSort_~j~0;bubbleSort_~j~0 := 1 + bubbleSort_#t~post3;havoc bubbleSort_#t~post3; 481#L544-3 [2018-11-29 00:10:52,518 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-29 00:10:52,518 INFO L82 PathProgramCache]: Analyzing trace with hash 1371794006, now seen corresponding path program 3 times [2018-11-29 00:10:52,518 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-29 00:10:52,518 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-29 00:10:52,519 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-29 00:10:52,519 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-29 00:10:52,519 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-29 00:10:52,528 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-29 00:10:52,536 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-29 00:10:52,541 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-29 00:10:52,541 INFO L82 PathProgramCache]: Analyzing trace with hash 54716, now seen corresponding path program 5 times [2018-11-29 00:10:52,541 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-29 00:10:52,541 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-29 00:10:52,542 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-29 00:10:52,542 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-29 00:10:52,542 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-29 00:10:52,545 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-29 00:10:52,549 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-29 00:10:52,551 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-29 00:10:52,551 INFO L82 PathProgramCache]: Analyzing trace with hash 501436231, now seen corresponding path program 4 times [2018-11-29 00:10:52,551 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-29 00:10:52,551 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-29 00:10:52,552 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-29 00:10:52,552 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-29 00:10:52,552 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-29 00:10:52,570 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-29 00:10:52,585 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-29 00:10:52,706 WARN L180 SmtUtils]: Spent 114.00 ms on a formula simplification. DAG size of input: 42 DAG size of output: 39 [2018-11-29 00:10:53,055 WARN L180 SmtUtils]: Spent 314.00 ms on a formula simplification. DAG size of input: 118 DAG size of output: 99 [2018-11-29 00:10:53,132 INFO L216 LassoAnalysis]: Preferences: [2018-11-29 00:10:53,132 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-29 00:10:53,132 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-29 00:10:53,132 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-29 00:10:53,133 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-11-29 00:10:53,133 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-29 00:10:53,133 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-29 00:10:53,133 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-29 00:10:53,133 INFO L131 ssoRankerPreferences]: Filename of dumped script: bubblesort-alloca_true-valid-memsafety_true-termination.i_Iteration7_Lasso [2018-11-29 00:10:53,133 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-29 00:10:53,134 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-11-29 00:10:53,137 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-29 00:10:53,156 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-29 00:10:53,158 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-29 00:10:53,160 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-29 00:10:53,162 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-29 00:10:53,480 WARN L180 SmtUtils]: Spent 191.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 53 [2018-11-29 00:10:53,616 WARN L180 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 43 DAG size of output: 41 [2018-11-29 00:10:53,617 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-29 00:10:53,620 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-29 00:10:53,622 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-29 00:10:53,624 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-29 00:10:53,627 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-29 00:10:53,629 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-29 00:10:53,954 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-11-29 00:10:53,955 INFO L497 LassoAnalysis]: Using template 'affine'. [2018-11-29 00:10:53,955 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-29 00:10:53,958 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-29 00:10:53,958 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-29 00:10:53,958 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-29 00:10:53,959 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-29 00:10:53,959 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-29 00:10:53,959 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-29 00:10:53,959 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-29 00:10:53,962 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-29 00:10:53,963 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-29 00:10:53,963 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-29 00:10:53,964 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-29 00:10:53,964 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-29 00:10:53,964 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-29 00:10:53,964 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-29 00:10:53,964 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-29 00:10:53,964 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-29 00:10:53,968 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-29 00:10:53,969 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-29 00:10:53,973 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-29 00:10:53,973 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-29 00:10:53,974 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-29 00:10:53,974 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-29 00:10:53,975 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-29 00:10:53,975 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-29 00:10:53,977 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-29 00:10:53,977 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-29 00:10:53,978 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-29 00:10:53,978 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-29 00:10:53,978 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-29 00:10:53,978 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-29 00:10:53,978 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-29 00:10:53,978 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-29 00:10:53,979 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-29 00:10:53,979 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-29 00:10:53,979 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-29 00:10:53,980 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-29 00:10:53,980 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-29 00:10:53,980 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-29 00:10:53,980 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-29 00:10:53,984 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-29 00:10:53,984 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-29 00:10:54,011 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-11-29 00:10:54,040 INFO L443 ModelExtractionUtils]: Simplification made 7 calls to the SMT solver. [2018-11-29 00:10:54,040 INFO L444 ModelExtractionUtils]: 27 out of 37 variables were initially zero. Simplification set additionally 5 variables to zero. [2018-11-29 00:10:54,041 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-11-29 00:10:54,042 INFO L440 nArgumentSynthesizer]: Removed 1 redundant supporting invariants from a total of 2. [2018-11-29 00:10:54,042 INFO L518 LassoAnalysis]: Proved termination. [2018-11-29 00:10:54,042 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_bubbleSort_~i~0, ULTIMATE.start_bubbleSort_~j~0) = 3*ULTIMATE.start_bubbleSort_~i~0 - 1*ULTIMATE.start_bubbleSort_~j~0 Supporting invariants [4*ULTIMATE.start_bubbleSort_~j~0 - 1 >= 0] [2018-11-29 00:10:54,174 INFO L297 tatePredicateManager]: 7 out of 8 supporting invariants were superfluous and have been removed [2018-11-29 00:10:54,196 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-29 00:10:54,215 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-29 00:10:54,217 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-29 00:10:54,229 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-29 00:10:54,231 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-29 00:10:54,245 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-29 00:10:54,245 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2018-11-29 00:10:54,246 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 26 states and 35 transitions. cyclomatic complexity: 11 Second operand 3 states. [2018-11-29 00:10:54,314 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-29 00:10:54,318 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-29 00:10:54,318 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-29 00:10:54,319 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 12 transitions. [2018-11-29 00:10:54,319 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 12 transitions. Stem has 14 letters. Loop has 3 letters. [2018-11-29 00:10:54,320 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-29 00:10:54,320 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2018-11-29 00:10:54,344 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-29 00:10:54,361 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-29 00:10:54,364 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-29 00:10:54,371 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-29 00:10:54,372 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-29 00:10:54,384 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-29 00:10:54,385 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-29 00:10:54,386 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 26 states and 35 transitions. cyclomatic complexity: 11 Second operand 3 states. [2018-11-29 00:10:54,432 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-29 00:10:54,433 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-29 00:10:54,433 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-29 00:10:54,434 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 12 transitions. [2018-11-29 00:10:54,435 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 12 transitions. Stem has 14 letters. Loop has 3 letters. [2018-11-29 00:10:54,435 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-29 00:10:54,435 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2018-11-29 00:10:54,503 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-29 00:10:54,524 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-29 00:10:54,527 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-29 00:10:54,535 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-29 00:10:54,537 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-29 00:10:54,554 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-29 00:10:54,554 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-29 00:10:54,554 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 26 states and 35 transitions. cyclomatic complexity: 11 Second operand 3 states. [2018-11-29 00:10:54,609 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-29 00:10:54,613 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-29 00:10:54,613 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-29 00:10:54,614 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 19 transitions. [2018-11-29 00:10:54,614 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 19 transitions. Stem has 14 letters. Loop has 3 letters. [2018-11-29 00:10:54,615 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-29 00:10:54,615 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 19 transitions. Stem has 17 letters. Loop has 3 letters. [2018-11-29 00:10:54,615 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-29 00:10:54,616 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 19 transitions. Stem has 14 letters. Loop has 6 letters. [2018-11-29 00:10:54,616 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-29 00:10:54,616 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 41 states and 58 transitions. [2018-11-29 00:10:54,618 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2018-11-29 00:10:54,618 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 41 states to 0 states and 0 transitions. [2018-11-29 00:10:54,618 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2018-11-29 00:10:54,618 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2018-11-29 00:10:54,618 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2018-11-29 00:10:54,618 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-29 00:10:54,618 INFO L705 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-29 00:10:54,619 INFO L728 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-29 00:10:54,619 INFO L608 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-29 00:10:54,619 INFO L442 BuchiCegarLoop]: ======== Iteration 8============ [2018-11-29 00:10:54,619 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2018-11-29 00:10:54,619 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2018-11-29 00:10:54,619 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2018-11-29 00:10:54,627 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 29.11 12:10:54 BoogieIcfgContainer [2018-11-29 00:10:54,627 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2018-11-29 00:10:54,628 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-11-29 00:10:54,628 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-11-29 00:10:54,628 INFO L276 PluginConnector]: Witness Printer initialized [2018-11-29 00:10:54,629 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.11 12:10:45" (3/4) ... [2018-11-29 00:10:54,633 INFO L147 WitnessPrinter]: No result that supports witness generation found [2018-11-29 00:10:54,633 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-11-29 00:10:54,634 INFO L168 Benchmark]: Toolchain (without parser) took 9796.85 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 191.9 MB). Free memory was 951.4 MB in the beginning and 821.0 MB in the end (delta: 130.4 MB). Peak memory consumption was 322.3 MB. Max. memory is 11.5 GB. [2018-11-29 00:10:54,635 INFO L168 Benchmark]: CDTParser took 0.15 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-29 00:10:54,636 INFO L168 Benchmark]: CACSL2BoogieTranslator took 535.11 ms. Allocated memory is still 1.0 GB. Free memory was 951.4 MB in the beginning and 929.9 MB in the end (delta: 21.5 MB). Peak memory consumption was 21.5 MB. Max. memory is 11.5 GB. [2018-11-29 00:10:54,636 INFO L168 Benchmark]: Boogie Procedure Inliner took 121.25 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 111.7 MB). Free memory was 929.9 MB in the beginning and 1.1 GB in the end (delta: -168.0 MB). Peak memory consumption was 14.0 MB. Max. memory is 11.5 GB. [2018-11-29 00:10:54,637 INFO L168 Benchmark]: Boogie Preprocessor took 31.76 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-29 00:10:54,638 INFO L168 Benchmark]: RCFGBuilder took 422.35 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.1 MB). Peak memory consumption was 19.1 MB. Max. memory is 11.5 GB. [2018-11-29 00:10:54,639 INFO L168 Benchmark]: BuchiAutomizer took 8676.21 ms. Allocated memory was 1.1 GB in the beginning and 1.2 GB in the end (delta: 80.2 MB). Free memory was 1.1 GB in the beginning and 821.0 MB in the end (delta: 257.9 MB). Peak memory consumption was 338.1 MB. Max. memory is 11.5 GB. [2018-11-29 00:10:54,639 INFO L168 Benchmark]: Witness Printer took 5.04 ms. Allocated memory is still 1.2 GB. Free memory is still 821.0 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-29 00:10:54,644 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.15 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 535.11 ms. Allocated memory is still 1.0 GB. Free memory was 951.4 MB in the beginning and 929.9 MB in the end (delta: 21.5 MB). Peak memory consumption was 21.5 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 121.25 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 111.7 MB). Free memory was 929.9 MB in the beginning and 1.1 GB in the end (delta: -168.0 MB). Peak memory consumption was 14.0 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 31.76 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 422.35 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.1 MB). Peak memory consumption was 19.1 MB. Max. memory is 11.5 GB. * BuchiAutomizer took 8676.21 ms. Allocated memory was 1.1 GB in the beginning and 1.2 GB in the end (delta: 80.2 MB). Free memory was 1.1 GB in the beginning and 821.0 MB in the end (delta: 257.9 MB). Peak memory consumption was 338.1 MB. Max. memory is 11.5 GB. * Witness Printer took 5.04 ms. Allocated memory is still 1.2 GB. Free memory is still 821.0 MB. There was no memory consumed. Max. memory is 11.5 GB. * 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 3 * i + -1 * j 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.6s and 8 iterations. TraceHistogramMax:2. Analysis of lassos took 7.0s. Construction of modules took 0.3s. Büchi inclusion checks took 0.9s. 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: 83 SDtfs, 87 SDslu, 91 SDs, 0 SdLazy, 180 SolverSat, 39 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.3s Time LassoAnalysisResults: nont0 unkn0 SFLI1 SFLT1 conc2 concLT0 SILN0 SILU1 SILI0 SILT0 lasso2 LassoPreprocessingBenchmarks: Lassos: inital110 mio100 ax100 hnf96 lsp98 ukn80 mio100 lsp81 div100 bol100 ite100 ukn100 eq171 hnf90 smp88 dnf100 smp100 tf104 neg100 sie105 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: sat Degree: 0 Time: 143ms VariablesStem: 11 VariablesLoop: 6 DisjunctsStem: 1 DisjunctsLoop: 1 SupportingInvariants: 2 MotzkinApplications: 6 LassoTerminationAnalysisBenchmarks: LassoNonterminationAnalysisSatFixpoint: 1 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...