./Ultimate.py --spec ../../sv-benchmarks/c/properties/termination.prp --file ../../sv-benchmarks/c/termination-restricted-15/GCD3.c --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for termination Using default analysis Version cad46833 Calling Ultimate with: /usr/lib/jvm/java-8-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/run_dir_57594873-c4d1-4635-98fd-338d7b066215/bin/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/run_dir_57594873-c4d1-4635-98fd-338d7b066215/bin/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/run_dir_57594873-c4d1-4635-98fd-338d7b066215/bin/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/run_dir_57594873-c4d1-4635-98fd-338d7b066215/bin/uautomizer/config/AutomizerTermination.xml -i ../../sv-benchmarks/c/termination-restricted-15/GCD3.c -s /tmp/vcloud-vcloud-master/worker/run_dir_57594873-c4d1-4635-98fd-338d7b066215/bin/uautomizer/config/svcomp-Termination-64bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/run_dir_57594873-c4d1-4635-98fd-338d7b066215/bin/uautomizer --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-cad4683 [2019-11-15 23:52:14,533 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-15 23:52:14,535 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-15 23:52:14,550 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-15 23:52:14,550 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-15 23:52:14,551 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-15 23:52:14,553 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-15 23:52:14,563 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-15 23:52:14,567 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-15 23:52:14,571 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-15 23:52:14,572 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-15 23:52:14,573 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-15 23:52:14,574 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-15 23:52:14,574 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-15 23:52:14,575 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-15 23:52:14,576 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-15 23:52:14,577 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-15 23:52:14,577 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-15 23:52:14,579 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-15 23:52:14,581 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-15 23:52:14,582 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-15 23:52:14,583 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-15 23:52:14,584 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-15 23:52:14,585 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-15 23:52:14,587 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-15 23:52:14,587 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-15 23:52:14,587 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-15 23:52:14,588 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-15 23:52:14,589 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-15 23:52:14,590 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-15 23:52:14,590 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-15 23:52:14,590 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-15 23:52:14,591 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-15 23:52:14,592 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-15 23:52:14,593 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-15 23:52:14,593 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-15 23:52:14,593 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-15 23:52:14,594 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-15 23:52:14,594 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-15 23:52:14,595 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-15 23:52:14,595 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-15 23:52:14,596 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/run_dir_57594873-c4d1-4635-98fd-338d7b066215/bin/uautomizer/config/svcomp-Termination-64bit-Automizer_Default.epf [2019-11-15 23:52:14,612 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-15 23:52:14,612 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-15 23:52:14,614 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-11-15 23:52:14,614 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-11-15 23:52:14,614 INFO L138 SettingsManager]: * Use SBE=true [2019-11-15 23:52:14,614 INFO L136 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2019-11-15 23:52:14,614 INFO L138 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2019-11-15 23:52:14,615 INFO L138 SettingsManager]: * Use old map elimination=false [2019-11-15 23:52:14,615 INFO L138 SettingsManager]: * Use external solver (rank synthesis)=false [2019-11-15 23:52:14,615 INFO L138 SettingsManager]: * Use only trivial implications for array writes=true [2019-11-15 23:52:14,615 INFO L138 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2019-11-15 23:52:14,615 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-15 23:52:14,616 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2019-11-15 23:52:14,616 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-11-15 23:52:14,616 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-15 23:52:14,616 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2019-11-15 23:52:14,617 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2019-11-15 23:52:14,617 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2019-11-15 23:52:14,617 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-11-15 23:52:14,617 INFO L138 SettingsManager]: * Assume nondeterminstic values are in range=false [2019-11-15 23:52:14,617 INFO L138 SettingsManager]: * Use constant arrays=true [2019-11-15 23:52:14,618 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2019-11-15 23:52:14,618 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-15 23:52:14,618 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-11-15 23:52:14,618 INFO L138 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2019-11-15 23:52:14,619 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-15 23:52:14,619 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-11-15 23:52:14,619 INFO L138 SettingsManager]: * Dump automata to the following directory=/home/matthias/ultimate/dump/auto [2019-11-15 23:52:14,620 INFO L136 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2019-11-15 23:52:14,620 INFO L138 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 -> /tmp/vcloud-vcloud-master/worker/run_dir_57594873-c4d1-4635-98fd-338d7b066215/bin/uautomizer 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-11-15 23:52:14,653 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-15 23:52:14,663 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-15 23:52:14,667 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-15 23:52:14,668 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-15 23:52:14,668 INFO L275 PluginConnector]: CDTParser initialized [2019-11-15 23:52:14,669 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/run_dir_57594873-c4d1-4635-98fd-338d7b066215/bin/uautomizer/../../sv-benchmarks/c/termination-restricted-15/GCD3.c [2019-11-15 23:52:14,724 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_57594873-c4d1-4635-98fd-338d7b066215/bin/uautomizer/data/5707f8bb9/f56c6107cecb4c38b18d0ab88f4292ef/FLAG6d9d4a45d [2019-11-15 23:52:15,079 INFO L306 CDTParser]: Found 1 translation units. [2019-11-15 23:52:15,080 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/run_dir_57594873-c4d1-4635-98fd-338d7b066215/sv-benchmarks/c/termination-restricted-15/GCD3.c [2019-11-15 23:52:15,085 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_57594873-c4d1-4635-98fd-338d7b066215/bin/uautomizer/data/5707f8bb9/f56c6107cecb4c38b18d0ab88f4292ef/FLAG6d9d4a45d [2019-11-15 23:52:15,489 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/run_dir_57594873-c4d1-4635-98fd-338d7b066215/bin/uautomizer/data/5707f8bb9/f56c6107cecb4c38b18d0ab88f4292ef [2019-11-15 23:52:15,491 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-15 23:52:15,492 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-11-15 23:52:15,495 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-15 23:52:15,495 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-15 23:52:15,498 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-15 23:52:15,499 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.11 11:52:15" (1/1) ... [2019-11-15 23:52:15,502 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@40e35639 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 11:52:15, skipping insertion in model container [2019-11-15 23:52:15,502 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.11 11:52:15" (1/1) ... [2019-11-15 23:52:15,509 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-11-15 23:52:15,523 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-11-15 23:52:15,712 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-15 23:52:15,719 INFO L188 MainTranslator]: Completed pre-run [2019-11-15 23:52:15,828 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-15 23:52:15,842 INFO L192 MainTranslator]: Completed translation [2019-11-15 23:52:15,842 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 11:52:15 WrapperNode [2019-11-15 23:52:15,842 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-15 23:52:15,843 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-11-15 23:52:15,844 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-11-15 23:52:15,844 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-11-15 23:52:15,854 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 11:52:15" (1/1) ... [2019-11-15 23:52:15,861 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 11:52:15" (1/1) ... [2019-11-15 23:52:15,882 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-11-15 23:52:15,883 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-11-15 23:52:15,883 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-11-15 23:52:15,883 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-11-15 23:52:15,893 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 11:52:15" (1/1) ... [2019-11-15 23:52:15,899 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 11:52:15" (1/1) ... [2019-11-15 23:52:15,901 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 11:52:15" (1/1) ... [2019-11-15 23:52:15,902 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 11:52:15" (1/1) ... [2019-11-15 23:52:15,905 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 11:52:15" (1/1) ... [2019-11-15 23:52:15,915 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 11:52:15" (1/1) ... [2019-11-15 23:52:15,916 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 11:52:15" (1/1) ... [2019-11-15 23:52:15,928 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-11-15 23:52:15,929 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-11-15 23:52:15,929 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-11-15 23:52:15,929 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-11-15 23:52:15,930 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 11:52:15" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_57594873-c4d1-4635-98fd-338d7b066215/bin/uautomizer/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-11-15 23:52:16,018 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-11-15 23:52:16,019 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-11-15 23:52:16,212 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-11-15 23:52:16,212 INFO L284 CfgBuilder]: Removed 7 assume(true) statements. [2019-11-15 23:52:16,213 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.11 11:52:16 BoogieIcfgContainer [2019-11-15 23:52:16,213 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-11-15 23:52:16,214 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2019-11-15 23:52:16,214 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2019-11-15 23:52:16,218 INFO L275 PluginConnector]: BuchiAutomizer initialized [2019-11-15 23:52:16,218 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-11-15 23:52:16,219 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 15.11 11:52:15" (1/3) ... [2019-11-15 23:52:16,220 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@75e7238d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 15.11 11:52:16, skipping insertion in model container [2019-11-15 23:52:16,220 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-11-15 23:52:16,220 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 11:52:15" (2/3) ... [2019-11-15 23:52:16,220 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@75e7238d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 15.11 11:52:16, skipping insertion in model container [2019-11-15 23:52:16,221 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-11-15 23:52:16,221 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.11 11:52:16" (3/3) ... [2019-11-15 23:52:16,223 INFO L371 chiAutomizerObserver]: Analyzing ICFG GCD3.c [2019-11-15 23:52:16,270 INFO L356 BuchiCegarLoop]: Interprodecural is true [2019-11-15 23:52:16,271 INFO L357 BuchiCegarLoop]: Hoare is false [2019-11-15 23:52:16,271 INFO L358 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2019-11-15 23:52:16,271 INFO L359 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2019-11-15 23:52:16,271 INFO L360 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-11-15 23:52:16,272 INFO L361 BuchiCegarLoop]: Difference is false [2019-11-15 23:52:16,272 INFO L362 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-11-15 23:52:16,272 INFO L365 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2019-11-15 23:52:16,286 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 14 states. [2019-11-15 23:52:16,307 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 9 [2019-11-15 23:52:16,307 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-15 23:52:16,307 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-15 23:52:16,314 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1] [2019-11-15 23:52:16,315 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1] [2019-11-15 23:52:16,315 INFO L424 BuchiCegarLoop]: ======== Iteration 1============ [2019-11-15 23:52:16,315 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 14 states. [2019-11-15 23:52:16,317 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 9 [2019-11-15 23:52:16,317 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-15 23:52:16,317 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-15 23:52:16,318 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1] [2019-11-15 23:52:16,318 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1] [2019-11-15 23:52:16,326 INFO L791 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-11-15 23:52:16,327 INFO L793 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-11-15 23:52:16,332 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:52:16,333 INFO L82 PathProgramCache]: Analyzing trace with hash 32, now seen corresponding path program 1 times [2019-11-15 23:52:16,341 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:52:16,341 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [187930204] [2019-11-15 23:52:16,342 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:52:16,342 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:52:16,342 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:52:16,429 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 23:52:16,432 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 23:52:16,448 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-15 23:52:16,449 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:52:16,450 INFO L82 PathProgramCache]: Analyzing trace with hash 1187012529, now seen corresponding path program 1 times [2019-11-15 23:52:16,450 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:52:16,450 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [341586658] [2019-11-15 23:52:16,450 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:52:16,450 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:52:16,450 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:52:16,461 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:52:16,505 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 23:52:16,505 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [341586658] [2019-11-15 23:52:16,506 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 23:52:16,506 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-15 23:52:16,507 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [458226479] [2019-11-15 23:52:16,511 INFO L808 eck$LassoCheckResult]: loop already infeasible [2019-11-15 23:52:16,512 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 23:52:16,528 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-15 23:52:16,529 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-15 23:52:16,531 INFO L87 Difference]: Start difference. First operand 14 states. Second operand 3 states. [2019-11-15 23:52:16,572 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 23:52:16,572 INFO L93 Difference]: Finished difference Result 14 states and 17 transitions. [2019-11-15 23:52:16,573 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-15 23:52:16,574 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 14 states and 17 transitions. [2019-11-15 23:52:16,575 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 9 [2019-11-15 23:52:16,579 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 14 states to 10 states and 13 transitions. [2019-11-15 23:52:16,580 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 10 [2019-11-15 23:52:16,580 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 10 [2019-11-15 23:52:16,580 INFO L73 IsDeterministic]: Start isDeterministic. Operand 10 states and 13 transitions. [2019-11-15 23:52:16,581 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-11-15 23:52:16,581 INFO L688 BuchiCegarLoop]: Abstraction has 10 states and 13 transitions. [2019-11-15 23:52:16,596 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10 states and 13 transitions. [2019-11-15 23:52:16,603 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10 to 10. [2019-11-15 23:52:16,603 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2019-11-15 23:52:16,604 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 13 transitions. [2019-11-15 23:52:16,605 INFO L711 BuchiCegarLoop]: Abstraction has 10 states and 13 transitions. [2019-11-15 23:52:16,605 INFO L591 BuchiCegarLoop]: Abstraction has 10 states and 13 transitions. [2019-11-15 23:52:16,605 INFO L424 BuchiCegarLoop]: ======== Iteration 2============ [2019-11-15 23:52:16,605 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 10 states and 13 transitions. [2019-11-15 23:52:16,606 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 9 [2019-11-15 23:52:16,606 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-15 23:52:16,606 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-15 23:52:16,606 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1] [2019-11-15 23:52:16,607 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1] [2019-11-15 23:52:16,607 INFO L791 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-11-15 23:52:16,607 INFO L793 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-11-15 23:52:16,607 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:52:16,608 INFO L82 PathProgramCache]: Analyzing trace with hash 32, now seen corresponding path program 2 times [2019-11-15 23:52:16,608 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:52:16,608 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [298665286] [2019-11-15 23:52:16,608 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:52:16,608 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:52:16,609 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:52:16,612 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 23:52:16,614 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 23:52:16,616 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-15 23:52:16,616 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:52:16,617 INFO L82 PathProgramCache]: Analyzing trace with hash -1817939337, now seen corresponding path program 1 times [2019-11-15 23:52:16,617 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:52:16,617 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [215069317] [2019-11-15 23:52:16,617 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:52:16,617 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:52:16,618 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:52:16,624 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:52:16,648 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 23:52:16,649 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [215069317] [2019-11-15 23:52:16,650 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 23:52:16,650 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-15 23:52:16,651 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1072401583] [2019-11-15 23:52:16,652 INFO L808 eck$LassoCheckResult]: loop already infeasible [2019-11-15 23:52:16,652 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 23:52:16,652 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-15 23:52:16,653 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-15 23:52:16,654 INFO L87 Difference]: Start difference. First operand 10 states and 13 transitions. cyclomatic complexity: 4 Second operand 3 states. [2019-11-15 23:52:16,683 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 23:52:16,684 INFO L93 Difference]: Finished difference Result 12 states and 14 transitions. [2019-11-15 23:52:16,684 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-15 23:52:16,685 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 12 states and 14 transitions. [2019-11-15 23:52:16,686 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 11 [2019-11-15 23:52:16,686 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 12 states to 12 states and 14 transitions. [2019-11-15 23:52:16,687 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 12 [2019-11-15 23:52:16,687 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 12 [2019-11-15 23:52:16,687 INFO L73 IsDeterministic]: Start isDeterministic. Operand 12 states and 14 transitions. [2019-11-15 23:52:16,687 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-11-15 23:52:16,687 INFO L688 BuchiCegarLoop]: Abstraction has 12 states and 14 transitions. [2019-11-15 23:52:16,687 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12 states and 14 transitions. [2019-11-15 23:52:16,688 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12 to 8. [2019-11-15 23:52:16,688 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2019-11-15 23:52:16,689 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 9 transitions. [2019-11-15 23:52:16,689 INFO L711 BuchiCegarLoop]: Abstraction has 8 states and 9 transitions. [2019-11-15 23:52:16,689 INFO L591 BuchiCegarLoop]: Abstraction has 8 states and 9 transitions. [2019-11-15 23:52:16,689 INFO L424 BuchiCegarLoop]: ======== Iteration 3============ [2019-11-15 23:52:16,689 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 8 states and 9 transitions. [2019-11-15 23:52:16,690 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 7 [2019-11-15 23:52:16,690 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-15 23:52:16,690 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-15 23:52:16,690 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1] [2019-11-15 23:52:16,691 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1] [2019-11-15 23:52:16,691 INFO L791 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-11-15 23:52:16,691 INFO L793 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-11-15 23:52:16,691 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:52:16,691 INFO L82 PathProgramCache]: Analyzing trace with hash 32, now seen corresponding path program 3 times [2019-11-15 23:52:16,692 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:52:16,692 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1445097662] [2019-11-15 23:52:16,692 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:52:16,692 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:52:16,692 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:52:16,695 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 23:52:16,697 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 23:52:16,699 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-15 23:52:16,699 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:52:16,699 INFO L82 PathProgramCache]: Analyzing trace with hash -1818401082, now seen corresponding path program 1 times [2019-11-15 23:52:16,700 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:52:16,700 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [607965816] [2019-11-15 23:52:16,700 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:52:16,700 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:52:16,700 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:52:16,709 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 23:52:16,715 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 23:52:16,717 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-15 23:52:16,718 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:52:16,718 INFO L82 PathProgramCache]: Analyzing trace with hash 669111751, now seen corresponding path program 1 times [2019-11-15 23:52:16,718 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:52:16,719 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [998208538] [2019-11-15 23:52:16,719 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:52:16,719 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:52:16,719 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:52:16,732 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 23:52:16,738 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 23:52:16,740 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-15 23:52:16,834 INFO L210 LassoAnalysis]: Preferences: [2019-11-15 23:52:16,834 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-11-15 23:52:16,835 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-11-15 23:52:16,835 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-11-15 23:52:16,835 INFO L127 ssoRankerPreferences]: Use exernal solver: true [2019-11-15 23:52:16,835 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-15 23:52:16,835 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-11-15 23:52:16,836 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-11-15 23:52:16,836 INFO L131 ssoRankerPreferences]: Filename of dumped script: GCD3.c_Iteration3_Loop [2019-11-15 23:52:16,836 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-11-15 23:52:16,836 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2019-11-15 23:52:16,862 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 23:52:16,871 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 23:52:16,874 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 23:52:17,012 INFO L292 LassoAnalysis]: Preprocessing complete. [2019-11-15 23:52:17,013 INFO L404 LassoAnalysis]: Checking for nontermination... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_57594873-c4d1-4635-98fd-338d7b066215/bin/uautomizer/z3 Starting monitored process 2 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-11-15 23:52:17,029 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-11-15 23:52:17,029 INFO L160 nArgumentSynthesizer]: Using integer mode. Waiting until toolchain timeout for monitored process 2 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-15 23:52:17,040 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2019-11-15 23:52:17,041 INFO L440 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 /tmp/vcloud-vcloud-master/worker/run_dir_57594873-c4d1-4635-98fd-338d7b066215/bin/uautomizer/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-11-15 23:52:17,058 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-11-15 23:52:17,058 INFO L160 nArgumentSynthesizer]: Using integer mode. [2019-11-15 23:52:17,066 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2019-11-15 23:52:17,066 INFO L440 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 /tmp/vcloud-vcloud-master/worker/run_dir_57594873-c4d1-4635-98fd-338d7b066215/bin/uautomizer/z3 Starting monitored process 4 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-11-15 23:52:17,087 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-11-15 23:52:17,087 INFO L160 nArgumentSynthesizer]: Using integer mode. Waiting until toolchain timeout for monitored process 4 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_57594873-c4d1-4635-98fd-338d7b066215/bin/uautomizer/z3 Starting monitored process 5 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-11-15 23:52:17,121 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2019-11-15 23:52:17,121 INFO L160 nArgumentSynthesizer]: Using integer mode. Waiting until toolchain timeout for monitored process 5 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-15 23:52:21,172 INFO L444 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2019-11-15 23:52:21,175 INFO L210 LassoAnalysis]: Preferences: [2019-11-15 23:52:21,175 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-11-15 23:52:21,175 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-11-15 23:52:21,175 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-11-15 23:52:21,175 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2019-11-15 23:52:21,176 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-15 23:52:21,176 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-11-15 23:52:21,176 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-11-15 23:52:21,176 INFO L131 ssoRankerPreferences]: Filename of dumped script: GCD3.c_Iteration3_Loop [2019-11-15 23:52:21,176 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-11-15 23:52:21,176 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2019-11-15 23:52:21,178 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 23:52:21,187 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 23:52:21,191 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 23:52:21,304 INFO L292 LassoAnalysis]: Preprocessing complete. [2019-11-15 23:52:21,309 INFO L489 LassoAnalysis]: Using template 'affine'. [2019-11-15 23:52:21,313 INFO L120 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-11-15 23:52:21,315 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 23:52:21,315 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 23:52:21,316 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 23:52:21,316 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 23:52:21,323 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-15 23:52:21,323 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-15 23:52:21,347 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 23:52:21,361 INFO L120 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-11-15 23:52:21,363 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 23:52:21,363 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 23:52:21,363 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 23:52:21,363 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 23:52:21,366 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-15 23:52:21,366 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-15 23:52:21,374 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 23:52:21,375 INFO L120 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-11-15 23:52:21,376 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 23:52:21,378 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 23:52:21,379 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 23:52:21,379 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 23:52:21,379 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 23:52:21,381 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 23:52:21,383 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 23:52:21,402 INFO L419 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-11-15 23:52:21,426 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2019-11-15 23:52:21,429 INFO L444 ModelExtractionUtils]: 3 out of 6 variables were initially zero. Simplification set additionally 1 variables to zero. [2019-11-15 23:52:21,432 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-11-15 23:52:21,434 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2019-11-15 23:52:21,434 INFO L510 LassoAnalysis]: Proved termination. [2019-11-15 23:52:21,435 INFO L512 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~y~0) = 1*ULTIMATE.start_main_~y~0 Supporting invariants [] [2019-11-15 23:52:21,439 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2019-11-15 23:52:21,467 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:52:21,479 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:52:21,480 INFO L256 TraceCheckSpWp]: Trace formula consists of 6 conjuncts, 2 conjunts are in the unsatisfiable core [2019-11-15 23:52:21,481 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 23:52:21,490 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:52:21,491 INFO L256 TraceCheckSpWp]: Trace formula consists of 16 conjuncts, 5 conjunts are in the unsatisfiable core [2019-11-15 23:52:21,492 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 23:52:21,558 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 23:52:21,561 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-11-15 23:52:21,562 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 8 states and 9 transitions. cyclomatic complexity: 2 Second operand 6 states. [2019-11-15 23:52:21,645 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-11-15 23:52:21,646 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-11-15 23:52:21,646 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2019-11-15 23:52:21,647 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 12 transitions. [2019-11-15 23:52:21,649 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 12 transitions. Stem has 1 letters. Loop has 7 letters. [2019-11-15 23:52:21,651 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-15 23:52:21,651 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 12 transitions. Stem has 8 letters. Loop has 7 letters. [2019-11-15 23:52:21,651 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-15 23:52:21,652 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 12 transitions. Stem has 1 letters. Loop has 14 letters. [2019-11-15 23:52:21,652 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-15 23:52:21,653 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 27 states and 32 transitions. [2019-11-15 23:52:21,654 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 8 [2019-11-15 23:52:21,656 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 27 states to 24 states and 28 transitions. [2019-11-15 23:52:21,656 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 15 [2019-11-15 23:52:21,656 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 17 [2019-11-15 23:52:21,656 INFO L73 IsDeterministic]: Start isDeterministic. Operand 24 states and 28 transitions. [2019-11-15 23:52:21,657 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-11-15 23:52:21,657 INFO L688 BuchiCegarLoop]: Abstraction has 24 states and 28 transitions. [2019-11-15 23:52:21,657 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states and 28 transitions. [2019-11-15 23:52:21,659 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 21. [2019-11-15 23:52:21,660 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2019-11-15 23:52:21,660 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 24 transitions. [2019-11-15 23:52:21,661 INFO L711 BuchiCegarLoop]: Abstraction has 21 states and 24 transitions. [2019-11-15 23:52:21,661 INFO L591 BuchiCegarLoop]: Abstraction has 21 states and 24 transitions. [2019-11-15 23:52:21,661 INFO L424 BuchiCegarLoop]: ======== Iteration 4============ [2019-11-15 23:52:21,661 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 21 states and 24 transitions. [2019-11-15 23:52:21,662 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 7 [2019-11-15 23:52:21,662 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-15 23:52:21,663 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-15 23:52:21,663 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1] [2019-11-15 23:52:21,663 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1] [2019-11-15 23:52:21,664 INFO L791 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-11-15 23:52:21,664 INFO L793 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-11-15 23:52:21,664 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:52:21,664 INFO L82 PathProgramCache]: Analyzing trace with hash 925834904, now seen corresponding path program 1 times [2019-11-15 23:52:21,665 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:52:21,665 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1925727540] [2019-11-15 23:52:21,665 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:52:21,665 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:52:21,666 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:52:21,672 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 23:52:21,677 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 23:52:21,679 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-15 23:52:21,680 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:52:21,680 INFO L82 PathProgramCache]: Analyzing trace with hash 64, now seen corresponding path program 1 times [2019-11-15 23:52:21,680 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:52:21,680 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1697193155] [2019-11-15 23:52:21,681 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:52:21,681 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:52:21,681 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:52:21,684 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 23:52:21,685 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 23:52:21,687 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-15 23:52:21,687 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:52:21,687 INFO L82 PathProgramCache]: Analyzing trace with hash -1363889015, now seen corresponding path program 2 times [2019-11-15 23:52:21,687 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:52:21,688 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2016150378] [2019-11-15 23:52:21,688 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:52:21,688 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:52:21,688 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:52:21,694 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 23:52:21,700 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 23:52:21,702 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-15 23:52:21,788 INFO L210 LassoAnalysis]: Preferences: [2019-11-15 23:52:21,788 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-11-15 23:52:21,788 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-11-15 23:52:21,788 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-11-15 23:52:21,788 INFO L127 ssoRankerPreferences]: Use exernal solver: true [2019-11-15 23:52:21,788 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-15 23:52:21,789 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-11-15 23:52:21,789 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-11-15 23:52:21,789 INFO L131 ssoRankerPreferences]: Filename of dumped script: GCD3.c_Iteration4_Lasso [2019-11-15 23:52:21,789 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-11-15 23:52:21,789 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2019-11-15 23:52:21,791 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 23:52:21,798 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 23:52:21,800 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 23:52:21,820 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 23:52:21,822 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 23:52:21,825 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 23:52:21,922 INFO L292 LassoAnalysis]: Preprocessing complete. [2019-11-15 23:52:21,923 INFO L404 LassoAnalysis]: Checking for nontermination... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_57594873-c4d1-4635-98fd-338d7b066215/bin/uautomizer/z3 Starting monitored process 6 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-11-15 23:52:21,931 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-11-15 23:52:21,931 INFO L160 nArgumentSynthesizer]: Using integer mode. Waiting until toolchain timeout for monitored process 6 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-15 23:52:21,936 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2019-11-15 23:52:21,936 INFO L440 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 /tmp/vcloud-vcloud-master/worker/run_dir_57594873-c4d1-4635-98fd-338d7b066215/bin/uautomizer/z3 Starting monitored process 7 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-11-15 23:52:21,956 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-11-15 23:52:21,956 INFO L160 nArgumentSynthesizer]: Using integer mode. Waiting until toolchain timeout for monitored process 7 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-15 23:52:21,971 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2019-11-15 23:52:21,971 INFO L440 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 /tmp/vcloud-vcloud-master/worker/run_dir_57594873-c4d1-4635-98fd-338d7b066215/bin/uautomizer/z3 Starting monitored process 8 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-11-15 23:52:21,989 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-11-15 23:52:21,989 INFO L160 nArgumentSynthesizer]: Using integer mode. Waiting until toolchain timeout for monitored process 8 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_57594873-c4d1-4635-98fd-338d7b066215/bin/uautomizer/z3 Starting monitored process 9 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-11-15 23:52:22,023 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2019-11-15 23:52:22,023 INFO L160 nArgumentSynthesizer]: Using integer mode. Waiting until toolchain timeout for monitored process 9 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-15 23:52:22,232 INFO L444 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2019-11-15 23:52:22,234 INFO L210 LassoAnalysis]: Preferences: [2019-11-15 23:52:22,235 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-11-15 23:52:22,235 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-11-15 23:52:22,235 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-11-15 23:52:22,235 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2019-11-15 23:52:22,235 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-15 23:52:22,235 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-11-15 23:52:22,235 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-11-15 23:52:22,235 INFO L131 ssoRankerPreferences]: Filename of dumped script: GCD3.c_Iteration4_Lasso [2019-11-15 23:52:22,236 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-11-15 23:52:22,236 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2019-11-15 23:52:22,238 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 23:52:22,245 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 23:52:22,271 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 23:52:22,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-11-15 23:52:22,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-11-15 23:52:22,282 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 23:52:22,401 INFO L292 LassoAnalysis]: Preprocessing complete. [2019-11-15 23:52:22,402 INFO L489 LassoAnalysis]: Using template 'affine'. [2019-11-15 23:52:22,402 INFO L120 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-11-15 23:52:22,403 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 23:52:22,403 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 23:52:22,403 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 23:52:22,403 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 23:52:22,405 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-15 23:52:22,406 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-15 23:52:22,411 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 23:52:22,412 INFO L120 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-11-15 23:52:22,413 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 23:52:22,414 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 23:52:22,414 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 23:52:22,414 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 23:52:22,425 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-15 23:52:22,427 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-15 23:52:22,477 INFO L419 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-11-15 23:52:22,490 INFO L443 ModelExtractionUtils]: Simplification made 4 calls to the SMT solver. [2019-11-15 23:52:22,490 INFO L444 ModelExtractionUtils]: 10 out of 16 variables were initially zero. Simplification set additionally 0 variables to zero. [2019-11-15 23:52:22,491 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-11-15 23:52:22,493 INFO L438 nArgumentSynthesizer]: Removed 1 redundant supporting invariants from a total of 2. [2019-11-15 23:52:22,493 INFO L510 LassoAnalysis]: Proved termination. [2019-11-15 23:52:22,493 INFO L512 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-11-15 23:52:22,496 INFO L297 tatePredicateManager]: 0 out of 1 supporting invariants were superfluous and have been removed [2019-11-15 23:52:22,532 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:52:22,539 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:52:22,540 INFO L256 TraceCheckSpWp]: Trace formula consists of 18 conjuncts, 3 conjunts are in the unsatisfiable core [2019-11-15 23:52:22,540 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 23:52:22,552 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:52:22,552 WARN L254 TraceCheckSpWp]: Trace formula consists of 6 conjuncts, 5 conjunts are in the unsatisfiable core [2019-11-15 23:52:22,553 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 23:52:22,553 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 23:52:22,553 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-11-15 23:52:22,553 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 21 states and 24 transitions. cyclomatic complexity: 5 Second operand 3 states. [2019-11-15 23:52:22,615 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-11-15 23:52:22,617 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-11-15 23:52:22,617 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2019-11-15 23:52:22,618 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 11 transitions. [2019-11-15 23:52:22,618 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 11 transitions. Stem has 6 letters. Loop has 1 letters. [2019-11-15 23:52:22,618 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-15 23:52:22,618 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 11 transitions. Stem has 7 letters. Loop has 1 letters. [2019-11-15 23:52:22,618 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-15 23:52:22,619 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 11 transitions. Stem has 6 letters. Loop has 2 letters. [2019-11-15 23:52:22,619 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-15 23:52:22,619 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 25 states and 31 transitions. [2019-11-15 23:52:22,620 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 7 [2019-11-15 23:52:22,621 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 25 states to 24 states and 29 transitions. [2019-11-15 23:52:22,621 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 15 [2019-11-15 23:52:22,622 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 16 [2019-11-15 23:52:22,622 INFO L73 IsDeterministic]: Start isDeterministic. Operand 24 states and 29 transitions. [2019-11-15 23:52:22,622 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-11-15 23:52:22,622 INFO L688 BuchiCegarLoop]: Abstraction has 24 states and 29 transitions. [2019-11-15 23:52:22,622 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states and 29 transitions. [2019-11-15 23:52:22,624 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 23. [2019-11-15 23:52:22,624 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23 states. [2019-11-15 23:52:22,625 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 28 transitions. [2019-11-15 23:52:22,625 INFO L711 BuchiCegarLoop]: Abstraction has 23 states and 28 transitions. [2019-11-15 23:52:22,625 INFO L591 BuchiCegarLoop]: Abstraction has 23 states and 28 transitions. [2019-11-15 23:52:22,627 INFO L424 BuchiCegarLoop]: ======== Iteration 5============ [2019-11-15 23:52:22,627 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 23 states and 28 transitions. [2019-11-15 23:52:22,629 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 7 [2019-11-15 23:52:22,629 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-15 23:52:22,629 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-15 23:52:22,631 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1] [2019-11-15 23:52:22,631 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1] [2019-11-15 23:52:22,631 INFO L791 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-11-15 23:52:22,632 INFO L793 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-11-15 23:52:22,632 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:52:22,632 INFO L82 PathProgramCache]: Analyzing trace with hash -1363889017, now seen corresponding path program 1 times [2019-11-15 23:52:22,632 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:52:22,633 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1226059512] [2019-11-15 23:52:22,633 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:52:22,633 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:52:22,633 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:52:22,652 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 23:52:22,657 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 23:52:22,663 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-15 23:52:22,663 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:52:22,663 INFO L82 PathProgramCache]: Analyzing trace with hash 1776384388, now seen corresponding path program 2 times [2019-11-15 23:52:22,664 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:52:22,664 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [198366857] [2019-11-15 23:52:22,664 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:52:22,664 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:52:22,664 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:52:22,668 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 23:52:22,670 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 23:52:22,672 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-15 23:52:22,672 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:52:22,673 INFO L82 PathProgramCache]: Analyzing trace with hash 1008190014, now seen corresponding path program 1 times [2019-11-15 23:52:22,673 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:52:22,673 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [133815017] [2019-11-15 23:52:22,673 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:52:22,674 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:52:22,674 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:52:22,682 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:52:22,740 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 1 proven. 5 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-11-15 23:52:22,741 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [133815017] [2019-11-15 23:52:22,741 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1291498600] [2019-11-15 23:52:22,741 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_57594873-c4d1-4635-98fd-338d7b066215/bin/uautomizer/z3 Starting monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-15 23:52:22,795 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:52:22,796 INFO L256 TraceCheckSpWp]: Trace formula consists of 33 conjuncts, 6 conjunts are in the unsatisfiable core [2019-11-15 23:52:22,798 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 23:52:22,826 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 1 proven. 5 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-11-15 23:52:22,826 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-15 23:52:22,827 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 7 [2019-11-15 23:52:22,827 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1441541406] [2019-11-15 23:52:22,892 INFO L210 LassoAnalysis]: Preferences: [2019-11-15 23:52:22,892 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-11-15 23:52:22,892 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-11-15 23:52:22,892 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-11-15 23:52:22,892 INFO L127 ssoRankerPreferences]: Use exernal solver: true [2019-11-15 23:52:22,892 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-15 23:52:22,892 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-11-15 23:52:22,893 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-11-15 23:52:22,893 INFO L131 ssoRankerPreferences]: Filename of dumped script: GCD3.c_Iteration5_Loop [2019-11-15 23:52:22,893 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-11-15 23:52:22,893 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2019-11-15 23:52:22,894 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 23:52:22,905 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 23:52:22,922 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 23:52:23,002 INFO L292 LassoAnalysis]: Preprocessing complete. [2019-11-15 23:52:23,002 INFO L404 LassoAnalysis]: Checking for nontermination... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_57594873-c4d1-4635-98fd-338d7b066215/bin/uautomizer/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-11-15 23:52:23,019 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-11-15 23:52:23,019 INFO L160 nArgumentSynthesizer]: Using integer mode. [2019-11-15 23:52:23,024 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2019-11-15 23:52:23,024 INFO L440 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 /tmp/vcloud-vcloud-master/worker/run_dir_57594873-c4d1-4635-98fd-338d7b066215/bin/uautomizer/z3 Starting monitored process 12 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-11-15 23:52:23,041 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-11-15 23:52:23,041 INFO L160 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 /tmp/vcloud-vcloud-master/worker/run_dir_57594873-c4d1-4635-98fd-338d7b066215/bin/uautomizer/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-11-15 23:52:23,066 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2019-11-15 23:52:23,067 INFO L160 nArgumentSynthesizer]: Using integer mode. [2019-11-15 23:52:25,813 INFO L444 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2019-11-15 23:52:25,815 INFO L210 LassoAnalysis]: Preferences: [2019-11-15 23:52:25,816 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-11-15 23:52:25,816 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-11-15 23:52:25,816 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-11-15 23:52:25,816 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2019-11-15 23:52:25,816 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-15 23:52:25,816 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-11-15 23:52:25,816 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-11-15 23:52:25,816 INFO L131 ssoRankerPreferences]: Filename of dumped script: GCD3.c_Iteration5_Loop [2019-11-15 23:52:25,817 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-11-15 23:52:25,817 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2019-11-15 23:52:25,818 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 23:52:25,826 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 23:52:25,843 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 23:52:25,912 INFO L292 LassoAnalysis]: Preprocessing complete. [2019-11-15 23:52:25,913 INFO L489 LassoAnalysis]: Using template 'affine'. [2019-11-15 23:52:25,913 INFO L120 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-11-15 23:52:25,914 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 23:52:25,914 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 23:52:25,915 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 23:52:25,915 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 23:52:25,916 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-15 23:52:25,916 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-15 23:52:25,919 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 23:52:25,920 INFO L120 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-11-15 23:52:25,920 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 23:52:25,921 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 23:52:25,921 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 23:52:25,921 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 23:52:25,921 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 23:52:25,922 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 23:52:25,922 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 23:52:25,930 INFO L419 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-11-15 23:52:25,935 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2019-11-15 23:52:25,935 INFO L444 ModelExtractionUtils]: 3 out of 6 variables were initially zero. Simplification set additionally 1 variables to zero. [2019-11-15 23:52:25,936 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-11-15 23:52:25,936 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2019-11-15 23:52:25,936 INFO L510 LassoAnalysis]: Proved termination. [2019-11-15 23:52:25,937 INFO L512 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~xtmp~0) = 1*ULTIMATE.start_main_~xtmp~0 Supporting invariants [] [2019-11-15 23:52:25,937 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2019-11-15 23:52:25,987 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:52:25,997 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:52:25,998 INFO L256 TraceCheckSpWp]: Trace formula consists of 19 conjuncts, 2 conjunts are in the unsatisfiable core [2019-11-15 23:52:25,998 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 23:52:26,006 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:52:26,007 INFO L256 TraceCheckSpWp]: Trace formula consists of 16 conjuncts, 5 conjunts are in the unsatisfiable core [2019-11-15 23:52:26,008 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 23:52:26,028 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 23:52:26,028 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-11-15 23:52:26,028 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 23 states and 28 transitions. cyclomatic complexity: 8 Second operand 4 states. [2019-11-15 23:52:26,085 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-11-15 23:52:26,086 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-11-15 23:52:26,086 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2019-11-15 23:52:26,087 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 18 transitions. [2019-11-15 23:52:26,087 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 18 transitions. Stem has 7 letters. Loop has 7 letters. [2019-11-15 23:52:26,087 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-15 23:52:26,087 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 18 transitions. Stem has 14 letters. Loop has 7 letters. [2019-11-15 23:52:26,088 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-15 23:52:26,088 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 18 transitions. Stem has 7 letters. Loop has 14 letters. [2019-11-15 23:52:26,088 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-15 23:52:26,089 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 58 states and 72 transitions. [2019-11-15 23:52:26,091 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 8 [2019-11-15 23:52:26,092 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 58 states to 53 states and 67 transitions. [2019-11-15 23:52:26,093 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 23 [2019-11-15 23:52:26,093 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 25 [2019-11-15 23:52:26,093 INFO L73 IsDeterministic]: Start isDeterministic. Operand 53 states and 67 transitions. [2019-11-15 23:52:26,093 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-11-15 23:52:26,093 INFO L688 BuchiCegarLoop]: Abstraction has 53 states and 67 transitions. [2019-11-15 23:52:26,093 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states and 67 transitions. [2019-11-15 23:52:26,097 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 46. [2019-11-15 23:52:26,097 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 46 states. [2019-11-15 23:52:26,103 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 58 transitions. [2019-11-15 23:52:26,103 INFO L711 BuchiCegarLoop]: Abstraction has 46 states and 58 transitions. [2019-11-15 23:52:26,103 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 23:52:26,103 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-11-15 23:52:26,104 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2019-11-15 23:52:26,104 INFO L87 Difference]: Start difference. First operand 46 states and 58 transitions. Second operand 8 states. [2019-11-15 23:52:26,244 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 23:52:26,244 INFO L93 Difference]: Finished difference Result 51 states and 60 transitions. [2019-11-15 23:52:26,244 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-11-15 23:52:26,244 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 51 states and 60 transitions. [2019-11-15 23:52:26,246 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 8 [2019-11-15 23:52:26,247 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 51 states to 31 states and 37 transitions. [2019-11-15 23:52:26,247 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 24 [2019-11-15 23:52:26,247 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 29 [2019-11-15 23:52:26,248 INFO L73 IsDeterministic]: Start isDeterministic. Operand 31 states and 37 transitions. [2019-11-15 23:52:26,248 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-11-15 23:52:26,248 INFO L688 BuchiCegarLoop]: Abstraction has 31 states and 37 transitions. [2019-11-15 23:52:26,248 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states and 37 transitions. [2019-11-15 23:52:26,250 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 23. [2019-11-15 23:52:26,250 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23 states. [2019-11-15 23:52:26,251 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 27 transitions. [2019-11-15 23:52:26,251 INFO L711 BuchiCegarLoop]: Abstraction has 23 states and 27 transitions. [2019-11-15 23:52:26,251 INFO L591 BuchiCegarLoop]: Abstraction has 23 states and 27 transitions. [2019-11-15 23:52:26,251 INFO L424 BuchiCegarLoop]: ======== Iteration 6============ [2019-11-15 23:52:26,251 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 23 states and 27 transitions. [2019-11-15 23:52:26,252 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 8 [2019-11-15 23:52:26,252 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-15 23:52:26,252 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-15 23:52:26,253 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1] [2019-11-15 23:52:26,253 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 23:52:26,272 INFO L791 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-11-15 23:52:26,273 INFO L793 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-11-15 23:52:26,273 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:52:26,273 INFO L82 PathProgramCache]: Analyzing trace with hash -1363889017, now seen corresponding path program 2 times [2019-11-15 23:52:26,273 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:52:26,273 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [346640761] [2019-11-15 23:52:26,274 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:52:26,274 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:52:26,274 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:52:26,279 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 23:52:26,282 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 23:52:26,289 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-15 23:52:26,289 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:52:26,290 INFO L82 PathProgramCache]: Analyzing trace with hash -766658727, now seen corresponding path program 1 times [2019-11-15 23:52:26,290 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:52:26,290 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1804356200] [2019-11-15 23:52:26,290 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:52:26,291 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:52:26,291 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:52:26,294 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 23:52:26,297 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 23:52:26,299 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-15 23:52:26,299 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:52:26,300 INFO L82 PathProgramCache]: Analyzing trace with hash 1189119455, now seen corresponding path program 2 times [2019-11-15 23:52:26,300 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:52:26,300 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1189851214] [2019-11-15 23:52:26,300 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:52:26,300 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:52:26,301 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:52:26,307 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 23:52:26,312 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 23:52:26,314 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-15 23:52:26,384 INFO L210 LassoAnalysis]: Preferences: [2019-11-15 23:52:26,385 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-11-15 23:52:26,385 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-11-15 23:52:26,385 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-11-15 23:52:26,385 INFO L127 ssoRankerPreferences]: Use exernal solver: true [2019-11-15 23:52:26,385 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-15 23:52:26,385 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-11-15 23:52:26,385 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-11-15 23:52:26,385 INFO L131 ssoRankerPreferences]: Filename of dumped script: GCD3.c_Iteration6_Loop [2019-11-15 23:52:26,385 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-11-15 23:52:26,386 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2019-11-15 23:52:26,387 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 23:52:26,402 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 23:52:26,405 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 23:52:26,480 INFO L292 LassoAnalysis]: Preprocessing complete. [2019-11-15 23:52:26,480 INFO L404 LassoAnalysis]: Checking for nontermination... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_57594873-c4d1-4635-98fd-338d7b066215/bin/uautomizer/z3 Starting monitored process 14 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-11-15 23:52:26,495 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-11-15 23:52:26,495 INFO L160 nArgumentSynthesizer]: Using integer mode. Waiting until toolchain timeout for monitored process 14 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_57594873-c4d1-4635-98fd-338d7b066215/bin/uautomizer/z3 Starting monitored process 15 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-11-15 23:52:26,520 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2019-11-15 23:52:26,520 INFO L160 nArgumentSynthesizer]: Using integer mode. Waiting until toolchain timeout for monitored process 15 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-15 23:52:28,906 INFO L444 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2019-11-15 23:52:28,909 INFO L210 LassoAnalysis]: Preferences: [2019-11-15 23:52:28,909 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-11-15 23:52:28,910 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-11-15 23:52:28,910 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-11-15 23:52:28,910 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2019-11-15 23:52:28,910 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-15 23:52:28,910 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-11-15 23:52:28,910 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-11-15 23:52:28,910 INFO L131 ssoRankerPreferences]: Filename of dumped script: GCD3.c_Iteration6_Loop [2019-11-15 23:52:28,910 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-11-15 23:52:28,910 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2019-11-15 23:52:28,911 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 23:52:28,925 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 23:52:28,928 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 23:52:28,996 INFO L292 LassoAnalysis]: Preprocessing complete. [2019-11-15 23:52:28,996 INFO L489 LassoAnalysis]: Using template 'affine'. [2019-11-15 23:52:28,996 INFO L120 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-11-15 23:52:28,997 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 23:52:28,997 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 23:52:28,997 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 23:52:28,997 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 23:52:28,997 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 23:52:28,998 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 23:52:28,998 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 23:52:29,003 INFO L419 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-11-15 23:52:29,005 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2019-11-15 23:52:29,006 INFO L444 ModelExtractionUtils]: 3 out of 6 variables were initially zero. Simplification set additionally 1 variables to zero. [2019-11-15 23:52:29,006 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-11-15 23:52:29,006 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2019-11-15 23:52:29,006 INFO L510 LassoAnalysis]: Proved termination. [2019-11-15 23:52:29,007 INFO L512 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~xtmp~0) = 1*ULTIMATE.start_main_~xtmp~0 Supporting invariants [] [2019-11-15 23:52:29,007 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2019-11-15 23:52:29,032 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:52:29,038 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:52:29,038 INFO L256 TraceCheckSpWp]: Trace formula consists of 19 conjuncts, 2 conjunts are in the unsatisfiable core [2019-11-15 23:52:29,039 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 23:52:29,047 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:52:29,048 INFO L256 TraceCheckSpWp]: Trace formula consists of 19 conjuncts, 5 conjunts are in the unsatisfiable core [2019-11-15 23:52:29,049 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 23:52:29,071 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-11-15 23:52:29,072 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-11-15 23:52:29,072 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 23 states and 27 transitions. cyclomatic complexity: 6 Second operand 4 states. [2019-11-15 23:52:29,108 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-11-15 23:52:29,108 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-11-15 23:52:29,109 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2019-11-15 23:52:29,109 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 15 transitions. [2019-11-15 23:52:29,109 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 15 transitions. Stem has 7 letters. Loop has 8 letters. [2019-11-15 23:52:29,109 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-15 23:52:29,109 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 15 transitions. Stem has 15 letters. Loop has 8 letters. [2019-11-15 23:52:29,110 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-15 23:52:29,110 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 15 transitions. Stem has 7 letters. Loop has 16 letters. [2019-11-15 23:52:29,110 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-15 23:52:29,110 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 45 states and 54 transitions. [2019-11-15 23:52:29,111 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 1 [2019-11-15 23:52:29,112 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 45 states to 37 states and 45 transitions. [2019-11-15 23:52:29,112 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 19 [2019-11-15 23:52:29,112 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 20 [2019-11-15 23:52:29,112 INFO L73 IsDeterministic]: Start isDeterministic. Operand 37 states and 45 transitions. [2019-11-15 23:52:29,112 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-11-15 23:52:29,112 INFO L688 BuchiCegarLoop]: Abstraction has 37 states and 45 transitions. [2019-11-15 23:52:29,112 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states and 45 transitions. [2019-11-15 23:52:29,118 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 28. [2019-11-15 23:52:29,119 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28 states. [2019-11-15 23:52:29,120 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 34 transitions. [2019-11-15 23:52:29,120 INFO L711 BuchiCegarLoop]: Abstraction has 28 states and 34 transitions. [2019-11-15 23:52:29,120 INFO L591 BuchiCegarLoop]: Abstraction has 28 states and 34 transitions. [2019-11-15 23:52:29,120 INFO L424 BuchiCegarLoop]: ======== Iteration 7============ [2019-11-15 23:52:29,120 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 28 states and 34 transitions. [2019-11-15 23:52:29,121 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 1 [2019-11-15 23:52:29,121 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-15 23:52:29,121 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-15 23:52:29,121 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 2, 2, 1, 1, 1, 1, 1] [2019-11-15 23:52:29,121 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1] [2019-11-15 23:52:29,122 INFO L791 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-11-15 23:52:29,122 INFO L793 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-11-15 23:52:29,122 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:52:29,122 INFO L82 PathProgramCache]: Analyzing trace with hash -521667071, now seen corresponding path program 3 times [2019-11-15 23:52:29,122 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:52:29,123 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [922108699] [2019-11-15 23:52:29,123 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:52:29,123 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:52:29,123 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:52:29,129 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 23:52:29,133 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 23:52:29,135 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-15 23:52:29,136 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:52:29,136 INFO L82 PathProgramCache]: Analyzing trace with hash 64, now seen corresponding path program 2 times [2019-11-15 23:52:29,136 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:52:29,136 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1276177247] [2019-11-15 23:52:29,137 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:52:29,137 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:52:29,137 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:52:29,139 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 23:52:29,140 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 23:52:29,140 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-15 23:52:29,141 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:52:29,141 INFO L82 PathProgramCache]: Analyzing trace with hash 1008190016, now seen corresponding path program 4 times [2019-11-15 23:52:29,141 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:52:29,141 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2077423054] [2019-11-15 23:52:29,142 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:52:29,142 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:52:29,142 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:52:29,148 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 23:52:29,153 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 23:52:29,155 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-15 23:52:29,252 INFO L210 LassoAnalysis]: Preferences: [2019-11-15 23:52:29,252 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-11-15 23:52:29,252 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-11-15 23:52:29,252 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-11-15 23:52:29,252 INFO L127 ssoRankerPreferences]: Use exernal solver: true [2019-11-15 23:52:29,253 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-15 23:52:29,253 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-11-15 23:52:29,253 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-11-15 23:52:29,253 INFO L131 ssoRankerPreferences]: Filename of dumped script: GCD3.c_Iteration7_Lasso [2019-11-15 23:52:29,253 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-11-15 23:52:29,253 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2019-11-15 23:52:29,254 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 23:52:29,256 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 23:52:29,266 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 23:52:29,272 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 23:52:29,274 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 23:52:29,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-11-15 23:52:29,336 INFO L292 LassoAnalysis]: Preprocessing complete. [2019-11-15 23:52:29,336 INFO L404 LassoAnalysis]: Checking for nontermination... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_57594873-c4d1-4635-98fd-338d7b066215/bin/uautomizer/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-11-15 23:52:29,341 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-11-15 23:52:29,341 INFO L160 nArgumentSynthesizer]: Using integer mode. [2019-11-15 23:52:29,343 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2019-11-15 23:52:29,344 INFO L440 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 /tmp/vcloud-vcloud-master/worker/run_dir_57594873-c4d1-4635-98fd-338d7b066215/bin/uautomizer/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-11-15 23:52:29,348 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-11-15 23:52:29,349 INFO L160 nArgumentSynthesizer]: Using integer mode. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_57594873-c4d1-4635-98fd-338d7b066215/bin/uautomizer/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-11-15 23:52:29,376 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2019-11-15 23:52:29,376 INFO L160 nArgumentSynthesizer]: Using integer mode. [2019-11-15 23:52:29,494 INFO L444 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2019-11-15 23:52:29,496 INFO L210 LassoAnalysis]: Preferences: [2019-11-15 23:52:29,496 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-11-15 23:52:29,496 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-11-15 23:52:29,496 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-11-15 23:52:29,496 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2019-11-15 23:52:29,496 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-15 23:52:29,496 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-11-15 23:52:29,496 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-11-15 23:52:29,496 INFO L131 ssoRankerPreferences]: Filename of dumped script: GCD3.c_Iteration7_Lasso [2019-11-15 23:52:29,496 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-11-15 23:52:29,496 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2019-11-15 23:52:29,497 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 23:52:29,500 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 23:52:29,506 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 23:52:29,510 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 23:52:29,511 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 23:52:29,518 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 23:52:29,579 INFO L292 LassoAnalysis]: Preprocessing complete. [2019-11-15 23:52:29,579 INFO L489 LassoAnalysis]: Using template 'affine'. [2019-11-15 23:52:29,580 INFO L120 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-11-15 23:52:29,580 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 23:52:29,580 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 23:52:29,581 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 23:52:29,581 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 23:52:29,581 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 23:52:29,581 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 23:52:29,581 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 23:52:29,582 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 23:52:29,582 INFO L120 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-11-15 23:52:29,582 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 23:52:29,583 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 23:52:29,583 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 23:52:29,583 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 23:52:29,583 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 23:52:29,583 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 23:52:29,583 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 23:52:29,583 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 23:52:29,584 INFO L120 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-11-15 23:52:29,584 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 23:52:29,584 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 23:52:29,584 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 23:52:29,584 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 23:52:29,585 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-15 23:52:29,585 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-15 23:52:29,588 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 23:52:29,588 INFO L120 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-11-15 23:52:29,589 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 23:52:29,589 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 23:52:29,589 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 23:52:29,589 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 23:52:29,590 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 23:52:29,590 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 23:52:29,590 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 23:52:29,591 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 23:52:29,591 INFO L120 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-11-15 23:52:29,592 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 23:52:29,592 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 23:52:29,592 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 23:52:29,592 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 23:52:29,593 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-15 23:52:29,593 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-15 23:52:29,596 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 23:52:29,596 INFO L120 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-11-15 23:52:29,597 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 23:52:29,597 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 23:52:29,597 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 23:52:29,597 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 23:52:29,599 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-15 23:52:29,599 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-15 23:52:29,608 INFO L419 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-11-15 23:52:29,614 INFO L443 ModelExtractionUtils]: Simplification made 4 calls to the SMT solver. [2019-11-15 23:52:29,615 INFO L444 ModelExtractionUtils]: 10 out of 16 variables were initially zero. Simplification set additionally 0 variables to zero. [2019-11-15 23:52:29,615 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-11-15 23:52:29,616 INFO L438 nArgumentSynthesizer]: Removed 1 redundant supporting invariants from a total of 2. [2019-11-15 23:52:29,616 INFO L510 LassoAnalysis]: Proved termination. [2019-11-15 23:52:29,617 INFO L512 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-11-15 23:52:29,621 INFO L297 tatePredicateManager]: 0 out of 1 supporting invariants were superfluous and have been removed [2019-11-15 23:52:29,647 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:52:29,656 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:52:29,657 INFO L256 TraceCheckSpWp]: Trace formula consists of 32 conjuncts, 3 conjunts are in the unsatisfiable core [2019-11-15 23:52:29,658 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 23:52:29,668 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:52:29,668 WARN L254 TraceCheckSpWp]: Trace formula consists of 6 conjuncts, 5 conjunts are in the unsatisfiable core [2019-11-15 23:52:29,669 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 23:52:29,669 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 23:52:29,669 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-11-15 23:52:29,669 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 28 states and 34 transitions. cyclomatic complexity: 9 Second operand 3 states. [2019-11-15 23:52:29,699 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-11-15 23:52:29,700 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-11-15 23:52:29,700 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2019-11-15 23:52:29,701 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 7 transitions. [2019-11-15 23:52:29,701 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 7 transitions. Stem has 13 letters. Loop has 1 letters. [2019-11-15 23:52:29,701 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-15 23:52:29,701 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2019-11-15 23:52:29,726 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:52:29,734 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:52:29,734 INFO L256 TraceCheckSpWp]: Trace formula consists of 32 conjuncts, 3 conjunts are in the unsatisfiable core [2019-11-15 23:52:29,735 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 23:52:29,750 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:52:29,751 WARN L254 TraceCheckSpWp]: Trace formula consists of 6 conjuncts, 5 conjunts are in the unsatisfiable core [2019-11-15 23:52:29,751 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 23:52:29,752 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 23:52:29,752 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-11-15 23:52:29,752 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 28 states and 34 transitions. cyclomatic complexity: 9 Second operand 3 states. [2019-11-15 23:52:29,790 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-11-15 23:52:29,792 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-11-15 23:52:29,792 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2019-11-15 23:52:29,792 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 7 transitions. [2019-11-15 23:52:29,792 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 7 transitions. Stem has 13 letters. Loop has 1 letters. [2019-11-15 23:52:29,792 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-15 23:52:29,792 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2019-11-15 23:52:29,814 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:52:29,822 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:52:29,823 INFO L256 TraceCheckSpWp]: Trace formula consists of 32 conjuncts, 3 conjunts are in the unsatisfiable core [2019-11-15 23:52:29,823 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 23:52:29,836 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:52:29,837 WARN L254 TraceCheckSpWp]: Trace formula consists of 6 conjuncts, 5 conjunts are in the unsatisfiable core [2019-11-15 23:52:29,837 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 23:52:29,837 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 23:52:29,838 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-11-15 23:52:29,838 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 28 states and 34 transitions. cyclomatic complexity: 9 Second operand 3 states. [2019-11-15 23:52:29,867 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-11-15 23:52:29,869 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-11-15 23:52:29,869 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2019-11-15 23:52:29,869 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 12 transitions. [2019-11-15 23:52:29,869 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 12 transitions. Stem has 13 letters. Loop has 1 letters. [2019-11-15 23:52:29,870 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-15 23:52:29,870 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 12 transitions. Stem has 14 letters. Loop has 1 letters. [2019-11-15 23:52:29,870 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-15 23:52:29,870 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 12 transitions. Stem has 13 letters. Loop has 2 letters. [2019-11-15 23:52:29,870 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-15 23:52:29,870 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 32 states and 39 transitions. [2019-11-15 23:52:29,871 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2019-11-15 23:52:29,872 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 32 states to 0 states and 0 transitions. [2019-11-15 23:52:29,872 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2019-11-15 23:52:29,872 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2019-11-15 23:52:29,872 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2019-11-15 23:52:29,872 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-11-15 23:52:29,872 INFO L688 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-11-15 23:52:29,872 INFO L711 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-11-15 23:52:29,872 INFO L591 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-11-15 23:52:29,872 INFO L424 BuchiCegarLoop]: ======== Iteration 8============ [2019-11-15 23:52:29,873 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2019-11-15 23:52:29,873 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2019-11-15 23:52:29,873 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2019-11-15 23:52:29,879 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 15.11 11:52:29 BoogieIcfgContainer [2019-11-15 23:52:29,879 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2019-11-15 23:52:29,880 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-11-15 23:52:29,880 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-11-15 23:52:29,880 INFO L275 PluginConnector]: Witness Printer initialized [2019-11-15 23:52:29,880 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.11 11:52:16" (3/4) ... [2019-11-15 23:52:29,883 INFO L140 WitnessPrinter]: No result that supports witness generation found [2019-11-15 23:52:29,883 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-11-15 23:52:29,885 INFO L168 Benchmark]: Toolchain (without parser) took 14391.92 ms. Allocated memory was 1.0 GB in the beginning and 1.3 GB in the end (delta: 223.9 MB). Free memory was 950.1 MB in the beginning and 1.0 GB in the end (delta: -79.5 MB). Peak memory consumption was 144.4 MB. Max. memory is 11.5 GB. [2019-11-15 23:52:29,885 INFO L168 Benchmark]: CDTParser took 0.25 ms. Allocated memory is still 1.0 GB. Free memory is still 967.6 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-15 23:52:29,886 INFO L168 Benchmark]: CACSL2BoogieTranslator took 348.05 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 157.3 MB). Free memory was 950.1 MB in the beginning and 1.2 GB in the end (delta: -199.9 MB). Peak memory consumption was 23.2 MB. Max. memory is 11.5 GB. [2019-11-15 23:52:29,886 INFO L168 Benchmark]: Boogie Procedure Inliner took 38.95 ms. Allocated memory is still 1.2 GB. Free memory is still 1.2 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-15 23:52:29,887 INFO L168 Benchmark]: Boogie Preprocessor took 45.85 ms. Allocated memory is still 1.2 GB. Free memory was 1.2 GB in the beginning and 1.1 GB in the end (delta: 3.4 MB). Peak memory consumption was 3.4 MB. Max. memory is 11.5 GB. [2019-11-15 23:52:29,888 INFO L168 Benchmark]: RCFGBuilder took 284.73 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 14.9 MB). Peak memory consumption was 14.9 MB. Max. memory is 11.5 GB. [2019-11-15 23:52:29,888 INFO L168 Benchmark]: BuchiAutomizer took 13665.46 ms. Allocated memory was 1.2 GB in the beginning and 1.3 GB in the end (delta: 66.6 MB). Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 102.1 MB). Peak memory consumption was 168.7 MB. Max. memory is 11.5 GB. [2019-11-15 23:52:29,889 INFO L168 Benchmark]: Witness Printer took 3.40 ms. Allocated memory is still 1.3 GB. Free memory is still 1.0 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-15 23:52:29,894 INFO L335 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.25 ms. Allocated memory is still 1.0 GB. Free memory is still 967.6 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 348.05 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 157.3 MB). Free memory was 950.1 MB in the beginning and 1.2 GB in the end (delta: -199.9 MB). Peak memory consumption was 23.2 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 38.95 ms. Allocated memory is still 1.2 GB. Free memory is still 1.2 GB. There was no memory consumed. Max. memory is 11.5 GB. * Boogie Preprocessor took 45.85 ms. Allocated memory is still 1.2 GB. Free memory was 1.2 GB in the beginning and 1.1 GB in the end (delta: 3.4 MB). Peak memory consumption was 3.4 MB. Max. memory is 11.5 GB. * RCFGBuilder took 284.73 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 14.9 MB). Peak memory consumption was 14.9 MB. Max. memory is 11.5 GB. * BuchiAutomizer took 13665.46 ms. Allocated memory was 1.2 GB in the beginning and 1.3 GB in the end (delta: 66.6 MB). Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 102.1 MB). Peak memory consumption was 168.7 MB. Max. memory is 11.5 GB. * Witness Printer took 3.40 ms. Allocated memory is still 1.3 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 13.6s and 8 iterations. TraceHistogramMax:2. Analysis of lassos took 12.3s. Construction of modules took 0.2s. Büchi inclusion checks took 0.8s. 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.2s 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: 34ms VariablesStem: 1 VariablesLoop: 0 DisjunctsStem: 1 DisjunctsLoop: 1 SupportingInvariants: 2 MotzkinApplications: 6 LassoTerminationAnalysisBenchmarks: LassoNonterminationAnalysisSatFixpoint: 6 LassoNonterminationAnalysisSatUnbounded: 0 LassoNonterminationAnalysisUnsat: 5 LassoNonterminationAnalysisUnknown: 0 LassoNonterminationAnalysisTime: 9.8s - TerminationAnalysisResult: Termination proven Buchi Automizer proved that your program is terminating RESULT: Ultimate proved your program to be correct! Received shutdown request...