./Ultimate.py --spec /storage/repos/svcomp/c/properties/termination.prp --file /storage/repos/svcomp/c/termination-restricted-15/MinusUserDefined_true-termination_true-no-overflow.c --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for termination Using default analysis Version 2e94e6aa Calling Ultimate with: java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx12G -Xms1G -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerTermination.xml -i /storage/repos/svcomp/c/termination-restricted-15/MinusUserDefined_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 2e63fdedc7f36bfa4d0d39679a5a7ea76cc5ddf1 .............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................. Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.24-2e94e6a [2019-01-01 21:37:06,233 INFO L170 SettingsManager]: Resetting all preferences to default values... [2019-01-01 21:37:06,236 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2019-01-01 21:37:06,254 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-01-01 21:37:06,255 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-01-01 21:37:06,257 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-01-01 21:37:06,258 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-01-01 21:37:06,261 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2019-01-01 21:37:06,265 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-01-01 21:37:06,266 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-01-01 21:37:06,268 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-01-01 21:37:06,269 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-01-01 21:37:06,270 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-01-01 21:37:06,271 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-01-01 21:37:06,272 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-01-01 21:37:06,275 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-01-01 21:37:06,276 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-01-01 21:37:06,280 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-01-01 21:37:06,289 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2019-01-01 21:37:06,296 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-01-01 21:37:06,297 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-01-01 21:37:06,300 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-01-01 21:37:06,302 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-01-01 21:37:06,302 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-01-01 21:37:06,306 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-01-01 21:37:06,307 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-01-01 21:37:06,309 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-01-01 21:37:06,309 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-01-01 21:37:06,313 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2019-01-01 21:37:06,315 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-01-01 21:37:06,317 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2019-01-01 21:37:06,318 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-01-01 21:37:06,318 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-01-01 21:37:06,318 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2019-01-01 21:37:06,321 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2019-01-01 21:37:06,322 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2019-01-01 21:37:06,324 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-64bit-Automizer_Default.epf [2019-01-01 21:37:06,345 INFO L110 SettingsManager]: Loading preferences was successful [2019-01-01 21:37:06,346 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2019-01-01 21:37:06,347 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-01-01 21:37:06,347 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2019-01-01 21:37:06,347 INFO L133 SettingsManager]: * Use SBE=true [2019-01-01 21:37:06,347 INFO L131 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2019-01-01 21:37:06,348 INFO L133 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2019-01-01 21:37:06,348 INFO L133 SettingsManager]: * Use old map elimination=false [2019-01-01 21:37:06,348 INFO L133 SettingsManager]: * Use external solver (rank synthesis)=false [2019-01-01 21:37:06,348 INFO L133 SettingsManager]: * Use only trivial implications for array writes=true [2019-01-01 21:37:06,348 INFO L133 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2019-01-01 21:37:06,348 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-01-01 21:37:06,349 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2019-01-01 21:37:06,349 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2019-01-01 21:37:06,349 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2019-01-01 21:37:06,349 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2019-01-01 21:37:06,349 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2019-01-01 21:37:06,349 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2019-01-01 21:37:06,350 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2019-01-01 21:37:06,350 INFO L133 SettingsManager]: * Assume nondeterminstic values are in range=false [2019-01-01 21:37:06,350 INFO L133 SettingsManager]: * Use constant arrays=true [2019-01-01 21:37:06,350 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2019-01-01 21:37:06,350 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-01-01 21:37:06,350 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-01-01 21:37:06,351 INFO L133 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2019-01-01 21:37:06,351 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-01-01 21:37:06,351 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2019-01-01 21:37:06,351 INFO L133 SettingsManager]: * Dump automata to the following directory=/home/matthias/ultimate/dump/auto [2019-01-01 21:37:06,352 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2019-01-01 21:37:06,352 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 -> 2e63fdedc7f36bfa4d0d39679a5a7ea76cc5ddf1 [2019-01-01 21:37:06,386 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-01-01 21:37:06,399 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-01-01 21:37:06,405 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-01-01 21:37:06,407 INFO L271 PluginConnector]: Initializing CDTParser... [2019-01-01 21:37:06,407 INFO L276 PluginConnector]: CDTParser initialized [2019-01-01 21:37:06,408 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/svcomp/c/termination-restricted-15/MinusUserDefined_true-termination_true-no-overflow.c [2019-01-01 21:37:06,476 INFO L221 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/077b73ee6/582887d5f914403d9fbd01fe6b07725e/FLAG9d8d685e8 [2019-01-01 21:37:06,986 INFO L307 CDTParser]: Found 1 translation units. [2019-01-01 21:37:06,987 INFO L161 CDTParser]: Scanning /storage/repos/svcomp/c/termination-restricted-15/MinusUserDefined_true-termination_true-no-overflow.c [2019-01-01 21:37:06,993 INFO L355 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/077b73ee6/582887d5f914403d9fbd01fe6b07725e/FLAG9d8d685e8 [2019-01-01 21:37:07,342 INFO L363 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/077b73ee6/582887d5f914403d9fbd01fe6b07725e [2019-01-01 21:37:07,346 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-01-01 21:37:07,348 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-01-01 21:37:07,349 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-01-01 21:37:07,349 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-01-01 21:37:07,353 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2019-01-01 21:37:07,354 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 01.01 09:37:07" (1/1) ... [2019-01-01 21:37:07,357 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6bc52f90 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 09:37:07, skipping insertion in model container [2019-01-01 21:37:07,357 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 01.01 09:37:07" (1/1) ... [2019-01-01 21:37:07,365 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-01-01 21:37:07,382 INFO L176 MainTranslator]: Built tables and reachable declarations [2019-01-01 21:37:07,554 INFO L204 PostProcessor]: Analyzing one entry point: main [2019-01-01 21:37:07,559 INFO L191 MainTranslator]: Completed pre-run [2019-01-01 21:37:07,583 INFO L204 PostProcessor]: Analyzing one entry point: main [2019-01-01 21:37:07,599 INFO L195 MainTranslator]: Completed translation [2019-01-01 21:37:07,600 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 09:37:07 WrapperNode [2019-01-01 21:37:07,600 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-01-01 21:37:07,601 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-01-01 21:37:07,601 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-01-01 21:37:07,601 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2019-01-01 21:37:07,611 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 09:37:07" (1/1) ... [2019-01-01 21:37:07,616 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 09:37:07" (1/1) ... [2019-01-01 21:37:07,641 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-01-01 21:37:07,642 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-01-01 21:37:07,642 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-01-01 21:37:07,642 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2019-01-01 21:37:07,653 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 09:37:07" (1/1) ... [2019-01-01 21:37:07,653 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 09:37:07" (1/1) ... [2019-01-01 21:37:07,654 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 09:37:07" (1/1) ... [2019-01-01 21:37:07,654 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 09:37:07" (1/1) ... [2019-01-01 21:37:07,656 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 09:37:07" (1/1) ... [2019-01-01 21:37:07,663 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 09:37:07" (1/1) ... [2019-01-01 21:37:07,665 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 09:37:07" (1/1) ... [2019-01-01 21:37:07,666 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-01-01 21:37:07,667 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-01-01 21:37:07,667 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-01-01 21:37:07,667 INFO L276 PluginConnector]: RCFGBuilder initialized [2019-01-01 21:37:07,668 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 09:37:07" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-01 21:37:07,789 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-01-01 21:37:07,790 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-01-01 21:37:07,973 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-01-01 21:37:07,974 INFO L280 CfgBuilder]: Removed 7 assue(true) statements. [2019-01-01 21:37:07,974 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 01.01 09:37:07 BoogieIcfgContainer [2019-01-01 21:37:07,974 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-01-01 21:37:07,975 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2019-01-01 21:37:07,975 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2019-01-01 21:37:07,980 INFO L276 PluginConnector]: BuchiAutomizer initialized [2019-01-01 21:37:07,981 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-01-01 21:37:07,981 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 01.01 09:37:07" (1/3) ... [2019-01-01 21:37:07,983 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@7e96f43d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 01.01 09:37:07, skipping insertion in model container [2019-01-01 21:37:07,983 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-01-01 21:37:07,983 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 09:37:07" (2/3) ... [2019-01-01 21:37:07,984 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@7e96f43d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 01.01 09:37:07, skipping insertion in model container [2019-01-01 21:37:07,984 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-01-01 21:37:07,984 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 01.01 09:37:07" (3/3) ... [2019-01-01 21:37:07,987 INFO L375 chiAutomizerObserver]: Analyzing ICFG MinusUserDefined_true-termination_true-no-overflow.c [2019-01-01 21:37:08,053 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2019-01-01 21:37:08,055 INFO L374 BuchiCegarLoop]: Interprodecural is true [2019-01-01 21:37:08,058 INFO L375 BuchiCegarLoop]: Hoare is false [2019-01-01 21:37:08,058 INFO L376 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2019-01-01 21:37:08,058 INFO L377 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2019-01-01 21:37:08,058 INFO L378 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-01-01 21:37:08,058 INFO L379 BuchiCegarLoop]: Difference is false [2019-01-01 21:37:08,058 INFO L380 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-01-01 21:37:08,058 INFO L383 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2019-01-01 21:37:08,092 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 8 states. [2019-01-01 21:37:08,122 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 3 [2019-01-01 21:37:08,123 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-01 21:37:08,123 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-01 21:37:08,133 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1] [2019-01-01 21:37:08,134 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1] [2019-01-01 21:37:08,134 INFO L442 BuchiCegarLoop]: ======== Iteration 1============ [2019-01-01 21:37:08,134 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 8 states. [2019-01-01 21:37:08,135 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 3 [2019-01-01 21:37:08,135 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-01 21:37:08,136 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-01 21:37:08,136 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1] [2019-01-01 21:37:08,136 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1] [2019-01-01 21:37:08,146 INFO L794 eck$LassoCheckResult]: Stem: 3#ULTIMATE.startENTRYtrue havoc main_#res;havoc main_#t~nondet0, main_#t~nondet1, main_~x~0, main_~y~0, main_~res~0;havoc main_~x~0;havoc main_~y~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; 4#L13-2true [2019-01-01 21:37:08,146 INFO L796 eck$LassoCheckResult]: Loop: 4#L13-2true assume !!(main_~x~0 > 0 && main_~y~0 > 0);main_~x~0 := main_~x~0 - 1;main_~y~0 := main_~y~0 - 1; 4#L13-2true [2019-01-01 21:37:08,153 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 21:37:08,154 INFO L82 PathProgramCache]: Analyzing trace with hash 32, now seen corresponding path program 1 times [2019-01-01 21:37:08,156 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 21:37:08,157 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 21:37:08,250 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:37:08,250 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 21:37:08,250 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:37:08,271 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 21:37:08,275 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 21:37:08,293 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 21:37:08,293 INFO L82 PathProgramCache]: Analyzing trace with hash 41, now seen corresponding path program 1 times [2019-01-01 21:37:08,293 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 21:37:08,293 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 21:37:08,295 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:37:08,295 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 21:37:08,295 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:37:08,301 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 21:37:08,305 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 21:37:08,307 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 21:37:08,308 INFO L82 PathProgramCache]: Analyzing trace with hash 1002, now seen corresponding path program 1 times [2019-01-01 21:37:08,308 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 21:37:08,308 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 21:37:08,310 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:37:08,310 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 21:37:08,310 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:37:08,315 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 21:37:08,321 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 21:37:08,434 INFO L216 LassoAnalysis]: Preferences: [2019-01-01 21:37:08,435 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-01-01 21:37:08,435 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-01-01 21:37:08,435 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-01-01 21:37:08,436 INFO L127 ssoRankerPreferences]: Use exernal solver: true [2019-01-01 21:37:08,436 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-01 21:37:08,436 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-01-01 21:37:08,436 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-01-01 21:37:08,436 INFO L131 ssoRankerPreferences]: Filename of dumped script: MinusUserDefined_true-termination_true-no-overflow.c_Iteration1_Loop [2019-01-01 21:37:08,438 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-01-01 21:37:08,438 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2019-01-01 21:37:08,470 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:37:08,579 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:37:08,630 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:37:08,680 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:37:09,016 INFO L300 LassoAnalysis]: Preprocessing complete. [2019-01-01 21:37:09,017 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) [2019-01-01 21:37:09,030 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-01 21:37:09,031 INFO L163 nArgumentSynthesizer]: Using integer mode. Waiting until toolchain timeout for monitored process 2 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-01 21:37:09,068 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2019-01-01 21:37:09,069 INFO L163 nArgumentSynthesizer]: Using integer mode. [2019-01-01 21:37:09,096 INFO L452 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2019-01-01 21:37:09,098 INFO L216 LassoAnalysis]: Preferences: [2019-01-01 21:37:09,098 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-01-01 21:37:09,098 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-01-01 21:37:09,098 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-01-01 21:37:09,098 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2019-01-01 21:37:09,098 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-01 21:37:09,098 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-01-01 21:37:09,098 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-01-01 21:37:09,099 INFO L131 ssoRankerPreferences]: Filename of dumped script: MinusUserDefined_true-termination_true-no-overflow.c_Iteration1_Loop [2019-01-01 21:37:09,099 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-01-01 21:37:09,099 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2019-01-01 21:37:09,101 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:37:09,193 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:37:09,239 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:37:09,275 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:37:09,445 INFO L300 LassoAnalysis]: Preprocessing complete. [2019-01-01 21:37:09,450 INFO L497 LassoAnalysis]: Using template 'affine'. [2019-01-01 21:37:09,452 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 21:37:09,455 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:37:09,455 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 21:37:09,456 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:37:09,456 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:37:09,456 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:37:09,458 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 21:37:09,459 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 21:37:09,467 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-01-01 21:37:09,473 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2019-01-01 21:37:09,474 INFO L444 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 1 variables to zero. [2019-01-01 21:37:09,476 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-01-01 21:37:09,476 INFO L440 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2019-01-01 21:37:09,477 INFO L518 LassoAnalysis]: Proved termination. [2019-01-01 21:37:09,477 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~x~0) = 1*ULTIMATE.start_main_~x~0 Supporting invariants [] [2019-01-01 21:37:09,479 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2019-01-01 21:37:09,514 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 21:37:09,523 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 21:37:09,526 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-01 21:37:09,536 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 21:37:09,537 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-01 21:37:09,537 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-01 21:37:09,552 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 1 loop predicates [2019-01-01 21:37:09,554 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 8 states. Second operand 2 states. [2019-01-01 21:37:09,682 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 8 states.. Second operand 2 states. Result 23 states and 39 transitions. Complement of second has 5 states. [2019-01-01 21:37:09,686 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 1 stem states 1 non-accepting loop states 1 accepting loop states [2019-01-01 21:37:09,688 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2019-01-01 21:37:09,689 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 25 transitions. [2019-01-01 21:37:09,691 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 25 transitions. Stem has 1 letters. Loop has 1 letters. [2019-01-01 21:37:09,693 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-01 21:37:09,694 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 25 transitions. Stem has 2 letters. Loop has 1 letters. [2019-01-01 21:37:09,694 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-01 21:37:09,694 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 25 transitions. Stem has 1 letters. Loop has 2 letters. [2019-01-01 21:37:09,694 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-01 21:37:09,696 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 23 states and 39 transitions. [2019-01-01 21:37:09,700 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2019-01-01 21:37:09,706 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 23 states to 9 states and 16 transitions. [2019-01-01 21:37:09,707 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 4 [2019-01-01 21:37:09,707 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 5 [2019-01-01 21:37:09,708 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 16 transitions. [2019-01-01 21:37:09,708 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-01-01 21:37:09,708 INFO L705 BuchiCegarLoop]: Abstraction has 9 states and 16 transitions. [2019-01-01 21:37:09,726 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9 states and 16 transitions. [2019-01-01 21:37:09,736 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9 to 8. [2019-01-01 21:37:09,736 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2019-01-01 21:37:09,737 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 15 transitions. [2019-01-01 21:37:09,739 INFO L728 BuchiCegarLoop]: Abstraction has 8 states and 15 transitions. [2019-01-01 21:37:09,739 INFO L608 BuchiCegarLoop]: Abstraction has 8 states and 15 transitions. [2019-01-01 21:37:09,739 INFO L442 BuchiCegarLoop]: ======== Iteration 2============ [2019-01-01 21:37:09,739 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 8 states and 15 transitions. [2019-01-01 21:37:09,740 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2019-01-01 21:37:09,741 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-01 21:37:09,741 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-01 21:37:09,742 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2019-01-01 21:37:09,742 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2019-01-01 21:37:09,742 INFO L794 eck$LassoCheckResult]: Stem: 60#ULTIMATE.startENTRY havoc main_#res;havoc main_#t~nondet0, main_#t~nondet1, main_~x~0, main_~y~0, main_~res~0;havoc main_~x~0;havoc main_~y~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; 61#L13-2 assume !(main_~x~0 > 0 && main_~y~0 > 0); 63#L21-3 [2019-01-01 21:37:09,742 INFO L796 eck$LassoCheckResult]: Loop: 63#L21-3 assume !!(main_~x~0 > 0);main_~y~0 := 1 + main_~y~0;main_~res~0 := 1 + main_~res~0; 65#L21-2 assume !(main_~x~0 > 0 && main_~y~0 > 0); 63#L21-3 [2019-01-01 21:37:09,743 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 21:37:09,743 INFO L82 PathProgramCache]: Analyzing trace with hash 1000, now seen corresponding path program 1 times [2019-01-01 21:37:09,743 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 21:37:09,743 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 21:37:09,745 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:37:09,745 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 21:37:09,746 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:37:09,749 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 21:37:09,753 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 21:37:09,754 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 21:37:09,755 INFO L82 PathProgramCache]: Analyzing trace with hash 1640, now seen corresponding path program 1 times [2019-01-01 21:37:09,755 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 21:37:09,755 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 21:37:09,757 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:37:09,757 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 21:37:09,757 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:37:09,761 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 21:37:09,764 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 21:37:09,765 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 21:37:09,765 INFO L82 PathProgramCache]: Analyzing trace with hash 961679, now seen corresponding path program 1 times [2019-01-01 21:37:09,766 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 21:37:09,766 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 21:37:09,768 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:37:09,768 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 21:37:09,768 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:37:09,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 21:37:09,776 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 21:37:09,836 INFO L216 LassoAnalysis]: Preferences: [2019-01-01 21:37:09,836 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-01-01 21:37:09,836 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-01-01 21:37:09,836 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-01-01 21:37:09,836 INFO L127 ssoRankerPreferences]: Use exernal solver: true [2019-01-01 21:37:09,837 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-01 21:37:09,837 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-01-01 21:37:09,837 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-01-01 21:37:09,837 INFO L131 ssoRankerPreferences]: Filename of dumped script: MinusUserDefined_true-termination_true-no-overflow.c_Iteration2_Loop [2019-01-01 21:37:09,837 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-01-01 21:37:09,837 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2019-01-01 21:37:09,839 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:37:09,852 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:37:09,862 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:37:09,868 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:37:09,875 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:37:10,054 INFO L300 LassoAnalysis]: Preprocessing complete. [2019-01-01 21:37:10,055 INFO L412 LassoAnalysis]: Checking for nontermination... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-01-01 21:37:10,064 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-01 21:37:10,064 INFO L163 nArgumentSynthesizer]: Using integer mode. Waiting until toolchain timeout for monitored process 4 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-01 21:37:10,093 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2019-01-01 21:37:10,093 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 5 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-01 21:37:10,098 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-01 21:37:10,098 INFO L163 nArgumentSynthesizer]: Using integer mode. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 6 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-01 21:37:10,122 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2019-01-01 21:37:10,122 INFO L163 nArgumentSynthesizer]: Using integer mode. [2019-01-01 21:37:10,195 INFO L452 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2019-01-01 21:37:10,197 INFO L216 LassoAnalysis]: Preferences: [2019-01-01 21:37:10,198 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-01-01 21:37:10,198 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-01-01 21:37:10,198 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-01-01 21:37:10,198 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2019-01-01 21:37:10,198 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-01 21:37:10,198 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-01-01 21:37:10,198 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-01-01 21:37:10,199 INFO L131 ssoRankerPreferences]: Filename of dumped script: MinusUserDefined_true-termination_true-no-overflow.c_Iteration2_Loop [2019-01-01 21:37:10,199 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-01-01 21:37:10,199 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2019-01-01 21:37:10,201 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:37:10,218 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:37:10,276 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:37:10,316 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:37:10,360 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:37:10,599 WARN L181 SmtUtils]: Spent 106.00 ms on a formula simplification that was a NOOP. DAG size: 9 [2019-01-01 21:37:10,768 INFO L300 LassoAnalysis]: Preprocessing complete. [2019-01-01 21:37:10,768 INFO L497 LassoAnalysis]: Using template 'affine'. [2019-01-01 21:37:10,769 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 21:37:10,769 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:37:10,770 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:37:10,770 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:37:10,770 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:37:10,773 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-01 21:37:10,773 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-01 21:37:10,779 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 21:37:10,779 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 21:37:10,780 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:37:10,780 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 21:37:10,780 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:37:10,780 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:37:10,780 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:37:10,783 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 21:37:10,783 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 21:37:10,790 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-01-01 21:37:10,793 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2019-01-01 21:37:10,793 INFO L444 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 1 variables to zero. [2019-01-01 21:37:10,794 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-01-01 21:37:10,794 INFO L440 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2019-01-01 21:37:10,794 INFO L518 LassoAnalysis]: Proved termination. [2019-01-01 21:37:10,794 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~y~0) = -1*ULTIMATE.start_main_~y~0 Supporting invariants [] [2019-01-01 21:37:10,796 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2019-01-01 21:37:10,861 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 21:37:10,867 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 21:37:10,869 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-01 21:37:10,876 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 21:37:10,877 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-01 21:37:10,919 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-01 21:37:10,920 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2019-01-01 21:37:10,921 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 8 states and 15 transitions. cyclomatic complexity: 10 Second operand 3 states. [2019-01-01 21:37:11,026 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 8 states and 15 transitions. cyclomatic complexity: 10. Second operand 3 states. Result 22 states and 34 transitions. Complement of second has 7 states. [2019-01-01 21:37:11,027 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2019-01-01 21:37:11,028 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2019-01-01 21:37:11,028 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 8 transitions. [2019-01-01 21:37:11,028 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 8 transitions. Stem has 2 letters. Loop has 2 letters. [2019-01-01 21:37:11,029 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-01 21:37:11,029 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 8 transitions. Stem has 4 letters. Loop has 2 letters. [2019-01-01 21:37:11,029 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-01 21:37:11,029 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 8 transitions. Stem has 2 letters. Loop has 4 letters. [2019-01-01 21:37:11,029 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-01 21:37:11,030 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 22 states and 34 transitions. [2019-01-01 21:37:11,032 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2019-01-01 21:37:11,033 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 22 states to 15 states and 23 transitions. [2019-01-01 21:37:11,033 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 4 [2019-01-01 21:37:11,034 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 4 [2019-01-01 21:37:11,034 INFO L73 IsDeterministic]: Start isDeterministic. Operand 15 states and 23 transitions. [2019-01-01 21:37:11,034 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-01-01 21:37:11,035 INFO L705 BuchiCegarLoop]: Abstraction has 15 states and 23 transitions. [2019-01-01 21:37:11,035 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15 states and 23 transitions. [2019-01-01 21:37:11,036 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15 to 15. [2019-01-01 21:37:11,036 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2019-01-01 21:37:11,038 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 23 transitions. [2019-01-01 21:37:11,039 INFO L728 BuchiCegarLoop]: Abstraction has 15 states and 23 transitions. [2019-01-01 21:37:11,039 INFO L608 BuchiCegarLoop]: Abstraction has 15 states and 23 transitions. [2019-01-01 21:37:11,039 INFO L442 BuchiCegarLoop]: ======== Iteration 3============ [2019-01-01 21:37:11,039 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 15 states and 23 transitions. [2019-01-01 21:37:11,041 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2019-01-01 21:37:11,041 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-01 21:37:11,041 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-01 21:37:11,041 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [2, 1, 1, 1, 1] [2019-01-01 21:37:11,041 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2019-01-01 21:37:11,042 INFO L794 eck$LassoCheckResult]: Stem: 126#ULTIMATE.startENTRY havoc main_#res;havoc main_#t~nondet0, main_#t~nondet1, main_~x~0, main_~y~0, main_~res~0;havoc main_~x~0;havoc main_~y~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; 127#L13-2 assume !(main_~x~0 > 0 && main_~y~0 > 0); 128#L21-3 assume !!(main_~x~0 > 0);main_~y~0 := 1 + main_~y~0;main_~res~0 := 1 + main_~res~0; 140#L21-2 assume !!(main_~x~0 > 0 && main_~y~0 > 0);main_~x~0 := main_~x~0 - 1;main_~y~0 := main_~y~0 - 1; 137#L21-2 assume !!(main_~x~0 > 0 && main_~y~0 > 0);main_~x~0 := main_~x~0 - 1;main_~y~0 := main_~y~0 - 1; 135#L21-2 assume !(main_~x~0 > 0 && main_~y~0 > 0); 130#L21-3 [2019-01-01 21:37:11,042 INFO L796 eck$LassoCheckResult]: Loop: 130#L21-3 assume !!(main_~x~0 > 0);main_~y~0 := 1 + main_~y~0;main_~res~0 := 1 + main_~res~0; 131#L21-2 assume !(main_~x~0 > 0 && main_~y~0 > 0); 130#L21-3 [2019-01-01 21:37:11,042 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 21:37:11,042 INFO L82 PathProgramCache]: Analyzing trace with hash 924176399, now seen corresponding path program 1 times [2019-01-01 21:37:11,042 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 21:37:11,043 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 21:37:11,046 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:37:11,047 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 21:37:11,047 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:37:11,053 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 21:37:11,125 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-01 21:37:11,128 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-01 21:37:11,128 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-01-01 21:37:11,130 INFO L799 eck$LassoCheckResult]: stem already infeasible [2019-01-01 21:37:11,130 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 21:37:11,130 INFO L82 PathProgramCache]: Analyzing trace with hash 1640, now seen corresponding path program 2 times [2019-01-01 21:37:11,130 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 21:37:11,131 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 21:37:11,132 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:37:11,132 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 21:37:11,133 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:37:11,135 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 21:37:11,137 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 21:37:11,205 INFO L216 LassoAnalysis]: Preferences: [2019-01-01 21:37:11,206 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-01-01 21:37:11,206 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-01-01 21:37:11,206 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-01-01 21:37:11,206 INFO L127 ssoRankerPreferences]: Use exernal solver: true [2019-01-01 21:37:11,207 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-01 21:37:11,207 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-01-01 21:37:11,207 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-01-01 21:37:11,207 INFO L131 ssoRankerPreferences]: Filename of dumped script: MinusUserDefined_true-termination_true-no-overflow.c_Iteration3_Loop [2019-01-01 21:37:11,207 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-01-01 21:37:11,207 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2019-01-01 21:37:11,209 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:37:11,212 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:37:11,259 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:37:11,261 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:37:11,264 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:37:11,351 INFO L300 LassoAnalysis]: Preprocessing complete. [2019-01-01 21:37:11,351 INFO L412 LassoAnalysis]: Checking for nontermination... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 7 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-01 21:37:11,360 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-01 21:37:11,360 INFO L163 nArgumentSynthesizer]: Using integer mode. [2019-01-01 21:37:11,380 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2019-01-01 21:37:11,380 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {v_rep~unnamed0~0~true_5=1} Honda state: {v_rep~unnamed0~0~true_5=1} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 8 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-01 21:37:11,388 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-01 21:37:11,388 INFO L163 nArgumentSynthesizer]: Using integer mode. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 9 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-01 21:37:11,411 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2019-01-01 21:37:11,411 INFO L163 nArgumentSynthesizer]: Using integer mode. [2019-01-01 21:37:11,477 INFO L452 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2019-01-01 21:37:11,479 INFO L216 LassoAnalysis]: Preferences: [2019-01-01 21:37:11,479 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-01-01 21:37:11,479 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-01-01 21:37:11,479 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-01-01 21:37:11,479 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2019-01-01 21:37:11,479 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-01 21:37:11,479 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-01-01 21:37:11,480 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-01-01 21:37:11,480 INFO L131 ssoRankerPreferences]: Filename of dumped script: MinusUserDefined_true-termination_true-no-overflow.c_Iteration3_Loop [2019-01-01 21:37:11,480 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-01-01 21:37:11,480 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2019-01-01 21:37:11,484 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:37:11,491 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:37:11,503 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:37:11,510 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:37:11,517 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:37:11,642 INFO L300 LassoAnalysis]: Preprocessing complete. [2019-01-01 21:37:11,642 INFO L497 LassoAnalysis]: Using template 'affine'. [2019-01-01 21:37:11,643 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 21:37:11,645 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:37:11,645 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:37:11,645 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:37:11,645 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:37:11,648 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-01 21:37:11,649 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-01 21:37:11,655 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 21:37:11,656 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 21:37:11,656 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:37:11,656 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 21:37:11,658 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:37:11,659 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:37:11,659 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:37:11,659 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 21:37:11,660 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 21:37:11,669 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-01-01 21:37:11,675 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2019-01-01 21:37:11,676 INFO L444 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 1 variables to zero. [2019-01-01 21:37:11,676 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-01-01 21:37:11,676 INFO L440 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2019-01-01 21:37:11,677 INFO L518 LassoAnalysis]: Proved termination. [2019-01-01 21:37:11,677 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~y~0) = -1*ULTIMATE.start_main_~y~0 Supporting invariants [] [2019-01-01 21:37:11,677 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2019-01-01 21:37:11,724 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 21:37:11,736 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 21:37:11,737 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-01 21:37:11,744 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 21:37:11,745 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-01 21:37:11,829 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-01 21:37:11,829 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2019-01-01 21:37:11,830 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 15 states and 23 transitions. cyclomatic complexity: 13 Second operand 3 states. [2019-01-01 21:37:11,874 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 15 states and 23 transitions. cyclomatic complexity: 13. Second operand 3 states. Result 43 states and 65 transitions. Complement of second has 7 states. [2019-01-01 21:37:11,875 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2019-01-01 21:37:11,876 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2019-01-01 21:37:11,876 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 11 transitions. [2019-01-01 21:37:11,876 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 11 transitions. Stem has 6 letters. Loop has 2 letters. [2019-01-01 21:37:11,876 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-01 21:37:11,877 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 11 transitions. Stem has 8 letters. Loop has 2 letters. [2019-01-01 21:37:11,877 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-01 21:37:11,877 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 11 transitions. Stem has 6 letters. Loop has 4 letters. [2019-01-01 21:37:11,877 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-01 21:37:11,877 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 43 states and 65 transitions. [2019-01-01 21:37:11,880 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2019-01-01 21:37:11,881 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 43 states to 30 states and 45 transitions. [2019-01-01 21:37:11,881 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 4 [2019-01-01 21:37:11,881 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 4 [2019-01-01 21:37:11,881 INFO L73 IsDeterministic]: Start isDeterministic. Operand 30 states and 45 transitions. [2019-01-01 21:37:11,883 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-01-01 21:37:11,883 INFO L705 BuchiCegarLoop]: Abstraction has 30 states and 45 transitions. [2019-01-01 21:37:11,883 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states and 45 transitions. [2019-01-01 21:37:11,886 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 19. [2019-01-01 21:37:11,886 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2019-01-01 21:37:11,887 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 30 transitions. [2019-01-01 21:37:11,887 INFO L728 BuchiCegarLoop]: Abstraction has 19 states and 30 transitions. [2019-01-01 21:37:11,889 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-01-01 21:37:11,890 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-01-01 21:37:11,891 INFO L87 Difference]: Start difference. First operand 19 states and 30 transitions. Second operand 5 states. [2019-01-01 21:37:11,970 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-01 21:37:11,970 INFO L93 Difference]: Finished difference Result 13 states and 18 transitions. [2019-01-01 21:37:11,971 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-01-01 21:37:11,971 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 13 states and 18 transitions. [2019-01-01 21:37:11,972 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2019-01-01 21:37:11,972 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 13 states to 0 states and 0 transitions. [2019-01-01 21:37:11,972 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2019-01-01 21:37:11,972 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2019-01-01 21:37:11,973 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2019-01-01 21:37:11,973 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-01-01 21:37:11,973 INFO L705 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-01-01 21:37:11,973 INFO L728 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-01-01 21:37:11,973 INFO L608 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-01-01 21:37:11,973 INFO L442 BuchiCegarLoop]: ======== Iteration 4============ [2019-01-01 21:37:11,973 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2019-01-01 21:37:11,973 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2019-01-01 21:37:11,973 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2019-01-01 21:37:11,980 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 01.01 09:37:11 BoogieIcfgContainer [2019-01-01 21:37:11,980 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2019-01-01 21:37:11,981 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-01-01 21:37:11,981 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-01-01 21:37:11,981 INFO L276 PluginConnector]: Witness Printer initialized [2019-01-01 21:37:11,982 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 01.01 09:37:07" (3/4) ... [2019-01-01 21:37:11,985 INFO L147 WitnessPrinter]: No result that supports witness generation found [2019-01-01 21:37:11,985 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-01-01 21:37:11,986 INFO L168 Benchmark]: Toolchain (without parser) took 4638.82 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 145.8 MB). Free memory was 944.7 MB in the beginning and 939.5 MB in the end (delta: 5.2 MB). Peak memory consumption was 150.9 MB. Max. memory is 11.5 GB. [2019-01-01 21:37:11,987 INFO L168 Benchmark]: CDTParser took 0.17 ms. Allocated memory is still 1.0 GB. Free memory is still 972.8 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-01-01 21:37:11,988 INFO L168 Benchmark]: CACSL2BoogieTranslator took 251.24 ms. Allocated memory is still 1.0 GB. Free memory was 944.7 MB in the beginning and 933.9 MB in the end (delta: 10.7 MB). Peak memory consumption was 10.7 MB. Max. memory is 11.5 GB. [2019-01-01 21:37:11,989 INFO L168 Benchmark]: Boogie Procedure Inliner took 41.03 ms. Allocated memory is still 1.0 GB. Free memory is still 933.9 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-01-01 21:37:11,990 INFO L168 Benchmark]: Boogie Preprocessor took 24.46 ms. Allocated memory is still 1.0 GB. Free memory is still 933.9 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-01-01 21:37:11,990 INFO L168 Benchmark]: RCFGBuilder took 307.68 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 145.8 MB). Free memory was 933.9 MB in the beginning and 1.1 GB in the end (delta: -197.0 MB). Peak memory consumption was 24.8 MB. Max. memory is 11.5 GB. [2019-01-01 21:37:11,992 INFO L168 Benchmark]: BuchiAutomizer took 4005.11 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 939.5 MB in the end (delta: 184.9 MB). Peak memory consumption was 184.9 MB. Max. memory is 11.5 GB. [2019-01-01 21:37:11,993 INFO L168 Benchmark]: Witness Printer took 4.34 ms. Allocated memory is still 1.2 GB. Free memory is still 939.5 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-01-01 21:37:11,999 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.17 ms. Allocated memory is still 1.0 GB. Free memory is still 972.8 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 251.24 ms. Allocated memory is still 1.0 GB. Free memory was 944.7 MB in the beginning and 933.9 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 41.03 ms. Allocated memory is still 1.0 GB. Free memory is still 933.9 MB. There was no memory consumed. Max. memory is 11.5 GB. * Boogie Preprocessor took 24.46 ms. Allocated memory is still 1.0 GB. Free memory is still 933.9 MB. There was no memory consumed. Max. memory is 11.5 GB. * RCFGBuilder took 307.68 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 145.8 MB). Free memory was 933.9 MB in the beginning and 1.1 GB in the end (delta: -197.0 MB). Peak memory consumption was 24.8 MB. Max. memory is 11.5 GB. * BuchiAutomizer took 4005.11 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 939.5 MB in the end (delta: 184.9 MB). Peak memory consumption was 184.9 MB. Max. memory is 11.5 GB. * Witness Printer took 4.34 ms. Allocated memory is still 1.2 GB. Free memory is still 939.5 MB. There was no memory consumed. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Constructed decomposition of program Your program was decomposed into 4 terminating modules (1 trivial, 3 deterministic, 0 nondeterministic). One deterministic module has affine ranking function x and consists of 4 locations. One deterministic module has affine ranking function -1 * y and consists of 4 locations. One deterministic module has affine ranking function -1 * y and consists of 4 locations. 1 modules have a trivial ranking function, the largest among these consists of 5 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 3.9s and 4 iterations. TraceHistogramMax:2. Analysis of lassos took 3.0s. Construction of modules took 0.2s. Büchi inclusion checks took 0.4s. Highest rank in rank-based complementation 3. Minimization of det autom 1. Minimization of nondet autom 3. Automata minimization 0.0s AutomataMinimizationTime, 3 MinimizatonAttempts, 12 StatesRemovedByMinimization, 2 NontrivialMinimizations. Non-live state removal took 0.0s Buchi closure took 0.0s. Biggest automaton had 15 states and ocurred in iteration 2. Nontrivial modules had stage [3, 0, 0, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 16 SDtfs, 18 SDslu, 3 SDs, 0 SdLazy, 43 SolverSat, 11 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.2s Time LassoAnalysisResults: nont0 unkn0 SFLI0 SFLT2 conc0 concLT0 SILN0 SILU0 SILI0 SILT1 lasso0 LassoPreprocessingBenchmarks: Lassos: inital18 mio100 ax164 hnf97 lsp33 ukn100 mio100 lsp100 div100 bol100 ite100 ukn100 eq160 hnf93 smp100 dnf100 smp100 tf113 neg100 sie103 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 0 Time: 10ms VariablesStem: 1 VariablesLoop: 0 DisjunctsStem: 1 DisjunctsLoop: 1 SupportingInvariants: 2 MotzkinApplications: 6 LassoTerminationAnalysisBenchmarks: LassoNonterminationAnalysisSatFixpoint: 2 LassoNonterminationAnalysisSatUnbounded: 0 LassoNonterminationAnalysisUnsat: 3 LassoNonterminationAnalysisUnknown: 0 LassoNonterminationAnalysisTime: 0.3s - TerminationAnalysisResult: Termination proven Buchi Automizer proved that your program is terminating RESULT: Ultimate proved your program to be correct! Received shutdown request...