./Ultimate.py --spec /storage/repos/svcomp/c/properties/termination.prp --file /storage/repos/svcomp/c/termination-crafted-lit/CookSeeZuleger-TACAS2013-Fig7a_true-termination_true-no-overflow.c --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for termination Using default analysis Version 91b1670e Calling Ultimate with: java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx12G -Xms1G -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerTermination.xml -i /storage/repos/svcomp/c/termination-crafted-lit/CookSeeZuleger-TACAS2013-Fig7a_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 f9de9875f09e594325a645528f016ce12ac5c646 ........................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................ Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.24-91b1670 [2018-11-28 23:15:08,783 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-28 23:15:08,785 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-28 23:15:08,797 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-28 23:15:08,798 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-28 23:15:08,799 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-28 23:15:08,800 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-28 23:15:08,802 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-28 23:15:08,804 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-28 23:15:08,805 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-28 23:15:08,806 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-28 23:15:08,806 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-28 23:15:08,807 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-28 23:15:08,809 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-28 23:15:08,810 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-28 23:15:08,811 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-28 23:15:08,812 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-28 23:15:08,814 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-28 23:15:08,816 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-28 23:15:08,818 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-28 23:15:08,819 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-28 23:15:08,820 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-28 23:15:08,823 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-28 23:15:08,823 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-28 23:15:08,823 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-28 23:15:08,824 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-28 23:15:08,825 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-28 23:15:08,827 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-28 23:15:08,828 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-28 23:15:08,829 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-28 23:15:08,829 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-28 23:15:08,830 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-28 23:15:08,830 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-28 23:15:08,830 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-28 23:15:08,832 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-28 23:15:08,832 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-28 23:15:08,833 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-64bit-Automizer_Default.epf [2018-11-28 23:15:08,859 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-28 23:15:08,859 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-28 23:15:08,860 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-11-28 23:15:08,861 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-11-28 23:15:08,861 INFO L133 SettingsManager]: * Use SBE=true [2018-11-28 23:15:08,861 INFO L131 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2018-11-28 23:15:08,861 INFO L133 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2018-11-28 23:15:08,861 INFO L133 SettingsManager]: * Use old map elimination=false [2018-11-28 23:15:08,862 INFO L133 SettingsManager]: * Use external solver (rank synthesis)=false [2018-11-28 23:15:08,862 INFO L133 SettingsManager]: * Use only trivial implications for array writes=true [2018-11-28 23:15:08,862 INFO L133 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2018-11-28 23:15:08,862 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-28 23:15:08,862 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-11-28 23:15:08,862 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-28 23:15:08,863 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-28 23:15:08,863 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2018-11-28 23:15:08,863 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2018-11-28 23:15:08,863 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2018-11-28 23:15:08,863 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-28 23:15:08,863 INFO L133 SettingsManager]: * Assume nondeterminstic values are in range=false [2018-11-28 23:15:08,864 INFO L133 SettingsManager]: * Use constant arrays=true [2018-11-28 23:15:08,864 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2018-11-28 23:15:08,864 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-28 23:15:08,864 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-28 23:15:08,864 INFO L133 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2018-11-28 23:15:08,865 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-28 23:15:08,865 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-11-28 23:15:08,865 INFO L133 SettingsManager]: * Dump automata to the following directory=/home/matthias/ultimate/dump/auto [2018-11-28 23:15:08,866 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2018-11-28 23:15:08,866 INFO L133 SettingsManager]: * TransformationType=MODULO_NEIGHBOR Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(F end) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 64bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> f9de9875f09e594325a645528f016ce12ac5c646 [2018-11-28 23:15:08,902 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-28 23:15:08,918 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-28 23:15:08,923 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-28 23:15:08,924 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-28 23:15:08,925 INFO L276 PluginConnector]: CDTParser initialized [2018-11-28 23:15:08,926 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/svcomp/c/termination-crafted-lit/CookSeeZuleger-TACAS2013-Fig7a_true-termination_true-no-overflow.c [2018-11-28 23:15:08,994 INFO L221 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6425c9261/70b33902877742b98ec045ae461895df/FLAG7bc98dbde [2018-11-28 23:15:09,472 INFO L307 CDTParser]: Found 1 translation units. [2018-11-28 23:15:09,472 INFO L161 CDTParser]: Scanning /storage/repos/svcomp/c/termination-crafted-lit/CookSeeZuleger-TACAS2013-Fig7a_true-termination_true-no-overflow.c [2018-11-28 23:15:09,479 INFO L355 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6425c9261/70b33902877742b98ec045ae461895df/FLAG7bc98dbde [2018-11-28 23:15:09,813 INFO L363 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6425c9261/70b33902877742b98ec045ae461895df [2018-11-28 23:15:09,817 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-28 23:15:09,819 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-11-28 23:15:09,820 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-28 23:15:09,820 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-28 23:15:09,825 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-28 23:15:09,826 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.11 11:15:09" (1/1) ... [2018-11-28 23:15:09,831 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1435883 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 11:15:09, skipping insertion in model container [2018-11-28 23:15:09,832 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.11 11:15:09" (1/1) ... [2018-11-28 23:15:09,839 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-28 23:15:09,856 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-11-28 23:15:10,081 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-11-28 23:15:10,086 INFO L191 MainTranslator]: Completed pre-run [2018-11-28 23:15:10,114 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-11-28 23:15:10,131 INFO L195 MainTranslator]: Completed translation [2018-11-28 23:15:10,131 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 11:15:10 WrapperNode [2018-11-28 23:15:10,132 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-28 23:15:10,132 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-28 23:15:10,133 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-28 23:15:10,133 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-28 23:15:10,143 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 11:15:10" (1/1) ... [2018-11-28 23:15:10,148 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 11:15:10" (1/1) ... [2018-11-28 23:15:10,173 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-28 23:15:10,173 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-28 23:15:10,173 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-28 23:15:10,173 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-28 23:15:10,185 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 11:15:10" (1/1) ... [2018-11-28 23:15:10,185 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 11:15:10" (1/1) ... [2018-11-28 23:15:10,186 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 11:15:10" (1/1) ... [2018-11-28 23:15:10,186 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 11:15:10" (1/1) ... [2018-11-28 23:15:10,193 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 11:15:10" (1/1) ... [2018-11-28 23:15:10,199 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 11:15:10" (1/1) ... [2018-11-28 23:15:10,200 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 11:15:10" (1/1) ... [2018-11-28 23:15:10,202 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-28 23:15:10,202 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-28 23:15:10,202 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-28 23:15:10,203 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-28 23:15:10,204 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 11:15:10" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-28 23:15:10,334 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-28 23:15:10,334 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-28 23:15:10,515 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-28 23:15:10,515 INFO L280 CfgBuilder]: Removed 5 assue(true) statements. [2018-11-28 23:15:10,516 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 11:15:10 BoogieIcfgContainer [2018-11-28 23:15:10,516 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-28 23:15:10,517 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2018-11-28 23:15:10,517 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2018-11-28 23:15:10,520 INFO L276 PluginConnector]: BuchiAutomizer initialized [2018-11-28 23:15:10,521 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-11-28 23:15:10,522 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 28.11 11:15:09" (1/3) ... [2018-11-28 23:15:10,523 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@43025fac and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 28.11 11:15:10, skipping insertion in model container [2018-11-28 23:15:10,523 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-11-28 23:15:10,523 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 11:15:10" (2/3) ... [2018-11-28 23:15:10,524 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@43025fac and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 28.11 11:15:10, skipping insertion in model container [2018-11-28 23:15:10,524 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-11-28 23:15:10,524 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 11:15:10" (3/3) ... [2018-11-28 23:15:10,526 INFO L375 chiAutomizerObserver]: Analyzing ICFG CookSeeZuleger-TACAS2013-Fig7a_true-termination_true-no-overflow.c [2018-11-28 23:15:10,584 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-11-28 23:15:10,585 INFO L374 BuchiCegarLoop]: Interprodecural is true [2018-11-28 23:15:10,585 INFO L375 BuchiCegarLoop]: Hoare is false [2018-11-28 23:15:10,585 INFO L376 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2018-11-28 23:15:10,585 INFO L377 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-28 23:15:10,585 INFO L378 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-28 23:15:10,586 INFO L379 BuchiCegarLoop]: Difference is false [2018-11-28 23:15:10,586 INFO L380 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-28 23:15:10,586 INFO L383 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2018-11-28 23:15:10,601 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 7 states. [2018-11-28 23:15:10,624 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2018-11-28 23:15:10,625 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-28 23:15:10,625 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-28 23:15:10,632 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1] [2018-11-28 23:15:10,633 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2018-11-28 23:15:10,633 INFO L442 BuchiCegarLoop]: ======== Iteration 1============ [2018-11-28 23:15:10,633 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 7 states. [2018-11-28 23:15:10,634 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2018-11-28 23:15:10,634 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-28 23:15:10,634 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-28 23:15:10,635 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1] [2018-11-28 23:15:10,635 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2018-11-28 23:15:10,644 INFO L794 eck$LassoCheckResult]: Stem: 4#ULTIMATE.startENTRYtrue havoc main_#res;havoc main_#t~nondet0, main_#t~nondet1, main_#t~nondet2, main_#t~nondet3, main_#t~nondet4, main_#t~nondet5, main_~x~0, main_~y~0, main_~d~0;havoc main_~x~0;havoc main_~y~0;havoc main_~d~0;main_~x~0 := main_#t~nondet0;havoc main_#t~nondet0;main_~y~0 := main_#t~nondet1;havoc main_#t~nondet1;main_~d~0 := main_#t~nondet2;havoc main_#t~nondet2; 7#L21-2true [2018-11-28 23:15:10,644 INFO L796 eck$LassoCheckResult]: Loop: 7#L21-2true assume !!((main_~x~0 > 0 && main_~y~0 > 0) && main_~d~0 > 0); 3#L21true assume 0 != main_#t~nondet3;havoc main_#t~nondet3;main_~x~0 := main_~x~0 - 1;main_~d~0 := main_#t~nondet4;havoc main_#t~nondet4; 7#L21-2true [2018-11-28 23:15:10,651 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 23:15:10,652 INFO L82 PathProgramCache]: Analyzing trace with hash 32, now seen corresponding path program 1 times [2018-11-28 23:15:10,654 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 23:15:10,655 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 23:15:10,718 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:15:10,718 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 23:15:10,718 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:15:10,740 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 23:15:10,744 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 23:15:10,765 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 23:15:10,765 INFO L82 PathProgramCache]: Analyzing trace with hash 1284, now seen corresponding path program 1 times [2018-11-28 23:15:10,766 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 23:15:10,766 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 23:15:10,768 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:15:10,768 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 23:15:10,768 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:15:10,777 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 23:15:10,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 23:15:10,791 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 23:15:10,791 INFO L82 PathProgramCache]: Analyzing trace with hash 31075, now seen corresponding path program 1 times [2018-11-28 23:15:10,791 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 23:15:10,791 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 23:15:10,794 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:15:10,795 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 23:15:10,795 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:15:10,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 23:15:10,823 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 23:15:10,980 WARN L180 SmtUtils]: Spent 145.00 ms on a formula simplification that was a NOOP. DAG size: 18 [2018-11-28 23:15:11,071 INFO L216 LassoAnalysis]: Preferences: [2018-11-28 23:15:11,072 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-28 23:15:11,072 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-28 23:15:11,073 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-28 23:15:11,073 INFO L127 ssoRankerPreferences]: Use exernal solver: true [2018-11-28 23:15:11,073 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-28 23:15:11,073 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-28 23:15:11,073 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-28 23:15:11,074 INFO L131 ssoRankerPreferences]: Filename of dumped script: CookSeeZuleger-TACAS2013-Fig7a_true-termination_true-no-overflow.c_Iteration1_Loop [2018-11-28 23:15:11,074 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-28 23:15:11,074 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-11-28 23:15:11,100 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:15:11,146 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:15:11,157 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:15:11,188 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:15:11,192 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:15:11,234 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:15:11,627 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-11-28 23:15:11,627 INFO L412 LassoAnalysis]: Checking for nontermination... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-28 23:15:11,633 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-28 23:15:11,633 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-28 23:15:11,661 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-11-28 23:15:11,661 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 [2018-11-28 23:15:11,667 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-28 23:15:11,668 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-28 23:15:11,695 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-11-28 23:15:11,695 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 [2018-11-28 23:15:11,700 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-28 23:15:11,700 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 [2018-11-28 23:15:11,724 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2018-11-28 23:15:11,724 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-28 23:15:11,748 INFO L452 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2018-11-28 23:15:11,751 INFO L216 LassoAnalysis]: Preferences: [2018-11-28 23:15:11,751 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-28 23:15:11,751 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-28 23:15:11,751 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-28 23:15:11,752 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-11-28 23:15:11,752 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-28 23:15:11,752 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-28 23:15:11,752 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-28 23:15:11,752 INFO L131 ssoRankerPreferences]: Filename of dumped script: CookSeeZuleger-TACAS2013-Fig7a_true-termination_true-no-overflow.c_Iteration1_Loop [2018-11-28 23:15:11,752 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-28 23:15:11,753 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-11-28 23:15:11,755 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:15:11,759 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:15:11,765 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:15:11,789 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:15:11,795 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:15:11,810 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:15:12,050 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-11-28 23:15:12,055 INFO L497 LassoAnalysis]: Using template 'affine'. [2018-11-28 23:15:12,056 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 23:15:12,058 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:15:12,058 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:15:12,058 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:15:12,058 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:15:12,063 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-28 23:15:12,063 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 23:15:12,072 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:15:12,073 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 23:15:12,074 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:15:12,074 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:15:12,074 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:15:12,074 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:15:12,077 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-28 23:15:12,077 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 23:15:12,086 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:15:12,087 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 23:15:12,087 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:15:12,087 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 23:15:12,088 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:15:12,088 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:15:12,088 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:15:12,089 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 23:15:12,089 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 23:15:12,099 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-11-28 23:15:12,103 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2018-11-28 23:15:12,103 INFO L444 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 1 variables to zero. [2018-11-28 23:15:12,106 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-11-28 23:15:12,106 INFO L440 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2018-11-28 23:15:12,106 INFO L518 LassoAnalysis]: Proved termination. [2018-11-28 23:15:12,107 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~x~0) = 1*ULTIMATE.start_main_~x~0 Supporting invariants [] [2018-11-28 23:15:12,108 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2018-11-28 23:15:12,193 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 23:15:12,202 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 23:15:12,205 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 23:15:12,215 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 23:15:12,216 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 23:15:12,238 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 23:15:12,253 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2018-11-28 23:15:12,254 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 7 states. Second operand 3 states. [2018-11-28 23:15:12,324 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 7 states.. Second operand 3 states. Result 23 states and 30 transitions. Complement of second has 8 states. [2018-11-28 23:15:12,327 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 5 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2018-11-28 23:15:12,328 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-28 23:15:12,329 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 11 transitions. [2018-11-28 23:15:12,331 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 11 transitions. Stem has 1 letters. Loop has 2 letters. [2018-11-28 23:15:12,332 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-28 23:15:12,332 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 11 transitions. Stem has 3 letters. Loop has 2 letters. [2018-11-28 23:15:12,332 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-28 23:15:12,332 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 11 transitions. Stem has 1 letters. Loop has 4 letters. [2018-11-28 23:15:12,332 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-28 23:15:12,334 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 23 states and 30 transitions. [2018-11-28 23:15:12,337 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2018-11-28 23:15:12,342 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 23 states to 7 states and 10 transitions. [2018-11-28 23:15:12,344 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 4 [2018-11-28 23:15:12,344 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 5 [2018-11-28 23:15:12,345 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 10 transitions. [2018-11-28 23:15:12,345 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-28 23:15:12,345 INFO L705 BuchiCegarLoop]: Abstraction has 7 states and 10 transitions. [2018-11-28 23:15:12,365 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7 states and 10 transitions. [2018-11-28 23:15:12,374 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7 to 7. [2018-11-28 23:15:12,374 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2018-11-28 23:15:12,375 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 10 transitions. [2018-11-28 23:15:12,376 INFO L728 BuchiCegarLoop]: Abstraction has 7 states and 10 transitions. [2018-11-28 23:15:12,376 INFO L608 BuchiCegarLoop]: Abstraction has 7 states and 10 transitions. [2018-11-28 23:15:12,376 INFO L442 BuchiCegarLoop]: ======== Iteration 2============ [2018-11-28 23:15:12,377 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 7 states and 10 transitions. [2018-11-28 23:15:12,377 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2018-11-28 23:15:12,377 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-28 23:15:12,378 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-28 23:15:12,378 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1] [2018-11-28 23:15:12,378 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2018-11-28 23:15:12,378 INFO L794 eck$LassoCheckResult]: Stem: 71#ULTIMATE.startENTRY havoc main_#res;havoc main_#t~nondet0, main_#t~nondet1, main_#t~nondet2, main_#t~nondet3, main_#t~nondet4, main_#t~nondet5, main_~x~0, main_~y~0, main_~d~0;havoc main_~x~0;havoc main_~y~0;havoc main_~d~0;main_~x~0 := main_#t~nondet0;havoc main_#t~nondet0;main_~y~0 := main_#t~nondet1;havoc main_#t~nondet1;main_~d~0 := main_#t~nondet2;havoc main_#t~nondet2; 72#L21-2 assume !!((main_~x~0 > 0 && main_~y~0 > 0) && main_~d~0 > 0); 67#L21 assume !(0 != main_#t~nondet3);havoc main_#t~nondet3;main_~x~0 := main_#t~nondet5;havoc main_#t~nondet5;main_~y~0 := main_~y~0 - 1;main_~d~0 := main_~d~0 - 1; 68#L21-2 [2018-11-28 23:15:12,379 INFO L796 eck$LassoCheckResult]: Loop: 68#L21-2 assume !!((main_~x~0 > 0 && main_~y~0 > 0) && main_~d~0 > 0); 73#L21 assume 0 != main_#t~nondet3;havoc main_#t~nondet3;main_~x~0 := main_~x~0 - 1;main_~d~0 := main_#t~nondet4;havoc main_#t~nondet4; 68#L21-2 [2018-11-28 23:15:12,379 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 23:15:12,379 INFO L82 PathProgramCache]: Analyzing trace with hash 31077, now seen corresponding path program 1 times [2018-11-28 23:15:12,379 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 23:15:12,379 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 23:15:12,381 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:15:12,381 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 23:15:12,381 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:15:12,386 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 23:15:12,392 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 23:15:12,394 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 23:15:12,394 INFO L82 PathProgramCache]: Analyzing trace with hash 1284, now seen corresponding path program 2 times [2018-11-28 23:15:12,395 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 23:15:12,395 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 23:15:12,396 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:15:12,397 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 23:15:12,397 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:15:12,400 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 23:15:12,403 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 23:15:12,405 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 23:15:12,405 INFO L82 PathProgramCache]: Analyzing trace with hash 29865320, now seen corresponding path program 1 times [2018-11-28 23:15:12,405 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 23:15:12,406 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 23:15:12,407 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:15:12,407 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-28 23:15:12,407 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:15:12,415 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 23:15:12,422 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 23:15:12,499 INFO L216 LassoAnalysis]: Preferences: [2018-11-28 23:15:12,499 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-28 23:15:12,499 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-28 23:15:12,500 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-28 23:15:12,500 INFO L127 ssoRankerPreferences]: Use exernal solver: true [2018-11-28 23:15:12,500 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-28 23:15:12,500 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-28 23:15:12,501 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-28 23:15:12,501 INFO L131 ssoRankerPreferences]: Filename of dumped script: CookSeeZuleger-TACAS2013-Fig7a_true-termination_true-no-overflow.c_Iteration2_Loop [2018-11-28 23:15:12,501 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-28 23:15:12,501 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-11-28 23:15:12,503 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:15:12,508 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:15:12,519 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:15:12,524 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:15:12,541 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:15:12,547 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:15:12,815 WARN L180 SmtUtils]: Spent 107.00 ms on a formula simplification that was a NOOP. DAG size: 8 [2018-11-28 23:15:13,063 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-11-28 23:15:13,063 INFO L412 LassoAnalysis]: Checking for nontermination... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 6 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-28 23:15:13,069 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-28 23:15:13,069 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-28 23:15:13,092 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-11-28 23:15:13,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 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 [2018-11-28 23:15:13,097 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-28 23:15:13,097 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-28 23:15:13,103 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-11-28 23:15:13,103 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_main_#t~nondet4=4, ULTIMATE.start_main_~d~0=4} Honda state: {ULTIMATE.start_main_#t~nondet4=4, ULTIMATE.start_main_~d~0=4} 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 [2018-11-28 23:15:13,133 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-28 23:15:13,134 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-28 23:15:13,139 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-11-28 23:15:13,140 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_main_#t~nondet3=7} Honda state: {ULTIMATE.start_main_#t~nondet3=7} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 9 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-28 23:15:13,160 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-28 23:15:13,160 INFO L163 nArgumentSynthesizer]: Using integer mode. 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 [2018-11-28 23:15:13,183 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2018-11-28 23:15:13,183 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-28 23:15:13,211 INFO L452 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2018-11-28 23:15:13,213 INFO L216 LassoAnalysis]: Preferences: [2018-11-28 23:15:13,213 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-28 23:15:13,214 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-28 23:15:13,214 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-28 23:15:13,214 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-11-28 23:15:13,214 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-28 23:15:13,214 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-28 23:15:13,214 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-28 23:15:13,214 INFO L131 ssoRankerPreferences]: Filename of dumped script: CookSeeZuleger-TACAS2013-Fig7a_true-termination_true-no-overflow.c_Iteration2_Loop [2018-11-28 23:15:13,215 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-28 23:15:13,215 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-11-28 23:15:13,217 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:15:13,226 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:15:13,249 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:15:13,255 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:15:13,266 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:15:13,272 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:15:13,474 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-11-28 23:15:13,474 INFO L497 LassoAnalysis]: Using template 'affine'. [2018-11-28 23:15:13,475 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 23:15:13,478 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:15:13,478 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:15:13,478 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:15:13,478 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:15:13,480 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-28 23:15:13,481 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 23:15:13,486 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:15:13,487 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 23:15:13,488 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:15:13,488 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 23:15:13,488 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:15:13,488 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:15:13,488 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:15:13,491 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 23:15:13,491 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 23:15:13,500 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:15:13,501 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 23:15:13,501 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:15:13,501 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 23:15:13,503 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:15:13,503 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-11-28 23:15:13,503 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:15:13,504 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-28 23:15:13,504 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 23:15:13,509 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:15:13,510 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 23:15:13,511 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:15:13,511 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 23:15:13,511 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:15:13,511 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:15:13,511 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:15:13,512 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 23:15:13,512 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 23:15:13,518 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-11-28 23:15:13,522 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2018-11-28 23:15:13,522 INFO L444 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 1 variables to zero. [2018-11-28 23:15:13,523 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-11-28 23:15:13,523 INFO L440 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2018-11-28 23:15:13,523 INFO L518 LassoAnalysis]: Proved termination. [2018-11-28 23:15:13,523 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~x~0) = 1*ULTIMATE.start_main_~x~0 Supporting invariants [] [2018-11-28 23:15:13,525 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2018-11-28 23:15:13,592 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 23:15:13,611 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 23:15:13,613 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 23:15:13,634 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 23:15:13,635 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 23:15:13,785 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 23:15:13,785 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2018-11-28 23:15:13,785 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 7 states and 10 transitions. cyclomatic complexity: 5 Second operand 3 states. [2018-11-28 23:15:13,805 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 7 states and 10 transitions. cyclomatic complexity: 5. Second operand 3 states. Result 11 states and 16 transitions. Complement of second has 5 states. [2018-11-28 23:15:13,806 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 3 states 1 stem states 1 non-accepting loop states 1 accepting loop states [2018-11-28 23:15:13,807 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-28 23:15:13,808 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 6 transitions. [2018-11-28 23:15:13,808 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 6 transitions. Stem has 3 letters. Loop has 2 letters. [2018-11-28 23:15:13,809 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-28 23:15:13,810 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 6 transitions. Stem has 5 letters. Loop has 2 letters. [2018-11-28 23:15:13,810 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-28 23:15:13,810 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 6 transitions. Stem has 3 letters. Loop has 4 letters. [2018-11-28 23:15:13,810 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-28 23:15:13,810 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 11 states and 16 transitions. [2018-11-28 23:15:13,813 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2018-11-28 23:15:13,813 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 11 states to 11 states and 16 transitions. [2018-11-28 23:15:13,813 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 6 [2018-11-28 23:15:13,814 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 7 [2018-11-28 23:15:13,814 INFO L73 IsDeterministic]: Start isDeterministic. Operand 11 states and 16 transitions. [2018-11-28 23:15:13,814 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-28 23:15:13,815 INFO L705 BuchiCegarLoop]: Abstraction has 11 states and 16 transitions. [2018-11-28 23:15:13,815 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11 states and 16 transitions. [2018-11-28 23:15:13,817 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11 to 11. [2018-11-28 23:15:13,817 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2018-11-28 23:15:13,818 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 16 transitions. [2018-11-28 23:15:13,818 INFO L728 BuchiCegarLoop]: Abstraction has 11 states and 16 transitions. [2018-11-28 23:15:13,818 INFO L608 BuchiCegarLoop]: Abstraction has 11 states and 16 transitions. [2018-11-28 23:15:13,818 INFO L442 BuchiCegarLoop]: ======== Iteration 3============ [2018-11-28 23:15:13,818 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 11 states and 16 transitions. [2018-11-28 23:15:13,819 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2018-11-28 23:15:13,819 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-28 23:15:13,819 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-28 23:15:13,820 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 1] [2018-11-28 23:15:13,820 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2018-11-28 23:15:13,820 INFO L794 eck$LassoCheckResult]: Stem: 125#ULTIMATE.startENTRY havoc main_#res;havoc main_#t~nondet0, main_#t~nondet1, main_#t~nondet2, main_#t~nondet3, main_#t~nondet4, main_#t~nondet5, main_~x~0, main_~y~0, main_~d~0;havoc main_~x~0;havoc main_~y~0;havoc main_~d~0;main_~x~0 := main_#t~nondet0;havoc main_#t~nondet0;main_~y~0 := main_#t~nondet1;havoc main_#t~nondet1;main_~d~0 := main_#t~nondet2;havoc main_#t~nondet2; 126#L21-2 assume !!((main_~x~0 > 0 && main_~y~0 > 0) && main_~d~0 > 0); 121#L21 assume !(0 != main_#t~nondet3);havoc main_#t~nondet3;main_~x~0 := main_#t~nondet5;havoc main_#t~nondet5;main_~y~0 := main_~y~0 - 1;main_~d~0 := main_~d~0 - 1; 122#L21-2 assume !!((main_~x~0 > 0 && main_~y~0 > 0) && main_~d~0 > 0); 129#L21 assume !(0 != main_#t~nondet3);havoc main_#t~nondet3;main_~x~0 := main_#t~nondet5;havoc main_#t~nondet5;main_~y~0 := main_~y~0 - 1;main_~d~0 := main_~d~0 - 1; 127#L21-2 [2018-11-28 23:15:13,820 INFO L796 eck$LassoCheckResult]: Loop: 127#L21-2 assume !!((main_~x~0 > 0 && main_~y~0 > 0) && main_~d~0 > 0); 128#L21 assume 0 != main_#t~nondet3;havoc main_#t~nondet3;main_~x~0 := main_~x~0 - 1;main_~d~0 := main_#t~nondet4;havoc main_#t~nondet4; 127#L21-2 [2018-11-28 23:15:13,820 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 23:15:13,820 INFO L82 PathProgramCache]: Analyzing trace with hash 29865322, now seen corresponding path program 2 times [2018-11-28 23:15:13,820 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 23:15:13,821 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 23:15:13,823 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:15:13,823 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 23:15:13,823 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:15:13,833 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 23:15:13,842 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 23:15:13,845 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 23:15:13,845 INFO L82 PathProgramCache]: Analyzing trace with hash 1284, now seen corresponding path program 3 times [2018-11-28 23:15:13,845 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 23:15:13,845 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 23:15:13,848 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:15:13,848 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-28 23:15:13,848 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:15:13,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 23:15:13,856 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 23:15:13,858 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 23:15:13,858 INFO L82 PathProgramCache]: Analyzing trace with hash -1364196307, now seen corresponding path program 2 times [2018-11-28 23:15:13,859 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 23:15:13,859 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 23:15:13,860 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:15:13,860 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-28 23:15:13,861 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:15:13,868 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 23:15:13,875 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 23:15:13,940 INFO L216 LassoAnalysis]: Preferences: [2018-11-28 23:15:13,940 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-28 23:15:13,940 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-28 23:15:13,941 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-28 23:15:13,941 INFO L127 ssoRankerPreferences]: Use exernal solver: true [2018-11-28 23:15:13,941 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-28 23:15:13,941 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-28 23:15:13,941 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-28 23:15:13,942 INFO L131 ssoRankerPreferences]: Filename of dumped script: CookSeeZuleger-TACAS2013-Fig7a_true-termination_true-no-overflow.c_Iteration3_Loop [2018-11-28 23:15:13,942 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-28 23:15:13,942 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-11-28 23:15:13,945 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:15:13,958 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:15:13,966 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:15:13,979 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:15:13,990 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:15:13,996 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:15:14,120 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-11-28 23:15:14,121 INFO L412 LassoAnalysis]: Checking for nontermination... 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 [2018-11-28 23:15:14,130 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-28 23:15:14,130 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-28 23:15:14,133 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-11-28 23:15:14,134 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_main_#t~nondet3=7} Honda state: {ULTIMATE.start_main_#t~nondet3=7} Generalized eigenvectors: [] Lambdas: [] Nus: [] 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 [2018-11-28 23:15:14,155 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-28 23:15:14,155 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-28 23:15:14,177 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-11-28 23:15:14,178 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 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 [2018-11-28 23:15:14,181 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-28 23:15:14,181 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-28 23:15:14,186 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-11-28 23:15:14,186 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_main_#t~nondet4=4, ULTIMATE.start_main_~d~0=4} Honda state: {ULTIMATE.start_main_#t~nondet4=4, ULTIMATE.start_main_~d~0=4} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 14 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 14 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-28 23:15:14,206 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-28 23:15:14,206 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-28 23:15:14,226 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-11-28 23:15:14,226 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_main_~y~0=1} Honda state: {ULTIMATE.start_main_~y~0=1} Generalized eigenvectors: [] Lambdas: [] Nus: [] 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 [2018-11-28 23:15:14,231 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-28 23:15:14,231 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-28 23:15:14,250 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-11-28 23:15:14,250 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {v_rep~unnamed0~0~false_5=0} Honda state: {v_rep~unnamed0~0~false_5=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] 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 [2018-11-28 23:15:14,256 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-28 23:15:14,256 INFO L163 nArgumentSynthesizer]: Using integer mode. 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 [2018-11-28 23:15:14,278 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2018-11-28 23:15:14,279 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-28 23:15:14,301 INFO L452 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2018-11-28 23:15:14,303 INFO L216 LassoAnalysis]: Preferences: [2018-11-28 23:15:14,303 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-28 23:15:14,303 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-28 23:15:14,303 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-28 23:15:14,303 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-11-28 23:15:14,304 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-28 23:15:14,304 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-28 23:15:14,304 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-28 23:15:14,304 INFO L131 ssoRankerPreferences]: Filename of dumped script: CookSeeZuleger-TACAS2013-Fig7a_true-termination_true-no-overflow.c_Iteration3_Loop [2018-11-28 23:15:14,304 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-28 23:15:14,304 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-11-28 23:15:14,306 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:15:14,332 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:15:14,336 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:15:14,343 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:15:14,348 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:15:14,367 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:15:14,530 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-11-28 23:15:14,531 INFO L497 LassoAnalysis]: Using template 'affine'. [2018-11-28 23:15:14,531 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 23:15:14,534 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:15:14,534 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 23:15:14,535 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:15:14,535 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-11-28 23:15:14,535 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:15:14,536 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-28 23:15:14,536 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 23:15:14,541 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:15:14,541 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 23:15:14,542 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:15:14,542 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:15:14,542 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:15:14,542 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:15:14,546 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-28 23:15:14,546 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 23:15:14,551 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:15:14,551 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 23:15:14,552 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:15:14,552 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 23:15:14,552 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:15:14,552 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:15:14,552 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:15:14,555 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 23:15:14,555 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 23:15:14,559 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:15:14,560 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 23:15:14,560 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:15:14,562 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 23:15:14,562 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:15:14,563 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:15:14,563 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:15:14,563 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 23:15:14,564 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 23:15:14,566 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:15:14,567 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 23:15:14,568 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:15:14,568 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:15:14,568 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:15:14,568 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:15:14,572 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-28 23:15:14,572 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 23:15:14,575 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:15:14,576 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 23:15:14,576 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:15:14,576 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 23:15:14,577 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:15:14,577 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:15:14,577 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:15:14,577 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 23:15:14,580 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 23:15:14,584 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-11-28 23:15:14,587 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2018-11-28 23:15:14,587 INFO L444 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 1 variables to zero. [2018-11-28 23:15:14,587 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-11-28 23:15:14,587 INFO L440 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2018-11-28 23:15:14,588 INFO L518 LassoAnalysis]: Proved termination. [2018-11-28 23:15:14,588 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~x~0) = 1*ULTIMATE.start_main_~x~0 Supporting invariants [] [2018-11-28 23:15:14,588 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2018-11-28 23:15:14,620 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 23:15:14,634 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 23:15:14,635 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 23:15:14,643 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 23:15:14,644 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 23:15:14,656 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 23:15:14,657 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2018-11-28 23:15:14,657 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 11 states and 16 transitions. cyclomatic complexity: 8 Second operand 3 states. [2018-11-28 23:15:14,680 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 11 states and 16 transitions. cyclomatic complexity: 8. Second operand 3 states. Result 13 states and 20 transitions. Complement of second has 5 states. [2018-11-28 23:15:14,682 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 3 states 1 stem states 1 non-accepting loop states 1 accepting loop states [2018-11-28 23:15:14,682 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-28 23:15:14,683 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 6 transitions. [2018-11-28 23:15:14,683 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 6 transitions. Stem has 5 letters. Loop has 2 letters. [2018-11-28 23:15:14,684 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-28 23:15:14,684 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2018-11-28 23:15:14,733 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 23:15:14,742 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 23:15:14,745 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 23:15:14,755 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 23:15:14,756 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 23:15:14,763 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 23:15:14,764 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and with honda bouncer for loop.1 stem predicates 2 loop predicates [2018-11-28 23:15:14,764 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 11 states and 16 transitions. cyclomatic complexity: 8 Second operand 3 states. [2018-11-28 23:15:14,777 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 11 states and 16 transitions. cyclomatic complexity: 8. Second operand 3 states. Result 13 states and 20 transitions. Complement of second has 5 states. [2018-11-28 23:15:14,780 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 3 states 1 stem states 1 non-accepting loop states 1 accepting loop states [2018-11-28 23:15:14,780 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-28 23:15:14,780 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 6 transitions. [2018-11-28 23:15:14,781 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 6 transitions. Stem has 5 letters. Loop has 2 letters. [2018-11-28 23:15:14,781 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-28 23:15:14,781 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2018-11-28 23:15:14,799 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 23:15:14,806 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 23:15:14,807 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 23:15:14,813 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 23:15:14,814 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 23:15:14,827 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 23:15:14,827 INFO L152 lantAutomatonBouncer]: Defining Buchi interpolant automaton with scrooge nondeterminism in stemwith honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2018-11-28 23:15:14,827 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 11 states and 16 transitions. cyclomatic complexity: 8 Second operand 3 states. [2018-11-28 23:15:14,845 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 11 states and 16 transitions. cyclomatic complexity: 8. Second operand 3 states. Result 15 states and 23 transitions. Complement of second has 4 states. [2018-11-28 23:15:14,846 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 3 states 1 stem states 1 non-accepting loop states 1 accepting loop states [2018-11-28 23:15:14,846 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-28 23:15:14,847 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 7 transitions. [2018-11-28 23:15:14,847 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 7 transitions. Stem has 5 letters. Loop has 2 letters. [2018-11-28 23:15:14,847 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-28 23:15:14,848 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 7 transitions. Stem has 7 letters. Loop has 2 letters. [2018-11-28 23:15:14,848 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-28 23:15:14,848 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 7 transitions. Stem has 5 letters. Loop has 4 letters. [2018-11-28 23:15:14,848 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-28 23:15:14,848 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 15 states and 23 transitions. [2018-11-28 23:15:14,851 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2018-11-28 23:15:14,851 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 15 states to 13 states and 19 transitions. [2018-11-28 23:15:14,852 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 5 [2018-11-28 23:15:14,852 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 7 [2018-11-28 23:15:14,852 INFO L73 IsDeterministic]: Start isDeterministic. Operand 13 states and 19 transitions. [2018-11-28 23:15:14,852 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-28 23:15:14,852 INFO L705 BuchiCegarLoop]: Abstraction has 13 states and 19 transitions. [2018-11-28 23:15:14,852 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13 states and 19 transitions. [2018-11-28 23:15:14,853 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13 to 5. [2018-11-28 23:15:14,853 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2018-11-28 23:15:14,853 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 7 transitions. [2018-11-28 23:15:14,853 INFO L728 BuchiCegarLoop]: Abstraction has 5 states and 7 transitions. [2018-11-28 23:15:14,853 INFO L608 BuchiCegarLoop]: Abstraction has 5 states and 7 transitions. [2018-11-28 23:15:14,853 INFO L442 BuchiCegarLoop]: ======== Iteration 4============ [2018-11-28 23:15:14,854 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 5 states and 7 transitions. [2018-11-28 23:15:14,854 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2018-11-28 23:15:14,854 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-28 23:15:14,854 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-28 23:15:14,854 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1] [2018-11-28 23:15:14,854 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2018-11-28 23:15:14,855 INFO L794 eck$LassoCheckResult]: Stem: 272#ULTIMATE.startENTRY havoc main_#res;havoc main_#t~nondet0, main_#t~nondet1, main_#t~nondet2, main_#t~nondet3, main_#t~nondet4, main_#t~nondet5, main_~x~0, main_~y~0, main_~d~0;havoc main_~x~0;havoc main_~y~0;havoc main_~d~0;main_~x~0 := main_#t~nondet0;havoc main_#t~nondet0;main_~y~0 := main_#t~nondet1;havoc main_#t~nondet1;main_~d~0 := main_#t~nondet2;havoc main_#t~nondet2; 269#L21-2 [2018-11-28 23:15:14,855 INFO L796 eck$LassoCheckResult]: Loop: 269#L21-2 assume !!((main_~x~0 > 0 && main_~y~0 > 0) && main_~d~0 > 0); 268#L21 assume !(0 != main_#t~nondet3);havoc main_#t~nondet3;main_~x~0 := main_#t~nondet5;havoc main_#t~nondet5;main_~y~0 := main_~y~0 - 1;main_~d~0 := main_~d~0 - 1; 269#L21-2 [2018-11-28 23:15:14,855 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 23:15:14,855 INFO L82 PathProgramCache]: Analyzing trace with hash 32, now seen corresponding path program 2 times [2018-11-28 23:15:14,855 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 23:15:14,855 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 23:15:14,856 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:15:14,856 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-28 23:15:14,856 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:15:14,858 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 23:15:14,859 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 23:15:14,860 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 23:15:14,860 INFO L82 PathProgramCache]: Analyzing trace with hash 1286, now seen corresponding path program 1 times [2018-11-28 23:15:14,861 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 23:15:14,861 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 23:15:14,862 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:15:14,862 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-28 23:15:14,862 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:15:14,863 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 23:15:14,865 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 23:15:14,866 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 23:15:14,866 INFO L82 PathProgramCache]: Analyzing trace with hash 31077, now seen corresponding path program 3 times [2018-11-28 23:15:14,866 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 23:15:14,867 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 23:15:14,867 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:15:14,868 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 23:15:14,868 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:15:14,870 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 23:15:14,873 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 23:15:14,933 INFO L216 LassoAnalysis]: Preferences: [2018-11-28 23:15:14,933 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-28 23:15:14,933 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-28 23:15:14,934 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-28 23:15:14,934 INFO L127 ssoRankerPreferences]: Use exernal solver: true [2018-11-28 23:15:14,934 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-28 23:15:14,934 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-28 23:15:14,934 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-28 23:15:14,935 INFO L131 ssoRankerPreferences]: Filename of dumped script: CookSeeZuleger-TACAS2013-Fig7a_true-termination_true-no-overflow.c_Iteration4_Loop [2018-11-28 23:15:14,935 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-28 23:15:14,935 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-11-28 23:15:14,938 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:15:14,950 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:15:14,957 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:15:14,960 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:15:14,967 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:15:14,971 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:15:15,082 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-11-28 23:15:15,083 INFO L412 LassoAnalysis]: Checking for nontermination... 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 [2018-11-28 23:15:15,087 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-28 23:15:15,088 INFO L163 nArgumentSynthesizer]: Using integer mode. 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 [2018-11-28 23:15:15,109 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2018-11-28 23:15:15,109 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-28 23:15:15,131 INFO L452 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2018-11-28 23:15:15,133 INFO L216 LassoAnalysis]: Preferences: [2018-11-28 23:15:15,133 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-28 23:15:15,133 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-28 23:15:15,133 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-28 23:15:15,134 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-11-28 23:15:15,134 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-28 23:15:15,134 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-28 23:15:15,134 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-28 23:15:15,134 INFO L131 ssoRankerPreferences]: Filename of dumped script: CookSeeZuleger-TACAS2013-Fig7a_true-termination_true-no-overflow.c_Iteration4_Loop [2018-11-28 23:15:15,134 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-28 23:15:15,134 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-11-28 23:15:15,137 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:15:15,142 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:15:15,152 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:15:15,155 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:15:15,163 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:15:15,173 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:15:15,257 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-11-28 23:15:15,258 INFO L497 LassoAnalysis]: Using template 'affine'. [2018-11-28 23:15:15,258 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 23:15:15,261 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:15:15,261 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 23:15:15,262 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:15:15,262 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:15:15,262 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:15:15,262 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 23:15:15,263 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 23:15:15,268 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-11-28 23:15:15,270 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2018-11-28 23:15:15,270 INFO L444 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 1 variables to zero. [2018-11-28 23:15:15,270 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-11-28 23:15:15,271 INFO L440 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2018-11-28 23:15:15,274 INFO L518 LassoAnalysis]: Proved termination. [2018-11-28 23:15:15,274 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~d~0) = 1*ULTIMATE.start_main_~d~0 Supporting invariants [] [2018-11-28 23:15:15,274 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2018-11-28 23:15:15,352 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 23:15:15,356 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 23:15:15,357 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 23:15:15,367 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 23:15:15,368 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 23:15:15,421 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 23:15:15,421 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2018-11-28 23:15:15,422 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 5 states and 7 transitions. cyclomatic complexity: 3 Second operand 3 states. [2018-11-28 23:15:15,438 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 5 states and 7 transitions. cyclomatic complexity: 3. Second operand 3 states. Result 11 states and 17 transitions. Complement of second has 5 states. [2018-11-28 23:15:15,440 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 3 states 1 stem states 1 non-accepting loop states 1 accepting loop states [2018-11-28 23:15:15,440 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-28 23:15:15,441 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 3 transitions. [2018-11-28 23:15:15,441 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 3 transitions. Stem has 1 letters. Loop has 2 letters. [2018-11-28 23:15:15,441 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-28 23:15:15,441 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 3 transitions. Stem has 3 letters. Loop has 2 letters. [2018-11-28 23:15:15,441 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-28 23:15:15,441 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 3 transitions. Stem has 1 letters. Loop has 4 letters. [2018-11-28 23:15:15,442 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-28 23:15:15,442 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 11 states and 17 transitions. [2018-11-28 23:15:15,443 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2018-11-28 23:15:15,444 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 11 states to 9 states and 13 transitions. [2018-11-28 23:15:15,444 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 4 [2018-11-28 23:15:15,445 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 4 [2018-11-28 23:15:15,445 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 13 transitions. [2018-11-28 23:15:15,445 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-28 23:15:15,445 INFO L705 BuchiCegarLoop]: Abstraction has 9 states and 13 transitions. [2018-11-28 23:15:15,445 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9 states and 13 transitions. [2018-11-28 23:15:15,446 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9 to 8. [2018-11-28 23:15:15,446 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2018-11-28 23:15:15,446 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 12 transitions. [2018-11-28 23:15:15,447 INFO L728 BuchiCegarLoop]: Abstraction has 8 states and 12 transitions. [2018-11-28 23:15:15,447 INFO L608 BuchiCegarLoop]: Abstraction has 8 states and 12 transitions. [2018-11-28 23:15:15,447 INFO L442 BuchiCegarLoop]: ======== Iteration 5============ [2018-11-28 23:15:15,447 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 8 states and 12 transitions. [2018-11-28 23:15:15,447 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2018-11-28 23:15:15,447 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-28 23:15:15,448 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-28 23:15:15,450 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [2, 1, 1] [2018-11-28 23:15:15,450 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2018-11-28 23:15:15,450 INFO L794 eck$LassoCheckResult]: Stem: 318#ULTIMATE.startENTRY havoc main_#res;havoc main_#t~nondet0, main_#t~nondet1, main_#t~nondet2, main_#t~nondet3, main_#t~nondet4, main_#t~nondet5, main_~x~0, main_~y~0, main_~d~0;havoc main_~x~0;havoc main_~y~0;havoc main_~d~0;main_~x~0 := main_#t~nondet0;havoc main_#t~nondet0;main_~y~0 := main_#t~nondet1;havoc main_#t~nondet1;main_~d~0 := main_#t~nondet2;havoc main_#t~nondet2; 319#L21-2 assume !!((main_~x~0 > 0 && main_~y~0 > 0) && main_~d~0 > 0); 320#L21 assume 0 != main_#t~nondet3;havoc main_#t~nondet3;main_~x~0 := main_~x~0 - 1;main_~d~0 := main_#t~nondet4;havoc main_#t~nondet4; 321#L21-2 assume !!((main_~x~0 > 0 && main_~y~0 > 0) && main_~d~0 > 0); 314#L21 [2018-11-28 23:15:15,450 INFO L796 eck$LassoCheckResult]: Loop: 314#L21 assume !(0 != main_#t~nondet3);havoc main_#t~nondet3;main_~x~0 := main_#t~nondet5;havoc main_#t~nondet5;main_~y~0 := main_~y~0 - 1;main_~d~0 := main_~d~0 - 1; 315#L21-2 assume !!((main_~x~0 > 0 && main_~y~0 > 0) && main_~d~0 > 0); 314#L21 [2018-11-28 23:15:15,450 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 23:15:15,450 INFO L82 PathProgramCache]: Analyzing trace with hash 963335, now seen corresponding path program 2 times [2018-11-28 23:15:15,451 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 23:15:15,451 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 23:15:15,452 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:15:15,452 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-28 23:15:15,452 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:15:15,463 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 23:15:15,469 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 23:15:15,474 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 23:15:15,474 INFO L82 PathProgramCache]: Analyzing trace with hash 1436, now seen corresponding path program 2 times [2018-11-28 23:15:15,474 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 23:15:15,474 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 23:15:15,475 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:15:15,476 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-28 23:15:15,477 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:15:15,478 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 23:15:15,484 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 23:15:15,486 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 23:15:15,487 INFO L82 PathProgramCache]: Analyzing trace with hash 925765410, now seen corresponding path program 3 times [2018-11-28 23:15:15,487 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 23:15:15,487 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 23:15:15,488 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:15:15,488 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-28 23:15:15,488 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:15:15,492 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 23:15:15,496 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 23:15:15,606 INFO L216 LassoAnalysis]: Preferences: [2018-11-28 23:15:15,607 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-28 23:15:15,607 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-28 23:15:15,607 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-28 23:15:15,607 INFO L127 ssoRankerPreferences]: Use exernal solver: true [2018-11-28 23:15:15,607 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-28 23:15:15,607 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-28 23:15:15,608 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-28 23:15:15,608 INFO L131 ssoRankerPreferences]: Filename of dumped script: CookSeeZuleger-TACAS2013-Fig7a_true-termination_true-no-overflow.c_Iteration5_Loop [2018-11-28 23:15:15,608 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-28 23:15:15,608 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-11-28 23:15:15,610 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:15:15,641 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:15:15,643 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:15:15,648 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:15:15,651 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:15:15,657 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:15:15,730 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-11-28 23:15:15,730 INFO L412 LassoAnalysis]: Checking for nontermination... 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 [2018-11-28 23:15:15,734 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-28 23:15:15,734 INFO L163 nArgumentSynthesizer]: Using integer mode. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 21 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 21 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-28 23:15:15,758 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2018-11-28 23:15:15,758 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-28 23:15:15,827 INFO L452 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2018-11-28 23:15:15,829 INFO L216 LassoAnalysis]: Preferences: [2018-11-28 23:15:15,830 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-28 23:15:15,830 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-28 23:15:15,830 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-28 23:15:15,830 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-11-28 23:15:15,830 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-28 23:15:15,830 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-28 23:15:15,830 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-28 23:15:15,831 INFO L131 ssoRankerPreferences]: Filename of dumped script: CookSeeZuleger-TACAS2013-Fig7a_true-termination_true-no-overflow.c_Iteration5_Loop [2018-11-28 23:15:15,831 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-28 23:15:15,831 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-11-28 23:15:15,832 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:15:15,839 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:15:15,843 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:15:15,847 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:15:15,850 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:15:15,857 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:15:15,982 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-11-28 23:15:15,983 INFO L497 LassoAnalysis]: Using template 'affine'. [2018-11-28 23:15:15,984 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 23:15:15,985 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:15:15,985 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:15:15,985 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:15:15,985 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:15:15,989 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-28 23:15:15,989 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 23:15:15,992 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:15:15,993 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 23:15:15,993 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:15:15,993 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 23:15:15,993 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:15:15,996 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:15:15,996 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:15:15,998 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 23:15:15,998 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 23:15:16,001 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-11-28 23:15:16,004 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2018-11-28 23:15:16,005 INFO L444 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 1 variables to zero. [2018-11-28 23:15:16,005 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-11-28 23:15:16,005 INFO L440 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2018-11-28 23:15:16,005 INFO L518 LassoAnalysis]: Proved termination. [2018-11-28 23:15:16,005 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~d~0) = 1*ULTIMATE.start_main_~d~0 Supporting invariants [] [2018-11-28 23:15:16,006 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2018-11-28 23:15:16,050 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 23:15:16,057 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 23:15:16,058 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 23:15:16,062 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 23:15:16,063 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 23:15:16,086 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 23:15:16,087 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2018-11-28 23:15:16,087 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 8 states and 12 transitions. cyclomatic complexity: 6 Second operand 3 states. [2018-11-28 23:15:16,114 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 8 states and 12 transitions. cyclomatic complexity: 6. Second operand 3 states. Result 10 states and 14 transitions. Complement of second has 5 states. [2018-11-28 23:15:16,115 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 3 states 1 stem states 1 non-accepting loop states 1 accepting loop states [2018-11-28 23:15:16,115 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-28 23:15:16,116 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 4 transitions. [2018-11-28 23:15:16,116 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 4 transitions. Stem has 4 letters. Loop has 2 letters. [2018-11-28 23:15:16,116 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-28 23:15:16,116 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2018-11-28 23:15:16,134 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 23:15:16,140 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 23:15:16,141 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 23:15:16,154 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 23:15:16,155 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 23:15:16,180 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 23:15:16,180 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and with honda bouncer for loop.1 stem predicates 2 loop predicates [2018-11-28 23:15:16,181 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 8 states and 12 transitions. cyclomatic complexity: 6 Second operand 3 states. [2018-11-28 23:15:16,200 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 8 states and 12 transitions. cyclomatic complexity: 6. Second operand 3 states. Result 10 states and 14 transitions. Complement of second has 5 states. [2018-11-28 23:15:16,201 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 3 states 1 stem states 1 non-accepting loop states 1 accepting loop states [2018-11-28 23:15:16,201 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-28 23:15:16,201 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 4 transitions. [2018-11-28 23:15:16,201 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 4 transitions. Stem has 4 letters. Loop has 2 letters. [2018-11-28 23:15:16,201 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-28 23:15:16,202 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2018-11-28 23:15:16,214 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 23:15:16,219 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 23:15:16,220 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 23:15:16,246 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 23:15:16,247 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 23:15:16,276 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 23:15:16,276 INFO L152 lantAutomatonBouncer]: Defining Buchi interpolant automaton with scrooge nondeterminism in stemwith honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2018-11-28 23:15:16,277 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 8 states and 12 transitions. cyclomatic complexity: 6 Second operand 3 states. [2018-11-28 23:15:16,298 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 8 states and 12 transitions. cyclomatic complexity: 6. Second operand 3 states. Result 13 states and 19 transitions. Complement of second has 4 states. [2018-11-28 23:15:16,299 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 3 states 1 stem states 1 non-accepting loop states 1 accepting loop states [2018-11-28 23:15:16,299 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-28 23:15:16,299 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 7 transitions. [2018-11-28 23:15:16,299 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 7 transitions. Stem has 4 letters. Loop has 2 letters. [2018-11-28 23:15:16,300 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-28 23:15:16,300 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 7 transitions. Stem has 6 letters. Loop has 2 letters. [2018-11-28 23:15:16,300 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-28 23:15:16,300 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 7 transitions. Stem has 4 letters. Loop has 4 letters. [2018-11-28 23:15:16,300 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-28 23:15:16,301 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 13 states and 19 transitions. [2018-11-28 23:15:16,301 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 7 [2018-11-28 23:15:16,302 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 13 states to 11 states and 16 transitions. [2018-11-28 23:15:16,302 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 3 [2018-11-28 23:15:16,302 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 3 [2018-11-28 23:15:16,302 INFO L73 IsDeterministic]: Start isDeterministic. Operand 11 states and 16 transitions. [2018-11-28 23:15:16,302 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-28 23:15:16,302 INFO L705 BuchiCegarLoop]: Abstraction has 11 states and 16 transitions. [2018-11-28 23:15:16,303 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11 states and 16 transitions. [2018-11-28 23:15:16,306 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11 to 7. [2018-11-28 23:15:16,307 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2018-11-28 23:15:16,307 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 10 transitions. [2018-11-28 23:15:16,307 INFO L728 BuchiCegarLoop]: Abstraction has 7 states and 10 transitions. [2018-11-28 23:15:16,307 INFO L608 BuchiCegarLoop]: Abstraction has 7 states and 10 transitions. [2018-11-28 23:15:16,307 INFO L442 BuchiCegarLoop]: ======== Iteration 6============ [2018-11-28 23:15:16,307 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 7 states and 10 transitions. [2018-11-28 23:15:16,308 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2018-11-28 23:15:16,308 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-28 23:15:16,308 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-28 23:15:16,310 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [2, 1, 1] [2018-11-28 23:15:16,310 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [2, 1, 1] [2018-11-28 23:15:16,310 INFO L794 eck$LassoCheckResult]: Stem: 445#ULTIMATE.startENTRY havoc main_#res;havoc main_#t~nondet0, main_#t~nondet1, main_#t~nondet2, main_#t~nondet3, main_#t~nondet4, main_#t~nondet5, main_~x~0, main_~y~0, main_~d~0;havoc main_~x~0;havoc main_~y~0;havoc main_~d~0;main_~x~0 := main_#t~nondet0;havoc main_#t~nondet0;main_~y~0 := main_#t~nondet1;havoc main_#t~nondet1;main_~d~0 := main_#t~nondet2;havoc main_#t~nondet2; 446#L21-2 assume !!((main_~x~0 > 0 && main_~y~0 > 0) && main_~d~0 > 0); 443#L21 assume 0 != main_#t~nondet3;havoc main_#t~nondet3;main_~x~0 := main_~x~0 - 1;main_~d~0 := main_#t~nondet4;havoc main_#t~nondet4; 444#L21-2 assume !!((main_~x~0 > 0 && main_~y~0 > 0) && main_~d~0 > 0); 441#L21 [2018-11-28 23:15:16,310 INFO L796 eck$LassoCheckResult]: Loop: 441#L21 assume !(0 != main_#t~nondet3);havoc main_#t~nondet3;main_~x~0 := main_#t~nondet5;havoc main_#t~nondet5;main_~y~0 := main_~y~0 - 1;main_~d~0 := main_~d~0 - 1; 442#L21-2 assume !!((main_~x~0 > 0 && main_~y~0 > 0) && main_~d~0 > 0); 443#L21 assume 0 != main_#t~nondet3;havoc main_#t~nondet3;main_~x~0 := main_~x~0 - 1;main_~d~0 := main_#t~nondet4;havoc main_#t~nondet4; 444#L21-2 assume !!((main_~x~0 > 0 && main_~y~0 > 0) && main_~d~0 > 0); 441#L21 [2018-11-28 23:15:16,310 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 23:15:16,311 INFO L82 PathProgramCache]: Analyzing trace with hash 963335, now seen corresponding path program 3 times [2018-11-28 23:15:16,311 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 23:15:16,311 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 23:15:16,315 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:15:16,316 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-28 23:15:16,316 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:15:16,319 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 23:15:16,323 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 23:15:16,325 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 23:15:16,326 INFO L82 PathProgramCache]: Analyzing trace with hash 1380409, now seen corresponding path program 1 times [2018-11-28 23:15:16,326 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 23:15:16,326 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 23:15:16,328 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:15:16,328 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-28 23:15:16,328 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:15:16,330 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 23:15:16,337 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 23:15:16,342 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 23:15:16,342 INFO L82 PathProgramCache]: Analyzing trace with hash 602329151, now seen corresponding path program 4 times [2018-11-28 23:15:16,342 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 23:15:16,342 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 23:15:16,343 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:15:16,344 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 23:15:16,346 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:15:16,353 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 23:15:16,364 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 23:15:16,464 INFO L216 LassoAnalysis]: Preferences: [2018-11-28 23:15:16,464 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-28 23:15:16,464 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-28 23:15:16,465 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-28 23:15:16,465 INFO L127 ssoRankerPreferences]: Use exernal solver: true [2018-11-28 23:15:16,465 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-28 23:15:16,465 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-28 23:15:16,465 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-28 23:15:16,465 INFO L131 ssoRankerPreferences]: Filename of dumped script: CookSeeZuleger-TACAS2013-Fig7a_true-termination_true-no-overflow.c_Iteration6_Loop [2018-11-28 23:15:16,466 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-28 23:15:16,466 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-11-28 23:15:16,469 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:15:16,481 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:15:16,484 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:15:16,507 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:15:16,534 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:15:16,543 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:15:16,632 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-11-28 23:15:16,633 INFO L412 LassoAnalysis]: Checking for nontermination... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 22 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 22 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-28 23:15:16,636 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-28 23:15:16,637 INFO L163 nArgumentSynthesizer]: Using integer mode. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 23 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 23 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-28 23:15:16,660 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2018-11-28 23:15:16,660 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-28 23:15:16,714 INFO L452 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2018-11-28 23:15:16,716 INFO L216 LassoAnalysis]: Preferences: [2018-11-28 23:15:16,716 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-28 23:15:16,716 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-28 23:15:16,716 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-28 23:15:16,717 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-11-28 23:15:16,717 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-28 23:15:16,717 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-28 23:15:16,717 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-28 23:15:16,717 INFO L131 ssoRankerPreferences]: Filename of dumped script: CookSeeZuleger-TACAS2013-Fig7a_true-termination_true-no-overflow.c_Iteration6_Loop [2018-11-28 23:15:16,717 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-28 23:15:16,717 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-11-28 23:15:16,719 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:15:16,724 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:15:16,728 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:15:16,742 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:15:16,754 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:15:16,757 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:15:16,847 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-11-28 23:15:16,848 INFO L497 LassoAnalysis]: Using template 'affine'. [2018-11-28 23:15:16,848 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 23:15:16,849 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:15:16,849 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 23:15:16,850 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:15:16,850 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:15:16,850 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:15:16,850 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 23:15:16,850 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 23:15:16,854 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-11-28 23:15:16,858 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2018-11-28 23:15:16,858 INFO L444 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 1 variables to zero. [2018-11-28 23:15:16,858 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-11-28 23:15:16,858 INFO L440 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2018-11-28 23:15:16,859 INFO L518 LassoAnalysis]: Proved termination. [2018-11-28 23:15:16,861 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~y~0) = 1*ULTIMATE.start_main_~y~0 Supporting invariants [] [2018-11-28 23:15:16,862 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2018-11-28 23:15:16,875 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 23:15:16,882 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 23:15:16,883 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 23:15:16,888 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 23:15:16,890 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 23:15:16,918 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 23:15:16,919 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 [2018-11-28 23:15:16,919 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 7 states and 10 transitions. cyclomatic complexity: 4 Second operand 4 states. [2018-11-28 23:15:16,946 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 7 states and 10 transitions. cyclomatic complexity: 4. Second operand 4 states. Result 20 states and 29 transitions. Complement of second has 6 states. [2018-11-28 23:15:16,946 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2018-11-28 23:15:16,947 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2018-11-28 23:15:16,947 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 8 transitions. [2018-11-28 23:15:16,947 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 8 transitions. Stem has 4 letters. Loop has 4 letters. [2018-11-28 23:15:16,947 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-28 23:15:16,947 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 8 transitions. Stem has 8 letters. Loop has 4 letters. [2018-11-28 23:15:16,948 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-28 23:15:16,948 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 8 transitions. Stem has 4 letters. Loop has 8 letters. [2018-11-28 23:15:16,948 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-28 23:15:16,948 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 20 states and 29 transitions. [2018-11-28 23:15:16,949 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2018-11-28 23:15:16,949 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 20 states to 0 states and 0 transitions. [2018-11-28 23:15:16,950 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2018-11-28 23:15:16,950 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2018-11-28 23:15:16,950 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2018-11-28 23:15:16,950 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-28 23:15:16,950 INFO L705 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-28 23:15:16,950 INFO L728 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-28 23:15:16,950 INFO L608 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-28 23:15:16,950 INFO L442 BuchiCegarLoop]: ======== Iteration 7============ [2018-11-28 23:15:16,951 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2018-11-28 23:15:16,951 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2018-11-28 23:15:16,951 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2018-11-28 23:15:16,959 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 28.11 11:15:16 BoogieIcfgContainer [2018-11-28 23:15:16,959 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2018-11-28 23:15:16,959 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-11-28 23:15:16,959 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-11-28 23:15:16,959 INFO L276 PluginConnector]: Witness Printer initialized [2018-11-28 23:15:16,960 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 11:15:10" (3/4) ... [2018-11-28 23:15:16,964 INFO L147 WitnessPrinter]: No result that supports witness generation found [2018-11-28 23:15:16,964 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-11-28 23:15:16,965 INFO L168 Benchmark]: Toolchain (without parser) took 7147.67 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 201.3 MB). Free memory was 948.7 MB in the beginning and 1.0 GB in the end (delta: -85.9 MB). Peak memory consumption was 115.5 MB. Max. memory is 11.5 GB. [2018-11-28 23:15:16,966 INFO L168 Benchmark]: CDTParser took 0.22 ms. Allocated memory is still 1.0 GB. Free memory is still 978.2 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-28 23:15:16,967 INFO L168 Benchmark]: CACSL2BoogieTranslator took 311.79 ms. Allocated memory is still 1.0 GB. Free memory was 948.7 MB in the beginning and 937.9 MB in the end (delta: 10.7 MB). Peak memory consumption was 10.7 MB. Max. memory is 11.5 GB. [2018-11-28 23:15:16,968 INFO L168 Benchmark]: Boogie Procedure Inliner took 40.26 ms. Allocated memory is still 1.0 GB. Free memory is still 937.9 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-28 23:15:16,968 INFO L168 Benchmark]: Boogie Preprocessor took 29.10 ms. Allocated memory is still 1.0 GB. Free memory is still 937.9 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-28 23:15:16,969 INFO L168 Benchmark]: RCFGBuilder took 313.82 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 130.0 MB). Free memory was 937.9 MB in the beginning and 1.1 GB in the end (delta: -177.1 MB). Peak memory consumption was 24.9 MB. Max. memory is 11.5 GB. [2018-11-28 23:15:16,970 INFO L168 Benchmark]: BuchiAutomizer took 6442.10 ms. Allocated memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 71.3 MB). Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 80.5 MB). Peak memory consumption was 151.8 MB. Max. memory is 11.5 GB. [2018-11-28 23:15:16,971 INFO L168 Benchmark]: Witness Printer took 5.22 ms. Allocated memory is still 1.2 GB. Free memory is still 1.0 GB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-28 23:15:16,975 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.22 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 311.79 ms. Allocated memory is still 1.0 GB. Free memory was 948.7 MB in the beginning and 937.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 40.26 ms. Allocated memory is still 1.0 GB. Free memory is still 937.9 MB. There was no memory consumed. Max. memory is 11.5 GB. * Boogie Preprocessor took 29.10 ms. Allocated memory is still 1.0 GB. Free memory is still 937.9 MB. There was no memory consumed. Max. memory is 11.5 GB. * RCFGBuilder took 313.82 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 130.0 MB). Free memory was 937.9 MB in the beginning and 1.1 GB in the end (delta: -177.1 MB). Peak memory consumption was 24.9 MB. Max. memory is 11.5 GB. * BuchiAutomizer took 6442.10 ms. Allocated memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 71.3 MB). Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 80.5 MB). Peak memory consumption was 151.8 MB. Max. memory is 11.5 GB. * Witness Printer took 5.22 ms. Allocated memory is still 1.2 GB. Free memory is still 1.0 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 6 terminating modules (0 trivial, 4 deterministic, 2 nondeterministic). One deterministic module has affine ranking function x and consists of 5 locations. One deterministic module has affine ranking function x and consists of 3 locations. One deterministic module has affine ranking function d and consists of 3 locations. One deterministic module has affine ranking function y and consists of 4 locations. One nondeterministic module has affine ranking function x and consists of 3 locations. One nondeterministic module has affine ranking function d and consists of 3 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 6.3s and 7 iterations. TraceHistogramMax:2. Analysis of lassos took 4.9s. Construction of modules took 0.1s. Büchi inclusion checks took 1.1s. Highest rank in rank-based complementation 3. Minimization of det autom 1. Minimization of nondet autom 5. Automata minimization 0.0s AutomataMinimizationTime, 5 MinimizatonAttempts, 13 StatesRemovedByMinimization, 3 NontrivialMinimizations. Non-live state removal took 0.0s Buchi closure took 0.0s. Biggest automaton had 11 states and ocurred in iteration 2. Nontrivial modules had stage [4, 0, 2, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 2/2 HoareTripleCheckerStatistics: 41 SDtfs, 27 SDslu, 8 SDs, 0 SdLazy, 57 SolverSat, 22 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.1s Time LassoAnalysisResults: nont0 unkn0 SFLI0 SFLT6 conc0 concLT0 SILN0 SILU0 SILI0 SILT0 lasso0 LassoPreprocessingBenchmarks: Lassos: inital25 mio100 ax147 hnf100 lsp27 ukn100 mio100 lsp100 div100 bol100 ite100 ukn100 eq157 hnf93 smp100 dnf100 smp100 tf113 neg100 sie112 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 0 Time: 16ms VariablesStem: 1 VariablesLoop: 0 DisjunctsStem: 1 DisjunctsLoop: 1 SupportingInvariants: 2 MotzkinApplications: 6 LassoTerminationAnalysisBenchmarks: LassoNonterminationAnalysisSatFixpoint: 10 LassoNonterminationAnalysisSatUnbounded: 0 LassoNonterminationAnalysisUnsat: 6 LassoNonterminationAnalysisUnknown: 0 LassoNonterminationAnalysisTime: 0.5s - TerminationAnalysisResult: Termination proven Buchi Automizer proved that your program is terminating RESULT: Ultimate proved your program to be correct! Received shutdown request...