./Ultimate.py --spec /storage/repos/svcomp/c/properties/termination.prp --file /storage/repos/svcomp/c/termination-restricted-15/DivMinus2_true-termination_true-no-overflow.c --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for termination Using default analysis Version 2e94e6aa Calling Ultimate with: java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx12G -Xms1G -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerTermination.xml -i /storage/repos/svcomp/c/termination-restricted-15/DivMinus2_true-termination_true-no-overflow.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-64bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(F end) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 64bit --witnessprinter.graph.data.programhash 4113f10404cd50c48db8fb998633f502f8a0b01a ...................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.24-2e94e6a [2019-01-01 21:36:31,762 INFO L170 SettingsManager]: Resetting all preferences to default values... [2019-01-01 21:36:31,765 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2019-01-01 21:36:31,784 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-01-01 21:36:31,784 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-01-01 21:36:31,785 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-01-01 21:36:31,786 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-01-01 21:36:31,788 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2019-01-01 21:36:31,790 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-01-01 21:36:31,791 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-01-01 21:36:31,792 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-01-01 21:36:31,792 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-01-01 21:36:31,793 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-01-01 21:36:31,794 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-01-01 21:36:31,795 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-01-01 21:36:31,796 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-01-01 21:36:31,797 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-01-01 21:36:31,799 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-01-01 21:36:31,801 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2019-01-01 21:36:31,803 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-01-01 21:36:31,804 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-01-01 21:36:31,805 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-01-01 21:36:31,808 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-01-01 21:36:31,808 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-01-01 21:36:31,808 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-01-01 21:36:31,812 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-01-01 21:36:31,814 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-01-01 21:36:31,814 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-01-01 21:36:31,815 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2019-01-01 21:36:31,820 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-01-01 21:36:31,821 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2019-01-01 21:36:31,822 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-01-01 21:36:31,822 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-01-01 21:36:31,822 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2019-01-01 21:36:31,827 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2019-01-01 21:36:31,828 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2019-01-01 21:36:31,830 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-64bit-Automizer_Default.epf [2019-01-01 21:36:31,858 INFO L110 SettingsManager]: Loading preferences was successful [2019-01-01 21:36:31,860 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2019-01-01 21:36:31,861 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-01-01 21:36:31,863 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2019-01-01 21:36:31,863 INFO L133 SettingsManager]: * Use SBE=true [2019-01-01 21:36:31,863 INFO L131 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2019-01-01 21:36:31,864 INFO L133 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2019-01-01 21:36:31,865 INFO L133 SettingsManager]: * Use old map elimination=false [2019-01-01 21:36:31,865 INFO L133 SettingsManager]: * Use external solver (rank synthesis)=false [2019-01-01 21:36:31,866 INFO L133 SettingsManager]: * Use only trivial implications for array writes=true [2019-01-01 21:36:31,866 INFO L133 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2019-01-01 21:36:31,866 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-01-01 21:36:31,866 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2019-01-01 21:36:31,866 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2019-01-01 21:36:31,866 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2019-01-01 21:36:31,867 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2019-01-01 21:36:31,868 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2019-01-01 21:36:31,868 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2019-01-01 21:36:31,868 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2019-01-01 21:36:31,868 INFO L133 SettingsManager]: * Assume nondeterminstic values are in range=false [2019-01-01 21:36:31,868 INFO L133 SettingsManager]: * Use constant arrays=true [2019-01-01 21:36:31,868 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2019-01-01 21:36:31,869 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-01-01 21:36:31,869 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-01-01 21:36:31,869 INFO L133 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2019-01-01 21:36:31,869 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-01-01 21:36:31,869 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2019-01-01 21:36:31,870 INFO L133 SettingsManager]: * Dump automata to the following directory=/home/matthias/ultimate/dump/auto [2019-01-01 21:36:31,874 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2019-01-01 21:36:31,876 INFO L133 SettingsManager]: * TransformationType=MODULO_NEIGHBOR Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(F end) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 64bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 4113f10404cd50c48db8fb998633f502f8a0b01a [2019-01-01 21:36:31,951 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-01-01 21:36:31,970 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-01-01 21:36:31,974 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-01-01 21:36:31,975 INFO L271 PluginConnector]: Initializing CDTParser... [2019-01-01 21:36:31,975 INFO L276 PluginConnector]: CDTParser initialized [2019-01-01 21:36:31,976 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/svcomp/c/termination-restricted-15/DivMinus2_true-termination_true-no-overflow.c [2019-01-01 21:36:32,038 INFO L221 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/374192173/5ceab367762f4b25a4b1c2fbcf98903e/FLAGe7a84eed4 [2019-01-01 21:36:32,593 INFO L307 CDTParser]: Found 1 translation units. [2019-01-01 21:36:32,594 INFO L161 CDTParser]: Scanning /storage/repos/svcomp/c/termination-restricted-15/DivMinus2_true-termination_true-no-overflow.c [2019-01-01 21:36:32,601 INFO L355 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/374192173/5ceab367762f4b25a4b1c2fbcf98903e/FLAGe7a84eed4 [2019-01-01 21:36:32,909 INFO L363 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/374192173/5ceab367762f4b25a4b1c2fbcf98903e [2019-01-01 21:36:32,913 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-01-01 21:36:32,915 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-01-01 21:36:32,917 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-01-01 21:36:32,917 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-01-01 21:36:32,921 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2019-01-01 21:36:32,923 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 01.01 09:36:32" (1/1) ... [2019-01-01 21:36:32,926 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@55cc0ecf and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 09:36:32, skipping insertion in model container [2019-01-01 21:36:32,927 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 01.01 09:36:32" (1/1) ... [2019-01-01 21:36:32,937 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-01-01 21:36:32,965 INFO L176 MainTranslator]: Built tables and reachable declarations [2019-01-01 21:36:33,193 INFO L204 PostProcessor]: Analyzing one entry point: main [2019-01-01 21:36:33,198 INFO L191 MainTranslator]: Completed pre-run [2019-01-01 21:36:33,216 INFO L204 PostProcessor]: Analyzing one entry point: main [2019-01-01 21:36:33,232 INFO L195 MainTranslator]: Completed translation [2019-01-01 21:36:33,233 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 09:36:33 WrapperNode [2019-01-01 21:36:33,233 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-01-01 21:36:33,234 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-01-01 21:36:33,235 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-01-01 21:36:33,235 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2019-01-01 21:36:33,246 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 09:36:33" (1/1) ... [2019-01-01 21:36:33,252 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 09:36:33" (1/1) ... [2019-01-01 21:36:33,278 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-01-01 21:36:33,278 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-01-01 21:36:33,278 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-01-01 21:36:33,278 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2019-01-01 21:36:33,290 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 09:36:33" (1/1) ... [2019-01-01 21:36:33,290 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 09:36:33" (1/1) ... [2019-01-01 21:36:33,291 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 09:36:33" (1/1) ... [2019-01-01 21:36:33,292 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 09:36:33" (1/1) ... [2019-01-01 21:36:33,294 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 09:36:33" (1/1) ... [2019-01-01 21:36:33,305 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 09:36:33" (1/1) ... [2019-01-01 21:36:33,306 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 09:36:33" (1/1) ... [2019-01-01 21:36:33,309 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-01-01 21:36:33,310 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-01-01 21:36:33,311 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-01-01 21:36:33,311 INFO L276 PluginConnector]: RCFGBuilder initialized [2019-01-01 21:36:33,312 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 09:36:33" (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 [2019-01-01 21:36:33,468 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-01-01 21:36:33,468 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-01-01 21:36:33,651 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-01-01 21:36:33,652 INFO L280 CfgBuilder]: Removed 6 assue(true) statements. [2019-01-01 21:36:33,652 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 01.01 09:36:33 BoogieIcfgContainer [2019-01-01 21:36:33,652 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-01-01 21:36:33,653 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2019-01-01 21:36:33,653 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2019-01-01 21:36:33,657 INFO L276 PluginConnector]: BuchiAutomizer initialized [2019-01-01 21:36:33,658 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-01-01 21:36:33,658 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 01.01 09:36:32" (1/3) ... [2019-01-01 21:36:33,659 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@73251f3b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 01.01 09:36:33, skipping insertion in model container [2019-01-01 21:36:33,660 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-01-01 21:36:33,660 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 09:36:33" (2/3) ... [2019-01-01 21:36:33,660 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@73251f3b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 01.01 09:36:33, skipping insertion in model container [2019-01-01 21:36:33,660 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-01-01 21:36:33,660 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 01.01 09:36:33" (3/3) ... [2019-01-01 21:36:33,662 INFO L375 chiAutomizerObserver]: Analyzing ICFG DivMinus2_true-termination_true-no-overflow.c [2019-01-01 21:36:33,737 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2019-01-01 21:36:33,738 INFO L374 BuchiCegarLoop]: Interprodecural is true [2019-01-01 21:36:33,739 INFO L375 BuchiCegarLoop]: Hoare is false [2019-01-01 21:36:33,739 INFO L376 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2019-01-01 21:36:33,739 INFO L377 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2019-01-01 21:36:33,739 INFO L378 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-01-01 21:36:33,739 INFO L379 BuchiCegarLoop]: Difference is false [2019-01-01 21:36:33,739 INFO L380 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-01-01 21:36:33,740 INFO L383 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2019-01-01 21:36:33,758 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 9 states. [2019-01-01 21:36:33,787 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2019-01-01 21:36:33,787 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-01 21:36:33,787 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-01 21:36:33,796 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1] [2019-01-01 21:36:33,797 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2019-01-01 21:36:33,797 INFO L442 BuchiCegarLoop]: ======== Iteration 1============ [2019-01-01 21:36:33,797 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 9 states. [2019-01-01 21:36:33,799 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2019-01-01 21:36:33,799 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-01 21:36:33,799 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-01 21:36:33,800 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1] [2019-01-01 21:36:33,800 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2019-01-01 21:36:33,810 INFO L794 eck$LassoCheckResult]: Stem: 4#ULTIMATE.startENTRYtrue havoc main_#res;havoc main_#t~nondet0, main_#t~nondet1, main_~x~0, main_~y~0, main_~ytmp~0, main_~res~0;havoc main_~x~0;havoc main_~y~0;havoc main_~ytmp~0;havoc main_~res~0;main_~x~0 := main_#t~nondet0;havoc main_#t~nondet0;main_~y~0 := main_#t~nondet1;havoc main_#t~nondet1;main_~res~0 := 0; 7#L14-2true [2019-01-01 21:36:33,811 INFO L796 eck$LassoCheckResult]: Loop: 7#L14-2true assume !!(main_~x~0 >= main_~y~0 && main_~y~0 > 0);main_~ytmp~0 := main_~y~0; 3#L17-2true assume !(0 != main_~ytmp~0); 11#L16-2true main_~res~0 := 1 + main_~res~0; 7#L14-2true [2019-01-01 21:36:33,820 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 21:36:33,820 INFO L82 PathProgramCache]: Analyzing trace with hash 32, now seen corresponding path program 1 times [2019-01-01 21:36:33,823 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 21:36:33,824 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 21:36:33,888 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:36:33,888 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 21:36:33,888 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:36:33,908 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 21:36:33,912 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 21:36:33,930 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 21:36:33,930 INFO L82 PathProgramCache]: Analyzing trace with hash 39957, now seen corresponding path program 1 times [2019-01-01 21:36:33,931 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 21:36:33,931 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 21:36:33,933 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:36:33,933 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 21:36:33,933 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:36:33,942 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 21:36:34,044 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-01 21:36:34,047 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-01 21:36:34,047 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-01-01 21:36:34,054 INFO L811 eck$LassoCheckResult]: loop already infeasible [2019-01-01 21:36:34,075 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-01 21:36:34,076 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-01 21:36:34,079 INFO L87 Difference]: Start difference. First operand 9 states. Second operand 3 states. [2019-01-01 21:36:34,153 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-01 21:36:34,154 INFO L93 Difference]: Finished difference Result 11 states and 13 transitions. [2019-01-01 21:36:34,155 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-01 21:36:34,159 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 11 states and 13 transitions. [2019-01-01 21:36:34,160 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 6 [2019-01-01 21:36:34,167 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 11 states to 7 states and 9 transitions. [2019-01-01 21:36:34,168 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 7 [2019-01-01 21:36:34,169 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 7 [2019-01-01 21:36:34,169 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 9 transitions. [2019-01-01 21:36:34,170 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-01-01 21:36:34,170 INFO L705 BuchiCegarLoop]: Abstraction has 7 states and 9 transitions. [2019-01-01 21:36:34,193 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7 states and 9 transitions. [2019-01-01 21:36:34,204 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7 to 7. [2019-01-01 21:36:34,205 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2019-01-01 21:36:34,205 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 9 transitions. [2019-01-01 21:36:34,206 INFO L728 BuchiCegarLoop]: Abstraction has 7 states and 9 transitions. [2019-01-01 21:36:34,207 INFO L608 BuchiCegarLoop]: Abstraction has 7 states and 9 transitions. [2019-01-01 21:36:34,207 INFO L442 BuchiCegarLoop]: ======== Iteration 2============ [2019-01-01 21:36:34,207 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 7 states and 9 transitions. [2019-01-01 21:36:34,208 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 6 [2019-01-01 21:36:34,208 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-01 21:36:34,208 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-01 21:36:34,209 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1] [2019-01-01 21:36:34,209 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1] [2019-01-01 21:36:34,209 INFO L794 eck$LassoCheckResult]: Stem: 31#ULTIMATE.startENTRY havoc main_#res;havoc main_#t~nondet0, main_#t~nondet1, main_~x~0, main_~y~0, main_~ytmp~0, main_~res~0;havoc main_~x~0;havoc main_~y~0;havoc main_~ytmp~0;havoc main_~res~0;main_~x~0 := main_#t~nondet0;havoc main_#t~nondet0;main_~y~0 := main_#t~nondet1;havoc main_#t~nondet1;main_~res~0 := 0; 32#L14-2 [2019-01-01 21:36:34,209 INFO L796 eck$LassoCheckResult]: Loop: 32#L14-2 assume !!(main_~x~0 >= main_~y~0 && main_~y~0 > 0);main_~ytmp~0 := main_~y~0; 29#L17-2 assume !!(0 != main_~ytmp~0); 30#L17 assume main_~ytmp~0 > 0;main_~ytmp~0 := main_~ytmp~0 - 1;main_~x~0 := main_~x~0 - 1; 33#L17-2 assume !(0 != main_~ytmp~0); 34#L16-2 main_~res~0 := 1 + main_~res~0; 32#L14-2 [2019-01-01 21:36:34,210 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 21:36:34,210 INFO L82 PathProgramCache]: Analyzing trace with hash 32, now seen corresponding path program 2 times [2019-01-01 21:36:34,210 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 21:36:34,210 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 21:36:34,212 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:36:34,212 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 21:36:34,212 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:36:34,214 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 21:36:34,217 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 21:36:34,218 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 21:36:34,219 INFO L82 PathProgramCache]: Analyzing trace with hash 38452088, now seen corresponding path program 1 times [2019-01-01 21:36:34,219 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 21:36:34,219 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 21:36:34,221 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:36:34,221 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-01 21:36:34,221 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:36:34,227 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 21:36:34,233 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 21:36:34,235 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 21:36:34,235 INFO L82 PathProgramCache]: Analyzing trace with hash 925955769, now seen corresponding path program 1 times [2019-01-01 21:36:34,235 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 21:36:34,236 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 21:36:34,237 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:36:34,237 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 21:36:34,237 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:36:34,245 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 21:36:34,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 21:36:34,393 WARN L181 SmtUtils]: Spent 131.00 ms on a formula simplification. DAG size of input: 24 DAG size of output: 20 [2019-01-01 21:36:34,448 INFO L216 LassoAnalysis]: Preferences: [2019-01-01 21:36:34,449 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-01-01 21:36:34,449 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-01-01 21:36:34,449 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-01-01 21:36:34,450 INFO L127 ssoRankerPreferences]: Use exernal solver: true [2019-01-01 21:36:34,450 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-01 21:36:34,450 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-01-01 21:36:34,450 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-01-01 21:36:34,450 INFO L131 ssoRankerPreferences]: Filename of dumped script: DivMinus2_true-termination_true-no-overflow.c_Iteration2_Loop [2019-01-01 21:36:34,450 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-01-01 21:36:34,451 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2019-01-01 21:36:34,471 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:36:34,483 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:36:34,486 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:36:34,502 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:36:34,961 INFO L300 LassoAnalysis]: Preprocessing complete. [2019-01-01 21:36:34,962 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 [2019-01-01 21:36:34,975 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-01 21:36:34,976 INFO L163 nArgumentSynthesizer]: Using integer mode. [2019-01-01 21:36:35,011 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2019-01-01 21:36:35,011 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {v_rep~unnamed0~0~true_1=1} Honda state: {v_rep~unnamed0~0~true_1=1} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-01 21:36:35,019 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-01 21:36:35,020 INFO L163 nArgumentSynthesizer]: Using integer mode. [2019-01-01 21:36:35,043 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2019-01-01 21:36:35,043 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {v_rep~unnamed0~0~false_1=0} Honda state: {v_rep~unnamed0~0~false_1=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-01-01 21:36:35,060 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-01 21:36:35,060 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 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-01 21:36:35,098 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2019-01-01 21:36:35,099 INFO L163 nArgumentSynthesizer]: Using integer mode. [2019-01-01 21:36:35,115 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2019-01-01 21:36:35,116 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_main_~res~0=0} Honda state: {ULTIMATE.start_main_~res~0=0} Generalized eigenvectors: [{ULTIMATE.start_main_~res~0=7}, {ULTIMATE.start_main_~res~0=-7}, {ULTIMATE.start_main_~res~0=1}] Lambdas: [2, 1, 1] Nus: [1, 0] No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 6 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-01 21:36:35,140 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-01 21:36:35,140 INFO L163 nArgumentSynthesizer]: Using integer mode. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 7 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-01 21:36:35,172 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2019-01-01 21:36:35,172 INFO L163 nArgumentSynthesizer]: Using integer mode. [2019-01-01 21:36:35,423 INFO L452 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2019-01-01 21:36:35,426 INFO L216 LassoAnalysis]: Preferences: [2019-01-01 21:36:35,426 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-01-01 21:36:35,427 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-01-01 21:36:35,427 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-01-01 21:36:35,427 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2019-01-01 21:36:35,427 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-01 21:36:35,427 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-01-01 21:36:35,427 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-01-01 21:36:35,427 INFO L131 ssoRankerPreferences]: Filename of dumped script: DivMinus2_true-termination_true-no-overflow.c_Iteration2_Loop [2019-01-01 21:36:35,428 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-01-01 21:36:35,428 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2019-01-01 21:36:35,430 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:36:35,441 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:36:35,448 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:36:35,461 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:36:35,613 WARN L181 SmtUtils]: Spent 114.00 ms on a formula simplification that was a NOOP. DAG size: 16 [2019-01-01 21:36:35,674 INFO L300 LassoAnalysis]: Preprocessing complete. [2019-01-01 21:36:35,679 INFO L497 LassoAnalysis]: Using template 'affine'. [2019-01-01 21:36:35,681 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 [2019-01-01 21:36:35,682 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:36:35,683 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:36:35,683 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:36:35,683 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:36:35,687 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-01 21:36:35,687 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-01 21:36:35,695 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 21:36:35,695 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 [2019-01-01 21:36:35,696 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:36:35,697 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:36:35,697 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:36:35,697 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:36:35,700 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-01 21:36:35,700 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-01 21:36:35,710 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 21:36:35,711 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 [2019-01-01 21:36:35,711 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:36:35,712 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 21:36:35,712 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:36:35,713 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:36:35,713 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:36:35,714 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 21:36:35,714 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 21:36:35,724 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-01-01 21:36:35,734 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2019-01-01 21:36:35,734 INFO L444 ModelExtractionUtils]: 1 out of 5 variables were initially zero. Simplification set additionally 2 variables to zero. [2019-01-01 21:36:35,737 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-01-01 21:36:35,737 INFO L440 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2019-01-01 21:36:35,737 INFO L518 LassoAnalysis]: Proved termination. [2019-01-01 21:36:35,738 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~x~0) = 1*ULTIMATE.start_main_~x~0 Supporting invariants [] [2019-01-01 21:36:35,740 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2019-01-01 21:36:35,853 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 21:36:35,867 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 21:36:35,870 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-01 21:36:35,885 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 21:36:35,888 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-01 21:36:36,028 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-01 21:36:36,031 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 3 loop predicates [2019-01-01 21:36:36,033 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 7 states and 9 transitions. cyclomatic complexity: 3 Second operand 4 states. [2019-01-01 21:36:36,099 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 7 states and 9 transitions. cyclomatic complexity: 3. Second operand 4 states. Result 24 states and 33 transitions. Complement of second has 7 states. [2019-01-01 21:36:36,101 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 [2019-01-01 21:36:36,102 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2019-01-01 21:36:36,102 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 11 transitions. [2019-01-01 21:36:36,104 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 11 transitions. Stem has 1 letters. Loop has 5 letters. [2019-01-01 21:36:36,106 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-01 21:36:36,106 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 11 transitions. Stem has 6 letters. Loop has 5 letters. [2019-01-01 21:36:36,107 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-01 21:36:36,107 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 11 transitions. Stem has 1 letters. Loop has 10 letters. [2019-01-01 21:36:36,108 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-01 21:36:36,108 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 24 states and 33 transitions. [2019-01-01 21:36:36,111 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 8 [2019-01-01 21:36:36,114 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 24 states to 18 states and 25 transitions. [2019-01-01 21:36:36,114 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 10 [2019-01-01 21:36:36,114 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 11 [2019-01-01 21:36:36,115 INFO L73 IsDeterministic]: Start isDeterministic. Operand 18 states and 25 transitions. [2019-01-01 21:36:36,115 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-01-01 21:36:36,115 INFO L705 BuchiCegarLoop]: Abstraction has 18 states and 25 transitions. [2019-01-01 21:36:36,115 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18 states and 25 transitions. [2019-01-01 21:36:36,118 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18 to 17. [2019-01-01 21:36:36,119 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2019-01-01 21:36:36,119 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 23 transitions. [2019-01-01 21:36:36,119 INFO L728 BuchiCegarLoop]: Abstraction has 17 states and 23 transitions. [2019-01-01 21:36:36,120 INFO L608 BuchiCegarLoop]: Abstraction has 17 states and 23 transitions. [2019-01-01 21:36:36,120 INFO L442 BuchiCegarLoop]: ======== Iteration 3============ [2019-01-01 21:36:36,120 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 17 states and 23 transitions. [2019-01-01 21:36:36,121 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 8 [2019-01-01 21:36:36,121 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-01 21:36:36,121 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-01 21:36:36,122 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [2, 1, 1, 1] [2019-01-01 21:36:36,122 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2019-01-01 21:36:36,122 INFO L794 eck$LassoCheckResult]: Stem: 107#ULTIMATE.startENTRY havoc main_#res;havoc main_#t~nondet0, main_#t~nondet1, main_~x~0, main_~y~0, main_~ytmp~0, main_~res~0;havoc main_~x~0;havoc main_~y~0;havoc main_~ytmp~0;havoc main_~res~0;main_~x~0 := main_#t~nondet0;havoc main_#t~nondet0;main_~y~0 := main_#t~nondet1;havoc main_#t~nondet1;main_~res~0 := 0; 108#L14-2 assume !!(main_~x~0 >= main_~y~0 && main_~y~0 > 0);main_~ytmp~0 := main_~y~0; 105#L17-2 assume !!(0 != main_~ytmp~0); 106#L17 assume main_~ytmp~0 > 0;main_~ytmp~0 := main_~ytmp~0 - 1;main_~x~0 := main_~x~0 - 1; 110#L17-2 assume !!(0 != main_~ytmp~0); 104#L17 [2019-01-01 21:36:36,122 INFO L796 eck$LassoCheckResult]: Loop: 104#L17 assume main_~ytmp~0 > 0;main_~ytmp~0 := main_~ytmp~0 - 1;main_~x~0 := main_~x~0 - 1; 103#L17-2 assume !!(0 != main_~ytmp~0); 104#L17 [2019-01-01 21:36:36,122 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 21:36:36,123 INFO L82 PathProgramCache]: Analyzing trace with hash 29869542, now seen corresponding path program 1 times [2019-01-01 21:36:36,123 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 21:36:36,123 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 21:36:36,125 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:36:36,125 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 21:36:36,125 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:36:36,131 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 21:36:36,138 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 21:36:36,141 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 21:36:36,141 INFO L82 PathProgramCache]: Analyzing trace with hash 1662, now seen corresponding path program 1 times [2019-01-01 21:36:36,141 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 21:36:36,141 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 21:36:36,144 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:36:36,144 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 21:36:36,145 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:36:36,148 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 21:36:36,151 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 21:36:36,152 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 21:36:36,153 INFO L82 PathProgramCache]: Analyzing trace with hash -1360140509, now seen corresponding path program 2 times [2019-01-01 21:36:36,153 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 21:36:36,153 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 21:36:36,156 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:36:36,156 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 21:36:36,156 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:36:36,164 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 21:36:36,172 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 21:36:36,300 WARN L181 SmtUtils]: Spent 101.00 ms on a formula simplification that was a NOOP. DAG size: 14 [2019-01-01 21:36:36,314 INFO L216 LassoAnalysis]: Preferences: [2019-01-01 21:36:36,314 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-01-01 21:36:36,314 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-01-01 21:36:36,315 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-01-01 21:36:36,315 INFO L127 ssoRankerPreferences]: Use exernal solver: true [2019-01-01 21:36:36,315 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-01 21:36:36,315 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-01-01 21:36:36,315 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-01-01 21:36:36,315 INFO L131 ssoRankerPreferences]: Filename of dumped script: DivMinus2_true-termination_true-no-overflow.c_Iteration3_Loop [2019-01-01 21:36:36,316 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-01-01 21:36:36,319 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2019-01-01 21:36:36,320 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:36:36,364 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:36:36,405 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:36:36,530 WARN L181 SmtUtils]: Spent 104.00 ms on a formula simplification that was a NOOP. DAG size: 10 [2019-01-01 21:36:36,531 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:36:36,822 INFO L300 LassoAnalysis]: Preprocessing complete. [2019-01-01 21:36:36,822 INFO L412 LassoAnalysis]: Checking for nontermination... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 8 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-01 21:36:36,834 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-01 21:36:36,834 INFO L163 nArgumentSynthesizer]: Using integer mode. [2019-01-01 21:36:36,873 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2019-01-01 21:36:36,873 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {v_rep~unnamed0~0~false_3=0} Honda state: {v_rep~unnamed0~0~false_3=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 9 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-01 21:36:36,879 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-01 21:36:36,879 INFO L163 nArgumentSynthesizer]: Using integer mode. [2019-01-01 21:36:36,900 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2019-01-01 21:36:36,901 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {v_rep~unnamed0~0~true_3=1} Honda state: {v_rep~unnamed0~0~true_3=1} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 10 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-01 21:36:36,908 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-01 21:36:36,908 INFO L163 nArgumentSynthesizer]: Using integer mode. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 11 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 11 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-01 21:36:36,935 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2019-01-01 21:36:36,935 INFO L163 nArgumentSynthesizer]: Using integer mode. [2019-01-01 21:36:36,992 INFO L452 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2019-01-01 21:36:36,994 INFO L216 LassoAnalysis]: Preferences: [2019-01-01 21:36:36,994 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-01-01 21:36:36,994 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-01-01 21:36:36,994 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-01-01 21:36:36,995 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2019-01-01 21:36:36,995 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-01 21:36:36,995 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-01-01 21:36:36,995 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-01-01 21:36:36,995 INFO L131 ssoRankerPreferences]: Filename of dumped script: DivMinus2_true-termination_true-no-overflow.c_Iteration3_Loop [2019-01-01 21:36:36,995 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-01-01 21:36:36,995 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2019-01-01 21:36:36,997 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:36:37,003 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:36:37,025 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:36:37,028 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:36:37,184 INFO L300 LassoAnalysis]: Preprocessing complete. [2019-01-01 21:36:37,185 INFO L497 LassoAnalysis]: Using template 'affine'. [2019-01-01 21:36:37,186 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 [2019-01-01 21:36:37,186 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:36:37,187 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:36:37,187 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:36:37,187 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:36:37,190 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-01 21:36:37,190 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-01 21:36:37,195 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 21:36:37,204 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 [2019-01-01 21:36:37,205 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:36:37,205 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 21:36:37,205 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:36:37,205 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:36:37,206 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:36:37,209 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 21:36:37,209 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 21:36:37,220 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-01-01 21:36:37,232 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2019-01-01 21:36:37,232 INFO L444 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 1 variables to zero. [2019-01-01 21:36:37,232 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-01-01 21:36:37,233 INFO L440 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2019-01-01 21:36:37,233 INFO L518 LassoAnalysis]: Proved termination. [2019-01-01 21:36:37,233 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~ytmp~0) = 1*ULTIMATE.start_main_~ytmp~0 Supporting invariants [] [2019-01-01 21:36:37,237 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2019-01-01 21:36:37,284 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 21:36:37,291 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 21:36:37,293 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-01 21:36:37,298 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 21:36:37,299 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-01 21:36:37,316 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-01 21:36:37,317 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2019-01-01 21:36:37,318 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 17 states and 23 transitions. cyclomatic complexity: 9 Second operand 3 states. [2019-01-01 21:36:37,356 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 17 states and 23 transitions. cyclomatic complexity: 9. Second operand 3 states. Result 32 states and 45 transitions. Complement of second has 5 states. [2019-01-01 21:36:37,359 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 3 states 1 stem states 1 non-accepting loop states 1 accepting loop states [2019-01-01 21:36:37,359 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2019-01-01 21:36:37,361 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 8 transitions. [2019-01-01 21:36:37,361 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 8 transitions. Stem has 5 letters. Loop has 2 letters. [2019-01-01 21:36:37,361 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-01 21:36:37,361 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 8 transitions. Stem has 7 letters. Loop has 2 letters. [2019-01-01 21:36:37,362 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-01 21:36:37,363 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 8 transitions. Stem has 5 letters. Loop has 4 letters. [2019-01-01 21:36:37,363 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-01 21:36:37,364 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 32 states and 45 transitions. [2019-01-01 21:36:37,367 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 8 [2019-01-01 21:36:37,368 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 32 states to 29 states and 40 transitions. [2019-01-01 21:36:37,369 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 12 [2019-01-01 21:36:37,369 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 13 [2019-01-01 21:36:37,369 INFO L73 IsDeterministic]: Start isDeterministic. Operand 29 states and 40 transitions. [2019-01-01 21:36:37,369 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-01-01 21:36:37,370 INFO L705 BuchiCegarLoop]: Abstraction has 29 states and 40 transitions. [2019-01-01 21:36:37,371 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states and 40 transitions. [2019-01-01 21:36:37,373 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 24. [2019-01-01 21:36:37,374 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2019-01-01 21:36:37,375 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 34 transitions. [2019-01-01 21:36:37,375 INFO L728 BuchiCegarLoop]: Abstraction has 24 states and 34 transitions. [2019-01-01 21:36:37,375 INFO L608 BuchiCegarLoop]: Abstraction has 24 states and 34 transitions. [2019-01-01 21:36:37,375 INFO L442 BuchiCegarLoop]: ======== Iteration 4============ [2019-01-01 21:36:37,375 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 24 states and 34 transitions. [2019-01-01 21:36:37,377 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 8 [2019-01-01 21:36:37,378 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-01 21:36:37,378 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-01 21:36:37,379 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [2, 1, 1, 1, 1] [2019-01-01 21:36:37,379 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2019-01-01 21:36:37,379 INFO L794 eck$LassoCheckResult]: Stem: 199#ULTIMATE.startENTRY havoc main_#res;havoc main_#t~nondet0, main_#t~nondet1, main_~x~0, main_~y~0, main_~ytmp~0, main_~res~0;havoc main_~x~0;havoc main_~y~0;havoc main_~ytmp~0;havoc main_~res~0;main_~x~0 := main_#t~nondet0;havoc main_#t~nondet0;main_~y~0 := main_#t~nondet1;havoc main_#t~nondet1;main_~res~0 := 0; 200#L14-2 assume !!(main_~x~0 >= main_~y~0 && main_~y~0 > 0);main_~ytmp~0 := main_~y~0; 204#L17-2 assume !!(0 != main_~ytmp~0); 215#L17 assume main_~ytmp~0 > 0;main_~ytmp~0 := main_~ytmp~0 - 1;main_~x~0 := main_~x~0 - 1; 214#L17-2 assume !!(0 != main_~ytmp~0); 198#L17 assume !(main_~ytmp~0 > 0);main_~ytmp~0 := 1 + main_~ytmp~0;main_~x~0 := 1 + main_~x~0; 210#L17-2 [2019-01-01 21:36:37,379 INFO L796 eck$LassoCheckResult]: Loop: 210#L17-2 assume !!(0 != main_~ytmp~0); 211#L17 assume main_~ytmp~0 > 0;main_~ytmp~0 := main_~ytmp~0 - 1;main_~x~0 := main_~x~0 - 1; 210#L17-2 [2019-01-01 21:36:37,380 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 21:36:37,382 INFO L82 PathProgramCache]: Analyzing trace with hash 925955826, now seen corresponding path program 1 times [2019-01-01 21:36:37,382 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 21:36:37,382 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 21:36:37,385 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:36:37,385 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-01 21:36:37,385 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:36:37,391 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 21:36:37,481 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-01 21:36:37,482 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-01 21:36:37,482 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-01-01 21:36:37,482 INFO L799 eck$LassoCheckResult]: stem already infeasible [2019-01-01 21:36:37,483 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 21:36:37,483 INFO L82 PathProgramCache]: Analyzing trace with hash 1572, now seen corresponding path program 2 times [2019-01-01 21:36:37,483 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 21:36:37,483 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 21:36:37,487 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:36:37,488 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 21:36:37,488 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:36:37,491 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 21:36:37,494 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 21:36:37,565 INFO L216 LassoAnalysis]: Preferences: [2019-01-01 21:36:37,565 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-01-01 21:36:37,566 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-01-01 21:36:37,566 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-01-01 21:36:37,566 INFO L127 ssoRankerPreferences]: Use exernal solver: true [2019-01-01 21:36:37,566 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-01 21:36:37,567 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-01-01 21:36:37,567 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-01-01 21:36:37,567 INFO L131 ssoRankerPreferences]: Filename of dumped script: DivMinus2_true-termination_true-no-overflow.c_Iteration4_Loop [2019-01-01 21:36:37,567 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-01-01 21:36:37,567 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2019-01-01 21:36:37,569 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:36:37,585 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:36:37,590 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:36:37,599 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:36:37,711 INFO L300 LassoAnalysis]: Preprocessing complete. [2019-01-01 21:36:37,711 INFO L412 LassoAnalysis]: Checking for nontermination... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 12 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 12 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-01 21:36:37,716 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-01 21:36:37,716 INFO L163 nArgumentSynthesizer]: Using integer mode. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 13 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 13 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-01 21:36:37,741 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2019-01-01 21:36:37,741 INFO L163 nArgumentSynthesizer]: Using integer mode. [2019-01-01 21:36:37,764 INFO L452 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2019-01-01 21:36:37,766 INFO L216 LassoAnalysis]: Preferences: [2019-01-01 21:36:37,766 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-01-01 21:36:37,766 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-01-01 21:36:37,766 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-01-01 21:36:37,766 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2019-01-01 21:36:37,767 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-01 21:36:37,767 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-01-01 21:36:37,767 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-01-01 21:36:37,767 INFO L131 ssoRankerPreferences]: Filename of dumped script: DivMinus2_true-termination_true-no-overflow.c_Iteration4_Loop [2019-01-01 21:36:37,767 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-01-01 21:36:37,767 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2019-01-01 21:36:37,769 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:36:37,775 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:36:37,780 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:36:37,785 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:36:37,915 INFO L300 LassoAnalysis]: Preprocessing complete. [2019-01-01 21:36:37,916 INFO L497 LassoAnalysis]: Using template 'affine'. [2019-01-01 21:36:37,916 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 [2019-01-01 21:36:37,918 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:36:37,918 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 21:36:37,919 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:36:37,919 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:36:37,919 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:36:37,919 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 21:36:37,920 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 21:36:37,930 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-01-01 21:36:37,936 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2019-01-01 21:36:37,936 INFO L444 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 1 variables to zero. [2019-01-01 21:36:37,940 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-01-01 21:36:37,940 INFO L440 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2019-01-01 21:36:37,941 INFO L518 LassoAnalysis]: Proved termination. [2019-01-01 21:36:37,941 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~ytmp~0) = 1*ULTIMATE.start_main_~ytmp~0 Supporting invariants [] [2019-01-01 21:36:37,941 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2019-01-01 21:36:37,982 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 21:36:37,995 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 21:36:37,997 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-01 21:36:38,005 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 21:36:38,006 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-01 21:36:38,007 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-01 21:36:38,007 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 1 loop predicates [2019-01-01 21:36:38,007 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 24 states and 34 transitions. cyclomatic complexity: 14 Second operand 3 states. [2019-01-01 21:36:38,066 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 24 states and 34 transitions. cyclomatic complexity: 14. Second operand 3 states. Result 32 states and 47 transitions. Complement of second has 5 states. [2019-01-01 21:36:38,068 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 3 states 1 stem states 1 non-accepting loop states 1 accepting loop states [2019-01-01 21:36:38,068 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2019-01-01 21:36:38,069 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 11 transitions. [2019-01-01 21:36:38,069 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 11 transitions. Stem has 6 letters. Loop has 2 letters. [2019-01-01 21:36:38,070 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-01 21:36:38,070 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 11 transitions. Stem has 8 letters. Loop has 2 letters. [2019-01-01 21:36:38,070 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-01 21:36:38,070 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 11 transitions. Stem has 6 letters. Loop has 4 letters. [2019-01-01 21:36:38,070 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-01 21:36:38,072 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 32 states and 47 transitions. [2019-01-01 21:36:38,074 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 8 [2019-01-01 21:36:38,075 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 32 states to 30 states and 44 transitions. [2019-01-01 21:36:38,075 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 14 [2019-01-01 21:36:38,076 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 16 [2019-01-01 21:36:38,076 INFO L73 IsDeterministic]: Start isDeterministic. Operand 30 states and 44 transitions. [2019-01-01 21:36:38,077 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-01-01 21:36:38,077 INFO L705 BuchiCegarLoop]: Abstraction has 30 states and 44 transitions. [2019-01-01 21:36:38,077 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states and 44 transitions. [2019-01-01 21:36:38,080 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 28. [2019-01-01 21:36:38,080 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28 states. [2019-01-01 21:36:38,081 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 42 transitions. [2019-01-01 21:36:38,081 INFO L728 BuchiCegarLoop]: Abstraction has 28 states and 42 transitions. [2019-01-01 21:36:38,083 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-01-01 21:36:38,083 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-01-01 21:36:38,084 INFO L87 Difference]: Start difference. First operand 28 states and 42 transitions. Second operand 4 states. [2019-01-01 21:36:38,103 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-01 21:36:38,104 INFO L93 Difference]: Finished difference Result 18 states and 24 transitions. [2019-01-01 21:36:38,104 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-01-01 21:36:38,104 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 18 states and 24 transitions. [2019-01-01 21:36:38,106 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2019-01-01 21:36:38,106 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 18 states to 14 states and 18 transitions. [2019-01-01 21:36:38,106 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 4 [2019-01-01 21:36:38,106 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 4 [2019-01-01 21:36:38,107 INFO L73 IsDeterministic]: Start isDeterministic. Operand 14 states and 18 transitions. [2019-01-01 21:36:38,107 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-01-01 21:36:38,107 INFO L705 BuchiCegarLoop]: Abstraction has 14 states and 18 transitions. [2019-01-01 21:36:38,107 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14 states and 18 transitions. [2019-01-01 21:36:38,108 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14 to 12. [2019-01-01 21:36:38,108 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2019-01-01 21:36:38,109 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 15 transitions. [2019-01-01 21:36:38,109 INFO L728 BuchiCegarLoop]: Abstraction has 12 states and 15 transitions. [2019-01-01 21:36:38,109 INFO L608 BuchiCegarLoop]: Abstraction has 12 states and 15 transitions. [2019-01-01 21:36:38,109 INFO L442 BuchiCegarLoop]: ======== Iteration 5============ [2019-01-01 21:36:38,109 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 12 states and 15 transitions. [2019-01-01 21:36:38,110 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2019-01-01 21:36:38,110 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-01 21:36:38,110 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-01 21:36:38,111 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [3, 2, 2, 1, 1, 1] [2019-01-01 21:36:38,111 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2019-01-01 21:36:38,111 INFO L794 eck$LassoCheckResult]: Stem: 344#ULTIMATE.startENTRY havoc main_#res;havoc main_#t~nondet0, main_#t~nondet1, main_~x~0, main_~y~0, main_~ytmp~0, main_~res~0;havoc main_~x~0;havoc main_~y~0;havoc main_~ytmp~0;havoc main_~res~0;main_~x~0 := main_#t~nondet0;havoc main_#t~nondet0;main_~y~0 := main_#t~nondet1;havoc main_#t~nondet1;main_~res~0 := 0; 345#L14-2 assume !!(main_~x~0 >= main_~y~0 && main_~y~0 > 0);main_~ytmp~0 := main_~y~0; 342#L17-2 assume !!(0 != main_~ytmp~0); 343#L17 assume main_~ytmp~0 > 0;main_~ytmp~0 := main_~ytmp~0 - 1;main_~x~0 := main_~x~0 - 1; 346#L17-2 assume !(0 != main_~ytmp~0); 349#L16-2 main_~res~0 := 1 + main_~res~0; 347#L14-2 assume !!(main_~x~0 >= main_~y~0 && main_~y~0 > 0);main_~ytmp~0 := main_~y~0; 348#L17-2 assume !!(0 != main_~ytmp~0); 351#L17 assume main_~ytmp~0 > 0;main_~ytmp~0 := main_~ytmp~0 - 1;main_~x~0 := main_~x~0 - 1; 350#L17-2 assume !!(0 != main_~ytmp~0); 341#L17 [2019-01-01 21:36:38,111 INFO L796 eck$LassoCheckResult]: Loop: 341#L17 assume main_~ytmp~0 > 0;main_~ytmp~0 := main_~ytmp~0 - 1;main_~x~0 := main_~x~0 - 1; 340#L17-2 assume !!(0 != main_~ytmp~0); 341#L17 [2019-01-01 21:36:38,111 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 21:36:38,112 INFO L82 PathProgramCache]: Analyzing trace with hash -1275475969, now seen corresponding path program 2 times [2019-01-01 21:36:38,112 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 21:36:38,112 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 21:36:38,113 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:36:38,114 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-01 21:36:38,114 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:36:38,124 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 21:36:38,294 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 1 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-01 21:36:38,295 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-01 21:36:38,295 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-01 21:36:38,311 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2019-01-01 21:36:38,322 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-01-01 21:36:38,322 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-01 21:36:38,323 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-01 21:36:38,428 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 1 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-01 21:36:38,449 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-01 21:36:38,449 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 9 [2019-01-01 21:36:38,449 INFO L799 eck$LassoCheckResult]: stem already infeasible [2019-01-01 21:36:38,450 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 21:36:38,450 INFO L82 PathProgramCache]: Analyzing trace with hash 1662, now seen corresponding path program 3 times [2019-01-01 21:36:38,450 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 21:36:38,450 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 21:36:38,451 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:36:38,451 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-01 21:36:38,452 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:36:38,454 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 21:36:38,456 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 21:36:38,483 INFO L216 LassoAnalysis]: Preferences: [2019-01-01 21:36:38,483 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-01-01 21:36:38,484 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-01-01 21:36:38,484 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-01-01 21:36:38,484 INFO L127 ssoRankerPreferences]: Use exernal solver: true [2019-01-01 21:36:38,484 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-01 21:36:38,484 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-01-01 21:36:38,484 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-01-01 21:36:38,484 INFO L131 ssoRankerPreferences]: Filename of dumped script: DivMinus2_true-termination_true-no-overflow.c_Iteration5_Loop [2019-01-01 21:36:38,484 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-01-01 21:36:38,484 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2019-01-01 21:36:38,486 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:36:38,492 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:36:38,496 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:36:38,500 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:36:38,571 INFO L300 LassoAnalysis]: Preprocessing complete. [2019-01-01 21:36:38,571 INFO L412 LassoAnalysis]: Checking for nontermination... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 15 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 15 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-01 21:36:38,578 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-01 21:36:38,579 INFO L163 nArgumentSynthesizer]: Using integer mode. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 16 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 16 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-01 21:36:38,603 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2019-01-01 21:36:38,604 INFO L163 nArgumentSynthesizer]: Using integer mode. [2019-01-01 21:36:38,617 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2019-01-01 21:36:38,617 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_main_~x~0=0} Honda state: {ULTIMATE.start_main_~x~0=0} Generalized eigenvectors: [{ULTIMATE.start_main_~x~0=-1}, {ULTIMATE.start_main_~x~0=-1}, {ULTIMATE.start_main_~x~0=1}] Lambdas: [0, 2, 1] Nus: [1, 1] No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 17 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 17 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-01 21:36:38,640 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-01 21:36:38,640 INFO L163 nArgumentSynthesizer]: Using integer mode. [2019-01-01 21:36:38,662 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2019-01-01 21:36:38,662 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {v_rep~unnamed0~0~true_7=1} Honda state: {v_rep~unnamed0~0~true_7=1} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 18 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 18 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-01 21:36:38,667 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-01 21:36:38,667 INFO L163 nArgumentSynthesizer]: Using integer mode. [2019-01-01 21:36:38,690 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2019-01-01 21:36:38,690 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {v_rep~unnamed0~0~false_7=0} Honda state: {v_rep~unnamed0~0~false_7=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 19 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 19 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-01 21:36:38,695 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-01 21:36:38,695 INFO L163 nArgumentSynthesizer]: Using integer mode. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 20 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 20 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-01 21:36:38,723 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2019-01-01 21:36:38,723 INFO L163 nArgumentSynthesizer]: Using integer mode. [2019-01-01 21:36:38,781 INFO L452 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2019-01-01 21:36:38,782 INFO L216 LassoAnalysis]: Preferences: [2019-01-01 21:36:38,783 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-01-01 21:36:38,783 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-01-01 21:36:38,783 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-01-01 21:36:38,783 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2019-01-01 21:36:38,783 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-01 21:36:38,783 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-01-01 21:36:38,783 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-01-01 21:36:38,784 INFO L131 ssoRankerPreferences]: Filename of dumped script: DivMinus2_true-termination_true-no-overflow.c_Iteration5_Loop [2019-01-01 21:36:38,784 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-01-01 21:36:38,784 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2019-01-01 21:36:38,788 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:36:38,793 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:36:38,798 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:36:38,804 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:36:38,926 INFO L300 LassoAnalysis]: Preprocessing complete. [2019-01-01 21:36:38,926 INFO L497 LassoAnalysis]: Using template 'affine'. [2019-01-01 21:36:38,927 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 [2019-01-01 21:36:38,930 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:36:38,930 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 21:36:38,931 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:36:38,931 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:36:38,931 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:36:38,932 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 21:36:38,932 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 21:36:38,936 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 21:36:38,936 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 [2019-01-01 21:36:38,937 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:36:38,937 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:36:38,937 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:36:38,938 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:36:38,939 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-01 21:36:38,939 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-01 21:36:38,944 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 21:36:38,944 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 [2019-01-01 21:36:38,945 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:36:38,945 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:36:38,945 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:36:38,945 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:36:38,950 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-01 21:36:38,950 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-01 21:36:38,953 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 21:36:38,954 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 [2019-01-01 21:36:38,954 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:36:38,954 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 21:36:38,955 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:36:38,955 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:36:38,955 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:36:38,956 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 21:36:38,956 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 21:36:38,959 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-01-01 21:36:38,961 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2019-01-01 21:36:38,961 INFO L444 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 1 variables to zero. [2019-01-01 21:36:38,963 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-01-01 21:36:38,963 INFO L440 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2019-01-01 21:36:38,964 INFO L518 LassoAnalysis]: Proved termination. [2019-01-01 21:36:38,964 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~ytmp~0) = 1*ULTIMATE.start_main_~ytmp~0 Supporting invariants [] [2019-01-01 21:36:38,964 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2019-01-01 21:36:39,034 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 21:36:39,047 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 21:36:39,048 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-01 21:36:39,056 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 21:36:39,057 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-01 21:36:39,121 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-01 21:36:39,122 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2019-01-01 21:36:39,122 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 12 states and 15 transitions. cyclomatic complexity: 5 Second operand 3 states. [2019-01-01 21:36:39,138 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 12 states and 15 transitions. cyclomatic complexity: 5. Second operand 3 states. Result 20 states and 24 transitions. Complement of second has 5 states. [2019-01-01 21:36:39,139 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 3 states 1 stem states 1 non-accepting loop states 1 accepting loop states [2019-01-01 21:36:39,139 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2019-01-01 21:36:39,140 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 8 transitions. [2019-01-01 21:36:39,140 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 8 transitions. Stem has 10 letters. Loop has 2 letters. [2019-01-01 21:36:39,140 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-01 21:36:39,140 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2019-01-01 21:36:39,157 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 21:36:39,169 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 21:36:39,170 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-01 21:36:39,174 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 21:36:39,175 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-01 21:36:39,197 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-01 21:36:39,198 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 [2019-01-01 21:36:39,198 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 12 states and 15 transitions. cyclomatic complexity: 5 Second operand 3 states. [2019-01-01 21:36:39,240 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 12 states and 15 transitions. cyclomatic complexity: 5. Second operand 3 states. Result 19 states and 23 transitions. Complement of second has 5 states. [2019-01-01 21:36:39,242 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 3 states 1 stem states 1 non-accepting loop states 1 accepting loop states [2019-01-01 21:36:39,242 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2019-01-01 21:36:39,242 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 7 transitions. [2019-01-01 21:36:39,242 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 7 transitions. Stem has 10 letters. Loop has 2 letters. [2019-01-01 21:36:39,242 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-01 21:36:39,243 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2019-01-01 21:36:39,255 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 21:36:39,262 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 21:36:39,264 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-01 21:36:39,269 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 21:36:39,270 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-01 21:36:39,324 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-01 21:36:39,325 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 [2019-01-01 21:36:39,325 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 12 states and 15 transitions. cyclomatic complexity: 5 Second operand 3 states. [2019-01-01 21:36:39,356 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 12 states and 15 transitions. cyclomatic complexity: 5. Second operand 3 states. Result 19 states and 24 transitions. Complement of second has 6 states. [2019-01-01 21:36:39,361 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 3 states 1 stem states 1 non-accepting loop states 1 accepting loop states [2019-01-01 21:36:39,361 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2019-01-01 21:36:39,362 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 12 transitions. [2019-01-01 21:36:39,362 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 12 transitions. Stem has 10 letters. Loop has 2 letters. [2019-01-01 21:36:39,363 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-01 21:36:39,363 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 12 transitions. Stem has 12 letters. Loop has 2 letters. [2019-01-01 21:36:39,363 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-01 21:36:39,363 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 12 transitions. Stem has 10 letters. Loop has 4 letters. [2019-01-01 21:36:39,364 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-01 21:36:39,364 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 19 states and 24 transitions. [2019-01-01 21:36:39,365 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2019-01-01 21:36:39,365 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 19 states to 0 states and 0 transitions. [2019-01-01 21:36:39,365 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2019-01-01 21:36:39,365 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2019-01-01 21:36:39,365 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2019-01-01 21:36:39,365 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-01-01 21:36:39,366 INFO L705 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-01-01 21:36:39,366 INFO L728 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-01-01 21:36:39,366 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-01-01 21:36:39,366 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2019-01-01 21:36:39,366 INFO L87 Difference]: Start difference. First operand 0 states and 0 transitions. Second operand 10 states. [2019-01-01 21:36:39,367 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-01 21:36:39,367 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2019-01-01 21:36:39,367 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2019-01-01 21:36:39,367 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 0 states and 0 transitions. [2019-01-01 21:36:39,367 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2019-01-01 21:36:39,367 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 0 states to 0 states and 0 transitions. [2019-01-01 21:36:39,367 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2019-01-01 21:36:39,368 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2019-01-01 21:36:39,372 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2019-01-01 21:36:39,372 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-01-01 21:36:39,372 INFO L705 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-01-01 21:36:39,372 INFO L728 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-01-01 21:36:39,373 INFO L608 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-01-01 21:36:39,373 INFO L442 BuchiCegarLoop]: ======== Iteration 6============ [2019-01-01 21:36:39,373 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2019-01-01 21:36:39,373 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2019-01-01 21:36:39,373 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2019-01-01 21:36:39,381 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 01.01 09:36:39 BoogieIcfgContainer [2019-01-01 21:36:39,382 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2019-01-01 21:36:39,382 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-01-01 21:36:39,382 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-01-01 21:36:39,382 INFO L276 PluginConnector]: Witness Printer initialized [2019-01-01 21:36:39,383 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 01.01 09:36:33" (3/4) ... [2019-01-01 21:36:39,387 INFO L147 WitnessPrinter]: No result that supports witness generation found [2019-01-01 21:36:39,387 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-01-01 21:36:39,388 INFO L168 Benchmark]: Toolchain (without parser) took 6473.54 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 191.4 MB). Free memory was 947.3 MB in the beginning and 1.2 GB in the end (delta: -206.9 MB). There was no memory consumed. Max. memory is 11.5 GB. [2019-01-01 21:36:39,389 INFO L168 Benchmark]: CDTParser took 0.13 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. [2019-01-01 21:36:39,389 INFO L168 Benchmark]: CACSL2BoogieTranslator took 317.22 ms. Allocated memory is still 1.0 GB. Free memory was 947.3 MB in the beginning and 936.6 MB in the end (delta: 10.7 MB). Peak memory consumption was 10.7 MB. Max. memory is 11.5 GB. [2019-01-01 21:36:39,390 INFO L168 Benchmark]: Boogie Procedure Inliner took 43.48 ms. Allocated memory is still 1.0 GB. Free memory is still 936.6 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-01-01 21:36:39,391 INFO L168 Benchmark]: Boogie Preprocessor took 31.75 ms. Allocated memory is still 1.0 GB. Free memory is still 936.6 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-01-01 21:36:39,391 INFO L168 Benchmark]: RCFGBuilder took 342.00 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 109.6 MB). Free memory was 936.6 MB in the beginning and 1.1 GB in the end (delta: -148.3 MB). Peak memory consumption was 18.3 MB. Max. memory is 11.5 GB. [2019-01-01 21:36:39,392 INFO L168 Benchmark]: BuchiAutomizer took 5728.65 ms. Allocated memory was 1.1 GB in the beginning and 1.2 GB in the end (delta: 81.8 MB). Free memory was 1.1 GB in the beginning and 1.2 GB in the end (delta: -69.4 MB). Peak memory consumption was 12.4 MB. Max. memory is 11.5 GB. [2019-01-01 21:36:39,393 INFO L168 Benchmark]: Witness Printer took 4.78 ms. Allocated memory is still 1.2 GB. Free memory is still 1.2 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-01-01 21:36:39,397 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.13 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 317.22 ms. Allocated memory is still 1.0 GB. Free memory was 947.3 MB in the beginning and 936.6 MB in the end (delta: 10.7 MB). Peak memory consumption was 10.7 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 43.48 ms. Allocated memory is still 1.0 GB. Free memory is still 936.6 MB. There was no memory consumed. Max. memory is 11.5 GB. * Boogie Preprocessor took 31.75 ms. Allocated memory is still 1.0 GB. Free memory is still 936.6 MB. There was no memory consumed. Max. memory is 11.5 GB. * RCFGBuilder took 342.00 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 109.6 MB). Free memory was 936.6 MB in the beginning and 1.1 GB in the end (delta: -148.3 MB). Peak memory consumption was 18.3 MB. Max. memory is 11.5 GB. * BuchiAutomizer took 5728.65 ms. Allocated memory was 1.1 GB in the beginning and 1.2 GB in the end (delta: 81.8 MB). Free memory was 1.1 GB in the beginning and 1.2 GB in the end (delta: -69.4 MB). Peak memory consumption was 12.4 MB. Max. memory is 11.5 GB. * Witness Printer took 4.78 ms. Allocated memory is still 1.2 GB. Free memory is still 1.2 GB. 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 (3 trivial, 3 deterministic, 1 nondeterministic). One deterministic module has affine ranking function x and consists of 4 locations. One deterministic module has affine ranking function ytmp and consists of 3 locations. One deterministic module has affine ranking function ytmp and consists of 3 locations. One nondeterministic module has affine ranking function ytmp and consists of 3 locations. 3 modules have a trivial ranking function, the largest among these consists of 10 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 5.6s and 6 iterations. TraceHistogramMax:3. Analysis of lassos took 4.3s. Construction of modules took 0.2s. Büchi inclusion checks took 0.8s. Highest rank in rank-based complementation 3. Minimization of det autom 3. Minimization of nondet autom 4. Automata minimization 0.0s AutomataMinimizationTime, 5 MinimizatonAttempts, 10 StatesRemovedByMinimization, 4 NontrivialMinimizations. Non-live state removal took 0.0s Buchi closure took 0.0s. Biggest automaton had 24 states and ocurred in iteration 3. Nontrivial modules had stage [3, 0, 1, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/1 HoareTripleCheckerStatistics: 49 SDtfs, 44 SDslu, 16 SDs, 0 SdLazy, 60 SolverSat, 12 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.2s Time LassoAnalysisResults: nont0 unkn0 SFLI1 SFLT2 conc0 concLT0 SILN0 SILU0 SILI0 SILT2 lasso0 LassoPreprocessingBenchmarks: Lassos: inital19 mio100 ax164 hnf100 lsp44 ukn100 mio100 lsp100 div100 bol100 ite100 ukn100 eq172 hnf94 smp84 dnf100 smp100 tf111 neg97 sie108 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 0 Time: 14ms VariablesStem: 1 VariablesLoop: 0 DisjunctsStem: 1 DisjunctsLoop: 1 SupportingInvariants: 2 MotzkinApplications: 6 LassoTerminationAnalysisBenchmarks: LassoNonterminationAnalysisSatFixpoint: 6 LassoNonterminationAnalysisSatUnbounded: 2 LassoNonterminationAnalysisUnsat: 4 LassoNonterminationAnalysisUnknown: 0 LassoNonterminationAnalysisTime: 0.8s - TerminationAnalysisResult: Termination proven Buchi Automizer proved that your program is terminating RESULT: Ultimate proved your program to be correct! Received shutdown request...