./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 9a8b2e8d Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -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 9c20edfd7ede05443471560aa2c7be34d4e8c171 ............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................ Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.25-9a8b2e8 [2020-10-20 06:45:13,472 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-10-20 06:45:13,475 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-10-20 06:45:13,511 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-10-20 06:45:13,511 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-10-20 06:45:13,520 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-10-20 06:45:13,522 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-10-20 06:45:13,526 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-10-20 06:45:13,528 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-10-20 06:45:13,530 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-10-20 06:45:13,543 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-10-20 06:45:13,544 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-10-20 06:45:13,544 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-10-20 06:45:13,548 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-10-20 06:45:13,549 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-10-20 06:45:13,551 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-10-20 06:45:13,552 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-10-20 06:45:13,553 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-10-20 06:45:13,555 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-10-20 06:45:13,557 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-10-20 06:45:13,564 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-10-20 06:45:13,565 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-10-20 06:45:13,566 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-10-20 06:45:13,567 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-10-20 06:45:13,578 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-10-20 06:45:13,580 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-10-20 06:45:13,580 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-10-20 06:45:13,581 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-10-20 06:45:13,582 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-10-20 06:45:13,583 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-10-20 06:45:13,583 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-10-20 06:45:13,584 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-10-20 06:45:13,585 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-10-20 06:45:13,585 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-10-20 06:45:13,586 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-10-20 06:45:13,587 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-10-20 06:45:13,588 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-10-20 06:45:13,588 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-10-20 06:45:13,588 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-10-20 06:45:13,589 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-10-20 06:45:13,590 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-10-20 06:45:13,591 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-32bit-Automizer_Default.epf [2020-10-20 06:45:13,637 INFO L113 SettingsManager]: Loading preferences was successful [2020-10-20 06:45:13,638 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-10-20 06:45:13,639 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2020-10-20 06:45:13,639 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2020-10-20 06:45:13,640 INFO L138 SettingsManager]: * Use SBE=true [2020-10-20 06:45:13,640 INFO L136 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2020-10-20 06:45:13,640 INFO L138 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2020-10-20 06:45:13,640 INFO L138 SettingsManager]: * Use old map elimination=false [2020-10-20 06:45:13,641 INFO L138 SettingsManager]: * Use external solver (rank synthesis)=false [2020-10-20 06:45:13,641 INFO L138 SettingsManager]: * Use only trivial implications for array writes=true [2020-10-20 06:45:13,642 INFO L138 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2020-10-20 06:45:13,642 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-10-20 06:45:13,642 INFO L138 SettingsManager]: * sizeof long=4 [2020-10-20 06:45:13,643 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2020-10-20 06:45:13,643 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-10-20 06:45:13,644 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-10-20 06:45:13,644 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-10-20 06:45:13,644 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2020-10-20 06:45:13,644 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2020-10-20 06:45:13,645 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2020-10-20 06:45:13,645 INFO L138 SettingsManager]: * sizeof long double=12 [2020-10-20 06:45:13,645 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-10-20 06:45:13,645 INFO L138 SettingsManager]: * Assume nondeterminstic values are in range=false [2020-10-20 06:45:13,645 INFO L138 SettingsManager]: * Use constant arrays=true [2020-10-20 06:45:13,646 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2020-10-20 06:45:13,646 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-10-20 06:45:13,646 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2020-10-20 06:45:13,646 INFO L138 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2020-10-20 06:45:13,647 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-10-20 06:45:13,647 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2020-10-20 06:45:13,647 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2020-10-20 06:45:13,647 INFO L138 SettingsManager]: * Dump automata to the following directory=/home/matthias/ultimate/dump/auto [2020-10-20 06:45:13,649 INFO L136 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2020-10-20 06:45:13,649 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 -> 9c20edfd7ede05443471560aa2c7be34d4e8c171 [2020-10-20 06:45:13,853 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2020-10-20 06:45:13,865 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-10-20 06:45:13,868 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-10-20 06:45:13,870 INFO L271 PluginConnector]: Initializing CDTParser... [2020-10-20 06:45:13,870 INFO L275 PluginConnector]: CDTParser initialized [2020-10-20 06:45:13,871 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/bitvector/gcd_4.c [2020-10-20 06:45:13,935 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/97f695712/dee4b29b2f96432e895dad409701250a/FLAGddaf609a7 [2020-10-20 06:45:14,375 INFO L306 CDTParser]: Found 1 translation units. [2020-10-20 06:45:14,376 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/bitvector/gcd_4.c [2020-10-20 06:45:14,382 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/97f695712/dee4b29b2f96432e895dad409701250a/FLAGddaf609a7 [2020-10-20 06:45:14,748 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/97f695712/dee4b29b2f96432e895dad409701250a [2020-10-20 06:45:14,751 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-10-20 06:45:14,757 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2020-10-20 06:45:14,758 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-10-20 06:45:14,758 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-10-20 06:45:14,761 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-10-20 06:45:14,762 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.10 06:45:14" (1/1) ... [2020-10-20 06:45:14,765 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1183b071 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.10 06:45:14, skipping insertion in model container [2020-10-20 06:45:14,765 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.10 06:45:14" (1/1) ... [2020-10-20 06:45:14,772 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-10-20 06:45:14,787 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-10-20 06:45:15,039 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-10-20 06:45:15,052 INFO L203 MainTranslator]: Completed pre-run [2020-10-20 06:45:15,081 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-10-20 06:45:15,095 INFO L208 MainTranslator]: Completed translation [2020-10-20 06:45:15,096 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.10 06:45:15 WrapperNode [2020-10-20 06:45:15,096 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-10-20 06:45:15,097 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2020-10-20 06:45:15,097 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2020-10-20 06:45:15,097 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2020-10-20 06:45:15,105 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.10 06:45:15" (1/1) ... [2020-10-20 06:45:15,113 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.10 06:45:15" (1/1) ... [2020-10-20 06:45:15,133 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2020-10-20 06:45:15,134 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-10-20 06:45:15,134 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-10-20 06:45:15,134 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-10-20 06:45:15,147 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.10 06:45:15" (1/1) ... [2020-10-20 06:45:15,147 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.10 06:45:15" (1/1) ... [2020-10-20 06:45:15,148 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.10 06:45:15" (1/1) ... [2020-10-20 06:45:15,149 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.10 06:45:15" (1/1) ... [2020-10-20 06:45:15,153 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.10 06:45:15" (1/1) ... [2020-10-20 06:45:15,158 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.10 06:45:15" (1/1) ... [2020-10-20 06:45:15,159 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.10 06:45:15" (1/1) ... [2020-10-20 06:45:15,161 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-10-20 06:45:15,161 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-10-20 06:45:15,161 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-10-20 06:45:15,162 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-10-20 06:45:15,162 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.10 06:45:15" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-20 06:45:15,216 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2020-10-20 06:45:15,216 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2020-10-20 06:45:15,216 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-10-20 06:45:15,216 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-10-20 06:45:15,437 INFO L293 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-10-20 06:45:15,438 INFO L298 CfgBuilder]: Removed 19 assume(true) statements. [2020-10-20 06:45:15,439 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.10 06:45:15 BoogieIcfgContainer [2020-10-20 06:45:15,439 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-10-20 06:45:15,440 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2020-10-20 06:45:15,440 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2020-10-20 06:45:15,444 INFO L275 PluginConnector]: BuchiAutomizer initialized [2020-10-20 06:45:15,445 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2020-10-20 06:45:15,445 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 20.10 06:45:14" (1/3) ... [2020-10-20 06:45:15,446 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@77e23594 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 20.10 06:45:15, skipping insertion in model container [2020-10-20 06:45:15,446 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2020-10-20 06:45:15,446 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.10 06:45:15" (2/3) ... [2020-10-20 06:45:15,447 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@77e23594 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 20.10 06:45:15, skipping insertion in model container [2020-10-20 06:45:15,447 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2020-10-20 06:45:15,447 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.10 06:45:15" (3/3) ... [2020-10-20 06:45:15,449 INFO L373 chiAutomizerObserver]: Analyzing ICFG gcd_4.c [2020-10-20 06:45:15,494 INFO L359 BuchiCegarLoop]: Interprodecural is true [2020-10-20 06:45:15,494 INFO L360 BuchiCegarLoop]: Hoare is false [2020-10-20 06:45:15,494 INFO L361 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2020-10-20 06:45:15,494 INFO L362 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2020-10-20 06:45:15,494 INFO L363 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-10-20 06:45:15,495 INFO L364 BuchiCegarLoop]: Difference is false [2020-10-20 06:45:15,495 INFO L365 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-10-20 06:45:15,495 INFO L368 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2020-10-20 06:45:15,507 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 24 states. [2020-10-20 06:45:15,527 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2020-10-20 06:45:15,528 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-10-20 06:45:15,528 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-10-20 06:45:15,533 INFO L852 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2020-10-20 06:45:15,533 INFO L853 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2020-10-20 06:45:15,534 INFO L427 BuchiCegarLoop]: ======== Iteration 1============ [2020-10-20 06:45:15,534 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 24 states. [2020-10-20 06:45:15,536 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2020-10-20 06:45:15,536 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-10-20 06:45:15,536 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-10-20 06:45:15,537 INFO L852 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2020-10-20 06:45:15,537 INFO L853 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2020-10-20 06:45:15,543 INFO L794 eck$LassoCheckResult]: Stem: 14#ULTIMATE.startENTRYtrue #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier;call #t~string4.base, #t~string4.offset := #Ultimate.allocOnStack(2);call write~init~int(48, #t~string4.base, #t~string4.offset, 1);call write~init~int(0, #t~string4.base, 1 + #t~string4.offset, 1);call #t~string5.base, #t~string5.offset := #Ultimate.allocOnStack(8);call #t~string6.base, #t~string6.offset := #Ultimate.allocOnStack(12); 12#L-1true havoc main_#res;havoc main_#t~ret7, 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; 24#L14true assume !(gcd_test_~a < 0); 18#L14-2true assume !(gcd_test_~b < 0); 25#L15-1true assume !(0 == gcd_test_~a); 11#L22-2true [2020-10-20 06:45:15,544 INFO L796 eck$LassoCheckResult]: Loop: 11#L22-2true assume !!(0 != gcd_test_~b); 15#L22true assume !(gcd_test_~a > gcd_test_~b);gcd_test_~b := gcd_test_~b - gcd_test_~a; 11#L22-2true [2020-10-20 06:45:15,548 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 06:45:15,549 INFO L82 PathProgramCache]: Analyzing trace with hash 28695882, now seen corresponding path program 1 times [2020-10-20 06:45:15,565 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 06:45:15,566 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [262258625] [2020-10-20 06:45:15,566 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 06:45:15,675 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-20 06:45:15,676 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-20 06:45:15,694 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-20 06:45:15,695 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-20 06:45:15,717 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-20 06:45:15,718 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 06:45:15,718 INFO L82 PathProgramCache]: Analyzing trace with hash 1862, now seen corresponding path program 1 times [2020-10-20 06:45:15,718 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 06:45:15,719 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1021125064] [2020-10-20 06:45:15,719 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 06:45:15,724 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-20 06:45:15,724 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-20 06:45:15,728 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-20 06:45:15,728 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-20 06:45:15,730 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-20 06:45:15,732 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 06:45:15,732 INFO L82 PathProgramCache]: Analyzing trace with hash 1806939727, now seen corresponding path program 1 times [2020-10-20 06:45:15,732 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 06:45:15,732 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2065322624] [2020-10-20 06:45:15,733 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 06:45:15,746 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 06:45:15,825 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-20 06:45:15,825 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2065322624] [2020-10-20 06:45:15,826 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-20 06:45:15,826 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-10-20 06:45:15,827 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1904636467] [2020-10-20 06:45:15,909 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-20 06:45:15,929 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-20 06:45:15,930 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-20 06:45:15,931 INFO L87 Difference]: Start difference. First operand 24 states. Second operand 3 states. [2020-10-20 06:45:16,006 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-20 06:45:16,006 INFO L93 Difference]: Finished difference Result 23 states and 24 transitions. [2020-10-20 06:45:16,007 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-20 06:45:16,009 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 23 states and 24 transitions. [2020-10-20 06:45:16,011 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2020-10-20 06:45:16,015 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 23 states to 9 states and 10 transitions. [2020-10-20 06:45:16,016 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 9 [2020-10-20 06:45:16,016 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 9 [2020-10-20 06:45:16,016 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 10 transitions. [2020-10-20 06:45:16,017 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-20 06:45:16,017 INFO L691 BuchiCegarLoop]: Abstraction has 9 states and 10 transitions. [2020-10-20 06:45:16,031 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9 states and 10 transitions. [2020-10-20 06:45:16,038 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9 to 9. [2020-10-20 06:45:16,039 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2020-10-20 06:45:16,039 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 10 transitions. [2020-10-20 06:45:16,040 INFO L714 BuchiCegarLoop]: Abstraction has 9 states and 10 transitions. [2020-10-20 06:45:16,040 INFO L594 BuchiCegarLoop]: Abstraction has 9 states and 10 transitions. [2020-10-20 06:45:16,040 INFO L427 BuchiCegarLoop]: ======== Iteration 2============ [2020-10-20 06:45:16,041 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 9 states and 10 transitions. [2020-10-20 06:45:16,041 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2020-10-20 06:45:16,041 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-10-20 06:45:16,042 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-10-20 06:45:16,042 INFO L852 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1] [2020-10-20 06:45:16,042 INFO L853 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2020-10-20 06:45:16,042 INFO L794 eck$LassoCheckResult]: Stem: 60#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier;call #t~string4.base, #t~string4.offset := #Ultimate.allocOnStack(2);call write~init~int(48, #t~string4.base, #t~string4.offset, 1);call write~init~int(0, #t~string4.base, 1 + #t~string4.offset, 1);call #t~string5.base, #t~string5.offset := #Ultimate.allocOnStack(8);call #t~string6.base, #t~string6.offset := #Ultimate.allocOnStack(12); 58#L-1 havoc main_#res;havoc main_#t~ret7, 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; 59#L14 assume !(gcd_test_~a < 0); 63#L14-2 assume !(gcd_test_~b < 0); 64#L15-1 assume !(0 == gcd_test_~a); 65#L22-2 assume !!(0 != gcd_test_~b); 61#L22 assume gcd_test_~a > gcd_test_~b;gcd_test_~a := gcd_test_~a - gcd_test_~b; 62#L22-2 [2020-10-20 06:45:16,042 INFO L796 eck$LassoCheckResult]: Loop: 62#L22-2 assume !!(0 != gcd_test_~b); 66#L22 assume !(gcd_test_~a > gcd_test_~b);gcd_test_~b := gcd_test_~b - gcd_test_~a; 62#L22-2 [2020-10-20 06:45:16,043 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 06:45:16,043 INFO L82 PathProgramCache]: Analyzing trace with hash 1806939725, now seen corresponding path program 1 times [2020-10-20 06:45:16,043 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 06:45:16,043 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1919967421] [2020-10-20 06:45:16,044 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 06:45:16,059 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-20 06:45:16,059 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-20 06:45:16,072 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-20 06:45:16,072 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-20 06:45:16,077 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-20 06:45:16,078 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 06:45:16,078 INFO L82 PathProgramCache]: Analyzing trace with hash 1862, now seen corresponding path program 2 times [2020-10-20 06:45:16,078 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 06:45:16,079 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [514751321] [2020-10-20 06:45:16,079 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 06:45:16,082 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-20 06:45:16,082 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-20 06:45:16,085 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-20 06:45:16,085 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-20 06:45:16,087 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-20 06:45:16,087 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 06:45:16,088 INFO L82 PathProgramCache]: Analyzing trace with hash 1302289042, now seen corresponding path program 1 times [2020-10-20 06:45:16,088 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 06:45:16,088 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1664517819] [2020-10-20 06:45:16,088 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 06:45:16,105 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 06:45:16,155 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-20 06:45:16,155 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1664517819] [2020-10-20 06:45:16,156 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [925448194] [2020-10-20 06:45:16,156 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-10-20 06:45:16,208 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 06:45:16,210 INFO L263 TraceCheckSpWp]: Trace formula consists of 54 conjuncts, 8 conjunts are in the unsatisfiable core [2020-10-20 06:45:16,212 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-20 06:45:16,297 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-20 06:45:16,298 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-10-20 06:45:16,298 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3] total 5 [2020-10-20 06:45:16,298 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1715037237] [2020-10-20 06:45:16,319 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-20 06:45:16,320 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-10-20 06:45:16,320 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2020-10-20 06:45:16,320 INFO L87 Difference]: Start difference. First operand 9 states and 10 transitions. cyclomatic complexity: 2 Second operand 6 states. [2020-10-20 06:45:16,348 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-20 06:45:16,348 INFO L93 Difference]: Finished difference Result 11 states and 12 transitions. [2020-10-20 06:45:16,348 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-10-20 06:45:16,349 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 11 states and 12 transitions. [2020-10-20 06:45:16,350 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2020-10-20 06:45:16,351 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 11 states to 11 states and 12 transitions. [2020-10-20 06:45:16,351 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 11 [2020-10-20 06:45:16,351 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 11 [2020-10-20 06:45:16,351 INFO L73 IsDeterministic]: Start isDeterministic. Operand 11 states and 12 transitions. [2020-10-20 06:45:16,352 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-20 06:45:16,352 INFO L691 BuchiCegarLoop]: Abstraction has 11 states and 12 transitions. [2020-10-20 06:45:16,352 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11 states and 12 transitions. [2020-10-20 06:45:16,353 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11 to 11. [2020-10-20 06:45:16,354 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2020-10-20 06:45:16,354 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 12 transitions. [2020-10-20 06:45:16,354 INFO L714 BuchiCegarLoop]: Abstraction has 11 states and 12 transitions. [2020-10-20 06:45:16,355 INFO L594 BuchiCegarLoop]: Abstraction has 11 states and 12 transitions. [2020-10-20 06:45:16,355 INFO L427 BuchiCegarLoop]: ======== Iteration 3============ [2020-10-20 06:45:16,355 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 11 states and 12 transitions. [2020-10-20 06:45:16,356 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2020-10-20 06:45:16,356 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-10-20 06:45:16,356 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-10-20 06:45:16,357 INFO L852 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 1, 1, 1, 1, 1] [2020-10-20 06:45:16,357 INFO L853 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2020-10-20 06:45:16,357 INFO L794 eck$LassoCheckResult]: Stem: 115#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier;call #t~string4.base, #t~string4.offset := #Ultimate.allocOnStack(2);call write~init~int(48, #t~string4.base, #t~string4.offset, 1);call write~init~int(0, #t~string4.base, 1 + #t~string4.offset, 1);call #t~string5.base, #t~string5.offset := #Ultimate.allocOnStack(8);call #t~string6.base, #t~string6.offset := #Ultimate.allocOnStack(12); 113#L-1 havoc main_#res;havoc main_#t~ret7, 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; 114#L14 assume !(gcd_test_~a < 0); 118#L14-2 assume !(gcd_test_~b < 0); 119#L15-1 assume !(0 == gcd_test_~a); 120#L22-2 assume !!(0 != gcd_test_~b); 116#L22 assume gcd_test_~a > gcd_test_~b;gcd_test_~a := gcd_test_~a - gcd_test_~b; 117#L22-2 assume !!(0 != gcd_test_~b); 121#L22 assume gcd_test_~a > gcd_test_~b;gcd_test_~a := gcd_test_~a - gcd_test_~b; 123#L22-2 [2020-10-20 06:45:16,357 INFO L796 eck$LassoCheckResult]: Loop: 123#L22-2 assume !!(0 != gcd_test_~b); 122#L22 assume !(gcd_test_~a > gcd_test_~b);gcd_test_~b := gcd_test_~b - gcd_test_~a; 123#L22-2 [2020-10-20 06:45:16,358 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 06:45:16,358 INFO L82 PathProgramCache]: Analyzing trace with hash 1302289040, now seen corresponding path program 2 times [2020-10-20 06:45:16,358 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 06:45:16,359 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [263604921] [2020-10-20 06:45:16,359 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 06:45:16,373 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-20 06:45:16,373 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-20 06:45:16,385 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-20 06:45:16,385 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-20 06:45:16,390 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-20 06:45:16,390 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 06:45:16,391 INFO L82 PathProgramCache]: Analyzing trace with hash 1862, now seen corresponding path program 3 times [2020-10-20 06:45:16,391 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 06:45:16,391 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [317164463] [2020-10-20 06:45:16,392 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 06:45:16,394 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-20 06:45:16,395 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-20 06:45:16,397 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-20 06:45:16,397 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-20 06:45:16,399 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-20 06:45:16,400 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 06:45:16,400 INFO L82 PathProgramCache]: Analyzing trace with hash 1664285205, now seen corresponding path program 2 times [2020-10-20 06:45:16,400 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 06:45:16,401 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2067731007] [2020-10-20 06:45:16,401 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 06:45:16,411 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 06:45:16,467 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-20 06:45:16,467 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2067731007] [2020-10-20 06:45:16,468 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [849606314] [2020-10-20 06:45:16,468 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-10-20 06:45:16,512 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2020-10-20 06:45:16,513 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-10-20 06:45:16,514 INFO L263 TraceCheckSpWp]: Trace formula consists of 58 conjuncts, 9 conjunts are in the unsatisfiable core [2020-10-20 06:45:16,515 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-20 06:45:16,576 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-20 06:45:16,577 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-10-20 06:45:16,577 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 7 [2020-10-20 06:45:16,577 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [475092661] [2020-10-20 06:45:16,593 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-20 06:45:16,593 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-10-20 06:45:16,594 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2020-10-20 06:45:16,594 INFO L87 Difference]: Start difference. First operand 11 states and 12 transitions. cyclomatic complexity: 2 Second operand 8 states. [2020-10-20 06:45:16,623 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-20 06:45:16,623 INFO L93 Difference]: Finished difference Result 13 states and 14 transitions. [2020-10-20 06:45:16,624 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-10-20 06:45:16,624 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 13 states and 14 transitions. [2020-10-20 06:45:16,625 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2020-10-20 06:45:16,625 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 13 states to 13 states and 14 transitions. [2020-10-20 06:45:16,626 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 13 [2020-10-20 06:45:16,626 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 13 [2020-10-20 06:45:16,626 INFO L73 IsDeterministic]: Start isDeterministic. Operand 13 states and 14 transitions. [2020-10-20 06:45:16,626 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-20 06:45:16,627 INFO L691 BuchiCegarLoop]: Abstraction has 13 states and 14 transitions. [2020-10-20 06:45:16,627 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13 states and 14 transitions. [2020-10-20 06:45:16,628 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13 to 13. [2020-10-20 06:45:16,629 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2020-10-20 06:45:16,629 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 14 transitions. [2020-10-20 06:45:16,629 INFO L714 BuchiCegarLoop]: Abstraction has 13 states and 14 transitions. [2020-10-20 06:45:16,629 INFO L594 BuchiCegarLoop]: Abstraction has 13 states and 14 transitions. [2020-10-20 06:45:16,630 INFO L427 BuchiCegarLoop]: ======== Iteration 4============ [2020-10-20 06:45:16,630 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 13 states and 14 transitions. [2020-10-20 06:45:16,631 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2020-10-20 06:45:16,631 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-10-20 06:45:16,631 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-10-20 06:45:16,632 INFO L852 BuchiCegarLoop]: Counterexample stem histogram [3, 3, 1, 1, 1, 1, 1] [2020-10-20 06:45:16,632 INFO L853 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2020-10-20 06:45:16,632 INFO L794 eck$LassoCheckResult]: Stem: 182#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier;call #t~string4.base, #t~string4.offset := #Ultimate.allocOnStack(2);call write~init~int(48, #t~string4.base, #t~string4.offset, 1);call write~init~int(0, #t~string4.base, 1 + #t~string4.offset, 1);call #t~string5.base, #t~string5.offset := #Ultimate.allocOnStack(8);call #t~string6.base, #t~string6.offset := #Ultimate.allocOnStack(12); 180#L-1 havoc main_#res;havoc main_#t~ret7, 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; 181#L14 assume !(gcd_test_~a < 0); 185#L14-2 assume !(gcd_test_~b < 0); 186#L15-1 assume !(0 == gcd_test_~a); 187#L22-2 assume !!(0 != gcd_test_~b); 183#L22 assume gcd_test_~a > gcd_test_~b;gcd_test_~a := gcd_test_~a - gcd_test_~b; 184#L22-2 assume !!(0 != gcd_test_~b); 188#L22 assume gcd_test_~a > gcd_test_~b;gcd_test_~a := gcd_test_~a - gcd_test_~b; 192#L22-2 assume !!(0 != gcd_test_~b); 191#L22 assume gcd_test_~a > gcd_test_~b;gcd_test_~a := gcd_test_~a - gcd_test_~b; 190#L22-2 [2020-10-20 06:45:16,632 INFO L796 eck$LassoCheckResult]: Loop: 190#L22-2 assume !!(0 != gcd_test_~b); 189#L22 assume !(gcd_test_~a > gcd_test_~b);gcd_test_~b := gcd_test_~b - gcd_test_~a; 190#L22-2 [2020-10-20 06:45:16,633 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 06:45:16,633 INFO L82 PathProgramCache]: Analyzing trace with hash 1664285203, now seen corresponding path program 3 times [2020-10-20 06:45:16,633 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 06:45:16,634 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1097546483] [2020-10-20 06:45:16,634 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 06:45:16,650 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-20 06:45:16,651 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-20 06:45:16,671 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-20 06:45:16,674 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-20 06:45:16,680 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-20 06:45:16,682 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 06:45:16,682 INFO L82 PathProgramCache]: Analyzing trace with hash 1862, now seen corresponding path program 4 times [2020-10-20 06:45:16,683 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 06:45:16,684 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1766922149] [2020-10-20 06:45:16,684 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 06:45:16,697 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-20 06:45:16,697 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-20 06:45:16,699 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-20 06:45:16,699 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-20 06:45:16,701 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-20 06:45:16,701 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 06:45:16,701 INFO L82 PathProgramCache]: Analyzing trace with hash 1650246872, now seen corresponding path program 3 times [2020-10-20 06:45:16,701 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 06:45:16,702 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1121017472] [2020-10-20 06:45:16,702 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 06:45:16,714 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-20 06:45:16,714 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-20 06:45:16,724 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-20 06:45:16,724 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-20 06:45:16,729 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-20 06:45:17,015 WARN L193 SmtUtils]: Spent 265.00 ms on a formula simplification. DAG size of input: 93 DAG size of output: 76 [2020-10-20 06:45:17,112 INFO L210 LassoAnalysis]: Preferences: [2020-10-20 06:45:17,113 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2020-10-20 06:45:17,113 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2020-10-20 06:45:17,113 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2020-10-20 06:45:17,113 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2020-10-20 06:45:17,113 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-20 06:45:17,114 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2020-10-20 06:45:17,114 INFO L132 ssoRankerPreferences]: Path of dumped script: [2020-10-20 06:45:17,114 INFO L133 ssoRankerPreferences]: Filename of dumped script: gcd_4.c_Iteration4_Lasso [2020-10-20 06:45:17,114 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2020-10-20 06:45:17,114 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2020-10-20 06:45:17,158 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-20 06:45:17,165 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-20 06:45:17,172 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-20 06:45:17,252 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-20 06:45:17,255 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-20 06:45:17,258 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-20 06:45:17,277 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-20 06:45:17,280 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-20 06:45:17,283 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-20 06:45:17,285 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-20 06:45:17,550 INFO L292 LassoAnalysis]: Preprocessing complete. [2020-10-20 06:45:17,556 INFO L489 LassoAnalysis]: Using template 'affine'. 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 [2020-10-20 06:45:17,564 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-10-20 06:45:17,570 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-20 06:45:17,571 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-20 06:45:17,571 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-20 06:45:17,571 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-20 06:45:17,578 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-10-20 06:45:17,578 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-10-20 06:45:17,588 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 5 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2020-10-20 06:45:17,632 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-10-20 06:45:17,634 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-20 06:45:17,635 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-10-20 06:45:17,635 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-20 06:45:17,635 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-20 06:45:17,636 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-20 06:45:17,637 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-10-20 06:45:17,637 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. Waiting until toolchain timeout for monitored process 5 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-20 06:45:17,639 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 6 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2020-10-20 06:45:17,682 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-10-20 06:45:17,683 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-20 06:45:17,684 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-20 06:45:17,684 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-20 06:45:17,684 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-20 06:45:17,689 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-10-20 06:45:17,689 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. Waiting until toolchain timeout for monitored process 6 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-20 06:45:17,694 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) [2020-10-20 06:45:17,734 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-10-20 06:45:17,736 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-20 06:45:17,736 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-20 06:45:17,736 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-20 06:45:17,736 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-20 06:45:17,742 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-10-20 06:45:17,742 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. Waiting until toolchain timeout for monitored process 7 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-20 06:45:17,750 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 8 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2020-10-20 06:45:17,794 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-10-20 06:45:17,797 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-20 06:45:17,799 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-20 06:45:17,799 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-20 06:45:17,799 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-20 06:45:17,803 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-10-20 06:45:17,803 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. Waiting until toolchain timeout for monitored process 8 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-20 06:45:17,808 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 9 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2020-10-20 06:45:17,851 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-10-20 06:45:17,853 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-20 06:45:17,853 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-20 06:45:17,853 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-20 06:45:17,854 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-20 06:45:17,860 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-10-20 06:45:17,860 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. Waiting until toolchain timeout for monitored process 9 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-20 06:45:17,868 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 10 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 10 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-20 06:45:17,896 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-10-20 06:45:17,897 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-20 06:45:17,898 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-20 06:45:17,898 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-20 06:45:17,898 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-20 06:45:17,901 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-10-20 06:45:17,901 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-10-20 06:45:17,906 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 11 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2020-10-20 06:45:17,948 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-10-20 06:45:17,949 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-20 06:45:17,950 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-20 06:45:17,950 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-20 06:45:17,950 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-20 06:45:17,952 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-10-20 06:45:17,953 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. Waiting until toolchain timeout for monitored process 11 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-20 06:45:17,957 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 12 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 12 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-20 06:45:17,993 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-10-20 06:45:17,994 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-20 06:45:17,994 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-20 06:45:17,995 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-20 06:45:17,995 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-20 06:45:17,997 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-10-20 06:45:17,997 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-10-20 06:45:18,004 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 13 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 13 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-20 06:45:18,036 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-10-20 06:45:18,037 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-20 06:45:18,037 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-20 06:45:18,037 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-20 06:45:18,037 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-20 06:45:18,039 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-10-20 06:45:18,039 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-10-20 06:45:18,043 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 14 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2020-10-20 06:45:18,087 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-10-20 06:45:18,088 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-20 06:45:18,089 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-20 06:45:18,089 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-20 06:45:18,089 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-20 06:45:18,091 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-10-20 06:45:18,091 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. Waiting until toolchain timeout for monitored process 14 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-20 06:45:18,098 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 15 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2020-10-20 06:45:18,127 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-10-20 06:45:18,130 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-20 06:45:18,130 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-20 06:45:18,130 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-20 06:45:18,130 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. Waiting until toolchain timeout for monitored process 15 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-20 06:45:18,147 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-10-20 06:45:18,149 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-10-20 06:45:18,159 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 16 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2020-10-20 06:45:18,211 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-10-20 06:45:18,213 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-20 06:45:18,213 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-20 06:45:18,213 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-20 06:45:18,213 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-20 06:45:18,218 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-10-20 06:45:18,218 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. Waiting until toolchain timeout for monitored process 16 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-20 06:45:18,229 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 17 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 17 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-20 06:45:18,268 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-10-20 06:45:18,269 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-20 06:45:18,270 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-20 06:45:18,270 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-20 06:45:18,270 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-20 06:45:18,272 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-10-20 06:45:18,272 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-10-20 06:45:18,276 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 18 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2020-10-20 06:45:18,321 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-10-20 06:45:18,323 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-20 06:45:18,323 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-10-20 06:45:18,323 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-20 06:45:18,323 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-20 06:45:18,323 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-20 06:45:18,324 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-10-20 06:45:18,324 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. Waiting until toolchain timeout for monitored process 18 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-20 06:45:18,326 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 19 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 19 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-20 06:45:18,362 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-10-20 06:45:18,363 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-20 06:45:18,363 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-20 06:45:18,363 INFO L204 nArgumentSynthesizer]: 2 loop disjuncts [2020-10-20 06:45:18,364 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-20 06:45:18,378 INFO L401 nArgumentSynthesizer]: We have 16 Motzkin's Theorem applications. [2020-10-20 06:45:18,378 INFO L402 nArgumentSynthesizer]: A total of 4 supporting invariants were added. [2020-10-20 06:45:18,410 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2020-10-20 06:45:18,464 INFO L443 ModelExtractionUtils]: Simplification made 8 calls to the SMT solver. [2020-10-20 06:45:18,464 INFO L444 ModelExtractionUtils]: 25 out of 36 variables were initially zero. Simplification set additionally 5 variables to zero. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 20 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 20 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-20 06:45:18,476 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2020-10-20 06:45:18,481 INFO L438 nArgumentSynthesizer]: Removed 3 redundant supporting invariants from a total of 4. [2020-10-20 06:45:18,482 INFO L510 LassoAnalysis]: Proved termination. [2020-10-20 06:45:18,483 INFO L512 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_gcd_test_~b) = 1*ULTIMATE.start_gcd_test_~b Supporting invariants [1*ULTIMATE.start_gcd_test_~a - 2 >= 0] [2020-10-20 06:45:18,546 INFO L297 tatePredicateManager]: 7 out of 8 supporting invariants were superfluous and have been removed [2020-10-20 06:45:18,579 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 06:45:18,597 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 06:45:18,598 INFO L263 TraceCheckSpWp]: Trace formula consists of 58 conjuncts, 11 conjunts are in the unsatisfiable core [2020-10-20 06:45:18,600 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-20 06:45:18,763 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 06:45:18,764 WARN L261 TraceCheckSpWp]: Trace formula consists of 7 conjuncts, 5 conjunts are in the unsatisfiable core [2020-10-20 06:45:18,764 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-20 06:45:18,765 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-20 06:45:18,769 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.4 stem predicates 1 loop predicates [2020-10-20 06:45:18,770 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 13 states and 14 transitions. cyclomatic complexity: 2 Second operand 6 states. [2020-10-20 06:45:18,863 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 13 states and 14 transitions. cyclomatic complexity: 2. Second operand 6 states. Result 14 states and 15 transitions. Complement of second has 6 states. [2020-10-20 06:45:18,865 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 2 stem states 1 non-accepting loop states 1 accepting loop states [2020-10-20 06:45:18,865 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2020-10-20 06:45:18,866 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 8 transitions. [2020-10-20 06:45:18,869 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 8 transitions. Stem has 11 letters. Loop has 2 letters. [2020-10-20 06:45:18,870 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-10-20 06:45:18,870 INFO L639 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2020-10-20 06:45:18,900 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 06:45:18,914 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 06:45:18,915 INFO L263 TraceCheckSpWp]: Trace formula consists of 58 conjuncts, 11 conjunts are in the unsatisfiable core [2020-10-20 06:45:18,916 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-20 06:45:18,979 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 06:45:18,980 WARN L261 TraceCheckSpWp]: Trace formula consists of 7 conjuncts, 5 conjunts are in the unsatisfiable core [2020-10-20 06:45:18,980 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-20 06:45:18,980 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-20 06:45:18,981 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and with honda bouncer for loop.4 stem predicates 1 loop predicates [2020-10-20 06:45:18,981 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 13 states and 14 transitions. cyclomatic complexity: 2 Second operand 6 states. [2020-10-20 06:45:19,050 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 13 states and 14 transitions. cyclomatic complexity: 2. Second operand 6 states. Result 14 states and 15 transitions. Complement of second has 6 states. [2020-10-20 06:45:19,050 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 2 stem states 1 non-accepting loop states 1 accepting loop states [2020-10-20 06:45:19,051 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2020-10-20 06:45:19,051 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 8 transitions. [2020-10-20 06:45:19,051 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 8 transitions. Stem has 11 letters. Loop has 2 letters. [2020-10-20 06:45:19,051 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-10-20 06:45:19,051 INFO L639 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2020-10-20 06:45:19,073 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 06:45:19,084 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 06:45:19,085 INFO L263 TraceCheckSpWp]: Trace formula consists of 58 conjuncts, 11 conjunts are in the unsatisfiable core [2020-10-20 06:45:19,086 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-20 06:45:19,144 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 06:45:19,145 WARN L261 TraceCheckSpWp]: Trace formula consists of 7 conjuncts, 5 conjunts are in the unsatisfiable core [2020-10-20 06:45:19,145 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-20 06:45:19,146 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-20 06:45:19,146 INFO L152 lantAutomatonBouncer]: Defining Buchi interpolant automaton with scrooge nondeterminism in stemwith honda bouncer for stem and without honda bouncer for loop.4 stem predicates 1 loop predicates [2020-10-20 06:45:19,146 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 13 states and 14 transitions. cyclomatic complexity: 2 Second operand 6 states. [2020-10-20 06:45:19,264 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 13 states and 14 transitions. cyclomatic complexity: 2. Second operand 6 states. Result 21 states and 25 transitions. Complement of second has 12 states. [2020-10-20 06:45:19,265 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 7 states 4 stem states 1 non-accepting loop states 2 accepting loop states [2020-10-20 06:45:19,265 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2020-10-20 06:45:19,266 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 20 transitions. [2020-10-20 06:45:19,266 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 20 transitions. Stem has 11 letters. Loop has 2 letters. [2020-10-20 06:45:19,266 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-10-20 06:45:19,266 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 20 transitions. Stem has 13 letters. Loop has 2 letters. [2020-10-20 06:45:19,267 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-10-20 06:45:19,267 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 20 transitions. Stem has 11 letters. Loop has 4 letters. [2020-10-20 06:45:19,267 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-10-20 06:45:19,268 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 21 states and 25 transitions. [2020-10-20 06:45:19,269 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2020-10-20 06:45:19,269 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 21 states to 19 states and 23 transitions. [2020-10-20 06:45:19,269 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 13 [2020-10-20 06:45:19,270 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 17 [2020-10-20 06:45:19,270 INFO L73 IsDeterministic]: Start isDeterministic. Operand 19 states and 23 transitions. [2020-10-20 06:45:19,270 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2020-10-20 06:45:19,270 INFO L691 BuchiCegarLoop]: Abstraction has 19 states and 23 transitions. [2020-10-20 06:45:19,271 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19 states and 23 transitions. [2020-10-20 06:45:19,272 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19 to 17. [2020-10-20 06:45:19,272 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2020-10-20 06:45:19,273 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 20 transitions. [2020-10-20 06:45:19,273 INFO L714 BuchiCegarLoop]: Abstraction has 17 states and 20 transitions. [2020-10-20 06:45:19,273 INFO L594 BuchiCegarLoop]: Abstraction has 17 states and 20 transitions. [2020-10-20 06:45:19,273 INFO L427 BuchiCegarLoop]: ======== Iteration 5============ [2020-10-20 06:45:19,273 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 17 states and 20 transitions. [2020-10-20 06:45:19,274 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2020-10-20 06:45:19,274 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-10-20 06:45:19,275 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-10-20 06:45:19,275 INFO L852 BuchiCegarLoop]: Counterexample stem histogram [4, 4, 1, 1, 1, 1, 1] [2020-10-20 06:45:19,275 INFO L853 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2020-10-20 06:45:19,276 INFO L794 eck$LassoCheckResult]: Stem: 463#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier;call #t~string4.base, #t~string4.offset := #Ultimate.allocOnStack(2);call write~init~int(48, #t~string4.base, #t~string4.offset, 1);call write~init~int(0, #t~string4.base, 1 + #t~string4.offset, 1);call #t~string5.base, #t~string5.offset := #Ultimate.allocOnStack(8);call #t~string6.base, #t~string6.offset := #Ultimate.allocOnStack(12); 461#L-1 havoc main_#res;havoc main_#t~ret7, 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; 462#L14 assume !(gcd_test_~a < 0); 468#L14-2 assume !(gcd_test_~b < 0); 469#L15-1 assume !(0 == gcd_test_~a); 470#L22-2 assume !!(0 != gcd_test_~b); 477#L22 assume gcd_test_~a > gcd_test_~b;gcd_test_~a := gcd_test_~a - gcd_test_~b; 476#L22-2 assume !!(0 != gcd_test_~b); 475#L22 assume gcd_test_~a > gcd_test_~b;gcd_test_~a := gcd_test_~a - gcd_test_~b; 474#L22-2 assume !!(0 != gcd_test_~b); 473#L22 assume gcd_test_~a > gcd_test_~b;gcd_test_~a := gcd_test_~a - gcd_test_~b; 472#L22-2 assume !!(0 != gcd_test_~b); 464#L22 assume gcd_test_~a > gcd_test_~b;gcd_test_~a := gcd_test_~a - gcd_test_~b; 465#L22-2 [2020-10-20 06:45:19,276 INFO L796 eck$LassoCheckResult]: Loop: 465#L22-2 assume !!(0 != gcd_test_~b); 471#L22 assume !(gcd_test_~a > gcd_test_~b);gcd_test_~b := gcd_test_~b - gcd_test_~a; 465#L22-2 [2020-10-20 06:45:19,276 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 06:45:19,276 INFO L82 PathProgramCache]: Analyzing trace with hash 1650246870, now seen corresponding path program 4 times [2020-10-20 06:45:19,277 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 06:45:19,277 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1921006551] [2020-10-20 06:45:19,277 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 06:45:19,287 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 06:45:19,334 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-20 06:45:19,334 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1921006551] [2020-10-20 06:45:19,335 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-20 06:45:19,335 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-10-20 06:45:19,335 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [508690830] [2020-10-20 06:45:19,336 INFO L799 eck$LassoCheckResult]: stem already infeasible [2020-10-20 06:45:19,336 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 06:45:19,336 INFO L82 PathProgramCache]: Analyzing trace with hash 1862, now seen corresponding path program 5 times [2020-10-20 06:45:19,336 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 06:45:19,336 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [509313158] [2020-10-20 06:45:19,337 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 06:45:19,339 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-20 06:45:19,340 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-20 06:45:19,341 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-20 06:45:19,342 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-20 06:45:19,343 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-20 06:45:19,357 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-20 06:45:19,358 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-10-20 06:45:19,358 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2020-10-20 06:45:19,358 INFO L87 Difference]: Start difference. First operand 17 states and 20 transitions. cyclomatic complexity: 5 Second operand 6 states. [2020-10-20 06:45:19,391 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-20 06:45:19,391 INFO L93 Difference]: Finished difference Result 19 states and 21 transitions. [2020-10-20 06:45:19,391 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-10-20 06:45:19,392 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 19 states and 21 transitions. [2020-10-20 06:45:19,393 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2020-10-20 06:45:19,393 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 19 states to 18 states and 20 transitions. [2020-10-20 06:45:19,393 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 15 [2020-10-20 06:45:19,394 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 15 [2020-10-20 06:45:19,394 INFO L73 IsDeterministic]: Start isDeterministic. Operand 18 states and 20 transitions. [2020-10-20 06:45:19,394 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2020-10-20 06:45:19,394 INFO L691 BuchiCegarLoop]: Abstraction has 18 states and 20 transitions. [2020-10-20 06:45:19,394 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18 states and 20 transitions. [2020-10-20 06:45:19,396 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18 to 17. [2020-10-20 06:45:19,396 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2020-10-20 06:45:19,396 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 19 transitions. [2020-10-20 06:45:19,396 INFO L714 BuchiCegarLoop]: Abstraction has 17 states and 19 transitions. [2020-10-20 06:45:19,397 INFO L594 BuchiCegarLoop]: Abstraction has 17 states and 19 transitions. [2020-10-20 06:45:19,397 INFO L427 BuchiCegarLoop]: ======== Iteration 6============ [2020-10-20 06:45:19,397 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 17 states and 19 transitions. [2020-10-20 06:45:19,397 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2020-10-20 06:45:19,398 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-10-20 06:45:19,398 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-10-20 06:45:19,398 INFO L852 BuchiCegarLoop]: Counterexample stem histogram [5, 4, 1, 1, 1, 1, 1, 1] [2020-10-20 06:45:19,399 INFO L853 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2020-10-20 06:45:19,399 INFO L794 eck$LassoCheckResult]: Stem: 508#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier;call #t~string4.base, #t~string4.offset := #Ultimate.allocOnStack(2);call write~init~int(48, #t~string4.base, #t~string4.offset, 1);call write~init~int(0, #t~string4.base, 1 + #t~string4.offset, 1);call #t~string5.base, #t~string5.offset := #Ultimate.allocOnStack(8);call #t~string6.base, #t~string6.offset := #Ultimate.allocOnStack(12); 506#L-1 havoc main_#res;havoc main_#t~ret7, 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; 507#L14 assume !(gcd_test_~a < 0); 513#L14-2 assume !(gcd_test_~b < 0); 514#L15-1 assume !(0 == gcd_test_~a); 515#L22-2 assume !!(0 != gcd_test_~b); 522#L22 assume gcd_test_~a > gcd_test_~b;gcd_test_~a := gcd_test_~a - gcd_test_~b; 521#L22-2 assume !!(0 != gcd_test_~b); 520#L22 assume gcd_test_~a > gcd_test_~b;gcd_test_~a := gcd_test_~a - gcd_test_~b; 519#L22-2 assume !!(0 != gcd_test_~b); 518#L22 assume gcd_test_~a > gcd_test_~b;gcd_test_~a := gcd_test_~a - gcd_test_~b; 517#L22-2 assume !!(0 != gcd_test_~b); 511#L22 assume !(gcd_test_~a > gcd_test_~b);gcd_test_~b := gcd_test_~b - gcd_test_~a; 512#L22-2 assume !!(0 != gcd_test_~b); 509#L22 assume gcd_test_~a > gcd_test_~b;gcd_test_~a := gcd_test_~a - gcd_test_~b; 510#L22-2 [2020-10-20 06:45:19,399 INFO L796 eck$LassoCheckResult]: Loop: 510#L22-2 assume !!(0 != gcd_test_~b); 516#L22 assume !(gcd_test_~a > gcd_test_~b);gcd_test_~b := gcd_test_~b - gcd_test_~a; 510#L22-2 [2020-10-20 06:45:19,399 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 06:45:19,399 INFO L82 PathProgramCache]: Analyzing trace with hash 1044312667, now seen corresponding path program 4 times [2020-10-20 06:45:19,400 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 06:45:19,400 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1240428124] [2020-10-20 06:45:19,400 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 06:45:19,410 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 06:45:19,468 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 12 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-20 06:45:19,468 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1240428124] [2020-10-20 06:45:19,468 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1989547448] [2020-10-20 06:45:19,468 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 21 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2020-10-20 06:45:19,524 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2020-10-20 06:45:19,525 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat Waiting until toolchain timeout for monitored process 21 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-10-20 06:45:19,526 INFO L263 TraceCheckSpWp]: Trace formula consists of 66 conjuncts, 11 conjunts are in the unsatisfiable core [2020-10-20 06:45:19,528 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-20 06:45:19,609 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 12 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-20 06:45:19,610 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-10-20 06:45:19,610 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 11 [2020-10-20 06:45:19,610 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1455861412] [2020-10-20 06:45:19,611 INFO L799 eck$LassoCheckResult]: stem already infeasible [2020-10-20 06:45:19,611 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 06:45:19,611 INFO L82 PathProgramCache]: Analyzing trace with hash 1862, now seen corresponding path program 6 times [2020-10-20 06:45:19,611 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 06:45:19,611 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1266471054] [2020-10-20 06:45:19,611 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 06:45:19,614 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-20 06:45:19,615 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-20 06:45:19,616 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-20 06:45:19,617 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-20 06:45:19,618 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-20 06:45:19,631 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-20 06:45:19,632 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-10-20 06:45:19,632 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=86, Unknown=0, NotChecked=0, Total=132 [2020-10-20 06:45:19,632 INFO L87 Difference]: Start difference. First operand 17 states and 19 transitions. cyclomatic complexity: 4 Second operand 12 states. [2020-10-20 06:45:19,691 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-20 06:45:19,692 INFO L93 Difference]: Finished difference Result 21 states and 23 transitions. [2020-10-20 06:45:19,692 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-10-20 06:45:19,692 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 21 states and 23 transitions. [2020-10-20 06:45:19,693 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2020-10-20 06:45:19,693 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 21 states to 20 states and 22 transitions. [2020-10-20 06:45:19,694 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 15 [2020-10-20 06:45:19,694 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 15 [2020-10-20 06:45:19,694 INFO L73 IsDeterministic]: Start isDeterministic. Operand 20 states and 22 transitions. [2020-10-20 06:45:19,694 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2020-10-20 06:45:19,694 INFO L691 BuchiCegarLoop]: Abstraction has 20 states and 22 transitions. [2020-10-20 06:45:19,695 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20 states and 22 transitions. [2020-10-20 06:45:19,696 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20 to 19. [2020-10-20 06:45:19,696 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2020-10-20 06:45:19,696 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 21 transitions. [2020-10-20 06:45:19,696 INFO L714 BuchiCegarLoop]: Abstraction has 19 states and 21 transitions. [2020-10-20 06:45:19,697 INFO L594 BuchiCegarLoop]: Abstraction has 19 states and 21 transitions. [2020-10-20 06:45:19,697 INFO L427 BuchiCegarLoop]: ======== Iteration 7============ [2020-10-20 06:45:19,697 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 19 states and 21 transitions. [2020-10-20 06:45:19,698 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2020-10-20 06:45:19,698 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-10-20 06:45:19,698 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-10-20 06:45:19,699 INFO L852 BuchiCegarLoop]: Counterexample stem histogram [6, 4, 2, 1, 1, 1, 1, 1] [2020-10-20 06:45:19,699 INFO L853 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2020-10-20 06:45:19,699 INFO L794 eck$LassoCheckResult]: Stem: 605#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier;call #t~string4.base, #t~string4.offset := #Ultimate.allocOnStack(2);call write~init~int(48, #t~string4.base, #t~string4.offset, 1);call write~init~int(0, #t~string4.base, 1 + #t~string4.offset, 1);call #t~string5.base, #t~string5.offset := #Ultimate.allocOnStack(8);call #t~string6.base, #t~string6.offset := #Ultimate.allocOnStack(12); 603#L-1 havoc main_#res;havoc main_#t~ret7, 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; 604#L14 assume !(gcd_test_~a < 0); 610#L14-2 assume !(gcd_test_~b < 0); 611#L15-1 assume !(0 == gcd_test_~a); 612#L22-2 assume !!(0 != gcd_test_~b); 621#L22 assume gcd_test_~a > gcd_test_~b;gcd_test_~a := gcd_test_~a - gcd_test_~b; 620#L22-2 assume !!(0 != gcd_test_~b); 619#L22 assume gcd_test_~a > gcd_test_~b;gcd_test_~a := gcd_test_~a - gcd_test_~b; 618#L22-2 assume !!(0 != gcd_test_~b); 617#L22 assume gcd_test_~a > gcd_test_~b;gcd_test_~a := gcd_test_~a - gcd_test_~b; 615#L22-2 assume !!(0 != gcd_test_~b); 616#L22 assume !(gcd_test_~a > gcd_test_~b);gcd_test_~b := gcd_test_~b - gcd_test_~a; 614#L22-2 assume !!(0 != gcd_test_~b); 608#L22 assume !(gcd_test_~a > gcd_test_~b);gcd_test_~b := gcd_test_~b - gcd_test_~a; 609#L22-2 assume !!(0 != gcd_test_~b); 606#L22 assume gcd_test_~a > gcd_test_~b;gcd_test_~a := gcd_test_~a - gcd_test_~b; 607#L22-2 [2020-10-20 06:45:19,699 INFO L796 eck$LassoCheckResult]: Loop: 607#L22-2 assume !!(0 != gcd_test_~b); 613#L22 assume !(gcd_test_~a > gcd_test_~b);gcd_test_~b := gcd_test_~b - gcd_test_~a; 607#L22-2 [2020-10-20 06:45:19,700 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 06:45:19,700 INFO L82 PathProgramCache]: Analyzing trace with hash -1437871456, now seen corresponding path program 5 times [2020-10-20 06:45:19,700 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 06:45:19,700 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [137125629] [2020-10-20 06:45:19,701 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 06:45:19,711 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 06:45:19,827 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 5 proven. 25 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-20 06:45:19,827 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [137125629] [2020-10-20 06:45:19,827 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [148587642] [2020-10-20 06:45:19,828 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 22 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 22 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-10-20 06:45:19,863 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 6 check-sat command(s) [2020-10-20 06:45:19,864 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-10-20 06:45:19,865 INFO L263 TraceCheckSpWp]: Trace formula consists of 70 conjuncts, 14 conjunts are in the unsatisfiable core [2020-10-20 06:45:19,866 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-20 06:45:20,050 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 5 proven. 25 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-20 06:45:20,050 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-10-20 06:45:20,050 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 13 [2020-10-20 06:45:20,050 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1844527284] [2020-10-20 06:45:20,051 INFO L799 eck$LassoCheckResult]: stem already infeasible [2020-10-20 06:45:20,051 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 06:45:20,051 INFO L82 PathProgramCache]: Analyzing trace with hash 1862, now seen corresponding path program 7 times [2020-10-20 06:45:20,051 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 06:45:20,052 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [556864835] [2020-10-20 06:45:20,052 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 06:45:20,056 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-20 06:45:20,057 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-20 06:45:20,059 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-20 06:45:20,059 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-20 06:45:20,067 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-20 06:45:20,083 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-20 06:45:20,083 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2020-10-20 06:45:20,083 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=123, Unknown=0, NotChecked=0, Total=156 [2020-10-20 06:45:20,083 INFO L87 Difference]: Start difference. First operand 19 states and 21 transitions. cyclomatic complexity: 4 Second operand 13 states. [2020-10-20 06:45:20,248 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-20 06:45:20,248 INFO L93 Difference]: Finished difference Result 16 states and 15 transitions. [2020-10-20 06:45:20,248 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-10-20 06:45:20,248 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 16 states and 15 transitions. [2020-10-20 06:45:20,249 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2020-10-20 06:45:20,250 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 16 states to 0 states and 0 transitions. [2020-10-20 06:45:20,250 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2020-10-20 06:45:20,250 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2020-10-20 06:45:20,250 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2020-10-20 06:45:20,250 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-20 06:45:20,250 INFO L691 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2020-10-20 06:45:20,250 INFO L714 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2020-10-20 06:45:20,250 INFO L594 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2020-10-20 06:45:20,250 INFO L427 BuchiCegarLoop]: ======== Iteration 8============ [2020-10-20 06:45:20,250 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2020-10-20 06:45:20,251 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2020-10-20 06:45:20,251 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2020-10-20 06:45:20,258 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 20.10 06:45:20 BoogieIcfgContainer [2020-10-20 06:45:20,258 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2020-10-20 06:45:20,258 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2020-10-20 06:45:20,259 INFO L271 PluginConnector]: Initializing Witness Printer... [2020-10-20 06:45:20,259 INFO L275 PluginConnector]: Witness Printer initialized [2020-10-20 06:45:20,259 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.10 06:45:15" (3/4) ... [2020-10-20 06:45:20,263 INFO L140 WitnessPrinter]: No result that supports witness generation found [2020-10-20 06:45:20,263 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2020-10-20 06:45:20,265 INFO L168 Benchmark]: Toolchain (without parser) took 5512.01 ms. Allocated memory was 34.6 MB in the beginning and 66.6 MB in the end (delta: 32.0 MB). Free memory was 12.2 MB in the beginning and 41.1 MB in the end (delta: -28.9 MB). Peak memory consumption was 3.1 MB. Max. memory is 14.3 GB. [2020-10-20 06:45:20,266 INFO L168 Benchmark]: CDTParser took 0.27 ms. Allocated memory is still 33.6 MB. Free memory was 18.7 MB in the beginning and 18.6 MB in the end (delta: 41.9 kB). Peak memory consumption was 41.9 kB. Max. memory is 14.3 GB. [2020-10-20 06:45:20,267 INFO L168 Benchmark]: CACSL2BoogieTranslator took 338.47 ms. Allocated memory was 34.6 MB in the beginning and 41.4 MB in the end (delta: 6.8 MB). Free memory was 11.4 MB in the beginning and 24.8 MB in the end (delta: -13.4 MB). Peak memory consumption was 8.4 MB. Max. memory is 14.3 GB. [2020-10-20 06:45:20,268 INFO L168 Benchmark]: Boogie Procedure Inliner took 36.80 ms. Allocated memory is still 41.4 MB. Free memory was 24.8 MB in the beginning and 23.1 MB in the end (delta: 1.8 MB). Peak memory consumption was 1.8 MB. Max. memory is 14.3 GB. [2020-10-20 06:45:20,269 INFO L168 Benchmark]: Boogie Preprocessor took 27.15 ms. Allocated memory is still 41.4 MB. Free memory was 23.1 MB in the beginning and 21.7 MB in the end (delta: 1.4 MB). Peak memory consumption was 1.4 MB. Max. memory is 14.3 GB. [2020-10-20 06:45:20,269 INFO L168 Benchmark]: RCFGBuilder took 278.29 ms. Allocated memory is still 41.4 MB. Free memory was 21.7 MB in the beginning and 18.2 MB in the end (delta: 3.5 MB). Peak memory consumption was 11.9 MB. Max. memory is 14.3 GB. [2020-10-20 06:45:20,270 INFO L168 Benchmark]: BuchiAutomizer took 4818.07 ms. Allocated memory was 41.4 MB in the beginning and 66.6 MB in the end (delta: 25.2 MB). Free memory was 18.0 MB in the beginning and 41.9 MB in the end (delta: -23.9 MB). Peak memory consumption was 1.2 MB. Max. memory is 14.3 GB. [2020-10-20 06:45:20,271 INFO L168 Benchmark]: Witness Printer took 4.69 ms. Allocated memory is still 66.6 MB. Free memory was 41.9 MB in the beginning and 41.1 MB in the end (delta: 816.0 kB). Peak memory consumption was 816.0 kB. Max. memory is 14.3 GB. [2020-10-20 06:45:20,275 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.27 ms. Allocated memory is still 33.6 MB. Free memory was 18.7 MB in the beginning and 18.6 MB in the end (delta: 41.9 kB). Peak memory consumption was 41.9 kB. Max. memory is 14.3 GB. * CACSL2BoogieTranslator took 338.47 ms. Allocated memory was 34.6 MB in the beginning and 41.4 MB in the end (delta: 6.8 MB). Free memory was 11.4 MB in the beginning and 24.8 MB in the end (delta: -13.4 MB). Peak memory consumption was 8.4 MB. Max. memory is 14.3 GB. * Boogie Procedure Inliner took 36.80 ms. Allocated memory is still 41.4 MB. Free memory was 24.8 MB in the beginning and 23.1 MB in the end (delta: 1.8 MB). Peak memory consumption was 1.8 MB. Max. memory is 14.3 GB. * Boogie Preprocessor took 27.15 ms. Allocated memory is still 41.4 MB. Free memory was 23.1 MB in the beginning and 21.7 MB in the end (delta: 1.4 MB). Peak memory consumption was 1.4 MB. Max. memory is 14.3 GB. * RCFGBuilder took 278.29 ms. Allocated memory is still 41.4 MB. Free memory was 21.7 MB in the beginning and 18.2 MB in the end (delta: 3.5 MB). Peak memory consumption was 11.9 MB. Max. memory is 14.3 GB. * BuchiAutomizer took 4818.07 ms. Allocated memory was 41.4 MB in the beginning and 66.6 MB in the end (delta: 25.2 MB). Free memory was 18.0 MB in the beginning and 41.9 MB in the end (delta: -23.9 MB). Peak memory consumption was 1.2 MB. Max. memory is 14.3 GB. * Witness Printer took 4.69 ms. Allocated memory is still 66.6 MB. Free memory was 41.9 MB in the beginning and 41.1 MB in the end (delta: 816.0 kB). Peak memory consumption was 816.0 kB. Max. memory is 14.3 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 4.7s and 8 iterations. TraceHistogramMax:6. Analysis of lassos took 3.4s. Construction of modules took 0.2s. Büchi inclusion checks took 0.8s. Highest rank in rank-based complementation 3. Minimization of det autom 4. Minimization of nondet autom 3. Automata minimization 0.0s AutomataMinimizationTime, 6 MinimizatonAttempts, 4 StatesRemovedByMinimization, 3 NontrivialMinimizations. Non-live state removal took 0.0s Buchi closure took 0.0s. Biggest automaton had 19 states and ocurred in iteration 6. Nontrivial modules had stage [0, 0, 1, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 36 SDtfs, 69 SDslu, 44 SDs, 0 SdLazy, 270 SolverSat, 37 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.2s Time LassoAnalysisResults: nont0 unkn0 SFLI0 SFLT0 conc3 concLT0 SILN3 SILU0 SILI0 SILT0 lasso1 LassoPreprocessingBenchmarks: Lassos: inital146 mio100 ax100 hnf95 lsp66 ukn47 mio100 lsp81 div100 bol100 ite100 ukn100 eq205 hnf90 smp100 dnf122 smp100 tf100 neg97 sie104 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: sat Degree: 0 Time: 126ms VariablesStem: 6 VariablesLoop: 3 DisjunctsStem: 1 DisjunctsLoop: 2 SupportingInvariants: 4 MotzkinApplications: 16 LassoTerminationAnalysisBenchmarks: LassoNonterminationAnalysisSatFixpoint: 0 LassoNonterminationAnalysisSatUnbounded: 0 LassoNonterminationAnalysisUnsat: 0 LassoNonterminationAnalysisUnknown: 0 LassoNonterminationAnalysisTime: 0.0s - TerminationAnalysisResult: Termination proven Buchi Automizer proved that your program is terminating RESULT: Ultimate proved your program to be correct! Received shutdown request...