./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 0ed9222f 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-0ed9222-m [2019-01-14 02:19:00,147 INFO L170 SettingsManager]: Resetting all preferences to default values... [2019-01-14 02:19:00,149 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2019-01-14 02:19:00,162 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-01-14 02:19:00,163 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-01-14 02:19:00,164 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-01-14 02:19:00,165 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-01-14 02:19:00,168 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2019-01-14 02:19:00,170 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-01-14 02:19:00,171 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-01-14 02:19:00,172 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-01-14 02:19:00,172 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-01-14 02:19:00,173 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-01-14 02:19:00,175 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-01-14 02:19:00,176 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-01-14 02:19:00,177 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-01-14 02:19:00,179 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-01-14 02:19:00,181 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-01-14 02:19:00,184 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2019-01-14 02:19:00,185 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-01-14 02:19:00,187 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-01-14 02:19:00,188 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-01-14 02:19:00,192 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-01-14 02:19:00,192 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-01-14 02:19:00,192 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-01-14 02:19:00,193 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-01-14 02:19:00,195 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-01-14 02:19:00,196 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-01-14 02:19:00,197 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2019-01-14 02:19:00,198 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-01-14 02:19:00,199 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2019-01-14 02:19:00,200 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-01-14 02:19:00,200 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-01-14 02:19:00,200 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2019-01-14 02:19:00,202 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2019-01-14 02:19:00,203 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2019-01-14 02:19:00,204 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-64bit-Automizer_Default.epf [2019-01-14 02:19:00,222 INFO L110 SettingsManager]: Loading preferences was successful [2019-01-14 02:19:00,223 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2019-01-14 02:19:00,224 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-01-14 02:19:00,224 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2019-01-14 02:19:00,225 INFO L133 SettingsManager]: * Use SBE=true [2019-01-14 02:19:00,225 INFO L131 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2019-01-14 02:19:00,225 INFO L133 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2019-01-14 02:19:00,225 INFO L133 SettingsManager]: * Use old map elimination=false [2019-01-14 02:19:00,225 INFO L133 SettingsManager]: * Use external solver (rank synthesis)=false [2019-01-14 02:19:00,226 INFO L133 SettingsManager]: * Use only trivial implications for array writes=true [2019-01-14 02:19:00,226 INFO L133 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2019-01-14 02:19:00,226 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-01-14 02:19:00,226 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2019-01-14 02:19:00,226 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2019-01-14 02:19:00,227 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2019-01-14 02:19:00,228 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2019-01-14 02:19:00,228 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2019-01-14 02:19:00,228 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2019-01-14 02:19:00,229 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2019-01-14 02:19:00,229 INFO L133 SettingsManager]: * Assume nondeterminstic values are in range=false [2019-01-14 02:19:00,229 INFO L133 SettingsManager]: * Use constant arrays=true [2019-01-14 02:19:00,229 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2019-01-14 02:19:00,229 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-01-14 02:19:00,229 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-01-14 02:19:00,231 INFO L133 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2019-01-14 02:19:00,231 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-01-14 02:19:00,231 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2019-01-14 02:19:00,231 INFO L133 SettingsManager]: * Dump automata to the following directory=/home/matthias/ultimate/dump/auto [2019-01-14 02:19:00,233 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2019-01-14 02:19:00,233 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-14 02:19:00,273 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-01-14 02:19:00,287 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-01-14 02:19:00,292 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-01-14 02:19:00,294 INFO L271 PluginConnector]: Initializing CDTParser... [2019-01-14 02:19:00,294 INFO L276 PluginConnector]: CDTParser initialized [2019-01-14 02:19:00,295 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-14 02:19:00,376 INFO L221 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4447430af/a75ec23d96f541b2bc287445adad083a/FLAGa4083fd93 [2019-01-14 02:19:00,876 INFO L307 CDTParser]: Found 1 translation units. [2019-01-14 02:19:00,877 INFO L161 CDTParser]: Scanning /storage/repos/svcomp/c/termination-restricted-15/DivMinus2_true-termination_true-no-overflow.c [2019-01-14 02:19:00,885 INFO L355 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4447430af/a75ec23d96f541b2bc287445adad083a/FLAGa4083fd93 [2019-01-14 02:19:01,242 INFO L363 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4447430af/a75ec23d96f541b2bc287445adad083a [2019-01-14 02:19:01,247 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-01-14 02:19:01,249 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-01-14 02:19:01,251 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-01-14 02:19:01,251 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-01-14 02:19:01,255 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2019-01-14 02:19:01,256 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.01 02:19:01" (1/1) ... [2019-01-14 02:19:01,260 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7ae9932d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 02:19:01, skipping insertion in model container [2019-01-14 02:19:01,260 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.01 02:19:01" (1/1) ... [2019-01-14 02:19:01,269 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-01-14 02:19:01,290 INFO L176 MainTranslator]: Built tables and reachable declarations [2019-01-14 02:19:01,561 INFO L208 PostProcessor]: Analyzing one entry point: main [2019-01-14 02:19:01,567 INFO L191 MainTranslator]: Completed pre-run [2019-01-14 02:19:01,595 INFO L208 PostProcessor]: Analyzing one entry point: main [2019-01-14 02:19:01,616 INFO L195 MainTranslator]: Completed translation [2019-01-14 02:19:01,617 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 02:19:01 WrapperNode [2019-01-14 02:19:01,617 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-01-14 02:19:01,619 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-01-14 02:19:01,619 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-01-14 02:19:01,619 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2019-01-14 02:19:01,632 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 02:19:01" (1/1) ... [2019-01-14 02:19:01,638 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 02:19:01" (1/1) ... [2019-01-14 02:19:01,667 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-01-14 02:19:01,667 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-01-14 02:19:01,668 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-01-14 02:19:01,668 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2019-01-14 02:19:01,679 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 02:19:01" (1/1) ... [2019-01-14 02:19:01,680 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 02:19:01" (1/1) ... [2019-01-14 02:19:01,681 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 02:19:01" (1/1) ... [2019-01-14 02:19:01,682 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 02:19:01" (1/1) ... [2019-01-14 02:19:01,685 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 02:19:01" (1/1) ... [2019-01-14 02:19:01,692 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 02:19:01" (1/1) ... [2019-01-14 02:19:01,693 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 02:19:01" (1/1) ... [2019-01-14 02:19:01,695 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-01-14 02:19:01,696 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-01-14 02:19:01,696 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-01-14 02:19:01,696 INFO L276 PluginConnector]: RCFGBuilder initialized [2019-01-14 02:19:01,698 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 02:19:01" (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-14 02:19:01,843 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-01-14 02:19:01,843 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-01-14 02:19:02,038 INFO L281 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-01-14 02:19:02,038 INFO L286 CfgBuilder]: Removed 6 assue(true) statements. [2019-01-14 02:19:02,040 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.01 02:19:02 BoogieIcfgContainer [2019-01-14 02:19:02,040 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-01-14 02:19:02,040 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2019-01-14 02:19:02,041 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2019-01-14 02:19:02,044 INFO L276 PluginConnector]: BuchiAutomizer initialized [2019-01-14 02:19:02,045 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-01-14 02:19:02,045 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 14.01 02:19:01" (1/3) ... [2019-01-14 02:19:02,046 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@4aad1865 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 14.01 02:19:02, skipping insertion in model container [2019-01-14 02:19:02,046 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-01-14 02:19:02,047 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 02:19:01" (2/3) ... [2019-01-14 02:19:02,047 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@4aad1865 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 14.01 02:19:02, skipping insertion in model container [2019-01-14 02:19:02,047 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-01-14 02:19:02,047 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.01 02:19:02" (3/3) ... [2019-01-14 02:19:02,049 INFO L375 chiAutomizerObserver]: Analyzing ICFG DivMinus2_true-termination_true-no-overflow.c [2019-01-14 02:19:02,158 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2019-01-14 02:19:02,159 INFO L374 BuchiCegarLoop]: Interprodecural is true [2019-01-14 02:19:02,159 INFO L375 BuchiCegarLoop]: Hoare is false [2019-01-14 02:19:02,160 INFO L376 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2019-01-14 02:19:02,160 INFO L377 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2019-01-14 02:19:02,160 INFO L378 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-01-14 02:19:02,160 INFO L379 BuchiCegarLoop]: Difference is false [2019-01-14 02:19:02,160 INFO L380 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-01-14 02:19:02,160 INFO L383 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2019-01-14 02:19:02,180 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 9 states. [2019-01-14 02:19:02,209 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2019-01-14 02:19:02,210 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-14 02:19:02,210 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-14 02:19:02,219 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [1] [2019-01-14 02:19:02,220 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2019-01-14 02:19:02,220 INFO L442 BuchiCegarLoop]: ======== Iteration 1============ [2019-01-14 02:19:02,220 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 9 states. [2019-01-14 02:19:02,221 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2019-01-14 02:19:02,222 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-14 02:19:02,222 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-14 02:19:02,222 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [1] [2019-01-14 02:19:02,222 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2019-01-14 02:19:02,244 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-14 02:19:02,244 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-14 02:19:02,258 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 02:19:02,259 INFO L82 PathProgramCache]: Analyzing trace with hash 32, now seen corresponding path program 1 times [2019-01-14 02:19:02,265 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 02:19:02,269 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 02:19:02,338 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:19:02,338 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 02:19:02,338 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:19:02,363 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 02:19:02,368 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 02:19:02,389 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 02:19:02,389 INFO L82 PathProgramCache]: Analyzing trace with hash 39957, now seen corresponding path program 1 times [2019-01-14 02:19:02,389 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 02:19:02,390 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 02:19:02,392 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:19:02,392 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 02:19:02,392 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:19:02,401 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 02:19:02,450 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-14 02:19:02,452 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-14 02:19:02,452 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-01-14 02:19:02,457 INFO L811 eck$LassoCheckResult]: loop already infeasible [2019-01-14 02:19:02,471 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-14 02:19:02,472 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-14 02:19:02,474 INFO L87 Difference]: Start difference. First operand 9 states. Second operand 3 states. [2019-01-14 02:19:02,539 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 02:19:02,539 INFO L93 Difference]: Finished difference Result 11 states and 13 transitions. [2019-01-14 02:19:02,540 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-14 02:19:02,542 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 11 states and 13 transitions. [2019-01-14 02:19:02,543 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 6 [2019-01-14 02:19:02,549 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 11 states to 7 states and 9 transitions. [2019-01-14 02:19:02,550 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 7 [2019-01-14 02:19:02,551 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 7 [2019-01-14 02:19:02,551 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 9 transitions. [2019-01-14 02:19:02,552 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-01-14 02:19:02,552 INFO L706 BuchiCegarLoop]: Abstraction has 7 states and 9 transitions. [2019-01-14 02:19:02,572 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7 states and 9 transitions. [2019-01-14 02:19:02,581 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7 to 7. [2019-01-14 02:19:02,582 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2019-01-14 02:19:02,582 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 9 transitions. [2019-01-14 02:19:02,584 INFO L729 BuchiCegarLoop]: Abstraction has 7 states and 9 transitions. [2019-01-14 02:19:02,584 INFO L609 BuchiCegarLoop]: Abstraction has 7 states and 9 transitions. [2019-01-14 02:19:02,584 INFO L442 BuchiCegarLoop]: ======== Iteration 2============ [2019-01-14 02:19:02,585 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 7 states and 9 transitions. [2019-01-14 02:19:02,586 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 6 [2019-01-14 02:19:02,586 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-14 02:19:02,586 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-14 02:19:02,586 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [1] [2019-01-14 02:19:02,587 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1] [2019-01-14 02:19:02,587 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-14 02:19:02,587 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-14 02:19:02,587 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 02:19:02,587 INFO L82 PathProgramCache]: Analyzing trace with hash 32, now seen corresponding path program 2 times [2019-01-14 02:19:02,588 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 02:19:02,589 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 02:19:02,591 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:19:02,591 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 02:19:02,592 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:19:02,594 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 02:19:02,597 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 02:19:02,598 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 02:19:02,599 INFO L82 PathProgramCache]: Analyzing trace with hash 38452088, now seen corresponding path program 1 times [2019-01-14 02:19:02,599 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 02:19:02,599 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 02:19:02,601 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:19:02,602 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-14 02:19:02,602 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:19:02,607 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 02:19:02,614 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 02:19:02,616 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 02:19:02,617 INFO L82 PathProgramCache]: Analyzing trace with hash 925955769, now seen corresponding path program 1 times [2019-01-14 02:19:02,617 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 02:19:02,617 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 02:19:02,619 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:19:02,619 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 02:19:02,619 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:19:02,628 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 02:19:02,636 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 02:19:02,757 WARN L181 SmtUtils]: Spent 110.00 ms on a formula simplification. DAG size of input: 24 DAG size of output: 20 [2019-01-14 02:19:02,808 INFO L216 LassoAnalysis]: Preferences: [2019-01-14 02:19:02,810 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-01-14 02:19:02,810 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-01-14 02:19:02,810 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-01-14 02:19:02,810 INFO L127 ssoRankerPreferences]: Use exernal solver: true [2019-01-14 02:19:02,810 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-14 02:19:02,810 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-01-14 02:19:02,811 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-01-14 02:19:02,811 INFO L131 ssoRankerPreferences]: Filename of dumped script: DivMinus2_true-termination_true-no-overflow.c_Iteration2_Loop [2019-01-14 02:19:02,811 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-01-14 02:19:02,812 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2019-01-14 02:19:02,835 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-14 02:19:02,864 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-14 02:19:02,872 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-14 02:19:02,877 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-14 02:19:03,170 WARN L181 SmtUtils]: Spent 158.00 ms on a formula simplification that was a NOOP. DAG size: 16 [2019-01-14 02:19:03,294 INFO L300 LassoAnalysis]: Preprocessing complete. [2019-01-14 02:19:03,295 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-14 02:19:03,303 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-14 02:19:03,303 INFO L163 nArgumentSynthesizer]: Using integer mode. [2019-01-14 02:19:03,329 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2019-01-14 02:19:03,330 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-14 02:19:03,337 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-14 02:19:03,338 INFO L163 nArgumentSynthesizer]: Using integer mode. [2019-01-14 02:19:03,360 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2019-01-14 02:19:03,360 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) Waiting until toolchain timeout for monitored process 4 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-14 02:19:03,366 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-14 02:19:03,366 INFO L163 nArgumentSynthesizer]: Using integer mode. 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-14 02:19:03,391 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2019-01-14 02:19:03,391 INFO L163 nArgumentSynthesizer]: Using integer mode. [2019-01-14 02:19:03,407 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2019-01-14 02:19:03,407 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-14 02:19:03,433 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-14 02:19:03,433 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-14 02:19:03,462 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2019-01-14 02:19:03,462 INFO L163 nArgumentSynthesizer]: Using integer mode. [2019-01-14 02:19:03,679 INFO L452 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2019-01-14 02:19:03,681 INFO L216 LassoAnalysis]: Preferences: [2019-01-14 02:19:03,681 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-01-14 02:19:03,682 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-01-14 02:19:03,682 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-01-14 02:19:03,682 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2019-01-14 02:19:03,682 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-14 02:19:03,682 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-01-14 02:19:03,682 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-01-14 02:19:03,682 INFO L131 ssoRankerPreferences]: Filename of dumped script: DivMinus2_true-termination_true-no-overflow.c_Iteration2_Loop [2019-01-14 02:19:03,682 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-01-14 02:19:03,683 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2019-01-14 02:19:03,685 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-14 02:19:03,694 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-14 02:19:03,700 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-14 02:19:03,717 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-14 02:19:03,917 INFO L300 LassoAnalysis]: Preprocessing complete. [2019-01-14 02:19:03,922 INFO L497 LassoAnalysis]: Using template 'affine'. [2019-01-14 02:19:03,924 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-14 02:19:03,925 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:19:03,926 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:19:03,926 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:19:03,926 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:19:03,930 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-14 02:19:03,931 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-14 02:19:03,938 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:19:03,939 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-14 02:19:03,939 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:19:03,940 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:19:03,940 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:19:03,940 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:19:03,943 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-14 02:19:03,943 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-14 02:19:03,953 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:19:03,953 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-14 02:19:03,954 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:19:03,954 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 02:19:03,955 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:19:03,955 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:19:03,955 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:19:03,957 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 02:19:03,957 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 02:19:03,967 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-01-14 02:19:03,980 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2019-01-14 02:19:03,980 INFO L444 ModelExtractionUtils]: 1 out of 5 variables were initially zero. Simplification set additionally 2 variables to zero. [2019-01-14 02:19:03,983 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-01-14 02:19:03,983 INFO L440 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2019-01-14 02:19:03,983 INFO L518 LassoAnalysis]: Proved termination. [2019-01-14 02:19:03,984 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-14 02:19:03,985 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2019-01-14 02:19:04,080 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 02:19:04,094 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 02:19:04,097 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 02:19:04,116 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 02:19:04,117 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 02:19:04,261 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-14 02:19:04,265 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-14 02:19:04,266 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 7 states and 9 transitions. cyclomatic complexity: 3 Second operand 4 states. [2019-01-14 02:19:04,327 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-14 02:19:04,328 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-14 02:19:04,329 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2019-01-14 02:19:04,329 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 11 transitions. [2019-01-14 02:19:04,331 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 11 transitions. Stem has 1 letters. Loop has 5 letters. [2019-01-14 02:19:04,332 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-14 02:19:04,332 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 11 transitions. Stem has 6 letters. Loop has 5 letters. [2019-01-14 02:19:04,333 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-14 02:19:04,333 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 11 transitions. Stem has 1 letters. Loop has 10 letters. [2019-01-14 02:19:04,334 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-14 02:19:04,334 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 24 states and 33 transitions. [2019-01-14 02:19:04,337 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 8 [2019-01-14 02:19:04,339 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 24 states to 18 states and 25 transitions. [2019-01-14 02:19:04,340 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 10 [2019-01-14 02:19:04,340 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 11 [2019-01-14 02:19:04,340 INFO L73 IsDeterministic]: Start isDeterministic. Operand 18 states and 25 transitions. [2019-01-14 02:19:04,340 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-01-14 02:19:04,340 INFO L706 BuchiCegarLoop]: Abstraction has 18 states and 25 transitions. [2019-01-14 02:19:04,341 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18 states and 25 transitions. [2019-01-14 02:19:04,343 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18 to 17. [2019-01-14 02:19:04,344 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2019-01-14 02:19:04,344 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 23 transitions. [2019-01-14 02:19:04,344 INFO L729 BuchiCegarLoop]: Abstraction has 17 states and 23 transitions. [2019-01-14 02:19:04,345 INFO L609 BuchiCegarLoop]: Abstraction has 17 states and 23 transitions. [2019-01-14 02:19:04,345 INFO L442 BuchiCegarLoop]: ======== Iteration 3============ [2019-01-14 02:19:04,345 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 17 states and 23 transitions. [2019-01-14 02:19:04,346 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 8 [2019-01-14 02:19:04,346 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-14 02:19:04,346 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-14 02:19:04,347 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [2, 1, 1, 1] [2019-01-14 02:19:04,347 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2019-01-14 02:19:04,347 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-14 02:19:04,347 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-14 02:19:04,347 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 02:19:04,347 INFO L82 PathProgramCache]: Analyzing trace with hash 29869542, now seen corresponding path program 1 times [2019-01-14 02:19:04,348 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 02:19:04,348 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 02:19:04,349 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:19:04,350 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 02:19:04,350 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:19:04,355 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 02:19:04,361 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 02:19:04,364 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 02:19:04,364 INFO L82 PathProgramCache]: Analyzing trace with hash 1662, now seen corresponding path program 1 times [2019-01-14 02:19:04,364 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 02:19:04,364 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 02:19:04,365 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:19:04,366 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 02:19:04,366 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:19:04,368 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 02:19:04,371 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 02:19:04,372 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 02:19:04,373 INFO L82 PathProgramCache]: Analyzing trace with hash -1360140509, now seen corresponding path program 2 times [2019-01-14 02:19:04,373 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 02:19:04,373 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 02:19:04,374 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:19:04,375 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 02:19:04,375 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:19:04,382 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 02:19:04,390 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 02:19:04,536 WARN L181 SmtUtils]: Spent 107.00 ms on a formula simplification that was a NOOP. DAG size: 14 [2019-01-14 02:19:04,550 INFO L216 LassoAnalysis]: Preferences: [2019-01-14 02:19:04,550 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-01-14 02:19:04,550 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-01-14 02:19:04,550 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-01-14 02:19:04,550 INFO L127 ssoRankerPreferences]: Use exernal solver: true [2019-01-14 02:19:04,551 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-14 02:19:04,551 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-01-14 02:19:04,551 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-01-14 02:19:04,551 INFO L131 ssoRankerPreferences]: Filename of dumped script: DivMinus2_true-termination_true-no-overflow.c_Iteration3_Loop [2019-01-14 02:19:04,551 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-01-14 02:19:04,551 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2019-01-14 02:19:04,553 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-14 02:19:04,591 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-14 02:19:04,632 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-14 02:19:04,742 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-14 02:19:05,008 INFO L300 LassoAnalysis]: Preprocessing complete. [2019-01-14 02:19:05,008 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) [2019-01-14 02:19:05,019 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-14 02:19:05,020 INFO L163 nArgumentSynthesizer]: Using integer mode. Waiting until toolchain timeout for monitored process 8 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-14 02:19:05,069 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2019-01-14 02:19:05,069 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) [2019-01-14 02:19:05,079 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-14 02:19:05,079 INFO L163 nArgumentSynthesizer]: Using integer mode. Waiting until toolchain timeout for monitored process 9 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-14 02:19:05,103 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2019-01-14 02:19:05,103 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-14 02:19:05,110 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-14 02:19:05,111 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-14 02:19:05,141 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2019-01-14 02:19:05,142 INFO L163 nArgumentSynthesizer]: Using integer mode. [2019-01-14 02:19:05,199 INFO L452 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2019-01-14 02:19:05,201 INFO L216 LassoAnalysis]: Preferences: [2019-01-14 02:19:05,201 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-01-14 02:19:05,201 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-01-14 02:19:05,202 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-01-14 02:19:05,202 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2019-01-14 02:19:05,202 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-14 02:19:05,202 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-01-14 02:19:05,202 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-01-14 02:19:05,202 INFO L131 ssoRankerPreferences]: Filename of dumped script: DivMinus2_true-termination_true-no-overflow.c_Iteration3_Loop [2019-01-14 02:19:05,202 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-01-14 02:19:05,203 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2019-01-14 02:19:05,205 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-14 02:19:05,220 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-14 02:19:05,249 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-14 02:19:05,255 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-14 02:19:05,383 INFO L300 LassoAnalysis]: Preprocessing complete. [2019-01-14 02:19:05,383 INFO L497 LassoAnalysis]: Using template 'affine'. [2019-01-14 02:19:05,384 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-14 02:19:05,385 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:19:05,385 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:19:05,385 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:19:05,386 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:19:05,388 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-14 02:19:05,388 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-14 02:19:05,392 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:19:05,393 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-14 02:19:05,394 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:19:05,394 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 02:19:05,394 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:19:05,394 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:19:05,394 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:19:05,395 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 02:19:05,395 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 02:19:05,400 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-01-14 02:19:05,404 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2019-01-14 02:19:05,404 INFO L444 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 1 variables to zero. [2019-01-14 02:19:05,405 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-01-14 02:19:05,405 INFO L440 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2019-01-14 02:19:05,405 INFO L518 LassoAnalysis]: Proved termination. [2019-01-14 02:19:05,405 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-14 02:19:05,406 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2019-01-14 02:19:05,441 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 02:19:05,453 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 02:19:05,455 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 02:19:05,460 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 02:19:05,461 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 02:19:05,484 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-14 02:19:05,485 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-14 02:19:05,485 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 17 states and 23 transitions. cyclomatic complexity: 9 Second operand 3 states. [2019-01-14 02:19:05,525 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-14 02:19:05,527 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-14 02:19:05,527 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2019-01-14 02:19:05,528 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 8 transitions. [2019-01-14 02:19:05,528 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 8 transitions. Stem has 5 letters. Loop has 2 letters. [2019-01-14 02:19:05,528 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-14 02:19:05,528 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 8 transitions. Stem has 7 letters. Loop has 2 letters. [2019-01-14 02:19:05,530 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-14 02:19:05,530 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 8 transitions. Stem has 5 letters. Loop has 4 letters. [2019-01-14 02:19:05,530 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-14 02:19:05,531 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 32 states and 45 transitions. [2019-01-14 02:19:05,534 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 8 [2019-01-14 02:19:05,536 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 32 states to 29 states and 40 transitions. [2019-01-14 02:19:05,536 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 12 [2019-01-14 02:19:05,537 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 13 [2019-01-14 02:19:05,537 INFO L73 IsDeterministic]: Start isDeterministic. Operand 29 states and 40 transitions. [2019-01-14 02:19:05,537 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-01-14 02:19:05,537 INFO L706 BuchiCegarLoop]: Abstraction has 29 states and 40 transitions. [2019-01-14 02:19:05,537 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states and 40 transitions. [2019-01-14 02:19:05,540 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 24. [2019-01-14 02:19:05,541 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2019-01-14 02:19:05,542 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 34 transitions. [2019-01-14 02:19:05,542 INFO L729 BuchiCegarLoop]: Abstraction has 24 states and 34 transitions. [2019-01-14 02:19:05,542 INFO L609 BuchiCegarLoop]: Abstraction has 24 states and 34 transitions. [2019-01-14 02:19:05,542 INFO L442 BuchiCegarLoop]: ======== Iteration 4============ [2019-01-14 02:19:05,542 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 24 states and 34 transitions. [2019-01-14 02:19:05,545 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 8 [2019-01-14 02:19:05,546 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-14 02:19:05,546 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-14 02:19:05,546 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [2, 1, 1, 1, 1] [2019-01-14 02:19:05,547 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2019-01-14 02:19:05,547 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-14 02:19:05,547 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-14 02:19:05,547 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 02:19:05,547 INFO L82 PathProgramCache]: Analyzing trace with hash 925955826, now seen corresponding path program 1 times [2019-01-14 02:19:05,548 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 02:19:05,550 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 02:19:05,552 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:19:05,552 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-14 02:19:05,553 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:19:05,558 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 02:19:05,661 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-14 02:19:05,662 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-14 02:19:05,662 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-01-14 02:19:05,663 INFO L799 eck$LassoCheckResult]: stem already infeasible [2019-01-14 02:19:05,663 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 02:19:05,663 INFO L82 PathProgramCache]: Analyzing trace with hash 1572, now seen corresponding path program 2 times [2019-01-14 02:19:05,664 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 02:19:05,664 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 02:19:05,667 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:19:05,667 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 02:19:05,668 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:19:05,676 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 02:19:05,682 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 02:19:05,747 INFO L216 LassoAnalysis]: Preferences: [2019-01-14 02:19:05,748 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-01-14 02:19:05,748 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-01-14 02:19:05,748 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-01-14 02:19:05,748 INFO L127 ssoRankerPreferences]: Use exernal solver: true [2019-01-14 02:19:05,748 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-14 02:19:05,748 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-01-14 02:19:05,749 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-01-14 02:19:05,749 INFO L131 ssoRankerPreferences]: Filename of dumped script: DivMinus2_true-termination_true-no-overflow.c_Iteration4_Loop [2019-01-14 02:19:05,749 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-01-14 02:19:05,749 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2019-01-14 02:19:05,750 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-14 02:19:05,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-14 02:19:05,776 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-14 02:19:05,784 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-14 02:19:05,875 INFO L300 LassoAnalysis]: Preprocessing complete. [2019-01-14 02:19:05,876 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-14 02:19:05,881 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-14 02:19:05,881 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-14 02:19:05,907 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2019-01-14 02:19:05,907 INFO L163 nArgumentSynthesizer]: Using integer mode. [2019-01-14 02:19:05,930 INFO L452 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2019-01-14 02:19:05,932 INFO L216 LassoAnalysis]: Preferences: [2019-01-14 02:19:05,932 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-01-14 02:19:05,932 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-01-14 02:19:05,933 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-01-14 02:19:05,933 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2019-01-14 02:19:05,933 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-14 02:19:05,933 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-01-14 02:19:05,933 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-01-14 02:19:05,933 INFO L131 ssoRankerPreferences]: Filename of dumped script: DivMinus2_true-termination_true-no-overflow.c_Iteration4_Loop [2019-01-14 02:19:05,933 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-01-14 02:19:05,933 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2019-01-14 02:19:05,935 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-14 02:19:05,944 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-14 02:19:05,948 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-14 02:19:05,966 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-14 02:19:06,089 INFO L300 LassoAnalysis]: Preprocessing complete. [2019-01-14 02:19:06,089 INFO L497 LassoAnalysis]: Using template 'affine'. [2019-01-14 02:19:06,090 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-14 02:19:06,090 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:19:06,091 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 02:19:06,091 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:19:06,091 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:19:06,091 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:19:06,092 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 02:19:06,092 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 02:19:06,096 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-01-14 02:19:06,099 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2019-01-14 02:19:06,099 INFO L444 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 1 variables to zero. [2019-01-14 02:19:06,099 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-01-14 02:19:06,099 INFO L440 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2019-01-14 02:19:06,100 INFO L518 LassoAnalysis]: Proved termination. [2019-01-14 02:19:06,100 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-14 02:19:06,100 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2019-01-14 02:19:06,153 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 02:19:06,166 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 02:19:06,167 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 02:19:06,190 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 02:19:06,192 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 02:19:06,193 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-14 02:19:06,193 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-14 02:19:06,193 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 24 states and 34 transitions. cyclomatic complexity: 14 Second operand 3 states. [2019-01-14 02:19:06,227 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-14 02:19:06,229 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-14 02:19:06,229 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2019-01-14 02:19:06,230 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 11 transitions. [2019-01-14 02:19:06,230 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 11 transitions. Stem has 6 letters. Loop has 2 letters. [2019-01-14 02:19:06,230 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-14 02:19:06,230 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 11 transitions. Stem has 8 letters. Loop has 2 letters. [2019-01-14 02:19:06,231 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-14 02:19:06,231 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 11 transitions. Stem has 6 letters. Loop has 4 letters. [2019-01-14 02:19:06,231 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-14 02:19:06,232 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 32 states and 47 transitions. [2019-01-14 02:19:06,233 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 8 [2019-01-14 02:19:06,235 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 32 states to 30 states and 44 transitions. [2019-01-14 02:19:06,235 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 14 [2019-01-14 02:19:06,235 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 16 [2019-01-14 02:19:06,236 INFO L73 IsDeterministic]: Start isDeterministic. Operand 30 states and 44 transitions. [2019-01-14 02:19:06,236 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-01-14 02:19:06,236 INFO L706 BuchiCegarLoop]: Abstraction has 30 states and 44 transitions. [2019-01-14 02:19:06,236 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states and 44 transitions. [2019-01-14 02:19:06,240 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 28. [2019-01-14 02:19:06,240 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28 states. [2019-01-14 02:19:06,241 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 42 transitions. [2019-01-14 02:19:06,242 INFO L729 BuchiCegarLoop]: Abstraction has 28 states and 42 transitions. [2019-01-14 02:19:06,242 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-01-14 02:19:06,242 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-01-14 02:19:06,242 INFO L87 Difference]: Start difference. First operand 28 states and 42 transitions. Second operand 4 states. [2019-01-14 02:19:06,263 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 02:19:06,263 INFO L93 Difference]: Finished difference Result 18 states and 24 transitions. [2019-01-14 02:19:06,265 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-01-14 02:19:06,265 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 18 states and 24 transitions. [2019-01-14 02:19:06,267 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2019-01-14 02:19:06,268 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 18 states to 14 states and 18 transitions. [2019-01-14 02:19:06,268 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 4 [2019-01-14 02:19:06,268 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 4 [2019-01-14 02:19:06,268 INFO L73 IsDeterministic]: Start isDeterministic. Operand 14 states and 18 transitions. [2019-01-14 02:19:06,268 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-01-14 02:19:06,269 INFO L706 BuchiCegarLoop]: Abstraction has 14 states and 18 transitions. [2019-01-14 02:19:06,269 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14 states and 18 transitions. [2019-01-14 02:19:06,270 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14 to 12. [2019-01-14 02:19:06,270 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2019-01-14 02:19:06,270 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 15 transitions. [2019-01-14 02:19:06,270 INFO L729 BuchiCegarLoop]: Abstraction has 12 states and 15 transitions. [2019-01-14 02:19:06,271 INFO L609 BuchiCegarLoop]: Abstraction has 12 states and 15 transitions. [2019-01-14 02:19:06,271 INFO L442 BuchiCegarLoop]: ======== Iteration 5============ [2019-01-14 02:19:06,271 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 12 states and 15 transitions. [2019-01-14 02:19:06,271 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2019-01-14 02:19:06,272 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-14 02:19:06,272 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-14 02:19:06,272 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [3, 2, 2, 1, 1, 1] [2019-01-14 02:19:06,272 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2019-01-14 02:19:06,273 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-14 02:19:06,273 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-14 02:19:06,273 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 02:19:06,273 INFO L82 PathProgramCache]: Analyzing trace with hash -1275475969, now seen corresponding path program 2 times [2019-01-14 02:19:06,273 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 02:19:06,273 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 02:19:06,275 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:19:06,275 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-14 02:19:06,275 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:19:06,285 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 02:19:06,408 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-14 02:19:06,409 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-14 02:19:06,409 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-14 02:19:06,421 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2019-01-14 02:19:06,431 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-01-14 02:19:06,431 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-14 02:19:06,433 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 02:19:06,487 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-14 02:19:06,509 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-14 02:19:06,509 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 9 [2019-01-14 02:19:06,510 INFO L799 eck$LassoCheckResult]: stem already infeasible [2019-01-14 02:19:06,510 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 02:19:06,510 INFO L82 PathProgramCache]: Analyzing trace with hash 1662, now seen corresponding path program 3 times [2019-01-14 02:19:06,510 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 02:19:06,510 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 02:19:06,512 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:19:06,512 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-14 02:19:06,512 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:19:06,514 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 02:19:06,516 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 02:19:06,559 INFO L216 LassoAnalysis]: Preferences: [2019-01-14 02:19:06,559 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-01-14 02:19:06,559 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-01-14 02:19:06,559 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-01-14 02:19:06,559 INFO L127 ssoRankerPreferences]: Use exernal solver: true [2019-01-14 02:19:06,559 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-14 02:19:06,559 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-01-14 02:19:06,560 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-01-14 02:19:06,560 INFO L131 ssoRankerPreferences]: Filename of dumped script: DivMinus2_true-termination_true-no-overflow.c_Iteration5_Loop [2019-01-14 02:19:06,560 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-01-14 02:19:06,560 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2019-01-14 02:19:06,561 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-14 02:19:06,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-14 02:19:06,573 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-14 02:19:06,576 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-14 02:19:06,664 INFO L300 LassoAnalysis]: Preprocessing complete. [2019-01-14 02:19:06,664 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-14 02:19:06,671 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-14 02:19:06,671 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-14 02:19:06,699 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2019-01-14 02:19:06,699 INFO L163 nArgumentSynthesizer]: Using integer mode. [2019-01-14 02:19:06,711 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2019-01-14 02:19:06,712 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-14 02:19:06,736 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-14 02:19:06,736 INFO L163 nArgumentSynthesizer]: Using integer mode. [2019-01-14 02:19:06,759 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2019-01-14 02:19:06,759 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-14 02:19:06,764 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-14 02:19:06,764 INFO L163 nArgumentSynthesizer]: Using integer mode. [2019-01-14 02:19:06,787 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2019-01-14 02:19:06,787 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-14 02:19:06,791 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-14 02:19:06,791 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-14 02:19:06,820 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2019-01-14 02:19:06,821 INFO L163 nArgumentSynthesizer]: Using integer mode. [2019-01-14 02:19:06,875 INFO L452 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2019-01-14 02:19:06,877 INFO L216 LassoAnalysis]: Preferences: [2019-01-14 02:19:06,877 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-01-14 02:19:06,878 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-01-14 02:19:06,878 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-01-14 02:19:06,878 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2019-01-14 02:19:06,878 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-14 02:19:06,878 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-01-14 02:19:06,878 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-01-14 02:19:06,878 INFO L131 ssoRankerPreferences]: Filename of dumped script: DivMinus2_true-termination_true-no-overflow.c_Iteration5_Loop [2019-01-14 02:19:06,879 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-01-14 02:19:06,879 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2019-01-14 02:19:06,882 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-14 02:19:06,889 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-14 02:19:06,895 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-14 02:19:06,898 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-14 02:19:07,035 INFO L300 LassoAnalysis]: Preprocessing complete. [2019-01-14 02:19:07,037 INFO L497 LassoAnalysis]: Using template 'affine'. [2019-01-14 02:19:07,038 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-14 02:19:07,039 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:19:07,039 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 02:19:07,039 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:19:07,040 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:19:07,040 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:19:07,043 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 02:19:07,043 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 02:19:07,047 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:19:07,048 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-14 02:19:07,048 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:19:07,048 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:19:07,049 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:19:07,049 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:19:07,053 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-14 02:19:07,053 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-14 02:19:07,058 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:19:07,059 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-14 02:19:07,059 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:19:07,059 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:19:07,059 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:19:07,060 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:19:07,064 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-14 02:19:07,064 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-14 02:19:07,068 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:19:07,068 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-14 02:19:07,069 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:19:07,069 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 02:19:07,069 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:19:07,069 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:19:07,069 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:19:07,073 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 02:19:07,073 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 02:19:07,077 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-01-14 02:19:07,080 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2019-01-14 02:19:07,080 INFO L444 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 1 variables to zero. [2019-01-14 02:19:07,081 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-01-14 02:19:07,081 INFO L440 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2019-01-14 02:19:07,081 INFO L518 LassoAnalysis]: Proved termination. [2019-01-14 02:19:07,081 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-14 02:19:07,082 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2019-01-14 02:19:07,119 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 02:19:07,131 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 02:19:07,132 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 02:19:07,138 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 02:19:07,139 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 02:19:07,158 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-14 02:19:07,158 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-14 02:19:07,158 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 12 states and 15 transitions. cyclomatic complexity: 5 Second operand 3 states. [2019-01-14 02:19:07,175 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-14 02:19:07,177 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-14 02:19:07,177 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2019-01-14 02:19:07,178 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 8 transitions. [2019-01-14 02:19:07,178 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 8 transitions. Stem has 10 letters. Loop has 2 letters. [2019-01-14 02:19:07,178 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-14 02:19:07,178 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2019-01-14 02:19:07,198 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 02:19:07,207 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 02:19:07,209 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 02:19:07,219 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 02:19:07,220 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 02:19:07,232 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-14 02:19:07,233 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-14 02:19:07,233 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 12 states and 15 transitions. cyclomatic complexity: 5 Second operand 3 states. [2019-01-14 02:19:07,282 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-14 02:19:07,285 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-14 02:19:07,286 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2019-01-14 02:19:07,286 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 7 transitions. [2019-01-14 02:19:07,286 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 7 transitions. Stem has 10 letters. Loop has 2 letters. [2019-01-14 02:19:07,286 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-14 02:19:07,287 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2019-01-14 02:19:07,298 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 02:19:07,318 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 02:19:07,320 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 02:19:07,323 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 02:19:07,325 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 02:19:07,345 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-14 02:19:07,345 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-14 02:19:07,346 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 12 states and 15 transitions. cyclomatic complexity: 5 Second operand 3 states. [2019-01-14 02:19:07,402 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-14 02:19:07,406 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-14 02:19:07,406 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2019-01-14 02:19:07,407 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 12 transitions. [2019-01-14 02:19:07,407 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 12 transitions. Stem has 10 letters. Loop has 2 letters. [2019-01-14 02:19:07,407 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-14 02:19:07,407 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 12 transitions. Stem has 12 letters. Loop has 2 letters. [2019-01-14 02:19:07,408 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-14 02:19:07,408 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 12 transitions. Stem has 10 letters. Loop has 4 letters. [2019-01-14 02:19:07,408 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-14 02:19:07,409 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 19 states and 24 transitions. [2019-01-14 02:19:07,409 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2019-01-14 02:19:07,410 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 19 states to 0 states and 0 transitions. [2019-01-14 02:19:07,410 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2019-01-14 02:19:07,410 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2019-01-14 02:19:07,410 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2019-01-14 02:19:07,410 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-01-14 02:19:07,410 INFO L706 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-01-14 02:19:07,410 INFO L729 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-01-14 02:19:07,411 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-01-14 02:19:07,411 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2019-01-14 02:19:07,411 INFO L87 Difference]: Start difference. First operand 0 states and 0 transitions. Second operand 10 states. [2019-01-14 02:19:07,411 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 02:19:07,411 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2019-01-14 02:19:07,411 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2019-01-14 02:19:07,412 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 0 states and 0 transitions. [2019-01-14 02:19:07,412 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2019-01-14 02:19:07,412 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 0 states to 0 states and 0 transitions. [2019-01-14 02:19:07,412 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2019-01-14 02:19:07,412 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2019-01-14 02:19:07,412 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2019-01-14 02:19:07,412 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-01-14 02:19:07,412 INFO L706 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-01-14 02:19:07,413 INFO L729 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-01-14 02:19:07,413 INFO L609 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-01-14 02:19:07,413 INFO L442 BuchiCegarLoop]: ======== Iteration 6============ [2019-01-14 02:19:07,413 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2019-01-14 02:19:07,413 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2019-01-14 02:19:07,413 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2019-01-14 02:19:07,421 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 14.01 02:19:07 BoogieIcfgContainer [2019-01-14 02:19:07,421 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2019-01-14 02:19:07,422 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-01-14 02:19:07,422 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-01-14 02:19:07,422 INFO L276 PluginConnector]: Witness Printer initialized [2019-01-14 02:19:07,423 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.01 02:19:02" (3/4) ... [2019-01-14 02:19:07,427 INFO L147 WitnessPrinter]: No result that supports witness generation found [2019-01-14 02:19:07,427 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-01-14 02:19:07,428 INFO L168 Benchmark]: Toolchain (without parser) took 6180.06 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 206.6 MB). Free memory was 947.3 MB in the beginning and 1.2 GB in the end (delta: -217.0 MB). There was no memory consumed. Max. memory is 11.5 GB. [2019-01-14 02:19:07,429 INFO L168 Benchmark]: CDTParser took 0.20 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-14 02:19:07,430 INFO L168 Benchmark]: CACSL2BoogieTranslator took 366.82 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-14 02:19:07,430 INFO L168 Benchmark]: Boogie Procedure Inliner took 48.57 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-14 02:19:07,431 INFO L168 Benchmark]: Boogie Preprocessor took 27.93 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-14 02:19:07,431 INFO L168 Benchmark]: RCFGBuilder took 344.08 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 133.7 MB). Free memory was 936.6 MB in the beginning and 1.1 GB in the end (delta: -167.9 MB). Peak memory consumption was 18.4 MB. Max. memory is 11.5 GB. [2019-01-14 02:19:07,432 INFO L168 Benchmark]: BuchiAutomizer took 5380.64 ms. Allocated memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 72.9 MB). Free memory was 1.1 GB in the beginning and 1.2 GB in the end (delta: -59.8 MB). Peak memory consumption was 13.1 MB. Max. memory is 11.5 GB. [2019-01-14 02:19:07,433 INFO L168 Benchmark]: Witness Printer took 5.73 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-14 02:19:07,438 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.20 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 366.82 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 48.57 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 27.93 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 344.08 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 133.7 MB). Free memory was 936.6 MB in the beginning and 1.1 GB in the end (delta: -167.9 MB). Peak memory consumption was 18.4 MB. Max. memory is 11.5 GB. * BuchiAutomizer took 5380.64 ms. Allocated memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 72.9 MB). Free memory was 1.1 GB in the beginning and 1.2 GB in the end (delta: -59.8 MB). Peak memory consumption was 13.1 MB. Max. memory is 11.5 GB. * Witness Printer took 5.73 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.3s and 6 iterations. TraceHistogramMax:3. Analysis of lassos took 4.1s. Construction of modules took 0.2s. Büchi inclusion checks took 0.7s. 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: 15ms VariablesStem: 1 VariablesLoop: 0 DisjunctsStem: 1 DisjunctsLoop: 1 SupportingInvariants: 2 MotzkinApplications: 6 LassoTerminationAnalysisBenchmarks: LassoNonterminationAnalysisSatFixpoint: 6 LassoNonterminationAnalysisSatUnbounded: 2 LassoNonterminationAnalysisUnsat: 4 LassoNonterminationAnalysisUnknown: 0 LassoNonterminationAnalysisTime: 0.7s - TerminationAnalysisResult: Termination proven Buchi Automizer proved that your program is terminating RESULT: Ultimate proved your program to be correct! Received shutdown request...