./Ultimate.py --spec /storage/repos/svcomp/c/properties/termination.prp --file /storage/repos/svcomp/c/recursive/gcd02_true-unreach-call_true-no-overflow_true-termination.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for termination Using default analysis Version 0ed9222f Calling Ultimate with: java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx12G -Xms1G -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerTermination.xml -i /storage/repos/svcomp/c/recursive/gcd02_true-unreach-call_true-no-overflow_true-termination.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-32bit-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 32bit --witnessprinter.graph.data.programhash 4ba31a8852254650e4ff6b6614669c496c01110f .................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................. Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.24-0ed9222-m [2019-01-14 04:33:18,533 INFO L170 SettingsManager]: Resetting all preferences to default values... [2019-01-14 04:33:18,535 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2019-01-14 04:33:18,549 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-01-14 04:33:18,549 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-01-14 04:33:18,550 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-01-14 04:33:18,551 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-01-14 04:33:18,553 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2019-01-14 04:33:18,555 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-01-14 04:33:18,555 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-01-14 04:33:18,556 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-01-14 04:33:18,557 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-01-14 04:33:18,557 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-01-14 04:33:18,558 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-01-14 04:33:18,560 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-01-14 04:33:18,560 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-01-14 04:33:18,562 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-01-14 04:33:18,565 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-01-14 04:33:18,569 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2019-01-14 04:33:18,573 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-01-14 04:33:18,574 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-01-14 04:33:18,575 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-01-14 04:33:18,580 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-01-14 04:33:18,581 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-01-14 04:33:18,581 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-01-14 04:33:18,583 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-01-14 04:33:18,584 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-01-14 04:33:18,587 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-01-14 04:33:18,588 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2019-01-14 04:33:18,591 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-01-14 04:33:18,592 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2019-01-14 04:33:18,593 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-01-14 04:33:18,593 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-01-14 04:33:18,593 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2019-01-14 04:33:18,595 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2019-01-14 04:33:18,596 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2019-01-14 04:33:18,596 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-32bit-Automizer_Default.epf [2019-01-14 04:33:18,617 INFO L110 SettingsManager]: Loading preferences was successful [2019-01-14 04:33:18,617 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2019-01-14 04:33:18,618 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-01-14 04:33:18,619 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2019-01-14 04:33:18,619 INFO L133 SettingsManager]: * Use SBE=true [2019-01-14 04:33:18,619 INFO L131 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2019-01-14 04:33:18,620 INFO L133 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2019-01-14 04:33:18,620 INFO L133 SettingsManager]: * Use old map elimination=false [2019-01-14 04:33:18,620 INFO L133 SettingsManager]: * Use external solver (rank synthesis)=false [2019-01-14 04:33:18,620 INFO L133 SettingsManager]: * Use only trivial implications for array writes=true [2019-01-14 04:33:18,620 INFO L133 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2019-01-14 04:33:18,620 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-01-14 04:33:18,621 INFO L133 SettingsManager]: * sizeof long=4 [2019-01-14 04:33:18,621 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2019-01-14 04:33:18,621 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2019-01-14 04:33:18,621 INFO L133 SettingsManager]: * sizeof POINTER=4 [2019-01-14 04:33:18,621 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2019-01-14 04:33:18,622 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2019-01-14 04:33:18,623 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2019-01-14 04:33:18,623 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2019-01-14 04:33:18,624 INFO L133 SettingsManager]: * sizeof long double=12 [2019-01-14 04:33:18,624 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2019-01-14 04:33:18,624 INFO L133 SettingsManager]: * Assume nondeterminstic values are in range=false [2019-01-14 04:33:18,624 INFO L133 SettingsManager]: * Use constant arrays=true [2019-01-14 04:33:18,624 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2019-01-14 04:33:18,624 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-01-14 04:33:18,625 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-01-14 04:33:18,626 INFO L133 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2019-01-14 04:33:18,626 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-01-14 04:33:18,626 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2019-01-14 04:33:18,626 INFO L133 SettingsManager]: * Dump automata to the following directory=/home/matthias/ultimate/dump/auto [2019-01-14 04:33:18,628 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2019-01-14 04:33:18,629 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 -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 4ba31a8852254650e4ff6b6614669c496c01110f [2019-01-14 04:33:18,685 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-01-14 04:33:18,701 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-01-14 04:33:18,707 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-01-14 04:33:18,709 INFO L271 PluginConnector]: Initializing CDTParser... [2019-01-14 04:33:18,709 INFO L276 PluginConnector]: CDTParser initialized [2019-01-14 04:33:18,710 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/svcomp/c/recursive/gcd02_true-unreach-call_true-no-overflow_true-termination.c [2019-01-14 04:33:18,778 INFO L221 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/130e0741f/b4e5d8617af14c7eaa47046cb0c34b21/FLAG623b07549 [2019-01-14 04:33:19,276 INFO L307 CDTParser]: Found 1 translation units. [2019-01-14 04:33:19,277 INFO L161 CDTParser]: Scanning /storage/repos/svcomp/c/recursive/gcd02_true-unreach-call_true-no-overflow_true-termination.c [2019-01-14 04:33:19,282 INFO L355 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/130e0741f/b4e5d8617af14c7eaa47046cb0c34b21/FLAG623b07549 [2019-01-14 04:33:19,673 INFO L363 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/130e0741f/b4e5d8617af14c7eaa47046cb0c34b21 [2019-01-14 04:33:19,680 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-01-14 04:33:19,682 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-01-14 04:33:19,683 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-01-14 04:33:19,683 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-01-14 04:33:19,687 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2019-01-14 04:33:19,688 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.01 04:33:19" (1/1) ... [2019-01-14 04:33:19,692 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@694eaae9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 04:33:19, skipping insertion in model container [2019-01-14 04:33:19,692 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.01 04:33:19" (1/1) ... [2019-01-14 04:33:19,700 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-01-14 04:33:19,724 INFO L176 MainTranslator]: Built tables and reachable declarations [2019-01-14 04:33:19,956 INFO L208 PostProcessor]: Analyzing one entry point: main [2019-01-14 04:33:19,961 INFO L191 MainTranslator]: Completed pre-run [2019-01-14 04:33:19,982 INFO L208 PostProcessor]: Analyzing one entry point: main [2019-01-14 04:33:20,000 INFO L195 MainTranslator]: Completed translation [2019-01-14 04:33:20,000 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 04:33:20 WrapperNode [2019-01-14 04:33:20,001 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-01-14 04:33:20,001 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-01-14 04:33:20,002 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-01-14 04:33:20,002 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2019-01-14 04:33:20,013 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 04:33:20" (1/1) ... [2019-01-14 04:33:20,019 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 04:33:20" (1/1) ... [2019-01-14 04:33:20,041 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-01-14 04:33:20,041 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-01-14 04:33:20,041 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-01-14 04:33:20,041 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2019-01-14 04:33:20,052 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 04:33:20" (1/1) ... [2019-01-14 04:33:20,053 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 04:33:20" (1/1) ... [2019-01-14 04:33:20,054 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 04:33:20" (1/1) ... [2019-01-14 04:33:20,054 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 04:33:20" (1/1) ... [2019-01-14 04:33:20,056 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 04:33:20" (1/1) ... [2019-01-14 04:33:20,060 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 04:33:20" (1/1) ... [2019-01-14 04:33:20,061 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 04:33:20" (1/1) ... [2019-01-14 04:33:20,067 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-01-14 04:33:20,067 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-01-14 04:33:20,067 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-01-14 04:33:20,067 INFO L276 PluginConnector]: RCFGBuilder initialized [2019-01-14 04:33:20,068 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 04:33:20" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-14 04:33:20,180 INFO L130 BoogieDeclarations]: Found specification of procedure divides [2019-01-14 04:33:20,181 INFO L138 BoogieDeclarations]: Found implementation of procedure divides [2019-01-14 04:33:20,181 INFO L130 BoogieDeclarations]: Found specification of procedure gcd [2019-01-14 04:33:20,181 INFO L138 BoogieDeclarations]: Found implementation of procedure gcd [2019-01-14 04:33:20,181 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-01-14 04:33:20,181 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-01-14 04:33:20,559 INFO L281 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-01-14 04:33:20,559 INFO L286 CfgBuilder]: Removed 4 assue(true) statements. [2019-01-14 04:33:20,561 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.01 04:33:20 BoogieIcfgContainer [2019-01-14 04:33:20,562 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-01-14 04:33:20,562 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2019-01-14 04:33:20,563 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2019-01-14 04:33:20,566 INFO L276 PluginConnector]: BuchiAutomizer initialized [2019-01-14 04:33:20,567 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-01-14 04:33:20,567 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 14.01 04:33:19" (1/3) ... [2019-01-14 04:33:20,569 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@586f208 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 14.01 04:33:20, skipping insertion in model container [2019-01-14 04:33:20,569 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-01-14 04:33:20,569 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 04:33:20" (2/3) ... [2019-01-14 04:33:20,570 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@586f208 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 14.01 04:33:20, skipping insertion in model container [2019-01-14 04:33:20,570 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-01-14 04:33:20,570 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.01 04:33:20" (3/3) ... [2019-01-14 04:33:20,572 INFO L375 chiAutomizerObserver]: Analyzing ICFG gcd02_true-unreach-call_true-no-overflow_true-termination.c [2019-01-14 04:33:20,651 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2019-01-14 04:33:20,652 INFO L374 BuchiCegarLoop]: Interprodecural is true [2019-01-14 04:33:20,653 INFO L375 BuchiCegarLoop]: Hoare is false [2019-01-14 04:33:20,653 INFO L376 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2019-01-14 04:33:20,653 INFO L377 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2019-01-14 04:33:20,653 INFO L378 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-01-14 04:33:20,653 INFO L379 BuchiCegarLoop]: Difference is false [2019-01-14 04:33:20,653 INFO L380 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-01-14 04:33:20,653 INFO L383 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2019-01-14 04:33:20,670 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 30 states. [2019-01-14 04:33:20,699 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 11 [2019-01-14 04:33:20,699 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-14 04:33:20,699 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-14 04:33:20,707 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2019-01-14 04:33:20,707 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1] [2019-01-14 04:33:20,708 INFO L442 BuchiCegarLoop]: ======== Iteration 1============ [2019-01-14 04:33:20,708 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 30 states. [2019-01-14 04:33:20,712 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 11 [2019-01-14 04:33:20,712 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-14 04:33:20,712 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-14 04:33:20,713 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2019-01-14 04:33:20,713 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1] [2019-01-14 04:33:20,720 INFO L794 eck$LassoCheckResult]: Stem: 29#ULTIMATE.startENTRYtrue havoc main_#res;havoc main_#t~nondet3, main_#t~nondet4, main_#t~ret5, main_#t~ret6, main_~z~0, main_~m~0, main_~n~0;main_~m~0 := main_#t~nondet3;havoc main_#t~nondet3; 27#L42true assume !(main_~m~0 <= 0 || main_~m~0 > 2147483647);main_~n~0 := main_#t~nondet4;havoc main_#t~nondet4; 32#L46true assume !(main_~n~0 <= 0 || main_~n~0 > 2147483647); 5#L49true assume main_~m~0 > 0 && main_~n~0 > 0; 24#L50true call main_#t~ret5 := gcd(main_~m~0, main_~n~0);< 19#gcdENTRYtrue [2019-01-14 04:33:20,721 INFO L796 eck$LassoCheckResult]: Loop: 19#gcdENTRYtrue ~y1 := #in~y1;~y2 := #in~y2; 31#L16true assume !(~y1 <= 0 || ~y2 <= 0); 6#L16-2true assume !(~y1 == ~y2); 3#L23true assume ~y1 > ~y2; 21#L24true call #t~ret0 := gcd(~y1 - ~y2, ~y2);< 19#gcdENTRYtrue [2019-01-14 04:33:20,725 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 04:33:20,726 INFO L82 PathProgramCache]: Analyzing trace with hash 62188830, now seen corresponding path program 1 times [2019-01-14 04:33:20,727 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 04:33:20,728 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 04:33:20,779 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 04:33:20,779 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 04:33:20,779 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 04:33:20,813 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 04:33:20,820 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 04:33:20,841 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 04:33:20,841 INFO L82 PathProgramCache]: Analyzing trace with hash 40301400, now seen corresponding path program 1 times [2019-01-14 04:33:20,841 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 04:33:20,841 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 04:33:20,843 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 04:33:20,843 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 04:33:20,843 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 04:33:20,856 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 04:33:20,861 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 04:33:20,864 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 04:33:20,864 INFO L82 PathProgramCache]: Analyzing trace with hash -851791781, now seen corresponding path program 1 times [2019-01-14 04:33:20,864 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 04:33:20,864 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 04:33:20,865 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 04:33:20,866 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 04:33:20,866 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 04:33:20,876 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 04:33:20,885 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 04:33:21,027 WARN L181 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 22 DAG size of output: 18 [2019-01-14 04:33:21,216 INFO L216 LassoAnalysis]: Preferences: [2019-01-14 04:33:21,217 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-01-14 04:33:21,217 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-01-14 04:33:21,217 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-01-14 04:33:21,219 INFO L127 ssoRankerPreferences]: Use exernal solver: true [2019-01-14 04:33:21,219 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-14 04:33:21,219 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-01-14 04:33:21,219 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-01-14 04:33:21,219 INFO L131 ssoRankerPreferences]: Filename of dumped script: gcd02_true-unreach-call_true-no-overflow_true-termination.c_Iteration1_Loop [2019-01-14 04:33:21,219 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-01-14 04:33:21,220 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2019-01-14 04:33:21,241 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:33:21,328 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:33:21,355 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:33:21,382 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:33:21,409 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:33:21,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-14 04:33:21,544 INFO L300 LassoAnalysis]: Preprocessing complete. [2019-01-14 04:33:21,545 INFO L412 LassoAnalysis]: Checking for nontermination... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-14 04:33:21,551 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-14 04:33:21,552 INFO L163 nArgumentSynthesizer]: Using integer mode. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-14 04:33:21,581 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2019-01-14 04:33:21,581 INFO L163 nArgumentSynthesizer]: Using integer mode. [2019-01-14 04:33:21,627 INFO L452 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2019-01-14 04:33:21,629 INFO L216 LassoAnalysis]: Preferences: [2019-01-14 04:33:21,629 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-01-14 04:33:21,629 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-01-14 04:33:21,629 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-01-14 04:33:21,629 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2019-01-14 04:33:21,629 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-14 04:33:21,629 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-01-14 04:33:21,630 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-01-14 04:33:21,630 INFO L131 ssoRankerPreferences]: Filename of dumped script: gcd02_true-unreach-call_true-no-overflow_true-termination.c_Iteration1_Loop [2019-01-14 04:33:21,630 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-01-14 04:33:21,630 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2019-01-14 04:33:21,631 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:33:21,650 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:33:21,666 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:33:21,671 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:33:21,677 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:33:21,681 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:33:21,837 INFO L300 LassoAnalysis]: Preprocessing complete. [2019-01-14 04:33:21,841 INFO L497 LassoAnalysis]: Using template 'affine'. [2019-01-14 04:33:21,843 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 04:33:21,845 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 04:33:21,845 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 04:33:21,846 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 04:33:21,846 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 04:33:21,846 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 04:33:21,848 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 04:33:21,848 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 04:33:21,854 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 04:33:21,855 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 04:33:21,855 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 04:33:21,855 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 04:33:21,856 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 04:33:21,856 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 04:33:21,856 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 04:33:21,857 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 04:33:21,857 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 04:33:21,868 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-01-14 04:33:21,879 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2019-01-14 04:33:21,879 INFO L444 ModelExtractionUtils]: 1 out of 4 variables were initially zero. Simplification set additionally 1 variables to zero. [2019-01-14 04:33:21,882 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-01-14 04:33:21,882 INFO L440 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2019-01-14 04:33:21,882 INFO L518 LassoAnalysis]: Proved termination. [2019-01-14 04:33:21,883 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(gcd_#in~y1) = 1*gcd_#in~y1 Supporting invariants [] [2019-01-14 04:33:21,884 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2019-01-14 04:33:21,921 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 04:33:21,944 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 04:33:21,949 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 04:33:21,984 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 04:33:21,987 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 04:33:22,085 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 04:33:22,098 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 4 loop predicates [2019-01-14 04:33:22,100 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 30 states. Second operand 5 states. [2019-01-14 04:33:22,703 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 30 states.. Second operand 5 states. Result 145 states and 201 transitions. Complement of second has 35 states. [2019-01-14 04:33:22,704 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 8 states 1 stem states 5 non-accepting loop states 1 accepting loop states [2019-01-14 04:33:22,706 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2019-01-14 04:33:22,708 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 60 transitions. [2019-01-14 04:33:22,710 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states and 60 transitions. Stem has 5 letters. Loop has 5 letters. [2019-01-14 04:33:22,711 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-14 04:33:22,712 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states and 60 transitions. Stem has 10 letters. Loop has 5 letters. [2019-01-14 04:33:22,712 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-14 04:33:22,712 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states and 60 transitions. Stem has 5 letters. Loop has 10 letters. [2019-01-14 04:33:22,712 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-14 04:33:22,713 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 145 states and 201 transitions. [2019-01-14 04:33:22,726 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 9 [2019-01-14 04:33:22,736 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 145 states to 61 states and 86 transitions. [2019-01-14 04:33:22,737 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 42 [2019-01-14 04:33:22,738 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 44 [2019-01-14 04:33:22,739 INFO L73 IsDeterministic]: Start isDeterministic. Operand 61 states and 86 transitions. [2019-01-14 04:33:22,741 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-01-14 04:33:22,741 INFO L706 BuchiCegarLoop]: Abstraction has 61 states and 86 transitions. [2019-01-14 04:33:22,756 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61 states and 86 transitions. [2019-01-14 04:33:22,772 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61 to 47. [2019-01-14 04:33:22,772 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 47 states. [2019-01-14 04:33:22,774 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 62 transitions. [2019-01-14 04:33:22,775 INFO L729 BuchiCegarLoop]: Abstraction has 47 states and 62 transitions. [2019-01-14 04:33:22,775 INFO L609 BuchiCegarLoop]: Abstraction has 47 states and 62 transitions. [2019-01-14 04:33:22,776 INFO L442 BuchiCegarLoop]: ======== Iteration 2============ [2019-01-14 04:33:22,776 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 47 states and 62 transitions. [2019-01-14 04:33:22,778 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 9 [2019-01-14 04:33:22,778 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-14 04:33:22,778 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-14 04:33:22,779 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-14 04:33:22,779 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1] [2019-01-14 04:33:22,779 INFO L794 eck$LassoCheckResult]: Stem: 293#ULTIMATE.startENTRY havoc main_#res;havoc main_#t~nondet3, main_#t~nondet4, main_#t~ret5, main_#t~ret6, main_~z~0, main_~m~0, main_~n~0;main_~m~0 := main_#t~nondet3;havoc main_#t~nondet3; 291#L42 assume !(main_~m~0 <= 0 || main_~m~0 > 2147483647);main_~n~0 := main_#t~nondet4;havoc main_#t~nondet4; 292#L46 assume !(main_~n~0 <= 0 || main_~n~0 > 2147483647); 288#L49 assume main_~m~0 > 0 && main_~n~0 > 0; 273#L50 call main_#t~ret5 := gcd(main_~m~0, main_~n~0);< 276#gcdENTRY ~y1 := #in~y1;~y2 := #in~y2; 278#L16 assume !(~y1 <= 0 || ~y2 <= 0); 313#L16-2 assume !(~y1 == ~y2); 314#L23 assume !(~y1 > ~y2); 296#L26 call #t~ret1 := gcd(~y1, ~y2 - ~y1);< 301#gcdENTRY [2019-01-14 04:33:22,779 INFO L796 eck$LassoCheckResult]: Loop: 301#gcdENTRY ~y1 := #in~y1;~y2 := #in~y2; 311#L16 assume !(~y1 <= 0 || ~y2 <= 0); 310#L16-2 assume !(~y1 == ~y2); 308#L23 assume !(~y1 > ~y2); 297#L26 call #t~ret1 := gcd(~y1, ~y2 - ~y1);< 301#gcdENTRY [2019-01-14 04:33:22,779 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 04:33:22,780 INFO L82 PathProgramCache]: Analyzing trace with hash -851791686, now seen corresponding path program 1 times [2019-01-14 04:33:22,780 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 04:33:22,780 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 04:33:22,781 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 04:33:22,781 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 04:33:22,781 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 04:33:22,787 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 04:33:22,794 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 04:33:22,797 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 04:33:22,798 INFO L82 PathProgramCache]: Analyzing trace with hash 40301495, now seen corresponding path program 1 times [2019-01-14 04:33:22,798 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 04:33:22,798 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 04:33:22,799 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 04:33:22,799 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 04:33:22,799 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 04:33:22,803 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 04:33:22,807 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 04:33:22,809 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 04:33:22,809 INFO L82 PathProgramCache]: Analyzing trace with hash -99955042, now seen corresponding path program 2 times [2019-01-14 04:33:22,809 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 04:33:22,810 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 04:33:22,811 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 04:33:22,811 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 04:33:22,811 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 04:33:22,821 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 04:33:22,833 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 04:33:23,022 INFO L216 LassoAnalysis]: Preferences: [2019-01-14 04:33:23,022 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-01-14 04:33:23,022 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-01-14 04:33:23,022 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-01-14 04:33:23,022 INFO L127 ssoRankerPreferences]: Use exernal solver: true [2019-01-14 04:33:23,022 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-14 04:33:23,023 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-01-14 04:33:23,023 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-01-14 04:33:23,023 INFO L131 ssoRankerPreferences]: Filename of dumped script: gcd02_true-unreach-call_true-no-overflow_true-termination.c_Iteration2_Loop [2019-01-14 04:33:23,023 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-01-14 04:33:23,023 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2019-01-14 04:33:23,025 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:33:23,029 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:33:23,031 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:33:23,037 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:33:23,062 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:33:23,065 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:33:23,205 INFO L300 LassoAnalysis]: Preprocessing complete. [2019-01-14 04:33:23,205 INFO L412 LassoAnalysis]: Checking for nontermination... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-14 04:33:23,213 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-14 04:33:23,213 INFO L163 nArgumentSynthesizer]: Using integer mode. [2019-01-14 04:33:23,217 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2019-01-14 04:33:23,217 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {gcd_~y2=0} Honda state: {gcd_~y2=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-14 04:33:23,241 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-14 04:33:23,241 INFO L163 nArgumentSynthesizer]: Using integer mode. [2019-01-14 04:33:23,244 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2019-01-14 04:33:23,244 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {gcd_~y1=0} Honda state: {gcd_~y1=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] 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) [2019-01-14 04:33:23,283 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-14 04:33:23,283 INFO L163 nArgumentSynthesizer]: Using integer mode. Waiting until toolchain timeout for monitored process 6 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-14 04:33:23,297 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2019-01-14 04:33:23,297 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {gcd_#res=0} Honda state: {gcd_#res=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 7 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-01-14 04:33:23,351 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-14 04:33:23,351 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 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 8 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-01-14 04:33:23,405 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2019-01-14 04:33:23,406 INFO L163 nArgumentSynthesizer]: Using integer mode. Waiting until toolchain timeout for monitored process 8 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-14 04:33:23,545 INFO L452 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2019-01-14 04:33:23,547 INFO L216 LassoAnalysis]: Preferences: [2019-01-14 04:33:23,547 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-01-14 04:33:23,548 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-01-14 04:33:23,548 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-01-14 04:33:23,548 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2019-01-14 04:33:23,548 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-14 04:33:23,548 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-01-14 04:33:23,548 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-01-14 04:33:23,548 INFO L131 ssoRankerPreferences]: Filename of dumped script: gcd02_true-unreach-call_true-no-overflow_true-termination.c_Iteration2_Loop [2019-01-14 04:33:23,548 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-01-14 04:33:23,549 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2019-01-14 04:33:23,550 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:33:23,553 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:33:23,568 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:33:23,570 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:33:23,573 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:33:23,577 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:33:23,721 INFO L300 LassoAnalysis]: Preprocessing complete. [2019-01-14 04:33:23,721 INFO L497 LassoAnalysis]: Using template 'affine'. [2019-01-14 04:33:23,722 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 04:33:23,722 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 04:33:23,723 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 04:33:23,723 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 04:33:23,723 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 04:33:23,723 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 04:33:23,724 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 04:33:23,724 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 04:33:23,725 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 04:33:23,726 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 04:33:23,726 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 04:33:23,726 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 04:33:23,727 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 04:33:23,727 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 04:33:23,727 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 04:33:23,728 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 04:33:23,728 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 04:33:23,735 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-01-14 04:33:23,739 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2019-01-14 04:33:23,739 INFO L444 ModelExtractionUtils]: 1 out of 4 variables were initially zero. Simplification set additionally 1 variables to zero. [2019-01-14 04:33:23,740 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-01-14 04:33:23,740 INFO L440 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2019-01-14 04:33:23,740 INFO L518 LassoAnalysis]: Proved termination. [2019-01-14 04:33:23,740 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(gcd_#in~y2) = 1*gcd_#in~y2 Supporting invariants [] [2019-01-14 04:33:23,741 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2019-01-14 04:33:23,945 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 04:33:23,981 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 04:33:23,984 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 04:33:24,000 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 04:33:24,002 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 04:33:24,125 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 04:33:24,126 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 4 loop predicates [2019-01-14 04:33:24,126 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 47 states and 62 transitions. cyclomatic complexity: 18 Second operand 5 states. [2019-01-14 04:33:24,357 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 47 states and 62 transitions. cyclomatic complexity: 18. Second operand 5 states. Result 142 states and 189 transitions. Complement of second has 31 states. [2019-01-14 04:33:24,358 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 7 states 1 stem states 5 non-accepting loop states 1 accepting loop states [2019-01-14 04:33:24,358 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2019-01-14 04:33:24,360 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 36 transitions. [2019-01-14 04:33:24,360 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 36 transitions. Stem has 10 letters. Loop has 5 letters. [2019-01-14 04:33:24,360 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-14 04:33:24,360 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 36 transitions. Stem has 15 letters. Loop has 5 letters. [2019-01-14 04:33:24,361 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-14 04:33:24,361 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 36 transitions. Stem has 10 letters. Loop has 10 letters. [2019-01-14 04:33:24,361 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-14 04:33:24,361 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 142 states and 189 transitions. [2019-01-14 04:33:24,368 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 8 [2019-01-14 04:33:24,375 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 142 states to 118 states and 165 transitions. [2019-01-14 04:33:24,375 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 67 [2019-01-14 04:33:24,376 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 69 [2019-01-14 04:33:24,376 INFO L73 IsDeterministic]: Start isDeterministic. Operand 118 states and 165 transitions. [2019-01-14 04:33:24,377 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-01-14 04:33:24,377 INFO L706 BuchiCegarLoop]: Abstraction has 118 states and 165 transitions. [2019-01-14 04:33:24,377 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 118 states and 165 transitions. [2019-01-14 04:33:24,390 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 118 to 87. [2019-01-14 04:33:24,390 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 87 states. [2019-01-14 04:33:24,392 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87 states to 87 states and 116 transitions. [2019-01-14 04:33:24,392 INFO L729 BuchiCegarLoop]: Abstraction has 87 states and 116 transitions. [2019-01-14 04:33:24,392 INFO L609 BuchiCegarLoop]: Abstraction has 87 states and 116 transitions. [2019-01-14 04:33:24,392 INFO L442 BuchiCegarLoop]: ======== Iteration 3============ [2019-01-14 04:33:24,392 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 87 states and 116 transitions. [2019-01-14 04:33:24,397 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2019-01-14 04:33:24,397 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-14 04:33:24,397 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-14 04:33:24,398 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-14 04:33:24,398 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2019-01-14 04:33:24,399 INFO L794 eck$LassoCheckResult]: Stem: 590#ULTIMATE.startENTRY havoc main_#res;havoc main_#t~nondet3, main_#t~nondet4, main_#t~ret5, main_#t~ret6, main_~z~0, main_~m~0, main_~n~0;main_~m~0 := main_#t~nondet3;havoc main_#t~nondet3; 588#L42 assume !(main_~m~0 <= 0 || main_~m~0 > 2147483647);main_~n~0 := main_#t~nondet4;havoc main_#t~nondet4; 589#L46 assume !(main_~n~0 <= 0 || main_~n~0 > 2147483647); 579#L49 assume main_~m~0 > 0 && main_~n~0 > 0; 560#L50 call main_#t~ret5 := gcd(main_~m~0, main_~n~0);< 586#gcdENTRY ~y1 := #in~y1;~y2 := #in~y2; 597#L16 assume !(~y1 <= 0 || ~y2 <= 0); 596#L16-2 assume ~y1 == ~y2;#res := ~y1; 585#gcdFINAL assume true; 593#gcdEXIT >#72#return; 583#L50-1 main_~z~0 := main_#t~ret5;havoc main_#t~ret5; 575#L51 call main_#t~ret6 := divides(main_~z~0, main_~m~0);< 587#dividesENTRY [2019-01-14 04:33:24,399 INFO L796 eck$LassoCheckResult]: Loop: 587#dividesENTRY ~n := #in~n;~m := #in~m; 591#L31 assume !(0 == ~m); 574#L34 assume !(~n > ~m); 576#L37 call #t~ret2 := divides(~n, ~m - ~n);< 587#dividesENTRY [2019-01-14 04:33:24,399 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 04:33:24,399 INFO L82 PathProgramCache]: Analyzing trace with hash 1766113648, now seen corresponding path program 1 times [2019-01-14 04:33:24,399 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 04:33:24,399 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 04:33:24,400 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 04:33:24,400 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-14 04:33:24,402 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 04:33:24,409 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 04:33:24,415 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 04:33:24,419 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 04:33:24,419 INFO L82 PathProgramCache]: Analyzing trace with hash 927678, now seen corresponding path program 1 times [2019-01-14 04:33:24,419 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 04:33:24,419 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 04:33:24,421 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 04:33:24,421 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 04:33:24,421 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 04:33:24,425 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 04:33:24,428 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 04:33:24,430 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 04:33:24,430 INFO L82 PathProgramCache]: Analyzing trace with hash -853108307, now seen corresponding path program 1 times [2019-01-14 04:33:24,430 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 04:33:24,430 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 04:33:24,432 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 04:33:24,432 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 04:33:24,432 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 04:33:24,440 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 04:33:24,449 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 04:33:24,721 WARN L181 SmtUtils]: Spent 129.00 ms on a formula simplification that was a NOOP. DAG size: 13 [2019-01-14 04:33:24,944 WARN L181 SmtUtils]: Spent 221.00 ms on a formula simplification that was a NOOP. DAG size: 19 [2019-01-14 04:33:25,122 INFO L216 LassoAnalysis]: Preferences: [2019-01-14 04:33:25,122 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-01-14 04:33:25,123 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-01-14 04:33:25,123 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-01-14 04:33:25,123 INFO L127 ssoRankerPreferences]: Use exernal solver: true [2019-01-14 04:33:25,123 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-14 04:33:25,123 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-01-14 04:33:25,123 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-01-14 04:33:25,124 INFO L131 ssoRankerPreferences]: Filename of dumped script: gcd02_true-unreach-call_true-no-overflow_true-termination.c_Iteration3_Lasso [2019-01-14 04:33:25,124 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-01-14 04:33:25,124 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2019-01-14 04:33:25,126 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:33:25,128 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:33:25,130 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:33:25,132 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:33:25,149 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:33:25,152 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:33:25,154 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:33:25,155 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:33:25,160 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:33:25,162 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:33:25,164 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:33:25,166 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:33:25,169 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:33:25,171 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:33:25,439 WARN L181 SmtUtils]: Spent 177.00 ms on a formula simplification that was a NOOP. DAG size: 18 [2019-01-14 04:33:25,455 INFO L300 LassoAnalysis]: Preprocessing complete. [2019-01-14 04:33:25,455 INFO L412 LassoAnalysis]: Checking for nontermination... 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-14 04:33:25,460 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-14 04:33:25,461 INFO L163 nArgumentSynthesizer]: Using integer mode. [2019-01-14 04:33:25,464 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2019-01-14 04:33:25,464 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_main_#t~ret6=0} Honda state: {ULTIMATE.start_main_#t~ret6=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 10 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-14 04:33:25,486 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-14 04:33:25,486 INFO L163 nArgumentSynthesizer]: Using integer mode. [2019-01-14 04:33:25,489 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2019-01-14 04:33:25,489 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_main_#t~ret5=0} Honda state: {ULTIMATE.start_main_#t~ret5=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 11 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 11 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-14 04:33:25,510 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-14 04:33:25,510 INFO L163 nArgumentSynthesizer]: Using integer mode. [2019-01-14 04:33:25,513 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2019-01-14 04:33:25,514 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {divides_#res=0} Honda state: {divides_#res=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 12 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 12 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-14 04:33:25,553 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-14 04:33:25,553 INFO L163 nArgumentSynthesizer]: Using integer mode. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 13 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 13 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-14 04:33:25,583 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2019-01-14 04:33:25,583 INFO L163 nArgumentSynthesizer]: Using integer mode. [2019-01-14 04:33:37,670 INFO L450 LassoAnalysis]: Proving nontermination failed: SMT Solver returned 'unknown'. [2019-01-14 04:33:37,677 INFO L216 LassoAnalysis]: Preferences: [2019-01-14 04:33:37,677 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-01-14 04:33:37,677 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-01-14 04:33:37,677 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-01-14 04:33:37,677 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2019-01-14 04:33:37,677 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-14 04:33:37,677 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-01-14 04:33:37,678 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-01-14 04:33:37,678 INFO L131 ssoRankerPreferences]: Filename of dumped script: gcd02_true-unreach-call_true-no-overflow_true-termination.c_Iteration3_Lasso [2019-01-14 04:33:37,678 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-01-14 04:33:37,678 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2019-01-14 04:33:37,683 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:33:37,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-14 04:33:37,694 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:33:37,696 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:33:37,697 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:33:37,715 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:33:37,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-14 04:33:37,720 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:33:37,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-14 04:33:37,725 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:33:37,728 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:33:37,730 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:33:37,731 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:33:37,736 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:33:37,824 INFO L300 LassoAnalysis]: Preprocessing complete. [2019-01-14 04:33:37,824 INFO L497 LassoAnalysis]: Using template 'affine'. [2019-01-14 04:33:37,824 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 04:33:37,825 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 04:33:37,825 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 04:33:37,825 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 04:33:37,825 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 04:33:37,825 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 04:33:37,826 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 04:33:37,826 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 04:33:37,827 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 04:33:37,827 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 04:33:37,827 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 04:33:37,828 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 04:33:37,828 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 04:33:37,828 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 04:33:37,828 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 04:33:37,828 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 04:33:37,828 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 04:33:37,829 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 04:33:37,829 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 04:33:37,830 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 04:33:37,830 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 04:33:37,830 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 04:33:37,830 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 04:33:37,830 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 04:33:37,831 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 04:33:37,831 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 04:33:37,832 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 04:33:37,832 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 04:33:37,832 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 04:33:37,832 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 04:33:37,833 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 04:33:37,833 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 04:33:37,833 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 04:33:37,833 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 04:33:37,833 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 04:33:37,834 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 04:33:37,834 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 04:33:37,835 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 04:33:37,835 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 04:33:37,835 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2019-01-14 04:33:37,835 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 04:33:37,843 INFO L402 nArgumentSynthesizer]: We have 16 Motzkin's Theorem applications. [2019-01-14 04:33:37,844 INFO L403 nArgumentSynthesizer]: A total of 4 supporting invariants were added. [2019-01-14 04:33:37,968 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-01-14 04:33:38,080 INFO L443 ModelExtractionUtils]: Simplification made 10 calls to the SMT solver. [2019-01-14 04:33:38,080 INFO L444 ModelExtractionUtils]: 6 out of 16 variables were initially zero. Simplification set additionally 4 variables to zero. [2019-01-14 04:33:38,082 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-01-14 04:33:38,094 INFO L440 nArgumentSynthesizer]: Removed 3 redundant supporting invariants from a total of 4. [2019-01-14 04:33:38,094 INFO L518 LassoAnalysis]: Proved termination. [2019-01-14 04:33:38,094 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(divides_#in~m) = 1*divides_#in~m Supporting invariants [1*divides_#in~n - 1 >= 0] [2019-01-14 04:33:38,121 INFO L297 tatePredicateManager]: 0 out of 1 supporting invariants were superfluous and have been removed [2019-01-14 04:33:38,326 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 04:33:38,363 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 04:33:38,367 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 04:33:38,499 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 04:33:38,501 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 04:33:38,543 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 04:33:38,544 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.6 stem predicates 3 loop predicates [2019-01-14 04:33:38,544 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 87 states and 116 transitions. cyclomatic complexity: 34 Second operand 9 states. [2019-01-14 04:33:38,965 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 87 states and 116 transitions. cyclomatic complexity: 34. Second operand 9 states. Result 119 states and 153 transitions. Complement of second has 21 states. [2019-01-14 04:33:38,966 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 10 states 6 stem states 2 non-accepting loop states 2 accepting loop states [2019-01-14 04:33:38,966 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2019-01-14 04:33:38,967 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 31 transitions. [2019-01-14 04:33:38,967 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 10 states and 31 transitions. Stem has 12 letters. Loop has 4 letters. [2019-01-14 04:33:38,967 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-14 04:33:38,968 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 10 states and 31 transitions. Stem has 16 letters. Loop has 4 letters. [2019-01-14 04:33:38,968 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-14 04:33:38,968 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 10 states and 31 transitions. Stem has 12 letters. Loop has 8 letters. [2019-01-14 04:33:38,969 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-14 04:33:38,969 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 119 states and 153 transitions. [2019-01-14 04:33:38,974 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2019-01-14 04:33:38,979 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 119 states to 101 states and 134 transitions. [2019-01-14 04:33:38,979 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 66 [2019-01-14 04:33:38,979 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 67 [2019-01-14 04:33:38,980 INFO L73 IsDeterministic]: Start isDeterministic. Operand 101 states and 134 transitions. [2019-01-14 04:33:38,980 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-01-14 04:33:38,980 INFO L706 BuchiCegarLoop]: Abstraction has 101 states and 134 transitions. [2019-01-14 04:33:38,980 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 101 states and 134 transitions. [2019-01-14 04:33:38,996 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 101 to 91. [2019-01-14 04:33:38,996 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 91 states. [2019-01-14 04:33:38,998 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 91 states to 91 states and 123 transitions. [2019-01-14 04:33:38,999 INFO L729 BuchiCegarLoop]: Abstraction has 91 states and 123 transitions. [2019-01-14 04:33:38,999 INFO L609 BuchiCegarLoop]: Abstraction has 91 states and 123 transitions. [2019-01-14 04:33:38,999 INFO L442 BuchiCegarLoop]: ======== Iteration 4============ [2019-01-14 04:33:38,999 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 91 states and 123 transitions. [2019-01-14 04:33:39,002 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2019-01-14 04:33:39,002 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-14 04:33:39,004 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-14 04:33:39,007 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-14 04:33:39,008 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2019-01-14 04:33:39,009 INFO L794 eck$LassoCheckResult]: Stem: 914#ULTIMATE.startENTRY havoc main_#res;havoc main_#t~nondet3, main_#t~nondet4, main_#t~ret5, main_#t~ret6, main_~z~0, main_~m~0, main_~n~0;main_~m~0 := main_#t~nondet3;havoc main_#t~nondet3; 912#L42 assume !(main_~m~0 <= 0 || main_~m~0 > 2147483647);main_~n~0 := main_#t~nondet4;havoc main_#t~nondet4; 913#L46 assume !(main_~n~0 <= 0 || main_~n~0 > 2147483647); 907#L49 assume main_~m~0 > 0 && main_~n~0 > 0; 880#L50 call main_#t~ret5 := gcd(main_~m~0, main_~n~0);< 910#gcdENTRY ~y1 := #in~y1;~y2 := #in~y2; 923#L16 assume !(~y1 <= 0 || ~y2 <= 0); 924#L16-2 assume !(~y1 == ~y2); 879#L23 assume !(~y1 > ~y2); 881#L26 call #t~ret1 := gcd(~y1, ~y2 - ~y1);< 889#gcdENTRY ~y1 := #in~y1;~y2 := #in~y2; 892#L16 assume !(~y1 <= 0 || ~y2 <= 0); 964#L16-2 assume ~y1 == ~y2;#res := ~y1; 962#gcdFINAL assume true; 949#gcdEXIT >#70#return; 948#L26-1 #res := #t~ret1;havoc #t~ret1; 934#gcdFINAL assume true; 920#gcdEXIT >#72#return; 906#L50-1 main_~z~0 := main_#t~ret5;havoc main_#t~ret5; 897#L51 call main_#t~ret6 := divides(main_~z~0, main_~m~0);< 911#dividesENTRY [2019-01-14 04:33:39,009 INFO L796 eck$LassoCheckResult]: Loop: 911#dividesENTRY ~n := #in~n;~m := #in~m; 915#L31 assume !(0 == ~m); 896#L34 assume !(~n > ~m); 898#L37 call #t~ret2 := divides(~n, ~m - ~n);< 911#dividesENTRY [2019-01-14 04:33:39,009 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 04:33:39,009 INFO L82 PathProgramCache]: Analyzing trace with hash -1971517789, now seen corresponding path program 1 times [2019-01-14 04:33:39,009 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 04:33:39,009 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 04:33:39,011 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 04:33:39,012 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 04:33:39,012 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 04:33:39,025 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 04:33:39,031 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 04:33:39,034 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 04:33:39,034 INFO L82 PathProgramCache]: Analyzing trace with hash 927678, now seen corresponding path program 2 times [2019-01-14 04:33:39,034 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 04:33:39,035 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 04:33:39,035 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 04:33:39,035 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 04:33:39,035 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 04:33:39,039 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 04:33:39,042 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 04:33:39,043 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 04:33:39,043 INFO L82 PathProgramCache]: Analyzing trace with hash 1635978592, now seen corresponding path program 1 times [2019-01-14 04:33:39,043 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 04:33:39,043 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 04:33:39,044 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 04:33:39,044 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-14 04:33:39,044 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 04:33:39,051 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 04:33:39,057 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 04:33:39,195 WARN L181 SmtUtils]: Spent 108.00 ms on a formula simplification that was a NOOP. DAG size: 19 [2019-01-14 04:33:39,685 INFO L216 LassoAnalysis]: Preferences: [2019-01-14 04:33:39,685 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-01-14 04:33:39,685 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-01-14 04:33:39,685 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-01-14 04:33:39,686 INFO L127 ssoRankerPreferences]: Use exernal solver: true [2019-01-14 04:33:39,686 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-14 04:33:39,686 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-01-14 04:33:39,686 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-01-14 04:33:39,686 INFO L131 ssoRankerPreferences]: Filename of dumped script: gcd02_true-unreach-call_true-no-overflow_true-termination.c_Iteration4_Lasso [2019-01-14 04:33:39,686 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-01-14 04:33:39,686 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2019-01-14 04:33:39,688 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:33:39,694 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:33:39,699 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:33:39,702 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:33:39,704 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:33:39,719 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:33:39,721 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:33:39,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-14 04:33:39,726 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:33:39,727 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:33:39,728 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:33:39,733 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:33:39,739 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:33:39,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-14 04:33:39,962 INFO L300 LassoAnalysis]: Preprocessing complete. [2019-01-14 04:33:39,962 INFO L412 LassoAnalysis]: Checking for nontermination... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 14 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 14 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-14 04:33:39,977 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-14 04:33:39,978 INFO L163 nArgumentSynthesizer]: Using integer mode. [2019-01-14 04:33:39,994 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2019-01-14 04:33:39,994 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_main_#t~ret5=0} Honda state: {ULTIMATE.start_main_#t~ret5=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 15 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-01-14 04:33:40,030 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-14 04:33:40,031 INFO L163 nArgumentSynthesizer]: Using integer mode. Waiting until toolchain timeout for monitored process 15 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-14 04:33:40,043 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2019-01-14 04:33:40,043 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {divides_~n=0} Honda state: {divides_~n=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 16 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-01-14 04:33:40,079 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-14 04:33:40,080 INFO L163 nArgumentSynthesizer]: Using integer mode. Waiting until toolchain timeout for monitored process 16 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-14 04:33:40,091 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2019-01-14 04:33:40,091 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_main_#t~nondet3=0} Honda state: {ULTIMATE.start_main_#t~nondet3=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 17 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 17 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-14 04:33:40,112 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-14 04:33:40,112 INFO L163 nArgumentSynthesizer]: Using integer mode. [2019-01-14 04:33:40,117 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2019-01-14 04:33:40,117 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_main_~m~0=0} Honda state: {ULTIMATE.start_main_~m~0=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 18 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 18 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-14 04:33:40,139 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-14 04:33:40,139 INFO L163 nArgumentSynthesizer]: Using integer mode. [2019-01-14 04:33:40,142 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2019-01-14 04:33:40,142 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_main_~z~0=0} Honda state: {ULTIMATE.start_main_~z~0=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 19 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 19 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-14 04:33:40,164 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-14 04:33:40,164 INFO L163 nArgumentSynthesizer]: Using integer mode. [2019-01-14 04:33:40,167 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2019-01-14 04:33:40,167 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {divides_#res=0} Honda state: {divides_#res=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 20 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 20 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-14 04:33:40,191 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-14 04:33:40,191 INFO L163 nArgumentSynthesizer]: Using integer mode. [2019-01-14 04:33:40,194 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2019-01-14 04:33:40,194 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_main_#t~ret6=0} Honda state: {ULTIMATE.start_main_#t~ret6=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 21 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 21 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-14 04:33:40,216 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-14 04:33:40,217 INFO L163 nArgumentSynthesizer]: Using integer mode. [2019-01-14 04:33:40,224 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2019-01-14 04:33:40,224 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {divides_#t~ret2=0} Honda state: {divides_#t~ret2=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 22 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 22 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-14 04:33:40,247 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-14 04:33:40,247 INFO L163 nArgumentSynthesizer]: Using integer mode. [2019-01-14 04:33:40,250 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2019-01-14 04:33:40,250 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_main_~n~0=0} Honda state: {ULTIMATE.start_main_~n~0=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 23 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 23 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-14 04:33:40,271 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-14 04:33:40,272 INFO L163 nArgumentSynthesizer]: Using integer mode. [2019-01-14 04:33:40,274 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2019-01-14 04:33:40,274 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_main_#res=0} Honda state: {ULTIMATE.start_main_#res=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 24 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 24 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-14 04:33:40,295 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-14 04:33:40,295 INFO L163 nArgumentSynthesizer]: Using integer mode. [2019-01-14 04:33:40,297 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2019-01-14 04:33:40,298 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_#t~ret7=0} Honda state: {ULTIMATE.start_#t~ret7=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 25 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 25 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-14 04:33:40,318 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-14 04:33:40,318 INFO L163 nArgumentSynthesizer]: Using integer mode. [2019-01-14 04:33:40,321 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2019-01-14 04:33:40,321 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {divides_~m=0} Honda state: {divides_~m=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 26 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 26 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-14 04:33:40,342 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-14 04:33:40,342 INFO L163 nArgumentSynthesizer]: Using integer mode. [2019-01-14 04:33:40,344 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2019-01-14 04:33:40,345 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_main_#t~nondet4=0} Honda state: {ULTIMATE.start_main_#t~nondet4=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 27 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 27 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-14 04:33:40,367 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-14 04:33:40,367 INFO L163 nArgumentSynthesizer]: Using integer mode. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 28 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 28 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-14 04:33:40,392 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2019-01-14 04:33:40,393 INFO L163 nArgumentSynthesizer]: Using integer mode. [2019-01-14 04:33:46,187 INFO L452 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2019-01-14 04:33:46,193 INFO L216 LassoAnalysis]: Preferences: [2019-01-14 04:33:46,193 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-01-14 04:33:46,193 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-01-14 04:33:46,193 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-01-14 04:33:46,193 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2019-01-14 04:33:46,194 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-14 04:33:46,194 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-01-14 04:33:46,194 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-01-14 04:33:46,194 INFO L131 ssoRankerPreferences]: Filename of dumped script: gcd02_true-unreach-call_true-no-overflow_true-termination.c_Iteration4_Lasso [2019-01-14 04:33:46,194 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-01-14 04:33:46,194 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2019-01-14 04:33:46,195 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:33:46,198 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:33:46,200 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:33:46,203 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:33:46,206 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:33:46,209 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:33:46,212 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:33:46,213 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:33:46,215 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:33:46,218 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:33:46,220 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:33:46,222 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:33:46,223 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:33:46,235 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:33:46,326 INFO L300 LassoAnalysis]: Preprocessing complete. [2019-01-14 04:33:46,326 INFO L497 LassoAnalysis]: Using template 'affine'. [2019-01-14 04:33:46,326 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 04:33:46,327 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 04:33:46,327 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 04:33:46,327 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 04:33:46,327 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 04:33:46,328 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 04:33:46,331 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 04:33:46,331 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 04:33:46,332 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 04:33:46,332 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 04:33:46,333 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 04:33:46,335 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 04:33:46,335 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 04:33:46,335 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 04:33:46,335 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 04:33:46,335 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 04:33:46,335 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 04:33:46,338 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 04:33:46,338 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 04:33:46,339 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 04:33:46,339 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 04:33:46,339 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 04:33:46,339 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 04:33:46,339 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 04:33:46,340 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 04:33:46,340 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 04:33:46,340 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 04:33:46,346 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 04:33:46,346 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 04:33:46,346 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 04:33:46,347 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 04:33:46,347 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 04:33:46,347 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 04:33:46,347 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 04:33:46,348 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 04:33:46,348 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 04:33:46,353 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 04:33:46,354 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 04:33:46,354 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 04:33:46,354 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 04:33:46,355 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 04:33:46,355 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 04:33:46,355 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 04:33:46,355 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 04:33:46,356 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 04:33:46,360 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 04:33:46,360 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 04:33:46,361 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 04:33:46,361 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 04:33:46,361 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 04:33:46,361 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 04:33:46,361 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 04:33:46,362 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 04:33:46,365 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 04:33:46,366 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 04:33:46,366 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 04:33:46,366 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 04:33:46,366 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 04:33:46,367 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 04:33:46,367 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 04:33:46,370 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 04:33:46,370 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 04:33:46,371 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 04:33:46,371 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 04:33:46,371 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 04:33:46,371 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 04:33:46,372 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 04:33:46,372 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 04:33:46,372 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 04:33:46,372 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 04:33:46,372 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 04:33:46,382 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 04:33:46,383 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 04:33:46,383 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 04:33:46,383 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 04:33:46,383 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 04:33:46,384 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 04:33:46,385 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 04:33:46,385 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 04:33:46,385 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 04:33:46,386 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 04:33:46,386 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 04:33:46,387 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 04:33:46,389 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 04:33:46,389 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 04:33:46,389 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 04:33:46,389 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 04:33:46,390 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 04:33:46,390 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 04:33:46,394 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 04:33:46,394 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 04:33:46,395 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 04:33:46,395 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 04:33:46,395 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 04:33:46,395 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 04:33:46,395 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 04:33:46,400 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 04:33:46,400 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 04:33:46,401 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 04:33:46,401 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 04:33:46,402 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 04:33:46,402 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 04:33:46,402 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 04:33:46,402 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 04:33:46,402 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 04:33:46,403 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 04:33:46,403 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 04:33:46,403 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 04:33:46,404 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 04:33:46,404 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 04:33:46,404 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 04:33:46,404 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2019-01-14 04:33:46,404 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 04:33:46,420 INFO L402 nArgumentSynthesizer]: We have 16 Motzkin's Theorem applications. [2019-01-14 04:33:46,420 INFO L403 nArgumentSynthesizer]: A total of 4 supporting invariants were added. [2019-01-14 04:33:46,493 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-01-14 04:33:46,516 INFO L443 ModelExtractionUtils]: Simplification made 4 calls to the SMT solver. [2019-01-14 04:33:46,516 INFO L444 ModelExtractionUtils]: 9 out of 16 variables were initially zero. Simplification set additionally 0 variables to zero. [2019-01-14 04:33:46,517 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-01-14 04:33:46,520 INFO L440 nArgumentSynthesizer]: Removed 3 redundant supporting invariants from a total of 4. [2019-01-14 04:33:46,520 INFO L518 LassoAnalysis]: Proved termination. [2019-01-14 04:33:46,521 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(divides_#in~n, divides_#in~m) = -2*divides_#in~n + 2*divides_#in~m + 1 Supporting invariants [1*divides_#in~n - 1 >= 0] [2019-01-14 04:33:46,548 INFO L297 tatePredicateManager]: 0 out of 1 supporting invariants were superfluous and have been removed [2019-01-14 04:33:46,622 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 04:33:46,643 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 04:33:46,646 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 04:33:46,787 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 04:33:46,789 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 04:33:47,106 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 04:33:47,106 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.7 stem predicates 3 loop predicates [2019-01-14 04:33:47,107 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 91 states and 123 transitions. cyclomatic complexity: 37 Second operand 10 states. [2019-01-14 04:33:47,782 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 91 states and 123 transitions. cyclomatic complexity: 37. Second operand 10 states. Result 117 states and 152 transitions. Complement of second has 23 states. [2019-01-14 04:33:47,783 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 11 states 7 stem states 2 non-accepting loop states 2 accepting loop states [2019-01-14 04:33:47,784 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2019-01-14 04:33:47,784 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 32 transitions. [2019-01-14 04:33:47,784 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 11 states and 32 transitions. Stem has 20 letters. Loop has 4 letters. [2019-01-14 04:33:47,784 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-14 04:33:47,785 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 11 states and 32 transitions. Stem has 24 letters. Loop has 4 letters. [2019-01-14 04:33:47,785 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-14 04:33:47,785 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 11 states and 32 transitions. Stem has 20 letters. Loop has 8 letters. [2019-01-14 04:33:47,785 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-14 04:33:47,785 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 117 states and 152 transitions. [2019-01-14 04:33:47,789 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2019-01-14 04:33:47,791 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 117 states to 94 states and 125 transitions. [2019-01-14 04:33:47,791 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 59 [2019-01-14 04:33:47,791 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 60 [2019-01-14 04:33:47,792 INFO L73 IsDeterministic]: Start isDeterministic. Operand 94 states and 125 transitions. [2019-01-14 04:33:47,796 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-01-14 04:33:47,796 INFO L706 BuchiCegarLoop]: Abstraction has 94 states and 125 transitions. [2019-01-14 04:33:47,796 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 94 states and 125 transitions. [2019-01-14 04:33:47,804 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 94 to 90. [2019-01-14 04:33:47,804 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 90 states. [2019-01-14 04:33:47,805 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 90 states to 90 states and 120 transitions. [2019-01-14 04:33:47,806 INFO L729 BuchiCegarLoop]: Abstraction has 90 states and 120 transitions. [2019-01-14 04:33:47,806 INFO L609 BuchiCegarLoop]: Abstraction has 90 states and 120 transitions. [2019-01-14 04:33:47,806 INFO L442 BuchiCegarLoop]: ======== Iteration 5============ [2019-01-14 04:33:47,806 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 90 states and 120 transitions. [2019-01-14 04:33:47,807 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2019-01-14 04:33:47,807 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-14 04:33:47,807 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-14 04:33:47,808 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-14 04:33:47,808 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2019-01-14 04:33:47,808 INFO L794 eck$LassoCheckResult]: Stem: 1264#ULTIMATE.startENTRY havoc main_#res;havoc main_#t~nondet3, main_#t~nondet4, main_#t~ret5, main_#t~ret6, main_~z~0, main_~m~0, main_~n~0;main_~m~0 := main_#t~nondet3;havoc main_#t~nondet3; 1262#L42 assume !(main_~m~0 <= 0 || main_~m~0 > 2147483647);main_~n~0 := main_#t~nondet4;havoc main_#t~nondet4; 1263#L46 assume !(main_~n~0 <= 0 || main_~n~0 > 2147483647); 1252#L49 assume main_~m~0 > 0 && main_~n~0 > 0; 1253#L50 call main_#t~ret5 := gcd(main_~m~0, main_~n~0);< 1260#gcdENTRY ~y1 := #in~y1;~y2 := #in~y2; 1288#L16 assume !(~y1 <= 0 || ~y2 <= 0); 1286#L16-2 assume !(~y1 == ~y2); 1284#L23 assume ~y1 > ~y2; 1232#L24 call #t~ret0 := gcd(~y1 - ~y2, ~y2);< 1283#gcdENTRY ~y1 := #in~y1;~y2 := #in~y2; 1289#L16 assume !(~y1 <= 0 || ~y2 <= 0); 1271#L16-2 assume ~y1 == ~y2;#res := ~y1; 1239#gcdFINAL assume true; 1268#gcdEXIT >#68#return; 1275#L24-1 #res := #t~ret0;havoc #t~ret0; 1273#gcdFINAL assume true; 1272#gcdEXIT >#72#return; 1257#L50-1 main_~z~0 := main_#t~ret5;havoc main_#t~ret5; 1247#L51 call main_#t~ret6 := divides(main_~z~0, main_~m~0);< 1261#dividesENTRY [2019-01-14 04:33:47,808 INFO L796 eck$LassoCheckResult]: Loop: 1261#dividesENTRY ~n := #in~n;~m := #in~m; 1265#L31 assume !(0 == ~m); 1246#L34 assume !(~n > ~m); 1248#L37 call #t~ret2 := divides(~n, ~m - ~n);< 1261#dividesENTRY [2019-01-14 04:33:47,809 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 04:33:47,809 INFO L82 PathProgramCache]: Analyzing trace with hash 1175107907, now seen corresponding path program 1 times [2019-01-14 04:33:47,809 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 04:33:47,809 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 04:33:47,810 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 04:33:47,810 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 04:33:47,810 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 04:33:47,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 04:33:47,818 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 04:33:47,821 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 04:33:47,821 INFO L82 PathProgramCache]: Analyzing trace with hash 927678, now seen corresponding path program 3 times [2019-01-14 04:33:47,821 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 04:33:47,822 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 04:33:47,822 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 04:33:47,822 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 04:33:47,822 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 04:33:47,824 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 04:33:47,826 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 04:33:47,827 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 04:33:47,827 INFO L82 PathProgramCache]: Analyzing trace with hash 1672900608, now seen corresponding path program 1 times [2019-01-14 04:33:47,827 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 04:33:47,827 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 04:33:47,828 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 04:33:47,828 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-14 04:33:47,828 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 04:33:47,832 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 04:33:47,837 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 04:33:47,977 WARN L181 SmtUtils]: Spent 105.00 ms on a formula simplification that was a NOOP. DAG size: 19 [2019-01-14 04:33:48,290 INFO L216 LassoAnalysis]: Preferences: [2019-01-14 04:33:48,290 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-01-14 04:33:48,290 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-01-14 04:33:48,291 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-01-14 04:33:48,291 INFO L127 ssoRankerPreferences]: Use exernal solver: true [2019-01-14 04:33:48,291 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-14 04:33:48,291 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-01-14 04:33:48,291 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-01-14 04:33:48,291 INFO L131 ssoRankerPreferences]: Filename of dumped script: gcd02_true-unreach-call_true-no-overflow_true-termination.c_Iteration5_Lasso [2019-01-14 04:33:48,292 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-01-14 04:33:48,292 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2019-01-14 04:33:48,294 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:33:48,297 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:33:48,299 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:33:48,301 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:33:48,339 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:33:48,341 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:33:48,347 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:33:48,349 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:33:48,350 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:33:48,351 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:33:48,352 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:33:48,353 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:33:48,355 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:33:48,356 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:33:48,450 INFO L300 LassoAnalysis]: Preprocessing complete. [2019-01-14 04:33:48,450 INFO L412 LassoAnalysis]: Checking for nontermination... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 29 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 29 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-14 04:33:48,459 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-14 04:33:48,459 INFO L163 nArgumentSynthesizer]: Using integer mode. [2019-01-14 04:33:48,461 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2019-01-14 04:33:48,462 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_main_#t~ret6=0} Honda state: {ULTIMATE.start_main_#t~ret6=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 30 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 30 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-14 04:33:48,483 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-14 04:33:48,483 INFO L163 nArgumentSynthesizer]: Using integer mode. [2019-01-14 04:33:48,486 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2019-01-14 04:33:48,486 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_main_#t~ret5=0} Honda state: {ULTIMATE.start_main_#t~ret5=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 31 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 31 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-14 04:33:48,507 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-14 04:33:48,507 INFO L163 nArgumentSynthesizer]: Using integer mode. [2019-01-14 04:33:48,509 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2019-01-14 04:33:48,509 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_main_~m~0=0} Honda state: {ULTIMATE.start_main_~m~0=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 32 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 32 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-14 04:33:48,531 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-14 04:33:48,531 INFO L163 nArgumentSynthesizer]: Using integer mode. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 33 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 33 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-14 04:33:48,557 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2019-01-14 04:33:48,557 INFO L163 nArgumentSynthesizer]: Using integer mode. [2019-01-14 04:34:07,856 INFO L450 LassoAnalysis]: Proving nontermination failed: SMT Solver returned 'unknown'. [2019-01-14 04:34:07,862 INFO L216 LassoAnalysis]: Preferences: [2019-01-14 04:34:07,862 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-01-14 04:34:07,862 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-01-14 04:34:07,863 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-01-14 04:34:07,863 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2019-01-14 04:34:07,863 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-14 04:34:07,863 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-01-14 04:34:07,863 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-01-14 04:34:07,863 INFO L131 ssoRankerPreferences]: Filename of dumped script: gcd02_true-unreach-call_true-no-overflow_true-termination.c_Iteration5_Lasso [2019-01-14 04:34:07,863 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-01-14 04:34:07,863 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2019-01-14 04:34:07,864 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:34:07,870 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:34:07,873 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:34:07,875 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:34:07,879 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:34:07,895 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:34:07,897 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:34:07,899 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:34:07,900 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:34:07,902 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:34:07,904 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:34:07,905 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:34:07,906 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:34:07,907 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:34:08,001 INFO L300 LassoAnalysis]: Preprocessing complete. [2019-01-14 04:34:08,001 INFO L497 LassoAnalysis]: Using template 'affine'. [2019-01-14 04:34:08,002 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 04:34:08,002 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 04:34:08,002 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 04:34:08,003 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 04:34:08,003 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 04:34:08,003 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 04:34:08,003 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 04:34:08,003 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 04:34:08,004 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 04:34:08,004 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 04:34:08,004 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 04:34:08,005 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 04:34:08,005 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 04:34:08,005 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 04:34:08,005 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 04:34:08,005 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 04:34:08,005 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 04:34:08,006 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 04:34:08,006 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 04:34:08,006 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 04:34:08,006 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 04:34:08,007 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 04:34:08,007 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 04:34:08,007 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 04:34:08,007 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 04:34:08,007 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 04:34:08,008 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 04:34:08,008 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 04:34:08,008 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 04:34:08,008 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 04:34:08,008 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 04:34:08,009 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 04:34:08,009 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 04:34:08,009 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 04:34:08,009 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 04:34:08,009 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 04:34:08,010 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 04:34:08,010 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 04:34:08,010 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 04:34:08,010 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2019-01-14 04:34:08,010 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 04:34:08,013 INFO L402 nArgumentSynthesizer]: We have 16 Motzkin's Theorem applications. [2019-01-14 04:34:08,014 INFO L403 nArgumentSynthesizer]: A total of 4 supporting invariants were added. [2019-01-14 04:34:08,064 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-01-14 04:34:08,112 INFO L443 ModelExtractionUtils]: Simplification made 8 calls to the SMT solver. [2019-01-14 04:34:08,113 INFO L444 ModelExtractionUtils]: 5 out of 16 variables were initially zero. Simplification set additionally 5 variables to zero. [2019-01-14 04:34:08,113 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-01-14 04:34:08,115 INFO L440 nArgumentSynthesizer]: Removed 3 redundant supporting invariants from a total of 4. [2019-01-14 04:34:08,115 INFO L518 LassoAnalysis]: Proved termination. [2019-01-14 04:34:08,115 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(divides_#in~m) = 1*divides_#in~m Supporting invariants [1*divides_#in~n - 1 >= 0] [2019-01-14 04:34:08,142 INFO L297 tatePredicateManager]: 0 out of 1 supporting invariants were superfluous and have been removed [2019-01-14 04:34:08,338 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 04:34:08,360 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 04:34:08,364 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 04:34:08,483 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 04:34:08,485 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 04:34:08,515 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 04:34:08,516 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.7 stem predicates 3 loop predicates [2019-01-14 04:34:08,516 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 90 states and 120 transitions. cyclomatic complexity: 35 Second operand 10 states. [2019-01-14 04:34:08,906 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 90 states and 120 transitions. cyclomatic complexity: 35. Second operand 10 states. Result 114 states and 145 transitions. Complement of second has 23 states. [2019-01-14 04:34:08,909 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 11 states 7 stem states 2 non-accepting loop states 2 accepting loop states [2019-01-14 04:34:08,909 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2019-01-14 04:34:08,909 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 32 transitions. [2019-01-14 04:34:08,910 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 11 states and 32 transitions. Stem has 20 letters. Loop has 4 letters. [2019-01-14 04:34:08,910 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-14 04:34:08,910 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 11 states and 32 transitions. Stem has 24 letters. Loop has 4 letters. [2019-01-14 04:34:08,910 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-14 04:34:08,910 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 11 states and 32 transitions. Stem has 20 letters. Loop has 8 letters. [2019-01-14 04:34:08,911 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-14 04:34:08,911 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 114 states and 145 transitions. [2019-01-14 04:34:08,916 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2019-01-14 04:34:08,918 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 114 states to 92 states and 121 transitions. [2019-01-14 04:34:08,918 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 57 [2019-01-14 04:34:08,918 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 58 [2019-01-14 04:34:08,918 INFO L73 IsDeterministic]: Start isDeterministic. Operand 92 states and 121 transitions. [2019-01-14 04:34:08,919 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-01-14 04:34:08,919 INFO L706 BuchiCegarLoop]: Abstraction has 92 states and 121 transitions. [2019-01-14 04:34:08,919 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 92 states and 121 transitions. [2019-01-14 04:34:08,926 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 92 to 90. [2019-01-14 04:34:08,927 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 90 states. [2019-01-14 04:34:08,928 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 90 states to 90 states and 119 transitions. [2019-01-14 04:34:08,930 INFO L729 BuchiCegarLoop]: Abstraction has 90 states and 119 transitions. [2019-01-14 04:34:08,930 INFO L609 BuchiCegarLoop]: Abstraction has 90 states and 119 transitions. [2019-01-14 04:34:08,930 INFO L442 BuchiCegarLoop]: ======== Iteration 6============ [2019-01-14 04:34:08,931 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 90 states and 119 transitions. [2019-01-14 04:34:08,932 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2019-01-14 04:34:08,932 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-14 04:34:08,932 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-14 04:34:08,933 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-14 04:34:08,933 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2019-01-14 04:34:08,933 INFO L794 eck$LassoCheckResult]: Stem: 1614#ULTIMATE.startENTRY havoc main_#res;havoc main_#t~nondet3, main_#t~nondet4, main_#t~ret5, main_#t~ret6, main_~z~0, main_~m~0, main_~n~0;main_~m~0 := main_#t~nondet3;havoc main_#t~nondet3; 1612#L42 assume !(main_~m~0 <= 0 || main_~m~0 > 2147483647);main_~n~0 := main_#t~nondet4;havoc main_#t~nondet4; 1613#L46 assume !(main_~n~0 <= 0 || main_~n~0 > 2147483647); 1600#L49 assume main_~m~0 > 0 && main_~n~0 > 0; 1601#L50 call main_#t~ret5 := gcd(main_~m~0, main_~n~0);< 1610#gcdENTRY ~y1 := #in~y1;~y2 := #in~y2; 1636#L16 assume !(~y1 <= 0 || ~y2 <= 0); 1635#L16-2 assume !(~y1 == ~y2); 1634#L23 assume ~y1 > ~y2; 1580#L24 call #t~ret0 := gcd(~y1 - ~y2, ~y2);< 1629#gcdENTRY ~y1 := #in~y1;~y2 := #in~y2; 1640#L16 assume !(~y1 <= 0 || ~y2 <= 0); 1621#L16-2 assume !(~y1 == ~y2); 1579#L23 assume !(~y1 > ~y2); 1582#L26 call #t~ret1 := gcd(~y1, ~y2 - ~y1);< 1588#gcdENTRY ~y1 := #in~y1;~y2 := #in~y2; 1590#L16 assume !(~y1 <= 0 || ~y2 <= 0); 1602#L16-2 assume ~y1 == ~y2;#res := ~y1; 1603#gcdFINAL assume true; 1618#gcdEXIT >#70#return; 1617#L26-1 #res := #t~ret1;havoc #t~ret1; 1661#gcdFINAL assume true; 1626#gcdEXIT >#68#return; 1625#L24-1 #res := #t~ret0;havoc #t~ret0; 1623#gcdFINAL assume true; 1622#gcdEXIT >#72#return; 1599#L50-1 main_~z~0 := main_#t~ret5;havoc main_#t~ret5; 1595#L51 call main_#t~ret6 := divides(main_~z~0, main_~m~0);< 1611#dividesENTRY [2019-01-14 04:34:08,933 INFO L796 eck$LassoCheckResult]: Loop: 1611#dividesENTRY ~n := #in~n;~m := #in~m; 1615#L31 assume !(0 == ~m); 1594#L34 assume !(~n > ~m); 1596#L37 call #t~ret2 := divides(~n, ~m - ~n);< 1611#dividesENTRY [2019-01-14 04:34:08,933 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 04:34:08,934 INFO L82 PathProgramCache]: Analyzing trace with hash 531576368, now seen corresponding path program 1 times [2019-01-14 04:34:08,935 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 04:34:08,935 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 04:34:08,936 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 04:34:08,936 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 04:34:08,936 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 04:34:08,950 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 04:34:08,957 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 04:34:08,964 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 04:34:08,964 INFO L82 PathProgramCache]: Analyzing trace with hash 927678, now seen corresponding path program 4 times [2019-01-14 04:34:08,964 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 04:34:08,964 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 04:34:08,965 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 04:34:08,965 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 04:34:08,965 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 04:34:08,970 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 04:34:08,971 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 04:34:08,973 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 04:34:08,974 INFO L82 PathProgramCache]: Analyzing trace with hash -1412911507, now seen corresponding path program 1 times [2019-01-14 04:34:08,974 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 04:34:08,974 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 04:34:08,974 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 04:34:08,975 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-14 04:34:08,976 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 04:34:08,984 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 04:34:08,993 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 04:34:09,447 INFO L216 LassoAnalysis]: Preferences: [2019-01-14 04:34:09,448 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-01-14 04:34:09,448 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-01-14 04:34:09,448 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-01-14 04:34:09,448 INFO L127 ssoRankerPreferences]: Use exernal solver: true [2019-01-14 04:34:09,448 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-14 04:34:09,448 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-01-14 04:34:09,449 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-01-14 04:34:09,449 INFO L131 ssoRankerPreferences]: Filename of dumped script: gcd02_true-unreach-call_true-no-overflow_true-termination.c_Iteration6_Lasso [2019-01-14 04:34:09,449 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-01-14 04:34:09,449 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2019-01-14 04:34:09,451 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:34:09,454 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:34:09,455 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:34:09,457 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:34:09,458 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:34:09,465 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:34:09,467 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:34:09,481 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:34:09,483 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:34:09,486 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:34:09,489 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:34:09,490 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:34:09,492 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:34:09,495 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:34:09,612 INFO L300 LassoAnalysis]: Preprocessing complete. [2019-01-14 04:34:09,612 INFO L412 LassoAnalysis]: Checking for nontermination... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 34 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 34 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-14 04:34:09,616 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-14 04:34:09,616 INFO L163 nArgumentSynthesizer]: Using integer mode. [2019-01-14 04:34:09,619 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2019-01-14 04:34:09,620 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_main_#t~ret6=0} Honda state: {ULTIMATE.start_main_#t~ret6=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 35 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 35 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-14 04:34:09,641 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-14 04:34:09,641 INFO L163 nArgumentSynthesizer]: Using integer mode. [2019-01-14 04:34:09,644 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2019-01-14 04:34:09,644 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_main_#t~ret5=0} Honda state: {ULTIMATE.start_main_#t~ret5=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 36 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 36 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-14 04:34:09,664 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-14 04:34:09,664 INFO L163 nArgumentSynthesizer]: Using integer mode. [2019-01-14 04:34:09,667 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2019-01-14 04:34:09,667 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {divides_#t~ret2=0} Honda state: {divides_#t~ret2=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 37 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 37 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-14 04:34:09,688 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-14 04:34:09,688 INFO L163 nArgumentSynthesizer]: Using integer mode. [2019-01-14 04:34:09,690 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2019-01-14 04:34:09,691 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_#t~ret7=0} Honda state: {ULTIMATE.start_#t~ret7=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 38 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 38 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-14 04:34:09,713 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-14 04:34:09,713 INFO L163 nArgumentSynthesizer]: Using integer mode. [2019-01-14 04:34:09,716 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2019-01-14 04:34:09,716 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_main_~m~0=0} Honda state: {ULTIMATE.start_main_~m~0=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 39 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 39 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-14 04:34:09,738 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-14 04:34:09,738 INFO L163 nArgumentSynthesizer]: Using integer mode. [2019-01-14 04:34:09,741 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2019-01-14 04:34:09,741 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {divides_~m=0} Honda state: {divides_~m=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 40 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 40 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-14 04:34:09,764 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-14 04:34:09,765 INFO L163 nArgumentSynthesizer]: Using integer mode. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 41 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 41 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-14 04:34:09,803 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2019-01-14 04:34:09,803 INFO L163 nArgumentSynthesizer]: Using integer mode. [2019-01-14 04:34:11,494 INFO L452 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2019-01-14 04:34:11,500 INFO L216 LassoAnalysis]: Preferences: [2019-01-14 04:34:11,500 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-01-14 04:34:11,500 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-01-14 04:34:11,500 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-01-14 04:34:11,500 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2019-01-14 04:34:11,500 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-14 04:34:11,500 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-01-14 04:34:11,501 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-01-14 04:34:11,501 INFO L131 ssoRankerPreferences]: Filename of dumped script: gcd02_true-unreach-call_true-no-overflow_true-termination.c_Iteration6_Lasso [2019-01-14 04:34:11,501 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-01-14 04:34:11,501 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2019-01-14 04:34:11,502 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:34:11,505 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:34:11,509 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:34:11,515 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:34:11,517 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:34:11,518 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:34:11,527 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:34:11,534 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:34:11,536 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:34:11,538 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:34:11,539 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:34:11,556 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:34:11,558 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:34:11,561 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:34:11,664 INFO L300 LassoAnalysis]: Preprocessing complete. [2019-01-14 04:34:11,665 INFO L497 LassoAnalysis]: Using template 'affine'. [2019-01-14 04:34:11,665 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 04:34:11,666 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 04:34:11,666 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 04:34:11,666 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 04:34:11,666 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 04:34:11,667 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 04:34:11,667 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 04:34:11,667 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 04:34:11,670 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 04:34:11,670 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 04:34:11,671 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 04:34:11,671 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 04:34:11,671 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 04:34:11,671 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 04:34:11,671 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 04:34:11,672 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 04:34:11,672 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 04:34:11,672 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 04:34:11,681 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 04:34:11,681 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 04:34:11,681 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 04:34:11,682 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 04:34:11,682 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 04:34:11,682 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 04:34:11,682 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 04:34:11,682 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 04:34:11,683 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 04:34:11,683 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 04:34:11,683 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 04:34:11,684 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 04:34:11,688 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 04:34:11,688 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 04:34:11,688 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 04:34:11,689 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 04:34:11,689 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 04:34:11,689 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 04:34:11,690 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 04:34:11,690 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 04:34:11,690 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 04:34:11,690 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 04:34:11,690 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 04:34:11,691 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 04:34:11,696 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 04:34:11,696 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 04:34:11,697 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 04:34:11,697 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 04:34:11,697 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 04:34:11,698 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 04:34:11,698 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 04:34:11,698 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 04:34:11,698 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 04:34:11,698 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 04:34:11,698 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 04:34:11,699 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 04:34:11,699 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 04:34:11,700 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 04:34:11,703 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 04:34:11,703 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 04:34:11,703 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 04:34:11,703 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 04:34:11,704 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 04:34:11,704 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 04:34:11,704 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 04:34:11,705 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 04:34:11,708 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 04:34:11,708 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 04:34:11,708 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 04:34:11,709 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 04:34:11,709 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 04:34:11,709 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 04:34:11,709 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 04:34:11,710 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 04:34:11,710 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 04:34:11,710 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 04:34:11,711 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 04:34:11,711 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 04:34:11,711 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 04:34:11,711 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 04:34:11,711 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 04:34:11,711 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 04:34:11,714 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 04:34:11,714 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 04:34:11,715 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 04:34:11,715 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 04:34:11,715 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 04:34:11,715 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 04:34:11,715 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 04:34:11,716 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 04:34:11,716 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 04:34:11,716 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 04:34:11,721 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 04:34:11,721 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 04:34:11,722 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 04:34:11,722 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2019-01-14 04:34:11,722 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 04:34:11,728 INFO L402 nArgumentSynthesizer]: We have 16 Motzkin's Theorem applications. [2019-01-14 04:34:11,728 INFO L403 nArgumentSynthesizer]: A total of 4 supporting invariants were added. [2019-01-14 04:34:11,782 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-01-14 04:34:11,853 INFO L443 ModelExtractionUtils]: Simplification made 10 calls to the SMT solver. [2019-01-14 04:34:11,854 INFO L444 ModelExtractionUtils]: 6 out of 16 variables were initially zero. Simplification set additionally 4 variables to zero. [2019-01-14 04:34:11,854 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-01-14 04:34:11,859 INFO L440 nArgumentSynthesizer]: Removed 3 redundant supporting invariants from a total of 4. [2019-01-14 04:34:11,860 INFO L518 LassoAnalysis]: Proved termination. [2019-01-14 04:34:11,860 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(divides_#in~m) = 1*divides_#in~m Supporting invariants [3*divides_#in~n - 1 >= 0] [2019-01-14 04:34:11,888 INFO L297 tatePredicateManager]: 0 out of 1 supporting invariants were superfluous and have been removed [2019-01-14 04:34:12,147 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 04:34:12,178 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 04:34:12,182 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 04:34:12,458 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 04:34:12,460 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 04:34:12,520 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 04:34:12,520 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.8 stem predicates 3 loop predicates [2019-01-14 04:34:12,520 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 90 states and 119 transitions. cyclomatic complexity: 34 Second operand 11 states. [2019-01-14 04:34:12,882 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 90 states and 119 transitions. cyclomatic complexity: 34. Second operand 11 states. Result 100 states and 129 transitions. Complement of second has 23 states. [2019-01-14 04:34:12,888 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 11 states 8 stem states 2 non-accepting loop states 1 accepting loop states [2019-01-14 04:34:12,888 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2019-01-14 04:34:12,889 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 25 transitions. [2019-01-14 04:34:12,889 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 11 states and 25 transitions. Stem has 28 letters. Loop has 4 letters. [2019-01-14 04:34:12,889 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-14 04:34:12,889 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 11 states and 25 transitions. Stem has 32 letters. Loop has 4 letters. [2019-01-14 04:34:12,890 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-14 04:34:12,890 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 11 states and 25 transitions. Stem has 28 letters. Loop has 8 letters. [2019-01-14 04:34:12,890 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-14 04:34:12,890 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 100 states and 129 transitions. [2019-01-14 04:34:12,893 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2019-01-14 04:34:12,893 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 100 states to 0 states and 0 transitions. [2019-01-14 04:34:12,893 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2019-01-14 04:34:12,893 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2019-01-14 04:34:12,894 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2019-01-14 04:34:12,894 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-01-14 04:34:12,894 INFO L706 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-01-14 04:34:12,894 INFO L729 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-01-14 04:34:12,894 INFO L609 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-01-14 04:34:12,894 INFO L442 BuchiCegarLoop]: ======== Iteration 7============ [2019-01-14 04:34:12,894 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2019-01-14 04:34:12,894 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2019-01-14 04:34:12,894 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2019-01-14 04:34:12,908 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 14.01 04:34:12 BoogieIcfgContainer [2019-01-14 04:34:12,908 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2019-01-14 04:34:12,908 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-01-14 04:34:12,908 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-01-14 04:34:12,909 INFO L276 PluginConnector]: Witness Printer initialized [2019-01-14 04:34:12,909 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.01 04:33:20" (3/4) ... [2019-01-14 04:34:12,916 INFO L147 WitnessPrinter]: No result that supports witness generation found [2019-01-14 04:34:12,918 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-01-14 04:34:12,919 INFO L168 Benchmark]: Toolchain (without parser) took 53239.00 ms. Allocated memory was 1.0 GB in the beginning and 1.3 GB in the end (delta: 302.0 MB). Free memory was 952.7 MB in the beginning and 1.2 GB in the end (delta: -259.9 MB). Peak memory consumption was 42.1 MB. Max. memory is 11.5 GB. [2019-01-14 04:34:12,920 INFO L168 Benchmark]: CDTParser took 0.16 ms. Allocated memory is still 1.0 GB. Free memory is still 978.2 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-01-14 04:34:12,922 INFO L168 Benchmark]: CACSL2BoogieTranslator took 318.25 ms. Allocated memory is still 1.0 GB. Free memory was 952.7 MB in the beginning and 942.0 MB in the end (delta: 10.7 MB). Peak memory consumption was 10.7 MB. Max. memory is 11.5 GB. [2019-01-14 04:34:12,922 INFO L168 Benchmark]: Boogie Procedure Inliner took 39.46 ms. Allocated memory is still 1.0 GB. Free memory is still 942.0 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-01-14 04:34:12,923 INFO L168 Benchmark]: Boogie Preprocessor took 25.68 ms. Allocated memory is still 1.0 GB. Free memory was 942.0 MB in the beginning and 936.6 MB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. [2019-01-14 04:34:12,923 INFO L168 Benchmark]: RCFGBuilder took 494.60 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 129.0 MB). Free memory was 936.6 MB in the beginning and 1.1 GB in the end (delta: -169.2 MB). Peak memory consumption was 13.4 MB. Max. memory is 11.5 GB. [2019-01-14 04:34:12,926 INFO L168 Benchmark]: BuchiAutomizer took 52345.64 ms. Allocated memory was 1.2 GB in the beginning and 1.3 GB in the end (delta: 173.0 MB). Free memory was 1.1 GB in the beginning and 1.2 GB in the end (delta: -106.8 MB). Peak memory consumption was 66.2 MB. Max. memory is 11.5 GB. [2019-01-14 04:34:12,928 INFO L168 Benchmark]: Witness Printer took 9.83 ms. Allocated memory is still 1.3 GB. Free memory is still 1.2 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-01-14 04:34:12,933 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.16 ms. Allocated memory is still 1.0 GB. Free memory is still 978.2 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 318.25 ms. Allocated memory is still 1.0 GB. Free memory was 952.7 MB in the beginning and 942.0 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 39.46 ms. Allocated memory is still 1.0 GB. Free memory is still 942.0 MB. There was no memory consumed. Max. memory is 11.5 GB. * Boogie Preprocessor took 25.68 ms. Allocated memory is still 1.0 GB. Free memory was 942.0 MB in the beginning and 936.6 MB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. * RCFGBuilder took 494.60 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 129.0 MB). Free memory was 936.6 MB in the beginning and 1.1 GB in the end (delta: -169.2 MB). Peak memory consumption was 13.4 MB. Max. memory is 11.5 GB. * BuchiAutomizer took 52345.64 ms. Allocated memory was 1.2 GB in the beginning and 1.3 GB in the end (delta: 173.0 MB). Free memory was 1.1 GB in the beginning and 1.2 GB in the end (delta: -106.8 MB). Peak memory consumption was 66.2 MB. Max. memory is 11.5 GB. * Witness Printer took 9.83 ms. Allocated memory is still 1.3 GB. Free memory is still 1.2 GB. There was no memory consumed. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Constructed decomposition of program Your program was decomposed into 6 terminating modules (0 trivial, 6 deterministic, 0 nondeterministic). One deterministic module has affine ranking function \old(y1) and consists of 8 locations. One deterministic module has affine ranking function \old(y2) and consists of 7 locations. One deterministic module has affine ranking function \old(m) and consists of 10 locations. One deterministic module has affine ranking function -2 * \old(n) + 2 * \old(m) + 1 and consists of 11 locations. One deterministic module has affine ranking function \old(m) and consists of 11 locations. One deterministic module has affine ranking function \old(m) and consists of 11 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 52.2s and 7 iterations. TraceHistogramMax:3. Analysis of lassos took 46.7s. Construction of modules took 0.7s. Büchi inclusion checks took 4.4s. Highest rank in rank-based complementation 3. Minimization of det autom 1. Minimization of nondet autom 5. Automata minimization 0.0s AutomataMinimizationTime, 5 MinimizatonAttempts, 61 StatesRemovedByMinimization, 5 NontrivialMinimizations. Non-live state removal took 0.0s Buchi closure took 0.0s. Biggest automaton had 91 states and ocurred in iteration 3. Nontrivial modules had stage [6, 0, 0, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 93 SDtfs, 207 SDslu, 133 SDs, 0 SdLazy, 363 SolverSat, 132 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.7s Time LassoAnalysisResults: nont0 unkn0 SFLI0 SFLT2 conc0 concLT0 SILN0 SILU0 SILI0 SILT0 lasso4 LassoPreprocessingBenchmarks: Lassos: inital25 mio100 ax100 hnf100 lsp100 ukn100 mio100 lsp100 div100 bol100 ite100 ukn100 eq168 hnf93 smp96 dnf130 smp100 tf102 neg97 sie111 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: sat Degree: 0 Time: 259ms VariablesStem: 2 VariablesLoop: 4 DisjunctsStem: 1 DisjunctsLoop: 2 SupportingInvariants: 4 MotzkinApplications: 16 LassoTerminationAnalysisBenchmarks: LassoNonterminationAnalysisSatFixpoint: 28 LassoNonterminationAnalysisSatUnbounded: 0 LassoNonterminationAnalysisUnsat: 4 LassoNonterminationAnalysisUnknown: 2 LassoNonterminationAnalysisTime: 39.5s - TerminationAnalysisResult: Termination proven Buchi Automizer proved that your program is terminating RESULT: Ultimate proved your program to be correct! Received shutdown request...