./Ultimate.py --spec /storage/repos/svcomp/c/properties/termination.prp --file /storage/repos/svcomp/c/termination-crafted-lit/PodelskiRybalchenko-TACAS2011-Fig4_true-termination_true-no-overflow.c --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for termination Using default analysis Version 2e94e6aa Calling Ultimate with: java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx12G -Xms1G -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerTermination.xml -i /storage/repos/svcomp/c/termination-crafted-lit/PodelskiRybalchenko-TACAS2011-Fig4_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 e09e2fe0d9f978fd259d1d805e514754ab2def67 ........................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................ Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.24-2e94e6a [2019-01-01 21:34:43,413 INFO L170 SettingsManager]: Resetting all preferences to default values... [2019-01-01 21:34:43,415 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2019-01-01 21:34:43,428 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-01-01 21:34:43,428 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-01-01 21:34:43,429 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-01-01 21:34:43,431 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-01-01 21:34:43,433 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2019-01-01 21:34:43,434 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-01-01 21:34:43,435 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-01-01 21:34:43,436 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-01-01 21:34:43,437 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-01-01 21:34:43,438 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-01-01 21:34:43,439 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-01-01 21:34:43,440 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-01-01 21:34:43,441 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-01-01 21:34:43,442 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-01-01 21:34:43,444 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-01-01 21:34:43,446 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2019-01-01 21:34:43,448 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-01-01 21:34:43,450 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-01-01 21:34:43,451 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-01-01 21:34:43,454 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-01-01 21:34:43,455 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-01-01 21:34:43,455 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-01-01 21:34:43,456 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-01-01 21:34:43,458 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-01-01 21:34:43,459 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-01-01 21:34:43,459 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2019-01-01 21:34:43,461 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-01-01 21:34:43,461 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2019-01-01 21:34:43,462 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-01-01 21:34:43,462 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-01-01 21:34:43,462 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2019-01-01 21:34:43,463 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2019-01-01 21:34:43,464 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2019-01-01 21:34:43,465 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-64bit-Automizer_Default.epf [2019-01-01 21:34:43,488 INFO L110 SettingsManager]: Loading preferences was successful [2019-01-01 21:34:43,489 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2019-01-01 21:34:43,490 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-01-01 21:34:43,490 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2019-01-01 21:34:43,490 INFO L133 SettingsManager]: * Use SBE=true [2019-01-01 21:34:43,490 INFO L131 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2019-01-01 21:34:43,491 INFO L133 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2019-01-01 21:34:43,491 INFO L133 SettingsManager]: * Use old map elimination=false [2019-01-01 21:34:43,491 INFO L133 SettingsManager]: * Use external solver (rank synthesis)=false [2019-01-01 21:34:43,491 INFO L133 SettingsManager]: * Use only trivial implications for array writes=true [2019-01-01 21:34:43,491 INFO L133 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2019-01-01 21:34:43,492 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-01-01 21:34:43,495 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2019-01-01 21:34:43,495 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2019-01-01 21:34:43,495 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2019-01-01 21:34:43,495 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2019-01-01 21:34:43,495 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2019-01-01 21:34:43,496 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2019-01-01 21:34:43,496 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2019-01-01 21:34:43,496 INFO L133 SettingsManager]: * Assume nondeterminstic values are in range=false [2019-01-01 21:34:43,496 INFO L133 SettingsManager]: * Use constant arrays=true [2019-01-01 21:34:43,496 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2019-01-01 21:34:43,496 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-01-01 21:34:43,499 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-01-01 21:34:43,500 INFO L133 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2019-01-01 21:34:43,500 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-01-01 21:34:43,501 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2019-01-01 21:34:43,501 INFO L133 SettingsManager]: * Dump automata to the following directory=/home/matthias/ultimate/dump/auto [2019-01-01 21:34:43,502 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2019-01-01 21:34:43,502 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 -> e09e2fe0d9f978fd259d1d805e514754ab2def67 [2019-01-01 21:34:43,561 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-01-01 21:34:43,579 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-01-01 21:34:43,585 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-01-01 21:34:43,587 INFO L271 PluginConnector]: Initializing CDTParser... [2019-01-01 21:34:43,588 INFO L276 PluginConnector]: CDTParser initialized [2019-01-01 21:34:43,588 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/svcomp/c/termination-crafted-lit/PodelskiRybalchenko-TACAS2011-Fig4_true-termination_true-no-overflow.c [2019-01-01 21:34:43,665 INFO L221 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7b08c4ed5/0b3a2084f5734e81ae99b915d3877a78/FLAGa96e4f127 [2019-01-01 21:34:44,145 INFO L307 CDTParser]: Found 1 translation units. [2019-01-01 21:34:44,145 INFO L161 CDTParser]: Scanning /storage/repos/svcomp/c/termination-crafted-lit/PodelskiRybalchenko-TACAS2011-Fig4_true-termination_true-no-overflow.c [2019-01-01 21:34:44,155 INFO L355 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7b08c4ed5/0b3a2084f5734e81ae99b915d3877a78/FLAGa96e4f127 [2019-01-01 21:34:44,468 INFO L363 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7b08c4ed5/0b3a2084f5734e81ae99b915d3877a78 [2019-01-01 21:34:44,473 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-01-01 21:34:44,474 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-01-01 21:34:44,476 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-01-01 21:34:44,476 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-01-01 21:34:44,480 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2019-01-01 21:34:44,481 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 01.01 09:34:44" (1/1) ... [2019-01-01 21:34:44,484 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3f67e5e7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 09:34:44, skipping insertion in model container [2019-01-01 21:34:44,484 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 01.01 09:34:44" (1/1) ... [2019-01-01 21:34:44,493 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-01-01 21:34:44,511 INFO L176 MainTranslator]: Built tables and reachable declarations [2019-01-01 21:34:44,695 INFO L204 PostProcessor]: Analyzing one entry point: main [2019-01-01 21:34:44,702 INFO L191 MainTranslator]: Completed pre-run [2019-01-01 21:34:44,723 INFO L204 PostProcessor]: Analyzing one entry point: main [2019-01-01 21:34:44,740 INFO L195 MainTranslator]: Completed translation [2019-01-01 21:34:44,741 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 09:34:44 WrapperNode [2019-01-01 21:34:44,741 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-01-01 21:34:44,743 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-01-01 21:34:44,743 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-01-01 21:34:44,743 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2019-01-01 21:34:44,754 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 09:34:44" (1/1) ... [2019-01-01 21:34:44,761 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 09:34:44" (1/1) ... [2019-01-01 21:34:44,786 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-01-01 21:34:44,789 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-01-01 21:34:44,789 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-01-01 21:34:44,789 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2019-01-01 21:34:44,801 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 09:34:44" (1/1) ... [2019-01-01 21:34:44,802 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 09:34:44" (1/1) ... [2019-01-01 21:34:44,802 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 09:34:44" (1/1) ... [2019-01-01 21:34:44,804 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 09:34:44" (1/1) ... [2019-01-01 21:34:44,806 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 09:34:44" (1/1) ... [2019-01-01 21:34:44,812 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 09:34:44" (1/1) ... [2019-01-01 21:34:44,815 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 09:34:44" (1/1) ... [2019-01-01 21:34:44,817 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-01-01 21:34:44,817 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-01-01 21:34:44,818 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-01-01 21:34:44,818 INFO L276 PluginConnector]: RCFGBuilder initialized [2019-01-01 21:34:44,819 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 09:34:44" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-01 21:34:44,956 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-01-01 21:34:44,957 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-01-01 21:34:45,133 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-01-01 21:34:45,134 INFO L280 CfgBuilder]: Removed 5 assue(true) statements. [2019-01-01 21:34:45,135 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 01.01 09:34:45 BoogieIcfgContainer [2019-01-01 21:34:45,135 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-01-01 21:34:45,136 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2019-01-01 21:34:45,136 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2019-01-01 21:34:45,141 INFO L276 PluginConnector]: BuchiAutomizer initialized [2019-01-01 21:34:45,142 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-01-01 21:34:45,142 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 01.01 09:34:44" (1/3) ... [2019-01-01 21:34:45,143 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@1de3491f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 01.01 09:34:45, skipping insertion in model container [2019-01-01 21:34:45,143 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-01-01 21:34:45,144 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 09:34:44" (2/3) ... [2019-01-01 21:34:45,144 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@1de3491f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 01.01 09:34:45, skipping insertion in model container [2019-01-01 21:34:45,144 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-01-01 21:34:45,144 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 01.01 09:34:45" (3/3) ... [2019-01-01 21:34:45,147 INFO L375 chiAutomizerObserver]: Analyzing ICFG PodelskiRybalchenko-TACAS2011-Fig4_true-termination_true-no-overflow.c [2019-01-01 21:34:45,208 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2019-01-01 21:34:45,209 INFO L374 BuchiCegarLoop]: Interprodecural is true [2019-01-01 21:34:45,209 INFO L375 BuchiCegarLoop]: Hoare is false [2019-01-01 21:34:45,209 INFO L376 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2019-01-01 21:34:45,209 INFO L377 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2019-01-01 21:34:45,209 INFO L378 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-01-01 21:34:45,209 INFO L379 BuchiCegarLoop]: Difference is false [2019-01-01 21:34:45,209 INFO L380 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-01-01 21:34:45,210 INFO L383 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2019-01-01 21:34:45,224 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 7 states. [2019-01-01 21:34:45,246 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2019-01-01 21:34:45,247 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-01 21:34:45,247 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-01 21:34:45,255 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1] [2019-01-01 21:34:45,255 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2019-01-01 21:34:45,255 INFO L442 BuchiCegarLoop]: ======== Iteration 1============ [2019-01-01 21:34:45,255 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 7 states. [2019-01-01 21:34:45,256 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2019-01-01 21:34:45,257 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-01 21:34:45,257 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-01 21:34:45,257 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1] [2019-01-01 21:34:45,257 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2019-01-01 21:34:45,265 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_~x~0, main_~y~0;havoc main_~x~0;havoc main_~y~0;main_~x~0 := main_#t~nondet0;havoc main_#t~nondet0;main_~y~0 := main_#t~nondet1;havoc main_#t~nondet1; 5#L18-2true [2019-01-01 21:34:45,266 INFO L796 eck$LassoCheckResult]: Loop: 5#L18-2true assume !!(main_~x~0 > 0 && main_~y~0 > 0); 7#L18true assume 0 != main_#t~nondet2;havoc main_#t~nondet2;main_~x~0 := main_~x~0 - 1;main_~y~0 := main_#t~nondet3;havoc main_#t~nondet3; 5#L18-2true [2019-01-01 21:34:45,272 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 21:34:45,272 INFO L82 PathProgramCache]: Analyzing trace with hash 32, now seen corresponding path program 1 times [2019-01-01 21:34:45,274 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 21:34:45,275 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 21:34:45,332 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:34:45,332 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 21:34:45,332 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:34:45,356 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 21:34:45,360 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 21:34:45,381 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 21:34:45,381 INFO L82 PathProgramCache]: Analyzing trace with hash 1284, now seen corresponding path program 1 times [2019-01-01 21:34:45,381 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 21:34:45,382 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 21:34:45,384 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:34:45,384 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 21:34:45,385 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:34:45,391 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 21:34:45,396 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 21:34:45,399 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 21:34:45,400 INFO L82 PathProgramCache]: Analyzing trace with hash 31075, now seen corresponding path program 1 times [2019-01-01 21:34:45,400 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 21:34:45,400 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 21:34:45,402 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:34:45,402 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 21:34:45,403 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:34:45,414 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 21:34:45,423 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 21:34:45,599 WARN L181 SmtUtils]: Spent 165.00 ms on a formula simplification that was a NOOP. DAG size: 16 [2019-01-01 21:34:45,690 INFO L216 LassoAnalysis]: Preferences: [2019-01-01 21:34:45,691 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-01-01 21:34:45,691 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-01-01 21:34:45,691 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-01-01 21:34:45,692 INFO L127 ssoRankerPreferences]: Use exernal solver: true [2019-01-01 21:34:45,692 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-01 21:34:45,692 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-01-01 21:34:45,692 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-01-01 21:34:45,692 INFO L131 ssoRankerPreferences]: Filename of dumped script: PodelskiRybalchenko-TACAS2011-Fig4_true-termination_true-no-overflow.c_Iteration1_Loop [2019-01-01 21:34:45,693 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-01-01 21:34:45,693 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2019-01-01 21:34:45,724 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:34:45,740 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:34:45,753 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:34:45,762 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:34:45,789 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:34:46,211 INFO L300 LassoAnalysis]: Preprocessing complete. [2019-01-01 21:34:46,212 INFO L412 LassoAnalysis]: Checking for nontermination... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-01 21:34:46,218 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-01 21:34:46,218 INFO L163 nArgumentSynthesizer]: Using integer mode. [2019-01-01 21:34:46,245 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2019-01-01 21:34:46,245 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: [] [MP z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (2)] Exception during sending of exit command (exit): Broken pipe No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-01 21:34:46,254 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-01 21:34:46,254 INFO L163 nArgumentSynthesizer]: Using integer mode. [2019-01-01 21:34:46,277 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2019-01-01 21:34:46,277 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {v_rep~unnamed0~0~false_1=0} Honda state: {v_rep~unnamed0~0~false_1=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-01 21:34:46,282 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-01 21:34:46,283 INFO L163 nArgumentSynthesizer]: Using integer mode. [2019-01-01 21:34:46,288 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2019-01-01 21:34:46,288 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_main_#t~nondet2=7} Honda state: {ULTIMATE.start_main_#t~nondet2=7} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-01 21:34:46,310 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-01 21:34:46,310 INFO L163 nArgumentSynthesizer]: Using integer mode. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 6 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-01 21:34:46,359 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2019-01-01 21:34:46,359 INFO L163 nArgumentSynthesizer]: Using integer mode. [2019-01-01 21:34:46,384 INFO L452 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2019-01-01 21:34:46,386 INFO L216 LassoAnalysis]: Preferences: [2019-01-01 21:34:46,386 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-01-01 21:34:46,386 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-01-01 21:34:46,386 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-01-01 21:34:46,386 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2019-01-01 21:34:46,387 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-01 21:34:46,387 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-01-01 21:34:46,387 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-01-01 21:34:46,387 INFO L131 ssoRankerPreferences]: Filename of dumped script: PodelskiRybalchenko-TACAS2011-Fig4_true-termination_true-no-overflow.c_Iteration1_Loop [2019-01-01 21:34:46,387 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-01-01 21:34:46,390 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2019-01-01 21:34:46,393 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:34:46,422 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:34:46,431 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:34:46,436 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:34:46,473 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:34:46,740 INFO L300 LassoAnalysis]: Preprocessing complete. [2019-01-01 21:34:46,746 INFO L497 LassoAnalysis]: Using template 'affine'. [2019-01-01 21:34:46,748 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 21:34:46,750 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:34:46,750 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:34:46,750 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:34:46,751 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:34:46,755 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-01 21:34:46,756 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-01 21:34:46,766 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 21:34:46,767 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 21:34:46,767 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:34:46,768 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:34:46,768 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:34:46,768 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:34:46,771 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-01 21:34:46,771 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-01 21:34:46,781 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 21:34:46,781 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 21:34:46,782 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:34:46,782 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 21:34:46,783 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:34:46,783 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2019-01-01 21:34:46,783 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:34:46,784 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2019-01-01 21:34:46,785 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 21:34:46,792 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 21:34:46,792 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 21:34:46,793 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:34:46,793 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 21:34:46,794 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:34:46,794 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:34:46,794 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:34:46,795 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 21:34:46,795 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 21:34:46,801 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-01-01 21:34:46,806 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2019-01-01 21:34:46,806 INFO L444 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 1 variables to zero. [2019-01-01 21:34:46,809 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-01-01 21:34:46,809 INFO L440 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2019-01-01 21:34:46,810 INFO L518 LassoAnalysis]: Proved termination. [2019-01-01 21:34:46,810 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~x~0) = 1*ULTIMATE.start_main_~x~0 Supporting invariants [] [2019-01-01 21:34:46,812 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2019-01-01 21:34:46,917 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 21:34:46,926 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 21:34:46,930 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-01 21:34:46,940 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 21:34:46,942 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-01 21:34:47,102 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-01 21:34:47,123 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2019-01-01 21:34:47,125 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 7 states. Second operand 3 states. [2019-01-01 21:34:47,339 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 7 states.. Second operand 3 states. Result 28 states and 35 transitions. Complement of second has 7 states. [2019-01-01 21:34:47,342 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 [2019-01-01 21:34:47,346 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2019-01-01 21:34:47,348 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 18 transitions. [2019-01-01 21:34:47,351 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 18 transitions. Stem has 1 letters. Loop has 2 letters. [2019-01-01 21:34:47,354 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-01 21:34:47,355 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 18 transitions. Stem has 3 letters. Loop has 2 letters. [2019-01-01 21:34:47,355 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-01 21:34:47,356 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 18 transitions. Stem has 1 letters. Loop has 4 letters. [2019-01-01 21:34:47,357 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-01 21:34:47,358 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 28 states and 35 transitions. [2019-01-01 21:34:47,362 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2019-01-01 21:34:47,366 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 28 states to 8 states and 11 transitions. [2019-01-01 21:34:47,367 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 4 [2019-01-01 21:34:47,368 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 5 [2019-01-01 21:34:47,368 INFO L73 IsDeterministic]: Start isDeterministic. Operand 8 states and 11 transitions. [2019-01-01 21:34:47,369 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-01-01 21:34:47,369 INFO L705 BuchiCegarLoop]: Abstraction has 8 states and 11 transitions. [2019-01-01 21:34:47,385 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8 states and 11 transitions. [2019-01-01 21:34:47,394 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8 to 7. [2019-01-01 21:34:47,394 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2019-01-01 21:34:47,395 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 10 transitions. [2019-01-01 21:34:47,396 INFO L728 BuchiCegarLoop]: Abstraction has 7 states and 10 transitions. [2019-01-01 21:34:47,396 INFO L608 BuchiCegarLoop]: Abstraction has 7 states and 10 transitions. [2019-01-01 21:34:47,396 INFO L442 BuchiCegarLoop]: ======== Iteration 2============ [2019-01-01 21:34:47,397 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 7 states and 10 transitions. [2019-01-01 21:34:47,397 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2019-01-01 21:34:47,398 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-01 21:34:47,398 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-01 21:34:47,398 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2019-01-01 21:34:47,398 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2019-01-01 21:34:47,399 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_~x~0, main_~y~0;havoc main_~x~0;havoc main_~y~0;main_~x~0 := main_#t~nondet0;havoc main_#t~nondet0;main_~y~0 := main_#t~nondet1;havoc main_#t~nondet1; 72#L18-2 assume !!(main_~x~0 > 0 && main_~y~0 > 0); 74#L18 [2019-01-01 21:34:47,399 INFO L796 eck$LassoCheckResult]: Loop: 74#L18 assume !(0 != main_#t~nondet2);havoc main_#t~nondet2;main_~y~0 := main_~y~0 - 1; 73#L18-2 assume !!(main_~x~0 > 0 && main_~y~0 > 0); 74#L18 [2019-01-01 21:34:47,399 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 21:34:47,399 INFO L82 PathProgramCache]: Analyzing trace with hash 1002, now seen corresponding path program 1 times [2019-01-01 21:34:47,399 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 21:34:47,400 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 21:34:47,401 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:34:47,402 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 21:34:47,402 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:34:47,405 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 21:34:47,407 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 21:34:47,409 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 21:34:47,410 INFO L82 PathProgramCache]: Analyzing trace with hash 1436, now seen corresponding path program 1 times [2019-01-01 21:34:47,410 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 21:34:47,410 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 21:34:47,412 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:34:47,412 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 21:34:47,412 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:34:47,415 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 21:34:47,417 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 21:34:47,419 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 21:34:47,419 INFO L82 PathProgramCache]: Analyzing trace with hash 963397, now seen corresponding path program 1 times [2019-01-01 21:34:47,419 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 21:34:47,419 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 21:34:47,421 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:34:47,421 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 21:34:47,421 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:34:47,425 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 21:34:47,429 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 21:34:47,494 INFO L216 LassoAnalysis]: Preferences: [2019-01-01 21:34:47,494 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-01-01 21:34:47,494 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-01-01 21:34:47,494 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-01-01 21:34:47,495 INFO L127 ssoRankerPreferences]: Use exernal solver: true [2019-01-01 21:34:47,495 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-01 21:34:47,495 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-01-01 21:34:47,495 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-01-01 21:34:47,496 INFO L131 ssoRankerPreferences]: Filename of dumped script: PodelskiRybalchenko-TACAS2011-Fig4_true-termination_true-no-overflow.c_Iteration2_Loop [2019-01-01 21:34:47,496 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-01-01 21:34:47,496 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2019-01-01 21:34:47,498 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:34:47,508 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:34:47,512 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:34:47,516 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:34:47,523 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:34:48,002 INFO L300 LassoAnalysis]: Preprocessing complete. [2019-01-01 21:34:48,003 INFO L412 LassoAnalysis]: Checking for nontermination... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 7 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-01-01 21:34:48,012 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-01 21:34:48,012 INFO L163 nArgumentSynthesizer]: Using integer mode. Waiting until toolchain timeout for monitored process 7 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-01 21:34:48,061 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2019-01-01 21:34:48,062 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 8 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-01-01 21:34:48,072 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-01 21:34:48,073 INFO L163 nArgumentSynthesizer]: Using integer mode. Waiting until toolchain timeout for monitored process 8 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-01 21:34:48,101 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2019-01-01 21:34:48,101 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {v_rep~unnamed0~0~true_3=1} Honda state: {v_rep~unnamed0~0~true_3=1} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 9 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-01 21:34:48,107 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-01 21:34:48,108 INFO L163 nArgumentSynthesizer]: Using integer mode. [2019-01-01 21:34:48,130 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2019-01-01 21:34:48,131 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_main_~x~0=1} Honda state: {ULTIMATE.start_main_~x~0=1} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 10 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-01 21:34:48,136 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-01 21:34:48,136 INFO L163 nArgumentSynthesizer]: Using integer mode. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 11 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 11 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-01 21:34:48,161 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2019-01-01 21:34:48,162 INFO L163 nArgumentSynthesizer]: Using integer mode. [2019-01-01 21:34:48,217 INFO L452 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2019-01-01 21:34:48,220 INFO L216 LassoAnalysis]: Preferences: [2019-01-01 21:34:48,220 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-01-01 21:34:48,220 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-01-01 21:34:48,220 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-01-01 21:34:48,221 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2019-01-01 21:34:48,221 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-01 21:34:48,221 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-01-01 21:34:48,221 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-01-01 21:34:48,221 INFO L131 ssoRankerPreferences]: Filename of dumped script: PodelskiRybalchenko-TACAS2011-Fig4_true-termination_true-no-overflow.c_Iteration2_Loop [2019-01-01 21:34:48,221 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-01-01 21:34:48,221 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2019-01-01 21:34:48,226 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:34:48,243 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:34:48,247 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:34:48,254 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:34:48,265 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:34:48,395 INFO L300 LassoAnalysis]: Preprocessing complete. [2019-01-01 21:34:48,396 INFO L497 LassoAnalysis]: Using template 'affine'. [2019-01-01 21:34:48,396 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 21:34:48,397 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:34:48,397 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:34:48,397 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:34:48,397 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:34:48,402 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-01 21:34:48,402 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-01 21:34:48,407 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 21:34:48,407 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 21:34:48,408 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:34:48,408 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:34:48,408 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:34:48,408 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:34:48,412 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-01 21:34:48,412 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-01 21:34:48,419 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 21:34:48,419 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 21:34:48,420 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:34:48,420 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 21:34:48,420 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:34:48,421 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:34:48,421 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:34:48,421 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 21:34:48,421 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 21:34:48,425 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 21:34:48,425 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 21:34:48,426 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:34:48,426 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 21:34:48,426 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:34:48,427 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:34:48,427 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:34:48,430 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 21:34:48,430 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 21:34:48,436 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-01-01 21:34:48,439 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2019-01-01 21:34:48,440 INFO L444 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 1 variables to zero. [2019-01-01 21:34:48,440 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-01-01 21:34:48,440 INFO L440 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2019-01-01 21:34:48,441 INFO L518 LassoAnalysis]: Proved termination. [2019-01-01 21:34:48,441 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~y~0) = 1*ULTIMATE.start_main_~y~0 Supporting invariants [] [2019-01-01 21:34:48,441 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2019-01-01 21:34:48,520 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 21:34:48,526 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 21:34:48,528 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-01 21:34:48,536 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 21:34:48,537 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-01 21:34:48,554 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-01 21:34:48,555 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2019-01-01 21:34:48,555 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 7 states and 10 transitions. cyclomatic complexity: 5 Second operand 3 states. [2019-01-01 21:34:48,592 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 7 states and 10 transitions. cyclomatic complexity: 5. Second operand 3 states. Result 14 states and 19 transitions. Complement of second has 5 states. [2019-01-01 21:34:48,594 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 3 states 1 stem states 1 non-accepting loop states 1 accepting loop states [2019-01-01 21:34:48,595 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2019-01-01 21:34:48,595 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 4 transitions. [2019-01-01 21:34:48,595 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 4 transitions. Stem has 2 letters. Loop has 2 letters. [2019-01-01 21:34:48,595 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-01 21:34:48,596 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 4 transitions. Stem has 4 letters. Loop has 2 letters. [2019-01-01 21:34:48,596 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-01 21:34:48,596 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 4 transitions. Stem has 2 letters. Loop has 4 letters. [2019-01-01 21:34:48,596 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-01 21:34:48,596 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 14 states and 19 transitions. [2019-01-01 21:34:48,599 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2019-01-01 21:34:48,600 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 14 states to 9 states and 12 transitions. [2019-01-01 21:34:48,600 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 4 [2019-01-01 21:34:48,600 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 4 [2019-01-01 21:34:48,601 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 12 transitions. [2019-01-01 21:34:48,601 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-01-01 21:34:48,601 INFO L705 BuchiCegarLoop]: Abstraction has 9 states and 12 transitions. [2019-01-01 21:34:48,601 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9 states and 12 transitions. [2019-01-01 21:34:48,603 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9 to 7. [2019-01-01 21:34:48,603 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2019-01-01 21:34:48,604 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 9 transitions. [2019-01-01 21:34:48,604 INFO L728 BuchiCegarLoop]: Abstraction has 7 states and 9 transitions. [2019-01-01 21:34:48,604 INFO L608 BuchiCegarLoop]: Abstraction has 7 states and 9 transitions. [2019-01-01 21:34:48,604 INFO L442 BuchiCegarLoop]: ======== Iteration 3============ [2019-01-01 21:34:48,604 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 7 states and 9 transitions. [2019-01-01 21:34:48,605 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2019-01-01 21:34:48,605 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-01 21:34:48,605 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-01 21:34:48,605 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [2, 1, 1] [2019-01-01 21:34:48,606 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2019-01-01 21:34:48,606 INFO L794 eck$LassoCheckResult]: Stem: 128#ULTIMATE.startENTRY havoc main_#res;havoc main_#t~nondet0, main_#t~nondet1, main_#t~nondet2, main_#t~nondet3, main_~x~0, main_~y~0;havoc main_~x~0;havoc main_~y~0;main_~x~0 := main_#t~nondet0;havoc main_#t~nondet0;main_~y~0 := main_#t~nondet1;havoc main_#t~nondet1; 125#L18-2 assume !!(main_~x~0 > 0 && main_~y~0 > 0); 126#L18 assume 0 != main_#t~nondet2;havoc main_#t~nondet2;main_~x~0 := main_~x~0 - 1;main_~y~0 := main_#t~nondet3;havoc main_#t~nondet3; 131#L18-2 assume !!(main_~x~0 > 0 && main_~y~0 > 0); 129#L18 [2019-01-01 21:34:48,606 INFO L796 eck$LassoCheckResult]: Loop: 129#L18 assume !(0 != main_#t~nondet2);havoc main_#t~nondet2;main_~y~0 := main_~y~0 - 1; 130#L18-2 assume !!(main_~x~0 > 0 && main_~y~0 > 0); 129#L18 [2019-01-01 21:34:48,606 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 21:34:48,606 INFO L82 PathProgramCache]: Analyzing trace with hash 963335, now seen corresponding path program 2 times [2019-01-01 21:34:48,607 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 21:34:48,607 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 21:34:48,609 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:34:48,609 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 21:34:48,609 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:34:48,616 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 21:34:48,625 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 21:34:48,628 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 21:34:48,629 INFO L82 PathProgramCache]: Analyzing trace with hash 1436, now seen corresponding path program 2 times [2019-01-01 21:34:48,629 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 21:34:48,629 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 21:34:48,630 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:34:48,631 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-01 21:34:48,631 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:34:48,634 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 21:34:48,637 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 21:34:48,638 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 21:34:48,639 INFO L82 PathProgramCache]: Analyzing trace with hash 925765410, now seen corresponding path program 1 times [2019-01-01 21:34:48,639 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 21:34:48,639 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 21:34:48,641 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:34:48,642 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-01 21:34:48,642 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:34:48,647 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 21:34:48,654 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 21:34:48,682 INFO L216 LassoAnalysis]: Preferences: [2019-01-01 21:34:48,682 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-01-01 21:34:48,682 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-01-01 21:34:48,683 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-01-01 21:34:48,683 INFO L127 ssoRankerPreferences]: Use exernal solver: true [2019-01-01 21:34:48,683 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-01 21:34:48,683 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-01-01 21:34:48,685 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-01-01 21:34:48,685 INFO L131 ssoRankerPreferences]: Filename of dumped script: PodelskiRybalchenko-TACAS2011-Fig4_true-termination_true-no-overflow.c_Iteration3_Loop [2019-01-01 21:34:48,685 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-01-01 21:34:48,685 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2019-01-01 21:34:48,689 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:34:48,703 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:34:48,709 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:34:48,713 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:34:48,718 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:34:48,845 INFO L300 LassoAnalysis]: Preprocessing complete. [2019-01-01 21:34:48,845 INFO L412 LassoAnalysis]: Checking for nontermination... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 12 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 12 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-01 21:34:48,849 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-01 21:34:48,850 INFO L163 nArgumentSynthesizer]: Using integer mode. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 13 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 13 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-01 21:34:48,873 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2019-01-01 21:34:48,874 INFO L163 nArgumentSynthesizer]: Using integer mode. [2019-01-01 21:34:48,934 INFO L452 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2019-01-01 21:34:48,936 INFO L216 LassoAnalysis]: Preferences: [2019-01-01 21:34:48,936 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-01-01 21:34:48,936 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-01-01 21:34:48,936 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-01-01 21:34:48,936 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2019-01-01 21:34:48,936 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-01 21:34:48,937 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-01-01 21:34:48,937 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-01-01 21:34:48,937 INFO L131 ssoRankerPreferences]: Filename of dumped script: PodelskiRybalchenko-TACAS2011-Fig4_true-termination_true-no-overflow.c_Iteration3_Loop [2019-01-01 21:34:48,937 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-01-01 21:34:48,937 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2019-01-01 21:34:48,939 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:34:48,957 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:34:48,962 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:34:48,972 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:34:48,975 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:34:49,067 INFO L300 LassoAnalysis]: Preprocessing complete. [2019-01-01 21:34:49,067 INFO L497 LassoAnalysis]: Using template 'affine'. [2019-01-01 21:34:49,068 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 21:34:49,069 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:34:49,069 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 21:34:49,069 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:34:49,072 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:34:49,072 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:34:49,072 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 21:34:49,072 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 21:34:49,079 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-01-01 21:34:49,085 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2019-01-01 21:34:49,085 INFO L444 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 1 variables to zero. [2019-01-01 21:34:49,091 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-01-01 21:34:49,091 INFO L440 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2019-01-01 21:34:49,091 INFO L518 LassoAnalysis]: Proved termination. [2019-01-01 21:34:49,092 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~y~0) = 1*ULTIMATE.start_main_~y~0 Supporting invariants [] [2019-01-01 21:34:49,092 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2019-01-01 21:34:49,125 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 21:34:49,133 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 21:34:49,135 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-01 21:34:49,140 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 21:34:49,140 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-01 21:34:49,151 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-01 21:34:49,152 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2019-01-01 21:34:49,152 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 7 states and 9 transitions. cyclomatic complexity: 4 Second operand 3 states. [2019-01-01 21:34:49,193 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 7 states and 9 transitions. cyclomatic complexity: 4. Second operand 3 states. Result 10 states and 13 transitions. Complement of second has 5 states. [2019-01-01 21:34:49,194 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 3 states 1 stem states 1 non-accepting loop states 1 accepting loop states [2019-01-01 21:34:49,194 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2019-01-01 21:34:49,195 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 4 transitions. [2019-01-01 21:34:49,195 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 4 transitions. Stem has 4 letters. Loop has 2 letters. [2019-01-01 21:34:49,195 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-01 21:34:49,195 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2019-01-01 21:34:49,267 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 21:34:49,283 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 21:34:49,284 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-01 21:34:49,298 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 21:34:49,299 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-01 21:34:49,322 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-01 21:34:49,323 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and with honda bouncer for loop.1 stem predicates 2 loop predicates [2019-01-01 21:34:49,323 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 7 states and 9 transitions. cyclomatic complexity: 4 Second operand 3 states. [2019-01-01 21:34:49,397 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 7 states and 9 transitions. cyclomatic complexity: 4. Second operand 3 states. Result 10 states and 13 transitions. Complement of second has 5 states. [2019-01-01 21:34:49,398 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 3 states 1 stem states 1 non-accepting loop states 1 accepting loop states [2019-01-01 21:34:49,398 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2019-01-01 21:34:49,398 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 4 transitions. [2019-01-01 21:34:49,398 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 4 transitions. Stem has 4 letters. Loop has 2 letters. [2019-01-01 21:34:49,398 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-01 21:34:49,399 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2019-01-01 21:34:49,412 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 21:34:49,419 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 21:34:49,421 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-01 21:34:49,427 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 21:34:49,429 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-01 21:34:49,439 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-01 21:34:49,440 INFO L152 lantAutomatonBouncer]: Defining Buchi interpolant automaton with scrooge nondeterminism in stemwith honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2019-01-01 21:34:49,440 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 7 states and 9 transitions. cyclomatic complexity: 4 Second operand 3 states. [2019-01-01 21:34:49,477 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 7 states and 9 transitions. cyclomatic complexity: 4. Second operand 3 states. Result 10 states and 13 transitions. Complement of second has 4 states. [2019-01-01 21:34:49,479 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 3 states 1 stem states 1 non-accepting loop states 1 accepting loop states [2019-01-01 21:34:49,480 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2019-01-01 21:34:49,480 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 7 transitions. [2019-01-01 21:34:49,480 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 7 transitions. Stem has 4 letters. Loop has 2 letters. [2019-01-01 21:34:49,480 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-01 21:34:49,480 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 7 transitions. Stem has 6 letters. Loop has 2 letters. [2019-01-01 21:34:49,481 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-01 21:34:49,481 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 7 transitions. Stem has 4 letters. Loop has 4 letters. [2019-01-01 21:34:49,481 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-01 21:34:49,481 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 10 states and 13 transitions. [2019-01-01 21:34:49,482 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2019-01-01 21:34:49,482 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 10 states to 0 states and 0 transitions. [2019-01-01 21:34:49,483 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2019-01-01 21:34:49,483 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2019-01-01 21:34:49,483 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2019-01-01 21:34:49,483 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-01-01 21:34:49,483 INFO L705 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-01-01 21:34:49,483 INFO L728 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-01-01 21:34:49,483 INFO L608 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-01-01 21:34:49,483 INFO L442 BuchiCegarLoop]: ======== Iteration 4============ [2019-01-01 21:34:49,485 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2019-01-01 21:34:49,485 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2019-01-01 21:34:49,485 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2019-01-01 21:34:49,494 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 01.01 09:34:49 BoogieIcfgContainer [2019-01-01 21:34:49,494 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2019-01-01 21:34:49,495 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-01-01 21:34:49,495 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-01-01 21:34:49,495 INFO L276 PluginConnector]: Witness Printer initialized [2019-01-01 21:34:49,496 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 01.01 09:34:45" (3/4) ... [2019-01-01 21:34:49,499 INFO L147 WitnessPrinter]: No result that supports witness generation found [2019-01-01 21:34:49,499 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-01-01 21:34:49,500 INFO L168 Benchmark]: Toolchain (without parser) took 5026.68 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 123.7 MB). Free memory was 947.3 MB in the beginning and 884.6 MB in the end (delta: 62.7 MB). Peak memory consumption was 186.5 MB. Max. memory is 11.5 GB. [2019-01-01 21:34:49,502 INFO L168 Benchmark]: CDTParser took 0.22 ms. Allocated memory is still 1.0 GB. Free memory is still 972.8 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-01-01 21:34:49,502 INFO L168 Benchmark]: CACSL2BoogieTranslator took 265.71 ms. Allocated memory is still 1.0 GB. Free memory was 947.3 MB in the beginning and 936.6 MB in the end (delta: 10.7 MB). Peak memory consumption was 10.7 MB. Max. memory is 11.5 GB. [2019-01-01 21:34:49,503 INFO L168 Benchmark]: Boogie Procedure Inliner took 45.98 ms. Allocated memory is still 1.0 GB. Free memory is still 936.6 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-01-01 21:34:49,504 INFO L168 Benchmark]: Boogie Preprocessor took 27.95 ms. Allocated memory is still 1.0 GB. Free memory is still 936.6 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-01-01 21:34:49,504 INFO L168 Benchmark]: RCFGBuilder took 317.71 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 123.7 MB). Free memory was 936.6 MB in the beginning and 1.1 GB in the end (delta: -165.3 MB). Peak memory consumption was 23.9 MB. Max. memory is 11.5 GB. [2019-01-01 21:34:49,506 INFO L168 Benchmark]: BuchiAutomizer took 4358.61 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 884.6 MB in the end (delta: 217.3 MB). Peak memory consumption was 217.3 MB. Max. memory is 11.5 GB. [2019-01-01 21:34:49,507 INFO L168 Benchmark]: Witness Printer took 4.28 ms. Allocated memory is still 1.2 GB. Free memory is still 884.6 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-01-01 21:34:49,512 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 972.8 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 265.71 ms. Allocated memory is still 1.0 GB. Free memory was 947.3 MB in the beginning and 936.6 MB in the end (delta: 10.7 MB). Peak memory consumption was 10.7 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 45.98 ms. Allocated memory is still 1.0 GB. Free memory is still 936.6 MB. There was no memory consumed. Max. memory is 11.5 GB. * Boogie Preprocessor took 27.95 ms. Allocated memory is still 1.0 GB. Free memory is still 936.6 MB. There was no memory consumed. Max. memory is 11.5 GB. * RCFGBuilder took 317.71 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 123.7 MB). Free memory was 936.6 MB in the beginning and 1.1 GB in the end (delta: -165.3 MB). Peak memory consumption was 23.9 MB. Max. memory is 11.5 GB. * BuchiAutomizer took 4358.61 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 884.6 MB in the end (delta: 217.3 MB). Peak memory consumption was 217.3 MB. Max. memory is 11.5 GB. * Witness Printer took 4.28 ms. Allocated memory is still 1.2 GB. Free memory is still 884.6 MB. There was no memory consumed. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Constructed decomposition of program Your program was decomposed into 3 terminating modules (0 trivial, 2 deterministic, 1 nondeterministic). One deterministic module has affine ranking function x and consists of 5 locations. One deterministic module has affine ranking function y and consists of 3 locations. One nondeterministic module has affine ranking function y and consists of 3 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 4.3s and 4 iterations. TraceHistogramMax:2. Analysis of lassos took 3.1s. Construction of modules took 0.2s. Büchi inclusion checks took 0.8s. Highest rank in rank-based complementation 3. Minimization of det autom 1. Minimization of nondet autom 2. Automata minimization 0.0s AutomataMinimizationTime, 2 MinimizatonAttempts, 3 StatesRemovedByMinimization, 2 NontrivialMinimizations. Non-live state removal took 0.0s Buchi closure took 0.0s. Biggest automaton had 7 states and ocurred in iteration 1. Nontrivial modules had stage [2, 0, 1, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 22 SDtfs, 18 SDslu, 10 SDs, 0 SdLazy, 32 SolverSat, 10 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.2s Time LassoAnalysisResults: nont0 unkn0 SFLI0 SFLT3 conc0 concLT0 SILN0 SILU0 SILI0 SILT0 lasso0 LassoPreprocessingBenchmarks: Lassos: inital17 mio100 ax169 hnf100 lsp34 ukn100 mio100 lsp100 div100 bol100 ite100 ukn100 eq160 hnf93 smp100 dnf100 smp100 tf113 neg100 sie111 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 0 Time: 18ms VariablesStem: 1 VariablesLoop: 0 DisjunctsStem: 1 DisjunctsLoop: 1 SupportingInvariants: 2 MotzkinApplications: 6 LassoTerminationAnalysisBenchmarks: LassoNonterminationAnalysisSatFixpoint: 6 LassoNonterminationAnalysisSatUnbounded: 0 LassoNonterminationAnalysisUnsat: 3 LassoNonterminationAnalysisUnknown: 0 LassoNonterminationAnalysisTime: 0.4s - TerminationAnalysisResult: Termination proven Buchi Automizer proved that your program is terminating RESULT: Ultimate proved your program to be correct! Received shutdown request...