./Ultimate.py --spec /storage/repos/svcomp/c/properties/termination.prp --file /storage/repos/svcomp/c/recursive/gcd01_true-unreach-call_true-no-overflow_true-termination.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for termination Using default analysis Version 2e94e6aa Calling Ultimate with: java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx12G -Xms1G -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerTermination.xml -i /storage/repos/svcomp/c/recursive/gcd01_true-unreach-call_true-no-overflow_true-termination.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(F end) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 0497b69437c9ebb889888bdb31aaefcc8eaad029 .......................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.24-2e94e6a [2019-01-01 23:53:54,718 INFO L170 SettingsManager]: Resetting all preferences to default values... [2019-01-01 23:53:54,720 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2019-01-01 23:53:54,732 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-01-01 23:53:54,732 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-01-01 23:53:54,733 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-01-01 23:53:54,735 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-01-01 23:53:54,737 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2019-01-01 23:53:54,739 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-01-01 23:53:54,740 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-01-01 23:53:54,741 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-01-01 23:53:54,741 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-01-01 23:53:54,743 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-01-01 23:53:54,744 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-01-01 23:53:54,745 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-01-01 23:53:54,746 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-01-01 23:53:54,747 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-01-01 23:53:54,749 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-01-01 23:53:54,752 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2019-01-01 23:53:54,753 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-01-01 23:53:54,755 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-01-01 23:53:54,756 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-01-01 23:53:54,759 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-01-01 23:53:54,760 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-01-01 23:53:54,760 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-01-01 23:53:54,761 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-01-01 23:53:54,762 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-01-01 23:53:54,763 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-01-01 23:53:54,765 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2019-01-01 23:53:54,766 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-01-01 23:53:54,766 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2019-01-01 23:53:54,767 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-01-01 23:53:54,768 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-01-01 23:53:54,768 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2019-01-01 23:53:54,769 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2019-01-01 23:53:54,770 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2019-01-01 23:53:54,771 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-32bit-Automizer_Default.epf [2019-01-01 23:53:54,798 INFO L110 SettingsManager]: Loading preferences was successful [2019-01-01 23:53:54,798 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2019-01-01 23:53:54,799 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-01-01 23:53:54,800 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2019-01-01 23:53:54,802 INFO L133 SettingsManager]: * Use SBE=true [2019-01-01 23:53:54,802 INFO L131 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2019-01-01 23:53:54,802 INFO L133 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2019-01-01 23:53:54,802 INFO L133 SettingsManager]: * Use old map elimination=false [2019-01-01 23:53:54,803 INFO L133 SettingsManager]: * Use external solver (rank synthesis)=false [2019-01-01 23:53:54,803 INFO L133 SettingsManager]: * Use only trivial implications for array writes=true [2019-01-01 23:53:54,803 INFO L133 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2019-01-01 23:53:54,803 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-01-01 23:53:54,803 INFO L133 SettingsManager]: * sizeof long=4 [2019-01-01 23:53:54,803 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2019-01-01 23:53:54,804 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2019-01-01 23:53:54,804 INFO L133 SettingsManager]: * sizeof POINTER=4 [2019-01-01 23:53:54,804 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2019-01-01 23:53:54,804 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2019-01-01 23:53:54,804 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2019-01-01 23:53:54,804 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2019-01-01 23:53:54,808 INFO L133 SettingsManager]: * sizeof long double=12 [2019-01-01 23:53:54,808 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2019-01-01 23:53:54,809 INFO L133 SettingsManager]: * Assume nondeterminstic values are in range=false [2019-01-01 23:53:54,809 INFO L133 SettingsManager]: * Use constant arrays=true [2019-01-01 23:53:54,809 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2019-01-01 23:53:54,809 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-01-01 23:53:54,809 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-01-01 23:53:54,812 INFO L133 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2019-01-01 23:53:54,812 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-01-01 23:53:54,812 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2019-01-01 23:53:54,812 INFO L133 SettingsManager]: * Dump automata to the following directory=/home/matthias/ultimate/dump/auto [2019-01-01 23:53:54,813 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2019-01-01 23:53:54,813 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 -> 0497b69437c9ebb889888bdb31aaefcc8eaad029 [2019-01-01 23:53:54,854 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-01-01 23:53:54,866 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-01-01 23:53:54,870 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-01-01 23:53:54,871 INFO L271 PluginConnector]: Initializing CDTParser... [2019-01-01 23:53:54,872 INFO L276 PluginConnector]: CDTParser initialized [2019-01-01 23:53:54,873 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/svcomp/c/recursive/gcd01_true-unreach-call_true-no-overflow_true-termination.c [2019-01-01 23:53:54,939 INFO L221 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/044e7850e/752d2b5eeba34146b6770497e89fbd1f/FLAGc2e6316d5 [2019-01-01 23:53:55,391 INFO L307 CDTParser]: Found 1 translation units. [2019-01-01 23:53:55,391 INFO L161 CDTParser]: Scanning /storage/repos/svcomp/c/recursive/gcd01_true-unreach-call_true-no-overflow_true-termination.c [2019-01-01 23:53:55,399 INFO L355 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/044e7850e/752d2b5eeba34146b6770497e89fbd1f/FLAGc2e6316d5 [2019-01-01 23:53:55,420 INFO L363 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/044e7850e/752d2b5eeba34146b6770497e89fbd1f [2019-01-01 23:53:55,425 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-01-01 23:53:55,427 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-01-01 23:53:55,428 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-01-01 23:53:55,428 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-01-01 23:53:55,435 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2019-01-01 23:53:55,436 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 01.01 11:53:55" (1/1) ... [2019-01-01 23:53:55,440 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@51c017a2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 11:53:55, skipping insertion in model container [2019-01-01 23:53:55,442 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 01.01 11:53:55" (1/1) ... [2019-01-01 23:53:55,450 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-01-01 23:53:55,472 INFO L176 MainTranslator]: Built tables and reachable declarations [2019-01-01 23:53:55,695 INFO L204 PostProcessor]: Analyzing one entry point: main [2019-01-01 23:53:55,702 INFO L191 MainTranslator]: Completed pre-run [2019-01-01 23:53:55,726 INFO L204 PostProcessor]: Analyzing one entry point: main [2019-01-01 23:53:55,744 INFO L195 MainTranslator]: Completed translation [2019-01-01 23:53:55,745 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 11:53:55 WrapperNode [2019-01-01 23:53:55,745 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-01-01 23:53:55,746 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-01-01 23:53:55,746 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-01-01 23:53:55,746 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2019-01-01 23:53:55,757 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 11:53:55" (1/1) ... [2019-01-01 23:53:55,763 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 11:53:55" (1/1) ... [2019-01-01 23:53:55,787 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-01-01 23:53:55,788 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-01-01 23:53:55,788 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-01-01 23:53:55,788 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2019-01-01 23:53:55,798 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 11:53:55" (1/1) ... [2019-01-01 23:53:55,798 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 11:53:55" (1/1) ... [2019-01-01 23:53:55,799 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 11:53:55" (1/1) ... [2019-01-01 23:53:55,799 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 11:53:55" (1/1) ... [2019-01-01 23:53:55,802 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 11:53:55" (1/1) ... [2019-01-01 23:53:55,804 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 11:53:55" (1/1) ... [2019-01-01 23:53:55,805 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 11:53:55" (1/1) ... [2019-01-01 23:53:55,806 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-01-01 23:53:55,807 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-01-01 23:53:55,807 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-01-01 23:53:55,807 INFO L276 PluginConnector]: RCFGBuilder initialized [2019-01-01 23:53:55,808 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 11:53:55" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-01 23:53:55,938 INFO L130 BoogieDeclarations]: Found specification of procedure gcd [2019-01-01 23:53:55,939 INFO L138 BoogieDeclarations]: Found implementation of procedure gcd [2019-01-01 23:53:55,939 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-01-01 23:53:55,939 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-01-01 23:53:56,278 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-01-01 23:53:56,278 INFO L280 CfgBuilder]: Removed 4 assue(true) statements. [2019-01-01 23:53:56,279 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 01.01 11:53:56 BoogieIcfgContainer [2019-01-01 23:53:56,279 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-01-01 23:53:56,280 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2019-01-01 23:53:56,280 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2019-01-01 23:53:56,283 INFO L276 PluginConnector]: BuchiAutomizer initialized [2019-01-01 23:53:56,284 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-01-01 23:53:56,285 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 01.01 11:53:55" (1/3) ... [2019-01-01 23:53:56,286 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@37f796b6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 01.01 11:53:56, skipping insertion in model container [2019-01-01 23:53:56,286 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-01-01 23:53:56,286 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 11:53:55" (2/3) ... [2019-01-01 23:53:56,286 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@37f796b6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 01.01 11:53:56, skipping insertion in model container [2019-01-01 23:53:56,287 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-01-01 23:53:56,287 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 01.01 11:53:56" (3/3) ... [2019-01-01 23:53:56,288 INFO L375 chiAutomizerObserver]: Analyzing ICFG gcd01_true-unreach-call_true-no-overflow_true-termination.c [2019-01-01 23:53:56,348 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2019-01-01 23:53:56,349 INFO L374 BuchiCegarLoop]: Interprodecural is true [2019-01-01 23:53:56,349 INFO L375 BuchiCegarLoop]: Hoare is false [2019-01-01 23:53:56,349 INFO L376 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2019-01-01 23:53:56,349 INFO L377 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2019-01-01 23:53:56,349 INFO L378 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-01-01 23:53:56,350 INFO L379 BuchiCegarLoop]: Difference is false [2019-01-01 23:53:56,350 INFO L380 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-01-01 23:53:56,350 INFO L383 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2019-01-01 23:53:56,366 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 20 states. [2019-01-01 23:53:56,393 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 6 [2019-01-01 23:53:56,394 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-01 23:53:56,394 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-01 23:53:56,403 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1] [2019-01-01 23:53:56,403 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1] [2019-01-01 23:53:56,403 INFO L442 BuchiCegarLoop]: ======== Iteration 1============ [2019-01-01 23:53:56,403 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 20 states. [2019-01-01 23:53:56,406 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 6 [2019-01-01 23:53:56,406 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-01 23:53:56,407 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-01 23:53:56,407 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1] [2019-01-01 23:53:56,407 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1] [2019-01-01 23:53:56,415 INFO L794 eck$LassoCheckResult]: Stem: 14#ULTIMATE.startENTRYtrue havoc main_#res;havoc main_#t~nondet2, main_#t~nondet3, main_#t~ret4, main_~m~0, main_~n~0, main_~z~0;main_~m~0 := main_#t~nondet2;havoc main_#t~nondet2; 10#L30true assume !(main_~m~0 <= 0 || main_~m~0 > 2147483647);main_~n~0 := main_#t~nondet3;havoc main_#t~nondet3; 18#L34true assume !(main_~n~0 <= 0 || main_~n~0 > 2147483647); 4#L37true call main_#t~ret4 := gcd(main_~m~0, main_~n~0);< 5#gcdENTRYtrue [2019-01-01 23:53:56,416 INFO L796 eck$LassoCheckResult]: Loop: 5#gcdENTRYtrue ~y1 := #in~y1;~y2 := #in~y2; 21#L16true assume !(~y1 <= 0 || ~y2 <= 0); 15#L19true assume !(~y1 == ~y2); 12#L22true assume ~y1 > ~y2; 3#L23true call #t~ret0 := gcd(~y1 - ~y2, ~y2);< 5#gcdENTRYtrue [2019-01-01 23:53:56,421 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 23:53:56,422 INFO L82 PathProgramCache]: Analyzing trace with hash 1513559, now seen corresponding path program 1 times [2019-01-01 23:53:56,424 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 23:53:56,424 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 23:53:56,479 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 23:53:56,479 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 23:53:56,479 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 23:53:56,516 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 23:53:56,523 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 23:53:56,544 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 23:53:56,545 INFO L82 PathProgramCache]: Analyzing trace with hash 28756386, now seen corresponding path program 1 times [2019-01-01 23:53:56,545 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 23:53:56,545 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 23:53:56,546 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 23:53:56,546 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 23:53:56,546 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 23:53:56,552 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 23:53:56,558 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 23:53:56,561 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 23:53:56,561 INFO L82 PathProgramCache]: Analyzing trace with hash -15763700, now seen corresponding path program 1 times [2019-01-01 23:53:56,561 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 23:53:56,562 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 23:53:56,563 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 23:53:56,563 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 23:53:56,563 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 23:53:56,574 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 23:53:56,583 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 23:53:56,732 WARN L181 SmtUtils]: Spent 116.00 ms on a formula simplification. DAG size of input: 22 DAG size of output: 18 [2019-01-01 23:53:56,890 INFO L216 LassoAnalysis]: Preferences: [2019-01-01 23:53:56,891 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-01-01 23:53:56,891 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-01-01 23:53:56,891 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-01-01 23:53:56,891 INFO L127 ssoRankerPreferences]: Use exernal solver: true [2019-01-01 23:53:56,892 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-01 23:53:56,892 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-01-01 23:53:56,892 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-01-01 23:53:56,892 INFO L131 ssoRankerPreferences]: Filename of dumped script: gcd01_true-unreach-call_true-no-overflow_true-termination.c_Iteration1_Loop [2019-01-01 23:53:56,892 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-01-01 23:53:56,893 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2019-01-01 23:53:56,915 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 23:53:56,948 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 23:53:56,996 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 23:53:57,002 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 23:53:57,004 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 23:53:57,027 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 23:53:57,229 INFO L300 LassoAnalysis]: Preprocessing complete. [2019-01-01 23:53:57,230 INFO L412 LassoAnalysis]: Checking for nontermination... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-01 23:53:57,243 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-01 23:53:57,244 INFO L163 nArgumentSynthesizer]: Using integer mode. [2019-01-01 23:53:57,270 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2019-01-01 23:53:57,271 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {gcd_#res=0} Honda state: {gcd_#res=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-01-01 23:53:57,309 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-01 23:53:57,309 INFO L163 nArgumentSynthesizer]: Using integer mode. Waiting until toolchain timeout for monitored process 3 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-01-01 23:53:57,356 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2019-01-01 23:53:57,357 INFO L163 nArgumentSynthesizer]: Using integer mode. Waiting until toolchain timeout for monitored process 4 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-01 23:53:57,406 INFO L452 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2019-01-01 23:53:57,408 INFO L216 LassoAnalysis]: Preferences: [2019-01-01 23:53:57,409 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-01-01 23:53:57,409 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-01-01 23:53:57,409 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-01-01 23:53:57,409 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2019-01-01 23:53:57,409 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-01 23:53:57,409 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-01-01 23:53:57,410 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-01-01 23:53:57,410 INFO L131 ssoRankerPreferences]: Filename of dumped script: gcd01_true-unreach-call_true-no-overflow_true-termination.c_Iteration1_Loop [2019-01-01 23:53:57,410 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-01-01 23:53:57,410 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2019-01-01 23:53:57,413 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 23:53:57,415 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 23:53:57,422 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 23:53:57,462 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 23:53:57,466 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 23:53:57,471 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 23:53:57,600 WARN L181 SmtUtils]: Spent 108.00 ms on a formula simplification that was a NOOP. DAG size: 13 [2019-01-01 23:53:57,634 INFO L300 LassoAnalysis]: Preprocessing complete. [2019-01-01 23:53:57,640 INFO L497 LassoAnalysis]: Using template 'affine'. [2019-01-01 23:53:57,642 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 23:53:57,643 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 23:53:57,644 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 23:53:57,644 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 23:53:57,645 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 23:53:57,645 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 23:53:57,648 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 23:53:57,648 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 23:53:57,653 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 23:53:57,654 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 23:53:57,655 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 23:53:57,655 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 23:53:57,655 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 23:53:57,655 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 23:53:57,655 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 23:53:57,657 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 23:53:57,657 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 23:53:57,659 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 23:53:57,660 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 23:53:57,660 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 23:53:57,661 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 23:53:57,662 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 23:53:57,662 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 23:53:57,662 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 23:53:57,664 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 23:53:57,664 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 23:53:57,676 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-01-01 23:53:57,684 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2019-01-01 23:53:57,684 INFO L444 ModelExtractionUtils]: 1 out of 4 variables were initially zero. Simplification set additionally 1 variables to zero. [2019-01-01 23:53:57,687 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-01-01 23:53:57,687 INFO L440 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2019-01-01 23:53:57,688 INFO L518 LassoAnalysis]: Proved termination. [2019-01-01 23:53:57,688 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(gcd_#in~y1) = 1*gcd_#in~y1 Supporting invariants [] [2019-01-01 23:53:57,690 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2019-01-01 23:53:57,925 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 23:53:57,958 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 23:53:57,962 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-01 23:53:57,994 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 23:53:57,995 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-01 23:53:58,120 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-01 23:53:58,135 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 4 loop predicates [2019-01-01 23:53:58,137 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 20 states. Second operand 5 states. [2019-01-01 23:53:58,606 WARN L181 SmtUtils]: Spent 100.00 ms on a formula simplification that was a NOOP. DAG size: 9 [2019-01-01 23:53:58,934 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 20 states.. Second operand 5 states. Result 93 states and 129 transitions. Complement of second has 30 states. [2019-01-01 23:53:58,937 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 7 states 1 stem states 5 non-accepting loop states 1 accepting loop states [2019-01-01 23:53:58,939 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2019-01-01 23:53:58,941 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 24 transitions. [2019-01-01 23:53:58,943 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 24 transitions. Stem has 4 letters. Loop has 5 letters. [2019-01-01 23:53:58,944 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-01 23:53:58,945 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 24 transitions. Stem has 9 letters. Loop has 5 letters. [2019-01-01 23:53:58,945 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-01 23:53:58,945 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 24 transitions. Stem has 4 letters. Loop has 10 letters. [2019-01-01 23:53:58,946 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-01 23:53:58,947 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 93 states and 129 transitions. [2019-01-01 23:53:58,956 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2019-01-01 23:53:58,962 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 93 states to 35 states and 40 transitions. [2019-01-01 23:53:58,964 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 16 [2019-01-01 23:53:58,964 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 18 [2019-01-01 23:53:58,965 INFO L73 IsDeterministic]: Start isDeterministic. Operand 35 states and 40 transitions. [2019-01-01 23:53:58,965 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-01-01 23:53:58,965 INFO L705 BuchiCegarLoop]: Abstraction has 35 states and 40 transitions. [2019-01-01 23:53:58,980 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states and 40 transitions. [2019-01-01 23:53:58,991 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 17. [2019-01-01 23:53:58,991 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2019-01-01 23:53:58,992 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 20 transitions. [2019-01-01 23:53:58,993 INFO L728 BuchiCegarLoop]: Abstraction has 17 states and 20 transitions. [2019-01-01 23:53:58,993 INFO L608 BuchiCegarLoop]: Abstraction has 17 states and 20 transitions. [2019-01-01 23:53:58,993 INFO L442 BuchiCegarLoop]: ======== Iteration 2============ [2019-01-01 23:53:58,993 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 17 states and 20 transitions. [2019-01-01 23:53:58,994 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2019-01-01 23:53:58,994 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-01 23:53:58,994 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-01 23:53:58,995 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2019-01-01 23:53:58,995 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1] [2019-01-01 23:53:58,995 INFO L794 eck$LassoCheckResult]: Stem: 208#ULTIMATE.startENTRY havoc main_#res;havoc main_#t~nondet2, main_#t~nondet3, main_#t~ret4, main_~m~0, main_~n~0, main_~z~0;main_~m~0 := main_#t~nondet2;havoc main_#t~nondet2; 209#L30 assume !(main_~m~0 <= 0 || main_~m~0 > 2147483647);main_~n~0 := main_#t~nondet3;havoc main_#t~nondet3; 214#L34 assume !(main_~n~0 <= 0 || main_~n~0 > 2147483647); 200#L37 call main_#t~ret4 := gcd(main_~m~0, main_~n~0);< 202#gcdENTRY ~y1 := #in~y1;~y2 := #in~y2; 205#L16 [2019-01-01 23:53:58,996 INFO L796 eck$LassoCheckResult]: Loop: 205#L16 assume !(~y1 <= 0 || ~y2 <= 0); 210#L19 assume !(~y1 == ~y2); 211#L22 assume !(~y1 > ~y2); 204#L25 call #t~ret1 := gcd(~y1, ~y2 - ~y1);< 203#gcdENTRY ~y1 := #in~y1;~y2 := #in~y2; 205#L16 [2019-01-01 23:53:58,996 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 23:53:58,996 INFO L82 PathProgramCache]: Analyzing trace with hash 46920329, now seen corresponding path program 1 times [2019-01-01 23:53:58,996 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 23:53:58,996 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 23:53:58,997 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 23:53:58,998 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 23:53:58,998 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 23:53:59,003 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 23:53:59,008 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 23:53:59,013 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 23:53:59,014 INFO L82 PathProgramCache]: Analyzing trace with hash 32576381, now seen corresponding path program 1 times [2019-01-01 23:53:59,014 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 23:53:59,015 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 23:53:59,015 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 23:53:59,016 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 23:53:59,016 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 23:53:59,031 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 23:53:59,038 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 23:53:59,043 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 23:53:59,045 INFO L82 PathProgramCache]: Analyzing trace with hash -488671755, now seen corresponding path program 1 times [2019-01-01 23:53:59,045 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 23:53:59,045 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 23:53:59,046 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 23:53:59,046 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 23:53:59,046 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 23:53:59,055 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 23:53:59,072 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 23:53:59,235 INFO L216 LassoAnalysis]: Preferences: [2019-01-01 23:53:59,235 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-01-01 23:53:59,235 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-01-01 23:53:59,236 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-01-01 23:53:59,236 INFO L127 ssoRankerPreferences]: Use exernal solver: true [2019-01-01 23:53:59,236 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-01 23:53:59,236 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-01-01 23:53:59,237 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-01-01 23:53:59,237 INFO L131 ssoRankerPreferences]: Filename of dumped script: gcd01_true-unreach-call_true-no-overflow_true-termination.c_Iteration2_Loop [2019-01-01 23:53:59,237 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-01-01 23:53:59,237 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2019-01-01 23:53:59,240 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 23:53:59,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-01 23:53:59,287 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 23:53:59,289 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 23:53:59,463 WARN L181 SmtUtils]: Spent 157.00 ms on a formula simplification. DAG size of input: 22 DAG size of output: 20 [2019-01-01 23:53:59,506 INFO L300 LassoAnalysis]: Preprocessing complete. [2019-01-01 23:53:59,507 INFO L412 LassoAnalysis]: Checking for nontermination... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-01 23:53:59,512 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-01 23:53:59,512 INFO L163 nArgumentSynthesizer]: Using integer mode. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 6 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-01 23:53:59,543 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2019-01-01 23:53:59,543 INFO L163 nArgumentSynthesizer]: Using integer mode. [2019-01-01 23:54:04,295 INFO L452 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2019-01-01 23:54:04,298 INFO L216 LassoAnalysis]: Preferences: [2019-01-01 23:54:04,298 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-01-01 23:54:04,298 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-01-01 23:54:04,299 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-01-01 23:54:04,299 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2019-01-01 23:54:04,299 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-01 23:54:04,299 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-01-01 23:54:04,299 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-01-01 23:54:04,299 INFO L131 ssoRankerPreferences]: Filename of dumped script: gcd01_true-unreach-call_true-no-overflow_true-termination.c_Iteration2_Loop [2019-01-01 23:54:04,300 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-01-01 23:54:04,300 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2019-01-01 23:54:04,302 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 23:54:04,323 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 23:54:04,327 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 23:54:04,337 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 23:54:04,474 WARN L181 SmtUtils]: Spent 124.00 ms on a formula simplification. DAG size of input: 22 DAG size of output: 20 [2019-01-01 23:54:04,737 WARN L181 SmtUtils]: Spent 247.00 ms on a formula simplification that was a NOOP. DAG size: 20 [2019-01-01 23:54:04,814 INFO L300 LassoAnalysis]: Preprocessing complete. [2019-01-01 23:54:04,814 INFO L497 LassoAnalysis]: Using template 'affine'. [2019-01-01 23:54:04,816 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 23:54:04,817 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 23:54:04,817 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 23:54:04,822 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 23:54:04,822 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 23:54:04,822 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 23:54:04,824 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 23:54:04,824 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 23:54:04,840 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-01-01 23:54:04,857 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2019-01-01 23:54:04,857 INFO L444 ModelExtractionUtils]: 3 out of 6 variables were initially zero. Simplification set additionally 1 variables to zero. [2019-01-01 23:54:04,857 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-01-01 23:54:04,858 INFO L440 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2019-01-01 23:54:04,858 INFO L518 LassoAnalysis]: Proved termination. [2019-01-01 23:54:04,858 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(gcd_~y2) = 1*gcd_~y2 Supporting invariants [] [2019-01-01 23:54:04,858 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2019-01-01 23:54:04,888 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 23:54:04,914 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 23:54:04,916 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-01 23:54:04,936 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 23:54:04,937 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-01 23:54:04,989 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-01 23:54:04,990 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 3 loop predicates [2019-01-01 23:54:04,990 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 17 states and 20 transitions. cyclomatic complexity: 5 Second operand 4 states. [2019-01-01 23:54:05,037 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 17 states and 20 transitions. cyclomatic complexity: 5. Second operand 4 states. Result 53 states and 60 transitions. Complement of second has 11 states. [2019-01-01 23:54:05,040 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2019-01-01 23:54:05,041 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2019-01-01 23:54:05,042 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 11 transitions. [2019-01-01 23:54:05,042 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 11 transitions. Stem has 5 letters. Loop has 5 letters. [2019-01-01 23:54:05,042 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-01 23:54:05,042 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 11 transitions. Stem has 10 letters. Loop has 5 letters. [2019-01-01 23:54:05,043 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-01 23:54:05,043 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 11 transitions. Stem has 5 letters. Loop has 10 letters. [2019-01-01 23:54:05,043 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-01 23:54:05,043 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 53 states and 60 transitions. [2019-01-01 23:54:05,046 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2019-01-01 23:54:05,049 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 53 states to 32 states and 36 transitions. [2019-01-01 23:54:05,049 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 10 [2019-01-01 23:54:05,049 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 10 [2019-01-01 23:54:05,049 INFO L73 IsDeterministic]: Start isDeterministic. Operand 32 states and 36 transitions. [2019-01-01 23:54:05,049 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-01-01 23:54:05,049 INFO L705 BuchiCegarLoop]: Abstraction has 32 states and 36 transitions. [2019-01-01 23:54:05,050 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states and 36 transitions. [2019-01-01 23:54:05,053 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 24. [2019-01-01 23:54:05,053 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2019-01-01 23:54:05,054 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 27 transitions. [2019-01-01 23:54:05,054 INFO L728 BuchiCegarLoop]: Abstraction has 24 states and 27 transitions. [2019-01-01 23:54:05,054 INFO L608 BuchiCegarLoop]: Abstraction has 24 states and 27 transitions. [2019-01-01 23:54:05,054 INFO L442 BuchiCegarLoop]: ======== Iteration 3============ [2019-01-01 23:54:05,054 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 24 states and 27 transitions. [2019-01-01 23:54:05,055 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2019-01-01 23:54:05,055 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-01 23:54:05,055 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-01 23:54:05,056 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [2, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-01 23:54:05,056 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1] [2019-01-01 23:54:05,056 INFO L794 eck$LassoCheckResult]: Stem: 335#ULTIMATE.startENTRY havoc main_#res;havoc main_#t~nondet2, main_#t~nondet3, main_#t~ret4, main_~m~0, main_~n~0, main_~z~0;main_~m~0 := main_#t~nondet2;havoc main_#t~nondet2; 336#L30 assume !(main_~m~0 <= 0 || main_~m~0 > 2147483647);main_~n~0 := main_#t~nondet3;havoc main_#t~nondet3; 344#L34 assume !(main_~n~0 <= 0 || main_~n~0 > 2147483647); 331#L37 call main_#t~ret4 := gcd(main_~m~0, main_~n~0);< 332#gcdENTRY ~y1 := #in~y1;~y2 := #in~y2; 333#L16 assume !(~y1 <= 0 || ~y2 <= 0); 349#L19 assume !(~y1 == ~y2); 348#L22 assume ~y1 > ~y2; 327#L23 call #t~ret0 := gcd(~y1 - ~y2, ~y2);< 329#gcdENTRY ~y1 := #in~y1;~y2 := #in~y2; 345#L16 [2019-01-01 23:54:05,056 INFO L796 eck$LassoCheckResult]: Loop: 345#L16 assume !(~y1 <= 0 || ~y2 <= 0); 337#L19 assume !(~y1 == ~y2); 339#L22 assume !(~y1 > ~y2); 338#L25 call #t~ret1 := gcd(~y1, ~y2 - ~y1);< 342#gcdENTRY ~y1 := #in~y1;~y2 := #in~y2; 345#L16 [2019-01-01 23:54:05,056 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 23:54:05,057 INFO L82 PathProgramCache]: Analyzing trace with hash -488674700, now seen corresponding path program 2 times [2019-01-01 23:54:05,057 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 23:54:05,057 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 23:54:05,058 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 23:54:05,058 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 23:54:05,058 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 23:54:05,063 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 23:54:05,069 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 23:54:05,071 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 23:54:05,072 INFO L82 PathProgramCache]: Analyzing trace with hash 32576381, now seen corresponding path program 2 times [2019-01-01 23:54:05,072 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 23:54:05,072 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 23:54:05,073 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 23:54:05,073 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-01 23:54:05,073 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 23:54:05,076 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 23:54:05,079 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 23:54:05,080 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 23:54:05,081 INFO L82 PathProgramCache]: Analyzing trace with hash -1201587990, now seen corresponding path program 1 times [2019-01-01 23:54:05,081 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 23:54:05,081 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 23:54:05,082 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 23:54:05,082 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-01 23:54:05,082 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 23:54:05,090 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 23:54:05,105 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 23:54:05,243 INFO L216 LassoAnalysis]: Preferences: [2019-01-01 23:54:05,243 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-01-01 23:54:05,243 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-01-01 23:54:05,244 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-01-01 23:54:05,244 INFO L127 ssoRankerPreferences]: Use exernal solver: true [2019-01-01 23:54:05,244 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-01 23:54:05,244 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-01-01 23:54:05,245 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-01-01 23:54:05,245 INFO L131 ssoRankerPreferences]: Filename of dumped script: gcd01_true-unreach-call_true-no-overflow_true-termination.c_Iteration3_Loop [2019-01-01 23:54:05,245 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-01-01 23:54:05,245 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2019-01-01 23:54:05,247 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 23:54:05,251 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 23:54:05,268 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 23:54:05,273 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 23:54:05,371 INFO L300 LassoAnalysis]: Preprocessing complete. [2019-01-01 23:54:05,371 INFO L412 LassoAnalysis]: Checking for nontermination... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 7 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-01 23:54:05,375 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-01 23:54:05,375 INFO L163 nArgumentSynthesizer]: Using integer mode. [2019-01-01 23:54:05,380 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2019-01-01 23:54:05,380 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {gcd_#t~ret0=0} Honda state: {gcd_#t~ret0=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 8 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-01 23:54:05,401 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-01 23:54:05,402 INFO L163 nArgumentSynthesizer]: Using integer mode. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 9 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-01 23:54:05,431 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2019-01-01 23:54:05,431 INFO L163 nArgumentSynthesizer]: Using integer mode. [2019-01-01 23:54:06,193 INFO L452 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2019-01-01 23:54:06,196 INFO L216 LassoAnalysis]: Preferences: [2019-01-01 23:54:06,196 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-01-01 23:54:06,196 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-01-01 23:54:06,196 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-01-01 23:54:06,197 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2019-01-01 23:54:06,197 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-01 23:54:06,197 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-01-01 23:54:06,197 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-01-01 23:54:06,197 INFO L131 ssoRankerPreferences]: Filename of dumped script: gcd01_true-unreach-call_true-no-overflow_true-termination.c_Iteration3_Loop [2019-01-01 23:54:06,197 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-01-01 23:54:06,197 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2019-01-01 23:54:06,199 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 23:54:06,209 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 23:54:06,254 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 23:54:06,256 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 23:54:06,361 INFO L300 LassoAnalysis]: Preprocessing complete. [2019-01-01 23:54:06,362 INFO L497 LassoAnalysis]: Using template 'affine'. [2019-01-01 23:54:06,362 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 23:54:06,363 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 23:54:06,363 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 23:54:06,364 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 23:54:06,364 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 23:54:06,364 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 23:54:06,364 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 23:54:06,365 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 23:54:06,366 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 23:54:06,366 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 23:54:06,367 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 23:54:06,367 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 23:54:06,367 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 23:54:06,367 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 23:54:06,368 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 23:54:06,370 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 23:54:06,370 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 23:54:06,378 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-01-01 23:54:06,383 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2019-01-01 23:54:06,384 INFO L444 ModelExtractionUtils]: 3 out of 6 variables were initially zero. Simplification set additionally 1 variables to zero. [2019-01-01 23:54:06,384 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-01-01 23:54:06,384 INFO L440 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2019-01-01 23:54:06,384 INFO L518 LassoAnalysis]: Proved termination. [2019-01-01 23:54:06,385 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(gcd_~y2) = 1*gcd_~y2 Supporting invariants [] [2019-01-01 23:54:06,386 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2019-01-01 23:54:06,428 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 23:54:06,457 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 23:54:06,459 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-01 23:54:06,482 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 23:54:06,483 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-01 23:54:06,664 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-01 23:54:06,665 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 3 loop predicates [2019-01-01 23:54:06,665 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 24 states and 27 transitions. cyclomatic complexity: 6 Second operand 4 states. [2019-01-01 23:54:06,712 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 24 states and 27 transitions. cyclomatic complexity: 6. Second operand 4 states. Result 45 states and 50 transitions. Complement of second has 11 states. [2019-01-01 23:54:06,713 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2019-01-01 23:54:06,714 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2019-01-01 23:54:06,714 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 11 transitions. [2019-01-01 23:54:06,714 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 11 transitions. Stem has 10 letters. Loop has 5 letters. [2019-01-01 23:54:06,715 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-01 23:54:06,715 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2019-01-01 23:54:06,740 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 23:54:06,768 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 23:54:06,770 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-01 23:54:06,783 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 23:54:06,785 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-01 23:54:06,829 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-01 23:54:06,829 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and with honda bouncer for loop.1 stem predicates 3 loop predicates [2019-01-01 23:54:06,829 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 24 states and 27 transitions. cyclomatic complexity: 6 Second operand 4 states. [2019-01-01 23:54:06,879 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 24 states and 27 transitions. cyclomatic complexity: 6. Second operand 4 states. Result 45 states and 50 transitions. Complement of second has 11 states. [2019-01-01 23:54:06,880 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2019-01-01 23:54:06,880 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2019-01-01 23:54:06,880 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 11 transitions. [2019-01-01 23:54:06,881 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 11 transitions. Stem has 10 letters. Loop has 5 letters. [2019-01-01 23:54:06,881 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-01 23:54:06,881 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2019-01-01 23:54:06,892 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 23:54:06,918 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 23:54:06,920 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-01 23:54:06,937 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 23:54:06,939 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-01 23:54:06,982 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-01 23:54:06,983 INFO L152 lantAutomatonBouncer]: Defining Buchi interpolant automaton with scrooge nondeterminism in stemwith honda bouncer for stem and without honda bouncer for loop.1 stem predicates 3 loop predicates [2019-01-01 23:54:06,983 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 24 states and 27 transitions. cyclomatic complexity: 6 Second operand 4 states. [2019-01-01 23:54:07,020 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 24 states and 27 transitions. cyclomatic complexity: 6. Second operand 4 states. Result 74 states and 85 transitions. Complement of second has 12 states. [2019-01-01 23:54:07,024 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2019-01-01 23:54:07,024 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2019-01-01 23:54:07,025 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 18 transitions. [2019-01-01 23:54:07,025 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 18 transitions. Stem has 10 letters. Loop has 5 letters. [2019-01-01 23:54:07,025 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-01 23:54:07,026 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 18 transitions. Stem has 15 letters. Loop has 5 letters. [2019-01-01 23:54:07,030 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-01 23:54:07,030 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 18 transitions. Stem has 10 letters. Loop has 10 letters. [2019-01-01 23:54:07,034 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-01 23:54:07,034 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 74 states and 85 transitions. [2019-01-01 23:54:07,037 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2019-01-01 23:54:07,039 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 74 states to 0 states and 0 transitions. [2019-01-01 23:54:07,039 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2019-01-01 23:54:07,039 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2019-01-01 23:54:07,039 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2019-01-01 23:54:07,039 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-01-01 23:54:07,039 INFO L705 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-01-01 23:54:07,040 INFO L728 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-01-01 23:54:07,040 INFO L608 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-01-01 23:54:07,040 INFO L442 BuchiCegarLoop]: ======== Iteration 4============ [2019-01-01 23:54:07,040 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2019-01-01 23:54:07,040 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2019-01-01 23:54:07,040 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2019-01-01 23:54:07,051 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 01.01 11:54:07 BoogieIcfgContainer [2019-01-01 23:54:07,051 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2019-01-01 23:54:07,051 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-01-01 23:54:07,051 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-01-01 23:54:07,052 INFO L276 PluginConnector]: Witness Printer initialized [2019-01-01 23:54:07,053 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 01.01 11:53:56" (3/4) ... [2019-01-01 23:54:07,056 INFO L147 WitnessPrinter]: No result that supports witness generation found [2019-01-01 23:54:07,056 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-01-01 23:54:07,057 INFO L168 Benchmark]: Toolchain (without parser) took 11631.60 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 124.8 MB). Free memory was 952.7 MB in the beginning and 792.2 MB in the end (delta: 160.5 MB). Peak memory consumption was 285.3 MB. Max. memory is 11.5 GB. [2019-01-01 23:54:07,059 INFO L168 Benchmark]: CDTParser took 0.15 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-01 23:54:07,059 INFO L168 Benchmark]: CACSL2BoogieTranslator took 317.22 ms. Allocated memory is still 1.0 GB. Free memory was 952.7 MB in the beginning and 942.0 MB in the end (delta: 10.7 MB). Peak memory consumption was 10.7 MB. Max. memory is 11.5 GB. [2019-01-01 23:54:07,061 INFO L168 Benchmark]: Boogie Procedure Inliner took 41.22 ms. Allocated memory is still 1.0 GB. Free memory is still 942.0 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-01-01 23:54:07,061 INFO L168 Benchmark]: Boogie Preprocessor took 18.98 ms. Allocated memory is still 1.0 GB. Free memory is still 942.0 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-01-01 23:54:07,062 INFO L168 Benchmark]: RCFGBuilder took 472.19 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 124.8 MB). Free memory was 942.0 MB in the beginning and 1.1 GB in the end (delta: -155.4 MB). Peak memory consumption was 18.5 MB. Max. memory is 11.5 GB. [2019-01-01 23:54:07,063 INFO L168 Benchmark]: BuchiAutomizer took 10771.27 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 792.2 MB in the end (delta: 305.1 MB). Peak memory consumption was 305.1 MB. Max. memory is 11.5 GB. [2019-01-01 23:54:07,063 INFO L168 Benchmark]: Witness Printer took 5.30 ms. Allocated memory is still 1.2 GB. Free memory is still 792.2 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-01-01 23:54:07,068 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.15 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 317.22 ms. Allocated memory is still 1.0 GB. Free memory was 952.7 MB in the beginning and 942.0 MB in the end (delta: 10.7 MB). Peak memory consumption was 10.7 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 41.22 ms. Allocated memory is still 1.0 GB. Free memory is still 942.0 MB. There was no memory consumed. Max. memory is 11.5 GB. * Boogie Preprocessor took 18.98 ms. Allocated memory is still 1.0 GB. Free memory is still 942.0 MB. There was no memory consumed. Max. memory is 11.5 GB. * RCFGBuilder took 472.19 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 124.8 MB). Free memory was 942.0 MB in the beginning and 1.1 GB in the end (delta: -155.4 MB). Peak memory consumption was 18.5 MB. Max. memory is 11.5 GB. * BuchiAutomizer took 10771.27 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 792.2 MB in the end (delta: 305.1 MB). Peak memory consumption was 305.1 MB. Max. memory is 11.5 GB. * Witness Printer took 5.30 ms. Allocated memory is still 1.2 GB. Free memory is still 792.2 MB. There was no memory consumed. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Constructed decomposition of program Your program was decomposed into 3 terminating modules (0 trivial, 2 deterministic, 1 nondeterministic). One deterministic module has affine ranking function \old(y1) and consists of 7 locations. One deterministic module has affine ranking function y2 and consists of 4 locations. One nondeterministic module has affine ranking function y2 and consists of 4 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 10.7s and 4 iterations. TraceHistogramMax:2. Analysis of lassos took 8.4s. Construction of modules took 0.4s. Büchi inclusion checks took 1.6s. Highest rank in rank-based complementation 3. Minimization of det autom 1. Minimization of nondet autom 2. Automata minimization 0.0s AutomataMinimizationTime, 2 MinimizatonAttempts, 26 StatesRemovedByMinimization, 2 NontrivialMinimizations. Non-live state removal took 0.0s Buchi closure took 0.0s. Biggest automaton had 24 states and ocurred in iteration 2. Nontrivial modules had stage [2, 0, 1, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 47 SDtfs, 78 SDslu, 8 SDs, 0 SdLazy, 115 SolverSat, 19 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.4s Time LassoAnalysisResults: nont0 unkn0 SFLI0 SFLT3 conc0 concLT0 SILN0 SILU0 SILI0 SILT0 lasso0 LassoPreprocessingBenchmarks: Lassos: inital25 mio100 ax100 hnf91 lsp100 ukn100 mio100 lsp100 div100 bol100 ite100 ukn100 eq177 hnf91 smp89 dnf100 smp100 tf106 neg98 sie112 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 0 Time: 12ms VariablesStem: 0 VariablesLoop: 0 DisjunctsStem: 1 DisjunctsLoop: 1 SupportingInvariants: 0 MotzkinApplications: 2 LassoTerminationAnalysisBenchmarks: LassoNonterminationAnalysisSatFixpoint: 2 LassoNonterminationAnalysisSatUnbounded: 0 LassoNonterminationAnalysisUnsat: 3 LassoNonterminationAnalysisUnknown: 0 LassoNonterminationAnalysisTime: 5.7s - TerminationAnalysisResult: Termination proven Buchi Automizer proved that your program is terminating RESULT: Ultimate proved your program to be correct! Received shutdown request...