./Ultimate.py --spec ../sv-benchmarks/c/properties/termination.prp --file ../sv-benchmarks/c/bitvector/gcd_4.c --full-output -ea --architecture 32bit -------------------------------------------------------------------------------- Checking for termination Using default analysis Version 8bd4bc60 Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx12G -Xms1G -ea -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerTermination.xml -i ../sv-benchmarks/c/bitvector/gcd_4.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(F end) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 9918b49e0d76e4ce36b6a6760021b33460a8ae9b ................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.25-8bd4bc6 [2020-07-29 01:42:05,232 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-07-29 01:42:05,234 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-07-29 01:42:05,249 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-07-29 01:42:05,250 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-07-29 01:42:05,251 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-07-29 01:42:05,253 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-07-29 01:42:05,255 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-07-29 01:42:05,257 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-07-29 01:42:05,258 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-07-29 01:42:05,259 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-07-29 01:42:05,260 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-07-29 01:42:05,260 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-07-29 01:42:05,262 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-07-29 01:42:05,263 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-07-29 01:42:05,264 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-07-29 01:42:05,265 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-07-29 01:42:05,266 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-07-29 01:42:05,268 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-07-29 01:42:05,270 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-07-29 01:42:05,272 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-07-29 01:42:05,273 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-07-29 01:42:05,275 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-07-29 01:42:05,276 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-07-29 01:42:05,279 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-07-29 01:42:05,279 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-07-29 01:42:05,280 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-07-29 01:42:05,281 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-07-29 01:42:05,281 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-07-29 01:42:05,282 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-07-29 01:42:05,283 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-07-29 01:42:05,284 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-07-29 01:42:05,285 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-07-29 01:42:05,285 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-07-29 01:42:05,287 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-07-29 01:42:05,287 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-07-29 01:42:05,288 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-07-29 01:42:05,288 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-07-29 01:42:05,288 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-07-29 01:42:05,290 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-07-29 01:42:05,290 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-07-29 01:42:05,291 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-32bit-Automizer_Default.epf [2020-07-29 01:42:05,311 INFO L113 SettingsManager]: Loading preferences was successful [2020-07-29 01:42:05,312 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-07-29 01:42:05,313 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2020-07-29 01:42:05,314 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2020-07-29 01:42:05,314 INFO L138 SettingsManager]: * Use SBE=true [2020-07-29 01:42:05,314 INFO L136 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2020-07-29 01:42:05,315 INFO L138 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2020-07-29 01:42:05,315 INFO L138 SettingsManager]: * Use old map elimination=false [2020-07-29 01:42:05,315 INFO L138 SettingsManager]: * Use external solver (rank synthesis)=false [2020-07-29 01:42:05,315 INFO L138 SettingsManager]: * Use only trivial implications for array writes=true [2020-07-29 01:42:05,316 INFO L138 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2020-07-29 01:42:05,316 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-07-29 01:42:05,316 INFO L138 SettingsManager]: * sizeof long=4 [2020-07-29 01:42:05,317 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2020-07-29 01:42:05,317 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-07-29 01:42:05,317 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-07-29 01:42:05,317 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-07-29 01:42:05,318 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2020-07-29 01:42:05,318 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2020-07-29 01:42:05,318 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2020-07-29 01:42:05,319 INFO L138 SettingsManager]: * sizeof long double=12 [2020-07-29 01:42:05,319 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-07-29 01:42:05,319 INFO L138 SettingsManager]: * Assume nondeterminstic values are in range=false [2020-07-29 01:42:05,320 INFO L138 SettingsManager]: * Use constant arrays=true [2020-07-29 01:42:05,320 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2020-07-29 01:42:05,320 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-07-29 01:42:05,320 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2020-07-29 01:42:05,321 INFO L138 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2020-07-29 01:42:05,321 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-07-29 01:42:05,321 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2020-07-29 01:42:05,322 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2020-07-29 01:42:05,322 INFO L138 SettingsManager]: * Dump automata to the following directory=/home/matthias/ultimate/dump/auto [2020-07-29 01:42:05,323 INFO L136 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2020-07-29 01:42:05,324 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 -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(F end) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 9918b49e0d76e4ce36b6a6760021b33460a8ae9b [2020-07-29 01:42:05,676 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2020-07-29 01:42:05,695 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-07-29 01:42:05,699 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-07-29 01:42:05,700 INFO L271 PluginConnector]: Initializing CDTParser... [2020-07-29 01:42:05,700 INFO L275 PluginConnector]: CDTParser initialized [2020-07-29 01:42:05,701 INFO L429 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/bitvector/gcd_4.c [2020-07-29 01:42:05,769 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0934e6a99/814474be979e4641be40b7cee56c1374/FLAGffe6b2fc8 [2020-07-29 01:42:06,157 INFO L306 CDTParser]: Found 1 translation units. [2020-07-29 01:42:06,157 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/bitvector/gcd_4.c [2020-07-29 01:42:06,164 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0934e6a99/814474be979e4641be40b7cee56c1374/FLAGffe6b2fc8 [2020-07-29 01:42:06,593 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0934e6a99/814474be979e4641be40b7cee56c1374 [2020-07-29 01:42:06,596 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-07-29 01:42:06,599 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2020-07-29 01:42:06,600 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-07-29 01:42:06,601 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-07-29 01:42:06,604 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-07-29 01:42:06,606 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 29.07 01:42:06" (1/1) ... [2020-07-29 01:42:06,609 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@38f257ed and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.07 01:42:06, skipping insertion in model container [2020-07-29 01:42:06,609 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 29.07 01:42:06" (1/1) ... [2020-07-29 01:42:06,618 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-07-29 01:42:06,638 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-07-29 01:42:06,816 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-07-29 01:42:06,828 INFO L203 MainTranslator]: Completed pre-run [2020-07-29 01:42:06,849 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-07-29 01:42:06,865 INFO L208 MainTranslator]: Completed translation [2020-07-29 01:42:06,866 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.07 01:42:06 WrapperNode [2020-07-29 01:42:06,866 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-07-29 01:42:06,867 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2020-07-29 01:42:06,868 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2020-07-29 01:42:06,868 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2020-07-29 01:42:06,878 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.07 01:42:06" (1/1) ... [2020-07-29 01:42:06,884 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.07 01:42:06" (1/1) ... [2020-07-29 01:42:06,993 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2020-07-29 01:42:06,993 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-07-29 01:42:06,994 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-07-29 01:42:06,994 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-07-29 01:42:07,005 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.07 01:42:06" (1/1) ... [2020-07-29 01:42:07,005 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.07 01:42:06" (1/1) ... [2020-07-29 01:42:07,008 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.07 01:42:06" (1/1) ... [2020-07-29 01:42:07,008 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.07 01:42:06" (1/1) ... [2020-07-29 01:42:07,021 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.07 01:42:06" (1/1) ... [2020-07-29 01:42:07,028 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.07 01:42:06" (1/1) ... [2020-07-29 01:42:07,035 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.07 01:42:06" (1/1) ... [2020-07-29 01:42:07,038 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-07-29 01:42:07,039 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-07-29 01:42:07,040 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-07-29 01:42:07,041 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-07-29 01:42:07,042 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.07 01:42:06" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:42:07,128 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-07-29 01:42:07,129 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-07-29 01:42:07,614 INFO L290 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-07-29 01:42:07,614 INFO L295 CfgBuilder]: Removed 13 assume(true) statements. [2020-07-29 01:42:07,618 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.07 01:42:07 BoogieIcfgContainer [2020-07-29 01:42:07,618 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-07-29 01:42:07,619 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2020-07-29 01:42:07,619 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2020-07-29 01:42:07,623 INFO L275 PluginConnector]: BuchiAutomizer initialized [2020-07-29 01:42:07,624 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2020-07-29 01:42:07,624 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 29.07 01:42:06" (1/3) ... [2020-07-29 01:42:07,625 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@60b3ea80 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 29.07 01:42:07, skipping insertion in model container [2020-07-29 01:42:07,625 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2020-07-29 01:42:07,625 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.07 01:42:06" (2/3) ... [2020-07-29 01:42:07,626 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@60b3ea80 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 29.07 01:42:07, skipping insertion in model container [2020-07-29 01:42:07,626 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2020-07-29 01:42:07,626 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.07 01:42:07" (3/3) ... [2020-07-29 01:42:07,628 INFO L371 chiAutomizerObserver]: Analyzing ICFG gcd_4.c [2020-07-29 01:42:07,682 INFO L356 BuchiCegarLoop]: Interprodecural is true [2020-07-29 01:42:07,683 INFO L357 BuchiCegarLoop]: Hoare is false [2020-07-29 01:42:07,683 INFO L358 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2020-07-29 01:42:07,683 INFO L359 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2020-07-29 01:42:07,683 INFO L360 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-07-29 01:42:07,684 INFO L361 BuchiCegarLoop]: Difference is false [2020-07-29 01:42:07,684 INFO L362 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-07-29 01:42:07,684 INFO L365 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2020-07-29 01:42:07,699 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 20 states. [2020-07-29 01:42:07,728 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2020-07-29 01:42:07,728 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 01:42:07,728 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 01:42:07,735 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1] [2020-07-29 01:42:07,736 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2020-07-29 01:42:07,736 INFO L424 BuchiCegarLoop]: ======== Iteration 1============ [2020-07-29 01:42:07,736 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 20 states. [2020-07-29 01:42:07,740 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2020-07-29 01:42:07,741 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 01:42:07,741 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 01:42:07,742 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1] [2020-07-29 01:42:07,742 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2020-07-29 01:42:07,751 INFO L794 eck$LassoCheckResult]: Stem: 13#ULTIMATE.startENTRYtrue havoc main_#res;havoc main_#t~ret0, main_~x~0, main_~y~0, main_~g~0;havoc main_~x~0;havoc main_~y~0;havoc main_~g~0;main_~x~0 := 63;main_~y~0 := 18;gcd_test_#in~a, gcd_test_#in~b := main_~x~0, main_~y~0;havoc gcd_test_#res;havoc gcd_test_~a, gcd_test_~b;gcd_test_~a := gcd_test_#in~a;gcd_test_~b := gcd_test_#in~b; 15#L12true assume !(gcd_test_~a < 0); 12#L12-2true assume !(gcd_test_~b < 0); 16#L13-1true assume !(0 == gcd_test_~a); 8#L20-2true [2020-07-29 01:42:07,751 INFO L796 eck$LassoCheckResult]: Loop: 8#L20-2true assume !!(0 != gcd_test_~b); 10#L20true assume !(gcd_test_~a > gcd_test_~b);gcd_test_~b := gcd_test_~b - gcd_test_~a; 8#L20-2true [2020-07-29 01:42:07,757 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 01:42:07,758 INFO L82 PathProgramCache]: Analyzing trace with hash 959468, now seen corresponding path program 1 times [2020-07-29 01:42:07,767 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 01:42:07,767 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1756019859] [2020-07-29 01:42:07,768 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 01:42:07,843 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 01:42:07,844 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 01:42:07,851 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 01:42:07,851 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 01:42:07,868 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-07-29 01:42:07,869 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 01:42:07,869 INFO L82 PathProgramCache]: Analyzing trace with hash 1830, now seen corresponding path program 1 times [2020-07-29 01:42:07,870 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 01:42:07,870 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [952640357] [2020-07-29 01:42:07,870 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 01:42:07,881 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 01:42:07,881 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 01:42:07,885 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 01:42:07,886 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 01:42:07,887 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-07-29 01:42:07,889 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 01:42:07,890 INFO L82 PathProgramCache]: Analyzing trace with hash 922049617, now seen corresponding path program 1 times [2020-07-29 01:42:07,890 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 01:42:07,890 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [47640492] [2020-07-29 01:42:07,891 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 01:42:07,900 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:42:08,002 INFO L280 TraceCheckUtils]: 0: Hoare triple {28#true} havoc main_#res;havoc main_#t~ret0, main_~x~0, main_~y~0, main_~g~0;havoc main_~x~0;havoc main_~y~0;havoc main_~g~0;main_~x~0 := 63;main_~y~0 := 18;gcd_test_#in~a, gcd_test_#in~b := main_~x~0, main_~y~0;havoc gcd_test_#res;havoc gcd_test_~a, gcd_test_~b;gcd_test_~a := gcd_test_#in~a;gcd_test_~b := gcd_test_#in~b; {30#(and (= 63 ULTIMATE.start_gcd_test_~a) (= 18 ULTIMATE.start_gcd_test_~b))} is VALID [2020-07-29 01:42:08,004 INFO L280 TraceCheckUtils]: 1: Hoare triple {30#(and (= 63 ULTIMATE.start_gcd_test_~a) (= 18 ULTIMATE.start_gcd_test_~b))} assume !(gcd_test_~a < 0); {30#(and (= 63 ULTIMATE.start_gcd_test_~a) (= 18 ULTIMATE.start_gcd_test_~b))} is VALID [2020-07-29 01:42:08,005 INFO L280 TraceCheckUtils]: 2: Hoare triple {30#(and (= 63 ULTIMATE.start_gcd_test_~a) (= 18 ULTIMATE.start_gcd_test_~b))} assume !(gcd_test_~b < 0); {30#(and (= 63 ULTIMATE.start_gcd_test_~a) (= 18 ULTIMATE.start_gcd_test_~b))} is VALID [2020-07-29 01:42:08,007 INFO L280 TraceCheckUtils]: 3: Hoare triple {30#(and (= 63 ULTIMATE.start_gcd_test_~a) (= 18 ULTIMATE.start_gcd_test_~b))} assume !(0 == gcd_test_~a); {30#(and (= 63 ULTIMATE.start_gcd_test_~a) (= 18 ULTIMATE.start_gcd_test_~b))} is VALID [2020-07-29 01:42:08,009 INFO L280 TraceCheckUtils]: 4: Hoare triple {30#(and (= 63 ULTIMATE.start_gcd_test_~a) (= 18 ULTIMATE.start_gcd_test_~b))} assume !!(0 != gcd_test_~b); {30#(and (= 63 ULTIMATE.start_gcd_test_~a) (= 18 ULTIMATE.start_gcd_test_~b))} is VALID [2020-07-29 01:42:08,011 INFO L280 TraceCheckUtils]: 5: Hoare triple {30#(and (= 63 ULTIMATE.start_gcd_test_~a) (= 18 ULTIMATE.start_gcd_test_~b))} assume !(gcd_test_~a > gcd_test_~b);gcd_test_~b := gcd_test_~b - gcd_test_~a; {29#false} is VALID [2020-07-29 01:42:08,014 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-29 01:42:08,014 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [47640492] [2020-07-29 01:42:08,015 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-29 01:42:08,015 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2020-07-29 01:42:08,016 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1226513460] [2020-07-29 01:42:08,060 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-29 01:42:08,074 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-07-29 01:42:08,075 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-29 01:42:08,077 INFO L87 Difference]: Start difference. First operand 20 states. Second operand 3 states. [2020-07-29 01:42:08,157 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-29 01:42:08,158 INFO L93 Difference]: Finished difference Result 22 states and 23 transitions. [2020-07-29 01:42:08,158 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-07-29 01:42:08,159 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2020-07-29 01:42:08,173 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 6 edges. 6 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-29 01:42:08,175 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 22 states and 23 transitions. [2020-07-29 01:42:08,179 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2020-07-29 01:42:08,184 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 22 states to 8 states and 9 transitions. [2020-07-29 01:42:08,185 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 8 [2020-07-29 01:42:08,185 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 8 [2020-07-29 01:42:08,186 INFO L73 IsDeterministic]: Start isDeterministic. Operand 8 states and 9 transitions. [2020-07-29 01:42:08,186 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-07-29 01:42:08,187 INFO L688 BuchiCegarLoop]: Abstraction has 8 states and 9 transitions. [2020-07-29 01:42:08,206 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8 states and 9 transitions. [2020-07-29 01:42:08,217 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8 to 8. [2020-07-29 01:42:08,217 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-29 01:42:08,217 INFO L82 GeneralOperation]: Start isEquivalent. First operand 8 states and 9 transitions. Second operand 8 states. [2020-07-29 01:42:08,218 INFO L74 IsIncluded]: Start isIncluded. First operand 8 states and 9 transitions. Second operand 8 states. [2020-07-29 01:42:08,220 INFO L87 Difference]: Start difference. First operand 8 states and 9 transitions. Second operand 8 states. [2020-07-29 01:42:08,222 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-29 01:42:08,222 INFO L93 Difference]: Finished difference Result 8 states and 9 transitions. [2020-07-29 01:42:08,223 INFO L276 IsEmpty]: Start isEmpty. Operand 8 states and 9 transitions. [2020-07-29 01:42:08,223 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-29 01:42:08,224 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-29 01:42:08,224 INFO L74 IsIncluded]: Start isIncluded. First operand 8 states. Second operand 8 states and 9 transitions. [2020-07-29 01:42:08,224 INFO L87 Difference]: Start difference. First operand 8 states. Second operand 8 states and 9 transitions. [2020-07-29 01:42:08,225 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-29 01:42:08,225 INFO L93 Difference]: Finished difference Result 8 states and 9 transitions. [2020-07-29 01:42:08,225 INFO L276 IsEmpty]: Start isEmpty. Operand 8 states and 9 transitions. [2020-07-29 01:42:08,226 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-29 01:42:08,226 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-29 01:42:08,226 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-29 01:42:08,226 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-29 01:42:08,227 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2020-07-29 01:42:08,228 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 9 transitions. [2020-07-29 01:42:08,229 INFO L711 BuchiCegarLoop]: Abstraction has 8 states and 9 transitions. [2020-07-29 01:42:08,229 INFO L591 BuchiCegarLoop]: Abstraction has 8 states and 9 transitions. [2020-07-29 01:42:08,229 INFO L424 BuchiCegarLoop]: ======== Iteration 2============ [2020-07-29 01:42:08,230 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 8 states and 9 transitions. [2020-07-29 01:42:08,230 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2020-07-29 01:42:08,230 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 01:42:08,231 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 01:42:08,231 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1] [2020-07-29 01:42:08,231 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2020-07-29 01:42:08,232 INFO L794 eck$LassoCheckResult]: Stem: 55#ULTIMATE.startENTRY havoc main_#res;havoc main_#t~ret0, main_~x~0, main_~y~0, main_~g~0;havoc main_~x~0;havoc main_~y~0;havoc main_~g~0;main_~x~0 := 63;main_~y~0 := 18;gcd_test_#in~a, gcd_test_#in~b := main_~x~0, main_~y~0;havoc gcd_test_#res;havoc gcd_test_~a, gcd_test_~b;gcd_test_~a := gcd_test_#in~a;gcd_test_~b := gcd_test_#in~b; 56#L12 assume !(gcd_test_~a < 0); 53#L12-2 assume !(gcd_test_~b < 0); 54#L13-1 assume !(0 == gcd_test_~a); 57#L20-2 assume !!(0 != gcd_test_~b); 60#L20 assume gcd_test_~a > gcd_test_~b;gcd_test_~a := gcd_test_~a - gcd_test_~b; 58#L20-2 [2020-07-29 01:42:08,232 INFO L796 eck$LassoCheckResult]: Loop: 58#L20-2 assume !!(0 != gcd_test_~b); 59#L20 assume !(gcd_test_~a > gcd_test_~b);gcd_test_~b := gcd_test_~b - gcd_test_~a; 58#L20-2 [2020-07-29 01:42:08,232 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 01:42:08,232 INFO L82 PathProgramCache]: Analyzing trace with hash 922049615, now seen corresponding path program 1 times [2020-07-29 01:42:08,233 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 01:42:08,233 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1282478410] [2020-07-29 01:42:08,233 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 01:42:08,242 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 01:42:08,242 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 01:42:08,249 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 01:42:08,250 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 01:42:08,253 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-07-29 01:42:08,253 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 01:42:08,253 INFO L82 PathProgramCache]: Analyzing trace with hash 1830, now seen corresponding path program 2 times [2020-07-29 01:42:08,254 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 01:42:08,254 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2047944472] [2020-07-29 01:42:08,254 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 01:42:08,258 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 01:42:08,259 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 01:42:08,262 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 01:42:08,262 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 01:42:08,263 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-07-29 01:42:08,264 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 01:42:08,264 INFO L82 PathProgramCache]: Analyzing trace with hash 1326417908, now seen corresponding path program 1 times [2020-07-29 01:42:08,264 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 01:42:08,265 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1383820695] [2020-07-29 01:42:08,265 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 01:42:08,273 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:42:08,352 INFO L280 TraceCheckUtils]: 0: Hoare triple {84#true} havoc main_#res;havoc main_#t~ret0, main_~x~0, main_~y~0, main_~g~0;havoc main_~x~0;havoc main_~y~0;havoc main_~g~0;main_~x~0 := 63;main_~y~0 := 18;gcd_test_#in~a, gcd_test_#in~b := main_~x~0, main_~y~0;havoc gcd_test_#res;havoc gcd_test_~a, gcd_test_~b;gcd_test_~a := gcd_test_#in~a;gcd_test_~b := gcd_test_#in~b; {86#(and (= 63 ULTIMATE.start_gcd_test_~a) (= 18 ULTIMATE.start_gcd_test_~b))} is VALID [2020-07-29 01:42:08,353 INFO L280 TraceCheckUtils]: 1: Hoare triple {86#(and (= 63 ULTIMATE.start_gcd_test_~a) (= 18 ULTIMATE.start_gcd_test_~b))} assume !(gcd_test_~a < 0); {86#(and (= 63 ULTIMATE.start_gcd_test_~a) (= 18 ULTIMATE.start_gcd_test_~b))} is VALID [2020-07-29 01:42:08,354 INFO L280 TraceCheckUtils]: 2: Hoare triple {86#(and (= 63 ULTIMATE.start_gcd_test_~a) (= 18 ULTIMATE.start_gcd_test_~b))} assume !(gcd_test_~b < 0); {86#(and (= 63 ULTIMATE.start_gcd_test_~a) (= 18 ULTIMATE.start_gcd_test_~b))} is VALID [2020-07-29 01:42:08,355 INFO L280 TraceCheckUtils]: 3: Hoare triple {86#(and (= 63 ULTIMATE.start_gcd_test_~a) (= 18 ULTIMATE.start_gcd_test_~b))} assume !(0 == gcd_test_~a); {86#(and (= 63 ULTIMATE.start_gcd_test_~a) (= 18 ULTIMATE.start_gcd_test_~b))} is VALID [2020-07-29 01:42:08,357 INFO L280 TraceCheckUtils]: 4: Hoare triple {86#(and (= 63 ULTIMATE.start_gcd_test_~a) (= 18 ULTIMATE.start_gcd_test_~b))} assume !!(0 != gcd_test_~b); {86#(and (= 63 ULTIMATE.start_gcd_test_~a) (= 18 ULTIMATE.start_gcd_test_~b))} is VALID [2020-07-29 01:42:08,358 INFO L280 TraceCheckUtils]: 5: Hoare triple {86#(and (= 63 ULTIMATE.start_gcd_test_~a) (= 18 ULTIMATE.start_gcd_test_~b))} assume gcd_test_~a > gcd_test_~b;gcd_test_~a := gcd_test_~a - gcd_test_~b; {87#(and (= 18 ULTIMATE.start_gcd_test_~b) (<= 63 (+ ULTIMATE.start_gcd_test_~b ULTIMATE.start_gcd_test_~a)))} is VALID [2020-07-29 01:42:08,359 INFO L280 TraceCheckUtils]: 6: Hoare triple {87#(and (= 18 ULTIMATE.start_gcd_test_~b) (<= 63 (+ ULTIMATE.start_gcd_test_~b ULTIMATE.start_gcd_test_~a)))} assume !!(0 != gcd_test_~b); {87#(and (= 18 ULTIMATE.start_gcd_test_~b) (<= 63 (+ ULTIMATE.start_gcd_test_~b ULTIMATE.start_gcd_test_~a)))} is VALID [2020-07-29 01:42:08,361 INFO L280 TraceCheckUtils]: 7: Hoare triple {87#(and (= 18 ULTIMATE.start_gcd_test_~b) (<= 63 (+ ULTIMATE.start_gcd_test_~b ULTIMATE.start_gcd_test_~a)))} assume !(gcd_test_~a > gcd_test_~b);gcd_test_~b := gcd_test_~b - gcd_test_~a; {85#false} is VALID [2020-07-29 01:42:08,362 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-29 01:42:08,363 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1383820695] [2020-07-29 01:42:08,363 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1636875741] [2020-07-29 01:42:08,363 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-07-29 01:42:08,400 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:42:08,403 INFO L263 TraceCheckSpWp]: Trace formula consists of 25 conjuncts, 8 conjunts are in the unsatisfiable core [2020-07-29 01:42:08,410 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:42:08,412 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-29 01:42:08,642 INFO L280 TraceCheckUtils]: 0: Hoare triple {84#true} havoc main_#res;havoc main_#t~ret0, main_~x~0, main_~y~0, main_~g~0;havoc main_~x~0;havoc main_~y~0;havoc main_~g~0;main_~x~0 := 63;main_~y~0 := 18;gcd_test_#in~a, gcd_test_#in~b := main_~x~0, main_~y~0;havoc gcd_test_#res;havoc gcd_test_~a, gcd_test_~b;gcd_test_~a := gcd_test_#in~a;gcd_test_~b := gcd_test_#in~b; {91#(and (<= ULTIMATE.start_gcd_test_~b 18) (<= 63 ULTIMATE.start_gcd_test_~a))} is VALID [2020-07-29 01:42:08,644 INFO L280 TraceCheckUtils]: 1: Hoare triple {91#(and (<= ULTIMATE.start_gcd_test_~b 18) (<= 63 ULTIMATE.start_gcd_test_~a))} assume !(gcd_test_~a < 0); {91#(and (<= ULTIMATE.start_gcd_test_~b 18) (<= 63 ULTIMATE.start_gcd_test_~a))} is VALID [2020-07-29 01:42:08,645 INFO L280 TraceCheckUtils]: 2: Hoare triple {91#(and (<= ULTIMATE.start_gcd_test_~b 18) (<= 63 ULTIMATE.start_gcd_test_~a))} assume !(gcd_test_~b < 0); {91#(and (<= ULTIMATE.start_gcd_test_~b 18) (<= 63 ULTIMATE.start_gcd_test_~a))} is VALID [2020-07-29 01:42:08,646 INFO L280 TraceCheckUtils]: 3: Hoare triple {91#(and (<= ULTIMATE.start_gcd_test_~b 18) (<= 63 ULTIMATE.start_gcd_test_~a))} assume !(0 == gcd_test_~a); {91#(and (<= ULTIMATE.start_gcd_test_~b 18) (<= 63 ULTIMATE.start_gcd_test_~a))} is VALID [2020-07-29 01:42:08,648 INFO L280 TraceCheckUtils]: 4: Hoare triple {91#(and (<= ULTIMATE.start_gcd_test_~b 18) (<= 63 ULTIMATE.start_gcd_test_~a))} assume !!(0 != gcd_test_~b); {91#(and (<= ULTIMATE.start_gcd_test_~b 18) (<= 63 ULTIMATE.start_gcd_test_~a))} is VALID [2020-07-29 01:42:08,649 INFO L280 TraceCheckUtils]: 5: Hoare triple {91#(and (<= ULTIMATE.start_gcd_test_~b 18) (<= 63 ULTIMATE.start_gcd_test_~a))} assume gcd_test_~a > gcd_test_~b;gcd_test_~a := gcd_test_~a - gcd_test_~b; {107#(and (<= ULTIMATE.start_gcd_test_~b 18) (<= 63 (+ ULTIMATE.start_gcd_test_~b ULTIMATE.start_gcd_test_~a)))} is VALID [2020-07-29 01:42:08,651 INFO L280 TraceCheckUtils]: 6: Hoare triple {107#(and (<= ULTIMATE.start_gcd_test_~b 18) (<= 63 (+ ULTIMATE.start_gcd_test_~b ULTIMATE.start_gcd_test_~a)))} assume !!(0 != gcd_test_~b); {107#(and (<= ULTIMATE.start_gcd_test_~b 18) (<= 63 (+ ULTIMATE.start_gcd_test_~b ULTIMATE.start_gcd_test_~a)))} is VALID [2020-07-29 01:42:08,652 INFO L280 TraceCheckUtils]: 7: Hoare triple {107#(and (<= ULTIMATE.start_gcd_test_~b 18) (<= 63 (+ ULTIMATE.start_gcd_test_~b ULTIMATE.start_gcd_test_~a)))} assume !(gcd_test_~a > gcd_test_~b);gcd_test_~b := gcd_test_~b - gcd_test_~a; {85#false} is VALID [2020-07-29 01:42:08,654 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-29 01:42:08,654 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-07-29 01:42:08,654 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [2, 2] total 4 [2020-07-29 01:42:08,655 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [864987231] [2020-07-29 01:42:08,681 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-29 01:42:08,681 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-07-29 01:42:08,682 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2020-07-29 01:42:08,682 INFO L87 Difference]: Start difference. First operand 8 states and 9 transitions. cyclomatic complexity: 2 Second operand 6 states. [2020-07-29 01:42:08,740 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-29 01:42:08,741 INFO L93 Difference]: Finished difference Result 10 states and 11 transitions. [2020-07-29 01:42:08,741 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-07-29 01:42:08,741 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states. [2020-07-29 01:42:08,769 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 16 edges. 16 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-29 01:42:08,770 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 10 states and 11 transitions. [2020-07-29 01:42:08,772 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2020-07-29 01:42:08,773 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 10 states to 10 states and 11 transitions. [2020-07-29 01:42:08,773 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 10 [2020-07-29 01:42:08,774 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 10 [2020-07-29 01:42:08,774 INFO L73 IsDeterministic]: Start isDeterministic. Operand 10 states and 11 transitions. [2020-07-29 01:42:08,774 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-07-29 01:42:08,774 INFO L688 BuchiCegarLoop]: Abstraction has 10 states and 11 transitions. [2020-07-29 01:42:08,774 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10 states and 11 transitions. [2020-07-29 01:42:08,776 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10 to 10. [2020-07-29 01:42:08,776 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-29 01:42:08,776 INFO L82 GeneralOperation]: Start isEquivalent. First operand 10 states and 11 transitions. Second operand 10 states. [2020-07-29 01:42:08,777 INFO L74 IsIncluded]: Start isIncluded. First operand 10 states and 11 transitions. Second operand 10 states. [2020-07-29 01:42:08,777 INFO L87 Difference]: Start difference. First operand 10 states and 11 transitions. Second operand 10 states. [2020-07-29 01:42:08,778 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-29 01:42:08,779 INFO L93 Difference]: Finished difference Result 10 states and 11 transitions. [2020-07-29 01:42:08,779 INFO L276 IsEmpty]: Start isEmpty. Operand 10 states and 11 transitions. [2020-07-29 01:42:08,779 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-29 01:42:08,779 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-29 01:42:08,780 INFO L74 IsIncluded]: Start isIncluded. First operand 10 states. Second operand 10 states and 11 transitions. [2020-07-29 01:42:08,780 INFO L87 Difference]: Start difference. First operand 10 states. Second operand 10 states and 11 transitions. [2020-07-29 01:42:08,781 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-29 01:42:08,782 INFO L93 Difference]: Finished difference Result 10 states and 11 transitions. [2020-07-29 01:42:08,782 INFO L276 IsEmpty]: Start isEmpty. Operand 10 states and 11 transitions. [2020-07-29 01:42:08,782 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-29 01:42:08,783 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-29 01:42:08,783 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-29 01:42:08,783 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-29 01:42:08,783 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2020-07-29 01:42:08,784 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 11 transitions. [2020-07-29 01:42:08,785 INFO L711 BuchiCegarLoop]: Abstraction has 10 states and 11 transitions. [2020-07-29 01:42:08,785 INFO L591 BuchiCegarLoop]: Abstraction has 10 states and 11 transitions. [2020-07-29 01:42:08,785 INFO L424 BuchiCegarLoop]: ======== Iteration 3============ [2020-07-29 01:42:08,785 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 10 states and 11 transitions. [2020-07-29 01:42:08,786 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2020-07-29 01:42:08,786 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 01:42:08,786 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 01:42:08,787 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 1, 1, 1, 1] [2020-07-29 01:42:08,787 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2020-07-29 01:42:08,788 INFO L794 eck$LassoCheckResult]: Stem: 123#ULTIMATE.startENTRY havoc main_#res;havoc main_#t~ret0, main_~x~0, main_~y~0, main_~g~0;havoc main_~x~0;havoc main_~y~0;havoc main_~g~0;main_~x~0 := 63;main_~y~0 := 18;gcd_test_#in~a, gcd_test_#in~b := main_~x~0, main_~y~0;havoc gcd_test_#res;havoc gcd_test_~a, gcd_test_~b;gcd_test_~a := gcd_test_#in~a;gcd_test_~b := gcd_test_#in~b; 124#L12 assume !(gcd_test_~a < 0); 121#L12-2 assume !(gcd_test_~b < 0); 122#L13-1 assume !(0 == gcd_test_~a); 125#L20-2 assume !!(0 != gcd_test_~b); 128#L20 assume gcd_test_~a > gcd_test_~b;gcd_test_~a := gcd_test_~a - gcd_test_~b; 126#L20-2 assume !!(0 != gcd_test_~b); 127#L20 assume gcd_test_~a > gcd_test_~b;gcd_test_~a := gcd_test_~a - gcd_test_~b; 130#L20-2 [2020-07-29 01:42:08,788 INFO L796 eck$LassoCheckResult]: Loop: 130#L20-2 assume !!(0 != gcd_test_~b); 129#L20 assume !(gcd_test_~a > gcd_test_~b);gcd_test_~b := gcd_test_~b - gcd_test_~a; 130#L20-2 [2020-07-29 01:42:08,788 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 01:42:08,789 INFO L82 PathProgramCache]: Analyzing trace with hash 1326417906, now seen corresponding path program 2 times [2020-07-29 01:42:08,789 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 01:42:08,789 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1065396894] [2020-07-29 01:42:08,790 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 01:42:08,798 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 01:42:08,798 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 01:42:08,806 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 01:42:08,806 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 01:42:08,809 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-07-29 01:42:08,809 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 01:42:08,810 INFO L82 PathProgramCache]: Analyzing trace with hash 1830, now seen corresponding path program 3 times [2020-07-29 01:42:08,810 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 01:42:08,810 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [924259259] [2020-07-29 01:42:08,811 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 01:42:08,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 01:42:08,815 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 01:42:08,818 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 01:42:08,818 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 01:42:08,820 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-07-29 01:42:08,820 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 01:42:08,821 INFO L82 PathProgramCache]: Analyzing trace with hash -917678377, now seen corresponding path program 2 times [2020-07-29 01:42:08,821 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 01:42:08,821 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1371840882] [2020-07-29 01:42:08,822 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 01:42:08,830 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:42:08,915 INFO L280 TraceCheckUtils]: 0: Hoare triple {158#true} havoc main_#res;havoc main_#t~ret0, main_~x~0, main_~y~0, main_~g~0;havoc main_~x~0;havoc main_~y~0;havoc main_~g~0;main_~x~0 := 63;main_~y~0 := 18;gcd_test_#in~a, gcd_test_#in~b := main_~x~0, main_~y~0;havoc gcd_test_#res;havoc gcd_test_~a, gcd_test_~b;gcd_test_~a := gcd_test_#in~a;gcd_test_~b := gcd_test_#in~b; {160#(and (= 63 ULTIMATE.start_gcd_test_~a) (= 18 ULTIMATE.start_gcd_test_~b))} is VALID [2020-07-29 01:42:08,916 INFO L280 TraceCheckUtils]: 1: Hoare triple {160#(and (= 63 ULTIMATE.start_gcd_test_~a) (= 18 ULTIMATE.start_gcd_test_~b))} assume !(gcd_test_~a < 0); {160#(and (= 63 ULTIMATE.start_gcd_test_~a) (= 18 ULTIMATE.start_gcd_test_~b))} is VALID [2020-07-29 01:42:08,917 INFO L280 TraceCheckUtils]: 2: Hoare triple {160#(and (= 63 ULTIMATE.start_gcd_test_~a) (= 18 ULTIMATE.start_gcd_test_~b))} assume !(gcd_test_~b < 0); {160#(and (= 63 ULTIMATE.start_gcd_test_~a) (= 18 ULTIMATE.start_gcd_test_~b))} is VALID [2020-07-29 01:42:08,925 INFO L280 TraceCheckUtils]: 3: Hoare triple {160#(and (= 63 ULTIMATE.start_gcd_test_~a) (= 18 ULTIMATE.start_gcd_test_~b))} assume !(0 == gcd_test_~a); {160#(and (= 63 ULTIMATE.start_gcd_test_~a) (= 18 ULTIMATE.start_gcd_test_~b))} is VALID [2020-07-29 01:42:08,927 INFO L280 TraceCheckUtils]: 4: Hoare triple {160#(and (= 63 ULTIMATE.start_gcd_test_~a) (= 18 ULTIMATE.start_gcd_test_~b))} assume !!(0 != gcd_test_~b); {160#(and (= 63 ULTIMATE.start_gcd_test_~a) (= 18 ULTIMATE.start_gcd_test_~b))} is VALID [2020-07-29 01:42:08,928 INFO L280 TraceCheckUtils]: 5: Hoare triple {160#(and (= 63 ULTIMATE.start_gcd_test_~a) (= 18 ULTIMATE.start_gcd_test_~b))} assume gcd_test_~a > gcd_test_~b;gcd_test_~a := gcd_test_~a - gcd_test_~b; {161#(and (= 18 ULTIMATE.start_gcd_test_~b) (<= 63 (+ ULTIMATE.start_gcd_test_~b ULTIMATE.start_gcd_test_~a)))} is VALID [2020-07-29 01:42:08,929 INFO L280 TraceCheckUtils]: 6: Hoare triple {161#(and (= 18 ULTIMATE.start_gcd_test_~b) (<= 63 (+ ULTIMATE.start_gcd_test_~b ULTIMATE.start_gcd_test_~a)))} assume !!(0 != gcd_test_~b); {161#(and (= 18 ULTIMATE.start_gcd_test_~b) (<= 63 (+ ULTIMATE.start_gcd_test_~b ULTIMATE.start_gcd_test_~a)))} is VALID [2020-07-29 01:42:08,931 INFO L280 TraceCheckUtils]: 7: Hoare triple {161#(and (= 18 ULTIMATE.start_gcd_test_~b) (<= 63 (+ ULTIMATE.start_gcd_test_~b ULTIMATE.start_gcd_test_~a)))} assume gcd_test_~a > gcd_test_~b;gcd_test_~a := gcd_test_~a - gcd_test_~b; {162#(and (= 18 ULTIMATE.start_gcd_test_~b) (<= 63 (+ (* 2 ULTIMATE.start_gcd_test_~b) ULTIMATE.start_gcd_test_~a)))} is VALID [2020-07-29 01:42:08,932 INFO L280 TraceCheckUtils]: 8: Hoare triple {162#(and (= 18 ULTIMATE.start_gcd_test_~b) (<= 63 (+ (* 2 ULTIMATE.start_gcd_test_~b) ULTIMATE.start_gcd_test_~a)))} assume !!(0 != gcd_test_~b); {162#(and (= 18 ULTIMATE.start_gcd_test_~b) (<= 63 (+ (* 2 ULTIMATE.start_gcd_test_~b) ULTIMATE.start_gcd_test_~a)))} is VALID [2020-07-29 01:42:08,933 INFO L280 TraceCheckUtils]: 9: Hoare triple {162#(and (= 18 ULTIMATE.start_gcd_test_~b) (<= 63 (+ (* 2 ULTIMATE.start_gcd_test_~b) ULTIMATE.start_gcd_test_~a)))} assume !(gcd_test_~a > gcd_test_~b);gcd_test_~b := gcd_test_~b - gcd_test_~a; {159#false} is VALID [2020-07-29 01:42:08,934 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-29 01:42:08,935 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1371840882] [2020-07-29 01:42:08,935 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [668850645] [2020-07-29 01:42:08,935 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-07-29 01:42:08,965 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2020-07-29 01:42:08,965 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-07-29 01:42:08,966 INFO L263 TraceCheckSpWp]: Trace formula consists of 29 conjuncts, 9 conjunts are in the unsatisfiable core [2020-07-29 01:42:08,972 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:42:08,973 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-29 01:42:09,257 INFO L280 TraceCheckUtils]: 0: Hoare triple {158#true} havoc main_#res;havoc main_#t~ret0, main_~x~0, main_~y~0, main_~g~0;havoc main_~x~0;havoc main_~y~0;havoc main_~g~0;main_~x~0 := 63;main_~y~0 := 18;gcd_test_#in~a, gcd_test_#in~b := main_~x~0, main_~y~0;havoc gcd_test_#res;havoc gcd_test_~a, gcd_test_~b;gcd_test_~a := gcd_test_#in~a;gcd_test_~b := gcd_test_#in~b; {166#(and (<= ULTIMATE.start_gcd_test_~b 18) (<= 63 ULTIMATE.start_gcd_test_~a))} is VALID [2020-07-29 01:42:09,258 INFO L280 TraceCheckUtils]: 1: Hoare triple {166#(and (<= ULTIMATE.start_gcd_test_~b 18) (<= 63 ULTIMATE.start_gcd_test_~a))} assume !(gcd_test_~a < 0); {166#(and (<= ULTIMATE.start_gcd_test_~b 18) (<= 63 ULTIMATE.start_gcd_test_~a))} is VALID [2020-07-29 01:42:09,259 INFO L280 TraceCheckUtils]: 2: Hoare triple {166#(and (<= ULTIMATE.start_gcd_test_~b 18) (<= 63 ULTIMATE.start_gcd_test_~a))} assume !(gcd_test_~b < 0); {166#(and (<= ULTIMATE.start_gcd_test_~b 18) (<= 63 ULTIMATE.start_gcd_test_~a))} is VALID [2020-07-29 01:42:09,260 INFO L280 TraceCheckUtils]: 3: Hoare triple {166#(and (<= ULTIMATE.start_gcd_test_~b 18) (<= 63 ULTIMATE.start_gcd_test_~a))} assume !(0 == gcd_test_~a); {166#(and (<= ULTIMATE.start_gcd_test_~b 18) (<= 63 ULTIMATE.start_gcd_test_~a))} is VALID [2020-07-29 01:42:09,262 INFO L280 TraceCheckUtils]: 4: Hoare triple {166#(and (<= ULTIMATE.start_gcd_test_~b 18) (<= 63 ULTIMATE.start_gcd_test_~a))} assume !!(0 != gcd_test_~b); {166#(and (<= ULTIMATE.start_gcd_test_~b 18) (<= 63 ULTIMATE.start_gcd_test_~a))} is VALID [2020-07-29 01:42:09,263 INFO L280 TraceCheckUtils]: 5: Hoare triple {166#(and (<= ULTIMATE.start_gcd_test_~b 18) (<= 63 ULTIMATE.start_gcd_test_~a))} assume gcd_test_~a > gcd_test_~b;gcd_test_~a := gcd_test_~a - gcd_test_~b; {182#(and (<= ULTIMATE.start_gcd_test_~b 18) (<= 63 (+ ULTIMATE.start_gcd_test_~b ULTIMATE.start_gcd_test_~a)))} is VALID [2020-07-29 01:42:09,264 INFO L280 TraceCheckUtils]: 6: Hoare triple {182#(and (<= ULTIMATE.start_gcd_test_~b 18) (<= 63 (+ ULTIMATE.start_gcd_test_~b ULTIMATE.start_gcd_test_~a)))} assume !!(0 != gcd_test_~b); {182#(and (<= ULTIMATE.start_gcd_test_~b 18) (<= 63 (+ ULTIMATE.start_gcd_test_~b ULTIMATE.start_gcd_test_~a)))} is VALID [2020-07-29 01:42:09,266 INFO L280 TraceCheckUtils]: 7: Hoare triple {182#(and (<= ULTIMATE.start_gcd_test_~b 18) (<= 63 (+ ULTIMATE.start_gcd_test_~b ULTIMATE.start_gcd_test_~a)))} assume gcd_test_~a > gcd_test_~b;gcd_test_~a := gcd_test_~a - gcd_test_~b; {189#(and (<= ULTIMATE.start_gcd_test_~b 18) (<= 63 (+ (* 2 ULTIMATE.start_gcd_test_~b) ULTIMATE.start_gcd_test_~a)))} is VALID [2020-07-29 01:42:09,267 INFO L280 TraceCheckUtils]: 8: Hoare triple {189#(and (<= ULTIMATE.start_gcd_test_~b 18) (<= 63 (+ (* 2 ULTIMATE.start_gcd_test_~b) ULTIMATE.start_gcd_test_~a)))} assume !!(0 != gcd_test_~b); {189#(and (<= ULTIMATE.start_gcd_test_~b 18) (<= 63 (+ (* 2 ULTIMATE.start_gcd_test_~b) ULTIMATE.start_gcd_test_~a)))} is VALID [2020-07-29 01:42:09,268 INFO L280 TraceCheckUtils]: 9: Hoare triple {189#(and (<= ULTIMATE.start_gcd_test_~b 18) (<= 63 (+ (* 2 ULTIMATE.start_gcd_test_~b) ULTIMATE.start_gcd_test_~a)))} assume !(gcd_test_~a > gcd_test_~b);gcd_test_~b := gcd_test_~b - gcd_test_~a; {159#false} is VALID [2020-07-29 01:42:09,269 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-29 01:42:09,269 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-07-29 01:42:09,269 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3] total 6 [2020-07-29 01:42:09,270 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [729133916] [2020-07-29 01:42:09,291 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-29 01:42:09,292 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-07-29 01:42:09,292 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2020-07-29 01:42:09,292 INFO L87 Difference]: Start difference. First operand 10 states and 11 transitions. cyclomatic complexity: 2 Second operand 8 states. [2020-07-29 01:42:09,358 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-29 01:42:09,358 INFO L93 Difference]: Finished difference Result 12 states and 13 transitions. [2020-07-29 01:42:09,358 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-07-29 01:42:09,358 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 8 states. [2020-07-29 01:42:09,388 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 20 edges. 20 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-29 01:42:09,389 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 12 states and 13 transitions. [2020-07-29 01:42:09,390 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2020-07-29 01:42:09,391 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 12 states to 12 states and 13 transitions. [2020-07-29 01:42:09,392 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 12 [2020-07-29 01:42:09,392 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 12 [2020-07-29 01:42:09,392 INFO L73 IsDeterministic]: Start isDeterministic. Operand 12 states and 13 transitions. [2020-07-29 01:42:09,392 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-07-29 01:42:09,392 INFO L688 BuchiCegarLoop]: Abstraction has 12 states and 13 transitions. [2020-07-29 01:42:09,392 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12 states and 13 transitions. [2020-07-29 01:42:09,394 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12 to 12. [2020-07-29 01:42:09,394 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-29 01:42:09,395 INFO L82 GeneralOperation]: Start isEquivalent. First operand 12 states and 13 transitions. Second operand 12 states. [2020-07-29 01:42:09,395 INFO L74 IsIncluded]: Start isIncluded. First operand 12 states and 13 transitions. Second operand 12 states. [2020-07-29 01:42:09,395 INFO L87 Difference]: Start difference. First operand 12 states and 13 transitions. Second operand 12 states. [2020-07-29 01:42:09,396 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-29 01:42:09,397 INFO L93 Difference]: Finished difference Result 12 states and 13 transitions. [2020-07-29 01:42:09,397 INFO L276 IsEmpty]: Start isEmpty. Operand 12 states and 13 transitions. [2020-07-29 01:42:09,397 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-29 01:42:09,397 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-29 01:42:09,398 INFO L74 IsIncluded]: Start isIncluded. First operand 12 states. Second operand 12 states and 13 transitions. [2020-07-29 01:42:09,398 INFO L87 Difference]: Start difference. First operand 12 states. Second operand 12 states and 13 transitions. [2020-07-29 01:42:09,399 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-29 01:42:09,400 INFO L93 Difference]: Finished difference Result 12 states and 13 transitions. [2020-07-29 01:42:09,400 INFO L276 IsEmpty]: Start isEmpty. Operand 12 states and 13 transitions. [2020-07-29 01:42:09,400 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-29 01:42:09,400 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-29 01:42:09,401 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-29 01:42:09,401 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-29 01:42:09,401 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2020-07-29 01:42:09,402 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 13 transitions. [2020-07-29 01:42:09,402 INFO L711 BuchiCegarLoop]: Abstraction has 12 states and 13 transitions. [2020-07-29 01:42:09,403 INFO L591 BuchiCegarLoop]: Abstraction has 12 states and 13 transitions. [2020-07-29 01:42:09,403 INFO L424 BuchiCegarLoop]: ======== Iteration 4============ [2020-07-29 01:42:09,403 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 12 states and 13 transitions. [2020-07-29 01:42:09,404 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2020-07-29 01:42:09,404 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 01:42:09,404 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 01:42:09,405 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [3, 3, 1, 1, 1, 1] [2020-07-29 01:42:09,405 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2020-07-29 01:42:09,405 INFO L794 eck$LassoCheckResult]: Stem: 207#ULTIMATE.startENTRY havoc main_#res;havoc main_#t~ret0, main_~x~0, main_~y~0, main_~g~0;havoc main_~x~0;havoc main_~y~0;havoc main_~g~0;main_~x~0 := 63;main_~y~0 := 18;gcd_test_#in~a, gcd_test_#in~b := main_~x~0, main_~y~0;havoc gcd_test_#res;havoc gcd_test_~a, gcd_test_~b;gcd_test_~a := gcd_test_#in~a;gcd_test_~b := gcd_test_#in~b; 208#L12 assume !(gcd_test_~a < 0); 205#L12-2 assume !(gcd_test_~b < 0); 206#L13-1 assume !(0 == gcd_test_~a); 209#L20-2 assume !!(0 != gcd_test_~b); 212#L20 assume gcd_test_~a > gcd_test_~b;gcd_test_~a := gcd_test_~a - gcd_test_~b; 210#L20-2 assume !!(0 != gcd_test_~b); 211#L20 assume gcd_test_~a > gcd_test_~b;gcd_test_~a := gcd_test_~a - gcd_test_~b; 216#L20-2 assume !!(0 != gcd_test_~b); 215#L20 assume gcd_test_~a > gcd_test_~b;gcd_test_~a := gcd_test_~a - gcd_test_~b; 214#L20-2 [2020-07-29 01:42:09,406 INFO L796 eck$LassoCheckResult]: Loop: 214#L20-2 assume !!(0 != gcd_test_~b); 213#L20 assume !(gcd_test_~a > gcd_test_~b);gcd_test_~b := gcd_test_~b - gcd_test_~a; 214#L20-2 [2020-07-29 01:42:09,406 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 01:42:09,406 INFO L82 PathProgramCache]: Analyzing trace with hash -917678379, now seen corresponding path program 3 times [2020-07-29 01:42:09,407 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 01:42:09,407 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1650563527] [2020-07-29 01:42:09,407 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 01:42:09,417 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 01:42:09,418 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 01:42:09,426 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 01:42:09,427 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 01:42:09,430 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-07-29 01:42:09,431 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 01:42:09,431 INFO L82 PathProgramCache]: Analyzing trace with hash 1830, now seen corresponding path program 4 times [2020-07-29 01:42:09,431 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 01:42:09,432 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [719954976] [2020-07-29 01:42:09,432 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 01:42:09,435 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 01:42:09,436 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 01:42:09,438 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 01:42:09,439 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 01:42:09,440 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-07-29 01:42:09,441 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 01:42:09,441 INFO L82 PathProgramCache]: Analyzing trace with hash -1420625670, now seen corresponding path program 3 times [2020-07-29 01:42:09,441 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 01:42:09,442 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [435311755] [2020-07-29 01:42:09,442 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 01:42:09,452 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 01:42:09,452 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 01:42:09,462 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 01:42:09,462 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 01:42:09,465 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-07-29 01:42:09,613 INFO L210 LassoAnalysis]: Preferences: [2020-07-29 01:42:09,614 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2020-07-29 01:42:09,614 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2020-07-29 01:42:09,614 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2020-07-29 01:42:09,616 INFO L129 ssoRankerPreferences]: Use exernal solver: true [2020-07-29 01:42:09,616 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:42:09,616 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2020-07-29 01:42:09,616 INFO L132 ssoRankerPreferences]: Path of dumped script: [2020-07-29 01:42:09,617 INFO L133 ssoRankerPreferences]: Filename of dumped script: gcd_4.c_Iteration4_Lasso [2020-07-29 01:42:09,617 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2020-07-29 01:42:09,617 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2020-07-29 01:42:09,654 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 01:42:09,692 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 01:42:09,697 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 01:42:09,701 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 01:42:09,707 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 01:42:09,932 INFO L292 LassoAnalysis]: Preprocessing complete. [2020-07-29 01:42:09,933 INFO L404 LassoAnalysis]: Checking for nontermination... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2020-07-29 01:42:09,951 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2020-07-29 01:42:09,951 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 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:42:10,002 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2020-07-29 01:42:10,002 INFO L160 nArgumentSynthesizer]: Using integer mode. [2020-07-29 01:42:10,325 INFO L444 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2020-07-29 01:42:10,331 INFO L210 LassoAnalysis]: Preferences: [2020-07-29 01:42:10,331 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2020-07-29 01:42:10,331 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2020-07-29 01:42:10,331 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2020-07-29 01:42:10,332 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2020-07-29 01:42:10,332 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:42:10,332 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2020-07-29 01:42:10,332 INFO L132 ssoRankerPreferences]: Path of dumped script: [2020-07-29 01:42:10,332 INFO L133 ssoRankerPreferences]: Filename of dumped script: gcd_4.c_Iteration4_Lasso [2020-07-29 01:42:10,332 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2020-07-29 01:42:10,332 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2020-07-29 01:42:10,346 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 01:42:10,350 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 01:42:10,375 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 01:42:10,379 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 01:42:10,386 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 01:42:10,582 INFO L292 LassoAnalysis]: Preprocessing complete. [2020-07-29 01:42:10,588 INFO L489 LassoAnalysis]: Using template 'affine'. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 6 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:42:10,619 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 [2020-07-29 01:42:10,621 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 01:42:10,622 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-07-29 01:42:10,622 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 01:42:10,622 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 01:42:10,622 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 01:42:10,624 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-07-29 01:42:10,624 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-07-29 01:42:10,627 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 7 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:42:10,654 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 [2020-07-29 01:42:10,656 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 01:42:10,656 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 01:42:10,656 INFO L204 nArgumentSynthesizer]: 2 loop disjuncts [2020-07-29 01:42:10,656 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 01:42:10,676 INFO L401 nArgumentSynthesizer]: We have 16 Motzkin's Theorem applications. [2020-07-29 01:42:10,676 INFO L402 nArgumentSynthesizer]: A total of 4 supporting invariants were added. [2020-07-29 01:42:10,708 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2020-07-29 01:42:10,766 INFO L443 ModelExtractionUtils]: Simplification made 12 calls to the SMT solver. [2020-07-29 01:42:10,766 INFO L444 ModelExtractionUtils]: 23 out of 36 variables were initially zero. Simplification set additionally 7 variables to zero. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 8 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2020-07-29 01:42:10,785 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... Waiting until toolchain timeout for monitored process 8 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:42:10,793 INFO L438 nArgumentSynthesizer]: Removed 3 redundant supporting invariants from a total of 4. [2020-07-29 01:42:10,793 INFO L510 LassoAnalysis]: Proved termination. [2020-07-29 01:42:10,794 INFO L512 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_gcd_test_~b) = 1*ULTIMATE.start_gcd_test_~b Supporting invariants [1*ULTIMATE.start_gcd_test_~a - 2 >= 0] [2020-07-29 01:42:10,842 INFO L297 tatePredicateManager]: 0 out of 1 supporting invariants were superfluous and have been removed [2020-07-29 01:42:10,848 INFO L393 LassoCheck]: Loop: "assume !!(0 != gcd_test_~b);" "assume !(gcd_test_~a > gcd_test_~b);gcd_test_~b := gcd_test_~b - gcd_test_~a;" [2020-07-29 01:42:10,852 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:42:10,887 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 01:42:10,895 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:42:10,896 INFO L263 TraceCheckSpWp]: Trace formula consists of 29 conjuncts, 11 conjunts are in the unsatisfiable core [2020-07-29 01:42:10,902 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:42:10,904 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-29 01:42:11,109 INFO L280 TraceCheckUtils]: 0: Hoare triple {250#unseeded} havoc main_#res;havoc main_#t~ret0, main_~x~0, main_~y~0, main_~g~0;havoc main_~x~0;havoc main_~y~0;havoc main_~g~0;main_~x~0 := 63;main_~y~0 := 18;gcd_test_#in~a, gcd_test_#in~b := main_~x~0, main_~y~0;havoc gcd_test_#res;havoc gcd_test_~a, gcd_test_~b;gcd_test_~a := gcd_test_#in~a;gcd_test_~b := gcd_test_#in~b; {278#(and (<= ULTIMATE.start_gcd_test_~b 18) unseeded (<= 63 ULTIMATE.start_gcd_test_~a))} is VALID [2020-07-29 01:42:11,110 INFO L280 TraceCheckUtils]: 1: Hoare triple {278#(and (<= ULTIMATE.start_gcd_test_~b 18) unseeded (<= 63 ULTIMATE.start_gcd_test_~a))} assume !(gcd_test_~a < 0); {278#(and (<= ULTIMATE.start_gcd_test_~b 18) unseeded (<= 63 ULTIMATE.start_gcd_test_~a))} is VALID [2020-07-29 01:42:11,111 INFO L280 TraceCheckUtils]: 2: Hoare triple {278#(and (<= ULTIMATE.start_gcd_test_~b 18) unseeded (<= 63 ULTIMATE.start_gcd_test_~a))} assume !(gcd_test_~b < 0); {278#(and (<= ULTIMATE.start_gcd_test_~b 18) unseeded (<= 63 ULTIMATE.start_gcd_test_~a))} is VALID [2020-07-29 01:42:11,112 INFO L280 TraceCheckUtils]: 3: Hoare triple {278#(and (<= ULTIMATE.start_gcd_test_~b 18) unseeded (<= 63 ULTIMATE.start_gcd_test_~a))} assume !(0 == gcd_test_~a); {278#(and (<= ULTIMATE.start_gcd_test_~b 18) unseeded (<= 63 ULTIMATE.start_gcd_test_~a))} is VALID [2020-07-29 01:42:11,113 INFO L280 TraceCheckUtils]: 4: Hoare triple {278#(and (<= ULTIMATE.start_gcd_test_~b 18) unseeded (<= 63 ULTIMATE.start_gcd_test_~a))} assume !!(0 != gcd_test_~b); {278#(and (<= ULTIMATE.start_gcd_test_~b 18) unseeded (<= 63 ULTIMATE.start_gcd_test_~a))} is VALID [2020-07-29 01:42:11,115 INFO L280 TraceCheckUtils]: 5: Hoare triple {278#(and (<= ULTIMATE.start_gcd_test_~b 18) unseeded (<= 63 ULTIMATE.start_gcd_test_~a))} assume gcd_test_~a > gcd_test_~b;gcd_test_~a := gcd_test_~a - gcd_test_~b; {294#(and (<= ULTIMATE.start_gcd_test_~b 18) (<= 63 (+ ULTIMATE.start_gcd_test_~b ULTIMATE.start_gcd_test_~a)) unseeded)} is VALID [2020-07-29 01:42:11,116 INFO L280 TraceCheckUtils]: 6: Hoare triple {294#(and (<= ULTIMATE.start_gcd_test_~b 18) (<= 63 (+ ULTIMATE.start_gcd_test_~b ULTIMATE.start_gcd_test_~a)) unseeded)} assume !!(0 != gcd_test_~b); {294#(and (<= ULTIMATE.start_gcd_test_~b 18) (<= 63 (+ ULTIMATE.start_gcd_test_~b ULTIMATE.start_gcd_test_~a)) unseeded)} is VALID [2020-07-29 01:42:11,117 INFO L280 TraceCheckUtils]: 7: Hoare triple {294#(and (<= ULTIMATE.start_gcd_test_~b 18) (<= 63 (+ ULTIMATE.start_gcd_test_~b ULTIMATE.start_gcd_test_~a)) unseeded)} assume gcd_test_~a > gcd_test_~b;gcd_test_~a := gcd_test_~a - gcd_test_~b; {301#(and (<= ULTIMATE.start_gcd_test_~b 18) (<= 63 (+ (* 2 ULTIMATE.start_gcd_test_~b) ULTIMATE.start_gcd_test_~a)) unseeded)} is VALID [2020-07-29 01:42:11,118 INFO L280 TraceCheckUtils]: 8: Hoare triple {301#(and (<= ULTIMATE.start_gcd_test_~b 18) (<= 63 (+ (* 2 ULTIMATE.start_gcd_test_~b) ULTIMATE.start_gcd_test_~a)) unseeded)} assume !!(0 != gcd_test_~b); {301#(and (<= ULTIMATE.start_gcd_test_~b 18) (<= 63 (+ (* 2 ULTIMATE.start_gcd_test_~b) ULTIMATE.start_gcd_test_~a)) unseeded)} is VALID [2020-07-29 01:42:11,119 INFO L280 TraceCheckUtils]: 9: Hoare triple {301#(and (<= ULTIMATE.start_gcd_test_~b 18) (<= 63 (+ (* 2 ULTIMATE.start_gcd_test_~b) ULTIMATE.start_gcd_test_~a)) unseeded)} assume gcd_test_~a > gcd_test_~b;gcd_test_~a := gcd_test_~a - gcd_test_~b; {269#(and (>= (+ ULTIMATE.start_gcd_test_~a (- 2)) 0) unseeded)} is VALID [2020-07-29 01:42:11,123 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:42:11,124 WARN L261 TraceCheckSpWp]: Trace formula consists of 7 conjuncts, 5 conjunts are in the unsatisfiable core [2020-07-29 01:42:11,127 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:42:11,127 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-29 01:42:11,130 INFO L280 TraceCheckUtils]: 0: Hoare triple {270#(and (>= oldRank0 ULTIMATE.start_gcd_test_~b) (>= (+ ULTIMATE.start_gcd_test_~a (- 2)) 0))} assume !!(0 != gcd_test_~b); {270#(and (>= oldRank0 ULTIMATE.start_gcd_test_~b) (>= (+ ULTIMATE.start_gcd_test_~a (- 2)) 0))} is VALID [2020-07-29 01:42:11,132 INFO L280 TraceCheckUtils]: 1: Hoare triple {270#(and (>= oldRank0 ULTIMATE.start_gcd_test_~b) (>= (+ ULTIMATE.start_gcd_test_~a (- 2)) 0))} assume !(gcd_test_~a > gcd_test_~b);gcd_test_~b := gcd_test_~b - gcd_test_~a; {272#(and (>= (+ ULTIMATE.start_gcd_test_~a (- 2)) 0) (or (and (> oldRank0 ULTIMATE.start_gcd_test_~b) (>= oldRank0 0)) unseeded))} is VALID [2020-07-29 01:42:11,132 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-29 01:42:11,133 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states. [2020-07-29 01:42:11,151 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 12 edges. 12 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-29 01:42:11,153 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states. Stem has 10 letters. Loop has 2 letters. [2020-07-29 01:42:11,154 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:42:11,158 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.4 stem predicates 1 loop predicates [2020-07-29 01:42:11,159 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 12 states and 13 transitions. cyclomatic complexity: 2 Second operand 6 states. [2020-07-29 01:42:11,289 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 12 states and 13 transitions. cyclomatic complexity: 2. Second operand 6 states. Result 13 states and 14 transitions. Complement of second has 6 states. [2020-07-29 01:42:11,289 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 2 stem states 1 non-accepting loop states 1 accepting loop states [2020-07-29 01:42:11,289 INFO L123 tractBuchiDifference]: Start testing correctness of buchiDifferenceNCSBLazy3 [2020-07-29 01:42:11,289 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 12 states and 13 transitions. cyclomatic complexity: 2 [2020-07-29 01:42:11,290 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 01:42:11,290 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 01:42:11,290 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 6 states. [2020-07-29 01:42:11,299 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2020-07-29 01:42:11,299 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2020-07-29 01:42:11,299 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 13 states and 14 transitions. [2020-07-29 01:42:11,300 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2020-07-29 01:42:11,302 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 01:42:11,302 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 01:42:11,305 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 12 states and 13 transitions. cyclomatic complexity: 2 [2020-07-29 01:42:11,306 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 2 examples of accepted words. [2020-07-29 01:42:11,306 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 6 states. [2020-07-29 01:42:11,307 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2020-07-29 01:42:11,309 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 4 states and 7 transitions. cyclomatic complexity: 4 [2020-07-29 01:42:11,311 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2020-07-29 01:42:11,312 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 0 examples of accepted words. [2020-07-29 01:42:11,312 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 13 states and 14 transitions. cyclomatic complexity: 2 [2020-07-29 01:42:11,312 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 2 examples of accepted words. [2020-07-29 01:42:11,313 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 12 states and 13 transitions. cyclomatic complexity: 2 Stem has 10 letters. Loop has 2 letters. [2020-07-29 01:42:11,313 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:42:11,313 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states. Stem has 10 letters. Loop has 2 letters. [2020-07-29 01:42:11,316 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:42:11,317 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 13 states and 14 transitions. cyclomatic complexity: 2 Stem has 10 letters. Loop has 2 letters. [2020-07-29 01:42:11,317 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:42:11,317 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 12 states and 13 transitions. cyclomatic complexity: 2 Stem has 10 letters. Loop has 2 letters. [2020-07-29 01:42:11,317 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:42:11,317 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states. Stem has 10 letters. Loop has 2 letters. [2020-07-29 01:42:11,318 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:42:11,318 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 13 states and 14 transitions. cyclomatic complexity: 2 Stem has 10 letters. Loop has 2 letters. [2020-07-29 01:42:11,318 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:42:11,318 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 12 states and 13 transitions. cyclomatic complexity: 2 Stem has 13 letters. Loop has 13 letters. [2020-07-29 01:42:11,319 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:42:11,319 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states. Stem has 13 letters. Loop has 13 letters. [2020-07-29 01:42:11,319 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:42:11,319 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 13 states and 14 transitions. cyclomatic complexity: 2 Stem has 13 letters. Loop has 13 letters. [2020-07-29 01:42:11,320 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:42:11,320 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 12 states and 13 transitions. cyclomatic complexity: 2 Stem has 12 letters. Loop has 12 letters. [2020-07-29 01:42:11,320 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:42:11,320 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states. Stem has 12 letters. Loop has 12 letters. [2020-07-29 01:42:11,320 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:42:11,320 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 13 states and 14 transitions. cyclomatic complexity: 2 Stem has 12 letters. Loop has 12 letters. [2020-07-29 01:42:11,320 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:42:11,321 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 12 states and 13 transitions. cyclomatic complexity: 2 Stem has 4 letters. Loop has 4 letters. [2020-07-29 01:42:11,321 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:42:11,321 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states. Stem has 4 letters. Loop has 4 letters. [2020-07-29 01:42:11,323 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:42:11,323 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 13 states and 14 transitions. cyclomatic complexity: 2 Stem has 4 letters. Loop has 4 letters. [2020-07-29 01:42:11,323 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:42:11,323 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 12 states and 13 transitions. cyclomatic complexity: 2 Stem has 11 letters. Loop has 2 letters. [2020-07-29 01:42:11,324 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:42:11,324 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states. Stem has 11 letters. Loop has 2 letters. [2020-07-29 01:42:11,324 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:42:11,324 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 13 states and 14 transitions. cyclomatic complexity: 2 Stem has 11 letters. Loop has 2 letters. [2020-07-29 01:42:11,325 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:42:11,325 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 12 states and 13 transitions. cyclomatic complexity: 2 Stem has 10 letters. Loop has 2 letters. [2020-07-29 01:42:11,325 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:42:11,325 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states. Stem has 10 letters. Loop has 2 letters. [2020-07-29 01:42:11,325 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:42:11,326 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 13 states and 14 transitions. cyclomatic complexity: 2 Stem has 10 letters. Loop has 2 letters. [2020-07-29 01:42:11,326 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:42:11,326 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 12 states and 13 transitions. cyclomatic complexity: 2 Stem has 10 letters. Loop has 2 letters. [2020-07-29 01:42:11,326 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:42:11,326 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states. Stem has 10 letters. Loop has 2 letters. [2020-07-29 01:42:11,326 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:42:11,327 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 13 states and 14 transitions. cyclomatic complexity: 2 Stem has 10 letters. Loop has 2 letters. [2020-07-29 01:42:11,327 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:42:11,327 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 12 states and 13 transitions. cyclomatic complexity: 2 Stem has 11 letters. Loop has 2 letters. [2020-07-29 01:42:11,329 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:42:11,329 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states. Stem has 11 letters. Loop has 2 letters. [2020-07-29 01:42:11,329 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:42:11,329 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 13 states and 14 transitions. cyclomatic complexity: 2 Stem has 11 letters. Loop has 2 letters. [2020-07-29 01:42:11,329 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:42:11,329 INFO L161 tractBuchiDifference]: Finished testing correctness of buchiDifferenceNCSBLazy3 [2020-07-29 01:42:11,330 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2020-07-29 01:42:11,332 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 7 transitions. [2020-07-29 01:42:11,332 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 7 transitions. Stem has 10 letters. Loop has 2 letters. [2020-07-29 01:42:11,332 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:42:11,332 INFO L639 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2020-07-29 01:42:11,361 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 01:42:11,369 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:42:11,370 INFO L263 TraceCheckSpWp]: Trace formula consists of 29 conjuncts, 11 conjunts are in the unsatisfiable core [2020-07-29 01:42:11,378 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:42:11,379 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-29 01:42:11,611 INFO L280 TraceCheckUtils]: 0: Hoare triple {250#unseeded} havoc main_#res;havoc main_#t~ret0, main_~x~0, main_~y~0, main_~g~0;havoc main_~x~0;havoc main_~y~0;havoc main_~g~0;main_~x~0 := 63;main_~y~0 := 18;gcd_test_#in~a, gcd_test_#in~b := main_~x~0, main_~y~0;havoc gcd_test_#res;havoc gcd_test_~a, gcd_test_~b;gcd_test_~a := gcd_test_#in~a;gcd_test_~b := gcd_test_#in~b; {340#(and (<= ULTIMATE.start_gcd_test_~b 18) unseeded (<= 63 ULTIMATE.start_gcd_test_~a))} is VALID [2020-07-29 01:42:11,612 INFO L280 TraceCheckUtils]: 1: Hoare triple {340#(and (<= ULTIMATE.start_gcd_test_~b 18) unseeded (<= 63 ULTIMATE.start_gcd_test_~a))} assume !(gcd_test_~a < 0); {340#(and (<= ULTIMATE.start_gcd_test_~b 18) unseeded (<= 63 ULTIMATE.start_gcd_test_~a))} is VALID [2020-07-29 01:42:11,613 INFO L280 TraceCheckUtils]: 2: Hoare triple {340#(and (<= ULTIMATE.start_gcd_test_~b 18) unseeded (<= 63 ULTIMATE.start_gcd_test_~a))} assume !(gcd_test_~b < 0); {340#(and (<= ULTIMATE.start_gcd_test_~b 18) unseeded (<= 63 ULTIMATE.start_gcd_test_~a))} is VALID [2020-07-29 01:42:11,614 INFO L280 TraceCheckUtils]: 3: Hoare triple {340#(and (<= ULTIMATE.start_gcd_test_~b 18) unseeded (<= 63 ULTIMATE.start_gcd_test_~a))} assume !(0 == gcd_test_~a); {340#(and (<= ULTIMATE.start_gcd_test_~b 18) unseeded (<= 63 ULTIMATE.start_gcd_test_~a))} is VALID [2020-07-29 01:42:11,614 INFO L280 TraceCheckUtils]: 4: Hoare triple {340#(and (<= ULTIMATE.start_gcd_test_~b 18) unseeded (<= 63 ULTIMATE.start_gcd_test_~a))} assume !!(0 != gcd_test_~b); {340#(and (<= ULTIMATE.start_gcd_test_~b 18) unseeded (<= 63 ULTIMATE.start_gcd_test_~a))} is VALID [2020-07-29 01:42:11,615 INFO L280 TraceCheckUtils]: 5: Hoare triple {340#(and (<= ULTIMATE.start_gcd_test_~b 18) unseeded (<= 63 ULTIMATE.start_gcd_test_~a))} assume gcd_test_~a > gcd_test_~b;gcd_test_~a := gcd_test_~a - gcd_test_~b; {356#(and (<= ULTIMATE.start_gcd_test_~b 18) (<= 63 (+ ULTIMATE.start_gcd_test_~b ULTIMATE.start_gcd_test_~a)) unseeded)} is VALID [2020-07-29 01:42:11,616 INFO L280 TraceCheckUtils]: 6: Hoare triple {356#(and (<= ULTIMATE.start_gcd_test_~b 18) (<= 63 (+ ULTIMATE.start_gcd_test_~b ULTIMATE.start_gcd_test_~a)) unseeded)} assume !!(0 != gcd_test_~b); {356#(and (<= ULTIMATE.start_gcd_test_~b 18) (<= 63 (+ ULTIMATE.start_gcd_test_~b ULTIMATE.start_gcd_test_~a)) unseeded)} is VALID [2020-07-29 01:42:11,619 INFO L280 TraceCheckUtils]: 7: Hoare triple {356#(and (<= ULTIMATE.start_gcd_test_~b 18) (<= 63 (+ ULTIMATE.start_gcd_test_~b ULTIMATE.start_gcd_test_~a)) unseeded)} assume gcd_test_~a > gcd_test_~b;gcd_test_~a := gcd_test_~a - gcd_test_~b; {363#(and (<= ULTIMATE.start_gcd_test_~b 18) (<= 63 (+ (* 2 ULTIMATE.start_gcd_test_~b) ULTIMATE.start_gcd_test_~a)) unseeded)} is VALID [2020-07-29 01:42:11,620 INFO L280 TraceCheckUtils]: 8: Hoare triple {363#(and (<= ULTIMATE.start_gcd_test_~b 18) (<= 63 (+ (* 2 ULTIMATE.start_gcd_test_~b) ULTIMATE.start_gcd_test_~a)) unseeded)} assume !!(0 != gcd_test_~b); {363#(and (<= ULTIMATE.start_gcd_test_~b 18) (<= 63 (+ (* 2 ULTIMATE.start_gcd_test_~b) ULTIMATE.start_gcd_test_~a)) unseeded)} is VALID [2020-07-29 01:42:11,621 INFO L280 TraceCheckUtils]: 9: Hoare triple {363#(and (<= ULTIMATE.start_gcd_test_~b 18) (<= 63 (+ (* 2 ULTIMATE.start_gcd_test_~b) ULTIMATE.start_gcd_test_~a)) unseeded)} assume gcd_test_~a > gcd_test_~b;gcd_test_~a := gcd_test_~a - gcd_test_~b; {269#(and (>= (+ ULTIMATE.start_gcd_test_~a (- 2)) 0) unseeded)} is VALID [2020-07-29 01:42:11,627 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:42:11,627 WARN L261 TraceCheckSpWp]: Trace formula consists of 7 conjuncts, 5 conjunts are in the unsatisfiable core [2020-07-29 01:42:11,630 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:42:11,631 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-29 01:42:11,638 INFO L280 TraceCheckUtils]: 0: Hoare triple {270#(and (>= oldRank0 ULTIMATE.start_gcd_test_~b) (>= (+ ULTIMATE.start_gcd_test_~a (- 2)) 0))} assume !!(0 != gcd_test_~b); {270#(and (>= oldRank0 ULTIMATE.start_gcd_test_~b) (>= (+ ULTIMATE.start_gcd_test_~a (- 2)) 0))} is VALID [2020-07-29 01:42:11,639 INFO L280 TraceCheckUtils]: 1: Hoare triple {270#(and (>= oldRank0 ULTIMATE.start_gcd_test_~b) (>= (+ ULTIMATE.start_gcd_test_~a (- 2)) 0))} assume !(gcd_test_~a > gcd_test_~b);gcd_test_~b := gcd_test_~b - gcd_test_~a; {272#(and (>= (+ ULTIMATE.start_gcd_test_~a (- 2)) 0) (or (and (> oldRank0 ULTIMATE.start_gcd_test_~b) (>= oldRank0 0)) unseeded))} is VALID [2020-07-29 01:42:11,639 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-29 01:42:11,640 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states. [2020-07-29 01:42:11,656 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 12 edges. 12 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-29 01:42:11,656 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states. Stem has 10 letters. Loop has 2 letters. [2020-07-29 01:42:11,656 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:42:11,657 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and with honda bouncer for loop.4 stem predicates 1 loop predicates [2020-07-29 01:42:11,657 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 12 states and 13 transitions. cyclomatic complexity: 2 Second operand 6 states. [2020-07-29 01:42:11,756 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 12 states and 13 transitions. cyclomatic complexity: 2. Second operand 6 states. Result 13 states and 14 transitions. Complement of second has 6 states. [2020-07-29 01:42:11,756 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 2 stem states 1 non-accepting loop states 1 accepting loop states [2020-07-29 01:42:11,756 INFO L123 tractBuchiDifference]: Start testing correctness of buchiDifferenceNCSBLazy3 [2020-07-29 01:42:11,757 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 12 states and 13 transitions. cyclomatic complexity: 2 [2020-07-29 01:42:11,757 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 01:42:11,757 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 01:42:11,757 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 6 states. [2020-07-29 01:42:11,759 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2020-07-29 01:42:11,759 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2020-07-29 01:42:11,760 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 13 states and 14 transitions. [2020-07-29 01:42:11,760 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2020-07-29 01:42:11,761 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 01:42:11,761 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 01:42:11,762 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 12 states and 13 transitions. cyclomatic complexity: 2 [2020-07-29 01:42:11,762 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 2 examples of accepted words. [2020-07-29 01:42:11,762 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 6 states. [2020-07-29 01:42:11,763 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2020-07-29 01:42:11,763 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 4 states and 7 transitions. cyclomatic complexity: 4 [2020-07-29 01:42:11,763 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2020-07-29 01:42:11,764 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 0 examples of accepted words. [2020-07-29 01:42:11,764 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 13 states and 14 transitions. cyclomatic complexity: 2 [2020-07-29 01:42:11,765 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 2 examples of accepted words. [2020-07-29 01:42:11,766 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 12 states and 13 transitions. cyclomatic complexity: 2 Stem has 10 letters. Loop has 2 letters. [2020-07-29 01:42:11,766 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:42:11,766 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states. Stem has 10 letters. Loop has 2 letters. [2020-07-29 01:42:11,766 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:42:11,767 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 13 states and 14 transitions. cyclomatic complexity: 2 Stem has 10 letters. Loop has 2 letters. [2020-07-29 01:42:11,767 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:42:11,767 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 12 states and 13 transitions. cyclomatic complexity: 2 Stem has 10 letters. Loop has 2 letters. [2020-07-29 01:42:11,767 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:42:11,768 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states. Stem has 10 letters. Loop has 2 letters. [2020-07-29 01:42:11,768 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:42:11,768 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 13 states and 14 transitions. cyclomatic complexity: 2 Stem has 10 letters. Loop has 2 letters. [2020-07-29 01:42:11,768 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:42:11,769 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 12 states and 13 transitions. cyclomatic complexity: 2 Stem has 13 letters. Loop has 13 letters. [2020-07-29 01:42:11,769 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:42:11,769 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states. Stem has 13 letters. Loop has 13 letters. [2020-07-29 01:42:11,769 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:42:11,770 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 13 states and 14 transitions. cyclomatic complexity: 2 Stem has 13 letters. Loop has 13 letters. [2020-07-29 01:42:11,770 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:42:11,770 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 12 states and 13 transitions. cyclomatic complexity: 2 Stem has 12 letters. Loop has 12 letters. [2020-07-29 01:42:11,770 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:42:11,770 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states. Stem has 12 letters. Loop has 12 letters. [2020-07-29 01:42:11,770 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:42:11,771 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 13 states and 14 transitions. cyclomatic complexity: 2 Stem has 12 letters. Loop has 12 letters. [2020-07-29 01:42:11,771 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:42:11,771 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 12 states and 13 transitions. cyclomatic complexity: 2 Stem has 4 letters. Loop has 4 letters. [2020-07-29 01:42:11,771 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:42:11,771 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states. Stem has 4 letters. Loop has 4 letters. [2020-07-29 01:42:11,772 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:42:11,772 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 13 states and 14 transitions. cyclomatic complexity: 2 Stem has 4 letters. Loop has 4 letters. [2020-07-29 01:42:11,772 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:42:11,772 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 12 states and 13 transitions. cyclomatic complexity: 2 Stem has 11 letters. Loop has 2 letters. [2020-07-29 01:42:11,772 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:42:11,773 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states. Stem has 11 letters. Loop has 2 letters. [2020-07-29 01:42:11,773 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:42:11,773 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 13 states and 14 transitions. cyclomatic complexity: 2 Stem has 11 letters. Loop has 2 letters. [2020-07-29 01:42:11,773 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:42:11,773 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 12 states and 13 transitions. cyclomatic complexity: 2 Stem has 10 letters. Loop has 2 letters. [2020-07-29 01:42:11,774 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:42:11,774 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states. Stem has 10 letters. Loop has 2 letters. [2020-07-29 01:42:11,775 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:42:11,775 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 13 states and 14 transitions. cyclomatic complexity: 2 Stem has 10 letters. Loop has 2 letters. [2020-07-29 01:42:11,775 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:42:11,775 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 12 states and 13 transitions. cyclomatic complexity: 2 Stem has 10 letters. Loop has 2 letters. [2020-07-29 01:42:11,775 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:42:11,776 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states. Stem has 10 letters. Loop has 2 letters. [2020-07-29 01:42:11,777 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:42:11,778 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 13 states and 14 transitions. cyclomatic complexity: 2 Stem has 10 letters. Loop has 2 letters. [2020-07-29 01:42:11,778 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:42:11,778 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 12 states and 13 transitions. cyclomatic complexity: 2 Stem has 11 letters. Loop has 2 letters. [2020-07-29 01:42:11,778 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:42:11,779 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states. Stem has 11 letters. Loop has 2 letters. [2020-07-29 01:42:11,779 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:42:11,779 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 13 states and 14 transitions. cyclomatic complexity: 2 Stem has 11 letters. Loop has 2 letters. [2020-07-29 01:42:11,779 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:42:11,779 INFO L161 tractBuchiDifference]: Finished testing correctness of buchiDifferenceNCSBLazy3 [2020-07-29 01:42:11,780 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2020-07-29 01:42:11,781 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 7 transitions. [2020-07-29 01:42:11,781 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 7 transitions. Stem has 10 letters. Loop has 2 letters. [2020-07-29 01:42:11,781 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:42:11,781 INFO L639 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2020-07-29 01:42:11,802 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 01:42:11,809 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:42:11,810 INFO L263 TraceCheckSpWp]: Trace formula consists of 29 conjuncts, 11 conjunts are in the unsatisfiable core [2020-07-29 01:42:11,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:42:11,815 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-29 01:42:12,022 INFO L280 TraceCheckUtils]: 0: Hoare triple {250#unseeded} havoc main_#res;havoc main_#t~ret0, main_~x~0, main_~y~0, main_~g~0;havoc main_~x~0;havoc main_~y~0;havoc main_~g~0;main_~x~0 := 63;main_~y~0 := 18;gcd_test_#in~a, gcd_test_#in~b := main_~x~0, main_~y~0;havoc gcd_test_#res;havoc gcd_test_~a, gcd_test_~b;gcd_test_~a := gcd_test_#in~a;gcd_test_~b := gcd_test_#in~b; {402#(and (<= ULTIMATE.start_gcd_test_~b 18) unseeded (<= 63 ULTIMATE.start_gcd_test_~a))} is VALID [2020-07-29 01:42:12,023 INFO L280 TraceCheckUtils]: 1: Hoare triple {402#(and (<= ULTIMATE.start_gcd_test_~b 18) unseeded (<= 63 ULTIMATE.start_gcd_test_~a))} assume !(gcd_test_~a < 0); {402#(and (<= ULTIMATE.start_gcd_test_~b 18) unseeded (<= 63 ULTIMATE.start_gcd_test_~a))} is VALID [2020-07-29 01:42:12,024 INFO L280 TraceCheckUtils]: 2: Hoare triple {402#(and (<= ULTIMATE.start_gcd_test_~b 18) unseeded (<= 63 ULTIMATE.start_gcd_test_~a))} assume !(gcd_test_~b < 0); {402#(and (<= ULTIMATE.start_gcd_test_~b 18) unseeded (<= 63 ULTIMATE.start_gcd_test_~a))} is VALID [2020-07-29 01:42:12,028 INFO L280 TraceCheckUtils]: 3: Hoare triple {402#(and (<= ULTIMATE.start_gcd_test_~b 18) unseeded (<= 63 ULTIMATE.start_gcd_test_~a))} assume !(0 == gcd_test_~a); {402#(and (<= ULTIMATE.start_gcd_test_~b 18) unseeded (<= 63 ULTIMATE.start_gcd_test_~a))} is VALID [2020-07-29 01:42:12,029 INFO L280 TraceCheckUtils]: 4: Hoare triple {402#(and (<= ULTIMATE.start_gcd_test_~b 18) unseeded (<= 63 ULTIMATE.start_gcd_test_~a))} assume !!(0 != gcd_test_~b); {402#(and (<= ULTIMATE.start_gcd_test_~b 18) unseeded (<= 63 ULTIMATE.start_gcd_test_~a))} is VALID [2020-07-29 01:42:12,030 INFO L280 TraceCheckUtils]: 5: Hoare triple {402#(and (<= ULTIMATE.start_gcd_test_~b 18) unseeded (<= 63 ULTIMATE.start_gcd_test_~a))} assume gcd_test_~a > gcd_test_~b;gcd_test_~a := gcd_test_~a - gcd_test_~b; {418#(and (<= ULTIMATE.start_gcd_test_~b 18) (<= 63 (+ ULTIMATE.start_gcd_test_~b ULTIMATE.start_gcd_test_~a)) unseeded)} is VALID [2020-07-29 01:42:12,031 INFO L280 TraceCheckUtils]: 6: Hoare triple {418#(and (<= ULTIMATE.start_gcd_test_~b 18) (<= 63 (+ ULTIMATE.start_gcd_test_~b ULTIMATE.start_gcd_test_~a)) unseeded)} assume !!(0 != gcd_test_~b); {418#(and (<= ULTIMATE.start_gcd_test_~b 18) (<= 63 (+ ULTIMATE.start_gcd_test_~b ULTIMATE.start_gcd_test_~a)) unseeded)} is VALID [2020-07-29 01:42:12,032 INFO L280 TraceCheckUtils]: 7: Hoare triple {418#(and (<= ULTIMATE.start_gcd_test_~b 18) (<= 63 (+ ULTIMATE.start_gcd_test_~b ULTIMATE.start_gcd_test_~a)) unseeded)} assume gcd_test_~a > gcd_test_~b;gcd_test_~a := gcd_test_~a - gcd_test_~b; {425#(and (<= ULTIMATE.start_gcd_test_~b 18) (<= 63 (+ (* 2 ULTIMATE.start_gcd_test_~b) ULTIMATE.start_gcd_test_~a)) unseeded)} is VALID [2020-07-29 01:42:12,033 INFO L280 TraceCheckUtils]: 8: Hoare triple {425#(and (<= ULTIMATE.start_gcd_test_~b 18) (<= 63 (+ (* 2 ULTIMATE.start_gcd_test_~b) ULTIMATE.start_gcd_test_~a)) unseeded)} assume !!(0 != gcd_test_~b); {425#(and (<= ULTIMATE.start_gcd_test_~b 18) (<= 63 (+ (* 2 ULTIMATE.start_gcd_test_~b) ULTIMATE.start_gcd_test_~a)) unseeded)} is VALID [2020-07-29 01:42:12,035 INFO L280 TraceCheckUtils]: 9: Hoare triple {425#(and (<= ULTIMATE.start_gcd_test_~b 18) (<= 63 (+ (* 2 ULTIMATE.start_gcd_test_~b) ULTIMATE.start_gcd_test_~a)) unseeded)} assume gcd_test_~a > gcd_test_~b;gcd_test_~a := gcd_test_~a - gcd_test_~b; {269#(and (>= (+ ULTIMATE.start_gcd_test_~a (- 2)) 0) unseeded)} is VALID [2020-07-29 01:42:12,038 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:42:12,039 WARN L261 TraceCheckSpWp]: Trace formula consists of 7 conjuncts, 5 conjunts are in the unsatisfiable core [2020-07-29 01:42:12,042 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:42:12,043 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-29 01:42:12,046 INFO L280 TraceCheckUtils]: 0: Hoare triple {270#(and (>= oldRank0 ULTIMATE.start_gcd_test_~b) (>= (+ ULTIMATE.start_gcd_test_~a (- 2)) 0))} assume !!(0 != gcd_test_~b); {270#(and (>= oldRank0 ULTIMATE.start_gcd_test_~b) (>= (+ ULTIMATE.start_gcd_test_~a (- 2)) 0))} is VALID [2020-07-29 01:42:12,048 INFO L280 TraceCheckUtils]: 1: Hoare triple {270#(and (>= oldRank0 ULTIMATE.start_gcd_test_~b) (>= (+ ULTIMATE.start_gcd_test_~a (- 2)) 0))} assume !(gcd_test_~a > gcd_test_~b);gcd_test_~b := gcd_test_~b - gcd_test_~a; {272#(and (>= (+ ULTIMATE.start_gcd_test_~a (- 2)) 0) (or (and (> oldRank0 ULTIMATE.start_gcd_test_~b) (>= oldRank0 0)) unseeded))} is VALID [2020-07-29 01:42:12,048 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-29 01:42:12,048 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states. [2020-07-29 01:42:12,064 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 12 edges. 12 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-29 01:42:12,064 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states. Stem has 10 letters. Loop has 2 letters. [2020-07-29 01:42:12,064 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:42:12,064 INFO L152 lantAutomatonBouncer]: Defining Buchi interpolant automaton with scrooge nondeterminism in stemwith honda bouncer for stem and without honda bouncer for loop.4 stem predicates 1 loop predicates [2020-07-29 01:42:12,065 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 12 states and 13 transitions. cyclomatic complexity: 2 Second operand 6 states. [2020-07-29 01:42:12,234 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 12 states and 13 transitions. cyclomatic complexity: 2. Second operand 6 states. Result 20 states and 24 transitions. Complement of second has 12 states. [2020-07-29 01:42:12,235 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 7 states 4 stem states 1 non-accepting loop states 2 accepting loop states [2020-07-29 01:42:12,235 INFO L123 tractBuchiDifference]: Start testing correctness of buchiDifferenceNCSBLazy3 [2020-07-29 01:42:12,235 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 12 states and 13 transitions. cyclomatic complexity: 2 [2020-07-29 01:42:12,235 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 01:42:12,235 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 01:42:12,235 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 6 states. [2020-07-29 01:42:12,237 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2020-07-29 01:42:12,237 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 01:42:12,237 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 01:42:12,238 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 20 states and 24 transitions. [2020-07-29 01:42:12,238 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2020-07-29 01:42:12,239 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 01:42:12,239 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 01:42:12,240 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 12 states and 13 transitions. cyclomatic complexity: 2 [2020-07-29 01:42:12,240 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 2 examples of accepted words. [2020-07-29 01:42:12,240 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 6 states. [2020-07-29 01:42:12,242 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2020-07-29 01:42:12,242 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 1 examples of accepted words. [2020-07-29 01:42:12,243 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 20 states and 24 transitions. cyclomatic complexity: 6 [2020-07-29 01:42:12,244 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 3 examples of accepted words. [2020-07-29 01:42:12,244 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 12 states and 13 transitions. cyclomatic complexity: 2 Stem has 10 letters. Loop has 2 letters. [2020-07-29 01:42:12,244 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:42:12,244 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states. Stem has 10 letters. Loop has 2 letters. [2020-07-29 01:42:12,245 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:42:12,245 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 20 states and 24 transitions. cyclomatic complexity: 6 Stem has 10 letters. Loop has 2 letters. [2020-07-29 01:42:12,245 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:42:12,245 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 12 states and 13 transitions. cyclomatic complexity: 2 Stem has 2 letters. Loop has 2 letters. [2020-07-29 01:42:12,246 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:42:12,246 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states. Stem has 2 letters. Loop has 2 letters. [2020-07-29 01:42:12,246 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:42:12,246 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 20 states and 24 transitions. cyclomatic complexity: 6 Stem has 2 letters. Loop has 2 letters. [2020-07-29 01:42:12,247 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:42:12,247 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 12 states and 13 transitions. cyclomatic complexity: 2 Stem has 12 letters. Loop has 2 letters. [2020-07-29 01:42:12,247 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:42:12,247 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states. Stem has 12 letters. Loop has 2 letters. [2020-07-29 01:42:12,248 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:42:12,248 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 20 states and 24 transitions. cyclomatic complexity: 6 Stem has 12 letters. Loop has 2 letters. [2020-07-29 01:42:12,248 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:42:12,248 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 12 states and 13 transitions. cyclomatic complexity: 2 Stem has 20 letters. Loop has 20 letters. [2020-07-29 01:42:12,248 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:42:12,249 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states. Stem has 20 letters. Loop has 20 letters. [2020-07-29 01:42:12,249 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:42:12,249 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 20 states and 24 transitions. cyclomatic complexity: 6 Stem has 20 letters. Loop has 20 letters. [2020-07-29 01:42:12,249 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:42:12,250 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 12 states and 13 transitions. cyclomatic complexity: 2 Stem has 12 letters. Loop has 12 letters. [2020-07-29 01:42:12,250 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:42:12,250 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states. Stem has 12 letters. Loop has 12 letters. [2020-07-29 01:42:12,250 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:42:12,250 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 20 states and 24 transitions. cyclomatic complexity: 6 Stem has 12 letters. Loop has 12 letters. [2020-07-29 01:42:12,251 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:42:12,251 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 12 states and 13 transitions. cyclomatic complexity: 2 Stem has 7 letters. Loop has 7 letters. [2020-07-29 01:42:12,251 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:42:12,251 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states. Stem has 7 letters. Loop has 7 letters. [2020-07-29 01:42:12,251 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:42:12,252 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 20 states and 24 transitions. cyclomatic complexity: 6 Stem has 7 letters. Loop has 7 letters. [2020-07-29 01:42:12,252 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:42:12,252 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 12 states and 13 transitions. cyclomatic complexity: 2 Stem has 11 letters. Loop has 2 letters. [2020-07-29 01:42:12,252 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:42:12,252 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states. Stem has 11 letters. Loop has 2 letters. [2020-07-29 01:42:12,253 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:42:12,253 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 20 states and 24 transitions. cyclomatic complexity: 6 Stem has 11 letters. Loop has 2 letters. [2020-07-29 01:42:12,253 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:42:12,253 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 12 states and 13 transitions. cyclomatic complexity: 2 Stem has 10 letters. Loop has 2 letters. [2020-07-29 01:42:12,254 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:42:12,254 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states. Stem has 10 letters. Loop has 2 letters. [2020-07-29 01:42:12,254 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:42:12,254 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 20 states and 24 transitions. cyclomatic complexity: 6 Stem has 10 letters. Loop has 2 letters. [2020-07-29 01:42:12,255 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:42:12,255 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 12 states and 13 transitions. cyclomatic complexity: 2 Stem has 2 letters. Loop has 2 letters. [2020-07-29 01:42:12,255 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:42:12,255 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states. Stem has 2 letters. Loop has 2 letters. [2020-07-29 01:42:12,255 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:42:12,256 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 20 states and 24 transitions. cyclomatic complexity: 6 Stem has 2 letters. Loop has 2 letters. [2020-07-29 01:42:12,256 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:42:12,256 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 12 states and 13 transitions. cyclomatic complexity: 2 Stem has 12 letters. Loop has 2 letters. [2020-07-29 01:42:12,256 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:42:12,256 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states. Stem has 12 letters. Loop has 2 letters. [2020-07-29 01:42:12,257 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:42:12,257 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 20 states and 24 transitions. cyclomatic complexity: 6 Stem has 12 letters. Loop has 2 letters. [2020-07-29 01:42:12,257 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:42:12,257 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 12 states and 13 transitions. cyclomatic complexity: 2 Stem has 14 letters. Loop has 2 letters. [2020-07-29 01:42:12,258 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:42:12,258 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states. Stem has 14 letters. Loop has 2 letters. [2020-07-29 01:42:12,258 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:42:12,258 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 20 states and 24 transitions. cyclomatic complexity: 6 Stem has 14 letters. Loop has 2 letters. [2020-07-29 01:42:12,258 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:42:12,259 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 12 states and 13 transitions. cyclomatic complexity: 2 Stem has 15 letters. Loop has 2 letters. [2020-07-29 01:42:12,259 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:42:12,259 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states. Stem has 15 letters. Loop has 2 letters. [2020-07-29 01:42:12,259 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:42:12,259 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 20 states and 24 transitions. cyclomatic complexity: 6 Stem has 15 letters. Loop has 2 letters. [2020-07-29 01:42:12,260 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:42:12,260 INFO L161 tractBuchiDifference]: Finished testing correctness of buchiDifferenceNCSBLazy3 [2020-07-29 01:42:12,260 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2020-07-29 01:42:12,261 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 19 transitions. [2020-07-29 01:42:12,262 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 19 transitions. Stem has 10 letters. Loop has 2 letters. [2020-07-29 01:42:12,262 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:42:12,262 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 19 transitions. Stem has 12 letters. Loop has 2 letters. [2020-07-29 01:42:12,262 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:42:12,263 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 19 transitions. Stem has 10 letters. Loop has 4 letters. [2020-07-29 01:42:12,263 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:42:12,263 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 20 states and 24 transitions. cyclomatic complexity: 6 [2020-07-29 01:42:12,265 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2020-07-29 01:42:12,266 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 20 states to 18 states and 22 transitions. [2020-07-29 01:42:12,267 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 12 [2020-07-29 01:42:12,267 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 16 [2020-07-29 01:42:12,267 INFO L73 IsDeterministic]: Start isDeterministic. Operand 18 states and 22 transitions. [2020-07-29 01:42:12,267 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2020-07-29 01:42:12,267 INFO L688 BuchiCegarLoop]: Abstraction has 18 states and 22 transitions. [2020-07-29 01:42:12,268 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18 states and 22 transitions. [2020-07-29 01:42:12,269 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18 to 16. [2020-07-29 01:42:12,269 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-29 01:42:12,270 INFO L82 GeneralOperation]: Start isEquivalent. First operand 18 states and 22 transitions. Second operand 16 states. [2020-07-29 01:42:12,270 INFO L74 IsIncluded]: Start isIncluded. First operand 18 states and 22 transitions. Second operand 16 states. [2020-07-29 01:42:12,270 INFO L87 Difference]: Start difference. First operand 18 states and 22 transitions. Second operand 16 states. [2020-07-29 01:42:12,271 INFO L149 Difference]: Subtrahend was not deterministic. Recomputing result with determinization. [2020-07-29 01:42:12,274 INFO L93 Difference]: Finished difference Result 18 states and 22 transitions. [2020-07-29 01:42:12,274 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 22 transitions. [2020-07-29 01:42:12,275 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-29 01:42:12,275 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-29 01:42:12,275 INFO L74 IsIncluded]: Start isIncluded. First operand 16 states. Second operand 18 states and 22 transitions. [2020-07-29 01:42:12,275 INFO L87 Difference]: Start difference. First operand 16 states. Second operand 18 states and 22 transitions. [2020-07-29 01:42:12,276 INFO L149 Difference]: Subtrahend was not deterministic. Recomputing result with determinization. [2020-07-29 01:42:12,278 INFO L93 Difference]: Finished difference Result 18 states and 22 transitions. [2020-07-29 01:42:12,278 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 22 transitions. [2020-07-29 01:42:12,278 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-29 01:42:12,279 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-29 01:42:12,279 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-29 01:42:12,279 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-29 01:42:12,279 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2020-07-29 01:42:12,280 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 19 transitions. [2020-07-29 01:42:12,281 INFO L711 BuchiCegarLoop]: Abstraction has 16 states and 19 transitions. [2020-07-29 01:42:12,281 INFO L591 BuchiCegarLoop]: Abstraction has 16 states and 19 transitions. [2020-07-29 01:42:12,281 INFO L424 BuchiCegarLoop]: ======== Iteration 5============ [2020-07-29 01:42:12,281 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 16 states and 19 transitions. [2020-07-29 01:42:12,282 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2020-07-29 01:42:12,282 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 01:42:12,282 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 01:42:12,283 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [4, 4, 1, 1, 1, 1] [2020-07-29 01:42:12,283 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2020-07-29 01:42:12,283 INFO L794 eck$LassoCheckResult]: Stem: 481#ULTIMATE.startENTRY havoc main_#res;havoc main_#t~ret0, main_~x~0, main_~y~0, main_~g~0;havoc main_~x~0;havoc main_~y~0;havoc main_~g~0;main_~x~0 := 63;main_~y~0 := 18;gcd_test_#in~a, gcd_test_#in~b := main_~x~0, main_~y~0;havoc gcd_test_#res;havoc gcd_test_~a, gcd_test_~b;gcd_test_~a := gcd_test_#in~a;gcd_test_~b := gcd_test_#in~b; 482#L12 assume !(gcd_test_~a < 0); 479#L12-2 assume !(gcd_test_~b < 0); 480#L13-1 assume !(0 == gcd_test_~a); 483#L20-2 assume !!(0 != gcd_test_~b); 494#L20 assume gcd_test_~a > gcd_test_~b;gcd_test_~a := gcd_test_~a - gcd_test_~b; 493#L20-2 assume !!(0 != gcd_test_~b); 492#L20 assume gcd_test_~a > gcd_test_~b;gcd_test_~a := gcd_test_~a - gcd_test_~b; 491#L20-2 assume !!(0 != gcd_test_~b); 490#L20 assume gcd_test_~a > gcd_test_~b;gcd_test_~a := gcd_test_~a - gcd_test_~b; 489#L20-2 assume !!(0 != gcd_test_~b); 488#L20 assume gcd_test_~a > gcd_test_~b;gcd_test_~a := gcd_test_~a - gcd_test_~b; 484#L20-2 [2020-07-29 01:42:12,283 INFO L796 eck$LassoCheckResult]: Loop: 484#L20-2 assume !!(0 != gcd_test_~b); 485#L20 assume !(gcd_test_~a > gcd_test_~b);gcd_test_~b := gcd_test_~b - gcd_test_~a; 484#L20-2 [2020-07-29 01:42:12,284 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 01:42:12,284 INFO L82 PathProgramCache]: Analyzing trace with hash -1420625672, now seen corresponding path program 4 times [2020-07-29 01:42:12,284 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 01:42:12,284 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [281412950] [2020-07-29 01:42:12,285 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 01:42:12,293 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:42:12,371 INFO L280 TraceCheckUtils]: 0: Hoare triple {592#true} havoc main_#res;havoc main_#t~ret0, main_~x~0, main_~y~0, main_~g~0;havoc main_~x~0;havoc main_~y~0;havoc main_~g~0;main_~x~0 := 63;main_~y~0 := 18;gcd_test_#in~a, gcd_test_#in~b := main_~x~0, main_~y~0;havoc gcd_test_#res;havoc gcd_test_~a, gcd_test_~b;gcd_test_~a := gcd_test_#in~a;gcd_test_~b := gcd_test_#in~b; {594#(and (= 63 ULTIMATE.start_gcd_test_~a) (= 18 ULTIMATE.start_gcd_test_~b))} is VALID [2020-07-29 01:42:12,372 INFO L280 TraceCheckUtils]: 1: Hoare triple {594#(and (= 63 ULTIMATE.start_gcd_test_~a) (= 18 ULTIMATE.start_gcd_test_~b))} assume !(gcd_test_~a < 0); {594#(and (= 63 ULTIMATE.start_gcd_test_~a) (= 18 ULTIMATE.start_gcd_test_~b))} is VALID [2020-07-29 01:42:12,373 INFO L280 TraceCheckUtils]: 2: Hoare triple {594#(and (= 63 ULTIMATE.start_gcd_test_~a) (= 18 ULTIMATE.start_gcd_test_~b))} assume !(gcd_test_~b < 0); {594#(and (= 63 ULTIMATE.start_gcd_test_~a) (= 18 ULTIMATE.start_gcd_test_~b))} is VALID [2020-07-29 01:42:12,374 INFO L280 TraceCheckUtils]: 3: Hoare triple {594#(and (= 63 ULTIMATE.start_gcd_test_~a) (= 18 ULTIMATE.start_gcd_test_~b))} assume !(0 == gcd_test_~a); {594#(and (= 63 ULTIMATE.start_gcd_test_~a) (= 18 ULTIMATE.start_gcd_test_~b))} is VALID [2020-07-29 01:42:12,375 INFO L280 TraceCheckUtils]: 4: Hoare triple {594#(and (= 63 ULTIMATE.start_gcd_test_~a) (= 18 ULTIMATE.start_gcd_test_~b))} assume !!(0 != gcd_test_~b); {594#(and (= 63 ULTIMATE.start_gcd_test_~a) (= 18 ULTIMATE.start_gcd_test_~b))} is VALID [2020-07-29 01:42:12,376 INFO L280 TraceCheckUtils]: 5: Hoare triple {594#(and (= 63 ULTIMATE.start_gcd_test_~a) (= 18 ULTIMATE.start_gcd_test_~b))} assume gcd_test_~a > gcd_test_~b;gcd_test_~a := gcd_test_~a - gcd_test_~b; {595#(and (<= (+ ULTIMATE.start_gcd_test_~b ULTIMATE.start_gcd_test_~a) 63) (= 18 ULTIMATE.start_gcd_test_~b))} is VALID [2020-07-29 01:42:12,377 INFO L280 TraceCheckUtils]: 6: Hoare triple {595#(and (<= (+ ULTIMATE.start_gcd_test_~b ULTIMATE.start_gcd_test_~a) 63) (= 18 ULTIMATE.start_gcd_test_~b))} assume !!(0 != gcd_test_~b); {595#(and (<= (+ ULTIMATE.start_gcd_test_~b ULTIMATE.start_gcd_test_~a) 63) (= 18 ULTIMATE.start_gcd_test_~b))} is VALID [2020-07-29 01:42:12,378 INFO L280 TraceCheckUtils]: 7: Hoare triple {595#(and (<= (+ ULTIMATE.start_gcd_test_~b ULTIMATE.start_gcd_test_~a) 63) (= 18 ULTIMATE.start_gcd_test_~b))} assume gcd_test_~a > gcd_test_~b;gcd_test_~a := gcd_test_~a - gcd_test_~b; {596#(and (<= (+ (* 2 ULTIMATE.start_gcd_test_~b) ULTIMATE.start_gcd_test_~a) 63) (= 18 ULTIMATE.start_gcd_test_~b))} is VALID [2020-07-29 01:42:12,379 INFO L280 TraceCheckUtils]: 8: Hoare triple {596#(and (<= (+ (* 2 ULTIMATE.start_gcd_test_~b) ULTIMATE.start_gcd_test_~a) 63) (= 18 ULTIMATE.start_gcd_test_~b))} assume !!(0 != gcd_test_~b); {596#(and (<= (+ (* 2 ULTIMATE.start_gcd_test_~b) ULTIMATE.start_gcd_test_~a) 63) (= 18 ULTIMATE.start_gcd_test_~b))} is VALID [2020-07-29 01:42:12,380 INFO L280 TraceCheckUtils]: 9: Hoare triple {596#(and (<= (+ (* 2 ULTIMATE.start_gcd_test_~b) ULTIMATE.start_gcd_test_~a) 63) (= 18 ULTIMATE.start_gcd_test_~b))} assume gcd_test_~a > gcd_test_~b;gcd_test_~a := gcd_test_~a - gcd_test_~b; {597#(and (= 18 ULTIMATE.start_gcd_test_~b) (<= (+ (* 3 ULTIMATE.start_gcd_test_~b) ULTIMATE.start_gcd_test_~a) 63))} is VALID [2020-07-29 01:42:12,381 INFO L280 TraceCheckUtils]: 10: Hoare triple {597#(and (= 18 ULTIMATE.start_gcd_test_~b) (<= (+ (* 3 ULTIMATE.start_gcd_test_~b) ULTIMATE.start_gcd_test_~a) 63))} assume !!(0 != gcd_test_~b); {597#(and (= 18 ULTIMATE.start_gcd_test_~b) (<= (+ (* 3 ULTIMATE.start_gcd_test_~b) ULTIMATE.start_gcd_test_~a) 63))} is VALID [2020-07-29 01:42:12,382 INFO L280 TraceCheckUtils]: 11: Hoare triple {597#(and (= 18 ULTIMATE.start_gcd_test_~b) (<= (+ (* 3 ULTIMATE.start_gcd_test_~b) ULTIMATE.start_gcd_test_~a) 63))} assume gcd_test_~a > gcd_test_~b;gcd_test_~a := gcd_test_~a - gcd_test_~b; {593#false} is VALID [2020-07-29 01:42:12,383 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 6 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-29 01:42:12,383 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [281412950] [2020-07-29 01:42:12,384 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2036805294] [2020-07-29 01:42:12,384 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2020-07-29 01:42:12,405 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2020-07-29 01:42:12,406 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-07-29 01:42:12,406 INFO L263 TraceCheckSpWp]: Trace formula consists of 33 conjuncts, 10 conjunts are in the unsatisfiable core Waiting until toolchain timeout for monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-07-29 01:42:12,411 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:42:12,412 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-29 01:42:12,664 INFO L280 TraceCheckUtils]: 0: Hoare triple {592#true} havoc main_#res;havoc main_#t~ret0, main_~x~0, main_~y~0, main_~g~0;havoc main_~x~0;havoc main_~y~0;havoc main_~g~0;main_~x~0 := 63;main_~y~0 := 18;gcd_test_#in~a, gcd_test_#in~b := main_~x~0, main_~y~0;havoc gcd_test_#res;havoc gcd_test_~a, gcd_test_~b;gcd_test_~a := gcd_test_#in~a;gcd_test_~b := gcd_test_#in~b; {601#(and (<= 18 ULTIMATE.start_gcd_test_~b) (<= ULTIMATE.start_gcd_test_~a 63))} is VALID [2020-07-29 01:42:12,665 INFO L280 TraceCheckUtils]: 1: Hoare triple {601#(and (<= 18 ULTIMATE.start_gcd_test_~b) (<= ULTIMATE.start_gcd_test_~a 63))} assume !(gcd_test_~a < 0); {601#(and (<= 18 ULTIMATE.start_gcd_test_~b) (<= ULTIMATE.start_gcd_test_~a 63))} is VALID [2020-07-29 01:42:12,665 INFO L280 TraceCheckUtils]: 2: Hoare triple {601#(and (<= 18 ULTIMATE.start_gcd_test_~b) (<= ULTIMATE.start_gcd_test_~a 63))} assume !(gcd_test_~b < 0); {601#(and (<= 18 ULTIMATE.start_gcd_test_~b) (<= ULTIMATE.start_gcd_test_~a 63))} is VALID [2020-07-29 01:42:12,666 INFO L280 TraceCheckUtils]: 3: Hoare triple {601#(and (<= 18 ULTIMATE.start_gcd_test_~b) (<= ULTIMATE.start_gcd_test_~a 63))} assume !(0 == gcd_test_~a); {601#(and (<= 18 ULTIMATE.start_gcd_test_~b) (<= ULTIMATE.start_gcd_test_~a 63))} is VALID [2020-07-29 01:42:12,666 INFO L280 TraceCheckUtils]: 4: Hoare triple {601#(and (<= 18 ULTIMATE.start_gcd_test_~b) (<= ULTIMATE.start_gcd_test_~a 63))} assume !!(0 != gcd_test_~b); {601#(and (<= 18 ULTIMATE.start_gcd_test_~b) (<= ULTIMATE.start_gcd_test_~a 63))} is VALID [2020-07-29 01:42:12,667 INFO L280 TraceCheckUtils]: 5: Hoare triple {601#(and (<= 18 ULTIMATE.start_gcd_test_~b) (<= ULTIMATE.start_gcd_test_~a 63))} assume gcd_test_~a > gcd_test_~b;gcd_test_~a := gcd_test_~a - gcd_test_~b; {617#(and (<= (+ ULTIMATE.start_gcd_test_~b ULTIMATE.start_gcd_test_~a) 63) (<= 18 ULTIMATE.start_gcd_test_~b))} is VALID [2020-07-29 01:42:12,668 INFO L280 TraceCheckUtils]: 6: Hoare triple {617#(and (<= (+ ULTIMATE.start_gcd_test_~b ULTIMATE.start_gcd_test_~a) 63) (<= 18 ULTIMATE.start_gcd_test_~b))} assume !!(0 != gcd_test_~b); {617#(and (<= (+ ULTIMATE.start_gcd_test_~b ULTIMATE.start_gcd_test_~a) 63) (<= 18 ULTIMATE.start_gcd_test_~b))} is VALID [2020-07-29 01:42:12,668 INFO L280 TraceCheckUtils]: 7: Hoare triple {617#(and (<= (+ ULTIMATE.start_gcd_test_~b ULTIMATE.start_gcd_test_~a) 63) (<= 18 ULTIMATE.start_gcd_test_~b))} assume gcd_test_~a > gcd_test_~b;gcd_test_~a := gcd_test_~a - gcd_test_~b; {624#(and (<= (+ (* 2 ULTIMATE.start_gcd_test_~b) ULTIMATE.start_gcd_test_~a) 63) (<= 18 ULTIMATE.start_gcd_test_~b))} is VALID [2020-07-29 01:42:12,669 INFO L280 TraceCheckUtils]: 8: Hoare triple {624#(and (<= (+ (* 2 ULTIMATE.start_gcd_test_~b) ULTIMATE.start_gcd_test_~a) 63) (<= 18 ULTIMATE.start_gcd_test_~b))} assume !!(0 != gcd_test_~b); {624#(and (<= (+ (* 2 ULTIMATE.start_gcd_test_~b) ULTIMATE.start_gcd_test_~a) 63) (<= 18 ULTIMATE.start_gcd_test_~b))} is VALID [2020-07-29 01:42:12,670 INFO L280 TraceCheckUtils]: 9: Hoare triple {624#(and (<= (+ (* 2 ULTIMATE.start_gcd_test_~b) ULTIMATE.start_gcd_test_~a) 63) (<= 18 ULTIMATE.start_gcd_test_~b))} assume gcd_test_~a > gcd_test_~b;gcd_test_~a := gcd_test_~a - gcd_test_~b; {631#(and (<= (+ (* 3 ULTIMATE.start_gcd_test_~b) ULTIMATE.start_gcd_test_~a) 63) (<= 18 ULTIMATE.start_gcd_test_~b))} is VALID [2020-07-29 01:42:12,671 INFO L280 TraceCheckUtils]: 10: Hoare triple {631#(and (<= (+ (* 3 ULTIMATE.start_gcd_test_~b) ULTIMATE.start_gcd_test_~a) 63) (<= 18 ULTIMATE.start_gcd_test_~b))} assume !!(0 != gcd_test_~b); {631#(and (<= (+ (* 3 ULTIMATE.start_gcd_test_~b) ULTIMATE.start_gcd_test_~a) 63) (<= 18 ULTIMATE.start_gcd_test_~b))} is VALID [2020-07-29 01:42:12,671 INFO L280 TraceCheckUtils]: 11: Hoare triple {631#(and (<= (+ (* 3 ULTIMATE.start_gcd_test_~b) ULTIMATE.start_gcd_test_~a) 63) (<= 18 ULTIMATE.start_gcd_test_~b))} assume gcd_test_~a > gcd_test_~b;gcd_test_~a := gcd_test_~a - gcd_test_~b; {593#false} is VALID [2020-07-29 01:42:12,672 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-29 01:42:12,672 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2020-07-29 01:42:12,672 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [4] total 8 [2020-07-29 01:42:12,673 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [110488775] [2020-07-29 01:42:12,673 INFO L799 eck$LassoCheckResult]: stem already infeasible [2020-07-29 01:42:12,673 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 01:42:12,674 INFO L82 PathProgramCache]: Analyzing trace with hash 1830, now seen corresponding path program 5 times [2020-07-29 01:42:12,674 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 01:42:12,674 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [901682418] [2020-07-29 01:42:12,674 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 01:42:12,677 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 01:42:12,677 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 01:42:12,679 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 01:42:12,679 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 01:42:12,680 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-07-29 01:42:12,699 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-29 01:42:12,699 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-07-29 01:42:12,700 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=54, Unknown=0, NotChecked=0, Total=90 [2020-07-29 01:42:12,700 INFO L87 Difference]: Start difference. First operand 16 states and 19 transitions. cyclomatic complexity: 5 Second operand 6 states. [2020-07-29 01:42:12,767 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-29 01:42:12,767 INFO L93 Difference]: Finished difference Result 18 states and 20 transitions. [2020-07-29 01:42:12,767 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-07-29 01:42:12,767 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states. [2020-07-29 01:42:12,786 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 12 edges. 12 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-29 01:42:12,786 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 18 states and 20 transitions. [2020-07-29 01:42:12,787 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2020-07-29 01:42:12,788 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 18 states to 17 states and 19 transitions. [2020-07-29 01:42:12,788 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 14 [2020-07-29 01:42:12,789 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 14 [2020-07-29 01:42:12,789 INFO L73 IsDeterministic]: Start isDeterministic. Operand 17 states and 19 transitions. [2020-07-29 01:42:12,789 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2020-07-29 01:42:12,789 INFO L688 BuchiCegarLoop]: Abstraction has 17 states and 19 transitions. [2020-07-29 01:42:12,789 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17 states and 19 transitions. [2020-07-29 01:42:12,790 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17 to 16. [2020-07-29 01:42:12,791 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-29 01:42:12,791 INFO L82 GeneralOperation]: Start isEquivalent. First operand 17 states and 19 transitions. Second operand 16 states. [2020-07-29 01:42:12,791 INFO L74 IsIncluded]: Start isIncluded. First operand 17 states and 19 transitions. Second operand 16 states. [2020-07-29 01:42:12,791 INFO L87 Difference]: Start difference. First operand 17 states and 19 transitions. Second operand 16 states. [2020-07-29 01:42:12,792 INFO L149 Difference]: Subtrahend was not deterministic. Recomputing result with determinization. [2020-07-29 01:42:12,793 INFO L93 Difference]: Finished difference Result 17 states and 19 transitions. [2020-07-29 01:42:12,793 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 19 transitions. [2020-07-29 01:42:12,794 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-29 01:42:12,794 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-29 01:42:12,794 INFO L74 IsIncluded]: Start isIncluded. First operand 16 states. Second operand 17 states and 19 transitions. [2020-07-29 01:42:12,794 INFO L87 Difference]: Start difference. First operand 16 states. Second operand 17 states and 19 transitions. [2020-07-29 01:42:12,795 INFO L149 Difference]: Subtrahend was not deterministic. Recomputing result with determinization. [2020-07-29 01:42:12,797 INFO L93 Difference]: Finished difference Result 17 states and 19 transitions. [2020-07-29 01:42:12,797 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 19 transitions. [2020-07-29 01:42:12,797 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-29 01:42:12,797 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-29 01:42:12,798 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-29 01:42:12,798 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-29 01:42:12,798 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2020-07-29 01:42:12,799 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 18 transitions. [2020-07-29 01:42:12,799 INFO L711 BuchiCegarLoop]: Abstraction has 16 states and 18 transitions. [2020-07-29 01:42:12,799 INFO L591 BuchiCegarLoop]: Abstraction has 16 states and 18 transitions. [2020-07-29 01:42:12,800 INFO L424 BuchiCegarLoop]: ======== Iteration 6============ [2020-07-29 01:42:12,800 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 16 states and 18 transitions. [2020-07-29 01:42:12,800 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2020-07-29 01:42:12,800 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 01:42:12,801 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 01:42:12,801 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [5, 4, 1, 1, 1, 1, 1] [2020-07-29 01:42:12,801 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2020-07-29 01:42:12,801 INFO L794 eck$LassoCheckResult]: Stem: 657#ULTIMATE.startENTRY havoc main_#res;havoc main_#t~ret0, main_~x~0, main_~y~0, main_~g~0;havoc main_~x~0;havoc main_~y~0;havoc main_~g~0;main_~x~0 := 63;main_~y~0 := 18;gcd_test_#in~a, gcd_test_#in~b := main_~x~0, main_~y~0;havoc gcd_test_#res;havoc gcd_test_~a, gcd_test_~b;gcd_test_~a := gcd_test_#in~a;gcd_test_~b := gcd_test_#in~b; 658#L12 assume !(gcd_test_~a < 0); 655#L12-2 assume !(gcd_test_~b < 0); 656#L13-1 assume !(0 == gcd_test_~a); 659#L20-2 assume !!(0 != gcd_test_~b); 670#L20 assume gcd_test_~a > gcd_test_~b;gcd_test_~a := gcd_test_~a - gcd_test_~b; 669#L20-2 assume !!(0 != gcd_test_~b); 668#L20 assume gcd_test_~a > gcd_test_~b;gcd_test_~a := gcd_test_~a - gcd_test_~b; 667#L20-2 assume !!(0 != gcd_test_~b); 666#L20 assume gcd_test_~a > gcd_test_~b;gcd_test_~a := gcd_test_~a - gcd_test_~b; 665#L20-2 assume !!(0 != gcd_test_~b); 663#L20 assume !(gcd_test_~a > gcd_test_~b);gcd_test_~b := gcd_test_~b - gcd_test_~a; 662#L20-2 assume !!(0 != gcd_test_~b); 664#L20 assume gcd_test_~a > gcd_test_~b;gcd_test_~a := gcd_test_~a - gcd_test_~b; 660#L20-2 [2020-07-29 01:42:12,802 INFO L796 eck$LassoCheckResult]: Loop: 660#L20-2 assume !!(0 != gcd_test_~b); 661#L20 assume !(gcd_test_~a > gcd_test_~b);gcd_test_~b := gcd_test_~b - gcd_test_~a; 660#L20-2 [2020-07-29 01:42:12,802 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 01:42:12,802 INFO L82 PathProgramCache]: Analyzing trace with hash 578332125, now seen corresponding path program 4 times [2020-07-29 01:42:12,802 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 01:42:12,803 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1820918324] [2020-07-29 01:42:12,803 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 01:42:12,811 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:42:12,900 INFO L280 TraceCheckUtils]: 0: Hoare triple {770#true} havoc main_#res;havoc main_#t~ret0, main_~x~0, main_~y~0, main_~g~0;havoc main_~x~0;havoc main_~y~0;havoc main_~g~0;main_~x~0 := 63;main_~y~0 := 18;gcd_test_#in~a, gcd_test_#in~b := main_~x~0, main_~y~0;havoc gcd_test_#res;havoc gcd_test_~a, gcd_test_~b;gcd_test_~a := gcd_test_#in~a;gcd_test_~b := gcd_test_#in~b; {772#(and (= 63 ULTIMATE.start_gcd_test_~a) (= 18 ULTIMATE.start_gcd_test_~b))} is VALID [2020-07-29 01:42:12,901 INFO L280 TraceCheckUtils]: 1: Hoare triple {772#(and (= 63 ULTIMATE.start_gcd_test_~a) (= 18 ULTIMATE.start_gcd_test_~b))} assume !(gcd_test_~a < 0); {772#(and (= 63 ULTIMATE.start_gcd_test_~a) (= 18 ULTIMATE.start_gcd_test_~b))} is VALID [2020-07-29 01:42:12,901 INFO L280 TraceCheckUtils]: 2: Hoare triple {772#(and (= 63 ULTIMATE.start_gcd_test_~a) (= 18 ULTIMATE.start_gcd_test_~b))} assume !(gcd_test_~b < 0); {772#(and (= 63 ULTIMATE.start_gcd_test_~a) (= 18 ULTIMATE.start_gcd_test_~b))} is VALID [2020-07-29 01:42:12,902 INFO L280 TraceCheckUtils]: 3: Hoare triple {772#(and (= 63 ULTIMATE.start_gcd_test_~a) (= 18 ULTIMATE.start_gcd_test_~b))} assume !(0 == gcd_test_~a); {772#(and (= 63 ULTIMATE.start_gcd_test_~a) (= 18 ULTIMATE.start_gcd_test_~b))} is VALID [2020-07-29 01:42:12,903 INFO L280 TraceCheckUtils]: 4: Hoare triple {772#(and (= 63 ULTIMATE.start_gcd_test_~a) (= 18 ULTIMATE.start_gcd_test_~b))} assume !!(0 != gcd_test_~b); {772#(and (= 63 ULTIMATE.start_gcd_test_~a) (= 18 ULTIMATE.start_gcd_test_~b))} is VALID [2020-07-29 01:42:12,906 INFO L280 TraceCheckUtils]: 5: Hoare triple {772#(and (= 63 ULTIMATE.start_gcd_test_~a) (= 18 ULTIMATE.start_gcd_test_~b))} assume gcd_test_~a > gcd_test_~b;gcd_test_~a := gcd_test_~a - gcd_test_~b; {773#(and (<= (+ ULTIMATE.start_gcd_test_~b ULTIMATE.start_gcd_test_~a) 63) (= 18 ULTIMATE.start_gcd_test_~b))} is VALID [2020-07-29 01:42:12,907 INFO L280 TraceCheckUtils]: 6: Hoare triple {773#(and (<= (+ ULTIMATE.start_gcd_test_~b ULTIMATE.start_gcd_test_~a) 63) (= 18 ULTIMATE.start_gcd_test_~b))} assume !!(0 != gcd_test_~b); {773#(and (<= (+ ULTIMATE.start_gcd_test_~b ULTIMATE.start_gcd_test_~a) 63) (= 18 ULTIMATE.start_gcd_test_~b))} is VALID [2020-07-29 01:42:12,909 INFO L280 TraceCheckUtils]: 7: Hoare triple {773#(and (<= (+ ULTIMATE.start_gcd_test_~b ULTIMATE.start_gcd_test_~a) 63) (= 18 ULTIMATE.start_gcd_test_~b))} assume gcd_test_~a > gcd_test_~b;gcd_test_~a := gcd_test_~a - gcd_test_~b; {774#(and (<= (+ (* 2 ULTIMATE.start_gcd_test_~b) ULTIMATE.start_gcd_test_~a) 63) (= 18 ULTIMATE.start_gcd_test_~b))} is VALID [2020-07-29 01:42:12,910 INFO L280 TraceCheckUtils]: 8: Hoare triple {774#(and (<= (+ (* 2 ULTIMATE.start_gcd_test_~b) ULTIMATE.start_gcd_test_~a) 63) (= 18 ULTIMATE.start_gcd_test_~b))} assume !!(0 != gcd_test_~b); {774#(and (<= (+ (* 2 ULTIMATE.start_gcd_test_~b) ULTIMATE.start_gcd_test_~a) 63) (= 18 ULTIMATE.start_gcd_test_~b))} is VALID [2020-07-29 01:42:12,911 INFO L280 TraceCheckUtils]: 9: Hoare triple {774#(and (<= (+ (* 2 ULTIMATE.start_gcd_test_~b) ULTIMATE.start_gcd_test_~a) 63) (= 18 ULTIMATE.start_gcd_test_~b))} assume gcd_test_~a > gcd_test_~b;gcd_test_~a := gcd_test_~a - gcd_test_~b; {775#(and (= 18 ULTIMATE.start_gcd_test_~b) (<= (+ (* 3 ULTIMATE.start_gcd_test_~b) ULTIMATE.start_gcd_test_~a) 63))} is VALID [2020-07-29 01:42:12,912 INFO L280 TraceCheckUtils]: 10: Hoare triple {775#(and (= 18 ULTIMATE.start_gcd_test_~b) (<= (+ (* 3 ULTIMATE.start_gcd_test_~b) ULTIMATE.start_gcd_test_~a) 63))} assume !!(0 != gcd_test_~b); {775#(and (= 18 ULTIMATE.start_gcd_test_~b) (<= (+ (* 3 ULTIMATE.start_gcd_test_~b) ULTIMATE.start_gcd_test_~a) 63))} is VALID [2020-07-29 01:42:12,914 INFO L280 TraceCheckUtils]: 11: Hoare triple {775#(and (= 18 ULTIMATE.start_gcd_test_~b) (<= (+ (* 3 ULTIMATE.start_gcd_test_~b) ULTIMATE.start_gcd_test_~a) 63))} assume !(gcd_test_~a > gcd_test_~b);gcd_test_~b := gcd_test_~b - gcd_test_~a; {776#(<= ULTIMATE.start_gcd_test_~a ULTIMATE.start_gcd_test_~b)} is VALID [2020-07-29 01:42:12,915 INFO L280 TraceCheckUtils]: 12: Hoare triple {776#(<= ULTIMATE.start_gcd_test_~a ULTIMATE.start_gcd_test_~b)} assume !!(0 != gcd_test_~b); {776#(<= ULTIMATE.start_gcd_test_~a ULTIMATE.start_gcd_test_~b)} is VALID [2020-07-29 01:42:12,916 INFO L280 TraceCheckUtils]: 13: Hoare triple {776#(<= ULTIMATE.start_gcd_test_~a ULTIMATE.start_gcd_test_~b)} assume gcd_test_~a > gcd_test_~b;gcd_test_~a := gcd_test_~a - gcd_test_~b; {771#false} is VALID [2020-07-29 01:42:12,917 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 6 proven. 14 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-29 01:42:12,917 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1820918324] [2020-07-29 01:42:12,917 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [59699889] [2020-07-29 01:42:12,918 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/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 [2020-07-29 01:42:12,951 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2020-07-29 01:42:12,952 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-07-29 01:42:12,953 INFO L263 TraceCheckSpWp]: Trace formula consists of 37 conjuncts, 11 conjunts are in the unsatisfiable core [2020-07-29 01:42:12,957 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:42:12,958 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-29 01:42:13,362 INFO L280 TraceCheckUtils]: 0: Hoare triple {770#true} havoc main_#res;havoc main_#t~ret0, main_~x~0, main_~y~0, main_~g~0;havoc main_~x~0;havoc main_~y~0;havoc main_~g~0;main_~x~0 := 63;main_~y~0 := 18;gcd_test_#in~a, gcd_test_#in~b := main_~x~0, main_~y~0;havoc gcd_test_#res;havoc gcd_test_~a, gcd_test_~b;gcd_test_~a := gcd_test_#in~a;gcd_test_~b := gcd_test_#in~b; {780#(and (<= 18 ULTIMATE.start_gcd_test_~b) (<= ULTIMATE.start_gcd_test_~a 63))} is VALID [2020-07-29 01:42:13,364 INFO L280 TraceCheckUtils]: 1: Hoare triple {780#(and (<= 18 ULTIMATE.start_gcd_test_~b) (<= ULTIMATE.start_gcd_test_~a 63))} assume !(gcd_test_~a < 0); {780#(and (<= 18 ULTIMATE.start_gcd_test_~b) (<= ULTIMATE.start_gcd_test_~a 63))} is VALID [2020-07-29 01:42:13,365 INFO L280 TraceCheckUtils]: 2: Hoare triple {780#(and (<= 18 ULTIMATE.start_gcd_test_~b) (<= ULTIMATE.start_gcd_test_~a 63))} assume !(gcd_test_~b < 0); {780#(and (<= 18 ULTIMATE.start_gcd_test_~b) (<= ULTIMATE.start_gcd_test_~a 63))} is VALID [2020-07-29 01:42:13,369 INFO L280 TraceCheckUtils]: 3: Hoare triple {780#(and (<= 18 ULTIMATE.start_gcd_test_~b) (<= ULTIMATE.start_gcd_test_~a 63))} assume !(0 == gcd_test_~a); {780#(and (<= 18 ULTIMATE.start_gcd_test_~b) (<= ULTIMATE.start_gcd_test_~a 63))} is VALID [2020-07-29 01:42:13,372 INFO L280 TraceCheckUtils]: 4: Hoare triple {780#(and (<= 18 ULTIMATE.start_gcd_test_~b) (<= ULTIMATE.start_gcd_test_~a 63))} assume !!(0 != gcd_test_~b); {780#(and (<= 18 ULTIMATE.start_gcd_test_~b) (<= ULTIMATE.start_gcd_test_~a 63))} is VALID [2020-07-29 01:42:13,373 INFO L280 TraceCheckUtils]: 5: Hoare triple {780#(and (<= 18 ULTIMATE.start_gcd_test_~b) (<= ULTIMATE.start_gcd_test_~a 63))} assume gcd_test_~a > gcd_test_~b;gcd_test_~a := gcd_test_~a - gcd_test_~b; {796#(and (<= (+ ULTIMATE.start_gcd_test_~b ULTIMATE.start_gcd_test_~a) 63) (<= 18 ULTIMATE.start_gcd_test_~b))} is VALID [2020-07-29 01:42:13,377 INFO L280 TraceCheckUtils]: 6: Hoare triple {796#(and (<= (+ ULTIMATE.start_gcd_test_~b ULTIMATE.start_gcd_test_~a) 63) (<= 18 ULTIMATE.start_gcd_test_~b))} assume !!(0 != gcd_test_~b); {796#(and (<= (+ ULTIMATE.start_gcd_test_~b ULTIMATE.start_gcd_test_~a) 63) (<= 18 ULTIMATE.start_gcd_test_~b))} is VALID [2020-07-29 01:42:13,379 INFO L280 TraceCheckUtils]: 7: Hoare triple {796#(and (<= (+ ULTIMATE.start_gcd_test_~b ULTIMATE.start_gcd_test_~a) 63) (<= 18 ULTIMATE.start_gcd_test_~b))} assume gcd_test_~a > gcd_test_~b;gcd_test_~a := gcd_test_~a - gcd_test_~b; {803#(and (<= (+ (* 2 ULTIMATE.start_gcd_test_~b) ULTIMATE.start_gcd_test_~a) 63) (<= 18 ULTIMATE.start_gcd_test_~b))} is VALID [2020-07-29 01:42:13,387 INFO L280 TraceCheckUtils]: 8: Hoare triple {803#(and (<= (+ (* 2 ULTIMATE.start_gcd_test_~b) ULTIMATE.start_gcd_test_~a) 63) (<= 18 ULTIMATE.start_gcd_test_~b))} assume !!(0 != gcd_test_~b); {803#(and (<= (+ (* 2 ULTIMATE.start_gcd_test_~b) ULTIMATE.start_gcd_test_~a) 63) (<= 18 ULTIMATE.start_gcd_test_~b))} is VALID [2020-07-29 01:42:13,389 INFO L280 TraceCheckUtils]: 9: Hoare triple {803#(and (<= (+ (* 2 ULTIMATE.start_gcd_test_~b) ULTIMATE.start_gcd_test_~a) 63) (<= 18 ULTIMATE.start_gcd_test_~b))} assume gcd_test_~a > gcd_test_~b;gcd_test_~a := gcd_test_~a - gcd_test_~b; {810#(and (<= (+ (* 3 ULTIMATE.start_gcd_test_~b) ULTIMATE.start_gcd_test_~a) 63) (<= 18 ULTIMATE.start_gcd_test_~b))} is VALID [2020-07-29 01:42:13,389 INFO L280 TraceCheckUtils]: 10: Hoare triple {810#(and (<= (+ (* 3 ULTIMATE.start_gcd_test_~b) ULTIMATE.start_gcd_test_~a) 63) (<= 18 ULTIMATE.start_gcd_test_~b))} assume !!(0 != gcd_test_~b); {810#(and (<= (+ (* 3 ULTIMATE.start_gcd_test_~b) ULTIMATE.start_gcd_test_~a) 63) (<= 18 ULTIMATE.start_gcd_test_~b))} is VALID [2020-07-29 01:42:13,392 INFO L280 TraceCheckUtils]: 11: Hoare triple {810#(and (<= (+ (* 3 ULTIMATE.start_gcd_test_~b) ULTIMATE.start_gcd_test_~a) 63) (<= 18 ULTIMATE.start_gcd_test_~b))} assume !(gcd_test_~a > gcd_test_~b);gcd_test_~b := gcd_test_~b - gcd_test_~a; {817#(and (<= 18 (div (+ (* ULTIMATE.start_gcd_test_~a (- 1)) 63) 3)) (<= 18 (+ ULTIMATE.start_gcd_test_~b ULTIMATE.start_gcd_test_~a)))} is VALID [2020-07-29 01:42:13,397 INFO L280 TraceCheckUtils]: 12: Hoare triple {817#(and (<= 18 (div (+ (* ULTIMATE.start_gcd_test_~a (- 1)) 63) 3)) (<= 18 (+ ULTIMATE.start_gcd_test_~b ULTIMATE.start_gcd_test_~a)))} assume !!(0 != gcd_test_~b); {817#(and (<= 18 (div (+ (* ULTIMATE.start_gcd_test_~a (- 1)) 63) 3)) (<= 18 (+ ULTIMATE.start_gcd_test_~b ULTIMATE.start_gcd_test_~a)))} is VALID [2020-07-29 01:42:13,399 INFO L280 TraceCheckUtils]: 13: Hoare triple {817#(and (<= 18 (div (+ (* ULTIMATE.start_gcd_test_~a (- 1)) 63) 3)) (<= 18 (+ ULTIMATE.start_gcd_test_~b ULTIMATE.start_gcd_test_~a)))} assume gcd_test_~a > gcd_test_~b;gcd_test_~a := gcd_test_~a - gcd_test_~b; {771#false} is VALID [2020-07-29 01:42:13,400 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 12 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-29 01:42:13,400 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-07-29 01:42:13,401 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 10 [2020-07-29 01:42:13,401 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1385900891] [2020-07-29 01:42:13,402 INFO L799 eck$LassoCheckResult]: stem already infeasible [2020-07-29 01:42:13,402 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 01:42:13,402 INFO L82 PathProgramCache]: Analyzing trace with hash 1830, now seen corresponding path program 6 times [2020-07-29 01:42:13,402 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 01:42:13,403 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [158654527] [2020-07-29 01:42:13,403 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 01:42:13,411 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 01:42:13,412 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 01:42:13,413 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 01:42:13,415 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 01:42:13,418 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-07-29 01:42:13,441 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-29 01:42:13,441 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-07-29 01:42:13,441 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=89, Unknown=0, NotChecked=0, Total=132 [2020-07-29 01:42:13,441 INFO L87 Difference]: Start difference. First operand 16 states and 18 transitions. cyclomatic complexity: 4 Second operand 12 states. [2020-07-29 01:42:13,644 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-29 01:42:13,644 INFO L93 Difference]: Finished difference Result 20 states and 22 transitions. [2020-07-29 01:42:13,644 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-07-29 01:42:13,644 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 12 states. [2020-07-29 01:42:13,680 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 28 edges. 28 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-29 01:42:13,680 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 20 states and 22 transitions. [2020-07-29 01:42:13,682 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2020-07-29 01:42:13,683 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 20 states to 19 states and 21 transitions. [2020-07-29 01:42:13,683 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 14 [2020-07-29 01:42:13,683 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 14 [2020-07-29 01:42:13,683 INFO L73 IsDeterministic]: Start isDeterministic. Operand 19 states and 21 transitions. [2020-07-29 01:42:13,686 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2020-07-29 01:42:13,686 INFO L688 BuchiCegarLoop]: Abstraction has 19 states and 21 transitions. [2020-07-29 01:42:13,686 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19 states and 21 transitions. [2020-07-29 01:42:13,688 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19 to 18. [2020-07-29 01:42:13,688 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-29 01:42:13,688 INFO L82 GeneralOperation]: Start isEquivalent. First operand 19 states and 21 transitions. Second operand 18 states. [2020-07-29 01:42:13,688 INFO L74 IsIncluded]: Start isIncluded. First operand 19 states and 21 transitions. Second operand 18 states. [2020-07-29 01:42:13,689 INFO L87 Difference]: Start difference. First operand 19 states and 21 transitions. Second operand 18 states. [2020-07-29 01:42:13,690 INFO L149 Difference]: Subtrahend was not deterministic. Recomputing result with determinization. [2020-07-29 01:42:13,691 INFO L93 Difference]: Finished difference Result 19 states and 21 transitions. [2020-07-29 01:42:13,691 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 21 transitions. [2020-07-29 01:42:13,692 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-29 01:42:13,692 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-29 01:42:13,692 INFO L74 IsIncluded]: Start isIncluded. First operand 18 states. Second operand 19 states and 21 transitions. [2020-07-29 01:42:13,692 INFO L87 Difference]: Start difference. First operand 18 states. Second operand 19 states and 21 transitions. [2020-07-29 01:42:13,693 INFO L149 Difference]: Subtrahend was not deterministic. Recomputing result with determinization. [2020-07-29 01:42:13,695 INFO L93 Difference]: Finished difference Result 19 states and 21 transitions. [2020-07-29 01:42:13,696 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 21 transitions. [2020-07-29 01:42:13,698 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-29 01:42:13,698 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-29 01:42:13,698 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-29 01:42:13,698 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-29 01:42:13,699 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2020-07-29 01:42:13,709 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 20 transitions. [2020-07-29 01:42:13,709 INFO L711 BuchiCegarLoop]: Abstraction has 18 states and 20 transitions. [2020-07-29 01:42:13,709 INFO L591 BuchiCegarLoop]: Abstraction has 18 states and 20 transitions. [2020-07-29 01:42:13,709 INFO L424 BuchiCegarLoop]: ======== Iteration 7============ [2020-07-29 01:42:13,710 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 18 states and 20 transitions. [2020-07-29 01:42:13,710 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2020-07-29 01:42:13,711 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 01:42:13,711 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 01:42:13,712 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [6, 4, 2, 1, 1, 1, 1] [2020-07-29 01:42:13,712 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2020-07-29 01:42:13,712 INFO L794 eck$LassoCheckResult]: Stem: 847#ULTIMATE.startENTRY havoc main_#res;havoc main_#t~ret0, main_~x~0, main_~y~0, main_~g~0;havoc main_~x~0;havoc main_~y~0;havoc main_~g~0;main_~x~0 := 63;main_~y~0 := 18;gcd_test_#in~a, gcd_test_#in~b := main_~x~0, main_~y~0;havoc gcd_test_#res;havoc gcd_test_~a, gcd_test_~b;gcd_test_~a := gcd_test_#in~a;gcd_test_~b := gcd_test_#in~b; 848#L12 assume !(gcd_test_~a < 0); 845#L12-2 assume !(gcd_test_~b < 0); 846#L13-1 assume !(0 == gcd_test_~a); 849#L20-2 assume !!(0 != gcd_test_~b); 862#L20 assume gcd_test_~a > gcd_test_~b;gcd_test_~a := gcd_test_~a - gcd_test_~b; 861#L20-2 assume !!(0 != gcd_test_~b); 860#L20 assume gcd_test_~a > gcd_test_~b;gcd_test_~a := gcd_test_~a - gcd_test_~b; 859#L20-2 assume !!(0 != gcd_test_~b); 858#L20 assume gcd_test_~a > gcd_test_~b;gcd_test_~a := gcd_test_~a - gcd_test_~b; 856#L20-2 assume !!(0 != gcd_test_~b); 857#L20 assume !(gcd_test_~a > gcd_test_~b);gcd_test_~b := gcd_test_~b - gcd_test_~a; 852#L20-2 assume !!(0 != gcd_test_~b); 853#L20 assume !(gcd_test_~a > gcd_test_~b);gcd_test_~b := gcd_test_~b - gcd_test_~a; 855#L20-2 assume !!(0 != gcd_test_~b); 854#L20 assume gcd_test_~a > gcd_test_~b;gcd_test_~a := gcd_test_~a - gcd_test_~b; 850#L20-2 [2020-07-29 01:42:13,714 INFO L796 eck$LassoCheckResult]: Loop: 850#L20-2 assume !!(0 != gcd_test_~b); 851#L20 assume !(gcd_test_~a > gcd_test_~b);gcd_test_~b := gcd_test_~b - gcd_test_~a; 850#L20-2 [2020-07-29 01:42:13,715 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 01:42:13,715 INFO L82 PathProgramCache]: Analyzing trace with hash 1726393730, now seen corresponding path program 5 times [2020-07-29 01:42:13,715 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 01:42:13,716 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [480224473] [2020-07-29 01:42:13,716 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 01:42:13,740 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:42:13,932 INFO L280 TraceCheckUtils]: 0: Hoare triple {974#true} havoc main_#res;havoc main_#t~ret0, main_~x~0, main_~y~0, main_~g~0;havoc main_~x~0;havoc main_~y~0;havoc main_~g~0;main_~x~0 := 63;main_~y~0 := 18;gcd_test_#in~a, gcd_test_#in~b := main_~x~0, main_~y~0;havoc gcd_test_#res;havoc gcd_test_~a, gcd_test_~b;gcd_test_~a := gcd_test_#in~a;gcd_test_~b := gcd_test_#in~b; {976#(and (= 63 ULTIMATE.start_gcd_test_~a) (= 18 ULTIMATE.start_gcd_test_~b))} is VALID [2020-07-29 01:42:13,933 INFO L280 TraceCheckUtils]: 1: Hoare triple {976#(and (= 63 ULTIMATE.start_gcd_test_~a) (= 18 ULTIMATE.start_gcd_test_~b))} assume !(gcd_test_~a < 0); {976#(and (= 63 ULTIMATE.start_gcd_test_~a) (= 18 ULTIMATE.start_gcd_test_~b))} is VALID [2020-07-29 01:42:13,934 INFO L280 TraceCheckUtils]: 2: Hoare triple {976#(and (= 63 ULTIMATE.start_gcd_test_~a) (= 18 ULTIMATE.start_gcd_test_~b))} assume !(gcd_test_~b < 0); {976#(and (= 63 ULTIMATE.start_gcd_test_~a) (= 18 ULTIMATE.start_gcd_test_~b))} is VALID [2020-07-29 01:42:13,935 INFO L280 TraceCheckUtils]: 3: Hoare triple {976#(and (= 63 ULTIMATE.start_gcd_test_~a) (= 18 ULTIMATE.start_gcd_test_~b))} assume !(0 == gcd_test_~a); {976#(and (= 63 ULTIMATE.start_gcd_test_~a) (= 18 ULTIMATE.start_gcd_test_~b))} is VALID [2020-07-29 01:42:13,936 INFO L280 TraceCheckUtils]: 4: Hoare triple {976#(and (= 63 ULTIMATE.start_gcd_test_~a) (= 18 ULTIMATE.start_gcd_test_~b))} assume !!(0 != gcd_test_~b); {976#(and (= 63 ULTIMATE.start_gcd_test_~a) (= 18 ULTIMATE.start_gcd_test_~b))} is VALID [2020-07-29 01:42:13,937 INFO L280 TraceCheckUtils]: 5: Hoare triple {976#(and (= 63 ULTIMATE.start_gcd_test_~a) (= 18 ULTIMATE.start_gcd_test_~b))} assume gcd_test_~a > gcd_test_~b;gcd_test_~a := gcd_test_~a - gcd_test_~b; {977#(and (<= (+ ULTIMATE.start_gcd_test_~b ULTIMATE.start_gcd_test_~a) 63) (= 18 ULTIMATE.start_gcd_test_~b) (<= 63 (+ ULTIMATE.start_gcd_test_~b ULTIMATE.start_gcd_test_~a)))} is VALID [2020-07-29 01:42:13,938 INFO L280 TraceCheckUtils]: 6: Hoare triple {977#(and (<= (+ ULTIMATE.start_gcd_test_~b ULTIMATE.start_gcd_test_~a) 63) (= 18 ULTIMATE.start_gcd_test_~b) (<= 63 (+ ULTIMATE.start_gcd_test_~b ULTIMATE.start_gcd_test_~a)))} assume !!(0 != gcd_test_~b); {977#(and (<= (+ ULTIMATE.start_gcd_test_~b ULTIMATE.start_gcd_test_~a) 63) (= 18 ULTIMATE.start_gcd_test_~b) (<= 63 (+ ULTIMATE.start_gcd_test_~b ULTIMATE.start_gcd_test_~a)))} is VALID [2020-07-29 01:42:13,939 INFO L280 TraceCheckUtils]: 7: Hoare triple {977#(and (<= (+ ULTIMATE.start_gcd_test_~b ULTIMATE.start_gcd_test_~a) 63) (= 18 ULTIMATE.start_gcd_test_~b) (<= 63 (+ ULTIMATE.start_gcd_test_~b ULTIMATE.start_gcd_test_~a)))} assume gcd_test_~a > gcd_test_~b;gcd_test_~a := gcd_test_~a - gcd_test_~b; {978#(and (<= (+ (* 2 ULTIMATE.start_gcd_test_~b) ULTIMATE.start_gcd_test_~a) 63) (= 18 ULTIMATE.start_gcd_test_~b) (<= 63 (+ (* 2 ULTIMATE.start_gcd_test_~b) ULTIMATE.start_gcd_test_~a)))} is VALID [2020-07-29 01:42:13,940 INFO L280 TraceCheckUtils]: 8: Hoare triple {978#(and (<= (+ (* 2 ULTIMATE.start_gcd_test_~b) ULTIMATE.start_gcd_test_~a) 63) (= 18 ULTIMATE.start_gcd_test_~b) (<= 63 (+ (* 2 ULTIMATE.start_gcd_test_~b) ULTIMATE.start_gcd_test_~a)))} assume !!(0 != gcd_test_~b); {978#(and (<= (+ (* 2 ULTIMATE.start_gcd_test_~b) ULTIMATE.start_gcd_test_~a) 63) (= 18 ULTIMATE.start_gcd_test_~b) (<= 63 (+ (* 2 ULTIMATE.start_gcd_test_~b) ULTIMATE.start_gcd_test_~a)))} is VALID [2020-07-29 01:42:13,942 INFO L280 TraceCheckUtils]: 9: Hoare triple {978#(and (<= (+ (* 2 ULTIMATE.start_gcd_test_~b) ULTIMATE.start_gcd_test_~a) 63) (= 18 ULTIMATE.start_gcd_test_~b) (<= 63 (+ (* 2 ULTIMATE.start_gcd_test_~b) ULTIMATE.start_gcd_test_~a)))} assume gcd_test_~a > gcd_test_~b;gcd_test_~a := gcd_test_~a - gcd_test_~b; {979#(and (<= 63 (+ (* 3 ULTIMATE.start_gcd_test_~b) ULTIMATE.start_gcd_test_~a)) (= 18 ULTIMATE.start_gcd_test_~b) (<= (+ (* 3 ULTIMATE.start_gcd_test_~b) ULTIMATE.start_gcd_test_~a) 63))} is VALID [2020-07-29 01:42:13,943 INFO L280 TraceCheckUtils]: 10: Hoare triple {979#(and (<= 63 (+ (* 3 ULTIMATE.start_gcd_test_~b) ULTIMATE.start_gcd_test_~a)) (= 18 ULTIMATE.start_gcd_test_~b) (<= (+ (* 3 ULTIMATE.start_gcd_test_~b) ULTIMATE.start_gcd_test_~a) 63))} assume !!(0 != gcd_test_~b); {979#(and (<= 63 (+ (* 3 ULTIMATE.start_gcd_test_~b) ULTIMATE.start_gcd_test_~a)) (= 18 ULTIMATE.start_gcd_test_~b) (<= (+ (* 3 ULTIMATE.start_gcd_test_~b) ULTIMATE.start_gcd_test_~a) 63))} is VALID [2020-07-29 01:42:13,944 INFO L280 TraceCheckUtils]: 11: Hoare triple {979#(and (<= 63 (+ (* 3 ULTIMATE.start_gcd_test_~b) ULTIMATE.start_gcd_test_~a)) (= 18 ULTIMATE.start_gcd_test_~b) (<= (+ (* 3 ULTIMATE.start_gcd_test_~b) ULTIMATE.start_gcd_test_~a) 63))} assume !(gcd_test_~a > gcd_test_~b);gcd_test_~b := gcd_test_~b - gcd_test_~a; {980#(and (<= ULTIMATE.start_gcd_test_~a ULTIMATE.start_gcd_test_~b) (<= ULTIMATE.start_gcd_test_~b ULTIMATE.start_gcd_test_~a))} is VALID [2020-07-29 01:42:13,945 INFO L280 TraceCheckUtils]: 12: Hoare triple {980#(and (<= ULTIMATE.start_gcd_test_~a ULTIMATE.start_gcd_test_~b) (<= ULTIMATE.start_gcd_test_~b ULTIMATE.start_gcd_test_~a))} assume !!(0 != gcd_test_~b); {980#(and (<= ULTIMATE.start_gcd_test_~a ULTIMATE.start_gcd_test_~b) (<= ULTIMATE.start_gcd_test_~b ULTIMATE.start_gcd_test_~a))} is VALID [2020-07-29 01:42:13,947 INFO L280 TraceCheckUtils]: 13: Hoare triple {980#(and (<= ULTIMATE.start_gcd_test_~a ULTIMATE.start_gcd_test_~b) (<= ULTIMATE.start_gcd_test_~b ULTIMATE.start_gcd_test_~a))} assume !(gcd_test_~a > gcd_test_~b);gcd_test_~b := gcd_test_~b - gcd_test_~a; {981#(and (<= ULTIMATE.start_gcd_test_~b 0) (<= 0 ULTIMATE.start_gcd_test_~b))} is VALID [2020-07-29 01:42:13,948 INFO L280 TraceCheckUtils]: 14: Hoare triple {981#(and (<= ULTIMATE.start_gcd_test_~b 0) (<= 0 ULTIMATE.start_gcd_test_~b))} assume !!(0 != gcd_test_~b); {975#false} is VALID [2020-07-29 01:42:13,948 INFO L280 TraceCheckUtils]: 15: Hoare triple {975#false} assume gcd_test_~a > gcd_test_~b;gcd_test_~a := gcd_test_~a - gcd_test_~b; {975#false} is VALID [2020-07-29 01:42:13,949 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 5 proven. 25 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-29 01:42:13,949 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [480224473] [2020-07-29 01:42:13,950 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1156125799] [2020-07-29 01:42:13,950 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-07-29 01:42:13,971 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 6 check-sat command(s) [2020-07-29 01:42:13,972 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-07-29 01:42:13,973 WARN L261 TraceCheckSpWp]: Trace formula consists of 41 conjuncts, 23 conjunts are in the unsatisfiable core [2020-07-29 01:42:13,977 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:42:13,978 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-29 01:42:14,125 INFO L280 TraceCheckUtils]: 0: Hoare triple {974#true} havoc main_#res;havoc main_#t~ret0, main_~x~0, main_~y~0, main_~g~0;havoc main_~x~0;havoc main_~y~0;havoc main_~g~0;main_~x~0 := 63;main_~y~0 := 18;gcd_test_#in~a, gcd_test_#in~b := main_~x~0, main_~y~0;havoc gcd_test_#res;havoc gcd_test_~a, gcd_test_~b;gcd_test_~a := gcd_test_#in~a;gcd_test_~b := gcd_test_#in~b; {976#(and (= 63 ULTIMATE.start_gcd_test_~a) (= 18 ULTIMATE.start_gcd_test_~b))} is VALID [2020-07-29 01:42:14,126 INFO L280 TraceCheckUtils]: 1: Hoare triple {976#(and (= 63 ULTIMATE.start_gcd_test_~a) (= 18 ULTIMATE.start_gcd_test_~b))} assume !(gcd_test_~a < 0); {976#(and (= 63 ULTIMATE.start_gcd_test_~a) (= 18 ULTIMATE.start_gcd_test_~b))} is VALID [2020-07-29 01:42:14,127 INFO L280 TraceCheckUtils]: 2: Hoare triple {976#(and (= 63 ULTIMATE.start_gcd_test_~a) (= 18 ULTIMATE.start_gcd_test_~b))} assume !(gcd_test_~b < 0); {976#(and (= 63 ULTIMATE.start_gcd_test_~a) (= 18 ULTIMATE.start_gcd_test_~b))} is VALID [2020-07-29 01:42:14,128 INFO L280 TraceCheckUtils]: 3: Hoare triple {976#(and (= 63 ULTIMATE.start_gcd_test_~a) (= 18 ULTIMATE.start_gcd_test_~b))} assume !(0 == gcd_test_~a); {976#(and (= 63 ULTIMATE.start_gcd_test_~a) (= 18 ULTIMATE.start_gcd_test_~b))} is VALID [2020-07-29 01:42:14,128 INFO L280 TraceCheckUtils]: 4: Hoare triple {976#(and (= 63 ULTIMATE.start_gcd_test_~a) (= 18 ULTIMATE.start_gcd_test_~b))} assume !!(0 != gcd_test_~b); {976#(and (= 63 ULTIMATE.start_gcd_test_~a) (= 18 ULTIMATE.start_gcd_test_~b))} is VALID [2020-07-29 01:42:14,129 INFO L280 TraceCheckUtils]: 5: Hoare triple {976#(and (= 63 ULTIMATE.start_gcd_test_~a) (= 18 ULTIMATE.start_gcd_test_~b))} assume gcd_test_~a > gcd_test_~b;gcd_test_~a := gcd_test_~a - gcd_test_~b; {977#(and (<= (+ ULTIMATE.start_gcd_test_~b ULTIMATE.start_gcd_test_~a) 63) (= 18 ULTIMATE.start_gcd_test_~b) (<= 63 (+ ULTIMATE.start_gcd_test_~b ULTIMATE.start_gcd_test_~a)))} is VALID [2020-07-29 01:42:14,133 INFO L280 TraceCheckUtils]: 6: Hoare triple {977#(and (<= (+ ULTIMATE.start_gcd_test_~b ULTIMATE.start_gcd_test_~a) 63) (= 18 ULTIMATE.start_gcd_test_~b) (<= 63 (+ ULTIMATE.start_gcd_test_~b ULTIMATE.start_gcd_test_~a)))} assume !!(0 != gcd_test_~b); {977#(and (<= (+ ULTIMATE.start_gcd_test_~b ULTIMATE.start_gcd_test_~a) 63) (= 18 ULTIMATE.start_gcd_test_~b) (<= 63 (+ ULTIMATE.start_gcd_test_~b ULTIMATE.start_gcd_test_~a)))} is VALID [2020-07-29 01:42:14,136 INFO L280 TraceCheckUtils]: 7: Hoare triple {977#(and (<= (+ ULTIMATE.start_gcd_test_~b ULTIMATE.start_gcd_test_~a) 63) (= 18 ULTIMATE.start_gcd_test_~b) (<= 63 (+ ULTIMATE.start_gcd_test_~b ULTIMATE.start_gcd_test_~a)))} assume gcd_test_~a > gcd_test_~b;gcd_test_~a := gcd_test_~a - gcd_test_~b; {978#(and (<= (+ (* 2 ULTIMATE.start_gcd_test_~b) ULTIMATE.start_gcd_test_~a) 63) (= 18 ULTIMATE.start_gcd_test_~b) (<= 63 (+ (* 2 ULTIMATE.start_gcd_test_~b) ULTIMATE.start_gcd_test_~a)))} is VALID [2020-07-29 01:42:14,137 INFO L280 TraceCheckUtils]: 8: Hoare triple {978#(and (<= (+ (* 2 ULTIMATE.start_gcd_test_~b) ULTIMATE.start_gcd_test_~a) 63) (= 18 ULTIMATE.start_gcd_test_~b) (<= 63 (+ (* 2 ULTIMATE.start_gcd_test_~b) ULTIMATE.start_gcd_test_~a)))} assume !!(0 != gcd_test_~b); {978#(and (<= (+ (* 2 ULTIMATE.start_gcd_test_~b) ULTIMATE.start_gcd_test_~a) 63) (= 18 ULTIMATE.start_gcd_test_~b) (<= 63 (+ (* 2 ULTIMATE.start_gcd_test_~b) ULTIMATE.start_gcd_test_~a)))} is VALID [2020-07-29 01:42:14,139 INFO L280 TraceCheckUtils]: 9: Hoare triple {978#(and (<= (+ (* 2 ULTIMATE.start_gcd_test_~b) ULTIMATE.start_gcd_test_~a) 63) (= 18 ULTIMATE.start_gcd_test_~b) (<= 63 (+ (* 2 ULTIMATE.start_gcd_test_~b) ULTIMATE.start_gcd_test_~a)))} assume gcd_test_~a > gcd_test_~b;gcd_test_~a := gcd_test_~a - gcd_test_~b; {979#(and (<= 63 (+ (* 3 ULTIMATE.start_gcd_test_~b) ULTIMATE.start_gcd_test_~a)) (= 18 ULTIMATE.start_gcd_test_~b) (<= (+ (* 3 ULTIMATE.start_gcd_test_~b) ULTIMATE.start_gcd_test_~a) 63))} is VALID [2020-07-29 01:42:14,140 INFO L280 TraceCheckUtils]: 10: Hoare triple {979#(and (<= 63 (+ (* 3 ULTIMATE.start_gcd_test_~b) ULTIMATE.start_gcd_test_~a)) (= 18 ULTIMATE.start_gcd_test_~b) (<= (+ (* 3 ULTIMATE.start_gcd_test_~b) ULTIMATE.start_gcd_test_~a) 63))} assume !!(0 != gcd_test_~b); {979#(and (<= 63 (+ (* 3 ULTIMATE.start_gcd_test_~b) ULTIMATE.start_gcd_test_~a)) (= 18 ULTIMATE.start_gcd_test_~b) (<= (+ (* 3 ULTIMATE.start_gcd_test_~b) ULTIMATE.start_gcd_test_~a) 63))} is VALID [2020-07-29 01:42:14,140 INFO L280 TraceCheckUtils]: 11: Hoare triple {979#(and (<= 63 (+ (* 3 ULTIMATE.start_gcd_test_~b) ULTIMATE.start_gcd_test_~a)) (= 18 ULTIMATE.start_gcd_test_~b) (<= (+ (* 3 ULTIMATE.start_gcd_test_~b) ULTIMATE.start_gcd_test_~a) 63))} assume !(gcd_test_~a > gcd_test_~b);gcd_test_~b := gcd_test_~b - gcd_test_~a; {1018#(and (= (+ ULTIMATE.start_gcd_test_~b ULTIMATE.start_gcd_test_~a) 18) (<= ULTIMATE.start_gcd_test_~a 9) (<= 9 ULTIMATE.start_gcd_test_~a))} is VALID [2020-07-29 01:42:14,141 INFO L280 TraceCheckUtils]: 12: Hoare triple {1018#(and (= (+ ULTIMATE.start_gcd_test_~b ULTIMATE.start_gcd_test_~a) 18) (<= ULTIMATE.start_gcd_test_~a 9) (<= 9 ULTIMATE.start_gcd_test_~a))} assume !!(0 != gcd_test_~b); {1018#(and (= (+ ULTIMATE.start_gcd_test_~b ULTIMATE.start_gcd_test_~a) 18) (<= ULTIMATE.start_gcd_test_~a 9) (<= 9 ULTIMATE.start_gcd_test_~a))} is VALID [2020-07-29 01:42:14,143 INFO L280 TraceCheckUtils]: 13: Hoare triple {1018#(and (= (+ ULTIMATE.start_gcd_test_~b ULTIMATE.start_gcd_test_~a) 18) (<= ULTIMATE.start_gcd_test_~a 9) (<= 9 ULTIMATE.start_gcd_test_~a))} assume !(gcd_test_~a > gcd_test_~b);gcd_test_~b := gcd_test_~b - gcd_test_~a; {981#(and (<= ULTIMATE.start_gcd_test_~b 0) (<= 0 ULTIMATE.start_gcd_test_~b))} is VALID [2020-07-29 01:42:14,143 INFO L280 TraceCheckUtils]: 14: Hoare triple {981#(and (<= ULTIMATE.start_gcd_test_~b 0) (<= 0 ULTIMATE.start_gcd_test_~b))} assume !!(0 != gcd_test_~b); {975#false} is VALID [2020-07-29 01:42:14,144 INFO L280 TraceCheckUtils]: 15: Hoare triple {975#false} assume gcd_test_~a > gcd_test_~b;gcd_test_~a := gcd_test_~a - gcd_test_~b; {975#false} is VALID [2020-07-29 01:42:14,145 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 5 proven. 25 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-29 01:42:14,145 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-07-29 01:42:14,145 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 8 [2020-07-29 01:42:14,145 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1889201790] [2020-07-29 01:42:14,146 INFO L799 eck$LassoCheckResult]: stem already infeasible [2020-07-29 01:42:14,146 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 01:42:14,146 INFO L82 PathProgramCache]: Analyzing trace with hash 1830, now seen corresponding path program 7 times [2020-07-29 01:42:14,146 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 01:42:14,146 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [426723758] [2020-07-29 01:42:14,147 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 01:42:14,150 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 01:42:14,151 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 01:42:14,153 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 01:42:14,156 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 01:42:14,157 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-07-29 01:42:14,175 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-29 01:42:14,176 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-07-29 01:42:14,176 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2020-07-29 01:42:14,176 INFO L87 Difference]: Start difference. First operand 18 states and 20 transitions. cyclomatic complexity: 4 Second operand 9 states. [2020-07-29 01:42:14,411 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-29 01:42:14,411 INFO L93 Difference]: Finished difference Result 15 states and 14 transitions. [2020-07-29 01:42:14,411 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-07-29 01:42:14,411 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 9 states. [2020-07-29 01:42:14,448 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 19 edges. 19 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-29 01:42:14,448 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 15 states and 14 transitions. [2020-07-29 01:42:14,449 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2020-07-29 01:42:14,449 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 15 states to 0 states and 0 transitions. [2020-07-29 01:42:14,450 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2020-07-29 01:42:14,450 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2020-07-29 01:42:14,450 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2020-07-29 01:42:14,450 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-07-29 01:42:14,450 INFO L688 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2020-07-29 01:42:14,450 INFO L711 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2020-07-29 01:42:14,451 INFO L591 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2020-07-29 01:42:14,451 INFO L424 BuchiCegarLoop]: ======== Iteration 8============ [2020-07-29 01:42:14,451 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2020-07-29 01:42:14,451 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2020-07-29 01:42:14,451 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2020-07-29 01:42:14,458 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 29.07 01:42:14 BoogieIcfgContainer [2020-07-29 01:42:14,458 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2020-07-29 01:42:14,459 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2020-07-29 01:42:14,459 INFO L271 PluginConnector]: Initializing Witness Printer... [2020-07-29 01:42:14,459 INFO L275 PluginConnector]: Witness Printer initialized [2020-07-29 01:42:14,460 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.07 01:42:07" (3/4) ... [2020-07-29 01:42:14,463 INFO L140 WitnessPrinter]: No result that supports witness generation found [2020-07-29 01:42:14,463 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2020-07-29 01:42:14,466 INFO L168 Benchmark]: Toolchain (without parser) took 7867.67 ms. Allocated memory was 1.0 GB in the beginning and 1.3 GB in the end (delta: 287.3 MB). Free memory was 958.9 MB in the beginning and 1.1 GB in the end (delta: -169.1 MB). Peak memory consumption was 118.2 MB. Max. memory is 11.5 GB. [2020-07-29 01:42:14,467 INFO L168 Benchmark]: CDTParser took 0.29 ms. Allocated memory is still 1.0 GB. Free memory is still 987.1 MB. There was no memory consumed. Max. memory is 11.5 GB. [2020-07-29 01:42:14,467 INFO L168 Benchmark]: CACSL2BoogieTranslator took 266.50 ms. Allocated memory is still 1.0 GB. Free memory was 958.9 MB in the beginning and 946.8 MB in the end (delta: 12.1 MB). Peak memory consumption was 12.1 MB. Max. memory is 11.5 GB. [2020-07-29 01:42:14,468 INFO L168 Benchmark]: Boogie Procedure Inliner took 125.72 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 137.9 MB). Free memory was 946.8 MB in the beginning and 1.1 GB in the end (delta: -180.9 MB). Peak memory consumption was 9.6 MB. Max. memory is 11.5 GB. [2020-07-29 01:42:14,468 INFO L168 Benchmark]: Boogie Preprocessor took 45.72 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2020-07-29 01:42:14,469 INFO L168 Benchmark]: RCFGBuilder took 578.66 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: 19.4 MB). Peak memory consumption was 19.4 MB. Max. memory is 11.5 GB. [2020-07-29 01:42:14,470 INFO L168 Benchmark]: BuchiAutomizer took 6839.56 ms. Allocated memory was 1.2 GB in the beginning and 1.3 GB in the end (delta: 149.4 MB). Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: -19.7 MB). Peak memory consumption was 129.7 MB. Max. memory is 11.5 GB. [2020-07-29 01:42:14,470 INFO L168 Benchmark]: Witness Printer took 4.71 ms. Allocated memory is still 1.3 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 24 B). Peak memory consumption was 24 B. Max. memory is 11.5 GB. [2020-07-29 01:42:14,474 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - AssertionsEnabledResult: Assertions are enabled Assertions are enabled - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.29 ms. Allocated memory is still 1.0 GB. Free memory is still 987.1 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 266.50 ms. Allocated memory is still 1.0 GB. Free memory was 958.9 MB in the beginning and 946.8 MB in the end (delta: 12.1 MB). Peak memory consumption was 12.1 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 125.72 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 137.9 MB). Free memory was 946.8 MB in the beginning and 1.1 GB in the end (delta: -180.9 MB). Peak memory consumption was 9.6 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 45.72 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * RCFGBuilder took 578.66 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: 19.4 MB). Peak memory consumption was 19.4 MB. Max. memory is 11.5 GB. * BuchiAutomizer took 6839.56 ms. Allocated memory was 1.2 GB in the beginning and 1.3 GB in the end (delta: 149.4 MB). Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: -19.7 MB). Peak memory consumption was 129.7 MB. Max. memory is 11.5 GB. * Witness Printer took 4.71 ms. Allocated memory is still 1.3 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 24 B). Peak memory consumption was 24 B. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Constructed decomposition of program Your program was decomposed into 7 terminating modules (6 trivial, 0 deterministic, 1 nondeterministic). One nondeterministic module has affine ranking function b and consists of 7 locations. 6 modules have a trivial ranking function, the largest among these consists of 12 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 6.7s and 8 iterations. TraceHistogramMax:6. Analysis of lassos took 4.2s. Construction of modules took 0.4s. Büchi inclusion checks took 1.8s. Highest rank in rank-based complementation 3. Minimization of det autom 4. Minimization of nondet autom 3. Automata minimization 0.0s AutomataMinimizationTime, 6 MinimizatonAttempts, 4 StatesRemovedByMinimization, 3 NontrivialMinimizations. Non-live state removal took 0.0s Buchi closure took 0.0s. Biggest automaton had 18 states and ocurred in iteration 6. Nontrivial modules had stage [0, 0, 1, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 27 SDtfs, 48 SDslu, 12 SDs, 0 SdLazy, 267 SolverSat, 33 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.4s Time LassoAnalysisResults: nont0 unkn0 SFLI0 SFLT0 conc3 concLT0 SILN3 SILU0 SILI0 SILT0 lasso1 LassoPreprocessingBenchmarks: Lassos: inital39 mio100 ax100 hnf92 lsp100 ukn100 mio100 lsp100 div100 bol100 ite100 ukn100 eq205 hnf90 smp100 dnf122 smp100 tf100 neg97 sie104 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: sat Degree: 0 Time: 142ms VariablesStem: 6 VariablesLoop: 3 DisjunctsStem: 1 DisjunctsLoop: 2 SupportingInvariants: 4 MotzkinApplications: 16 LassoTerminationAnalysisBenchmarks: LassoNonterminationAnalysisSatFixpoint: 0 LassoNonterminationAnalysisSatUnbounded: 0 LassoNonterminationAnalysisUnsat: 1 LassoNonterminationAnalysisUnknown: 0 LassoNonterminationAnalysisTime: 0.3s - TerminationAnalysisResult: Termination proven Buchi Automizer proved that your program is terminating RESULT: Ultimate proved your program to be correct! Received shutdown request...