./Ultimate.py --spec /storage/repos/svcomp/c/properties/termination.prp --file /storage/repos/svcomp/c/termination-numeric/gcd01_true-termination_true-no-overflow.c --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for termination Using default analysis Version 2e94e6aa Calling Ultimate with: java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx12G -Xms1G -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerTermination.xml -i /storage/repos/svcomp/c/termination-numeric/gcd01_true-termination_true-no-overflow.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-64bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(F end) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 64bit --witnessprinter.graph.data.programhash 60bddbffe1e2002d3081296e00d2a4e7e030158e ......................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.24-2e94e6a [2019-01-01 21:35:57,222 INFO L170 SettingsManager]: Resetting all preferences to default values... [2019-01-01 21:35:57,225 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2019-01-01 21:35:57,244 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-01-01 21:35:57,245 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-01-01 21:35:57,246 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-01-01 21:35:57,247 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-01-01 21:35:57,257 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2019-01-01 21:35:57,260 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-01-01 21:35:57,261 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-01-01 21:35:57,262 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-01-01 21:35:57,262 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-01-01 21:35:57,263 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-01-01 21:35:57,265 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-01-01 21:35:57,267 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-01-01 21:35:57,270 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-01-01 21:35:57,271 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-01-01 21:35:57,276 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-01-01 21:35:57,281 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2019-01-01 21:35:57,285 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-01-01 21:35:57,286 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-01-01 21:35:57,291 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-01-01 21:35:57,296 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-01-01 21:35:57,298 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-01-01 21:35:57,298 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-01-01 21:35:57,299 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-01-01 21:35:57,303 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-01-01 21:35:57,304 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-01-01 21:35:57,307 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2019-01-01 21:35:57,309 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-01-01 21:35:57,309 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2019-01-01 21:35:57,311 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-01-01 21:35:57,313 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-01-01 21:35:57,314 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2019-01-01 21:35:57,315 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2019-01-01 21:35:57,317 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2019-01-01 21:35:57,319 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-64bit-Automizer_Default.epf [2019-01-01 21:35:57,340 INFO L110 SettingsManager]: Loading preferences was successful [2019-01-01 21:35:57,340 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2019-01-01 21:35:57,341 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-01-01 21:35:57,342 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2019-01-01 21:35:57,342 INFO L133 SettingsManager]: * Use SBE=true [2019-01-01 21:35:57,343 INFO L131 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2019-01-01 21:35:57,343 INFO L133 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2019-01-01 21:35:57,343 INFO L133 SettingsManager]: * Use old map elimination=false [2019-01-01 21:35:57,343 INFO L133 SettingsManager]: * Use external solver (rank synthesis)=false [2019-01-01 21:35:57,343 INFO L133 SettingsManager]: * Use only trivial implications for array writes=true [2019-01-01 21:35:57,343 INFO L133 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2019-01-01 21:35:57,344 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-01-01 21:35:57,344 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2019-01-01 21:35:57,344 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2019-01-01 21:35:57,344 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2019-01-01 21:35:57,344 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2019-01-01 21:35:57,344 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2019-01-01 21:35:57,346 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2019-01-01 21:35:57,346 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2019-01-01 21:35:57,347 INFO L133 SettingsManager]: * Assume nondeterminstic values are in range=false [2019-01-01 21:35:57,347 INFO L133 SettingsManager]: * Use constant arrays=true [2019-01-01 21:35:57,347 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2019-01-01 21:35:57,347 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-01-01 21:35:57,347 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-01-01 21:35:57,348 INFO L133 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2019-01-01 21:35:57,349 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-01-01 21:35:57,349 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2019-01-01 21:35:57,349 INFO L133 SettingsManager]: * Dump automata to the following directory=/home/matthias/ultimate/dump/auto [2019-01-01 21:35:57,351 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2019-01-01 21:35:57,351 INFO L133 SettingsManager]: * TransformationType=MODULO_NEIGHBOR Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(F end) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 64bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 60bddbffe1e2002d3081296e00d2a4e7e030158e [2019-01-01 21:35:57,399 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-01-01 21:35:57,415 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-01-01 21:35:57,420 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-01-01 21:35:57,421 INFO L271 PluginConnector]: Initializing CDTParser... [2019-01-01 21:35:57,422 INFO L276 PluginConnector]: CDTParser initialized [2019-01-01 21:35:57,423 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/svcomp/c/termination-numeric/gcd01_true-termination_true-no-overflow.c [2019-01-01 21:35:57,493 INFO L221 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/eedfa2fd1/045748c9daeb459ebd06ba5a47698108/FLAG004b22a09 [2019-01-01 21:35:58,003 INFO L307 CDTParser]: Found 1 translation units. [2019-01-01 21:35:58,005 INFO L161 CDTParser]: Scanning /storage/repos/svcomp/c/termination-numeric/gcd01_true-termination_true-no-overflow.c [2019-01-01 21:35:58,016 INFO L355 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/eedfa2fd1/045748c9daeb459ebd06ba5a47698108/FLAG004b22a09 [2019-01-01 21:35:58,342 INFO L363 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/eedfa2fd1/045748c9daeb459ebd06ba5a47698108 [2019-01-01 21:35:58,347 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-01-01 21:35:58,348 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-01-01 21:35:58,349 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-01-01 21:35:58,350 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-01-01 21:35:58,354 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2019-01-01 21:35:58,355 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 01.01 09:35:58" (1/1) ... [2019-01-01 21:35:58,358 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6cd3e7f7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 09:35:58, skipping insertion in model container [2019-01-01 21:35:58,359 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 01.01 09:35:58" (1/1) ... [2019-01-01 21:35:58,368 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-01-01 21:35:58,388 INFO L176 MainTranslator]: Built tables and reachable declarations [2019-01-01 21:35:58,609 INFO L204 PostProcessor]: Analyzing one entry point: main [2019-01-01 21:35:58,617 INFO L191 MainTranslator]: Completed pre-run [2019-01-01 21:35:58,649 INFO L204 PostProcessor]: Analyzing one entry point: main [2019-01-01 21:35:58,670 INFO L195 MainTranslator]: Completed translation [2019-01-01 21:35:58,671 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 09:35:58 WrapperNode [2019-01-01 21:35:58,671 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-01-01 21:35:58,672 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-01-01 21:35:58,672 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-01-01 21:35:58,672 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2019-01-01 21:35:58,684 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 09:35:58" (1/1) ... [2019-01-01 21:35:58,691 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 09:35:58" (1/1) ... [2019-01-01 21:35:58,724 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-01-01 21:35:58,724 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-01-01 21:35:58,724 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-01-01 21:35:58,725 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2019-01-01 21:35:58,738 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 09:35:58" (1/1) ... [2019-01-01 21:35:58,739 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 09:35:58" (1/1) ... [2019-01-01 21:35:58,739 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 09:35:58" (1/1) ... [2019-01-01 21:35:58,740 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 09:35:58" (1/1) ... [2019-01-01 21:35:58,744 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 09:35:58" (1/1) ... [2019-01-01 21:35:58,749 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 09:35:58" (1/1) ... [2019-01-01 21:35:58,750 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 09:35:58" (1/1) ... [2019-01-01 21:35:58,753 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-01-01 21:35:58,760 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-01-01 21:35:58,761 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-01-01 21:35:58,761 INFO L276 PluginConnector]: RCFGBuilder initialized [2019-01-01 21:35:58,763 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 09:35:58" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-01 21:35:58,922 INFO L130 BoogieDeclarations]: Found specification of procedure gcd [2019-01-01 21:35:58,922 INFO L138 BoogieDeclarations]: Found implementation of procedure gcd [2019-01-01 21:35:58,922 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-01-01 21:35:58,922 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-01-01 21:35:59,277 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-01-01 21:35:59,277 INFO L280 CfgBuilder]: Removed 4 assue(true) statements. [2019-01-01 21:35:59,278 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 01.01 09:35:59 BoogieIcfgContainer [2019-01-01 21:35:59,278 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-01-01 21:35:59,279 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2019-01-01 21:35:59,279 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2019-01-01 21:35:59,283 INFO L276 PluginConnector]: BuchiAutomizer initialized [2019-01-01 21:35:59,284 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-01-01 21:35:59,285 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 01.01 09:35:58" (1/3) ... [2019-01-01 21:35:59,286 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@5cd2c2d6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 01.01 09:35:59, skipping insertion in model container [2019-01-01 21:35:59,286 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-01-01 21:35:59,286 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 09:35:58" (2/3) ... [2019-01-01 21:35:59,287 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@5cd2c2d6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 01.01 09:35:59, skipping insertion in model container [2019-01-01 21:35:59,287 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-01-01 21:35:59,287 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 01.01 09:35:59" (3/3) ... [2019-01-01 21:35:59,289 INFO L375 chiAutomizerObserver]: Analyzing ICFG gcd01_true-termination_true-no-overflow.c [2019-01-01 21:35:59,356 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2019-01-01 21:35:59,357 INFO L374 BuchiCegarLoop]: Interprodecural is true [2019-01-01 21:35:59,357 INFO L375 BuchiCegarLoop]: Hoare is false [2019-01-01 21:35:59,357 INFO L376 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2019-01-01 21:35:59,358 INFO L377 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2019-01-01 21:35:59,358 INFO L378 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-01-01 21:35:59,358 INFO L379 BuchiCegarLoop]: Difference is false [2019-01-01 21:35:59,358 INFO L380 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-01-01 21:35:59,358 INFO L383 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2019-01-01 21:35:59,378 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 20 states. [2019-01-01 21:35:59,422 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 6 [2019-01-01 21:35:59,422 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-01 21:35:59,423 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-01 21:35:59,432 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1] [2019-01-01 21:35:59,432 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1] [2019-01-01 21:35:59,433 INFO L442 BuchiCegarLoop]: ======== Iteration 1============ [2019-01-01 21:35:59,433 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 20 states. [2019-01-01 21:35:59,436 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 6 [2019-01-01 21:35:59,436 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-01 21:35:59,436 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-01 21:35:59,437 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1] [2019-01-01 21:35:59,437 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1] [2019-01-01 21:35:59,445 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_~n~0 := main_#t~nondet3;havoc main_#t~nondet3; 18#L34true assume !(main_~n~0 <= 0); 4#L37true call main_#t~ret4 := gcd(main_~m~0, main_~n~0);< 5#gcdENTRYtrue [2019-01-01 21:35:59,446 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 21:35:59,453 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 21:35:59,454 INFO L82 PathProgramCache]: Analyzing trace with hash 1513559, now seen corresponding path program 1 times [2019-01-01 21:35:59,456 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 21:35:59,457 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 21:35:59,506 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:35:59,507 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 21:35:59,507 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:35:59,542 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 21:35:59,549 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 21:35:59,573 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 21:35:59,573 INFO L82 PathProgramCache]: Analyzing trace with hash 28756386, now seen corresponding path program 1 times [2019-01-01 21:35:59,573 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 21:35:59,574 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 21:35:59,575 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:35:59,575 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 21:35:59,575 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:35:59,588 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 21:35:59,598 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 21:35:59,601 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 21:35:59,601 INFO L82 PathProgramCache]: Analyzing trace with hash -15763700, now seen corresponding path program 1 times [2019-01-01 21:35:59,602 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 21:35:59,602 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 21:35:59,603 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:35:59,603 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 21:35:59,603 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:35:59,615 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 21:35:59,630 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 21:35:59,803 WARN L181 SmtUtils]: Spent 136.00 ms on a formula simplification. DAG size of input: 22 DAG size of output: 18 [2019-01-01 21:35:59,965 INFO L216 LassoAnalysis]: Preferences: [2019-01-01 21:35:59,967 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-01-01 21:35:59,967 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-01-01 21:35:59,967 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-01-01 21:35:59,967 INFO L127 ssoRankerPreferences]: Use exernal solver: true [2019-01-01 21:35:59,968 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-01 21:35:59,968 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-01-01 21:35:59,968 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-01-01 21:35:59,968 INFO L131 ssoRankerPreferences]: Filename of dumped script: gcd01_true-termination_true-no-overflow.c_Iteration1_Loop [2019-01-01 21:35:59,968 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-01-01 21:35:59,969 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2019-01-01 21:35:59,992 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:36:00,023 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:36:00,163 WARN L181 SmtUtils]: Spent 123.00 ms on a formula simplification that was a NOOP. DAG size: 11 [2019-01-01 21:36:00,164 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:36:00,191 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:36:00,218 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:36:00,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-01 21:36:00,428 WARN L181 SmtUtils]: Spent 110.00 ms on a formula simplification that was a NOOP. DAG size: 13 [2019-01-01 21:36:00,633 INFO L300 LassoAnalysis]: Preprocessing complete. [2019-01-01 21:36:00,634 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) [2019-01-01 21:36:00,650 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-01 21:36:00,650 INFO L163 nArgumentSynthesizer]: Using integer mode. Waiting until toolchain timeout for monitored process 2 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-01 21:36:00,671 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2019-01-01 21:36:00,672 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 21:36:00,712 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-01 21:36:00,712 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) Waiting until toolchain timeout for monitored process 4 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-01 21:36:00,762 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2019-01-01 21:36:00,762 INFO L163 nArgumentSynthesizer]: Using integer mode. [2019-01-01 21:36:00,799 INFO L452 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2019-01-01 21:36:00,801 INFO L216 LassoAnalysis]: Preferences: [2019-01-01 21:36:00,802 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-01-01 21:36:00,802 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-01-01 21:36:00,802 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-01-01 21:36:00,802 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2019-01-01 21:36:00,802 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-01 21:36:00,803 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-01-01 21:36:00,803 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-01-01 21:36:00,803 INFO L131 ssoRankerPreferences]: Filename of dumped script: gcd01_true-termination_true-no-overflow.c_Iteration1_Loop [2019-01-01 21:36:00,803 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-01-01 21:36:00,803 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2019-01-01 21:36:00,805 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:36:00,832 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:36:00,860 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:36:00,893 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:36:00,898 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:36:00,901 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:36:01,037 WARN L181 SmtUtils]: Spent 119.00 ms on a formula simplification that was a NOOP. DAG size: 13 [2019-01-01 21:36:01,083 INFO L300 LassoAnalysis]: Preprocessing complete. [2019-01-01 21:36:01,089 INFO L497 LassoAnalysis]: Using template 'affine'. [2019-01-01 21:36:01,092 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 21:36:01,093 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:36:01,094 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 21:36:01,095 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:36:01,095 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:36:01,095 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:36:01,098 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 21:36:01,098 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 21:36:01,103 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 21:36:01,104 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 21:36:01,105 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:36:01,105 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 21:36:01,105 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:36:01,105 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:36:01,105 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:36:01,106 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 21:36:01,106 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 21:36:01,108 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 21:36:01,109 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 21:36:01,109 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:36:01,110 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 21:36:01,110 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:36:01,110 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:36:01,110 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:36:01,112 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 21:36:01,112 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 21:36:01,124 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-01-01 21:36:01,134 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2019-01-01 21:36:01,135 INFO L444 ModelExtractionUtils]: 1 out of 4 variables were initially zero. Simplification set additionally 1 variables to zero. [2019-01-01 21:36:01,137 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-01-01 21:36:01,138 INFO L440 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2019-01-01 21:36:01,138 INFO L518 LassoAnalysis]: Proved termination. [2019-01-01 21:36:01,139 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(gcd_#in~y1) = 1*gcd_#in~y1 Supporting invariants [] [2019-01-01 21:36:01,141 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2019-01-01 21:36:01,198 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 21:36:01,225 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 21:36:01,237 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-01 21:36:01,277 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 21:36:01,279 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-01 21:36:01,410 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-01 21:36:01,426 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 21:36:01,427 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 20 states. Second operand 5 states. [2019-01-01 21:36:01,890 WARN L181 SmtUtils]: Spent 105.00 ms on a formula simplification that was a NOOP. DAG size: 9 [2019-01-01 21:36:02,395 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 21:36:02,396 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 21:36:02,398 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2019-01-01 21:36:02,400 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 24 transitions. [2019-01-01 21:36:02,402 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 24 transitions. Stem has 4 letters. Loop has 5 letters. [2019-01-01 21:36:02,404 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-01 21:36:02,404 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 24 transitions. Stem has 9 letters. Loop has 5 letters. [2019-01-01 21:36:02,405 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-01 21:36:02,405 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 24 transitions. Stem has 4 letters. Loop has 10 letters. [2019-01-01 21:36:02,405 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-01 21:36:02,407 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 93 states and 129 transitions. [2019-01-01 21:36:02,417 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2019-01-01 21:36:02,424 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 93 states to 35 states and 40 transitions. [2019-01-01 21:36:02,426 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 16 [2019-01-01 21:36:02,427 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 18 [2019-01-01 21:36:02,428 INFO L73 IsDeterministic]: Start isDeterministic. Operand 35 states and 40 transitions. [2019-01-01 21:36:02,428 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-01-01 21:36:02,428 INFO L705 BuchiCegarLoop]: Abstraction has 35 states and 40 transitions. [2019-01-01 21:36:02,450 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states and 40 transitions. [2019-01-01 21:36:02,461 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 17. [2019-01-01 21:36:02,461 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2019-01-01 21:36:02,462 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 20 transitions. [2019-01-01 21:36:02,464 INFO L728 BuchiCegarLoop]: Abstraction has 17 states and 20 transitions. [2019-01-01 21:36:02,464 INFO L608 BuchiCegarLoop]: Abstraction has 17 states and 20 transitions. [2019-01-01 21:36:02,464 INFO L442 BuchiCegarLoop]: ======== Iteration 2============ [2019-01-01 21:36:02,465 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 17 states and 20 transitions. [2019-01-01 21:36:02,465 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2019-01-01 21:36:02,466 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-01 21:36:02,466 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-01 21:36:02,466 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2019-01-01 21:36:02,466 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1] [2019-01-01 21:36:02,467 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_~n~0 := main_#t~nondet3;havoc main_#t~nondet3; 214#L34 assume !(main_~n~0 <= 0); 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 21:36:02,467 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 21:36:02,467 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 21:36:02,467 INFO L82 PathProgramCache]: Analyzing trace with hash 46920329, now seen corresponding path program 1 times [2019-01-01 21:36:02,468 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 21:36:02,468 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 21:36:02,469 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:36:02,469 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 21:36:02,469 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:36:02,476 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 21:36:02,481 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 21:36:02,483 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 21:36:02,484 INFO L82 PathProgramCache]: Analyzing trace with hash 32576381, now seen corresponding path program 1 times [2019-01-01 21:36:02,484 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 21:36:02,484 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 21:36:02,486 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:36:02,486 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 21:36:02,486 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:36:02,492 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 21:36:02,497 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 21:36:02,500 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 21:36:02,500 INFO L82 PathProgramCache]: Analyzing trace with hash -488671755, now seen corresponding path program 1 times [2019-01-01 21:36:02,500 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 21:36:02,500 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 21:36:02,503 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:36:02,503 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 21:36:02,504 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:36:02,512 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 21:36:02,521 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 21:36:02,723 INFO L216 LassoAnalysis]: Preferences: [2019-01-01 21:36:02,724 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-01-01 21:36:02,724 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-01-01 21:36:02,724 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-01-01 21:36:02,724 INFO L127 ssoRankerPreferences]: Use exernal solver: true [2019-01-01 21:36:02,725 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-01 21:36:02,725 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-01-01 21:36:02,725 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-01-01 21:36:02,725 INFO L131 ssoRankerPreferences]: Filename of dumped script: gcd01_true-termination_true-no-overflow.c_Iteration2_Loop [2019-01-01 21:36:02,726 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-01-01 21:36:02,726 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2019-01-01 21:36:02,728 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:36:02,801 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:36:02,806 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:36:02,809 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:36:02,952 WARN L181 SmtUtils]: Spent 127.00 ms on a formula simplification. DAG size of input: 22 DAG size of output: 20 [2019-01-01 21:36:02,995 INFO L300 LassoAnalysis]: Preprocessing complete. [2019-01-01 21:36:02,995 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 21:36:03,001 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-01 21:36:03,001 INFO L163 nArgumentSynthesizer]: Using integer mode. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 6 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-01 21:36:03,040 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2019-01-01 21:36:03,040 INFO L163 nArgumentSynthesizer]: Using integer mode. [2019-01-01 21:36:08,475 INFO L452 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2019-01-01 21:36:08,478 INFO L216 LassoAnalysis]: Preferences: [2019-01-01 21:36:08,479 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-01-01 21:36:08,479 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-01-01 21:36:08,479 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-01-01 21:36:08,479 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2019-01-01 21:36:08,479 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-01 21:36:08,479 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-01-01 21:36:08,480 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-01-01 21:36:08,480 INFO L131 ssoRankerPreferences]: Filename of dumped script: gcd01_true-termination_true-no-overflow.c_Iteration2_Loop [2019-01-01 21:36:08,480 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-01-01 21:36:08,480 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2019-01-01 21:36:08,482 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:36:08,521 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:36:08,525 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:36:08,529 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:36:08,675 WARN L181 SmtUtils]: Spent 134.00 ms on a formula simplification. DAG size of input: 22 DAG size of output: 20 [2019-01-01 21:36:08,751 INFO L300 LassoAnalysis]: Preprocessing complete. [2019-01-01 21:36:08,751 INFO L497 LassoAnalysis]: Using template 'affine'. [2019-01-01 21:36:08,751 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 21:36:08,753 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:36:08,753 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 21:36:08,753 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:36:08,753 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:36:08,753 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:36:08,756 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 21:36:08,756 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 21:36:08,776 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-01-01 21:36:08,784 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2019-01-01 21:36:08,784 INFO L444 ModelExtractionUtils]: 3 out of 6 variables were initially zero. Simplification set additionally 1 variables to zero. [2019-01-01 21:36:08,785 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-01-01 21:36:08,785 INFO L440 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2019-01-01 21:36:08,785 INFO L518 LassoAnalysis]: Proved termination. [2019-01-01 21:36:08,785 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(gcd_~y2) = 1*gcd_~y2 Supporting invariants [] [2019-01-01 21:36:08,786 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2019-01-01 21:36:08,814 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 21:36:08,832 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 21:36:08,834 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-01 21:36:08,855 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 21:36:08,857 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-01 21:36:08,914 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-01 21:36:08,915 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 21:36:08,915 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 17 states and 20 transitions. cyclomatic complexity: 5 Second operand 4 states. [2019-01-01 21:36:08,974 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 21:36:08,976 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 21:36:08,977 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2019-01-01 21:36:08,978 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 11 transitions. [2019-01-01 21:36:08,978 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 11 transitions. Stem has 5 letters. Loop has 5 letters. [2019-01-01 21:36:08,978 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-01 21:36:08,979 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 11 transitions. Stem has 10 letters. Loop has 5 letters. [2019-01-01 21:36:08,979 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-01 21:36:08,979 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 11 transitions. Stem has 5 letters. Loop has 10 letters. [2019-01-01 21:36:08,979 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-01 21:36:08,980 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 53 states and 60 transitions. [2019-01-01 21:36:08,982 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2019-01-01 21:36:08,984 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 53 states to 32 states and 36 transitions. [2019-01-01 21:36:08,984 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 10 [2019-01-01 21:36:08,985 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 10 [2019-01-01 21:36:08,985 INFO L73 IsDeterministic]: Start isDeterministic. Operand 32 states and 36 transitions. [2019-01-01 21:36:08,986 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-01-01 21:36:08,986 INFO L705 BuchiCegarLoop]: Abstraction has 32 states and 36 transitions. [2019-01-01 21:36:08,986 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states and 36 transitions. [2019-01-01 21:36:08,988 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 24. [2019-01-01 21:36:08,989 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2019-01-01 21:36:08,990 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 27 transitions. [2019-01-01 21:36:08,990 INFO L728 BuchiCegarLoop]: Abstraction has 24 states and 27 transitions. [2019-01-01 21:36:08,990 INFO L608 BuchiCegarLoop]: Abstraction has 24 states and 27 transitions. [2019-01-01 21:36:08,990 INFO L442 BuchiCegarLoop]: ======== Iteration 3============ [2019-01-01 21:36:08,990 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 24 states and 27 transitions. [2019-01-01 21:36:08,992 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2019-01-01 21:36:08,992 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-01 21:36:08,992 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-01 21:36:08,993 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [2, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-01 21:36:08,993 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1] [2019-01-01 21:36:08,993 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_~n~0 := main_#t~nondet3;havoc main_#t~nondet3; 344#L34 assume !(main_~n~0 <= 0); 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 21:36:08,994 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 21:36:08,994 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 21:36:08,994 INFO L82 PathProgramCache]: Analyzing trace with hash -488674700, now seen corresponding path program 2 times [2019-01-01 21:36:08,994 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 21:36:08,994 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 21:36:08,995 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:36:08,996 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 21:36:08,996 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:36:09,002 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 21:36:09,009 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 21:36:09,012 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 21:36:09,012 INFO L82 PathProgramCache]: Analyzing trace with hash 32576381, now seen corresponding path program 2 times [2019-01-01 21:36:09,012 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 21:36:09,012 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 21:36:09,013 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:36:09,014 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-01 21:36:09,014 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:36:09,017 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 21:36:09,021 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 21:36:09,025 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 21:36:09,025 INFO L82 PathProgramCache]: Analyzing trace with hash -1201587990, now seen corresponding path program 1 times [2019-01-01 21:36:09,025 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 21:36:09,025 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 21:36:09,026 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:36:09,028 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-01 21:36:09,029 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:36:09,046 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 21:36:09,059 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 21:36:09,203 INFO L216 LassoAnalysis]: Preferences: [2019-01-01 21:36:09,203 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-01-01 21:36:09,203 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-01-01 21:36:09,203 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-01-01 21:36:09,204 INFO L127 ssoRankerPreferences]: Use exernal solver: true [2019-01-01 21:36:09,204 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-01 21:36:09,204 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-01-01 21:36:09,204 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-01-01 21:36:09,205 INFO L131 ssoRankerPreferences]: Filename of dumped script: gcd01_true-termination_true-no-overflow.c_Iteration3_Loop [2019-01-01 21:36:09,205 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-01-01 21:36:09,205 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2019-01-01 21:36:09,207 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:36:09,211 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:36:09,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-01 21:36:09,239 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:36:09,332 INFO L300 LassoAnalysis]: Preprocessing complete. [2019-01-01 21:36:09,332 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 21:36:09,337 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-01 21:36:09,337 INFO L163 nArgumentSynthesizer]: Using integer mode. [2019-01-01 21:36:09,345 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2019-01-01 21:36:09,345 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 21:36:09,367 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-01 21:36:09,367 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 21:36:09,398 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2019-01-01 21:36:09,398 INFO L163 nArgumentSynthesizer]: Using integer mode. [2019-01-01 21:36:10,233 INFO L452 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2019-01-01 21:36:10,238 INFO L216 LassoAnalysis]: Preferences: [2019-01-01 21:36:10,238 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-01-01 21:36:10,238 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-01-01 21:36:10,239 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-01-01 21:36:10,239 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2019-01-01 21:36:10,239 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-01 21:36:10,239 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-01-01 21:36:10,239 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-01-01 21:36:10,239 INFO L131 ssoRankerPreferences]: Filename of dumped script: gcd01_true-termination_true-no-overflow.c_Iteration3_Loop [2019-01-01 21:36:10,239 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-01-01 21:36:10,240 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2019-01-01 21:36:10,242 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:36:10,253 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:36:10,296 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:36:10,299 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:36:10,453 WARN L181 SmtUtils]: Spent 137.00 ms on a formula simplification. DAG size of input: 22 DAG size of output: 20 [2019-01-01 21:36:10,574 INFO L300 LassoAnalysis]: Preprocessing complete. [2019-01-01 21:36:10,575 INFO L497 LassoAnalysis]: Using template 'affine'. [2019-01-01 21:36:10,575 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 21:36:10,576 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:36:10,576 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 21:36:10,576 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:36:10,577 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:36:10,577 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:36:10,577 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 21:36:10,577 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 21:36:10,579 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 21:36:10,580 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 21:36:10,580 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:36:10,580 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 21:36:10,581 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:36:10,581 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:36:10,581 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:36:10,583 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 21:36:10,584 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 21:36:10,592 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-01-01 21:36:10,598 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2019-01-01 21:36:10,598 INFO L444 ModelExtractionUtils]: 3 out of 6 variables were initially zero. Simplification set additionally 1 variables to zero. [2019-01-01 21:36:10,599 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-01-01 21:36:10,600 INFO L440 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2019-01-01 21:36:10,600 INFO L518 LassoAnalysis]: Proved termination. [2019-01-01 21:36:10,600 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(gcd_~y2) = 1*gcd_~y2 Supporting invariants [] [2019-01-01 21:36:10,601 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2019-01-01 21:36:10,622 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 21:36:10,644 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 21:36:10,646 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-01 21:36:10,660 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 21:36:10,662 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-01 21:36:10,812 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-01 21:36:10,813 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 21:36:10,814 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 24 states and 27 transitions. cyclomatic complexity: 6 Second operand 4 states. [2019-01-01 21:36:10,907 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 21:36:10,909 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 21:36:10,910 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2019-01-01 21:36:10,910 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 11 transitions. [2019-01-01 21:36:10,910 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 11 transitions. Stem has 10 letters. Loop has 5 letters. [2019-01-01 21:36:10,911 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-01 21:36:10,911 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2019-01-01 21:36:10,946 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 21:36:10,965 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 21:36:10,968 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-01 21:36:10,985 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 21:36:10,987 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-01 21:36:11,018 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-01 21:36:11,019 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 21:36:11,019 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 24 states and 27 transitions. cyclomatic complexity: 6 Second operand 4 states. [2019-01-01 21:36:11,066 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 21:36:11,067 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 21:36:11,067 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2019-01-01 21:36:11,068 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 11 transitions. [2019-01-01 21:36:11,069 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 11 transitions. Stem has 10 letters. Loop has 5 letters. [2019-01-01 21:36:11,069 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-01 21:36:11,069 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2019-01-01 21:36:11,093 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 21:36:11,122 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 21:36:11,124 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-01 21:36:11,143 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 21:36:11,145 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-01 21:36:11,177 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-01 21:36:11,178 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 21:36:11,178 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 24 states and 27 transitions. cyclomatic complexity: 6 Second operand 4 states. [2019-01-01 21:36:11,233 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 21:36:11,234 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 21:36:11,235 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2019-01-01 21:36:11,235 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 18 transitions. [2019-01-01 21:36:11,235 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 18 transitions. Stem has 10 letters. Loop has 5 letters. [2019-01-01 21:36:11,238 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-01 21:36:11,240 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 18 transitions. Stem has 15 letters. Loop has 5 letters. [2019-01-01 21:36:11,241 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-01 21:36:11,241 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 18 transitions. Stem has 10 letters. Loop has 10 letters. [2019-01-01 21:36:11,242 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-01 21:36:11,243 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 74 states and 85 transitions. [2019-01-01 21:36:11,251 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2019-01-01 21:36:11,252 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 74 states to 0 states and 0 transitions. [2019-01-01 21:36:11,252 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2019-01-01 21:36:11,252 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2019-01-01 21:36:11,252 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2019-01-01 21:36:11,253 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-01-01 21:36:11,253 INFO L705 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-01-01 21:36:11,253 INFO L728 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-01-01 21:36:11,253 INFO L608 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-01-01 21:36:11,253 INFO L442 BuchiCegarLoop]: ======== Iteration 4============ [2019-01-01 21:36:11,253 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2019-01-01 21:36:11,253 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2019-01-01 21:36:11,253 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2019-01-01 21:36:11,264 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 01.01 09:36:11 BoogieIcfgContainer [2019-01-01 21:36:11,264 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2019-01-01 21:36:11,265 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-01-01 21:36:11,265 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-01-01 21:36:11,265 INFO L276 PluginConnector]: Witness Printer initialized [2019-01-01 21:36:11,267 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 01.01 09:35:59" (3/4) ... [2019-01-01 21:36:11,271 INFO L147 WitnessPrinter]: No result that supports witness generation found [2019-01-01 21:36:11,271 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-01-01 21:36:11,272 INFO L168 Benchmark]: Toolchain (without parser) took 12924.26 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 112.2 MB). Free memory was 951.4 MB in the beginning and 778.7 MB in the end (delta: 172.7 MB). Peak memory consumption was 284.9 MB. Max. memory is 11.5 GB. [2019-01-01 21:36:11,274 INFO L168 Benchmark]: CDTParser took 0.18 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 21:36:11,275 INFO L168 Benchmark]: CACSL2BoogieTranslator took 322.18 ms. Allocated memory is still 1.0 GB. Free memory was 951.4 MB in the beginning and 940.6 MB in the end (delta: 10.7 MB). Peak memory consumption was 10.7 MB. Max. memory is 11.5 GB. [2019-01-01 21:36:11,276 INFO L168 Benchmark]: Boogie Procedure Inliner took 51.75 ms. Allocated memory is still 1.0 GB. Free memory is still 940.6 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-01-01 21:36:11,276 INFO L168 Benchmark]: Boogie Preprocessor took 28.87 ms. Allocated memory is still 1.0 GB. Free memory is still 940.6 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-01-01 21:36:11,277 INFO L168 Benchmark]: RCFGBuilder took 517.65 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 112.2 MB). Free memory was 940.6 MB in the beginning and 1.1 GB in the end (delta: -145.8 MB). Peak memory consumption was 18.4 MB. Max. memory is 11.5 GB. [2019-01-01 21:36:11,278 INFO L168 Benchmark]: BuchiAutomizer took 11985.62 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 778.7 MB in the end (delta: 307.8 MB). Peak memory consumption was 307.8 MB. Max. memory is 11.5 GB. [2019-01-01 21:36:11,279 INFO L168 Benchmark]: Witness Printer took 6.12 ms. Allocated memory is still 1.1 GB. Free memory is still 778.7 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-01-01 21:36:11,284 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.18 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 322.18 ms. Allocated memory is still 1.0 GB. Free memory was 951.4 MB in the beginning and 940.6 MB in the end (delta: 10.7 MB). Peak memory consumption was 10.7 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 51.75 ms. Allocated memory is still 1.0 GB. Free memory is still 940.6 MB. There was no memory consumed. Max. memory is 11.5 GB. * Boogie Preprocessor took 28.87 ms. Allocated memory is still 1.0 GB. Free memory is still 940.6 MB. There was no memory consumed. Max. memory is 11.5 GB. * RCFGBuilder took 517.65 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 112.2 MB). Free memory was 940.6 MB in the beginning and 1.1 GB in the end (delta: -145.8 MB). Peak memory consumption was 18.4 MB. Max. memory is 11.5 GB. * BuchiAutomizer took 11985.62 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 778.7 MB in the end (delta: 307.8 MB). Peak memory consumption was 307.8 MB. Max. memory is 11.5 GB. * Witness Printer took 6.12 ms. Allocated memory is still 1.1 GB. Free memory is still 778.7 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 11.9s and 4 iterations. TraceHistogramMax:2. Analysis of lassos took 9.6s. Construction of modules took 0.5s. Büchi inclusion checks took 1.4s. 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.5s 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: 6.4s - TerminationAnalysisResult: Termination proven Buchi Automizer proved that your program is terminating RESULT: Ultimate proved your program to be correct! Received shutdown request...