./Ultimate.py --spec /storage/repos/svcomp/c/properties/termination.prp --file /storage/repos/svcomp/c/bitvector/gcd_4_true-unreach-call_true-no-overflow_true-termination.i --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/bitvector/gcd_4_true-unreach-call_true-no-overflow_true-termination.i -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 9918b49e0d76e4ce36b6a6760021b33460a8ae9b ....................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.24-0ed9222-m [2019-01-14 02:50:04,537 INFO L170 SettingsManager]: Resetting all preferences to default values... [2019-01-14 02:50:04,539 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2019-01-14 02:50:04,554 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-01-14 02:50:04,554 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-01-14 02:50:04,555 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-01-14 02:50:04,557 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-01-14 02:50:04,562 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2019-01-14 02:50:04,565 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-01-14 02:50:04,566 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-01-14 02:50:04,568 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-01-14 02:50:04,568 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-01-14 02:50:04,569 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-01-14 02:50:04,570 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-01-14 02:50:04,571 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-01-14 02:50:04,572 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-01-14 02:50:04,573 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-01-14 02:50:04,575 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-01-14 02:50:04,577 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2019-01-14 02:50:04,579 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-01-14 02:50:04,580 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-01-14 02:50:04,581 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-01-14 02:50:04,584 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-01-14 02:50:04,585 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-01-14 02:50:04,585 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-01-14 02:50:04,586 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-01-14 02:50:04,587 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-01-14 02:50:04,588 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-01-14 02:50:04,589 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2019-01-14 02:50:04,590 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-01-14 02:50:04,591 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2019-01-14 02:50:04,591 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-01-14 02:50:04,592 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-01-14 02:50:04,592 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2019-01-14 02:50:04,593 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2019-01-14 02:50:04,597 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2019-01-14 02:50:04,597 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-32bit-Automizer_Default.epf [2019-01-14 02:50:04,628 INFO L110 SettingsManager]: Loading preferences was successful [2019-01-14 02:50:04,629 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2019-01-14 02:50:04,631 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-01-14 02:50:04,631 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2019-01-14 02:50:04,631 INFO L133 SettingsManager]: * Use SBE=true [2019-01-14 02:50:04,632 INFO L131 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2019-01-14 02:50:04,632 INFO L133 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2019-01-14 02:50:04,632 INFO L133 SettingsManager]: * Use old map elimination=false [2019-01-14 02:50:04,632 INFO L133 SettingsManager]: * Use external solver (rank synthesis)=false [2019-01-14 02:50:04,632 INFO L133 SettingsManager]: * Use only trivial implications for array writes=true [2019-01-14 02:50:04,632 INFO L133 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2019-01-14 02:50:04,634 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-01-14 02:50:04,634 INFO L133 SettingsManager]: * sizeof long=4 [2019-01-14 02:50:04,634 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2019-01-14 02:50:04,634 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2019-01-14 02:50:04,634 INFO L133 SettingsManager]: * sizeof POINTER=4 [2019-01-14 02:50:04,634 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2019-01-14 02:50:04,635 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2019-01-14 02:50:04,636 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2019-01-14 02:50:04,636 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2019-01-14 02:50:04,636 INFO L133 SettingsManager]: * sizeof long double=12 [2019-01-14 02:50:04,636 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2019-01-14 02:50:04,636 INFO L133 SettingsManager]: * Assume nondeterminstic values are in range=false [2019-01-14 02:50:04,636 INFO L133 SettingsManager]: * Use constant arrays=true [2019-01-14 02:50:04,637 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2019-01-14 02:50:04,637 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-01-14 02:50:04,637 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-01-14 02:50:04,637 INFO L133 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2019-01-14 02:50:04,637 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-01-14 02:50:04,638 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2019-01-14 02:50:04,639 INFO L133 SettingsManager]: * Dump automata to the following directory=/home/matthias/ultimate/dump/auto [2019-01-14 02:50:04,642 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2019-01-14 02:50:04,642 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 -> 9918b49e0d76e4ce36b6a6760021b33460a8ae9b [2019-01-14 02:50:04,699 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-01-14 02:50:04,715 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-01-14 02:50:04,722 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-01-14 02:50:04,724 INFO L271 PluginConnector]: Initializing CDTParser... [2019-01-14 02:50:04,724 INFO L276 PluginConnector]: CDTParser initialized [2019-01-14 02:50:04,725 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/svcomp/c/bitvector/gcd_4_true-unreach-call_true-no-overflow_true-termination.i [2019-01-14 02:50:04,784 INFO L221 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/298c4c6a0/1680e3d2732e417a9a34ad2812b6f0b4/FLAG250bb7b3e [2019-01-14 02:50:05,202 INFO L307 CDTParser]: Found 1 translation units. [2019-01-14 02:50:05,202 INFO L161 CDTParser]: Scanning /storage/repos/svcomp/c/bitvector/gcd_4_true-unreach-call_true-no-overflow_true-termination.i [2019-01-14 02:50:05,207 INFO L355 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/298c4c6a0/1680e3d2732e417a9a34ad2812b6f0b4/FLAG250bb7b3e [2019-01-14 02:50:05,590 INFO L363 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/298c4c6a0/1680e3d2732e417a9a34ad2812b6f0b4 [2019-01-14 02:50:05,593 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-01-14 02:50:05,595 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-01-14 02:50:05,597 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-01-14 02:50:05,597 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-01-14 02:50:05,601 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2019-01-14 02:50:05,601 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.01 02:50:05" (1/1) ... [2019-01-14 02:50:05,606 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1de23fa1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 02:50:05, skipping insertion in model container [2019-01-14 02:50:05,606 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.01 02:50:05" (1/1) ... [2019-01-14 02:50:05,615 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-01-14 02:50:05,636 INFO L176 MainTranslator]: Built tables and reachable declarations [2019-01-14 02:50:05,812 INFO L208 PostProcessor]: Analyzing one entry point: main [2019-01-14 02:50:05,816 INFO L191 MainTranslator]: Completed pre-run [2019-01-14 02:50:05,835 INFO L208 PostProcessor]: Analyzing one entry point: main [2019-01-14 02:50:05,847 INFO L195 MainTranslator]: Completed translation [2019-01-14 02:50:05,847 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 02:50:05 WrapperNode [2019-01-14 02:50:05,847 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-01-14 02:50:05,848 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-01-14 02:50:05,848 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-01-14 02:50:05,848 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2019-01-14 02:50:05,856 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 02:50:05" (1/1) ... [2019-01-14 02:50:05,861 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 02:50:05" (1/1) ... [2019-01-14 02:50:05,882 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-01-14 02:50:05,882 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-01-14 02:50:05,882 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-01-14 02:50:05,882 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2019-01-14 02:50:05,891 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 02:50:05" (1/1) ... [2019-01-14 02:50:05,891 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 02:50:05" (1/1) ... [2019-01-14 02:50:05,892 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 02:50:05" (1/1) ... [2019-01-14 02:50:05,893 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 02:50:05" (1/1) ... [2019-01-14 02:50:05,895 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 02:50:05" (1/1) ... [2019-01-14 02:50:05,903 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 02:50:05" (1/1) ... [2019-01-14 02:50:05,904 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 02:50:05" (1/1) ... [2019-01-14 02:50:05,906 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-01-14 02:50:05,906 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-01-14 02:50:05,906 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-01-14 02:50:05,906 INFO L276 PluginConnector]: RCFGBuilder initialized [2019-01-14 02:50:05,907 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 02:50:05" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-14 02:50:06,030 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-01-14 02:50:06,030 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-01-14 02:50:06,314 INFO L281 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-01-14 02:50:06,314 INFO L286 CfgBuilder]: Removed 13 assue(true) statements. [2019-01-14 02:50:06,315 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.01 02:50:06 BoogieIcfgContainer [2019-01-14 02:50:06,316 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-01-14 02:50:06,316 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2019-01-14 02:50:06,316 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2019-01-14 02:50:06,323 INFO L276 PluginConnector]: BuchiAutomizer initialized [2019-01-14 02:50:06,324 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-01-14 02:50:06,324 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 14.01 02:50:05" (1/3) ... [2019-01-14 02:50:06,326 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@1ff2fdec and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 14.01 02:50:06, skipping insertion in model container [2019-01-14 02:50:06,326 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-01-14 02:50:06,326 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 02:50:05" (2/3) ... [2019-01-14 02:50:06,327 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@1ff2fdec and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 14.01 02:50:06, skipping insertion in model container [2019-01-14 02:50:06,328 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-01-14 02:50:06,328 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.01 02:50:06" (3/3) ... [2019-01-14 02:50:06,331 INFO L375 chiAutomizerObserver]: Analyzing ICFG gcd_4_true-unreach-call_true-no-overflow_true-termination.i [2019-01-14 02:50:06,418 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2019-01-14 02:50:06,419 INFO L374 BuchiCegarLoop]: Interprodecural is true [2019-01-14 02:50:06,419 INFO L375 BuchiCegarLoop]: Hoare is false [2019-01-14 02:50:06,420 INFO L376 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2019-01-14 02:50:06,420 INFO L377 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2019-01-14 02:50:06,420 INFO L378 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-01-14 02:50:06,420 INFO L379 BuchiCegarLoop]: Difference is false [2019-01-14 02:50:06,420 INFO L380 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-01-14 02:50:06,420 INFO L383 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2019-01-14 02:50:06,441 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 20 states. [2019-01-14 02:50:06,465 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2019-01-14 02:50:06,466 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-14 02:50:06,466 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-14 02:50:06,473 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1] [2019-01-14 02:50:06,474 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2019-01-14 02:50:06,474 INFO L442 BuchiCegarLoop]: ======== Iteration 1============ [2019-01-14 02:50:06,474 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 20 states. [2019-01-14 02:50:06,476 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2019-01-14 02:50:06,477 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-14 02:50:06,477 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-14 02:50:06,477 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1] [2019-01-14 02:50:06,477 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2019-01-14 02:50:06,487 INFO L794 eck$LassoCheckResult]: Stem: 13#ULTIMATE.startENTRYtrue havoc main_#res;havoc main_#t~ret0, main_~x~0, main_~y~0, main_~g~0;havoc main_~x~0;havoc main_~y~0;havoc main_~g~0;main_~x~0 := 63;main_~y~0 := 18;gcd_test_#in~a, gcd_test_#in~b := main_~x~0, main_~y~0;havoc gcd_test_#res;havoc gcd_test_~a, gcd_test_~b;gcd_test_~a := gcd_test_#in~a;gcd_test_~b := gcd_test_#in~b; 15#L12true assume !(gcd_test_~a < 0); 12#L12-2true assume !(gcd_test_~b < 0); 16#L13-1true assume !(0 == gcd_test_~a); 8#L20-2true [2019-01-14 02:50:06,488 INFO L796 eck$LassoCheckResult]: Loop: 8#L20-2true assume !!(0 != gcd_test_~b); 10#L20true assume !(gcd_test_~a > gcd_test_~b);gcd_test_~b := gcd_test_~b - gcd_test_~a; 8#L20-2true [2019-01-14 02:50:06,493 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 02:50:06,494 INFO L82 PathProgramCache]: Analyzing trace with hash 959468, now seen corresponding path program 1 times [2019-01-14 02:50:06,495 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 02:50:06,496 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 02:50:06,532 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:50:06,532 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 02:50:06,532 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:50:06,565 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 02:50:06,572 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 02:50:06,593 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 02:50:06,593 INFO L82 PathProgramCache]: Analyzing trace with hash 1830, now seen corresponding path program 1 times [2019-01-14 02:50:06,593 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 02:50:06,593 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 02:50:06,594 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:50:06,594 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 02:50:06,595 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:50:06,601 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 02:50:06,604 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 02:50:06,607 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 02:50:06,608 INFO L82 PathProgramCache]: Analyzing trace with hash 922049617, now seen corresponding path program 1 times [2019-01-14 02:50:06,609 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 02:50:06,609 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 02:50:06,610 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:50:06,610 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 02:50:06,610 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:50:06,620 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 02:50:06,780 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 02:50:06,782 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-14 02:50:06,782 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-01-14 02:50:06,902 WARN L181 SmtUtils]: Spent 106.00 ms on a formula simplification that was a NOOP. DAG size: 13 [2019-01-14 02:50:07,007 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-14 02:50:07,008 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-14 02:50:07,010 INFO L87 Difference]: Start difference. First operand 20 states. Second operand 3 states. [2019-01-14 02:50:07,083 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 02:50:07,084 INFO L93 Difference]: Finished difference Result 22 states and 23 transitions. [2019-01-14 02:50:07,084 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-14 02:50:07,086 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 22 states and 23 transitions. [2019-01-14 02:50:07,088 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2019-01-14 02:50:07,093 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 22 states to 8 states and 9 transitions. [2019-01-14 02:50:07,094 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 8 [2019-01-14 02:50:07,094 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 8 [2019-01-14 02:50:07,095 INFO L73 IsDeterministic]: Start isDeterministic. Operand 8 states and 9 transitions. [2019-01-14 02:50:07,095 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-01-14 02:50:07,095 INFO L706 BuchiCegarLoop]: Abstraction has 8 states and 9 transitions. [2019-01-14 02:50:07,113 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8 states and 9 transitions. [2019-01-14 02:50:07,122 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8 to 8. [2019-01-14 02:50:07,123 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2019-01-14 02:50:07,124 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 9 transitions. [2019-01-14 02:50:07,125 INFO L729 BuchiCegarLoop]: Abstraction has 8 states and 9 transitions. [2019-01-14 02:50:07,125 INFO L609 BuchiCegarLoop]: Abstraction has 8 states and 9 transitions. [2019-01-14 02:50:07,125 INFO L442 BuchiCegarLoop]: ======== Iteration 2============ [2019-01-14 02:50:07,125 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 8 states and 9 transitions. [2019-01-14 02:50:07,126 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2019-01-14 02:50:07,126 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-14 02:50:07,126 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-14 02:50:07,127 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1] [2019-01-14 02:50:07,127 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2019-01-14 02:50:07,127 INFO L794 eck$LassoCheckResult]: Stem: 55#ULTIMATE.startENTRY havoc main_#res;havoc main_#t~ret0, main_~x~0, main_~y~0, main_~g~0;havoc main_~x~0;havoc main_~y~0;havoc main_~g~0;main_~x~0 := 63;main_~y~0 := 18;gcd_test_#in~a, gcd_test_#in~b := main_~x~0, main_~y~0;havoc gcd_test_#res;havoc gcd_test_~a, gcd_test_~b;gcd_test_~a := gcd_test_#in~a;gcd_test_~b := gcd_test_#in~b; 56#L12 assume !(gcd_test_~a < 0); 53#L12-2 assume !(gcd_test_~b < 0); 54#L13-1 assume !(0 == gcd_test_~a); 57#L20-2 assume !!(0 != gcd_test_~b); 60#L20 assume gcd_test_~a > gcd_test_~b;gcd_test_~a := gcd_test_~a - gcd_test_~b; 58#L20-2 [2019-01-14 02:50:07,127 INFO L796 eck$LassoCheckResult]: Loop: 58#L20-2 assume !!(0 != gcd_test_~b); 59#L20 assume !(gcd_test_~a > gcd_test_~b);gcd_test_~b := gcd_test_~b - gcd_test_~a; 58#L20-2 [2019-01-14 02:50:07,128 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 02:50:07,128 INFO L82 PathProgramCache]: Analyzing trace with hash 922049615, now seen corresponding path program 1 times [2019-01-14 02:50:07,128 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 02:50:07,128 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 02:50:07,129 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:50:07,129 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 02:50:07,130 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:50:07,135 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 02:50:07,141 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 02:50:07,143 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 02:50:07,143 INFO L82 PathProgramCache]: Analyzing trace with hash 1830, now seen corresponding path program 2 times [2019-01-14 02:50:07,143 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 02:50:07,144 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 02:50:07,144 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:50:07,145 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 02:50:07,145 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:50:07,148 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 02:50:07,152 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 02:50:07,155 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 02:50:07,155 INFO L82 PathProgramCache]: Analyzing trace with hash 1326417908, now seen corresponding path program 1 times [2019-01-14 02:50:07,155 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 02:50:07,155 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 02:50:07,157 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:50:07,157 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-14 02:50:07,157 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:50:07,165 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 02:50:07,234 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 02:50:07,234 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-14 02:50:07,235 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-14 02:50:07,250 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 02:50:07,265 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 02:50:07,270 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 02:50:07,471 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 02:50:07,497 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-14 02:50:07,497 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [2, 2] total 4 [2019-01-14 02:50:07,603 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-01-14 02:50:07,603 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2019-01-14 02:50:07,604 INFO L87 Difference]: Start difference. First operand 8 states and 9 transitions. cyclomatic complexity: 2 Second operand 6 states. [2019-01-14 02:50:07,774 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 02:50:07,774 INFO L93 Difference]: Finished difference Result 10 states and 11 transitions. [2019-01-14 02:50:07,775 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-01-14 02:50:07,775 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 10 states and 11 transitions. [2019-01-14 02:50:07,776 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2019-01-14 02:50:07,777 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 10 states to 10 states and 11 transitions. [2019-01-14 02:50:07,777 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 10 [2019-01-14 02:50:07,777 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 10 [2019-01-14 02:50:07,777 INFO L73 IsDeterministic]: Start isDeterministic. Operand 10 states and 11 transitions. [2019-01-14 02:50:07,778 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-01-14 02:50:07,778 INFO L706 BuchiCegarLoop]: Abstraction has 10 states and 11 transitions. [2019-01-14 02:50:07,778 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10 states and 11 transitions. [2019-01-14 02:50:07,779 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10 to 10. [2019-01-14 02:50:07,779 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2019-01-14 02:50:07,780 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 11 transitions. [2019-01-14 02:50:07,780 INFO L729 BuchiCegarLoop]: Abstraction has 10 states and 11 transitions. [2019-01-14 02:50:07,780 INFO L609 BuchiCegarLoop]: Abstraction has 10 states and 11 transitions. [2019-01-14 02:50:07,780 INFO L442 BuchiCegarLoop]: ======== Iteration 3============ [2019-01-14 02:50:07,780 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 10 states and 11 transitions. [2019-01-14 02:50:07,781 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2019-01-14 02:50:07,781 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-14 02:50:07,781 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-14 02:50:07,782 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 1, 1, 1, 1] [2019-01-14 02:50:07,782 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2019-01-14 02:50:07,782 INFO L794 eck$LassoCheckResult]: Stem: 105#ULTIMATE.startENTRY havoc main_#res;havoc main_#t~ret0, main_~x~0, main_~y~0, main_~g~0;havoc main_~x~0;havoc main_~y~0;havoc main_~g~0;main_~x~0 := 63;main_~y~0 := 18;gcd_test_#in~a, gcd_test_#in~b := main_~x~0, main_~y~0;havoc gcd_test_#res;havoc gcd_test_~a, gcd_test_~b;gcd_test_~a := gcd_test_#in~a;gcd_test_~b := gcd_test_#in~b; 106#L12 assume !(gcd_test_~a < 0); 103#L12-2 assume !(gcd_test_~b < 0); 104#L13-1 assume !(0 == gcd_test_~a); 107#L20-2 assume !!(0 != gcd_test_~b); 110#L20 assume gcd_test_~a > gcd_test_~b;gcd_test_~a := gcd_test_~a - gcd_test_~b; 108#L20-2 assume !!(0 != gcd_test_~b); 109#L20 assume gcd_test_~a > gcd_test_~b;gcd_test_~a := gcd_test_~a - gcd_test_~b; 112#L20-2 [2019-01-14 02:50:07,782 INFO L796 eck$LassoCheckResult]: Loop: 112#L20-2 assume !!(0 != gcd_test_~b); 111#L20 assume !(gcd_test_~a > gcd_test_~b);gcd_test_~b := gcd_test_~b - gcd_test_~a; 112#L20-2 [2019-01-14 02:50:07,783 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 02:50:07,783 INFO L82 PathProgramCache]: Analyzing trace with hash 1326417906, now seen corresponding path program 2 times [2019-01-14 02:50:07,783 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 02:50:07,783 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 02:50:07,784 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:50:07,784 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 02:50:07,784 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:50:07,790 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 02:50:07,796 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 02:50:07,799 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 02:50:07,799 INFO L82 PathProgramCache]: Analyzing trace with hash 1830, now seen corresponding path program 3 times [2019-01-14 02:50:07,799 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 02:50:07,799 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 02:50:07,800 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:50:07,801 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-14 02:50:07,801 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:50:07,803 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 02:50:07,805 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 02:50:07,806 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 02:50:07,807 INFO L82 PathProgramCache]: Analyzing trace with hash -917678377, now seen corresponding path program 2 times [2019-01-14 02:50:07,807 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 02:50:07,807 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 02:50:07,808 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:50:07,808 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-14 02:50:07,808 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:50:07,815 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 02:50:07,969 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 02:50:07,969 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-14 02:50:07,969 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-14 02:50:07,983 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2019-01-14 02:50:07,993 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-01-14 02:50:07,993 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-14 02:50:07,995 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 02:50:08,090 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 02:50:08,108 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-14 02:50:08,109 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3] total 6 [2019-01-14 02:50:08,131 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-01-14 02:50:08,131 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2019-01-14 02:50:08,132 INFO L87 Difference]: Start difference. First operand 10 states and 11 transitions. cyclomatic complexity: 2 Second operand 8 states. [2019-01-14 02:50:08,262 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 02:50:08,262 INFO L93 Difference]: Finished difference Result 12 states and 13 transitions. [2019-01-14 02:50:08,264 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-01-14 02:50:08,264 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 12 states and 13 transitions. [2019-01-14 02:50:08,265 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2019-01-14 02:50:08,267 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 12 states to 12 states and 13 transitions. [2019-01-14 02:50:08,267 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 12 [2019-01-14 02:50:08,267 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 12 [2019-01-14 02:50:08,268 INFO L73 IsDeterministic]: Start isDeterministic. Operand 12 states and 13 transitions. [2019-01-14 02:50:08,268 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-01-14 02:50:08,268 INFO L706 BuchiCegarLoop]: Abstraction has 12 states and 13 transitions. [2019-01-14 02:50:08,268 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12 states and 13 transitions. [2019-01-14 02:50:08,269 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12 to 12. [2019-01-14 02:50:08,270 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2019-01-14 02:50:08,270 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 13 transitions. [2019-01-14 02:50:08,270 INFO L729 BuchiCegarLoop]: Abstraction has 12 states and 13 transitions. [2019-01-14 02:50:08,270 INFO L609 BuchiCegarLoop]: Abstraction has 12 states and 13 transitions. [2019-01-14 02:50:08,270 INFO L442 BuchiCegarLoop]: ======== Iteration 4============ [2019-01-14 02:50:08,271 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 12 states and 13 transitions. [2019-01-14 02:50:08,271 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2019-01-14 02:50:08,271 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-14 02:50:08,272 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-14 02:50:08,272 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [3, 3, 1, 1, 1, 1] [2019-01-14 02:50:08,272 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2019-01-14 02:50:08,272 INFO L794 eck$LassoCheckResult]: Stem: 167#ULTIMATE.startENTRY havoc main_#res;havoc main_#t~ret0, main_~x~0, main_~y~0, main_~g~0;havoc main_~x~0;havoc main_~y~0;havoc main_~g~0;main_~x~0 := 63;main_~y~0 := 18;gcd_test_#in~a, gcd_test_#in~b := main_~x~0, main_~y~0;havoc gcd_test_#res;havoc gcd_test_~a, gcd_test_~b;gcd_test_~a := gcd_test_#in~a;gcd_test_~b := gcd_test_#in~b; 168#L12 assume !(gcd_test_~a < 0); 165#L12-2 assume !(gcd_test_~b < 0); 166#L13-1 assume !(0 == gcd_test_~a); 169#L20-2 assume !!(0 != gcd_test_~b); 172#L20 assume gcd_test_~a > gcd_test_~b;gcd_test_~a := gcd_test_~a - gcd_test_~b; 170#L20-2 assume !!(0 != gcd_test_~b); 171#L20 assume gcd_test_~a > gcd_test_~b;gcd_test_~a := gcd_test_~a - gcd_test_~b; 176#L20-2 assume !!(0 != gcd_test_~b); 175#L20 assume gcd_test_~a > gcd_test_~b;gcd_test_~a := gcd_test_~a - gcd_test_~b; 174#L20-2 [2019-01-14 02:50:08,273 INFO L796 eck$LassoCheckResult]: Loop: 174#L20-2 assume !!(0 != gcd_test_~b); 173#L20 assume !(gcd_test_~a > gcd_test_~b);gcd_test_~b := gcd_test_~b - gcd_test_~a; 174#L20-2 [2019-01-14 02:50:08,273 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 02:50:08,273 INFO L82 PathProgramCache]: Analyzing trace with hash -917678379, now seen corresponding path program 3 times [2019-01-14 02:50:08,273 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 02:50:08,273 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 02:50:08,274 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:50:08,275 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-14 02:50:08,275 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:50:08,282 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 02:50:08,288 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 02:50:08,291 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 02:50:08,291 INFO L82 PathProgramCache]: Analyzing trace with hash 1830, now seen corresponding path program 4 times [2019-01-14 02:50:08,292 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 02:50:08,292 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 02:50:08,293 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:50:08,293 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-14 02:50:08,293 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:50:08,295 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 02:50:08,297 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 02:50:08,298 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 02:50:08,298 INFO L82 PathProgramCache]: Analyzing trace with hash -1420625670, now seen corresponding path program 3 times [2019-01-14 02:50:08,298 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 02:50:08,299 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 02:50:08,299 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:50:08,299 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-14 02:50:08,300 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:50:08,306 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 02:50:08,314 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 02:50:08,468 WARN L181 SmtUtils]: Spent 107.00 ms on a formula simplification. DAG size of input: 38 DAG size of output: 26 [2019-01-14 02:50:08,494 INFO L216 LassoAnalysis]: Preferences: [2019-01-14 02:50:08,495 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-01-14 02:50:08,495 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-01-14 02:50:08,495 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-01-14 02:50:08,496 INFO L127 ssoRankerPreferences]: Use exernal solver: true [2019-01-14 02:50:08,496 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-14 02:50:08,496 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-01-14 02:50:08,496 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-01-14 02:50:08,496 INFO L131 ssoRankerPreferences]: Filename of dumped script: gcd_4_true-unreach-call_true-no-overflow_true-termination.i_Iteration4_Lasso [2019-01-14 02:50:08,496 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-01-14 02:50:08,497 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2019-01-14 02:50:08,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 02:50:08,661 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:50:08,691 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:50:08,717 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:50:08,749 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:50:08,995 WARN L181 SmtUtils]: Spent 209.00 ms on a formula simplification that was a NOOP. DAG size: 24 [2019-01-14 02:50:09,148 INFO L300 LassoAnalysis]: Preprocessing complete. [2019-01-14 02:50:09,149 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 02:50:09,154 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-14 02:50:09,154 INFO L163 nArgumentSynthesizer]: Using integer mode. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-14 02:50:09,194 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2019-01-14 02:50:09,194 INFO L163 nArgumentSynthesizer]: Using integer mode. [2019-01-14 02:50:09,462 INFO L452 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2019-01-14 02:50:09,465 INFO L216 LassoAnalysis]: Preferences: [2019-01-14 02:50:09,465 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-01-14 02:50:09,465 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-01-14 02:50:09,466 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-01-14 02:50:09,466 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2019-01-14 02:50:09,466 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-14 02:50:09,466 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-01-14 02:50:09,466 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-01-14 02:50:09,467 INFO L131 ssoRankerPreferences]: Filename of dumped script: gcd_4_true-unreach-call_true-no-overflow_true-termination.i_Iteration4_Lasso [2019-01-14 02:50:09,467 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-01-14 02:50:09,467 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2019-01-14 02:50:09,469 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:50:09,476 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:50:09,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 02:50:09,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 02:50:09,519 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:50:09,793 WARN L181 SmtUtils]: Spent 216.00 ms on a formula simplification that was a NOOP. DAG size: 24 [2019-01-14 02:50:09,824 INFO L300 LassoAnalysis]: Preprocessing complete. [2019-01-14 02:50:09,828 INFO L497 LassoAnalysis]: Using template 'affine'. [2019-01-14 02:50:09,830 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 02:50:09,832 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:50:09,832 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 02:50:09,833 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:50:09,833 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:50:09,833 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:50:09,835 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 02:50:09,835 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 02:50:09,837 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:50:09,837 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 02:50:09,838 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:50:09,838 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:50:09,838 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2019-01-14 02:50:09,839 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:50:09,853 INFO L402 nArgumentSynthesizer]: We have 16 Motzkin's Theorem applications. [2019-01-14 02:50:09,853 INFO L403 nArgumentSynthesizer]: A total of 4 supporting invariants were added. [2019-01-14 02:50:09,991 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-01-14 02:50:10,114 INFO L443 ModelExtractionUtils]: Simplification made 8 calls to the SMT solver. [2019-01-14 02:50:10,114 INFO L444 ModelExtractionUtils]: 25 out of 36 variables were initially zero. Simplification set additionally 5 variables to zero. [2019-01-14 02:50:10,117 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-01-14 02:50:10,122 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 4. [2019-01-14 02:50:10,122 INFO L518 LassoAnalysis]: Proved termination. [2019-01-14 02:50:10,123 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_gcd_test_~b) = 1*ULTIMATE.start_gcd_test_~b Supporting invariants [1*ULTIMATE.start_gcd_test_~a - 1 >= 0, 1*ULTIMATE.start_gcd_test_~b >= 0] [2019-01-14 02:50:10,175 INFO L297 tatePredicateManager]: 1 out of 2 supporting invariants were superfluous and have been removed [2019-01-14 02:50:10,446 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 02:50:10,458 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 02:50:10,460 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 02:50:10,584 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 02:50:10,585 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 02:50:10,586 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 02:50:10,589 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.4 stem predicates 1 loop predicates [2019-01-14 02:50:10,590 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 12 states and 13 transitions. cyclomatic complexity: 2 Second operand 6 states. [2019-01-14 02:50:10,747 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 12 states and 13 transitions. cyclomatic complexity: 2. Second operand 6 states. Result 19 states and 22 transitions. Complement of second has 5 states. [2019-01-14 02:50:10,749 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 2 stem states 1 non-accepting loop states 1 accepting loop states [2019-01-14 02:50:10,749 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2019-01-14 02:50:10,750 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 10 transitions. [2019-01-14 02:50:10,751 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 10 transitions. Stem has 10 letters. Loop has 2 letters. [2019-01-14 02:50:10,753 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-14 02:50:10,753 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 10 transitions. Stem has 12 letters. Loop has 2 letters. [2019-01-14 02:50:10,753 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-14 02:50:10,753 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 10 transitions. Stem has 10 letters. Loop has 4 letters. [2019-01-14 02:50:10,754 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-14 02:50:10,754 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 19 states and 22 transitions. [2019-01-14 02:50:10,756 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2019-01-14 02:50:10,757 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 19 states to 19 states and 22 transitions. [2019-01-14 02:50:10,757 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 11 [2019-01-14 02:50:10,757 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 13 [2019-01-14 02:50:10,757 INFO L73 IsDeterministic]: Start isDeterministic. Operand 19 states and 22 transitions. [2019-01-14 02:50:10,757 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-01-14 02:50:10,758 INFO L706 BuchiCegarLoop]: Abstraction has 19 states and 22 transitions. [2019-01-14 02:50:10,758 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19 states and 22 transitions. [2019-01-14 02:50:10,759 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19 to 15. [2019-01-14 02:50:10,759 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2019-01-14 02:50:10,760 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 18 transitions. [2019-01-14 02:50:10,760 INFO L729 BuchiCegarLoop]: Abstraction has 15 states and 18 transitions. [2019-01-14 02:50:10,761 INFO L609 BuchiCegarLoop]: Abstraction has 15 states and 18 transitions. [2019-01-14 02:50:10,761 INFO L442 BuchiCegarLoop]: ======== Iteration 5============ [2019-01-14 02:50:10,761 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 15 states and 18 transitions. [2019-01-14 02:50:10,762 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2019-01-14 02:50:10,763 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-14 02:50:10,763 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-14 02:50:10,763 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [2, 1, 1, 1, 1, 1] [2019-01-14 02:50:10,763 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2019-01-14 02:50:10,763 INFO L794 eck$LassoCheckResult]: Stem: 272#ULTIMATE.startENTRY havoc main_#res;havoc main_#t~ret0, main_~x~0, main_~y~0, main_~g~0;havoc main_~x~0;havoc main_~y~0;havoc main_~g~0;main_~x~0 := 63;main_~y~0 := 18;gcd_test_#in~a, gcd_test_#in~b := main_~x~0, main_~y~0;havoc gcd_test_#res;havoc gcd_test_~a, gcd_test_~b;gcd_test_~a := gcd_test_#in~a;gcd_test_~b := gcd_test_#in~b; 273#L12 assume !(gcd_test_~a < 0); 270#L12-2 assume !(gcd_test_~b < 0); 271#L13-1 assume !(0 == gcd_test_~a); 274#L20-2 assume !!(0 != gcd_test_~b); 282#L20 assume gcd_test_~a > gcd_test_~b;gcd_test_~a := gcd_test_~a - gcd_test_~b; 280#L20-2 assume !!(0 != gcd_test_~b); 276#L20 [2019-01-14 02:50:10,764 INFO L796 eck$LassoCheckResult]: Loop: 276#L20 assume gcd_test_~a > gcd_test_~b;gcd_test_~a := gcd_test_~a - gcd_test_~b; 275#L20-2 assume !!(0 != gcd_test_~b); 276#L20 [2019-01-14 02:50:10,765 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 02:50:10,765 INFO L82 PathProgramCache]: Analyzing trace with hash -1481232980, now seen corresponding path program 4 times [2019-01-14 02:50:10,765 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 02:50:10,765 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 02:50:10,766 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:50:10,766 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-14 02:50:10,766 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:50:10,769 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 02:50:10,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 02:50:10,777 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 02:50:10,778 INFO L82 PathProgramCache]: Analyzing trace with hash 1918, now seen corresponding path program 1 times [2019-01-14 02:50:10,779 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 02:50:10,779 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 02:50:10,780 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:50:10,781 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-14 02:50:10,781 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:50:10,785 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 02:50:10,787 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 02:50:10,790 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 02:50:10,791 INFO L82 PathProgramCache]: Analyzing trace with hash -1830717847, now seen corresponding path program 5 times [2019-01-14 02:50:10,791 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 02:50:10,791 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 02:50:10,793 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:50:10,793 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 02:50:10,793 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:50:10,798 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 02:50:10,805 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 02:50:10,912 WARN L181 SmtUtils]: Spent 102.00 ms on a formula simplification that was a NOOP. DAG size: 12 [2019-01-14 02:50:10,984 INFO L216 LassoAnalysis]: Preferences: [2019-01-14 02:50:10,984 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-01-14 02:50:10,984 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-01-14 02:50:10,984 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-01-14 02:50:10,984 INFO L127 ssoRankerPreferences]: Use exernal solver: true [2019-01-14 02:50:10,985 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-14 02:50:10,985 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-01-14 02:50:10,985 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-01-14 02:50:10,985 INFO L131 ssoRankerPreferences]: Filename of dumped script: gcd_4_true-unreach-call_true-no-overflow_true-termination.i_Iteration5_Loop [2019-01-14 02:50:10,985 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-01-14 02:50:10,985 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2019-01-14 02:50:10,986 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:50:11,050 INFO L300 LassoAnalysis]: Preprocessing complete. [2019-01-14 02:50:11,050 INFO L412 LassoAnalysis]: Checking for nontermination... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 6 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-14 02:50:11,055 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-14 02:50:11,055 INFO L163 nArgumentSynthesizer]: Using integer mode. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 7 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-14 02:50:11,079 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2019-01-14 02:50:11,079 INFO L163 nArgumentSynthesizer]: Using integer mode. [2019-01-14 02:50:11,166 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2019-01-14 02:50:11,166 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_gcd_test_~a=-6, ULTIMATE.start_gcd_test_~b=-7} Honda state: {ULTIMATE.start_gcd_test_~a=-6, ULTIMATE.start_gcd_test_~b=-7} Generalized eigenvectors: [{ULTIMATE.start_gcd_test_~a=0, ULTIMATE.start_gcd_test_~b=0}, {ULTIMATE.start_gcd_test_~a=0, ULTIMATE.start_gcd_test_~b=0}, {ULTIMATE.start_gcd_test_~a=7, ULTIMATE.start_gcd_test_~b=0}] Lambdas: [1, 0, 1] Nus: [0, 0] [2019-01-14 02:50:11,233 INFO L216 LassoAnalysis]: Preferences: [2019-01-14 02:50:11,234 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-01-14 02:50:11,234 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-01-14 02:50:11,234 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-01-14 02:50:11,234 INFO L127 ssoRankerPreferences]: Use exernal solver: true [2019-01-14 02:50:11,234 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-14 02:50:11,235 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-01-14 02:50:11,235 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-01-14 02:50:11,235 INFO L131 ssoRankerPreferences]: Filename of dumped script: gcd_4_true-unreach-call_true-no-overflow_true-termination.i_Iteration5_Lasso [2019-01-14 02:50:11,235 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-01-14 02:50:11,235 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2019-01-14 02:50:11,237 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:50:11,245 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:50:11,275 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:50:11,282 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:50:11,283 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:50:11,425 INFO L300 LassoAnalysis]: Preprocessing complete. [2019-01-14 02:50:11,425 INFO L412 LassoAnalysis]: Checking for nontermination... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 8 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-14 02:50:11,432 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-14 02:50:11,432 INFO L163 nArgumentSynthesizer]: Using integer mode. [2019-01-14 02:50:11,439 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2019-01-14 02:50:11,439 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 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 02:50:11,468 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-14 02:50:11,469 INFO L163 nArgumentSynthesizer]: Using integer mode. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 10 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-01-14 02:50:11,528 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2019-01-14 02:50:11,528 INFO L163 nArgumentSynthesizer]: Using integer mode. Waiting until toolchain timeout for monitored process 10 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-14 02:50:12,229 INFO L452 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2019-01-14 02:50:12,231 INFO L216 LassoAnalysis]: Preferences: [2019-01-14 02:50:12,231 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-01-14 02:50:12,231 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-01-14 02:50:12,231 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-01-14 02:50:12,231 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2019-01-14 02:50:12,231 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-14 02:50:12,232 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-01-14 02:50:12,232 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-01-14 02:50:12,232 INFO L131 ssoRankerPreferences]: Filename of dumped script: gcd_4_true-unreach-call_true-no-overflow_true-termination.i_Iteration5_Lasso [2019-01-14 02:50:12,232 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-01-14 02:50:12,232 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2019-01-14 02:50:12,234 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:50:12,238 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:50:12,243 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:50:12,269 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:50:12,271 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:50:12,525 WARN L181 SmtUtils]: Spent 126.00 ms on a formula simplification that was a NOOP. DAG size: 22 [2019-01-14 02:50:12,645 WARN L181 SmtUtils]: Spent 119.00 ms on a formula simplification that was a NOOP. DAG size: 15 [2019-01-14 02:50:12,649 INFO L300 LassoAnalysis]: Preprocessing complete. [2019-01-14 02:50:12,650 INFO L497 LassoAnalysis]: Using template 'affine'. [2019-01-14 02:50:12,650 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 02:50:12,651 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:50:12,651 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 02:50:12,651 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:50:12,651 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:50:12,652 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:50:12,652 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 02:50:12,652 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 02:50:12,653 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:50:12,653 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 02:50:12,654 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:50:12,654 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 02:50:12,654 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:50:12,654 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:50:12,654 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:50:12,655 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 02:50:12,655 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 02:50:12,655 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:50:12,656 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 02:50:12,656 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:50:12,656 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:50:12,656 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2019-01-14 02:50:12,657 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:50:12,663 INFO L402 nArgumentSynthesizer]: We have 16 Motzkin's Theorem applications. [2019-01-14 02:50:12,664 INFO L403 nArgumentSynthesizer]: A total of 4 supporting invariants were added. [2019-01-14 02:50:12,727 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-01-14 02:50:12,800 INFO L443 ModelExtractionUtils]: Simplification made 8 calls to the SMT solver. [2019-01-14 02:50:12,805 INFO L444 ModelExtractionUtils]: 29 out of 36 variables were initially zero. Simplification set additionally 3 variables to zero. [2019-01-14 02:50:12,805 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-01-14 02:50:12,810 INFO L440 nArgumentSynthesizer]: Removed 3 redundant supporting invariants from a total of 4. [2019-01-14 02:50:12,813 INFO L518 LassoAnalysis]: Proved termination. [2019-01-14 02:50:12,813 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_gcd_test_~a, ULTIMATE.start_gcd_test_~b) = 1*ULTIMATE.start_gcd_test_~a - 1*ULTIMATE.start_gcd_test_~b Supporting invariants [1*ULTIMATE.start_gcd_test_~b >= 0] [2019-01-14 02:50:12,839 INFO L297 tatePredicateManager]: 0 out of 1 supporting invariants were superfluous and have been removed [2019-01-14 02:50:12,917 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 02:50:12,925 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 02:50:12,926 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 02:50:12,930 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 02:50:12,931 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 02:50:12,956 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 02:50:12,957 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.2 stem predicates 2 loop predicates [2019-01-14 02:50:12,957 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 15 states and 18 transitions. cyclomatic complexity: 5 Second operand 4 states. [2019-01-14 02:50:13,029 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 15 states and 18 transitions. cyclomatic complexity: 5. Second operand 4 states. Result 24 states and 30 transitions. Complement of second has 6 states. [2019-01-14 02:50:13,030 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 2 stem states 1 non-accepting loop states 1 accepting loop states [2019-01-14 02:50:13,030 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2019-01-14 02:50:13,031 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 7 transitions. [2019-01-14 02:50:13,031 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 7 transitions. Stem has 7 letters. Loop has 2 letters. [2019-01-14 02:50:13,031 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-14 02:50:13,032 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 7 transitions. Stem has 9 letters. Loop has 2 letters. [2019-01-14 02:50:13,032 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-14 02:50:13,032 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 7 transitions. Stem has 7 letters. Loop has 4 letters. [2019-01-14 02:50:13,032 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-14 02:50:13,032 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 24 states and 30 transitions. [2019-01-14 02:50:13,033 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2019-01-14 02:50:13,034 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 24 states to 18 states and 22 transitions. [2019-01-14 02:50:13,034 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 8 [2019-01-14 02:50:13,034 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 8 [2019-01-14 02:50:13,034 INFO L73 IsDeterministic]: Start isDeterministic. Operand 18 states and 22 transitions. [2019-01-14 02:50:13,034 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-01-14 02:50:13,035 INFO L706 BuchiCegarLoop]: Abstraction has 18 states and 22 transitions. [2019-01-14 02:50:13,035 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18 states and 22 transitions. [2019-01-14 02:50:13,037 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18 to 15. [2019-01-14 02:50:13,037 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2019-01-14 02:50:13,038 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 17 transitions. [2019-01-14 02:50:13,038 INFO L729 BuchiCegarLoop]: Abstraction has 15 states and 17 transitions. [2019-01-14 02:50:13,038 INFO L609 BuchiCegarLoop]: Abstraction has 15 states and 17 transitions. [2019-01-14 02:50:13,038 INFO L442 BuchiCegarLoop]: ======== Iteration 6============ [2019-01-14 02:50:13,038 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 15 states and 17 transitions. [2019-01-14 02:50:13,039 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2019-01-14 02:50:13,039 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-14 02:50:13,039 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-14 02:50:13,039 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [5, 3, 1, 1, 1, 1, 1] [2019-01-14 02:50:13,039 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2019-01-14 02:50:13,040 INFO L794 eck$LassoCheckResult]: Stem: 370#ULTIMATE.startENTRY havoc main_#res;havoc main_#t~ret0, main_~x~0, main_~y~0, main_~g~0;havoc main_~x~0;havoc main_~y~0;havoc main_~g~0;main_~x~0 := 63;main_~y~0 := 18;gcd_test_#in~a, gcd_test_#in~b := main_~x~0, main_~y~0;havoc gcd_test_#res;havoc gcd_test_~a, gcd_test_~b;gcd_test_~a := gcd_test_#in~a;gcd_test_~b := gcd_test_#in~b; 371#L12 assume !(gcd_test_~a < 0); 368#L12-2 assume !(gcd_test_~b < 0); 369#L13-1 assume !(0 == gcd_test_~a); 372#L20-2 assume !!(0 != gcd_test_~b); 377#L20 assume gcd_test_~a > gcd_test_~b;gcd_test_~a := gcd_test_~a - gcd_test_~b; 378#L20-2 assume !!(0 != gcd_test_~b); 379#L20 assume gcd_test_~a > gcd_test_~b;gcd_test_~a := gcd_test_~a - gcd_test_~b; 375#L20-2 assume !!(0 != gcd_test_~b); 376#L20 assume gcd_test_~a > gcd_test_~b;gcd_test_~a := gcd_test_~a - gcd_test_~b; 382#L20-2 assume !!(0 != gcd_test_~b); 381#L20 assume !(gcd_test_~a > gcd_test_~b);gcd_test_~b := gcd_test_~b - gcd_test_~a; 380#L20-2 assume !!(0 != gcd_test_~b); 374#L20 [2019-01-14 02:50:13,041 INFO L796 eck$LassoCheckResult]: Loop: 374#L20 assume gcd_test_~a > gcd_test_~b;gcd_test_~a := gcd_test_~a - gcd_test_~b; 373#L20-2 assume !!(0 != gcd_test_~b); 374#L20 [2019-01-14 02:50:13,041 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 02:50:13,041 INFO L82 PathProgramCache]: Analyzing trace with hash -1089722783, now seen corresponding path program 4 times [2019-01-14 02:50:13,041 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 02:50:13,041 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 02:50:13,042 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:50:13,042 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-14 02:50:13,042 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:50:13,045 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 02:50:13,049 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 02:50:13,051 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 02:50:13,051 INFO L82 PathProgramCache]: Analyzing trace with hash 1918, now seen corresponding path program 2 times [2019-01-14 02:50:13,051 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 02:50:13,052 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 02:50:13,052 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:50:13,052 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-14 02:50:13,052 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:50:13,053 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 02:50:13,056 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 02:50:13,057 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 02:50:13,057 INFO L82 PathProgramCache]: Analyzing trace with hash 748426718, now seen corresponding path program 5 times [2019-01-14 02:50:13,057 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 02:50:13,057 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 02:50:13,058 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:50:13,058 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-14 02:50:13,058 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:50:13,063 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 02:50:13,185 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 11 proven. 14 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 02:50:13,185 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-14 02:50:13,185 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-14 02:50:13,197 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2019-01-14 02:50:13,205 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 6 check-sat command(s) [2019-01-14 02:50:13,206 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-14 02:50:13,207 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 02:50:13,498 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 17 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 02:50:13,527 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-14 02:50:13,527 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 11 [2019-01-14 02:50:13,550 INFO L216 LassoAnalysis]: Preferences: [2019-01-14 02:50:13,550 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-01-14 02:50:13,550 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-01-14 02:50:13,550 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-01-14 02:50:13,550 INFO L127 ssoRankerPreferences]: Use exernal solver: true [2019-01-14 02:50:13,550 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-14 02:50:13,550 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-01-14 02:50:13,550 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-01-14 02:50:13,550 INFO L131 ssoRankerPreferences]: Filename of dumped script: gcd_4_true-unreach-call_true-no-overflow_true-termination.i_Iteration6_Loop [2019-01-14 02:50:13,551 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-01-14 02:50:13,551 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2019-01-14 02:50:13,551 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:50:13,592 INFO L300 LassoAnalysis]: Preprocessing complete. [2019-01-14 02:50:13,593 INFO L412 LassoAnalysis]: Checking for nontermination... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 12 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 12 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-14 02:50:13,597 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-14 02:50:13,597 INFO L163 nArgumentSynthesizer]: Using integer mode. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 13 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 13 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-14 02:50:13,622 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2019-01-14 02:50:13,622 INFO L163 nArgumentSynthesizer]: Using integer mode. [2019-01-14 02:50:13,717 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2019-01-14 02:50:13,717 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_gcd_test_~a=-6, ULTIMATE.start_gcd_test_~b=-7} Honda state: {ULTIMATE.start_gcd_test_~a=-6, ULTIMATE.start_gcd_test_~b=-7} Generalized eigenvectors: [{ULTIMATE.start_gcd_test_~a=0, ULTIMATE.start_gcd_test_~b=0}, {ULTIMATE.start_gcd_test_~a=0, ULTIMATE.start_gcd_test_~b=0}, {ULTIMATE.start_gcd_test_~a=7, ULTIMATE.start_gcd_test_~b=0}] Lambdas: [1, 0, 1] Nus: [0, 0] [2019-01-14 02:50:13,734 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-01-14 02:50:13,734 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=89, Unknown=0, NotChecked=0, Total=132 [2019-01-14 02:50:13,734 INFO L87 Difference]: Start difference. First operand 15 states and 17 transitions. cyclomatic complexity: 4 Second operand 12 states. [2019-01-14 02:50:14,213 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 02:50:14,213 INFO L93 Difference]: Finished difference Result 20 states and 22 transitions. [2019-01-14 02:50:14,214 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-01-14 02:50:14,214 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 20 states and 22 transitions. [2019-01-14 02:50:14,215 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2019-01-14 02:50:14,216 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 20 states to 19 states and 21 transitions. [2019-01-14 02:50:14,216 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 8 [2019-01-14 02:50:14,216 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 8 [2019-01-14 02:50:14,217 INFO L73 IsDeterministic]: Start isDeterministic. Operand 19 states and 21 transitions. [2019-01-14 02:50:14,217 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-01-14 02:50:14,217 INFO L706 BuchiCegarLoop]: Abstraction has 19 states and 21 transitions. [2019-01-14 02:50:14,217 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19 states and 21 transitions. [2019-01-14 02:50:14,221 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19 to 19. [2019-01-14 02:50:14,221 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2019-01-14 02:50:14,221 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 21 transitions. [2019-01-14 02:50:14,222 INFO L729 BuchiCegarLoop]: Abstraction has 19 states and 21 transitions. [2019-01-14 02:50:14,223 INFO L609 BuchiCegarLoop]: Abstraction has 19 states and 21 transitions. [2019-01-14 02:50:14,223 INFO L442 BuchiCegarLoop]: ======== Iteration 7============ [2019-01-14 02:50:14,223 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 19 states and 21 transitions. [2019-01-14 02:50:14,223 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2019-01-14 02:50:14,224 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-14 02:50:14,225 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-14 02:50:14,225 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [6, 3, 2, 1, 1, 1, 1] [2019-01-14 02:50:14,225 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2019-01-14 02:50:14,226 INFO L794 eck$LassoCheckResult]: Stem: 466#ULTIMATE.startENTRY havoc main_#res;havoc main_#t~ret0, main_~x~0, main_~y~0, main_~g~0;havoc main_~x~0;havoc main_~y~0;havoc main_~g~0;main_~x~0 := 63;main_~y~0 := 18;gcd_test_#in~a, gcd_test_#in~b := main_~x~0, main_~y~0;havoc gcd_test_#res;havoc gcd_test_~a, gcd_test_~b;gcd_test_~a := gcd_test_#in~a;gcd_test_~b := gcd_test_#in~b; 467#L12 assume !(gcd_test_~a < 0); 464#L12-2 assume !(gcd_test_~b < 0); 465#L13-1 assume !(0 == gcd_test_~a); 468#L20-2 assume !!(0 != gcd_test_~b); 473#L20 assume gcd_test_~a > gcd_test_~b;gcd_test_~a := gcd_test_~a - gcd_test_~b; 471#L20-2 assume !!(0 != gcd_test_~b); 472#L20 assume gcd_test_~a > gcd_test_~b;gcd_test_~a := gcd_test_~a - gcd_test_~b; 474#L20-2 assume !!(0 != gcd_test_~b); 482#L20 assume gcd_test_~a > gcd_test_~b;gcd_test_~a := gcd_test_~a - gcd_test_~b; 481#L20-2 assume !!(0 != gcd_test_~b); 479#L20 assume !(gcd_test_~a > gcd_test_~b);gcd_test_~b := gcd_test_~b - gcd_test_~a; 478#L20-2 assume !!(0 != gcd_test_~b); 477#L20 assume !(gcd_test_~a > gcd_test_~b);gcd_test_~b := gcd_test_~b - gcd_test_~a; 475#L20-2 assume !!(0 != gcd_test_~b); 470#L20 [2019-01-14 02:50:14,226 INFO L796 eck$LassoCheckResult]: Loop: 470#L20 assume gcd_test_~a > gcd_test_~b;gcd_test_~a := gcd_test_~a - gcd_test_~b; 469#L20-2 assume !!(0 != gcd_test_~b); 470#L20 [2019-01-14 02:50:14,226 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 02:50:14,226 INFO L82 PathProgramCache]: Analyzing trace with hash 748426780, now seen corresponding path program 6 times [2019-01-14 02:50:14,227 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 02:50:14,227 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 02:50:14,228 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:50:14,228 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-14 02:50:14,228 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:50:14,232 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 02:50:14,373 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 0 proven. 25 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 02:50:14,374 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-14 02:50:14,374 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-14 02:50:14,384 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2019-01-14 02:50:14,391 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 6 check-sat command(s) [2019-01-14 02:50:14,392 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-14 02:50:14,394 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 02:50:14,444 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 0 proven. 25 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 02:50:14,462 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-14 02:50:14,462 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 7 [2019-01-14 02:50:14,463 INFO L799 eck$LassoCheckResult]: stem already infeasible [2019-01-14 02:50:14,463 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 02:50:14,463 INFO L82 PathProgramCache]: Analyzing trace with hash 1918, now seen corresponding path program 3 times [2019-01-14 02:50:14,463 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 02:50:14,463 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 02:50:14,464 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:50:14,464 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-14 02:50:14,464 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:50:14,465 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 02:50:14,466 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 02:50:14,531 INFO L216 LassoAnalysis]: Preferences: [2019-01-14 02:50:14,532 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-01-14 02:50:14,532 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-01-14 02:50:14,532 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-01-14 02:50:14,532 INFO L127 ssoRankerPreferences]: Use exernal solver: true [2019-01-14 02:50:14,532 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-14 02:50:14,533 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-01-14 02:50:14,533 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-01-14 02:50:14,533 INFO L131 ssoRankerPreferences]: Filename of dumped script: gcd_4_true-unreach-call_true-no-overflow_true-termination.i_Iteration7_Loop [2019-01-14 02:50:14,533 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-01-14 02:50:14,533 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2019-01-14 02:50:14,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 02:50:14,603 INFO L300 LassoAnalysis]: Preprocessing complete. [2019-01-14 02:50:14,603 INFO L412 LassoAnalysis]: Checking for nontermination... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 15 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 15 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-14 02:50:14,609 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-14 02:50:14,609 INFO L163 nArgumentSynthesizer]: Using integer mode. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 16 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 16 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-14 02:50:14,632 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2019-01-14 02:50:14,632 INFO L163 nArgumentSynthesizer]: Using integer mode. [2019-01-14 02:50:14,718 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2019-01-14 02:50:14,718 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_gcd_test_~a=-6, ULTIMATE.start_gcd_test_~b=-7} Honda state: {ULTIMATE.start_gcd_test_~a=-6, ULTIMATE.start_gcd_test_~b=-7} Generalized eigenvectors: [{ULTIMATE.start_gcd_test_~a=0, ULTIMATE.start_gcd_test_~b=0}, {ULTIMATE.start_gcd_test_~a=0, ULTIMATE.start_gcd_test_~b=0}, {ULTIMATE.start_gcd_test_~a=7, ULTIMATE.start_gcd_test_~b=0}] Lambdas: [1, 0, 1] Nus: [0, 0] [2019-01-14 02:50:14,736 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-01-14 02:50:14,736 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2019-01-14 02:50:14,736 INFO L87 Difference]: Start difference. First operand 19 states and 21 transitions. cyclomatic complexity: 4 Second operand 9 states. [2019-01-14 02:50:14,820 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 02:50:14,820 INFO L93 Difference]: Finished difference Result 15 states and 14 transitions. [2019-01-14 02:50:14,822 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-01-14 02:50:14,823 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 15 states and 14 transitions. [2019-01-14 02:50:14,823 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2019-01-14 02:50:14,824 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 15 states to 0 states and 0 transitions. [2019-01-14 02:50:14,824 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2019-01-14 02:50:14,824 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2019-01-14 02:50:14,824 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2019-01-14 02:50:14,824 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-01-14 02:50:14,824 INFO L706 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-01-14 02:50:14,824 INFO L729 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-01-14 02:50:14,825 INFO L609 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-01-14 02:50:14,825 INFO L442 BuchiCegarLoop]: ======== Iteration 8============ [2019-01-14 02:50:14,825 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2019-01-14 02:50:14,825 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2019-01-14 02:50:14,825 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2019-01-14 02:50:14,832 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 14.01 02:50:14 BoogieIcfgContainer [2019-01-14 02:50:14,833 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2019-01-14 02:50:14,833 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-01-14 02:50:14,833 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-01-14 02:50:14,833 INFO L276 PluginConnector]: Witness Printer initialized [2019-01-14 02:50:14,834 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.01 02:50:06" (3/4) ... [2019-01-14 02:50:14,838 INFO L147 WitnessPrinter]: No result that supports witness generation found [2019-01-14 02:50:14,838 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-01-14 02:50:14,839 INFO L168 Benchmark]: Toolchain (without parser) took 9245.25 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 185.6 MB). Free memory was 948.7 MB in the beginning and 1.0 GB in the end (delta: -80.6 MB). Peak memory consumption was 105.0 MB. Max. memory is 11.5 GB. [2019-01-14 02:50:14,841 INFO L168 Benchmark]: CDTParser took 0.14 ms. Allocated memory is still 1.0 GB. Free memory is still 978.2 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-01-14 02:50:14,841 INFO L168 Benchmark]: CACSL2BoogieTranslator took 251.07 ms. Allocated memory is still 1.0 GB. Free memory was 948.7 MB in the beginning and 937.9 MB in the end (delta: 10.7 MB). Peak memory consumption was 10.7 MB. Max. memory is 11.5 GB. [2019-01-14 02:50:14,842 INFO L168 Benchmark]: Boogie Procedure Inliner took 33.72 ms. Allocated memory is still 1.0 GB. Free memory is still 937.9 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-01-14 02:50:14,842 INFO L168 Benchmark]: Boogie Preprocessor took 23.67 ms. Allocated memory is still 1.0 GB. Free memory is still 937.9 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-01-14 02:50:14,843 INFO L168 Benchmark]: RCFGBuilder took 409.70 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 105.4 MB). Free memory was 937.9 MB in the beginning and 1.1 GB in the end (delta: -142.7 MB). Peak memory consumption was 18.4 MB. Max. memory is 11.5 GB. [2019-01-14 02:50:14,844 INFO L168 Benchmark]: BuchiAutomizer took 8516.36 ms. Allocated memory was 1.1 GB in the beginning and 1.2 GB in the end (delta: 80.2 MB). Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 51.4 MB). Peak memory consumption was 131.6 MB. Max. memory is 11.5 GB. [2019-01-14 02:50:14,845 INFO L168 Benchmark]: Witness Printer took 5.45 ms. Allocated memory is still 1.2 GB. Free memory is still 1.0 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-01-14 02:50:14,849 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.14 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 251.07 ms. Allocated memory is still 1.0 GB. Free memory was 948.7 MB in the beginning and 937.9 MB in the end (delta: 10.7 MB). Peak memory consumption was 10.7 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 33.72 ms. Allocated memory is still 1.0 GB. Free memory is still 937.9 MB. There was no memory consumed. Max. memory is 11.5 GB. * Boogie Preprocessor took 23.67 ms. Allocated memory is still 1.0 GB. Free memory is still 937.9 MB. There was no memory consumed. Max. memory is 11.5 GB. * RCFGBuilder took 409.70 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 105.4 MB). Free memory was 937.9 MB in the beginning and 1.1 GB in the end (delta: -142.7 MB). Peak memory consumption was 18.4 MB. Max. memory is 11.5 GB. * BuchiAutomizer took 8516.36 ms. Allocated memory was 1.1 GB in the beginning and 1.2 GB in the end (delta: 80.2 MB). Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 51.4 MB). Peak memory consumption was 131.6 MB. Max. memory is 11.5 GB. * Witness Printer took 5.45 ms. Allocated memory is still 1.2 GB. Free memory is still 1.0 GB. There was no memory consumed. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Constructed decomposition of program Your program was decomposed into 7 terminating modules (5 trivial, 2 deterministic, 0 nondeterministic). One deterministic module has affine ranking function b and consists of 4 locations. One deterministic module has affine ranking function a + -1 * b and consists of 4 locations. 5 modules have a trivial ranking function, the largest among these consists of 12 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 8.4s and 8 iterations. TraceHistogramMax:6. Analysis of lassos took 6.5s. Construction of modules took 0.8s. Büchi inclusion checks took 0.7s. Highest rank in rank-based complementation 3. Minimization of det autom 4. Minimization of nondet autom 3. Automata minimization 0.0s AutomataMinimizationTime, 6 MinimizatonAttempts, 7 StatesRemovedByMinimization, 2 NontrivialMinimizations. Non-live state removal took 0.0s Buchi closure took 0.0s. Biggest automaton had 19 states and ocurred in iteration 6. Nontrivial modules had stage [2, 0, 0, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 26 SDtfs, 31 SDslu, 12 SDs, 0 SdLazy, 223 SolverSat, 21 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.8s Time LassoAnalysisResults: nont0 unkn0 SFLI0 SFLT0 conc4 concLT0 SILN1 SILU0 SILI0 SILT0 lasso2 LassoPreprocessingBenchmarks: Lassos: inital28 mio100 ax100 hnf90 lsp100 ukn100 mio100 lsp100 div100 bol100 ite100 ukn100 eq191 hnf92 smp100 dnf141 smp100 tf102 neg96 sie113 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: sat Degree: 0 Time: 284ms VariablesStem: 6 VariablesLoop: 3 DisjunctsStem: 1 DisjunctsLoop: 2 SupportingInvariants: 4 MotzkinApplications: 16 LassoTerminationAnalysisBenchmarks: LassoNonterminationAnalysisSatFixpoint: 1 LassoNonterminationAnalysisSatUnbounded: 3 LassoNonterminationAnalysisUnsat: 2 LassoNonterminationAnalysisUnknown: 0 LassoNonterminationAnalysisTime: 1.4s - TerminationAnalysisResult: Termination proven Buchi Automizer proved that your program is terminating RESULT: Ultimate proved your program to be correct! Received shutdown request...