./Ultimate.py --spec /storage/repos/svcomp/c/properties/termination.prp --file /storage/repos/svcomp/c/termination-restricted-15/GCD3_true-termination_true-no-overflow.c --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for termination Using default analysis Version 0ed9222f Calling Ultimate with: java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx12G -Xms1G -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerTermination.xml -i /storage/repos/svcomp/c/termination-restricted-15/GCD3_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 aae625cda61f26fa063b78c3d3a58aff5ded8a89 .................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.24-0ed9222-m [2019-01-14 02:19:02,121 INFO L170 SettingsManager]: Resetting all preferences to default values... [2019-01-14 02:19:02,123 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2019-01-14 02:19:02,141 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-01-14 02:19:02,141 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-01-14 02:19:02,143 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-01-14 02:19:02,144 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-01-14 02:19:02,146 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2019-01-14 02:19:02,147 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-01-14 02:19:02,148 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-01-14 02:19:02,149 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-01-14 02:19:02,149 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-01-14 02:19:02,150 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-01-14 02:19:02,151 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-01-14 02:19:02,152 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-01-14 02:19:02,153 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-01-14 02:19:02,154 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-01-14 02:19:02,156 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-01-14 02:19:02,158 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2019-01-14 02:19:02,159 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-01-14 02:19:02,163 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-01-14 02:19:02,167 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-01-14 02:19:02,170 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-01-14 02:19:02,171 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-01-14 02:19:02,171 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-01-14 02:19:02,172 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-01-14 02:19:02,177 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-01-14 02:19:02,178 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-01-14 02:19:02,180 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2019-01-14 02:19:02,182 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-01-14 02:19:02,183 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2019-01-14 02:19:02,184 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-01-14 02:19:02,184 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-01-14 02:19:02,186 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2019-01-14 02:19:02,188 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2019-01-14 02:19:02,189 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2019-01-14 02:19:02,191 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-64bit-Automizer_Default.epf [2019-01-14 02:19:02,223 INFO L110 SettingsManager]: Loading preferences was successful [2019-01-14 02:19:02,224 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2019-01-14 02:19:02,225 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-01-14 02:19:02,225 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2019-01-14 02:19:02,225 INFO L133 SettingsManager]: * Use SBE=true [2019-01-14 02:19:02,225 INFO L131 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2019-01-14 02:19:02,226 INFO L133 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2019-01-14 02:19:02,226 INFO L133 SettingsManager]: * Use old map elimination=false [2019-01-14 02:19:02,227 INFO L133 SettingsManager]: * Use external solver (rank synthesis)=false [2019-01-14 02:19:02,227 INFO L133 SettingsManager]: * Use only trivial implications for array writes=true [2019-01-14 02:19:02,227 INFO L133 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2019-01-14 02:19:02,227 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-01-14 02:19:02,227 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2019-01-14 02:19:02,227 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2019-01-14 02:19:02,228 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2019-01-14 02:19:02,228 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2019-01-14 02:19:02,228 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2019-01-14 02:19:02,228 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2019-01-14 02:19:02,228 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2019-01-14 02:19:02,228 INFO L133 SettingsManager]: * Assume nondeterminstic values are in range=false [2019-01-14 02:19:02,229 INFO L133 SettingsManager]: * Use constant arrays=true [2019-01-14 02:19:02,231 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2019-01-14 02:19:02,232 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-01-14 02:19:02,232 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-01-14 02:19:02,232 INFO L133 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2019-01-14 02:19:02,232 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-01-14 02:19:02,232 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2019-01-14 02:19:02,233 INFO L133 SettingsManager]: * Dump automata to the following directory=/home/matthias/ultimate/dump/auto [2019-01-14 02:19:02,238 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2019-01-14 02:19:02,238 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 -> aae625cda61f26fa063b78c3d3a58aff5ded8a89 [2019-01-14 02:19:02,294 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-01-14 02:19:02,310 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-01-14 02:19:02,315 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-01-14 02:19:02,317 INFO L271 PluginConnector]: Initializing CDTParser... [2019-01-14 02:19:02,318 INFO L276 PluginConnector]: CDTParser initialized [2019-01-14 02:19:02,319 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/svcomp/c/termination-restricted-15/GCD3_true-termination_true-no-overflow.c [2019-01-14 02:19:02,378 INFO L221 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c3d4cf4b6/a97cab93670d4aa6ad8d61b284186949/FLAGf2165f1cb [2019-01-14 02:19:02,774 INFO L307 CDTParser]: Found 1 translation units. [2019-01-14 02:19:02,774 INFO L161 CDTParser]: Scanning /storage/repos/svcomp/c/termination-restricted-15/GCD3_true-termination_true-no-overflow.c [2019-01-14 02:19:02,779 INFO L355 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c3d4cf4b6/a97cab93670d4aa6ad8d61b284186949/FLAGf2165f1cb [2019-01-14 02:19:03,166 INFO L363 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c3d4cf4b6/a97cab93670d4aa6ad8d61b284186949 [2019-01-14 02:19:03,170 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-01-14 02:19:03,171 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-01-14 02:19:03,172 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-01-14 02:19:03,172 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-01-14 02:19:03,176 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2019-01-14 02:19:03,176 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.01 02:19:03" (1/1) ... [2019-01-14 02:19:03,180 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@53307116 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 02:19:03, skipping insertion in model container [2019-01-14 02:19:03,180 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.01 02:19:03" (1/1) ... [2019-01-14 02:19:03,189 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-01-14 02:19:03,207 INFO L176 MainTranslator]: Built tables and reachable declarations [2019-01-14 02:19:03,428 INFO L208 PostProcessor]: Analyzing one entry point: main [2019-01-14 02:19:03,433 INFO L191 MainTranslator]: Completed pre-run [2019-01-14 02:19:03,451 INFO L208 PostProcessor]: Analyzing one entry point: main [2019-01-14 02:19:03,465 INFO L195 MainTranslator]: Completed translation [2019-01-14 02:19:03,466 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 02:19:03 WrapperNode [2019-01-14 02:19:03,466 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-01-14 02:19:03,467 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-01-14 02:19:03,467 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-01-14 02:19:03,467 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2019-01-14 02:19:03,476 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 02:19:03" (1/1) ... [2019-01-14 02:19:03,482 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 02:19:03" (1/1) ... [2019-01-14 02:19:03,502 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-01-14 02:19:03,502 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-01-14 02:19:03,502 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-01-14 02:19:03,502 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2019-01-14 02:19:03,510 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 02:19:03" (1/1) ... [2019-01-14 02:19:03,510 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 02:19:03" (1/1) ... [2019-01-14 02:19:03,511 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 02:19:03" (1/1) ... [2019-01-14 02:19:03,511 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 02:19:03" (1/1) ... [2019-01-14 02:19:03,513 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 02:19:03" (1/1) ... [2019-01-14 02:19:03,519 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 02:19:03" (1/1) ... [2019-01-14 02:19:03,519 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 02:19:03" (1/1) ... [2019-01-14 02:19:03,521 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-01-14 02:19:03,521 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-01-14 02:19:03,521 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-01-14 02:19:03,521 INFO L276 PluginConnector]: RCFGBuilder initialized [2019-01-14 02:19:03,522 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 02:19:03" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-14 02:19:03,644 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-01-14 02:19:03,644 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-01-14 02:19:03,946 INFO L281 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-01-14 02:19:03,947 INFO L286 CfgBuilder]: Removed 7 assue(true) statements. [2019-01-14 02:19:03,948 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.01 02:19:03 BoogieIcfgContainer [2019-01-14 02:19:03,949 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-01-14 02:19:03,950 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2019-01-14 02:19:03,950 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2019-01-14 02:19:03,955 INFO L276 PluginConnector]: BuchiAutomizer initialized [2019-01-14 02:19:03,956 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-01-14 02:19:03,956 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 14.01 02:19:03" (1/3) ... [2019-01-14 02:19:03,958 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@247f505c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 14.01 02:19:03, skipping insertion in model container [2019-01-14 02:19:03,958 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-01-14 02:19:03,958 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 02:19:03" (2/3) ... [2019-01-14 02:19:03,959 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@247f505c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 14.01 02:19:03, skipping insertion in model container [2019-01-14 02:19:03,959 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-01-14 02:19:03,959 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.01 02:19:03" (3/3) ... [2019-01-14 02:19:03,965 INFO L375 chiAutomizerObserver]: Analyzing ICFG GCD3_true-termination_true-no-overflow.c [2019-01-14 02:19:04,021 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2019-01-14 02:19:04,022 INFO L374 BuchiCegarLoop]: Interprodecural is true [2019-01-14 02:19:04,022 INFO L375 BuchiCegarLoop]: Hoare is false [2019-01-14 02:19:04,022 INFO L376 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2019-01-14 02:19:04,022 INFO L377 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2019-01-14 02:19:04,023 INFO L378 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-01-14 02:19:04,023 INFO L379 BuchiCegarLoop]: Difference is false [2019-01-14 02:19:04,023 INFO L380 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-01-14 02:19:04,023 INFO L383 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2019-01-14 02:19:04,038 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 14 states. [2019-01-14 02:19:04,061 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 9 [2019-01-14 02:19:04,061 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-14 02:19:04,061 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-14 02:19:04,068 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [1] [2019-01-14 02:19:04,068 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1] [2019-01-14 02:19:04,068 INFO L442 BuchiCegarLoop]: ======== Iteration 1============ [2019-01-14 02:19:04,069 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 14 states. [2019-01-14 02:19:04,072 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 9 [2019-01-14 02:19:04,073 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-14 02:19:04,073 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-14 02:19:04,073 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [1] [2019-01-14 02:19:04,073 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1] [2019-01-14 02:19:04,082 INFO L794 eck$LassoCheckResult]: Stem: 10#ULTIMATE.startENTRYtrue havoc main_#res;havoc main_#t~nondet0, main_#t~nondet1, main_~x~0, main_~y~0, main_~tmp~0, main_~xtmp~0;havoc main_~x~0;havoc main_~y~0;havoc main_~tmp~0;havoc main_~xtmp~0;main_~x~0 := main_#t~nondet0;havoc main_#t~nondet0;main_~y~0 := main_#t~nondet1;havoc main_#t~nondet1; 11#L13-2true [2019-01-14 02:19:04,083 INFO L796 eck$LassoCheckResult]: Loop: 11#L13-2true assume !!(main_~y~0 > 0 && main_~x~0 > 0);main_~tmp~0 := main_~y~0;main_~xtmp~0 := main_~x~0; 3#L17true assume 0 == main_~y~0;main_~y~0 := main_~y~0; 7#L21-2true assume !(main_~xtmp~0 > 0); 5#L31-2true assume !true; 4#L31-3true main_~y~0 := main_~xtmp~0; 15#L25-1true main_~x~0 := main_~tmp~0; 11#L13-2true [2019-01-14 02:19:04,091 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 02:19:04,091 INFO L82 PathProgramCache]: Analyzing trace with hash 32, now seen corresponding path program 1 times [2019-01-14 02:19:04,093 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 02:19:04,094 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 02:19:04,145 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:19:04,145 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 02:19:04,145 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:19:04,164 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 02:19:04,168 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 02:19:04,185 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 02:19:04,185 INFO L82 PathProgramCache]: Analyzing trace with hash 1187012529, now seen corresponding path program 1 times [2019-01-14 02:19:04,185 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 02:19:04,185 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 02:19:04,187 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:19:04,187 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 02:19:04,188 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:19:04,196 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 02:19:04,278 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 02:19:04,282 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-14 02:19:04,282 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-01-14 02:19:04,288 INFO L811 eck$LassoCheckResult]: loop already infeasible [2019-01-14 02:19:04,300 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-14 02:19:04,301 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-14 02:19:04,303 INFO L87 Difference]: Start difference. First operand 14 states. Second operand 3 states. [2019-01-14 02:19:04,363 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 02:19:04,363 INFO L93 Difference]: Finished difference Result 14 states and 17 transitions. [2019-01-14 02:19:04,364 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-14 02:19:04,368 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 14 states and 17 transitions. [2019-01-14 02:19:04,371 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 9 [2019-01-14 02:19:04,375 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 14 states to 10 states and 13 transitions. [2019-01-14 02:19:04,376 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 10 [2019-01-14 02:19:04,376 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 10 [2019-01-14 02:19:04,377 INFO L73 IsDeterministic]: Start isDeterministic. Operand 10 states and 13 transitions. [2019-01-14 02:19:04,378 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-01-14 02:19:04,378 INFO L706 BuchiCegarLoop]: Abstraction has 10 states and 13 transitions. [2019-01-14 02:19:04,396 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10 states and 13 transitions. [2019-01-14 02:19:04,406 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10 to 10. [2019-01-14 02:19:04,407 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2019-01-14 02:19:04,407 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 13 transitions. [2019-01-14 02:19:04,409 INFO L729 BuchiCegarLoop]: Abstraction has 10 states and 13 transitions. [2019-01-14 02:19:04,409 INFO L609 BuchiCegarLoop]: Abstraction has 10 states and 13 transitions. [2019-01-14 02:19:04,409 INFO L442 BuchiCegarLoop]: ======== Iteration 2============ [2019-01-14 02:19:04,409 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 10 states and 13 transitions. [2019-01-14 02:19:04,410 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 9 [2019-01-14 02:19:04,410 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-14 02:19:04,410 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-14 02:19:04,411 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [1] [2019-01-14 02:19:04,412 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1] [2019-01-14 02:19:04,412 INFO L794 eck$LassoCheckResult]: Stem: 39#ULTIMATE.startENTRY havoc main_#res;havoc main_#t~nondet0, main_#t~nondet1, main_~x~0, main_~y~0, main_~tmp~0, main_~xtmp~0;havoc main_~x~0;havoc main_~y~0;havoc main_~tmp~0;havoc main_~xtmp~0;main_~x~0 := main_#t~nondet0;havoc main_#t~nondet0;main_~y~0 := main_#t~nondet1;havoc main_#t~nondet1; 40#L13-2 [2019-01-14 02:19:04,412 INFO L796 eck$LassoCheckResult]: Loop: 40#L13-2 assume !!(main_~y~0 > 0 && main_~x~0 > 0);main_~tmp~0 := main_~y~0;main_~xtmp~0 := main_~x~0; 41#L17 assume !(0 == main_~y~0); 37#L21 assume !(main_~y~0 < 0); 38#L21-2 assume !(main_~xtmp~0 > 0); 45#L31-2 assume !(main_~xtmp~0 < 0); 42#L31-3 main_~y~0 := main_~xtmp~0; 43#L25-1 main_~x~0 := main_~tmp~0; 40#L13-2 [2019-01-14 02:19:04,412 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 02:19:04,413 INFO L82 PathProgramCache]: Analyzing trace with hash 32, now seen corresponding path program 2 times [2019-01-14 02:19:04,413 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 02:19:04,413 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 02:19:04,415 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:19:04,415 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 02:19:04,415 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:19:04,417 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 02:19:04,419 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 02:19:04,420 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 02:19:04,420 INFO L82 PathProgramCache]: Analyzing trace with hash -1817939337, now seen corresponding path program 1 times [2019-01-14 02:19:04,420 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 02:19:04,421 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 02:19:04,422 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:19:04,422 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-14 02:19:04,422 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:19:04,428 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 02:19:04,491 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 02:19:04,491 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-14 02:19:04,491 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-01-14 02:19:04,492 INFO L811 eck$LassoCheckResult]: loop already infeasible [2019-01-14 02:19:04,492 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-14 02:19:04,492 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-14 02:19:04,492 INFO L87 Difference]: Start difference. First operand 10 states and 13 transitions. cyclomatic complexity: 4 Second operand 3 states. [2019-01-14 02:19:04,606 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 02:19:04,607 INFO L93 Difference]: Finished difference Result 12 states and 14 transitions. [2019-01-14 02:19:04,607 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-14 02:19:04,609 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 12 states and 14 transitions. [2019-01-14 02:19:04,610 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 11 [2019-01-14 02:19:04,610 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 12 states to 12 states and 14 transitions. [2019-01-14 02:19:04,610 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 12 [2019-01-14 02:19:04,611 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 12 [2019-01-14 02:19:04,611 INFO L73 IsDeterministic]: Start isDeterministic. Operand 12 states and 14 transitions. [2019-01-14 02:19:04,612 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-01-14 02:19:04,612 INFO L706 BuchiCegarLoop]: Abstraction has 12 states and 14 transitions. [2019-01-14 02:19:04,612 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12 states and 14 transitions. [2019-01-14 02:19:04,613 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12 to 8. [2019-01-14 02:19:04,613 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2019-01-14 02:19:04,614 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 9 transitions. [2019-01-14 02:19:04,615 INFO L729 BuchiCegarLoop]: Abstraction has 8 states and 9 transitions. [2019-01-14 02:19:04,615 INFO L609 BuchiCegarLoop]: Abstraction has 8 states and 9 transitions. [2019-01-14 02:19:04,615 INFO L442 BuchiCegarLoop]: ======== Iteration 3============ [2019-01-14 02:19:04,615 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 8 states and 9 transitions. [2019-01-14 02:19:04,616 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 7 [2019-01-14 02:19:04,616 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-14 02:19:04,616 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-14 02:19:04,617 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [1] [2019-01-14 02:19:04,618 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1] [2019-01-14 02:19:04,618 INFO L794 eck$LassoCheckResult]: Stem: 67#ULTIMATE.startENTRY havoc main_#res;havoc main_#t~nondet0, main_#t~nondet1, main_~x~0, main_~y~0, main_~tmp~0, main_~xtmp~0;havoc main_~x~0;havoc main_~y~0;havoc main_~tmp~0;havoc main_~xtmp~0;main_~x~0 := main_#t~nondet0;havoc main_#t~nondet0;main_~y~0 := main_#t~nondet1;havoc main_#t~nondet1; 68#L13-2 [2019-01-14 02:19:04,618 INFO L796 eck$LassoCheckResult]: Loop: 68#L13-2 assume !!(main_~y~0 > 0 && main_~x~0 > 0);main_~tmp~0 := main_~y~0;main_~xtmp~0 := main_~x~0; 69#L17 assume !(0 == main_~y~0); 65#L21 assume !(main_~y~0 < 0); 66#L21-2 assume main_~xtmp~0 > 0; 72#L26-2 assume !(main_~xtmp~0 >= main_~y~0); 70#L26-3 main_~y~0 := main_~xtmp~0; 71#L25-1 main_~x~0 := main_~tmp~0; 68#L13-2 [2019-01-14 02:19:04,618 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 02:19:04,619 INFO L82 PathProgramCache]: Analyzing trace with hash 32, now seen corresponding path program 3 times [2019-01-14 02:19:04,620 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 02:19:04,620 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 02:19:04,622 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:19:04,622 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 02:19:04,622 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:19:04,625 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 02:19:04,627 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 02:19:04,628 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 02:19:04,628 INFO L82 PathProgramCache]: Analyzing trace with hash -1818401082, now seen corresponding path program 1 times [2019-01-14 02:19:04,628 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 02:19:04,628 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 02:19:04,631 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:19:04,631 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-14 02:19:04,631 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:19:04,637 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 02:19:04,643 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 02:19:04,645 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 02:19:04,646 INFO L82 PathProgramCache]: Analyzing trace with hash 669111751, now seen corresponding path program 1 times [2019-01-14 02:19:04,646 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 02:19:04,646 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 02:19:04,648 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:19:04,648 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 02:19:04,648 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:19:04,654 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 02:19:04,661 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 02:19:04,820 WARN L181 SmtUtils]: Spent 149.00 ms on a formula simplification. DAG size of input: 21 DAG size of output: 15 [2019-01-14 02:19:04,937 WARN L181 SmtUtils]: Spent 116.00 ms on a formula simplification that was a NOOP. DAG size: 15 [2019-01-14 02:19:04,958 INFO L216 LassoAnalysis]: Preferences: [2019-01-14 02:19:04,960 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-01-14 02:19:04,960 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-01-14 02:19:04,960 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-01-14 02:19:04,960 INFO L127 ssoRankerPreferences]: Use exernal solver: true [2019-01-14 02:19:04,960 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-14 02:19:04,960 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-01-14 02:19:04,961 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-01-14 02:19:04,961 INFO L131 ssoRankerPreferences]: Filename of dumped script: GCD3_true-termination_true-no-overflow.c_Iteration3_Loop [2019-01-14 02:19:04,961 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-01-14 02:19:04,962 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2019-01-14 02:19:04,986 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:19:05,010 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:19:05,014 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:19:05,171 WARN L181 SmtUtils]: Spent 153.00 ms on a formula simplification that was a NOOP. DAG size: 14 [2019-01-14 02:19:05,342 INFO L300 LassoAnalysis]: Preprocessing complete. [2019-01-14 02:19:05,343 INFO L412 LassoAnalysis]: Checking for nontermination... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-14 02:19:05,348 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-14 02:19:05,348 INFO L163 nArgumentSynthesizer]: Using integer mode. [2019-01-14 02:19:05,373 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2019-01-14 02:19:05,374 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {v_rep~unnamed0~0~true_1=1} Honda state: {v_rep~unnamed0~0~true_1=1} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-14 02:19:05,380 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-14 02:19:05,381 INFO L163 nArgumentSynthesizer]: Using integer mode. [2019-01-14 02:19:05,402 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2019-01-14 02:19:05,402 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {v_rep~unnamed0~0~false_1=0} Honda state: {v_rep~unnamed0~0~false_1=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-14 02:19:05,406 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-14 02:19:05,406 INFO L163 nArgumentSynthesizer]: Using integer mode. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-14 02:19:05,439 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2019-01-14 02:19:05,439 INFO L163 nArgumentSynthesizer]: Using integer mode. [2019-01-14 02:19:10,473 INFO L452 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2019-01-14 02:19:10,475 INFO L216 LassoAnalysis]: Preferences: [2019-01-14 02:19:10,476 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-01-14 02:19:10,476 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-01-14 02:19:10,476 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-01-14 02:19:10,476 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2019-01-14 02:19:10,476 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-14 02:19:10,476 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-01-14 02:19:10,477 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-01-14 02:19:10,477 INFO L131 ssoRankerPreferences]: Filename of dumped script: GCD3_true-termination_true-no-overflow.c_Iteration3_Loop [2019-01-14 02:19:10,477 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-01-14 02:19:10,477 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2019-01-14 02:19:10,481 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:19:10,486 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:19:10,493 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:19:10,605 WARN L181 SmtUtils]: Spent 105.00 ms on a formula simplification that was a NOOP. DAG size: 14 [2019-01-14 02:19:10,696 INFO L300 LassoAnalysis]: Preprocessing complete. [2019-01-14 02:19:10,701 INFO L497 LassoAnalysis]: Using template 'affine'. [2019-01-14 02:19:10,703 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 02:19:10,705 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:19:10,705 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:19:10,705 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:19:10,705 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:19:10,709 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-14 02:19:10,710 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-14 02:19:10,718 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:19:10,719 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 02:19:10,720 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:19:10,720 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:19:10,720 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:19:10,720 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:19:10,728 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-14 02:19:10,728 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-14 02:19:10,744 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:19:10,745 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 02:19:10,746 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:19:10,746 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 02:19:10,746 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:19:10,747 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:19:10,747 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:19:10,750 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 02:19:10,752 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 02:19:10,781 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-01-14 02:19:10,799 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2019-01-14 02:19:10,799 INFO L444 ModelExtractionUtils]: 3 out of 6 variables were initially zero. Simplification set additionally 1 variables to zero. [2019-01-14 02:19:10,802 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-01-14 02:19:10,803 INFO L440 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2019-01-14 02:19:10,803 INFO L518 LassoAnalysis]: Proved termination. [2019-01-14 02:19:10,804 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~y~0) = 1*ULTIMATE.start_main_~y~0 Supporting invariants [] [2019-01-14 02:19:10,806 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2019-01-14 02:19:10,890 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 02:19:10,899 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 02:19:10,901 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 02:19:10,914 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 02:19:10,916 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 02:19:11,344 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 02:19:11,348 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 4 loop predicates [2019-01-14 02:19:11,350 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 8 states and 9 transitions. cyclomatic complexity: 2 Second operand 6 states. [2019-01-14 02:19:11,510 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 8 states and 9 transitions. cyclomatic complexity: 2. Second operand 6 states. Result 27 states and 32 transitions. Complement of second has 9 states. [2019-01-14 02:19:11,511 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 5 states 1 stem states 3 non-accepting loop states 1 accepting loop states [2019-01-14 02:19:11,511 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2019-01-14 02:19:11,512 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 12 transitions. [2019-01-14 02:19:11,513 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 12 transitions. Stem has 1 letters. Loop has 7 letters. [2019-01-14 02:19:11,516 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-14 02:19:11,517 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 12 transitions. Stem has 8 letters. Loop has 7 letters. [2019-01-14 02:19:11,517 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-14 02:19:11,517 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 12 transitions. Stem has 1 letters. Loop has 14 letters. [2019-01-14 02:19:11,518 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-14 02:19:11,518 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 27 states and 32 transitions. [2019-01-14 02:19:11,520 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 8 [2019-01-14 02:19:11,521 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 27 states to 24 states and 28 transitions. [2019-01-14 02:19:11,522 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 15 [2019-01-14 02:19:11,522 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 17 [2019-01-14 02:19:11,522 INFO L73 IsDeterministic]: Start isDeterministic. Operand 24 states and 28 transitions. [2019-01-14 02:19:11,522 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-01-14 02:19:11,522 INFO L706 BuchiCegarLoop]: Abstraction has 24 states and 28 transitions. [2019-01-14 02:19:11,523 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states and 28 transitions. [2019-01-14 02:19:11,526 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 21. [2019-01-14 02:19:11,526 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2019-01-14 02:19:11,527 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 24 transitions. [2019-01-14 02:19:11,527 INFO L729 BuchiCegarLoop]: Abstraction has 21 states and 24 transitions. [2019-01-14 02:19:11,527 INFO L609 BuchiCegarLoop]: Abstraction has 21 states and 24 transitions. [2019-01-14 02:19:11,527 INFO L442 BuchiCegarLoop]: ======== Iteration 4============ [2019-01-14 02:19:11,527 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 21 states and 24 transitions. [2019-01-14 02:19:11,529 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 7 [2019-01-14 02:19:11,530 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-14 02:19:11,530 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-14 02:19:11,531 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1] [2019-01-14 02:19:11,531 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1] [2019-01-14 02:19:11,531 INFO L794 eck$LassoCheckResult]: Stem: 158#ULTIMATE.startENTRY havoc main_#res;havoc main_#t~nondet0, main_#t~nondet1, main_~x~0, main_~y~0, main_~tmp~0, main_~xtmp~0;havoc main_~x~0;havoc main_~y~0;havoc main_~tmp~0;havoc main_~xtmp~0;main_~x~0 := main_#t~nondet0;havoc main_#t~nondet0;main_~y~0 := main_#t~nondet1;havoc main_#t~nondet1; 159#L13-2 assume !!(main_~y~0 > 0 && main_~x~0 > 0);main_~tmp~0 := main_~y~0;main_~xtmp~0 := main_~x~0; 161#L17 assume !(0 == main_~y~0); 174#L21 assume !(main_~y~0 < 0); 173#L21-2 assume main_~xtmp~0 > 0; 169#L26-2 assume !!(main_~xtmp~0 >= main_~y~0);main_~xtmp~0 := main_~xtmp~0 - main_~y~0; 170#L26-2 [2019-01-14 02:19:11,532 INFO L796 eck$LassoCheckResult]: Loop: 170#L26-2 assume !!(main_~xtmp~0 >= main_~y~0);main_~xtmp~0 := main_~xtmp~0 - main_~y~0; 170#L26-2 [2019-01-14 02:19:11,532 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 02:19:11,532 INFO L82 PathProgramCache]: Analyzing trace with hash 925834904, now seen corresponding path program 1 times [2019-01-14 02:19:11,532 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 02:19:11,532 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 02:19:11,534 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:19:11,534 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 02:19:11,534 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:19:11,540 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 02:19:11,544 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 02:19:11,547 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 02:19:11,547 INFO L82 PathProgramCache]: Analyzing trace with hash 64, now seen corresponding path program 1 times [2019-01-14 02:19:11,547 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 02:19:11,548 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 02:19:11,549 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:19:11,549 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 02:19:11,549 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:19:11,552 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 02:19:11,553 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 02:19:11,554 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 02:19:11,554 INFO L82 PathProgramCache]: Analyzing trace with hash -1363889015, now seen corresponding path program 2 times [2019-01-14 02:19:11,554 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 02:19:11,554 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 02:19:11,557 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:19:11,557 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 02:19:11,557 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:19:11,561 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 02:19:11,567 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 02:19:11,749 WARN L181 SmtUtils]: Spent 121.00 ms on a formula simplification. DAG size of input: 25 DAG size of output: 19 [2019-01-14 02:19:11,768 INFO L216 LassoAnalysis]: Preferences: [2019-01-14 02:19:11,769 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-01-14 02:19:11,769 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-01-14 02:19:11,769 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-01-14 02:19:11,769 INFO L127 ssoRankerPreferences]: Use exernal solver: true [2019-01-14 02:19:11,770 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-14 02:19:11,770 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-01-14 02:19:11,770 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-01-14 02:19:11,770 INFO L131 ssoRankerPreferences]: Filename of dumped script: GCD3_true-termination_true-no-overflow.c_Iteration4_Lasso [2019-01-14 02:19:11,771 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-01-14 02:19:11,771 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2019-01-14 02:19:11,773 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:19:11,779 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:19:11,782 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:19:11,847 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:19:11,856 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:19:11,858 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:19:11,991 INFO L300 LassoAnalysis]: Preprocessing complete. [2019-01-14 02:19:11,992 INFO L412 LassoAnalysis]: Checking for nontermination... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 6 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-14 02:19:11,998 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-14 02:19:11,999 INFO L163 nArgumentSynthesizer]: Using integer mode. [2019-01-14 02:19:12,022 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2019-01-14 02:19:12,022 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {v_rep~unnamed0~0~false_3=0} Honda state: {v_rep~unnamed0~0~false_3=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 7 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-14 02:19:12,027 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-14 02:19:12,028 INFO L163 nArgumentSynthesizer]: Using integer mode. [2019-01-14 02:19:12,030 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2019-01-14 02:19:12,030 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_main_#t~nondet0=0} Honda state: {ULTIMATE.start_main_#t~nondet0=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-14 02:19:12,053 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-14 02:19:12,053 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-14 02:19:12,092 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2019-01-14 02:19:12,092 INFO L163 nArgumentSynthesizer]: Using integer mode. [2019-01-14 02:19:12,243 INFO L452 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2019-01-14 02:19:12,246 INFO L216 LassoAnalysis]: Preferences: [2019-01-14 02:19:12,246 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-01-14 02:19:12,246 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-01-14 02:19:12,246 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-01-14 02:19:12,246 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2019-01-14 02:19:12,246 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-14 02:19:12,247 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-01-14 02:19:12,247 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-01-14 02:19:12,247 INFO L131 ssoRankerPreferences]: Filename of dumped script: GCD3_true-termination_true-no-overflow.c_Iteration4_Lasso [2019-01-14 02:19:12,247 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-01-14 02:19:12,247 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2019-01-14 02:19:12,252 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:19:12,264 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:19:12,288 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:19:12,293 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:19:12,307 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:19:12,308 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:19:12,421 INFO L300 LassoAnalysis]: Preprocessing complete. [2019-01-14 02:19:12,422 INFO L497 LassoAnalysis]: Using template 'affine'. [2019-01-14 02:19:12,422 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 02:19:12,423 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:19:12,423 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:19:12,423 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:19:12,423 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:19:12,425 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-14 02:19:12,425 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-14 02:19:12,428 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:19:12,429 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 02:19:12,430 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:19:12,430 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:19:12,430 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:19:12,430 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:19:12,435 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-14 02:19:12,435 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-14 02:19:12,454 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-01-14 02:19:12,469 INFO L443 ModelExtractionUtils]: Simplification made 4 calls to the SMT solver. [2019-01-14 02:19:12,469 INFO L444 ModelExtractionUtils]: 10 out of 16 variables were initially zero. Simplification set additionally 0 variables to zero. [2019-01-14 02:19:12,470 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-01-14 02:19:12,473 INFO L440 nArgumentSynthesizer]: Removed 1 redundant supporting invariants from a total of 2. [2019-01-14 02:19:12,473 INFO L518 LassoAnalysis]: Proved termination. [2019-01-14 02:19:12,473 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~y~0, ULTIMATE.start_main_~xtmp~0) = -2*ULTIMATE.start_main_~y~0 + 2*ULTIMATE.start_main_~xtmp~0 + 1 Supporting invariants [1*ULTIMATE.start_main_~y~0 - 1 >= 0] [2019-01-14 02:19:12,490 INFO L297 tatePredicateManager]: 0 out of 1 supporting invariants were superfluous and have been removed [2019-01-14 02:19:12,716 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 02:19:12,725 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 02:19:12,727 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 02:19:12,743 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 02:19:12,744 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 02:19:12,745 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 02:19:12,745 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.2 stem predicates 1 loop predicates [2019-01-14 02:19:12,745 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 21 states and 24 transitions. cyclomatic complexity: 5 Second operand 3 states. [2019-01-14 02:19:12,836 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 21 states and 24 transitions. cyclomatic complexity: 5. Second operand 3 states. Result 25 states and 31 transitions. Complement of second has 6 states. [2019-01-14 02:19:12,837 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 2 stem states 1 non-accepting loop states 1 accepting loop states [2019-01-14 02:19:12,838 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2019-01-14 02:19:12,838 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 11 transitions. [2019-01-14 02:19:12,839 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 11 transitions. Stem has 6 letters. Loop has 1 letters. [2019-01-14 02:19:12,839 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-14 02:19:12,839 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 11 transitions. Stem has 7 letters. Loop has 1 letters. [2019-01-14 02:19:12,839 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-14 02:19:12,839 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 11 transitions. Stem has 6 letters. Loop has 2 letters. [2019-01-14 02:19:12,839 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-14 02:19:12,840 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 25 states and 31 transitions. [2019-01-14 02:19:12,841 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 7 [2019-01-14 02:19:12,843 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 25 states to 24 states and 29 transitions. [2019-01-14 02:19:12,843 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 15 [2019-01-14 02:19:12,844 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 16 [2019-01-14 02:19:12,845 INFO L73 IsDeterministic]: Start isDeterministic. Operand 24 states and 29 transitions. [2019-01-14 02:19:12,845 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-01-14 02:19:12,845 INFO L706 BuchiCegarLoop]: Abstraction has 24 states and 29 transitions. [2019-01-14 02:19:12,845 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states and 29 transitions. [2019-01-14 02:19:12,849 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 23. [2019-01-14 02:19:12,849 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23 states. [2019-01-14 02:19:12,850 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 28 transitions. [2019-01-14 02:19:12,850 INFO L729 BuchiCegarLoop]: Abstraction has 23 states and 28 transitions. [2019-01-14 02:19:12,850 INFO L609 BuchiCegarLoop]: Abstraction has 23 states and 28 transitions. [2019-01-14 02:19:12,850 INFO L442 BuchiCegarLoop]: ======== Iteration 5============ [2019-01-14 02:19:12,850 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 23 states and 28 transitions. [2019-01-14 02:19:12,851 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 7 [2019-01-14 02:19:12,851 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-14 02:19:12,851 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-14 02:19:12,853 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1] [2019-01-14 02:19:12,853 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1] [2019-01-14 02:19:12,853 INFO L794 eck$LassoCheckResult]: Stem: 256#ULTIMATE.startENTRY havoc main_#res;havoc main_#t~nondet0, main_#t~nondet1, main_~x~0, main_~y~0, main_~tmp~0, main_~xtmp~0;havoc main_~x~0;havoc main_~y~0;havoc main_~tmp~0;havoc main_~xtmp~0;main_~x~0 := main_#t~nondet0;havoc main_#t~nondet0;main_~y~0 := main_#t~nondet1;havoc main_#t~nondet1; 257#L13-2 assume !!(main_~y~0 > 0 && main_~x~0 > 0);main_~tmp~0 := main_~y~0;main_~xtmp~0 := main_~x~0; 271#L17 assume !(0 == main_~y~0); 274#L21 assume !(main_~y~0 < 0); 273#L21-2 assume main_~xtmp~0 > 0; 272#L26-2 assume !!(main_~xtmp~0 >= main_~y~0);main_~xtmp~0 := main_~xtmp~0 - main_~y~0; 270#L26-2 assume !(main_~xtmp~0 >= main_~y~0); 262#L26-3 [2019-01-14 02:19:12,853 INFO L796 eck$LassoCheckResult]: Loop: 262#L26-3 main_~y~0 := main_~xtmp~0; 263#L25-1 main_~x~0 := main_~tmp~0; 258#L13-2 assume !!(main_~y~0 > 0 && main_~x~0 > 0);main_~tmp~0 := main_~y~0;main_~xtmp~0 := main_~x~0; 259#L17 assume !(0 == main_~y~0); 252#L21 assume !(main_~y~0 < 0); 253#L21-2 assume main_~xtmp~0 > 0; 266#L26-2 assume !(main_~xtmp~0 >= main_~y~0); 262#L26-3 [2019-01-14 02:19:12,853 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 02:19:12,854 INFO L82 PathProgramCache]: Analyzing trace with hash -1363889017, now seen corresponding path program 1 times [2019-01-14 02:19:12,854 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 02:19:12,854 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 02:19:12,855 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:19:12,855 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-14 02:19:12,856 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:19:12,860 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 02:19:12,864 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 02:19:12,866 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 02:19:12,867 INFO L82 PathProgramCache]: Analyzing trace with hash 1776384388, now seen corresponding path program 2 times [2019-01-14 02:19:12,867 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 02:19:12,867 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 02:19:12,868 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:19:12,868 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 02:19:12,868 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:19:12,873 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 02:19:12,876 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 02:19:12,878 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 02:19:12,878 INFO L82 PathProgramCache]: Analyzing trace with hash 1008190014, now seen corresponding path program 1 times [2019-01-14 02:19:12,879 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 02:19:12,879 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 02:19:12,881 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:19:12,881 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-14 02:19:12,881 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:19:12,890 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 02:19:13,107 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 1 proven. 5 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-01-14 02:19:13,107 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-14 02:19:13,107 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-14 02:19:13,118 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 02:19:13,127 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 02:19:13,128 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 02:19:13,142 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 1 proven. 5 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-01-14 02:19:13,164 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-14 02:19:13,164 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 7 [2019-01-14 02:19:13,216 INFO L216 LassoAnalysis]: Preferences: [2019-01-14 02:19:13,217 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-01-14 02:19:13,217 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-01-14 02:19:13,217 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-01-14 02:19:13,217 INFO L127 ssoRankerPreferences]: Use exernal solver: true [2019-01-14 02:19:13,218 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-14 02:19:13,218 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-01-14 02:19:13,218 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-01-14 02:19:13,218 INFO L131 ssoRankerPreferences]: Filename of dumped script: GCD3_true-termination_true-no-overflow.c_Iteration5_Loop [2019-01-14 02:19:13,219 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-01-14 02:19:13,219 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2019-01-14 02:19:13,221 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:19:13,225 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:19:13,267 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:19:13,383 INFO L300 LassoAnalysis]: Preprocessing complete. [2019-01-14 02:19:13,384 INFO L412 LassoAnalysis]: Checking for nontermination... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 11 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 11 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-14 02:19:13,390 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-14 02:19:13,390 INFO L163 nArgumentSynthesizer]: Using integer mode. [2019-01-14 02:19:13,411 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2019-01-14 02:19:13,411 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {v_rep~unnamed0~0~true_5=1} Honda state: {v_rep~unnamed0~0~true_5=1} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 12 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-01-14 02:19:13,422 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-14 02:19:13,422 INFO L163 nArgumentSynthesizer]: Using integer mode. Waiting until toolchain timeout for monitored process 12 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 13 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 13 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-14 02:19:13,457 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2019-01-14 02:19:13,457 INFO L163 nArgumentSynthesizer]: Using integer mode. [2019-01-14 02:19:20,575 INFO L452 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2019-01-14 02:19:20,580 INFO L216 LassoAnalysis]: Preferences: [2019-01-14 02:19:20,580 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-01-14 02:19:20,580 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-01-14 02:19:20,580 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-01-14 02:19:20,580 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2019-01-14 02:19:20,580 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-14 02:19:20,580 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-01-14 02:19:20,580 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-01-14 02:19:20,581 INFO L131 ssoRankerPreferences]: Filename of dumped script: GCD3_true-termination_true-no-overflow.c_Iteration5_Loop [2019-01-14 02:19:20,581 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-01-14 02:19:20,581 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2019-01-14 02:19:20,582 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:19:20,587 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:19:20,604 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:19:20,677 INFO L300 LassoAnalysis]: Preprocessing complete. [2019-01-14 02:19:20,678 INFO L497 LassoAnalysis]: Using template 'affine'. [2019-01-14 02:19:20,679 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 02:19:20,679 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:19:20,680 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:19:20,680 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:19:20,680 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:19:20,682 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-14 02:19:20,682 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-14 02:19:20,686 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:19:20,687 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 02:19:20,688 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:19:20,689 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 02:19:20,690 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:19:20,690 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:19:20,690 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:19:20,692 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 02:19:20,692 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 02:19:20,699 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-01-14 02:19:20,704 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2019-01-14 02:19:20,705 INFO L444 ModelExtractionUtils]: 3 out of 6 variables were initially zero. Simplification set additionally 1 variables to zero. [2019-01-14 02:19:20,705 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-01-14 02:19:20,705 INFO L440 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2019-01-14 02:19:20,705 INFO L518 LassoAnalysis]: Proved termination. [2019-01-14 02:19:20,706 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~xtmp~0) = 1*ULTIMATE.start_main_~xtmp~0 Supporting invariants [] [2019-01-14 02:19:20,707 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2019-01-14 02:19:20,774 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 02:19:20,784 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 02:19:20,785 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 02:19:20,791 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 02:19:20,792 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 02:19:20,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-14 02:19:20,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-14 02:19:20,813 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 23 states and 28 transitions. cyclomatic complexity: 8 Second operand 4 states. [2019-01-14 02:19:20,891 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 23 states and 28 transitions. cyclomatic complexity: 8. Second operand 4 states. Result 58 states and 72 transitions. Complement of second has 8 states. [2019-01-14 02:19:20,893 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 5 states 1 stem states 3 non-accepting loop states 1 accepting loop states [2019-01-14 02:19:20,893 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2019-01-14 02:19:20,894 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 18 transitions. [2019-01-14 02:19:20,894 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 18 transitions. Stem has 7 letters. Loop has 7 letters. [2019-01-14 02:19:20,895 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-14 02:19:20,895 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 18 transitions. Stem has 14 letters. Loop has 7 letters. [2019-01-14 02:19:20,895 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-14 02:19:20,895 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 18 transitions. Stem has 7 letters. Loop has 14 letters. [2019-01-14 02:19:20,896 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-14 02:19:20,896 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 58 states and 72 transitions. [2019-01-14 02:19:20,902 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 8 [2019-01-14 02:19:20,903 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 58 states to 53 states and 67 transitions. [2019-01-14 02:19:20,903 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 23 [2019-01-14 02:19:20,904 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 25 [2019-01-14 02:19:20,904 INFO L73 IsDeterministic]: Start isDeterministic. Operand 53 states and 67 transitions. [2019-01-14 02:19:20,904 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-01-14 02:19:20,904 INFO L706 BuchiCegarLoop]: Abstraction has 53 states and 67 transitions. [2019-01-14 02:19:20,904 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states and 67 transitions. [2019-01-14 02:19:20,909 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 46. [2019-01-14 02:19:20,909 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 46 states. [2019-01-14 02:19:20,911 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 58 transitions. [2019-01-14 02:19:20,911 INFO L729 BuchiCegarLoop]: Abstraction has 46 states and 58 transitions. [2019-01-14 02:19:20,911 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-01-14 02:19:20,912 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2019-01-14 02:19:20,913 INFO L87 Difference]: Start difference. First operand 46 states and 58 transitions. Second operand 8 states. [2019-01-14 02:19:21,136 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 02:19:21,137 INFO L93 Difference]: Finished difference Result 51 states and 60 transitions. [2019-01-14 02:19:21,138 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-01-14 02:19:21,138 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 51 states and 60 transitions. [2019-01-14 02:19:21,141 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 8 [2019-01-14 02:19:21,142 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 51 states to 31 states and 37 transitions. [2019-01-14 02:19:21,142 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 24 [2019-01-14 02:19:21,142 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 29 [2019-01-14 02:19:21,142 INFO L73 IsDeterministic]: Start isDeterministic. Operand 31 states and 37 transitions. [2019-01-14 02:19:21,143 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-01-14 02:19:21,144 INFO L706 BuchiCegarLoop]: Abstraction has 31 states and 37 transitions. [2019-01-14 02:19:21,144 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states and 37 transitions. [2019-01-14 02:19:21,146 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 23. [2019-01-14 02:19:21,147 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23 states. [2019-01-14 02:19:21,147 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 27 transitions. [2019-01-14 02:19:21,147 INFO L729 BuchiCegarLoop]: Abstraction has 23 states and 27 transitions. [2019-01-14 02:19:21,147 INFO L609 BuchiCegarLoop]: Abstraction has 23 states and 27 transitions. [2019-01-14 02:19:21,148 INFO L442 BuchiCegarLoop]: ======== Iteration 6============ [2019-01-14 02:19:21,148 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 23 states and 27 transitions. [2019-01-14 02:19:21,148 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 8 [2019-01-14 02:19:21,149 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-14 02:19:21,150 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-14 02:19:21,150 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1] [2019-01-14 02:19:21,150 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1] [2019-01-14 02:19:21,151 INFO L794 eck$LassoCheckResult]: Stem: 559#ULTIMATE.startENTRY havoc main_#res;havoc main_#t~nondet0, main_#t~nondet1, main_~x~0, main_~y~0, main_~tmp~0, main_~xtmp~0;havoc main_~x~0;havoc main_~y~0;havoc main_~tmp~0;havoc main_~xtmp~0;main_~x~0 := main_#t~nondet0;havoc main_#t~nondet0;main_~y~0 := main_#t~nondet1;havoc main_#t~nondet1; 560#L13-2 assume !!(main_~y~0 > 0 && main_~x~0 > 0);main_~tmp~0 := main_~y~0;main_~xtmp~0 := main_~x~0; 576#L17 assume !(0 == main_~y~0); 575#L21 assume !(main_~y~0 < 0); 574#L21-2 assume main_~xtmp~0 > 0; 573#L26-2 assume !!(main_~xtmp~0 >= main_~y~0);main_~xtmp~0 := main_~xtmp~0 - main_~y~0; 572#L26-2 assume !(main_~xtmp~0 >= main_~y~0); 563#L26-3 [2019-01-14 02:19:21,152 INFO L796 eck$LassoCheckResult]: Loop: 563#L26-3 main_~y~0 := main_~xtmp~0; 564#L25-1 main_~x~0 := main_~tmp~0; 561#L13-2 assume !!(main_~y~0 > 0 && main_~x~0 > 0);main_~tmp~0 := main_~y~0;main_~xtmp~0 := main_~x~0; 562#L17 assume !(0 == main_~y~0); 557#L21 assume !(main_~y~0 < 0); 558#L21-2 assume main_~xtmp~0 > 0; 565#L26-2 assume !!(main_~xtmp~0 >= main_~y~0);main_~xtmp~0 := main_~xtmp~0 - main_~y~0; 566#L26-2 assume !(main_~xtmp~0 >= main_~y~0); 563#L26-3 [2019-01-14 02:19:21,152 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 02:19:21,152 INFO L82 PathProgramCache]: Analyzing trace with hash -1363889017, now seen corresponding path program 2 times [2019-01-14 02:19:21,152 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 02:19:21,152 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 02:19:21,154 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:19:21,154 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 02:19:21,154 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:19:21,157 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 02:19:21,162 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 02:19:21,165 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 02:19:21,165 INFO L82 PathProgramCache]: Analyzing trace with hash -766658727, now seen corresponding path program 1 times [2019-01-14 02:19:21,165 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 02:19:21,165 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 02:19:21,166 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:19:21,166 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-14 02:19:21,167 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:19:21,172 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 02:19:21,178 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 02:19:21,179 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 02:19:21,180 INFO L82 PathProgramCache]: Analyzing trace with hash 1189119455, now seen corresponding path program 2 times [2019-01-14 02:19:21,180 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 02:19:21,180 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 02:19:21,182 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:19:21,182 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 02:19:21,183 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:19:21,189 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 02:19:21,195 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 02:19:21,262 INFO L216 LassoAnalysis]: Preferences: [2019-01-14 02:19:21,262 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-01-14 02:19:21,262 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-01-14 02:19:21,262 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-01-14 02:19:21,262 INFO L127 ssoRankerPreferences]: Use exernal solver: true [2019-01-14 02:19:21,263 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-14 02:19:21,263 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-01-14 02:19:21,263 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-01-14 02:19:21,263 INFO L131 ssoRankerPreferences]: Filename of dumped script: GCD3_true-termination_true-no-overflow.c_Iteration6_Loop [2019-01-14 02:19:21,263 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-01-14 02:19:21,264 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2019-01-14 02:19:21,265 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:19:21,276 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:19:21,279 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:19:21,357 INFO L300 LassoAnalysis]: Preprocessing complete. [2019-01-14 02:19:21,358 INFO L412 LassoAnalysis]: Checking for nontermination... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 14 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 14 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-14 02:19:21,364 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-14 02:19:21,364 INFO L163 nArgumentSynthesizer]: Using integer mode. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 15 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 15 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-14 02:19:21,423 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2019-01-14 02:19:21,424 INFO L163 nArgumentSynthesizer]: Using integer mode. [2019-01-14 02:19:27,963 INFO L452 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2019-01-14 02:19:27,966 INFO L216 LassoAnalysis]: Preferences: [2019-01-14 02:19:27,966 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-01-14 02:19:27,966 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-01-14 02:19:27,966 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-01-14 02:19:27,967 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2019-01-14 02:19:27,967 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-14 02:19:27,967 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-01-14 02:19:27,967 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-01-14 02:19:27,967 INFO L131 ssoRankerPreferences]: Filename of dumped script: GCD3_true-termination_true-no-overflow.c_Iteration6_Loop [2019-01-14 02:19:27,967 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-01-14 02:19:27,967 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2019-01-14 02:19:27,969 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:19:27,993 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:19:27,998 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:19:28,225 WARN L181 SmtUtils]: Spent 192.00 ms on a formula simplification that was a NOOP. DAG size: 18 [2019-01-14 02:19:28,235 INFO L300 LassoAnalysis]: Preprocessing complete. [2019-01-14 02:19:28,236 INFO L497 LassoAnalysis]: Using template 'affine'. [2019-01-14 02:19:28,236 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 02:19:28,238 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:19:28,238 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 02:19:28,238 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:19:28,238 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:19:28,239 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:19:28,240 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 02:19:28,240 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 02:19:28,244 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-01-14 02:19:28,248 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2019-01-14 02:19:28,248 INFO L444 ModelExtractionUtils]: 3 out of 6 variables were initially zero. Simplification set additionally 1 variables to zero. [2019-01-14 02:19:28,248 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-01-14 02:19:28,248 INFO L440 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2019-01-14 02:19:28,249 INFO L518 LassoAnalysis]: Proved termination. [2019-01-14 02:19:28,249 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~xtmp~0) = 1*ULTIMATE.start_main_~xtmp~0 Supporting invariants [] [2019-01-14 02:19:28,249 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2019-01-14 02:19:28,291 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 02:19:28,296 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 02:19:28,297 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 02:19:28,302 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 02:19:28,304 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 02:19:28,361 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-01-14 02:19:28,361 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-14 02:19:28,362 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 23 states and 27 transitions. cyclomatic complexity: 6 Second operand 4 states. [2019-01-14 02:19:28,412 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 23 states and 27 transitions. cyclomatic complexity: 6. Second operand 4 states. Result 45 states and 54 transitions. Complement of second has 6 states. [2019-01-14 02:19:28,413 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-14 02:19:28,413 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2019-01-14 02:19:28,414 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 15 transitions. [2019-01-14 02:19:28,414 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 15 transitions. Stem has 7 letters. Loop has 8 letters. [2019-01-14 02:19:28,415 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-14 02:19:28,415 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 15 transitions. Stem has 15 letters. Loop has 8 letters. [2019-01-14 02:19:28,415 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-14 02:19:28,416 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 15 transitions. Stem has 7 letters. Loop has 16 letters. [2019-01-14 02:19:28,417 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-14 02:19:28,417 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 45 states and 54 transitions. [2019-01-14 02:19:28,419 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 1 [2019-01-14 02:19:28,419 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 45 states to 37 states and 45 transitions. [2019-01-14 02:19:28,419 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 19 [2019-01-14 02:19:28,420 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 20 [2019-01-14 02:19:28,421 INFO L73 IsDeterministic]: Start isDeterministic. Operand 37 states and 45 transitions. [2019-01-14 02:19:28,421 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-01-14 02:19:28,422 INFO L706 BuchiCegarLoop]: Abstraction has 37 states and 45 transitions. [2019-01-14 02:19:28,422 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states and 45 transitions. [2019-01-14 02:19:28,424 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 28. [2019-01-14 02:19:28,425 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28 states. [2019-01-14 02:19:28,425 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 34 transitions. [2019-01-14 02:19:28,425 INFO L729 BuchiCegarLoop]: Abstraction has 28 states and 34 transitions. [2019-01-14 02:19:28,425 INFO L609 BuchiCegarLoop]: Abstraction has 28 states and 34 transitions. [2019-01-14 02:19:28,425 INFO L442 BuchiCegarLoop]: ======== Iteration 7============ [2019-01-14 02:19:28,426 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 28 states and 34 transitions. [2019-01-14 02:19:28,426 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 1 [2019-01-14 02:19:28,426 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-14 02:19:28,426 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-14 02:19:28,429 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 2, 2, 1, 1, 1, 1, 1] [2019-01-14 02:19:28,429 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1] [2019-01-14 02:19:28,429 INFO L794 eck$LassoCheckResult]: Stem: 699#ULTIMATE.startENTRY havoc main_#res;havoc main_#t~nondet0, main_#t~nondet1, main_~x~0, main_~y~0, main_~tmp~0, main_~xtmp~0;havoc main_~x~0;havoc main_~y~0;havoc main_~tmp~0;havoc main_~xtmp~0;main_~x~0 := main_#t~nondet0;havoc main_#t~nondet0;main_~y~0 := main_#t~nondet1;havoc main_#t~nondet1; 700#L13-2 assume !!(main_~y~0 > 0 && main_~x~0 > 0);main_~tmp~0 := main_~y~0;main_~xtmp~0 := main_~x~0; 718#L17 assume !(0 == main_~y~0); 717#L21 assume !(main_~y~0 < 0); 716#L21-2 assume main_~xtmp~0 > 0; 715#L26-2 assume !!(main_~xtmp~0 >= main_~y~0);main_~xtmp~0 := main_~xtmp~0 - main_~y~0; 713#L26-2 assume !(main_~xtmp~0 >= main_~y~0); 712#L26-3 main_~y~0 := main_~xtmp~0; 708#L25-1 main_~x~0 := main_~tmp~0; 701#L13-2 assume !!(main_~y~0 > 0 && main_~x~0 > 0);main_~tmp~0 := main_~y~0;main_~xtmp~0 := main_~x~0; 702#L17 assume !(0 == main_~y~0); 695#L21 assume !(main_~y~0 < 0); 696#L21-2 assume main_~xtmp~0 > 0; 709#L26-2 [2019-01-14 02:19:28,429 INFO L796 eck$LassoCheckResult]: Loop: 709#L26-2 assume !!(main_~xtmp~0 >= main_~y~0);main_~xtmp~0 := main_~xtmp~0 - main_~y~0; 709#L26-2 [2019-01-14 02:19:28,429 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 02:19:28,430 INFO L82 PathProgramCache]: Analyzing trace with hash -521667071, now seen corresponding path program 3 times [2019-01-14 02:19:28,430 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 02:19:28,430 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 02:19:28,431 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:19:28,431 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-14 02:19:28,431 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:19:28,435 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 02:19:28,440 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 02:19:28,443 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 02:19:28,443 INFO L82 PathProgramCache]: Analyzing trace with hash 64, now seen corresponding path program 2 times [2019-01-14 02:19:28,443 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 02:19:28,443 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 02:19:28,444 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:19:28,444 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-14 02:19:28,445 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:19:28,447 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 02:19:28,449 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 02:19:28,450 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 02:19:28,450 INFO L82 PathProgramCache]: Analyzing trace with hash 1008190016, now seen corresponding path program 4 times [2019-01-14 02:19:28,451 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 02:19:28,451 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 02:19:28,452 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:19:28,452 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-14 02:19:28,452 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:19:28,458 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 02:19:28,463 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 02:19:28,594 INFO L216 LassoAnalysis]: Preferences: [2019-01-14 02:19:28,594 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-01-14 02:19:28,594 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-01-14 02:19:28,594 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-01-14 02:19:28,595 INFO L127 ssoRankerPreferences]: Use exernal solver: true [2019-01-14 02:19:28,595 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-14 02:19:28,595 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-01-14 02:19:28,595 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-01-14 02:19:28,595 INFO L131 ssoRankerPreferences]: Filename of dumped script: GCD3_true-termination_true-no-overflow.c_Iteration7_Lasso [2019-01-14 02:19:28,596 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-01-14 02:19:28,596 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2019-01-14 02:19:28,598 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:19:28,600 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:19:28,613 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:19:28,616 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:19:28,640 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:19:28,659 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:19:28,745 INFO L300 LassoAnalysis]: Preprocessing complete. [2019-01-14 02:19:28,745 INFO L412 LassoAnalysis]: Checking for nontermination... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 16 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 16 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-14 02:19:28,752 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-14 02:19:28,752 INFO L163 nArgumentSynthesizer]: Using integer mode. [2019-01-14 02:19:28,760 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2019-01-14 02:19:28,760 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_main_#res=0} Honda state: {ULTIMATE.start_main_#res=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 17 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 17 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-14 02:19:28,780 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-14 02:19:28,780 INFO L163 nArgumentSynthesizer]: Using integer mode. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 18 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 18 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-14 02:19:28,805 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2019-01-14 02:19:28,806 INFO L163 nArgumentSynthesizer]: Using integer mode. [2019-01-14 02:19:28,942 INFO L452 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2019-01-14 02:19:28,945 INFO L216 LassoAnalysis]: Preferences: [2019-01-14 02:19:28,945 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-01-14 02:19:28,945 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-01-14 02:19:28,945 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-01-14 02:19:28,946 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2019-01-14 02:19:28,946 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-14 02:19:28,946 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-01-14 02:19:28,946 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-01-14 02:19:28,946 INFO L131 ssoRankerPreferences]: Filename of dumped script: GCD3_true-termination_true-no-overflow.c_Iteration7_Lasso [2019-01-14 02:19:28,946 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-01-14 02:19:28,946 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2019-01-14 02:19:28,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-14 02:19:28,950 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:19:28,953 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:19:28,957 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:19:28,959 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:19:28,964 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:19:29,050 INFO L300 LassoAnalysis]: Preprocessing complete. [2019-01-14 02:19:29,050 INFO L497 LassoAnalysis]: Using template 'affine'. [2019-01-14 02:19:29,052 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 02:19:29,054 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:19:29,054 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 02:19:29,054 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:19:29,054 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:19:29,055 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:19:29,055 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 02:19:29,055 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 02:19:29,056 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:19:29,056 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 02:19:29,057 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:19:29,060 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 02:19:29,060 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:19:29,060 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:19:29,060 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:19:29,061 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 02:19:29,061 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 02:19:29,063 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:19:29,064 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 02:19:29,064 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:19:29,064 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:19:29,065 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:19:29,065 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:19:29,066 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-14 02:19:29,066 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-14 02:19:29,068 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:19:29,068 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 02:19:29,069 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:19:29,069 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 02:19:29,069 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:19:29,069 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:19:29,069 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:19:29,070 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 02:19:29,070 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 02:19:29,070 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:19:29,071 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 02:19:29,071 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:19:29,071 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:19:29,072 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:19:29,072 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:19:29,073 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-14 02:19:29,073 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-14 02:19:29,076 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:19:29,076 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 02:19:29,077 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:19:29,077 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:19:29,077 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:19:29,077 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:19:29,079 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-14 02:19:29,079 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-14 02:19:29,088 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-01-14 02:19:29,095 INFO L443 ModelExtractionUtils]: Simplification made 4 calls to the SMT solver. [2019-01-14 02:19:29,095 INFO L444 ModelExtractionUtils]: 10 out of 16 variables were initially zero. Simplification set additionally 0 variables to zero. [2019-01-14 02:19:29,095 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-01-14 02:19:29,096 INFO L440 nArgumentSynthesizer]: Removed 1 redundant supporting invariants from a total of 2. [2019-01-14 02:19:29,097 INFO L518 LassoAnalysis]: Proved termination. [2019-01-14 02:19:29,097 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~y~0, ULTIMATE.start_main_~xtmp~0) = -2*ULTIMATE.start_main_~y~0 + 2*ULTIMATE.start_main_~xtmp~0 + 1 Supporting invariants [1*ULTIMATE.start_main_~y~0 - 1 >= 0] [2019-01-14 02:19:29,124 INFO L297 tatePredicateManager]: 0 out of 1 supporting invariants were superfluous and have been removed [2019-01-14 02:19:29,154 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 02:19:29,180 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 02:19:29,182 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 02:19:29,306 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 02:19:29,307 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 02:19:29,307 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 02:19:29,308 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.2 stem predicates 1 loop predicates [2019-01-14 02:19:29,308 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 28 states and 34 transitions. cyclomatic complexity: 9 Second operand 3 states. [2019-01-14 02:19:29,358 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 28 states and 34 transitions. cyclomatic complexity: 9. Second operand 3 states. Result 30 states and 37 transitions. Complement of second has 6 states. [2019-01-14 02:19:29,360 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 2 stem states 1 non-accepting loop states 1 accepting loop states [2019-01-14 02:19:29,360 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2019-01-14 02:19:29,360 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 7 transitions. [2019-01-14 02:19:29,360 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 7 transitions. Stem has 13 letters. Loop has 1 letters. [2019-01-14 02:19:29,361 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-14 02:19:29,361 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2019-01-14 02:19:29,379 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 02:19:29,386 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 02:19:29,387 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 02:19:29,395 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 02:19:29,396 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 02:19:29,396 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 02:19:29,397 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and with honda bouncer for loop.2 stem predicates 1 loop predicates [2019-01-14 02:19:29,397 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 28 states and 34 transitions. cyclomatic complexity: 9 Second operand 3 states. [2019-01-14 02:19:29,434 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 28 states and 34 transitions. cyclomatic complexity: 9. Second operand 3 states. Result 30 states and 37 transitions. Complement of second has 6 states. [2019-01-14 02:19:29,437 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 2 stem states 1 non-accepting loop states 1 accepting loop states [2019-01-14 02:19:29,438 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2019-01-14 02:19:29,438 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 7 transitions. [2019-01-14 02:19:29,438 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 7 transitions. Stem has 13 letters. Loop has 1 letters. [2019-01-14 02:19:29,438 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-14 02:19:29,439 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2019-01-14 02:19:29,456 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 02:19:29,466 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 02:19:29,467 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 02:19:29,476 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 02:19:29,477 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 02:19:29,477 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 02:19:29,479 INFO L152 lantAutomatonBouncer]: Defining Buchi interpolant automaton with scrooge nondeterminism in stemwith honda bouncer for stem and without honda bouncer for loop.2 stem predicates 1 loop predicates [2019-01-14 02:19:29,479 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 28 states and 34 transitions. cyclomatic complexity: 9 Second operand 3 states. [2019-01-14 02:19:29,517 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 28 states and 34 transitions. cyclomatic complexity: 9. Second operand 3 states. Result 32 states and 39 transitions. Complement of second has 5 states. [2019-01-14 02:19:29,519 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 2 stem states 1 non-accepting loop states 1 accepting loop states [2019-01-14 02:19:29,519 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2019-01-14 02:19:29,520 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 12 transitions. [2019-01-14 02:19:29,520 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 12 transitions. Stem has 13 letters. Loop has 1 letters. [2019-01-14 02:19:29,520 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-14 02:19:29,520 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 12 transitions. Stem has 14 letters. Loop has 1 letters. [2019-01-14 02:19:29,521 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-14 02:19:29,521 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 12 transitions. Stem has 13 letters. Loop has 2 letters. [2019-01-14 02:19:29,521 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-14 02:19:29,522 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 32 states and 39 transitions. [2019-01-14 02:19:29,522 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2019-01-14 02:19:29,523 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 32 states to 0 states and 0 transitions. [2019-01-14 02:19:29,523 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2019-01-14 02:19:29,523 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2019-01-14 02:19:29,523 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2019-01-14 02:19:29,523 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-01-14 02:19:29,523 INFO L706 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-01-14 02:19:29,523 INFO L729 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-01-14 02:19:29,523 INFO L609 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-01-14 02:19:29,523 INFO L442 BuchiCegarLoop]: ======== Iteration 8============ [2019-01-14 02:19:29,523 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2019-01-14 02:19:29,523 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2019-01-14 02:19:29,524 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2019-01-14 02:19:29,531 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 14.01 02:19:29 BoogieIcfgContainer [2019-01-14 02:19:29,531 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2019-01-14 02:19:29,532 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-01-14 02:19:29,532 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-01-14 02:19:29,532 INFO L276 PluginConnector]: Witness Printer initialized [2019-01-14 02:19:29,532 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.01 02:19:03" (3/4) ... [2019-01-14 02:19:29,536 INFO L147 WitnessPrinter]: No result that supports witness generation found [2019-01-14 02:19:29,536 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-01-14 02:19:29,536 INFO L168 Benchmark]: Toolchain (without parser) took 26366.22 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 199.2 MB). Free memory was 951.3 MB in the beginning and 1.0 GB in the end (delta: -49.5 MB). Peak memory consumption was 149.7 MB. Max. memory is 11.5 GB. [2019-01-14 02:19:29,538 INFO L168 Benchmark]: CDTParser took 0.16 ms. Allocated memory is still 1.0 GB. Free memory is still 978.2 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-01-14 02:19:29,538 INFO L168 Benchmark]: CACSL2BoogieTranslator took 294.56 ms. Allocated memory is still 1.0 GB. Free memory was 951.3 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-14 02:19:29,539 INFO L168 Benchmark]: Boogie Procedure Inliner took 34.83 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-14 02:19:29,540 INFO L168 Benchmark]: Boogie Preprocessor took 18.69 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-14 02:19:29,541 INFO L168 Benchmark]: RCFGBuilder took 427.51 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 130.0 MB). Free memory was 940.6 MB in the beginning and 1.1 GB in the end (delta: -159.4 MB). Peak memory consumption was 18.3 MB. Max. memory is 11.5 GB. [2019-01-14 02:19:29,541 INFO L168 Benchmark]: BuchiAutomizer took 25581.56 ms. Allocated memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 69.2 MB). Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 99.2 MB). Peak memory consumption was 168.4 MB. Max. memory is 11.5 GB. [2019-01-14 02:19:29,542 INFO L168 Benchmark]: Witness Printer took 4.20 ms. Allocated memory is still 1.2 GB. Free memory is still 1.0 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-01-14 02:19:29,548 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.16 ms. Allocated memory is still 1.0 GB. Free memory is still 978.2 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 294.56 ms. Allocated memory is still 1.0 GB. Free memory was 951.3 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 34.83 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 18.69 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 427.51 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 130.0 MB). Free memory was 940.6 MB in the beginning and 1.1 GB in the end (delta: -159.4 MB). Peak memory consumption was 18.3 MB. Max. memory is 11.5 GB. * BuchiAutomizer took 25581.56 ms. Allocated memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 69.2 MB). Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 99.2 MB). Peak memory consumption was 168.4 MB. Max. memory is 11.5 GB. * Witness Printer took 4.20 ms. Allocated memory is still 1.2 GB. Free memory is still 1.0 GB. There was no memory consumed. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Constructed decomposition of program Your program was decomposed into 8 terminating modules (3 trivial, 4 deterministic, 1 nondeterministic). One deterministic module has affine ranking function y and consists of 5 locations. One deterministic module has affine ranking function -2 * y + 2 * xtmp + 1 and consists of 4 locations. One deterministic module has affine ranking function xtmp and consists of 5 locations. One deterministic module has affine ranking function xtmp and consists of 4 locations. One nondeterministic module has affine ranking function -2 * y + 2 * xtmp + 1 and consists of 4 locations. 3 modules have a trivial ranking function, the largest among these consists of 8 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 25.5s and 8 iterations. TraceHistogramMax:2. Analysis of lassos took 23.1s. Construction of modules took 0.4s. Büchi inclusion checks took 1.7s. Highest rank in rank-based complementation 3. Minimization of det autom 3. Minimization of nondet autom 5. Automata minimization 0.0s AutomataMinimizationTime, 7 MinimizatonAttempts, 32 StatesRemovedByMinimization, 6 NontrivialMinimizations. Non-live state removal took 0.0s Buchi closure took 0.0s. Biggest automaton had 28 states and ocurred in iteration 6. Nontrivial modules had stage [4, 0, 1, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 1/1 HoareTripleCheckerStatistics: 56 SDtfs, 93 SDslu, 16 SDs, 0 SdLazy, 185 SolverSat, 31 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.4s Time LassoAnalysisResults: nont0 unkn0 SFLI2 SFLT2 conc0 concLT1 SILN0 SILU0 SILI0 SILT0 lasso2 LassoPreprocessingBenchmarks: Lassos: inital23 mio100 ax152 hnf96 lsp64 ukn100 mio100 lsp100 div100 bol100 ite100 ukn100 eq174 hnf90 smp100 dnf100 smp100 tf103 neg100 sie109 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 0 Time: 15ms VariablesStem: 1 VariablesLoop: 0 DisjunctsStem: 1 DisjunctsLoop: 1 SupportingInvariants: 2 MotzkinApplications: 6 LassoTerminationAnalysisBenchmarks: LassoNonterminationAnalysisSatFixpoint: 6 LassoNonterminationAnalysisSatUnbounded: 0 LassoNonterminationAnalysisUnsat: 5 LassoNonterminationAnalysisUnknown: 0 LassoNonterminationAnalysisTime: 19.3s - TerminationAnalysisResult: Termination proven Buchi Automizer proved that your program is terminating RESULT: Ultimate proved your program to be correct! Received shutdown request...