./Ultimate.py --spec ../sv-benchmarks/c/properties/termination.prp --file ../sv-benchmarks/c/bitvector/gcd_4.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for termination Using default analysis Version 30f4e4ab Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx12G -Xms1G -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerTermination.xml -i ../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.24-30f4e4a [2019-11-28 03:05:21,621 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-28 03:05:21,623 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-28 03:05:21,641 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-28 03:05:21,642 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-28 03:05:21,644 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-28 03:05:21,646 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-28 03:05:21,656 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-28 03:05:21,662 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-28 03:05:21,665 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-28 03:05:21,666 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-28 03:05:21,668 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-28 03:05:21,669 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-28 03:05:21,672 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-28 03:05:21,673 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-28 03:05:21,675 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-28 03:05:21,676 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-28 03:05:21,677 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-28 03:05:21,680 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-28 03:05:21,684 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-28 03:05:21,688 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-28 03:05:21,692 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-28 03:05:21,694 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-28 03:05:21,696 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-28 03:05:21,698 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-28 03:05:21,698 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-28 03:05:21,699 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-28 03:05:21,700 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-28 03:05:21,701 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-28 03:05:21,702 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-28 03:05:21,702 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-28 03:05:21,703 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-28 03:05:21,703 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-28 03:05:21,705 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-28 03:05:21,706 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-28 03:05:21,706 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-28 03:05:21,707 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-28 03:05:21,707 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-28 03:05:21,707 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-28 03:05:21,708 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-28 03:05:21,710 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-28 03:05:21,710 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-32bit-Automizer_Default.epf [2019-11-28 03:05:21,745 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-28 03:05:21,748 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-28 03:05:21,750 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-11-28 03:05:21,750 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-11-28 03:05:21,750 INFO L138 SettingsManager]: * Use SBE=true [2019-11-28 03:05:21,751 INFO L136 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2019-11-28 03:05:21,751 INFO L138 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2019-11-28 03:05:21,751 INFO L138 SettingsManager]: * Use old map elimination=false [2019-11-28 03:05:21,751 INFO L138 SettingsManager]: * Use external solver (rank synthesis)=false [2019-11-28 03:05:21,751 INFO L138 SettingsManager]: * Use only trivial implications for array writes=true [2019-11-28 03:05:21,752 INFO L138 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2019-11-28 03:05:21,752 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-28 03:05:21,753 INFO L138 SettingsManager]: * sizeof long=4 [2019-11-28 03:05:21,753 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2019-11-28 03:05:21,753 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-11-28 03:05:21,753 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-11-28 03:05:21,754 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-28 03:05:21,754 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2019-11-28 03:05:21,754 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2019-11-28 03:05:21,754 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2019-11-28 03:05:21,755 INFO L138 SettingsManager]: * sizeof long double=12 [2019-11-28 03:05:21,755 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-11-28 03:05:21,755 INFO L138 SettingsManager]: * Assume nondeterminstic values are in range=false [2019-11-28 03:05:21,755 INFO L138 SettingsManager]: * Use constant arrays=true [2019-11-28 03:05:21,755 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2019-11-28 03:05:21,756 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-28 03:05:21,756 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-11-28 03:05:21,756 INFO L138 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2019-11-28 03:05:21,757 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-28 03:05:21,757 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-11-28 03:05:21,757 INFO L138 SettingsManager]: * Dump automata to the following directory=/home/matthias/ultimate/dump/auto [2019-11-28 03:05:21,759 INFO L136 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2019-11-28 03:05:21,759 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 [2019-11-28 03:05:22,059 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-28 03:05:22,073 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-28 03:05:22,076 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-28 03:05:22,078 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-28 03:05:22,079 INFO L275 PluginConnector]: CDTParser initialized [2019-11-28 03:05:22,079 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/bitvector/gcd_4.c [2019-11-28 03:05:22,157 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b396c5826/475033248d6344409208dfeb23f2ff48/FLAG3be612ab8 [2019-11-28 03:05:22,623 INFO L306 CDTParser]: Found 1 translation units. [2019-11-28 03:05:22,624 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/bitvector/gcd_4.c [2019-11-28 03:05:22,630 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b396c5826/475033248d6344409208dfeb23f2ff48/FLAG3be612ab8 [2019-11-28 03:05:22,976 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b396c5826/475033248d6344409208dfeb23f2ff48 [2019-11-28 03:05:22,980 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-28 03:05:22,982 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-11-28 03:05:22,983 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-28 03:05:22,983 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-28 03:05:22,987 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-28 03:05:22,987 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.11 03:05:22" (1/1) ... [2019-11-28 03:05:22,990 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@37e9f04f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 03:05:22, skipping insertion in model container [2019-11-28 03:05:22,991 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.11 03:05:22" (1/1) ... [2019-11-28 03:05:22,999 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-11-28 03:05:23,016 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-11-28 03:05:23,198 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-28 03:05:23,202 INFO L203 MainTranslator]: Completed pre-run [2019-11-28 03:05:23,221 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-28 03:05:23,236 INFO L208 MainTranslator]: Completed translation [2019-11-28 03:05:23,236 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 03:05:23 WrapperNode [2019-11-28 03:05:23,236 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-28 03:05:23,237 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-11-28 03:05:23,237 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-11-28 03:05:23,238 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-11-28 03:05:23,246 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 03:05:23" (1/1) ... [2019-11-28 03:05:23,252 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 03:05:23" (1/1) ... [2019-11-28 03:05:23,274 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-11-28 03:05:23,274 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-11-28 03:05:23,274 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-11-28 03:05:23,274 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-11-28 03:05:23,338 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 03:05:23" (1/1) ... [2019-11-28 03:05:23,338 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 03:05:23" (1/1) ... [2019-11-28 03:05:23,340 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 03:05:23" (1/1) ... [2019-11-28 03:05:23,340 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 03:05:23" (1/1) ... [2019-11-28 03:05:23,350 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 03:05:23" (1/1) ... [2019-11-28 03:05:23,358 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 03:05:23" (1/1) ... [2019-11-28 03:05:23,359 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 03:05:23" (1/1) ... [2019-11-28 03:05:23,364 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-11-28 03:05:23,365 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-11-28 03:05:23,365 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-11-28 03:05:23,365 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-11-28 03:05:23,366 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 03:05:23" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 03:05:23,420 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-11-28 03:05:23,420 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-11-28 03:05:23,608 INFO L292 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-11-28 03:05:23,608 INFO L297 CfgBuilder]: Removed 13 assume(true) statements. [2019-11-28 03:05:23,609 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 03:05:23 BoogieIcfgContainer [2019-11-28 03:05:23,610 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-11-28 03:05:23,611 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2019-11-28 03:05:23,611 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2019-11-28 03:05:23,615 INFO L275 PluginConnector]: BuchiAutomizer initialized [2019-11-28 03:05:23,616 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-11-28 03:05:23,616 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 28.11 03:05:22" (1/3) ... [2019-11-28 03:05:23,617 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@7116db34 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 28.11 03:05:23, skipping insertion in model container [2019-11-28 03:05:23,617 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-11-28 03:05:23,618 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 03:05:23" (2/3) ... [2019-11-28 03:05:23,618 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@7116db34 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 28.11 03:05:23, skipping insertion in model container [2019-11-28 03:05:23,618 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-11-28 03:05:23,619 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 03:05:23" (3/3) ... [2019-11-28 03:05:23,621 INFO L371 chiAutomizerObserver]: Analyzing ICFG gcd_4.c [2019-11-28 03:05:23,671 INFO L356 BuchiCegarLoop]: Interprodecural is true [2019-11-28 03:05:23,671 INFO L357 BuchiCegarLoop]: Hoare is false [2019-11-28 03:05:23,672 INFO L358 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2019-11-28 03:05:23,672 INFO L359 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2019-11-28 03:05:23,672 INFO L360 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-11-28 03:05:23,672 INFO L361 BuchiCegarLoop]: Difference is false [2019-11-28 03:05:23,672 INFO L362 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-11-28 03:05:23,673 INFO L365 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2019-11-28 03:05:23,690 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 20 states. [2019-11-28 03:05:23,728 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2019-11-28 03:05:23,730 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-28 03:05:23,730 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-28 03:05:23,740 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1] [2019-11-28 03:05:23,741 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2019-11-28 03:05:23,741 INFO L424 BuchiCegarLoop]: ======== Iteration 1============ [2019-11-28 03:05:23,742 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 20 states. [2019-11-28 03:05:23,745 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2019-11-28 03:05:23,746 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-28 03:05:23,746 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-28 03:05:23,747 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1] [2019-11-28 03:05:23,747 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2019-11-28 03:05:23,758 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 [2019-11-28 03:05:23,759 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 [2019-11-28 03:05:23,766 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 03:05:23,767 INFO L82 PathProgramCache]: Analyzing trace with hash 959468, now seen corresponding path program 1 times [2019-11-28 03:05:23,777 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 03:05:23,777 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [286703977] [2019-11-28 03:05:23,778 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 03:05:23,892 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 03:05:23,905 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 03:05:23,921 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-28 03:05:23,922 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 03:05:23,922 INFO L82 PathProgramCache]: Analyzing trace with hash 1830, now seen corresponding path program 1 times [2019-11-28 03:05:23,923 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 03:05:23,923 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1694483822] [2019-11-28 03:05:23,923 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 03:05:23,932 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 03:05:23,935 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 03:05:23,937 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-28 03:05:23,938 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 03:05:23,939 INFO L82 PathProgramCache]: Analyzing trace with hash 922049617, now seen corresponding path program 1 times [2019-11-28 03:05:23,939 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 03:05:23,939 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [591920542] [2019-11-28 03:05:23,940 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 03:05:23,947 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 03:05:24,026 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 03:05:24,028 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [591920542] [2019-11-28 03:05:24,029 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 03:05:24,029 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-11-28 03:05:24,030 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1975713413] [2019-11-28 03:05:24,092 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 03:05:24,105 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-28 03:05:24,106 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-28 03:05:24,107 INFO L87 Difference]: Start difference. First operand 20 states. Second operand 3 states. [2019-11-28 03:05:24,148 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 03:05:24,148 INFO L93 Difference]: Finished difference Result 22 states and 23 transitions. [2019-11-28 03:05:24,149 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-28 03:05:24,151 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 22 states and 23 transitions. [2019-11-28 03:05:24,153 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2019-11-28 03:05:24,157 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 22 states to 8 states and 9 transitions. [2019-11-28 03:05:24,158 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 8 [2019-11-28 03:05:24,158 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 8 [2019-11-28 03:05:24,159 INFO L73 IsDeterministic]: Start isDeterministic. Operand 8 states and 9 transitions. [2019-11-28 03:05:24,159 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-11-28 03:05:24,159 INFO L688 BuchiCegarLoop]: Abstraction has 8 states and 9 transitions. [2019-11-28 03:05:24,176 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8 states and 9 transitions. [2019-11-28 03:05:24,183 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8 to 8. [2019-11-28 03:05:24,184 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2019-11-28 03:05:24,185 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 9 transitions. [2019-11-28 03:05:24,186 INFO L711 BuchiCegarLoop]: Abstraction has 8 states and 9 transitions. [2019-11-28 03:05:24,186 INFO L591 BuchiCegarLoop]: Abstraction has 8 states and 9 transitions. [2019-11-28 03:05:24,186 INFO L424 BuchiCegarLoop]: ======== Iteration 2============ [2019-11-28 03:05:24,186 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 8 states and 9 transitions. [2019-11-28 03:05:24,187 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2019-11-28 03:05:24,187 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-28 03:05:24,187 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-28 03:05:24,188 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1] [2019-11-28 03:05:24,188 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2019-11-28 03:05:24,188 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 [2019-11-28 03:05:24,188 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 [2019-11-28 03:05:24,189 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 03:05:24,189 INFO L82 PathProgramCache]: Analyzing trace with hash 922049615, now seen corresponding path program 1 times [2019-11-28 03:05:24,189 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 03:05:24,189 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [722789602] [2019-11-28 03:05:24,189 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 03:05:24,196 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 03:05:24,202 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 03:05:24,204 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-28 03:05:24,205 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 03:05:24,205 INFO L82 PathProgramCache]: Analyzing trace with hash 1830, now seen corresponding path program 2 times [2019-11-28 03:05:24,205 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 03:05:24,205 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1899189410] [2019-11-28 03:05:24,206 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 03:05:24,211 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 03:05:24,214 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 03:05:24,215 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-28 03:05:24,215 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 03:05:24,216 INFO L82 PathProgramCache]: Analyzing trace with hash 1326417908, now seen corresponding path program 1 times [2019-11-28 03:05:24,216 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 03:05:24,216 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [132012117] [2019-11-28 03:05:24,216 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 03:05:24,223 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 03:05:24,267 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 03:05:24,268 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [132012117] [2019-11-28 03:05:24,268 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1763890545] [2019-11-28 03:05:24,268 INFO L94 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 [2019-11-28 03:05:24,301 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 03:05:24,303 INFO L255 TraceCheckSpWp]: Trace formula consists of 25 conjuncts, 8 conjunts are in the unsatisfiable core [2019-11-28 03:05:24,305 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 03:05:24,357 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 03:05:24,358 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-28 03:05:24,358 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [2, 2] total 4 [2019-11-28 03:05:24,358 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [849187551] [2019-11-28 03:05:24,381 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 03:05:24,382 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-28 03:05:24,382 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2019-11-28 03:05:24,382 INFO L87 Difference]: Start difference. First operand 8 states and 9 transitions. cyclomatic complexity: 2 Second operand 6 states. [2019-11-28 03:05:24,421 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 03:05:24,421 INFO L93 Difference]: Finished difference Result 10 states and 11 transitions. [2019-11-28 03:05:24,422 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-28 03:05:24,423 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 10 states and 11 transitions. [2019-11-28 03:05:24,423 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2019-11-28 03:05:24,424 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 10 states to 10 states and 11 transitions. [2019-11-28 03:05:24,424 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 10 [2019-11-28 03:05:24,425 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 10 [2019-11-28 03:05:24,425 INFO L73 IsDeterministic]: Start isDeterministic. Operand 10 states and 11 transitions. [2019-11-28 03:05:24,425 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-11-28 03:05:24,425 INFO L688 BuchiCegarLoop]: Abstraction has 10 states and 11 transitions. [2019-11-28 03:05:24,425 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10 states and 11 transitions. [2019-11-28 03:05:24,426 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10 to 10. [2019-11-28 03:05:24,427 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2019-11-28 03:05:24,428 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 11 transitions. [2019-11-28 03:05:24,428 INFO L711 BuchiCegarLoop]: Abstraction has 10 states and 11 transitions. [2019-11-28 03:05:24,428 INFO L591 BuchiCegarLoop]: Abstraction has 10 states and 11 transitions. [2019-11-28 03:05:24,428 INFO L424 BuchiCegarLoop]: ======== Iteration 3============ [2019-11-28 03:05:24,429 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 10 states and 11 transitions. [2019-11-28 03:05:24,429 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2019-11-28 03:05:24,430 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-28 03:05:24,430 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-28 03:05:24,430 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 1, 1, 1, 1] [2019-11-28 03:05:24,431 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2019-11-28 03:05:24,431 INFO L794 eck$LassoCheckResult]: Stem: 105#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; 106#L12 assume !(gcd_test_~a < 0); 103#L12-2 assume !(gcd_test_~b < 0); 104#L13-1 assume !(0 == gcd_test_~a); 107#L20-2 assume !!(0 != gcd_test_~b); 110#L20 assume gcd_test_~a > gcd_test_~b;gcd_test_~a := gcd_test_~a - gcd_test_~b; 108#L20-2 assume !!(0 != gcd_test_~b); 109#L20 assume gcd_test_~a > gcd_test_~b;gcd_test_~a := gcd_test_~a - gcd_test_~b; 112#L20-2 [2019-11-28 03:05:24,431 INFO L796 eck$LassoCheckResult]: Loop: 112#L20-2 assume !!(0 != gcd_test_~b); 111#L20 assume !(gcd_test_~a > gcd_test_~b);gcd_test_~b := gcd_test_~b - gcd_test_~a; 112#L20-2 [2019-11-28 03:05:24,431 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 03:05:24,432 INFO L82 PathProgramCache]: Analyzing trace with hash 1326417906, now seen corresponding path program 2 times [2019-11-28 03:05:24,432 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 03:05:24,432 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2013251544] [2019-11-28 03:05:24,433 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 03:05:24,440 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 03:05:24,446 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 03:05:24,449 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-28 03:05:24,449 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 03:05:24,450 INFO L82 PathProgramCache]: Analyzing trace with hash 1830, now seen corresponding path program 3 times [2019-11-28 03:05:24,450 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 03:05:24,450 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [955860504] [2019-11-28 03:05:24,451 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 03:05:24,454 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 03:05:24,456 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 03:05:24,457 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-28 03:05:24,458 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 03:05:24,458 INFO L82 PathProgramCache]: Analyzing trace with hash -917678377, now seen corresponding path program 2 times [2019-11-28 03:05:24,458 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 03:05:24,459 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1601096584] [2019-11-28 03:05:24,459 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 03:05:24,466 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 03:05:24,532 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 03:05:24,533 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1601096584] [2019-11-28 03:05:24,533 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [693500162] [2019-11-28 03:05:24,533 INFO L92 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) [2019-11-28 03:05:24,570 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-11-28 03:05:24,570 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-28 03:05:24,571 INFO L255 TraceCheckSpWp]: Trace formula consists of 29 conjuncts, 9 conjunts are in the unsatisfiable core [2019-11-28 03:05:24,573 INFO L278 TraceCheckSpWp]: Computing forward predicates... Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-28 03:05:24,640 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 03:05:24,640 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-28 03:05:24,641 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3] total 6 [2019-11-28 03:05:24,641 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1092401045] [2019-11-28 03:05:24,663 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 03:05:24,663 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-11-28 03:05:24,663 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2019-11-28 03:05:24,664 INFO L87 Difference]: Start difference. First operand 10 states and 11 transitions. cyclomatic complexity: 2 Second operand 8 states. [2019-11-28 03:05:24,706 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 03:05:24,707 INFO L93 Difference]: Finished difference Result 12 states and 13 transitions. [2019-11-28 03:05:24,708 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-28 03:05:24,708 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 12 states and 13 transitions. [2019-11-28 03:05:24,709 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2019-11-28 03:05:24,711 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 12 states to 12 states and 13 transitions. [2019-11-28 03:05:24,711 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 12 [2019-11-28 03:05:24,711 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 12 [2019-11-28 03:05:24,711 INFO L73 IsDeterministic]: Start isDeterministic. Operand 12 states and 13 transitions. [2019-11-28 03:05:24,712 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-11-28 03:05:24,712 INFO L688 BuchiCegarLoop]: Abstraction has 12 states and 13 transitions. [2019-11-28 03:05:24,712 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12 states and 13 transitions. [2019-11-28 03:05:24,714 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12 to 12. [2019-11-28 03:05:24,714 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2019-11-28 03:05:24,714 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 13 transitions. [2019-11-28 03:05:24,715 INFO L711 BuchiCegarLoop]: Abstraction has 12 states and 13 transitions. [2019-11-28 03:05:24,715 INFO L591 BuchiCegarLoop]: Abstraction has 12 states and 13 transitions. [2019-11-28 03:05:24,716 INFO L424 BuchiCegarLoop]: ======== Iteration 4============ [2019-11-28 03:05:24,716 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 12 states and 13 transitions. [2019-11-28 03:05:24,717 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2019-11-28 03:05:24,717 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-28 03:05:24,718 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-28 03:05:24,718 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [3, 3, 1, 1, 1, 1] [2019-11-28 03:05:24,718 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2019-11-28 03:05:24,720 INFO L794 eck$LassoCheckResult]: Stem: 167#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; 168#L12 assume !(gcd_test_~a < 0); 165#L12-2 assume !(gcd_test_~b < 0); 166#L13-1 assume !(0 == gcd_test_~a); 169#L20-2 assume !!(0 != gcd_test_~b); 172#L20 assume gcd_test_~a > gcd_test_~b;gcd_test_~a := gcd_test_~a - gcd_test_~b; 170#L20-2 assume !!(0 != gcd_test_~b); 171#L20 assume gcd_test_~a > gcd_test_~b;gcd_test_~a := gcd_test_~a - gcd_test_~b; 176#L20-2 assume !!(0 != gcd_test_~b); 175#L20 assume gcd_test_~a > gcd_test_~b;gcd_test_~a := gcd_test_~a - gcd_test_~b; 174#L20-2 [2019-11-28 03:05:24,720 INFO L796 eck$LassoCheckResult]: Loop: 174#L20-2 assume !!(0 != gcd_test_~b); 173#L20 assume !(gcd_test_~a > gcd_test_~b);gcd_test_~b := gcd_test_~b - gcd_test_~a; 174#L20-2 [2019-11-28 03:05:24,720 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 03:05:24,720 INFO L82 PathProgramCache]: Analyzing trace with hash -917678379, now seen corresponding path program 3 times [2019-11-28 03:05:24,721 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 03:05:24,721 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1368449007] [2019-11-28 03:05:24,722 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 03:05:24,734 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 03:05:24,741 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 03:05:24,744 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-28 03:05:24,744 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 03:05:24,745 INFO L82 PathProgramCache]: Analyzing trace with hash 1830, now seen corresponding path program 4 times [2019-11-28 03:05:24,745 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 03:05:24,745 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [886856282] [2019-11-28 03:05:24,746 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 03:05:24,749 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 03:05:24,751 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 03:05:24,753 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-28 03:05:24,753 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 03:05:24,753 INFO L82 PathProgramCache]: Analyzing trace with hash -1420625670, now seen corresponding path program 3 times [2019-11-28 03:05:24,754 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 03:05:24,754 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [169221626] [2019-11-28 03:05:24,755 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 03:05:24,762 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 03:05:24,770 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 03:05:24,777 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-28 03:05:24,893 INFO L210 LassoAnalysis]: Preferences: [2019-11-28 03:05:24,894 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2019-11-28 03:05:24,894 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-11-28 03:05:24,894 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2019-11-28 03:05:24,895 INFO L129 ssoRankerPreferences]: Use exernal solver: true [2019-11-28 03:05:24,895 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 03:05:24,895 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2019-11-28 03:05:24,895 INFO L132 ssoRankerPreferences]: Path of dumped script: [2019-11-28 03:05:24,895 INFO L133 ssoRankerPreferences]: Filename of dumped script: gcd_4.c_Iteration4_Lasso [2019-11-28 03:05:24,896 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2019-11-28 03:05:24,896 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2019-11-28 03:05:24,915 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 03:05:24,946 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 03:05:24,949 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 03:05:24,952 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 03:05:24,954 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 03:05:25,088 INFO L292 LassoAnalysis]: Preprocessing complete. [2019-11-28 03:05:25,089 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) Waiting until toolchain timeout for monitored process 4 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 03:05:25,099 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-11-28 03:05:25,100 INFO L160 nArgumentSynthesizer]: Using integer mode. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 03:05:25,137 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2019-11-28 03:05:25,137 INFO L160 nArgumentSynthesizer]: Using integer mode. [2019-11-28 03:05:25,527 INFO L444 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2019-11-28 03:05:25,530 INFO L210 LassoAnalysis]: Preferences: [2019-11-28 03:05:25,530 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2019-11-28 03:05:25,530 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-11-28 03:05:25,530 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2019-11-28 03:05:25,530 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2019-11-28 03:05:25,531 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 03:05:25,531 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2019-11-28 03:05:25,531 INFO L132 ssoRankerPreferences]: Path of dumped script: [2019-11-28 03:05:25,531 INFO L133 ssoRankerPreferences]: Filename of dumped script: gcd_4.c_Iteration4_Lasso [2019-11-28 03:05:25,531 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2019-11-28 03:05:25,531 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2019-11-28 03:05:25,534 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 03:05:25,536 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 03:05:25,563 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 03:05:25,566 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 03:05:25,568 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 03:05:25,683 INFO L292 LassoAnalysis]: Preprocessing complete. [2019-11-28 03:05:25,689 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 [2019-11-28 03:05:25,709 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-28 03:05:25,712 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 03:05:25,712 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-28 03:05:25,713 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 03:05:25,713 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 03:05:25,714 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 03:05:25,716 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-28 03:05:25,716 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-28 03:05:25,720 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) [2019-11-28 03:05:25,739 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-28 03:05:25,742 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 03:05:25,742 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 03:05:25,742 INFO L204 nArgumentSynthesizer]: 2 loop disjuncts [2019-11-28 03:05:25,742 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. Waiting until toolchain timeout for monitored process 7 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 03:05:25,764 INFO L401 nArgumentSynthesizer]: We have 16 Motzkin's Theorem applications. [2019-11-28 03:05:25,764 INFO L402 nArgumentSynthesizer]: A total of 4 supporting invariants were added. [2019-11-28 03:05:25,813 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-11-28 03:05:25,864 INFO L443 ModelExtractionUtils]: Simplification made 10 calls to the SMT solver. [2019-11-28 03:05:25,864 INFO L444 ModelExtractionUtils]: 24 out of 36 variables were initially zero. Simplification set additionally 6 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) [2019-11-28 03:05:25,873 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 [2019-11-28 03:05:25,878 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 4. [2019-11-28 03:05:25,879 INFO L510 LassoAnalysis]: Proved termination. [2019-11-28 03:05:25,880 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_~b >= 0, 1*ULTIMATE.start_gcd_test_~a - 2 >= 0] [2019-11-28 03:05:25,890 INFO L297 tatePredicateManager]: 1 out of 2 supporting invariants were superfluous and have been removed [2019-11-28 03:05:25,945 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 03:05:25,954 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 03:05:25,954 INFO L255 TraceCheckSpWp]: Trace formula consists of 29 conjuncts, 11 conjunts are in the unsatisfiable core [2019-11-28 03:05:25,955 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 03:05:26,023 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 03:05:26,023 WARN L253 TraceCheckSpWp]: Trace formula consists of 7 conjuncts, 5 conjunts are in the unsatisfiable core [2019-11-28 03:05:26,024 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 03:05:26,024 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 03:05:26,030 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 [2019-11-28 03:05:26,031 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 12 states and 13 transitions. cyclomatic complexity: 2 Second operand 6 states. [2019-11-28 03:05:26,150 INFO L76 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. [2019-11-28 03:05:26,150 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 2 stem states 1 non-accepting loop states 1 accepting loop states [2019-11-28 03:05:26,151 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2019-11-28 03:05:26,151 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 7 transitions. [2019-11-28 03:05:26,153 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 7 transitions. Stem has 10 letters. Loop has 2 letters. [2019-11-28 03:05:26,154 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-28 03:05:26,155 INFO L639 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2019-11-28 03:05:26,187 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 03:05:26,196 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 03:05:26,197 INFO L255 TraceCheckSpWp]: Trace formula consists of 29 conjuncts, 11 conjunts are in the unsatisfiable core [2019-11-28 03:05:26,198 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 03:05:26,258 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 03:05:26,258 WARN L253 TraceCheckSpWp]: Trace formula consists of 7 conjuncts, 5 conjunts are in the unsatisfiable core [2019-11-28 03:05:26,259 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 03:05:26,259 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 03:05:26,260 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 [2019-11-28 03:05:26,260 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 12 states and 13 transitions. cyclomatic complexity: 2 Second operand 6 states. [2019-11-28 03:05:26,331 INFO L76 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. [2019-11-28 03:05:26,332 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 2 stem states 1 non-accepting loop states 1 accepting loop states [2019-11-28 03:05:26,332 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2019-11-28 03:05:26,333 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 7 transitions. [2019-11-28 03:05:26,333 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 7 transitions. Stem has 10 letters. Loop has 2 letters. [2019-11-28 03:05:26,333 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-28 03:05:26,333 INFO L639 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2019-11-28 03:05:26,362 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 03:05:26,370 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 03:05:26,370 INFO L255 TraceCheckSpWp]: Trace formula consists of 29 conjuncts, 11 conjunts are in the unsatisfiable core [2019-11-28 03:05:26,371 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 03:05:26,436 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 03:05:26,437 WARN L253 TraceCheckSpWp]: Trace formula consists of 7 conjuncts, 5 conjunts are in the unsatisfiable core [2019-11-28 03:05:26,437 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 03:05:26,438 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 03:05:26,438 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 [2019-11-28 03:05:26,438 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 12 states and 13 transitions. cyclomatic complexity: 2 Second operand 6 states. [2019-11-28 03:05:26,563 INFO L76 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. [2019-11-28 03:05:26,564 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 7 states 4 stem states 1 non-accepting loop states 2 accepting loop states [2019-11-28 03:05:26,564 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2019-11-28 03:05:26,565 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 19 transitions. [2019-11-28 03:05:26,565 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 19 transitions. Stem has 10 letters. Loop has 2 letters. [2019-11-28 03:05:26,565 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-28 03:05:26,566 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 19 transitions. Stem has 12 letters. Loop has 2 letters. [2019-11-28 03:05:26,566 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-28 03:05:26,566 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 19 transitions. Stem has 10 letters. Loop has 4 letters. [2019-11-28 03:05:26,567 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-28 03:05:26,567 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 20 states and 24 transitions. [2019-11-28 03:05:26,569 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2019-11-28 03:05:26,569 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 20 states to 18 states and 22 transitions. [2019-11-28 03:05:26,570 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 12 [2019-11-28 03:05:26,570 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 16 [2019-11-28 03:05:26,570 INFO L73 IsDeterministic]: Start isDeterministic. Operand 18 states and 22 transitions. [2019-11-28 03:05:26,571 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-11-28 03:05:26,571 INFO L688 BuchiCegarLoop]: Abstraction has 18 states and 22 transitions. [2019-11-28 03:05:26,571 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18 states and 22 transitions. [2019-11-28 03:05:26,573 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18 to 16. [2019-11-28 03:05:26,573 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2019-11-28 03:05:26,574 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 19 transitions. [2019-11-28 03:05:26,574 INFO L711 BuchiCegarLoop]: Abstraction has 16 states and 19 transitions. [2019-11-28 03:05:26,574 INFO L591 BuchiCegarLoop]: Abstraction has 16 states and 19 transitions. [2019-11-28 03:05:26,574 INFO L424 BuchiCegarLoop]: ======== Iteration 5============ [2019-11-28 03:05:26,575 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 16 states and 19 transitions. [2019-11-28 03:05:26,575 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2019-11-28 03:05:26,576 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-28 03:05:26,576 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-28 03:05:26,577 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [4, 4, 1, 1, 1, 1] [2019-11-28 03:05:26,577 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2019-11-28 03:05:26,577 INFO L794 eck$LassoCheckResult]: Stem: 411#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; 412#L12 assume !(gcd_test_~a < 0); 409#L12-2 assume !(gcd_test_~b < 0); 410#L13-1 assume !(0 == gcd_test_~a); 413#L20-2 assume !!(0 != gcd_test_~b); 424#L20 assume gcd_test_~a > gcd_test_~b;gcd_test_~a := gcd_test_~a - gcd_test_~b; 423#L20-2 assume !!(0 != gcd_test_~b); 422#L20 assume gcd_test_~a > gcd_test_~b;gcd_test_~a := gcd_test_~a - gcd_test_~b; 421#L20-2 assume !!(0 != gcd_test_~b); 420#L20 assume gcd_test_~a > gcd_test_~b;gcd_test_~a := gcd_test_~a - gcd_test_~b; 419#L20-2 assume !!(0 != gcd_test_~b); 418#L20 assume gcd_test_~a > gcd_test_~b;gcd_test_~a := gcd_test_~a - gcd_test_~b; 414#L20-2 [2019-11-28 03:05:26,577 INFO L796 eck$LassoCheckResult]: Loop: 414#L20-2 assume !!(0 != gcd_test_~b); 415#L20 assume !(gcd_test_~a > gcd_test_~b);gcd_test_~b := gcd_test_~b - gcd_test_~a; 414#L20-2 [2019-11-28 03:05:26,578 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 03:05:26,578 INFO L82 PathProgramCache]: Analyzing trace with hash -1420625672, now seen corresponding path program 4 times [2019-11-28 03:05:26,578 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 03:05:26,579 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1825982492] [2019-11-28 03:05:26,579 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 03:05:26,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 03:05:26,678 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 6 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 03:05:26,678 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1825982492] [2019-11-28 03:05:26,678 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1683645885] [2019-11-28 03:05:26,679 INFO L92 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) [2019-11-28 03:05:26,707 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-11-28 03:05:26,707 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-28 03:05:26,708 INFO L255 TraceCheckSpWp]: Trace formula consists of 33 conjuncts, 10 conjunts are in the unsatisfiable core [2019-11-28 03:05:26,709 INFO L278 TraceCheckSpWp]: Computing forward predicates... Waiting until toolchain timeout for monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-28 03:05:26,769 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 03:05:26,769 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-11-28 03:05:26,770 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [4] total 8 [2019-11-28 03:05:26,770 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [765613199] [2019-11-28 03:05:26,771 INFO L799 eck$LassoCheckResult]: stem already infeasible [2019-11-28 03:05:26,772 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 03:05:26,772 INFO L82 PathProgramCache]: Analyzing trace with hash 1830, now seen corresponding path program 5 times [2019-11-28 03:05:26,772 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 03:05:26,772 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1953629997] [2019-11-28 03:05:26,773 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 03:05:26,775 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 03:05:26,777 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 03:05:26,778 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-28 03:05:26,795 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 03:05:26,795 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-28 03:05:26,796 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=54, Unknown=0, NotChecked=0, Total=90 [2019-11-28 03:05:26,796 INFO L87 Difference]: Start difference. First operand 16 states and 19 transitions. cyclomatic complexity: 5 Second operand 6 states. [2019-11-28 03:05:26,830 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 03:05:26,830 INFO L93 Difference]: Finished difference Result 18 states and 20 transitions. [2019-11-28 03:05:26,831 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-11-28 03:05:26,831 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 18 states and 20 transitions. [2019-11-28 03:05:26,832 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2019-11-28 03:05:26,833 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 18 states to 17 states and 19 transitions. [2019-11-28 03:05:26,834 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 14 [2019-11-28 03:05:26,834 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 14 [2019-11-28 03:05:26,835 INFO L73 IsDeterministic]: Start isDeterministic. Operand 17 states and 19 transitions. [2019-11-28 03:05:26,835 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-11-28 03:05:26,835 INFO L688 BuchiCegarLoop]: Abstraction has 17 states and 19 transitions. [2019-11-28 03:05:26,835 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17 states and 19 transitions. [2019-11-28 03:05:26,837 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17 to 16. [2019-11-28 03:05:26,838 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2019-11-28 03:05:26,839 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 18 transitions. [2019-11-28 03:05:26,839 INFO L711 BuchiCegarLoop]: Abstraction has 16 states and 18 transitions. [2019-11-28 03:05:26,840 INFO L591 BuchiCegarLoop]: Abstraction has 16 states and 18 transitions. [2019-11-28 03:05:26,840 INFO L424 BuchiCegarLoop]: ======== Iteration 6============ [2019-11-28 03:05:26,840 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 16 states and 18 transitions. [2019-11-28 03:05:26,841 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2019-11-28 03:05:26,842 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-28 03:05:26,842 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-28 03:05:26,843 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [5, 4, 1, 1, 1, 1, 1] [2019-11-28 03:05:26,844 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2019-11-28 03:05:26,844 INFO L794 eck$LassoCheckResult]: Stem: 491#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; 492#L12 assume !(gcd_test_~a < 0); 489#L12-2 assume !(gcd_test_~b < 0); 490#L13-1 assume !(0 == gcd_test_~a); 493#L20-2 assume !!(0 != gcd_test_~b); 504#L20 assume gcd_test_~a > gcd_test_~b;gcd_test_~a := gcd_test_~a - gcd_test_~b; 503#L20-2 assume !!(0 != gcd_test_~b); 502#L20 assume gcd_test_~a > gcd_test_~b;gcd_test_~a := gcd_test_~a - gcd_test_~b; 501#L20-2 assume !!(0 != gcd_test_~b); 500#L20 assume gcd_test_~a > gcd_test_~b;gcd_test_~a := gcd_test_~a - gcd_test_~b; 499#L20-2 assume !!(0 != gcd_test_~b); 497#L20 assume !(gcd_test_~a > gcd_test_~b);gcd_test_~b := gcd_test_~b - gcd_test_~a; 496#L20-2 assume !!(0 != gcd_test_~b); 498#L20 assume gcd_test_~a > gcd_test_~b;gcd_test_~a := gcd_test_~a - gcd_test_~b; 494#L20-2 [2019-11-28 03:05:26,844 INFO L796 eck$LassoCheckResult]: Loop: 494#L20-2 assume !!(0 != gcd_test_~b); 495#L20 assume !(gcd_test_~a > gcd_test_~b);gcd_test_~b := gcd_test_~b - gcd_test_~a; 494#L20-2 [2019-11-28 03:05:26,844 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 03:05:26,845 INFO L82 PathProgramCache]: Analyzing trace with hash 578332125, now seen corresponding path program 4 times [2019-11-28 03:05:26,845 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 03:05:26,848 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [557152822] [2019-11-28 03:05:26,849 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 03:05:26,862 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [MP z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (8)] Exception during sending of exit command (exit): Broken pipe [2019-11-28 03:05:26,946 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 6 proven. 14 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 03:05:26,946 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [557152822] [2019-11-28 03:05:26,946 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1080040997] [2019-11-28 03:05:26,946 INFO L92 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 [2019-11-28 03:05:26,974 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-11-28 03:05:26,975 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-28 03:05:26,975 INFO L255 TraceCheckSpWp]: Trace formula consists of 37 conjuncts, 11 conjunts are in the unsatisfiable core [2019-11-28 03:05:26,977 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 03:05:27,060 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 12 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 03:05:27,060 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-28 03:05:27,060 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 10 [2019-11-28 03:05:27,060 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1186163071] [2019-11-28 03:05:27,061 INFO L799 eck$LassoCheckResult]: stem already infeasible [2019-11-28 03:05:27,061 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 03:05:27,061 INFO L82 PathProgramCache]: Analyzing trace with hash 1830, now seen corresponding path program 6 times [2019-11-28 03:05:27,061 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 03:05:27,062 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [320175762] [2019-11-28 03:05:27,062 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 03:05:27,064 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 03:05:27,066 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 03:05:27,067 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-28 03:05:27,087 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 03:05:27,087 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-11-28 03:05:27,088 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=89, Unknown=0, NotChecked=0, Total=132 [2019-11-28 03:05:27,088 INFO L87 Difference]: Start difference. First operand 16 states and 18 transitions. cyclomatic complexity: 4 Second operand 12 states. [2019-11-28 03:05:27,143 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 03:05:27,143 INFO L93 Difference]: Finished difference Result 20 states and 22 transitions. [2019-11-28 03:05:27,143 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-11-28 03:05:27,144 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 20 states and 22 transitions. [2019-11-28 03:05:27,144 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2019-11-28 03:05:27,145 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 20 states to 19 states and 21 transitions. [2019-11-28 03:05:27,145 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 14 [2019-11-28 03:05:27,145 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 14 [2019-11-28 03:05:27,145 INFO L73 IsDeterministic]: Start isDeterministic. Operand 19 states and 21 transitions. [2019-11-28 03:05:27,145 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-11-28 03:05:27,145 INFO L688 BuchiCegarLoop]: Abstraction has 19 states and 21 transitions. [2019-11-28 03:05:27,146 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19 states and 21 transitions. [2019-11-28 03:05:27,147 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19 to 18. [2019-11-28 03:05:27,147 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2019-11-28 03:05:27,147 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 20 transitions. [2019-11-28 03:05:27,148 INFO L711 BuchiCegarLoop]: Abstraction has 18 states and 20 transitions. [2019-11-28 03:05:27,148 INFO L591 BuchiCegarLoop]: Abstraction has 18 states and 20 transitions. [2019-11-28 03:05:27,148 INFO L424 BuchiCegarLoop]: ======== Iteration 7============ [2019-11-28 03:05:27,148 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 18 states and 20 transitions. [2019-11-28 03:05:27,148 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2019-11-28 03:05:27,148 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-28 03:05:27,149 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-28 03:05:27,149 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [6, 4, 2, 1, 1, 1, 1] [2019-11-28 03:05:27,149 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2019-11-28 03:05:27,149 INFO L794 eck$LassoCheckResult]: Stem: 583#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; 584#L12 assume !(gcd_test_~a < 0); 581#L12-2 assume !(gcd_test_~b < 0); 582#L13-1 assume !(0 == gcd_test_~a); 585#L20-2 assume !!(0 != gcd_test_~b); 598#L20 assume gcd_test_~a > gcd_test_~b;gcd_test_~a := gcd_test_~a - gcd_test_~b; 597#L20-2 assume !!(0 != gcd_test_~b); 596#L20 assume gcd_test_~a > gcd_test_~b;gcd_test_~a := gcd_test_~a - gcd_test_~b; 595#L20-2 assume !!(0 != gcd_test_~b); 594#L20 assume gcd_test_~a > gcd_test_~b;gcd_test_~a := gcd_test_~a - gcd_test_~b; 592#L20-2 assume !!(0 != gcd_test_~b); 593#L20 assume !(gcd_test_~a > gcd_test_~b);gcd_test_~b := gcd_test_~b - gcd_test_~a; 588#L20-2 assume !!(0 != gcd_test_~b); 589#L20 assume !(gcd_test_~a > gcd_test_~b);gcd_test_~b := gcd_test_~b - gcd_test_~a; 591#L20-2 assume !!(0 != gcd_test_~b); 590#L20 assume gcd_test_~a > gcd_test_~b;gcd_test_~a := gcd_test_~a - gcd_test_~b; 586#L20-2 [2019-11-28 03:05:27,149 INFO L796 eck$LassoCheckResult]: Loop: 586#L20-2 assume !!(0 != gcd_test_~b); 587#L20 assume !(gcd_test_~a > gcd_test_~b);gcd_test_~b := gcd_test_~b - gcd_test_~a; 586#L20-2 [2019-11-28 03:05:27,150 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 03:05:27,150 INFO L82 PathProgramCache]: Analyzing trace with hash 1726393730, now seen corresponding path program 5 times [2019-11-28 03:05:27,150 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 03:05:27,150 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [626807907] [2019-11-28 03:05:27,150 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 03:05:27,158 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 03:05:27,255 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 5 proven. 25 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 03:05:27,256 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [626807907] [2019-11-28 03:05:27,256 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2094969709] [2019-11-28 03:05:27,256 INFO L92 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 [2019-11-28 03:05:27,301 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 6 check-sat command(s) [2019-11-28 03:05:27,301 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-28 03:05:27,302 INFO L255 TraceCheckSpWp]: Trace formula consists of 41 conjuncts, 14 conjunts are in the unsatisfiable core [2019-11-28 03:05:27,303 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 03:05:27,421 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 5 proven. 25 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 03:05:27,421 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-28 03:05:27,421 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 12 [2019-11-28 03:05:27,421 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1846019165] [2019-11-28 03:05:27,422 INFO L799 eck$LassoCheckResult]: stem already infeasible [2019-11-28 03:05:27,422 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 03:05:27,422 INFO L82 PathProgramCache]: Analyzing trace with hash 1830, now seen corresponding path program 7 times [2019-11-28 03:05:27,422 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 03:05:27,422 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1057821880] [2019-11-28 03:05:27,423 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 03:05:27,424 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 03:05:27,426 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 03:05:27,427 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-28 03:05:27,451 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 03:05:27,451 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-11-28 03:05:27,452 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=123, Unknown=0, NotChecked=0, Total=156 [2019-11-28 03:05:27,452 INFO L87 Difference]: Start difference. First operand 18 states and 20 transitions. cyclomatic complexity: 4 Second operand 13 states. [2019-11-28 03:05:27,595 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 03:05:27,596 INFO L93 Difference]: Finished difference Result 15 states and 14 transitions. [2019-11-28 03:05:27,596 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-11-28 03:05:27,596 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 15 states and 14 transitions. [2019-11-28 03:05:27,597 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2019-11-28 03:05:27,597 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 15 states to 0 states and 0 transitions. [2019-11-28 03:05:27,597 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2019-11-28 03:05:27,597 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2019-11-28 03:05:27,597 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2019-11-28 03:05:27,597 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-11-28 03:05:27,597 INFO L688 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-11-28 03:05:27,597 INFO L711 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-11-28 03:05:27,597 INFO L591 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-11-28 03:05:27,598 INFO L424 BuchiCegarLoop]: ======== Iteration 8============ [2019-11-28 03:05:27,598 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2019-11-28 03:05:27,598 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2019-11-28 03:05:27,598 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2019-11-28 03:05:27,610 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 28.11 03:05:27 BoogieIcfgContainer [2019-11-28 03:05:27,610 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2019-11-28 03:05:27,612 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-11-28 03:05:27,612 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-11-28 03:05:27,612 INFO L275 PluginConnector]: Witness Printer initialized [2019-11-28 03:05:27,622 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 03:05:23" (3/4) ... [2019-11-28 03:05:27,627 INFO L140 WitnessPrinter]: No result that supports witness generation found [2019-11-28 03:05:27,627 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-11-28 03:05:27,630 INFO L168 Benchmark]: Toolchain (without parser) took 4647.22 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 212.3 MB). Free memory was 961.7 MB in the beginning and 1.1 GB in the end (delta: -145.0 MB). Peak memory consumption was 67.3 MB. Max. memory is 11.5 GB. [2019-11-28 03:05:27,631 INFO L168 Benchmark]: CDTParser took 0.19 ms. Allocated memory is still 1.0 GB. Free memory is still 987.2 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-28 03:05:27,634 INFO L168 Benchmark]: CACSL2BoogieTranslator took 254.12 ms. Allocated memory is still 1.0 GB. Free memory was 961.7 MB in the beginning and 949.6 MB in the end (delta: 12.1 MB). Peak memory consumption was 12.1 MB. Max. memory is 11.5 GB. [2019-11-28 03:05:27,637 INFO L168 Benchmark]: Boogie Procedure Inliner took 36.64 ms. Allocated memory is still 1.0 GB. Free memory is still 949.6 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-28 03:05:27,640 INFO L168 Benchmark]: Boogie Preprocessor took 90.36 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 146.3 MB). Free memory was 949.6 MB in the beginning and 1.1 GB in the end (delta: -186.6 MB). Peak memory consumption was 9.8 MB. Max. memory is 11.5 GB. [2019-11-28 03:05:27,642 INFO L168 Benchmark]: RCFGBuilder took 245.07 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: 11.0 MB). Peak memory consumption was 11.0 MB. Max. memory is 11.5 GB. [2019-11-28 03:05:27,643 INFO L168 Benchmark]: BuchiAutomizer took 3999.81 ms. Allocated memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 66.1 MB). Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 18.6 MB). Peak memory consumption was 84.6 MB. Max. memory is 11.5 GB. [2019-11-28 03:05:27,644 INFO L168 Benchmark]: Witness Printer took 15.24 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. [2019-11-28 03:05:27,648 INFO L335 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.19 ms. Allocated memory is still 1.0 GB. Free memory is still 987.2 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 254.12 ms. Allocated memory is still 1.0 GB. Free memory was 961.7 MB in the beginning and 949.6 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 36.64 ms. Allocated memory is still 1.0 GB. Free memory is still 949.6 MB. There was no memory consumed. Max. memory is 11.5 GB. * Boogie Preprocessor took 90.36 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 146.3 MB). Free memory was 949.6 MB in the beginning and 1.1 GB in the end (delta: -186.6 MB). Peak memory consumption was 9.8 MB. Max. memory is 11.5 GB. * RCFGBuilder took 245.07 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: 11.0 MB). Peak memory consumption was 11.0 MB. Max. memory is 11.5 GB. * BuchiAutomizer took 3999.81 ms. Allocated memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 66.1 MB). Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 18.6 MB). Peak memory consumption was 84.6 MB. Max. memory is 11.5 GB. * Witness Printer took 15.24 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. * 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 13 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 3.9s and 8 iterations. TraceHistogramMax:6. Analysis of lassos took 2.7s. Construction of modules took 0.2s. Büchi inclusion checks took 0.7s. 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, 63 SDslu, 12 SDs, 0 SdLazy, 249 SolverSat, 37 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.2s 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: 156ms VariablesStem: 6 VariablesLoop: 3 DisjunctsStem: 1 DisjunctsLoop: 2 SupportingInvariants: 4 MotzkinApplications: 16 LassoTerminationAnalysisBenchmarks: LassoNonterminationAnalysisSatFixpoint: 0 LassoNonterminationAnalysisSatUnbounded: 0 LassoNonterminationAnalysisUnsat: 1 LassoNonterminationAnalysisUnknown: 0 LassoNonterminationAnalysisTime: 0.4s - TerminationAnalysisResult: Termination proven Buchi Automizer proved that your program is terminating RESULT: Ultimate proved your program to be correct! Received shutdown request...