./Ultimate.py --spec ../sv-benchmarks/c/properties/termination.prp --file ../sv-benchmarks/c/termination-crafted-lit/CookSeeZuleger-TACAS2013-Fig8a-modified.c --full-output -ea --architecture 64bit -------------------------------------------------------------------------------- Checking for termination Using default analysis Version 8bd4bc60 Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx12G -Xms1G -ea -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerTermination.xml -i ../sv-benchmarks/c/termination-crafted-lit/CookSeeZuleger-TACAS2013-Fig8a-modified.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-64bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(F end) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 64bit --witnessprinter.graph.data.programhash 9a661b9ed427d2e9174ef6e6cb1f5d6d0ab8d9e2 ........................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................ Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.25-8bd4bc6 [2020-07-29 01:28:42,601 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-07-29 01:28:42,603 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-07-29 01:28:42,616 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-07-29 01:28:42,616 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-07-29 01:28:42,618 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-07-29 01:28:42,619 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-07-29 01:28:42,621 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-07-29 01:28:42,623 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-07-29 01:28:42,625 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-07-29 01:28:42,626 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-07-29 01:28:42,627 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-07-29 01:28:42,628 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-07-29 01:28:42,629 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-07-29 01:28:42,630 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-07-29 01:28:42,631 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-07-29 01:28:42,633 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-07-29 01:28:42,634 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-07-29 01:28:42,635 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-07-29 01:28:42,638 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-07-29 01:28:42,643 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-07-29 01:28:42,644 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-07-29 01:28:42,648 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-07-29 01:28:42,650 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-07-29 01:28:42,655 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-07-29 01:28:42,656 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-07-29 01:28:42,657 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-07-29 01:28:42,658 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-07-29 01:28:42,659 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-07-29 01:28:42,660 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-07-29 01:28:42,661 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-07-29 01:28:42,662 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-07-29 01:28:42,664 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-07-29 01:28:42,665 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-07-29 01:28:42,668 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-07-29 01:28:42,670 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-07-29 01:28:42,671 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-07-29 01:28:42,671 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-07-29 01:28:42,671 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-07-29 01:28:42,672 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-07-29 01:28:42,674 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-07-29 01:28:42,675 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-64bit-Automizer_Default.epf [2020-07-29 01:28:42,715 INFO L113 SettingsManager]: Loading preferences was successful [2020-07-29 01:28:42,716 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-07-29 01:28:42,718 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2020-07-29 01:28:42,719 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2020-07-29 01:28:42,719 INFO L138 SettingsManager]: * Use SBE=true [2020-07-29 01:28:42,720 INFO L136 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2020-07-29 01:28:42,720 INFO L138 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2020-07-29 01:28:42,721 INFO L138 SettingsManager]: * Use old map elimination=false [2020-07-29 01:28:42,721 INFO L138 SettingsManager]: * Use external solver (rank synthesis)=false [2020-07-29 01:28:42,724 INFO L138 SettingsManager]: * Use only trivial implications for array writes=true [2020-07-29 01:28:42,725 INFO L138 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2020-07-29 01:28:42,725 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-07-29 01:28:42,725 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2020-07-29 01:28:42,726 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-07-29 01:28:42,726 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-07-29 01:28:42,726 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2020-07-29 01:28:42,726 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2020-07-29 01:28:42,727 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2020-07-29 01:28:42,727 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-07-29 01:28:42,727 INFO L138 SettingsManager]: * Assume nondeterminstic values are in range=false [2020-07-29 01:28:42,729 INFO L138 SettingsManager]: * Use constant arrays=true [2020-07-29 01:28:42,730 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2020-07-29 01:28:42,730 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-07-29 01:28:42,730 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2020-07-29 01:28:42,730 INFO L138 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2020-07-29 01:28:42,731 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-07-29 01:28:42,731 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2020-07-29 01:28:42,731 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2020-07-29 01:28:42,732 INFO L138 SettingsManager]: * Dump automata to the following directory=/home/matthias/ultimate/dump/auto [2020-07-29 01:28:42,733 INFO L136 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2020-07-29 01:28:42,734 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 -> 64bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 9a661b9ed427d2e9174ef6e6cb1f5d6d0ab8d9e2 [2020-07-29 01:28:43,045 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2020-07-29 01:28:43,058 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-07-29 01:28:43,062 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-07-29 01:28:43,063 INFO L271 PluginConnector]: Initializing CDTParser... [2020-07-29 01:28:43,064 INFO L275 PluginConnector]: CDTParser initialized [2020-07-29 01:28:43,065 INFO L429 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/termination-crafted-lit/CookSeeZuleger-TACAS2013-Fig8a-modified.c [2020-07-29 01:28:43,138 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/01eda2249/96432ae6d13b4df881b853c5b66f0932/FLAG036e63a8f [2020-07-29 01:28:43,621 INFO L306 CDTParser]: Found 1 translation units. [2020-07-29 01:28:43,622 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/termination-crafted-lit/CookSeeZuleger-TACAS2013-Fig8a-modified.c [2020-07-29 01:28:43,629 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/01eda2249/96432ae6d13b4df881b853c5b66f0932/FLAG036e63a8f [2020-07-29 01:28:43,991 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/01eda2249/96432ae6d13b4df881b853c5b66f0932 [2020-07-29 01:28:43,995 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-07-29 01:28:43,997 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2020-07-29 01:28:43,999 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-07-29 01:28:43,999 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-07-29 01:28:44,003 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-07-29 01:28:44,005 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 29.07 01:28:43" (1/1) ... [2020-07-29 01:28:44,008 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@15e9b38a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.07 01:28:44, skipping insertion in model container [2020-07-29 01:28:44,009 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 29.07 01:28:43" (1/1) ... [2020-07-29 01:28:44,017 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-07-29 01:28:44,034 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-07-29 01:28:44,202 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-07-29 01:28:44,207 INFO L203 MainTranslator]: Completed pre-run [2020-07-29 01:28:44,224 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-07-29 01:28:44,239 INFO L208 MainTranslator]: Completed translation [2020-07-29 01:28:44,240 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.07 01:28:44 WrapperNode [2020-07-29 01:28:44,240 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-07-29 01:28:44,240 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2020-07-29 01:28:44,241 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2020-07-29 01:28:44,241 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2020-07-29 01:28:44,250 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.07 01:28:44" (1/1) ... [2020-07-29 01:28:44,256 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.07 01:28:44" (1/1) ... [2020-07-29 01:28:44,276 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2020-07-29 01:28:44,277 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-07-29 01:28:44,277 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-07-29 01:28:44,277 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-07-29 01:28:44,340 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.07 01:28:44" (1/1) ... [2020-07-29 01:28:44,340 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.07 01:28:44" (1/1) ... [2020-07-29 01:28:44,341 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.07 01:28:44" (1/1) ... [2020-07-29 01:28:44,341 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.07 01:28:44" (1/1) ... [2020-07-29 01:28:44,344 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.07 01:28:44" (1/1) ... [2020-07-29 01:28:44,349 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.07 01:28:44" (1/1) ... [2020-07-29 01:28:44,349 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.07 01:28:44" (1/1) ... [2020-07-29 01:28:44,351 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-07-29 01:28:44,351 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-07-29 01:28:44,352 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-07-29 01:28:44,352 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-07-29 01:28:44,353 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.07 01:28:44" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:28:44,420 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-07-29 01:28:44,420 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-07-29 01:28:44,623 INFO L290 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-07-29 01:28:44,623 INFO L295 CfgBuilder]: Removed 5 assume(true) statements. [2020-07-29 01:28:44,626 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.07 01:28:44 BoogieIcfgContainer [2020-07-29 01:28:44,626 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-07-29 01:28:44,627 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2020-07-29 01:28:44,627 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2020-07-29 01:28:44,631 INFO L275 PluginConnector]: BuchiAutomizer initialized [2020-07-29 01:28:44,632 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2020-07-29 01:28:44,632 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 29.07 01:28:43" (1/3) ... [2020-07-29 01:28:44,633 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@68168813 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 29.07 01:28:44, skipping insertion in model container [2020-07-29 01:28:44,633 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2020-07-29 01:28:44,634 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.07 01:28:44" (2/3) ... [2020-07-29 01:28:44,634 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@68168813 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 29.07 01:28:44, skipping insertion in model container [2020-07-29 01:28:44,634 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2020-07-29 01:28:44,634 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.07 01:28:44" (3/3) ... [2020-07-29 01:28:44,636 INFO L371 chiAutomizerObserver]: Analyzing ICFG CookSeeZuleger-TACAS2013-Fig8a-modified.c [2020-07-29 01:28:44,701 INFO L356 BuchiCegarLoop]: Interprodecural is true [2020-07-29 01:28:44,701 INFO L357 BuchiCegarLoop]: Hoare is false [2020-07-29 01:28:44,701 INFO L358 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2020-07-29 01:28:44,701 INFO L359 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2020-07-29 01:28:44,701 INFO L360 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-07-29 01:28:44,702 INFO L361 BuchiCegarLoop]: Difference is false [2020-07-29 01:28:44,702 INFO L362 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-07-29 01:28:44,702 INFO L365 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2020-07-29 01:28:44,720 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 7 states. [2020-07-29 01:28:44,782 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2020-07-29 01:28:44,783 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 01:28:44,783 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 01:28:44,802 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1] [2020-07-29 01:28:44,802 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2020-07-29 01:28:44,802 INFO L424 BuchiCegarLoop]: ======== Iteration 1============ [2020-07-29 01:28:44,805 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 7 states. [2020-07-29 01:28:44,811 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2020-07-29 01:28:44,811 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 01:28:44,811 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 01:28:44,811 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1] [2020-07-29 01:28:44,812 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2020-07-29 01:28:44,825 INFO L794 eck$LassoCheckResult]: Stem: 4#ULTIMATE.startENTRYtrue havoc main_#res;havoc main_#t~nondet0, main_#t~nondet1, main_~K~0, main_~x~0;havoc main_~K~0;havoc main_~x~0;main_~K~0 := main_#t~nondet0;havoc main_#t~nondet0;main_~x~0 := main_#t~nondet1;havoc main_#t~nondet1; 5#L18-2true [2020-07-29 01:28:44,826 INFO L796 eck$LassoCheckResult]: Loop: 5#L18-2true assume !!(main_~x~0 != main_~K~0); 7#L18true assume main_~x~0 > main_~K~0;main_~x~0 := main_~x~0 - 1; 5#L18-2true [2020-07-29 01:28:44,832 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 01:28:44,832 INFO L82 PathProgramCache]: Analyzing trace with hash 32, now seen corresponding path program 1 times [2020-07-29 01:28:44,845 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 01:28:44,846 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [881847595] [2020-07-29 01:28:44,847 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 01:28:44,933 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 01:28:44,934 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 01:28:44,937 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 01:28:44,938 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 01:28:44,955 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-07-29 01:28:44,957 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 01:28:44,958 INFO L82 PathProgramCache]: Analyzing trace with hash 1284, now seen corresponding path program 1 times [2020-07-29 01:28:44,958 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 01:28:44,958 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1584883575] [2020-07-29 01:28:44,959 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 01:28:44,971 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 01:28:44,972 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 01:28:44,976 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 01:28:44,976 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 01:28:44,978 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-07-29 01:28:44,980 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 01:28:44,980 INFO L82 PathProgramCache]: Analyzing trace with hash 31075, now seen corresponding path program 1 times [2020-07-29 01:28:44,981 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 01:28:44,981 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1327188873] [2020-07-29 01:28:44,981 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 01:28:44,988 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 01:28:44,989 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 01:28:44,994 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 01:28:44,994 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 01:28:44,997 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-07-29 01:28:45,155 INFO L210 LassoAnalysis]: Preferences: [2020-07-29 01:28:45,156 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2020-07-29 01:28:45,157 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2020-07-29 01:28:45,157 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2020-07-29 01:28:45,158 INFO L129 ssoRankerPreferences]: Use exernal solver: true [2020-07-29 01:28:45,158 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:28:45,159 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2020-07-29 01:28:45,159 INFO L132 ssoRankerPreferences]: Path of dumped script: [2020-07-29 01:28:45,159 INFO L133 ssoRankerPreferences]: Filename of dumped script: CookSeeZuleger-TACAS2013-Fig8a-modified.c_Iteration1_Loop [2020-07-29 01:28:45,160 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2020-07-29 01:28:45,160 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2020-07-29 01:28:45,222 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 01:28:45,246 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 01:28:45,257 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 01:28:45,427 INFO L292 LassoAnalysis]: Preprocessing complete. [2020-07-29 01:28:45,428 INFO L404 LassoAnalysis]: Checking for nontermination... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:28:45,436 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2020-07-29 01:28:45,436 INFO L160 nArgumentSynthesizer]: Using integer mode. [2020-07-29 01:28:45,447 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2020-07-29 01:28:45,448 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {v_rep~unnamed0~0~false_1=0} Honda state: {v_rep~unnamed0~0~false_1=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2020-07-29 01:28:45,484 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2020-07-29 01:28:45,484 INFO L160 nArgumentSynthesizer]: Using integer mode. Waiting until toolchain timeout for monitored process 3 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:28:45,489 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2020-07-29 01:28:45,489 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {v_rep~unnamed0~0~true_1=1} Honda state: {v_rep~unnamed0~0~true_1=1} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /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-07-29 01:28:45,518 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2020-07-29 01:28:45,518 INFO L160 nArgumentSynthesizer]: Using integer mode. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:28:45,550 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2020-07-29 01:28:45,551 INFO L160 nArgumentSynthesizer]: Using integer mode. [2020-07-29 01:28:45,757 INFO L444 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2020-07-29 01:28:45,759 INFO L210 LassoAnalysis]: Preferences: [2020-07-29 01:28:45,759 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2020-07-29 01:28:45,759 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2020-07-29 01:28:45,760 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2020-07-29 01:28:45,760 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2020-07-29 01:28:45,760 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:28:45,760 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2020-07-29 01:28:45,760 INFO L132 ssoRankerPreferences]: Path of dumped script: [2020-07-29 01:28:45,761 INFO L133 ssoRankerPreferences]: Filename of dumped script: CookSeeZuleger-TACAS2013-Fig8a-modified.c_Iteration1_Loop [2020-07-29 01:28:45,761 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2020-07-29 01:28:45,762 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2020-07-29 01:28:45,781 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 01:28:45,796 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 01:28:45,804 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 01:28:45,938 INFO L292 LassoAnalysis]: Preprocessing complete. [2020-07-29 01:28:45,945 INFO L489 LassoAnalysis]: Using template 'affine'. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 6 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:28:45,957 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-07-29 01:28:45,960 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 01:28:45,961 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-07-29 01:28:45,962 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 01:28:45,962 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 01:28:45,962 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 01:28:45,966 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-07-29 01:28:45,966 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-07-29 01:28:45,969 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2020-07-29 01:28:45,976 INFO L443 ModelExtractionUtils]: Simplification made 4 calls to the SMT solver. [2020-07-29 01:28:45,976 INFO L444 ModelExtractionUtils]: 0 out of 4 variables were initially zero. Simplification set additionally 1 variables to zero. 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-07-29 01:28:45,984 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2020-07-29 01:28:45,984 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. Waiting until toolchain timeout for monitored process 7 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:28:45,986 INFO L510 LassoAnalysis]: Proved termination. [2020-07-29 01:28:45,986 INFO L512 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~x~0, ULTIMATE.start_main_~K~0) = 1*ULTIMATE.start_main_~x~0 - 1*ULTIMATE.start_main_~K~0 Supporting invariants [] [2020-07-29 01:28:46,032 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2020-07-29 01:28:46,055 INFO L393 LassoCheck]: Loop: "assume !!(main_~x~0 != main_~K~0);" "assume main_~x~0 > main_~K~0;main_~x~0 := main_~x~0 - 1;" [2020-07-29 01:28:46,060 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:28:46,100 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 01:28:46,109 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:28:46,112 INFO L263 TraceCheckSpWp]: Trace formula consists of 6 conjuncts, 2 conjunts are in the unsatisfiable core [2020-07-29 01:28:46,118 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:28:46,119 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-29 01:28:46,129 INFO L280 TraceCheckUtils]: 0: Hoare triple {17#unseeded} havoc main_#res;havoc main_#t~nondet0, main_#t~nondet1, main_~K~0, main_~x~0;havoc main_~K~0;havoc main_~x~0;main_~K~0 := main_#t~nondet0;havoc main_#t~nondet0;main_~x~0 := main_#t~nondet1;havoc main_#t~nondet1; {17#unseeded} is VALID [2020-07-29 01:28:46,135 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:28:46,136 WARN L261 TraceCheckSpWp]: Trace formula consists of 6 conjuncts, 4 conjunts are in the unsatisfiable core [2020-07-29 01:28:46,140 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:28:46,141 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-29 01:28:46,147 INFO L280 TraceCheckUtils]: 0: Hoare triple {20#(>= oldRank0 (+ ULTIMATE.start_main_~x~0 (* (- 1) ULTIMATE.start_main_~K~0)))} assume !!(main_~x~0 != main_~K~0); {20#(>= oldRank0 (+ ULTIMATE.start_main_~x~0 (* (- 1) ULTIMATE.start_main_~K~0)))} is VALID [2020-07-29 01:28:46,148 INFO L280 TraceCheckUtils]: 1: Hoare triple {20#(>= oldRank0 (+ ULTIMATE.start_main_~x~0 (* (- 1) ULTIMATE.start_main_~K~0)))} assume main_~x~0 > main_~K~0;main_~x~0 := main_~x~0 - 1; {30#(or (and (> oldRank0 (+ ULTIMATE.start_main_~x~0 (* (- 1) ULTIMATE.start_main_~K~0))) (>= oldRank0 0)) unseeded)} is VALID [2020-07-29 01:28:46,149 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-29 01:28:46,159 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2020-07-29 01:28:46,167 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 3 edges. 3 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-29 01:28:46,169 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 1 letters. Loop has 2 letters. [2020-07-29 01:28:46,173 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:46,179 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 1 loop predicates [2020-07-29 01:28:46,180 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 7 states. Second operand 3 states. [2020-07-29 01:28:46,261 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 7 states.. Second operand 3 states. Result 23 states and 30 transitions. Complement of second has 6 states. [2020-07-29 01:28:46,261 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 1 stem states 1 non-accepting loop states 1 accepting loop states [2020-07-29 01:28:46,261 INFO L123 tractBuchiDifference]: Start testing correctness of buchiDifferenceNCSBLazy3 [2020-07-29 01:28:46,262 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 7 states. [2020-07-29 01:28:46,263 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2020-07-29 01:28:46,264 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 01:28:46,264 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 01:28:46,264 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 3 states. [2020-07-29 01:28:46,268 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 3 [2020-07-29 01:28:46,268 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 01:28:46,268 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 01:28:46,269 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 23 states and 30 transitions. [2020-07-29 01:28:46,270 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2020-07-29 01:28:46,270 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 01:28:46,271 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 01:28:46,272 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 7 states. [2020-07-29 01:28:46,274 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2020-07-29 01:28:46,274 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 2 examples of accepted words. [2020-07-29 01:28:46,275 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 3 states. [2020-07-29 01:28:46,276 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 3 [2020-07-29 01:28:46,277 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 2 examples of accepted words. [2020-07-29 01:28:46,277 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 23 states and 30 transitions. cyclomatic complexity: 9 [2020-07-29 01:28:46,277 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 2 examples of accepted words. [2020-07-29 01:28:46,278 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states. Stem has 1 letters. Loop has 2 letters. [2020-07-29 01:28:46,278 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:46,278 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 1 letters. Loop has 2 letters. [2020-07-29 01:28:46,278 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:46,278 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 23 states and 30 transitions. cyclomatic complexity: 9 Stem has 1 letters. Loop has 2 letters. [2020-07-29 01:28:46,279 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:46,279 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states. Stem has 1 letters. Loop has 2 letters. [2020-07-29 01:28:46,279 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:46,279 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 1 letters. Loop has 2 letters. [2020-07-29 01:28:46,280 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:46,280 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 23 states and 30 transitions. cyclomatic complexity: 9 Stem has 1 letters. Loop has 2 letters. [2020-07-29 01:28:46,280 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:46,280 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states. Stem has 3 letters. Loop has 2 letters. [2020-07-29 01:28:46,281 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:46,281 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 3 letters. Loop has 2 letters. [2020-07-29 01:28:46,281 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:46,281 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 23 states and 30 transitions. cyclomatic complexity: 9 Stem has 3 letters. Loop has 2 letters. [2020-07-29 01:28:46,281 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:46,281 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states. Stem has 23 letters. Loop has 23 letters. [2020-07-29 01:28:46,282 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:46,282 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 23 letters. Loop has 23 letters. [2020-07-29 01:28:46,282 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:46,282 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 23 states and 30 transitions. cyclomatic complexity: 9 Stem has 23 letters. Loop has 23 letters. [2020-07-29 01:28:46,283 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:46,283 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states. Stem has 7 letters. Loop has 7 letters. [2020-07-29 01:28:46,283 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:46,283 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 7 letters. Loop has 7 letters. [2020-07-29 01:28:46,283 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:46,283 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 23 states and 30 transitions. cyclomatic complexity: 9 Stem has 7 letters. Loop has 7 letters. [2020-07-29 01:28:46,284 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:46,284 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states. Stem has 4 letters. Loop has 4 letters. [2020-07-29 01:28:46,284 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:46,284 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 4 letters. Loop has 4 letters. [2020-07-29 01:28:46,284 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:46,285 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 23 states and 30 transitions. cyclomatic complexity: 9 Stem has 4 letters. Loop has 4 letters. [2020-07-29 01:28:46,285 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:46,285 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states. Stem has 1 letters. Loop has 2 letters. [2020-07-29 01:28:46,285 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:46,285 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 1 letters. Loop has 2 letters. [2020-07-29 01:28:46,286 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:46,286 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 23 states and 30 transitions. cyclomatic complexity: 9 Stem has 1 letters. Loop has 2 letters. [2020-07-29 01:28:46,287 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:46,287 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states. Stem has 2 letters. Loop has 2 letters. [2020-07-29 01:28:46,287 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:46,287 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 2 letters. Loop has 2 letters. [2020-07-29 01:28:46,287 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:46,288 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 23 states and 30 transitions. cyclomatic complexity: 9 Stem has 2 letters. Loop has 2 letters. [2020-07-29 01:28:46,291 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:46,291 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states. Stem has 2 letters. Loop has 1 letters. [2020-07-29 01:28:46,292 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:46,292 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 2 letters. Loop has 1 letters. [2020-07-29 01:28:46,292 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:46,292 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 23 states and 30 transitions. cyclomatic complexity: 9 Stem has 2 letters. Loop has 1 letters. [2020-07-29 01:28:46,293 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:46,293 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states. Stem has 1 letters. Loop has 2 letters. [2020-07-29 01:28:46,293 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:46,296 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 1 letters. Loop has 2 letters. [2020-07-29 01:28:46,296 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:46,299 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 23 states and 30 transitions. cyclomatic complexity: 9 Stem has 1 letters. Loop has 2 letters. [2020-07-29 01:28:46,300 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:46,300 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states. Stem has 3 letters. Loop has 2 letters. [2020-07-29 01:28:46,300 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:46,301 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 3 letters. Loop has 2 letters. [2020-07-29 01:28:46,301 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:46,301 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 23 states and 30 transitions. cyclomatic complexity: 9 Stem has 3 letters. Loop has 2 letters. [2020-07-29 01:28:46,301 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:46,302 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states. Stem has 4 letters. Loop has 2 letters. [2020-07-29 01:28:46,303 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:46,303 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 4 letters. Loop has 2 letters. [2020-07-29 01:28:46,304 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:46,304 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 23 states and 30 transitions. cyclomatic complexity: 9 Stem has 4 letters. Loop has 2 letters. [2020-07-29 01:28:46,304 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:46,304 INFO L161 tractBuchiDifference]: Finished testing correctness of buchiDifferenceNCSBLazy3 [2020-07-29 01:28:46,307 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-07-29 01:28:46,308 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 11 transitions. [2020-07-29 01:28:46,310 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 11 transitions. Stem has 1 letters. Loop has 2 letters. [2020-07-29 01:28:46,311 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:46,311 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 11 transitions. Stem has 3 letters. Loop has 2 letters. [2020-07-29 01:28:46,311 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:46,312 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 11 transitions. Stem has 1 letters. Loop has 4 letters. [2020-07-29 01:28:46,312 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:46,313 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 23 states and 30 transitions. cyclomatic complexity: 9 [2020-07-29 01:28:46,323 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2020-07-29 01:28:46,331 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 23 states to 7 states and 10 transitions. [2020-07-29 01:28:46,332 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 4 [2020-07-29 01:28:46,333 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 5 [2020-07-29 01:28:46,333 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 10 transitions. [2020-07-29 01:28:46,333 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2020-07-29 01:28:46,334 INFO L688 BuchiCegarLoop]: Abstraction has 7 states and 10 transitions. [2020-07-29 01:28:46,351 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7 states and 10 transitions. [2020-07-29 01:28:46,359 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7 to 7. [2020-07-29 01:28:46,359 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-29 01:28:46,360 INFO L82 GeneralOperation]: Start isEquivalent. First operand 7 states and 10 transitions. Second operand 7 states. [2020-07-29 01:28:46,361 INFO L74 IsIncluded]: Start isIncluded. First operand 7 states and 10 transitions. Second operand 7 states. [2020-07-29 01:28:46,363 INFO L87 Difference]: Start difference. First operand 7 states and 10 transitions. Second operand 7 states. [2020-07-29 01:28:46,367 INFO L149 Difference]: Subtrahend was not deterministic. Recomputing result with determinization. [2020-07-29 01:28:46,370 INFO L93 Difference]: Finished difference Result 7 states and 10 transitions. [2020-07-29 01:28:46,371 INFO L276 IsEmpty]: Start isEmpty. Operand 7 states and 10 transitions. [2020-07-29 01:28:46,372 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-29 01:28:46,372 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-29 01:28:46,372 INFO L74 IsIncluded]: Start isIncluded. First operand 7 states. Second operand 7 states and 10 transitions. [2020-07-29 01:28:46,372 INFO L87 Difference]: Start difference. First operand 7 states. Second operand 7 states and 10 transitions. [2020-07-29 01:28:46,373 INFO L149 Difference]: Subtrahend was not deterministic. Recomputing result with determinization. [2020-07-29 01:28:46,374 INFO L93 Difference]: Finished difference Result 7 states and 10 transitions. [2020-07-29 01:28:46,374 INFO L276 IsEmpty]: Start isEmpty. Operand 7 states and 10 transitions. [2020-07-29 01:28:46,375 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-29 01:28:46,375 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-29 01:28:46,375 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-29 01:28:46,375 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-29 01:28:46,375 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2020-07-29 01:28:46,376 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 10 transitions. [2020-07-29 01:28:46,378 INFO L711 BuchiCegarLoop]: Abstraction has 7 states and 10 transitions. [2020-07-29 01:28:46,378 INFO L591 BuchiCegarLoop]: Abstraction has 7 states and 10 transitions. [2020-07-29 01:28:46,378 INFO L424 BuchiCegarLoop]: ======== Iteration 2============ [2020-07-29 01:28:46,378 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 7 states and 10 transitions. [2020-07-29 01:28:46,379 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2020-07-29 01:28:46,379 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 01:28:46,379 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 01:28:46,379 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1] [2020-07-29 01:28:46,379 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2020-07-29 01:28:46,380 INFO L794 eck$LassoCheckResult]: Stem: 69#ULTIMATE.startENTRY havoc main_#res;havoc main_#t~nondet0, main_#t~nondet1, main_~K~0, main_~x~0;havoc main_~K~0;havoc main_~x~0;main_~K~0 := main_#t~nondet0;havoc main_#t~nondet0;main_~x~0 := main_#t~nondet1;havoc main_#t~nondet1; 70#L18-2 assume !!(main_~x~0 != main_~K~0); 75#L18 assume !(main_~x~0 > main_~K~0);main_~x~0 := 1 + main_~x~0; 71#L18-2 [2020-07-29 01:28:46,380 INFO L796 eck$LassoCheckResult]: Loop: 71#L18-2 assume !!(main_~x~0 != main_~K~0); 72#L18 assume main_~x~0 > main_~K~0;main_~x~0 := main_~x~0 - 1; 71#L18-2 [2020-07-29 01:28:46,380 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 01:28:46,380 INFO L82 PathProgramCache]: Analyzing trace with hash 31077, now seen corresponding path program 1 times [2020-07-29 01:28:46,381 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 01:28:46,381 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1632559947] [2020-07-29 01:28:46,381 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 01:28:46,387 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 01:28:46,387 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 01:28:46,391 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 01:28:46,392 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 01:28:46,393 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-07-29 01:28:46,394 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 01:28:46,394 INFO L82 PathProgramCache]: Analyzing trace with hash 1284, now seen corresponding path program 2 times [2020-07-29 01:28:46,394 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 01:28:46,395 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [405111271] [2020-07-29 01:28:46,395 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 01:28:46,399 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 01:28:46,400 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 01:28:46,403 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 01:28:46,403 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 01:28:46,405 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-07-29 01:28:46,405 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 01:28:46,405 INFO L82 PathProgramCache]: Analyzing trace with hash 29865320, now seen corresponding path program 1 times [2020-07-29 01:28:46,406 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 01:28:46,406 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1716247972] [2020-07-29 01:28:46,406 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 01:28:46,416 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:28:46,469 INFO L280 TraceCheckUtils]: 0: Hoare triple {117#true} havoc main_#res;havoc main_#t~nondet0, main_#t~nondet1, main_~K~0, main_~x~0;havoc main_~K~0;havoc main_~x~0;main_~K~0 := main_#t~nondet0;havoc main_#t~nondet0;main_~x~0 := main_#t~nondet1;havoc main_#t~nondet1; {117#true} is VALID [2020-07-29 01:28:46,470 INFO L280 TraceCheckUtils]: 1: Hoare triple {117#true} assume !!(main_~x~0 != main_~K~0); {119#(not (= ULTIMATE.start_main_~K~0 ULTIMATE.start_main_~x~0))} is VALID [2020-07-29 01:28:46,476 INFO L280 TraceCheckUtils]: 2: Hoare triple {119#(not (= ULTIMATE.start_main_~K~0 ULTIMATE.start_main_~x~0))} assume !(main_~x~0 > main_~K~0);main_~x~0 := 1 + main_~x~0; {120#(<= ULTIMATE.start_main_~x~0 ULTIMATE.start_main_~K~0)} is VALID [2020-07-29 01:28:46,479 INFO L280 TraceCheckUtils]: 3: Hoare triple {120#(<= ULTIMATE.start_main_~x~0 ULTIMATE.start_main_~K~0)} assume !!(main_~x~0 != main_~K~0); {120#(<= ULTIMATE.start_main_~x~0 ULTIMATE.start_main_~K~0)} is VALID [2020-07-29 01:28:46,480 INFO L280 TraceCheckUtils]: 4: Hoare triple {120#(<= ULTIMATE.start_main_~x~0 ULTIMATE.start_main_~K~0)} assume main_~x~0 > main_~K~0;main_~x~0 := main_~x~0 - 1; {118#false} is VALID [2020-07-29 01:28:46,482 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-29 01:28:46,482 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1716247972] [2020-07-29 01:28:46,483 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1803794101] [2020-07-29 01:28:46,483 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-07-29 01:28:46,521 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:28:46,523 INFO L263 TraceCheckSpWp]: Trace formula consists of 14 conjuncts, 4 conjunts are in the unsatisfiable core [2020-07-29 01:28:46,526 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:28:46,527 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-29 01:28:46,626 INFO L280 TraceCheckUtils]: 0: Hoare triple {117#true} havoc main_#res;havoc main_#t~nondet0, main_#t~nondet1, main_~K~0, main_~x~0;havoc main_~K~0;havoc main_~x~0;main_~K~0 := main_#t~nondet0;havoc main_#t~nondet0;main_~x~0 := main_#t~nondet1;havoc main_#t~nondet1; {117#true} is VALID [2020-07-29 01:28:46,627 INFO L280 TraceCheckUtils]: 1: Hoare triple {117#true} assume !!(main_~x~0 != main_~K~0); {119#(not (= ULTIMATE.start_main_~K~0 ULTIMATE.start_main_~x~0))} is VALID [2020-07-29 01:28:46,628 INFO L280 TraceCheckUtils]: 2: Hoare triple {119#(not (= ULTIMATE.start_main_~K~0 ULTIMATE.start_main_~x~0))} assume !(main_~x~0 > main_~K~0);main_~x~0 := 1 + main_~x~0; {120#(<= ULTIMATE.start_main_~x~0 ULTIMATE.start_main_~K~0)} is VALID [2020-07-29 01:28:46,629 INFO L280 TraceCheckUtils]: 3: Hoare triple {120#(<= ULTIMATE.start_main_~x~0 ULTIMATE.start_main_~K~0)} assume !!(main_~x~0 != main_~K~0); {120#(<= ULTIMATE.start_main_~x~0 ULTIMATE.start_main_~K~0)} is VALID [2020-07-29 01:28:46,630 INFO L280 TraceCheckUtils]: 4: Hoare triple {120#(<= ULTIMATE.start_main_~x~0 ULTIMATE.start_main_~K~0)} assume main_~x~0 > main_~K~0;main_~x~0 := main_~x~0 - 1; {118#false} is VALID [2020-07-29 01:28:46,631 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-29 01:28:46,631 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-07-29 01:28:46,631 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3] total 3 [2020-07-29 01:28:46,632 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [918946306] [2020-07-29 01:28:46,658 INFO L210 LassoAnalysis]: Preferences: [2020-07-29 01:28:46,658 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2020-07-29 01:28:46,658 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2020-07-29 01:28:46,658 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2020-07-29 01:28:46,659 INFO L129 ssoRankerPreferences]: Use exernal solver: true [2020-07-29 01:28:46,659 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:28:46,659 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2020-07-29 01:28:46,659 INFO L132 ssoRankerPreferences]: Path of dumped script: [2020-07-29 01:28:46,659 INFO L133 ssoRankerPreferences]: Filename of dumped script: CookSeeZuleger-TACAS2013-Fig8a-modified.c_Iteration2_Loop [2020-07-29 01:28:46,659 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2020-07-29 01:28:46,659 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2020-07-29 01:28:46,667 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 01:28:46,673 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 01:28:46,683 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 01:28:46,779 INFO L292 LassoAnalysis]: Preprocessing complete. [2020-07-29 01:28:46,779 INFO L404 LassoAnalysis]: Checking for nontermination... 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-07-29 01:28:46,792 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2020-07-29 01:28:46,792 INFO L160 nArgumentSynthesizer]: Using integer mode. Waiting until toolchain timeout for monitored process 9 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:28:46,797 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2020-07-29 01:28:46,797 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {v_rep~unnamed0~0~false_3=0} Honda state: {v_rep~unnamed0~0~false_3=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /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-07-29 01:28:46,838 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2020-07-29 01:28:46,839 INFO L160 nArgumentSynthesizer]: Using integer mode. [2020-07-29 01:28:46,843 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2020-07-29 01:28:46,844 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {v_rep~unnamed0~0~true_3=1} Honda state: {v_rep~unnamed0~0~true_3=1} Generalized eigenvectors: [] Lambdas: [] Nus: [] 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-07-29 01:28:46,892 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2020-07-29 01:28:46,893 INFO L160 nArgumentSynthesizer]: Using integer mode. Waiting until toolchain timeout for monitored process 11 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 12 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2020-07-29 01:28:46,944 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2020-07-29 01:28:46,945 INFO L160 nArgumentSynthesizer]: Using integer mode. Waiting until toolchain timeout for monitored process 12 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:28:47,153 INFO L444 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2020-07-29 01:28:47,156 INFO L210 LassoAnalysis]: Preferences: [2020-07-29 01:28:47,156 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2020-07-29 01:28:47,156 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2020-07-29 01:28:47,156 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2020-07-29 01:28:47,157 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2020-07-29 01:28:47,157 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:28:47,157 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2020-07-29 01:28:47,157 INFO L132 ssoRankerPreferences]: Path of dumped script: [2020-07-29 01:28:47,157 INFO L133 ssoRankerPreferences]: Filename of dumped script: CookSeeZuleger-TACAS2013-Fig8a-modified.c_Iteration2_Loop [2020-07-29 01:28:47,157 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2020-07-29 01:28:47,157 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2020-07-29 01:28:47,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-07-29 01:28:47,170 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 01:28:47,175 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 01:28:47,272 INFO L292 LassoAnalysis]: Preprocessing complete. [2020-07-29 01:28:47,272 INFO L489 LassoAnalysis]: Using template 'affine'. 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) [2020-07-29 01:28:47,282 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-07-29 01:28:47,284 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 01:28:47,285 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 01:28:47,285 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 01:28:47,285 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 01:28:47,289 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-07-29 01:28:47,289 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. Waiting until toolchain timeout for monitored process 13 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:28:47,296 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-07-29 01:28:47,346 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-07-29 01:28:47,348 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 01:28:47,348 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 01:28:47,348 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 01:28:47,349 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 01:28:47,352 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-07-29 01:28:47,352 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-07-29 01:28:47,357 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-07-29 01:28:47,406 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-07-29 01:28:47,408 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 01:28:47,408 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-07-29 01:28:47,408 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 01:28:47,409 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 01:28:47,409 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 01:28:47,410 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-07-29 01:28:47,411 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. Waiting until toolchain timeout for monitored process 15 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:28:47,414 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2020-07-29 01:28:47,419 INFO L443 ModelExtractionUtils]: Simplification made 4 calls to the SMT solver. [2020-07-29 01:28:47,419 INFO L444 ModelExtractionUtils]: 0 out of 4 variables were initially zero. Simplification set additionally 1 variables to zero. 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-07-29 01:28:47,431 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2020-07-29 01:28:47,432 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2020-07-29 01:28:47,432 INFO L510 LassoAnalysis]: Proved termination. [2020-07-29 01:28:47,432 INFO L512 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~x~0, ULTIMATE.start_main_~K~0) = 1*ULTIMATE.start_main_~x~0 - 1*ULTIMATE.start_main_~K~0 Supporting invariants [] Waiting until toolchain timeout for monitored process 16 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:28:47,477 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2020-07-29 01:28:47,480 INFO L393 LassoCheck]: Loop: "assume !!(main_~x~0 != main_~K~0);" "assume main_~x~0 > main_~K~0;main_~x~0 := main_~x~0 - 1;" [2020-07-29 01:28:47,483 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:28:47,497 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 01:28:47,501 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:28:47,502 INFO L263 TraceCheckSpWp]: Trace formula consists of 10 conjuncts, 2 conjunts are in the unsatisfiable core [2020-07-29 01:28:47,504 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:28:47,505 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-29 01:28:47,507 INFO L280 TraceCheckUtils]: 0: Hoare triple {133#unseeded} havoc main_#res;havoc main_#t~nondet0, main_#t~nondet1, main_~K~0, main_~x~0;havoc main_~K~0;havoc main_~x~0;main_~K~0 := main_#t~nondet0;havoc main_#t~nondet0;main_~x~0 := main_#t~nondet1;havoc main_#t~nondet1; {133#unseeded} is VALID [2020-07-29 01:28:47,508 INFO L280 TraceCheckUtils]: 1: Hoare triple {133#unseeded} assume !!(main_~x~0 != main_~K~0); {133#unseeded} is VALID [2020-07-29 01:28:47,509 INFO L280 TraceCheckUtils]: 2: Hoare triple {133#unseeded} assume !(main_~x~0 > main_~K~0);main_~x~0 := 1 + main_~x~0; {133#unseeded} is VALID [2020-07-29 01:28:47,512 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:28:47,512 WARN L261 TraceCheckSpWp]: Trace formula consists of 6 conjuncts, 4 conjunts are in the unsatisfiable core [2020-07-29 01:28:47,515 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:28:47,516 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-29 01:28:47,519 INFO L280 TraceCheckUtils]: 0: Hoare triple {136#(>= oldRank0 (+ ULTIMATE.start_main_~x~0 (* (- 1) ULTIMATE.start_main_~K~0)))} assume !!(main_~x~0 != main_~K~0); {136#(>= oldRank0 (+ ULTIMATE.start_main_~x~0 (* (- 1) ULTIMATE.start_main_~K~0)))} is VALID [2020-07-29 01:28:47,520 INFO L280 TraceCheckUtils]: 1: Hoare triple {136#(>= oldRank0 (+ ULTIMATE.start_main_~x~0 (* (- 1) ULTIMATE.start_main_~K~0)))} assume main_~x~0 > main_~K~0;main_~x~0 := main_~x~0 - 1; {146#(or (and (> oldRank0 (+ ULTIMATE.start_main_~x~0 (* (- 1) ULTIMATE.start_main_~K~0))) (>= oldRank0 0)) unseeded)} is VALID [2020-07-29 01:28:47,520 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-29 01:28:47,521 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2020-07-29 01:28:47,525 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 5 edges. 5 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-29 01:28:47,526 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 3 letters. Loop has 2 letters. [2020-07-29 01:28:47,526 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:47,526 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 1 loop predicates [2020-07-29 01:28:47,526 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 7 states and 10 transitions. cyclomatic complexity: 5 Second operand 3 states. [2020-07-29 01:28:47,549 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 7 states and 10 transitions. cyclomatic complexity: 5. Second operand 3 states. Result 11 states and 16 transitions. Complement of second has 5 states. [2020-07-29 01:28:47,550 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 3 states 1 stem states 1 non-accepting loop states 1 accepting loop states [2020-07-29 01:28:47,550 INFO L123 tractBuchiDifference]: Start testing correctness of buchiDifferenceNCSBLazy3 [2020-07-29 01:28:47,550 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 7 states and 10 transitions. cyclomatic complexity: 5 [2020-07-29 01:28:47,550 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 01:28:47,550 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 01:28:47,550 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 3 states. [2020-07-29 01:28:47,551 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2020-07-29 01:28:47,551 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 01:28:47,551 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 01:28:47,552 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 11 states and 16 transitions. [2020-07-29 01:28:47,553 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2020-07-29 01:28:47,553 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 01:28:47,553 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 01:28:47,553 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 7 states and 10 transitions. cyclomatic complexity: 5 [2020-07-29 01:28:47,554 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 2 examples of accepted words. [2020-07-29 01:28:47,554 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 3 states. [2020-07-29 01:28:47,555 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2020-07-29 01:28:47,555 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 1 examples of accepted words. [2020-07-29 01:28:47,555 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 11 states and 16 transitions. cyclomatic complexity: 8 [2020-07-29 01:28:47,556 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 2 examples of accepted words. [2020-07-29 01:28:47,556 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 10 transitions. cyclomatic complexity: 5 Stem has 3 letters. Loop has 2 letters. [2020-07-29 01:28:47,556 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:47,556 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 3 letters. Loop has 2 letters. [2020-07-29 01:28:47,557 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:47,557 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 11 states and 16 transitions. cyclomatic complexity: 8 Stem has 3 letters. Loop has 2 letters. [2020-07-29 01:28:47,557 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:47,557 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 10 transitions. cyclomatic complexity: 5 Stem has 1 letters. Loop has 2 letters. [2020-07-29 01:28:47,558 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:47,558 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 1 letters. Loop has 2 letters. [2020-07-29 01:28:47,558 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:47,558 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 11 states and 16 transitions. cyclomatic complexity: 8 Stem has 1 letters. Loop has 2 letters. [2020-07-29 01:28:47,558 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:47,559 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 10 transitions. cyclomatic complexity: 5 Stem has 5 letters. Loop has 2 letters. [2020-07-29 01:28:47,559 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:47,559 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 5 letters. Loop has 2 letters. [2020-07-29 01:28:47,559 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:47,560 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 11 states and 16 transitions. cyclomatic complexity: 8 Stem has 5 letters. Loop has 2 letters. [2020-07-29 01:28:47,560 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:47,560 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 10 transitions. cyclomatic complexity: 5 Stem has 11 letters. Loop has 11 letters. [2020-07-29 01:28:47,560 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:47,560 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 11 letters. Loop has 11 letters. [2020-07-29 01:28:47,561 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:47,561 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 11 states and 16 transitions. cyclomatic complexity: 8 Stem has 11 letters. Loop has 11 letters. [2020-07-29 01:28:47,561 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:47,561 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 10 transitions. cyclomatic complexity: 5 Stem has 7 letters. Loop has 7 letters. [2020-07-29 01:28:47,561 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:47,561 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 7 letters. Loop has 7 letters. [2020-07-29 01:28:47,562 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:47,562 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 11 states and 16 transitions. cyclomatic complexity: 8 Stem has 7 letters. Loop has 7 letters. [2020-07-29 01:28:47,562 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:47,562 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 10 transitions. cyclomatic complexity: 5 Stem has 3 letters. Loop has 3 letters. [2020-07-29 01:28:47,562 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:47,563 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 3 letters. Loop has 3 letters. [2020-07-29 01:28:47,563 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:47,563 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 11 states and 16 transitions. cyclomatic complexity: 8 Stem has 3 letters. Loop has 3 letters. [2020-07-29 01:28:47,563 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:47,564 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 10 transitions. cyclomatic complexity: 5 Stem has 3 letters. Loop has 2 letters. [2020-07-29 01:28:47,564 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:47,564 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 3 letters. Loop has 2 letters. [2020-07-29 01:28:47,564 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:47,564 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 11 states and 16 transitions. cyclomatic complexity: 8 Stem has 3 letters. Loop has 2 letters. [2020-07-29 01:28:47,565 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:47,565 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 10 transitions. cyclomatic complexity: 5 Stem has 4 letters. Loop has 2 letters. [2020-07-29 01:28:47,565 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:47,565 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 4 letters. Loop has 2 letters. [2020-07-29 01:28:47,566 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:47,566 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 11 states and 16 transitions. cyclomatic complexity: 8 Stem has 4 letters. Loop has 2 letters. [2020-07-29 01:28:47,566 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:47,566 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 10 transitions. cyclomatic complexity: 5 Stem has 1 letters. Loop has 2 letters. [2020-07-29 01:28:47,566 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:47,567 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 1 letters. Loop has 2 letters. [2020-07-29 01:28:47,567 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:47,567 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 11 states and 16 transitions. cyclomatic complexity: 8 Stem has 1 letters. Loop has 2 letters. [2020-07-29 01:28:47,567 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:47,567 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 10 transitions. cyclomatic complexity: 5 Stem has 5 letters. Loop has 2 letters. [2020-07-29 01:28:47,568 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:47,568 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 5 letters. Loop has 2 letters. [2020-07-29 01:28:47,568 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:47,568 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 11 states and 16 transitions. cyclomatic complexity: 8 Stem has 5 letters. Loop has 2 letters. [2020-07-29 01:28:47,569 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:47,569 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 10 transitions. cyclomatic complexity: 5 Stem has 6 letters. Loop has 2 letters. [2020-07-29 01:28:47,569 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:47,569 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 6 letters. Loop has 2 letters. [2020-07-29 01:28:47,569 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:47,569 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 11 states and 16 transitions. cyclomatic complexity: 8 Stem has 6 letters. Loop has 2 letters. [2020-07-29 01:28:47,570 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:47,570 INFO L161 tractBuchiDifference]: Finished testing correctness of buchiDifferenceNCSBLazy3 [2020-07-29 01:28:47,571 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-07-29 01:28:47,571 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 6 transitions. [2020-07-29 01:28:47,572 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 6 transitions. Stem has 3 letters. Loop has 2 letters. [2020-07-29 01:28:47,572 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:47,572 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 6 transitions. Stem has 5 letters. Loop has 2 letters. [2020-07-29 01:28:47,572 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:47,573 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 6 transitions. Stem has 3 letters. Loop has 4 letters. [2020-07-29 01:28:47,573 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:47,573 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 11 states and 16 transitions. cyclomatic complexity: 8 [2020-07-29 01:28:47,575 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2020-07-29 01:28:47,576 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 11 states to 11 states and 16 transitions. [2020-07-29 01:28:47,576 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 6 [2020-07-29 01:28:47,576 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 7 [2020-07-29 01:28:47,576 INFO L73 IsDeterministic]: Start isDeterministic. Operand 11 states and 16 transitions. [2020-07-29 01:28:47,577 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2020-07-29 01:28:47,577 INFO L688 BuchiCegarLoop]: Abstraction has 11 states and 16 transitions. [2020-07-29 01:28:47,577 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11 states and 16 transitions. [2020-07-29 01:28:47,578 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11 to 11. [2020-07-29 01:28:47,578 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-29 01:28:47,579 INFO L82 GeneralOperation]: Start isEquivalent. First operand 11 states and 16 transitions. Second operand 11 states. [2020-07-29 01:28:47,579 INFO L74 IsIncluded]: Start isIncluded. First operand 11 states and 16 transitions. Second operand 11 states. [2020-07-29 01:28:47,579 INFO L87 Difference]: Start difference. First operand 11 states and 16 transitions. Second operand 11 states. [2020-07-29 01:28:47,579 INFO L149 Difference]: Subtrahend was not deterministic. Recomputing result with determinization. [2020-07-29 01:28:47,581 INFO L93 Difference]: Finished difference Result 11 states and 16 transitions. [2020-07-29 01:28:47,581 INFO L276 IsEmpty]: Start isEmpty. Operand 11 states and 16 transitions. [2020-07-29 01:28:47,582 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-29 01:28:47,582 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-29 01:28:47,582 INFO L74 IsIncluded]: Start isIncluded. First operand 11 states. Second operand 11 states and 16 transitions. [2020-07-29 01:28:47,582 INFO L87 Difference]: Start difference. First operand 11 states. Second operand 11 states and 16 transitions. [2020-07-29 01:28:47,583 INFO L149 Difference]: Subtrahend was not deterministic. Recomputing result with determinization. [2020-07-29 01:28:47,584 INFO L93 Difference]: Finished difference Result 11 states and 16 transitions. [2020-07-29 01:28:47,585 INFO L276 IsEmpty]: Start isEmpty. Operand 11 states and 16 transitions. [2020-07-29 01:28:47,585 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-29 01:28:47,585 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-29 01:28:47,586 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-29 01:28:47,586 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-29 01:28:47,586 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2020-07-29 01:28:47,587 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 16 transitions. [2020-07-29 01:28:47,587 INFO L711 BuchiCegarLoop]: Abstraction has 11 states and 16 transitions. [2020-07-29 01:28:47,588 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-29 01:28:47,590 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-07-29 01:28:47,591 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-07-29 01:28:47,592 INFO L87 Difference]: Start difference. First operand 11 states and 16 transitions. Second operand 4 states. [2020-07-29 01:28:47,636 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-29 01:28:47,636 INFO L93 Difference]: Finished difference Result 10 states and 12 transitions. [2020-07-29 01:28:47,636 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-07-29 01:28:47,636 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states. [2020-07-29 01:28:47,644 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 5 edges. 5 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-29 01:28:47,644 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 10 states and 12 transitions. [2020-07-29 01:28:47,646 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2020-07-29 01:28:47,646 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 10 states to 9 states and 11 transitions. [2020-07-29 01:28:47,646 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 7 [2020-07-29 01:28:47,647 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 7 [2020-07-29 01:28:47,647 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 11 transitions. [2020-07-29 01:28:47,647 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2020-07-29 01:28:47,647 INFO L688 BuchiCegarLoop]: Abstraction has 9 states and 11 transitions. [2020-07-29 01:28:47,648 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9 states and 11 transitions. [2020-07-29 01:28:47,648 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9 to 6. [2020-07-29 01:28:47,649 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-29 01:28:47,649 INFO L82 GeneralOperation]: Start isEquivalent. First operand 9 states and 11 transitions. Second operand 6 states. [2020-07-29 01:28:47,649 INFO L74 IsIncluded]: Start isIncluded. First operand 9 states and 11 transitions. Second operand 6 states. [2020-07-29 01:28:47,649 INFO L87 Difference]: Start difference. First operand 9 states and 11 transitions. Second operand 6 states. [2020-07-29 01:28:47,649 INFO L149 Difference]: Subtrahend was not deterministic. Recomputing result with determinization. [2020-07-29 01:28:47,651 INFO L93 Difference]: Finished difference Result 9 states and 11 transitions. [2020-07-29 01:28:47,651 INFO L276 IsEmpty]: Start isEmpty. Operand 9 states and 11 transitions. [2020-07-29 01:28:47,651 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-29 01:28:47,652 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-29 01:28:47,652 INFO L74 IsIncluded]: Start isIncluded. First operand 6 states. Second operand 9 states and 11 transitions. [2020-07-29 01:28:47,652 INFO L87 Difference]: Start difference. First operand 6 states. Second operand 9 states and 11 transitions. [2020-07-29 01:28:47,653 INFO L149 Difference]: Subtrahend was not deterministic. Recomputing result with determinization. [2020-07-29 01:28:47,654 INFO L93 Difference]: Finished difference Result 9 states and 11 transitions. [2020-07-29 01:28:47,654 INFO L276 IsEmpty]: Start isEmpty. Operand 9 states and 11 transitions. [2020-07-29 01:28:47,655 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-29 01:28:47,655 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-29 01:28:47,655 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-29 01:28:47,655 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-29 01:28:47,655 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2020-07-29 01:28:47,656 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 8 transitions. [2020-07-29 01:28:47,656 INFO L711 BuchiCegarLoop]: Abstraction has 6 states and 8 transitions. [2020-07-29 01:28:47,657 INFO L591 BuchiCegarLoop]: Abstraction has 6 states and 8 transitions. [2020-07-29 01:28:47,657 INFO L424 BuchiCegarLoop]: ======== Iteration 3============ [2020-07-29 01:28:47,657 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 6 states and 8 transitions. [2020-07-29 01:28:47,658 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2020-07-29 01:28:47,658 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 01:28:47,658 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 01:28:47,658 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2020-07-29 01:28:47,659 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2020-07-29 01:28:47,659 INFO L794 eck$LassoCheckResult]: Stem: 255#ULTIMATE.startENTRY havoc main_#res;havoc main_#t~nondet0, main_#t~nondet1, main_~K~0, main_~x~0;havoc main_~K~0;havoc main_~x~0;main_~K~0 := main_#t~nondet0;havoc main_#t~nondet0;main_~x~0 := main_#t~nondet1;havoc main_#t~nondet1; 256#L18-2 assume !!(main_~x~0 != main_~K~0); 252#L18 [2020-07-29 01:28:47,659 INFO L796 eck$LassoCheckResult]: Loop: 252#L18 assume !(main_~x~0 > main_~K~0);main_~x~0 := 1 + main_~x~0; 251#L18-2 assume !!(main_~x~0 != main_~K~0); 252#L18 [2020-07-29 01:28:47,659 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 01:28:47,660 INFO L82 PathProgramCache]: Analyzing trace with hash 1002, now seen corresponding path program 1 times [2020-07-29 01:28:47,660 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 01:28:47,660 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1339961046] [2020-07-29 01:28:47,661 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 01:28:47,664 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 01:28:47,665 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 01:28:47,667 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 01:28:47,667 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 01:28:47,668 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-07-29 01:28:47,669 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 01:28:47,669 INFO L82 PathProgramCache]: Analyzing trace with hash 1436, now seen corresponding path program 1 times [2020-07-29 01:28:47,669 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 01:28:47,670 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1807093159] [2020-07-29 01:28:47,670 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 01:28:47,674 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 01:28:47,674 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 01:28:47,677 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 01:28:47,678 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 01:28:47,679 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-07-29 01:28:47,680 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 01:28:47,680 INFO L82 PathProgramCache]: Analyzing trace with hash 963397, now seen corresponding path program 2 times [2020-07-29 01:28:47,680 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 01:28:47,680 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [448797511] [2020-07-29 01:28:47,681 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 01:28:47,685 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 01:28:47,686 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 01:28:47,689 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 01:28:47,690 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 01:28:47,692 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-07-29 01:28:47,715 INFO L210 LassoAnalysis]: Preferences: [2020-07-29 01:28:47,715 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2020-07-29 01:28:47,715 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2020-07-29 01:28:47,715 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2020-07-29 01:28:47,715 INFO L129 ssoRankerPreferences]: Use exernal solver: true [2020-07-29 01:28:47,715 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:28:47,715 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2020-07-29 01:28:47,716 INFO L132 ssoRankerPreferences]: Path of dumped script: [2020-07-29 01:28:47,716 INFO L133 ssoRankerPreferences]: Filename of dumped script: CookSeeZuleger-TACAS2013-Fig8a-modified.c_Iteration3_Loop [2020-07-29 01:28:47,716 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2020-07-29 01:28:47,716 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2020-07-29 01:28:47,724 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 01:28:47,729 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 01:28:47,740 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 01:28:47,923 INFO L292 LassoAnalysis]: Preprocessing complete. [2020-07-29 01:28:47,924 INFO L404 LassoAnalysis]: Checking for nontermination... 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-07-29 01:28:47,949 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2020-07-29 01:28:47,949 INFO L160 nArgumentSynthesizer]: Using integer mode. [2020-07-29 01:28:47,955 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2020-07-29 01:28:47,955 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {v_rep~unnamed0~0~true_5=1} Honda state: {v_rep~unnamed0~0~true_5=1} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 18 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 18 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:28:47,990 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2020-07-29 01:28:47,990 INFO L160 nArgumentSynthesizer]: Using integer mode. 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-07-29 01:28:48,022 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2020-07-29 01:28:48,022 INFO L160 nArgumentSynthesizer]: Using integer mode. [2020-07-29 01:28:50,101 INFO L444 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2020-07-29 01:28:50,103 INFO L210 LassoAnalysis]: Preferences: [2020-07-29 01:28:50,104 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2020-07-29 01:28:50,104 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2020-07-29 01:28:50,104 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2020-07-29 01:28:50,104 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2020-07-29 01:28:50,104 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:28:50,104 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2020-07-29 01:28:50,104 INFO L132 ssoRankerPreferences]: Path of dumped script: [2020-07-29 01:28:50,104 INFO L133 ssoRankerPreferences]: Filename of dumped script: CookSeeZuleger-TACAS2013-Fig8a-modified.c_Iteration3_Loop [2020-07-29 01:28:50,105 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2020-07-29 01:28:50,105 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2020-07-29 01:28:50,116 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 01:28:50,126 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 01:28:50,131 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 01:28:50,252 INFO L292 LassoAnalysis]: Preprocessing complete. [2020-07-29 01:28:50,253 INFO L489 LassoAnalysis]: Using template 'affine'. 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) [2020-07-29 01:28:50,262 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-07-29 01:28:50,264 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 01:28:50,264 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-07-29 01:28:50,264 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 01:28:50,264 INFO L204 nArgumentSynthesizer]: 2 loop disjuncts [2020-07-29 01:28:50,264 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 01:28:50,266 INFO L401 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2020-07-29 01:28:50,266 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. Waiting until toolchain timeout for monitored process 20 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:28:50,270 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2020-07-29 01:28:50,275 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2020-07-29 01:28:50,275 INFO L444 ModelExtractionUtils]: 0 out of 4 variables were initially zero. Simplification set additionally 0 variables to zero. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 21 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2020-07-29 01:28:50,283 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2020-07-29 01:28:50,283 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2020-07-29 01:28:50,283 INFO L510 LassoAnalysis]: Proved termination. [2020-07-29 01:28:50,283 INFO L512 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~K~0, ULTIMATE.start_main_~x~0) = 2*ULTIMATE.start_main_~K~0 - 2*ULTIMATE.start_main_~x~0 + 1 Supporting invariants [] Waiting until toolchain timeout for monitored process 21 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:28:50,320 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2020-07-29 01:28:50,323 INFO L393 LassoCheck]: Loop: "assume !(main_~x~0 > main_~K~0);main_~x~0 := 1 + main_~x~0;" "assume !!(main_~x~0 != main_~K~0);" [2020-07-29 01:28:50,326 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:28:50,339 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 01:28:50,342 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:28:50,343 INFO L263 TraceCheckSpWp]: Trace formula consists of 7 conjuncts, 2 conjunts are in the unsatisfiable core [2020-07-29 01:28:50,346 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:28:50,346 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-29 01:28:50,347 INFO L280 TraceCheckUtils]: 0: Hoare triple {306#unseeded} havoc main_#res;havoc main_#t~nondet0, main_#t~nondet1, main_~K~0, main_~x~0;havoc main_~K~0;havoc main_~x~0;main_~K~0 := main_#t~nondet0;havoc main_#t~nondet0;main_~x~0 := main_#t~nondet1;havoc main_#t~nondet1; {306#unseeded} is VALID [2020-07-29 01:28:50,348 INFO L280 TraceCheckUtils]: 1: Hoare triple {306#unseeded} assume !!(main_~x~0 != main_~K~0); {306#unseeded} is VALID [2020-07-29 01:28:50,352 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:28:50,352 WARN L261 TraceCheckSpWp]: Trace formula consists of 6 conjuncts, 4 conjunts are in the unsatisfiable core [2020-07-29 01:28:50,355 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:28:50,355 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-29 01:28:50,428 INFO L280 TraceCheckUtils]: 0: Hoare triple {309#(>= oldRank0 (+ (* 2 ULTIMATE.start_main_~K~0) (* (- 2) ULTIMATE.start_main_~x~0) 1))} assume !(main_~x~0 > main_~K~0);main_~x~0 := 1 + main_~x~0; {327#(and (<= (div (+ oldRank0 (* ULTIMATE.start_main_~K~0 (- 2)) (- 1)) (- 2)) ULTIMATE.start_main_~K~0) (<= (+ (div (+ oldRank0 (* ULTIMATE.start_main_~K~0 (- 2)) (- 1)) (- 2)) 1) ULTIMATE.start_main_~x~0))} is VALID [2020-07-29 01:28:50,429 INFO L280 TraceCheckUtils]: 1: Hoare triple {327#(and (<= (div (+ oldRank0 (* ULTIMATE.start_main_~K~0 (- 2)) (- 1)) (- 2)) ULTIMATE.start_main_~K~0) (<= (+ (div (+ oldRank0 (* ULTIMATE.start_main_~K~0 (- 2)) (- 1)) (- 2)) 1) ULTIMATE.start_main_~x~0))} assume !!(main_~x~0 != main_~K~0); {319#(or (and (> oldRank0 (+ (* 2 ULTIMATE.start_main_~K~0) (* (- 2) ULTIMATE.start_main_~x~0) 1)) (>= oldRank0 0)) unseeded)} is VALID [2020-07-29 01:28:50,430 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-29 01:28:50,430 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2020-07-29 01:28:50,436 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 4 edges. 4 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-29 01:28:50,437 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 2 letters. Loop has 2 letters. [2020-07-29 01:28:50,437 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:50,438 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2020-07-29 01:28:50,438 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 6 states and 8 transitions. cyclomatic complexity: 4 Second operand 3 states. [2020-07-29 01:28:50,458 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 6 states and 8 transitions. cyclomatic complexity: 4. Second operand 3 states. Result 11 states and 13 transitions. Complement of second has 5 states. [2020-07-29 01:28:50,458 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 3 states 1 stem states 1 non-accepting loop states 1 accepting loop states [2020-07-29 01:28:50,458 INFO L123 tractBuchiDifference]: Start testing correctness of buchiDifferenceNCSBLazy3 [2020-07-29 01:28:50,459 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 6 states and 8 transitions. cyclomatic complexity: 4 [2020-07-29 01:28:50,459 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 01:28:50,459 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 01:28:50,459 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 3 states. [2020-07-29 01:28:50,460 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2020-07-29 01:28:50,460 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 01:28:50,460 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 01:28:50,460 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 11 states and 13 transitions. [2020-07-29 01:28:50,461 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2020-07-29 01:28:50,461 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 01:28:50,461 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 01:28:50,461 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 6 states and 8 transitions. cyclomatic complexity: 4 [2020-07-29 01:28:50,462 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 2 examples of accepted words. [2020-07-29 01:28:50,462 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 3 states. [2020-07-29 01:28:50,462 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2020-07-29 01:28:50,463 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 1 examples of accepted words. [2020-07-29 01:28:50,463 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 11 states and 13 transitions. cyclomatic complexity: 5 [2020-07-29 01:28:50,463 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 2 examples of accepted words. [2020-07-29 01:28:50,463 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 8 transitions. cyclomatic complexity: 4 Stem has 2 letters. Loop has 2 letters. [2020-07-29 01:28:50,463 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:50,464 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 2 letters. Loop has 2 letters. [2020-07-29 01:28:50,464 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:50,464 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 11 states and 13 transitions. cyclomatic complexity: 5 Stem has 2 letters. Loop has 2 letters. [2020-07-29 01:28:50,464 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:50,464 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 8 transitions. cyclomatic complexity: 4 Stem has 1 letters. Loop has 1 letters. [2020-07-29 01:28:50,464 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:50,464 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 1 letters. Loop has 1 letters. [2020-07-29 01:28:50,465 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:50,465 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 11 states and 13 transitions. cyclomatic complexity: 5 Stem has 1 letters. Loop has 1 letters. [2020-07-29 01:28:50,465 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:50,465 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 8 transitions. cyclomatic complexity: 4 Stem has 4 letters. Loop has 2 letters. [2020-07-29 01:28:50,465 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:50,465 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 4 letters. Loop has 2 letters. [2020-07-29 01:28:50,465 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:50,465 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 11 states and 13 transitions. cyclomatic complexity: 5 Stem has 4 letters. Loop has 2 letters. [2020-07-29 01:28:50,466 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:50,466 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 8 transitions. cyclomatic complexity: 4 Stem has 11 letters. Loop has 11 letters. [2020-07-29 01:28:50,466 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:50,466 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 11 letters. Loop has 11 letters. [2020-07-29 01:28:50,466 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:50,466 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 11 states and 13 transitions. cyclomatic complexity: 5 Stem has 11 letters. Loop has 11 letters. [2020-07-29 01:28:50,466 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:50,466 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 8 transitions. cyclomatic complexity: 4 Stem has 6 letters. Loop has 6 letters. [2020-07-29 01:28:50,467 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:50,467 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 6 letters. Loop has 6 letters. [2020-07-29 01:28:50,467 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:50,467 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 11 states and 13 transitions. cyclomatic complexity: 5 Stem has 6 letters. Loop has 6 letters. [2020-07-29 01:28:50,467 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:50,467 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 8 transitions. cyclomatic complexity: 4 Stem has 3 letters. Loop has 3 letters. [2020-07-29 01:28:50,467 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:50,467 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 3 letters. Loop has 3 letters. [2020-07-29 01:28:50,467 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:50,468 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 11 states and 13 transitions. cyclomatic complexity: 5 Stem has 3 letters. Loop has 3 letters. [2020-07-29 01:28:50,468 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:50,468 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 8 transitions. cyclomatic complexity: 4 Stem has 3 letters. Loop has 2 letters. [2020-07-29 01:28:50,468 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:50,468 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 3 letters. Loop has 2 letters. [2020-07-29 01:28:50,468 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:50,468 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 11 states and 13 transitions. cyclomatic complexity: 5 Stem has 3 letters. Loop has 2 letters. [2020-07-29 01:28:50,469 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:50,469 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 8 transitions. cyclomatic complexity: 4 Stem has 2 letters. Loop has 2 letters. [2020-07-29 01:28:50,469 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:50,469 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 2 letters. Loop has 2 letters. [2020-07-29 01:28:50,469 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:50,469 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 11 states and 13 transitions. cyclomatic complexity: 5 Stem has 2 letters. Loop has 2 letters. [2020-07-29 01:28:50,469 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:50,470 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 8 transitions. cyclomatic complexity: 4 Stem has 1 letters. Loop has 1 letters. [2020-07-29 01:28:50,470 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:50,470 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 1 letters. Loop has 1 letters. [2020-07-29 01:28:50,470 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:50,470 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 11 states and 13 transitions. cyclomatic complexity: 5 Stem has 1 letters. Loop has 1 letters. [2020-07-29 01:28:50,470 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:50,470 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 8 transitions. cyclomatic complexity: 4 Stem has 4 letters. Loop has 2 letters. [2020-07-29 01:28:50,471 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:50,471 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 4 letters. Loop has 2 letters. [2020-07-29 01:28:50,471 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:50,471 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 11 states and 13 transitions. cyclomatic complexity: 5 Stem has 4 letters. Loop has 2 letters. [2020-07-29 01:28:50,471 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:50,471 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 8 transitions. cyclomatic complexity: 4 Stem has 5 letters. Loop has 2 letters. [2020-07-29 01:28:50,471 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:50,471 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 5 letters. Loop has 2 letters. [2020-07-29 01:28:50,472 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:50,472 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 11 states and 13 transitions. cyclomatic complexity: 5 Stem has 5 letters. Loop has 2 letters. [2020-07-29 01:28:50,472 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:50,472 INFO L161 tractBuchiDifference]: Finished testing correctness of buchiDifferenceNCSBLazy3 [2020-07-29 01:28:50,472 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-07-29 01:28:50,473 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 5 transitions. [2020-07-29 01:28:50,473 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 5 transitions. Stem has 2 letters. Loop has 2 letters. [2020-07-29 01:28:50,473 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:50,473 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 5 transitions. Stem has 4 letters. Loop has 2 letters. [2020-07-29 01:28:50,473 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:50,473 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 5 transitions. Stem has 2 letters. Loop has 4 letters. [2020-07-29 01:28:50,473 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:50,474 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 11 states and 13 transitions. cyclomatic complexity: 5 [2020-07-29 01:28:50,474 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2020-07-29 01:28:50,475 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 11 states to 7 states and 8 transitions. [2020-07-29 01:28:50,475 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 4 [2020-07-29 01:28:50,475 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 4 [2020-07-29 01:28:50,475 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 8 transitions. [2020-07-29 01:28:50,475 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2020-07-29 01:28:50,476 INFO L688 BuchiCegarLoop]: Abstraction has 7 states and 8 transitions. [2020-07-29 01:28:50,476 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7 states and 8 transitions. [2020-07-29 01:28:50,476 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7 to 6. [2020-07-29 01:28:50,476 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-29 01:28:50,477 INFO L82 GeneralOperation]: Start isEquivalent. First operand 7 states and 8 transitions. Second operand 6 states. [2020-07-29 01:28:50,477 INFO L74 IsIncluded]: Start isIncluded. First operand 7 states and 8 transitions. Second operand 6 states. [2020-07-29 01:28:50,477 INFO L87 Difference]: Start difference. First operand 7 states and 8 transitions. Second operand 6 states. [2020-07-29 01:28:50,477 INFO L149 Difference]: Subtrahend was not deterministic. Recomputing result with determinization. [2020-07-29 01:28:50,478 INFO L93 Difference]: Finished difference Result 8 states and 9 transitions. [2020-07-29 01:28:50,478 INFO L276 IsEmpty]: Start isEmpty. Operand 8 states and 9 transitions. [2020-07-29 01:28:50,478 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-29 01:28:50,478 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-29 01:28:50,479 INFO L74 IsIncluded]: Start isIncluded. First operand 6 states. Second operand 7 states and 8 transitions. [2020-07-29 01:28:50,479 INFO L87 Difference]: Start difference. First operand 6 states. Second operand 7 states and 8 transitions. [2020-07-29 01:28:50,479 INFO L149 Difference]: Subtrahend was not deterministic. Recomputing result with determinization. [2020-07-29 01:28:50,480 INFO L93 Difference]: Finished difference Result 8 states and 9 transitions. [2020-07-29 01:28:50,480 INFO L276 IsEmpty]: Start isEmpty. Operand 8 states and 9 transitions. [2020-07-29 01:28:50,480 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-29 01:28:50,481 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-29 01:28:50,481 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-29 01:28:50,481 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-29 01:28:50,481 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2020-07-29 01:28:50,481 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 7 transitions. [2020-07-29 01:28:50,481 INFO L711 BuchiCegarLoop]: Abstraction has 6 states and 7 transitions. [2020-07-29 01:28:50,482 INFO L591 BuchiCegarLoop]: Abstraction has 6 states and 7 transitions. [2020-07-29 01:28:50,482 INFO L424 BuchiCegarLoop]: ======== Iteration 4============ [2020-07-29 01:28:50,482 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 6 states and 7 transitions. [2020-07-29 01:28:50,482 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2020-07-29 01:28:50,482 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 01:28:50,482 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 01:28:50,483 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [2, 1, 1] [2020-07-29 01:28:50,483 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2020-07-29 01:28:50,483 INFO L794 eck$LassoCheckResult]: Stem: 353#ULTIMATE.startENTRY havoc main_#res;havoc main_#t~nondet0, main_#t~nondet1, main_~K~0, main_~x~0;havoc main_~K~0;havoc main_~x~0;main_~K~0 := main_#t~nondet0;havoc main_#t~nondet0;main_~x~0 := main_#t~nondet1;havoc main_#t~nondet1; 349#L18-2 assume !!(main_~x~0 != main_~K~0); 350#L18 assume main_~x~0 > main_~K~0;main_~x~0 := main_~x~0 - 1; 351#L18-2 assume !!(main_~x~0 != main_~K~0); 352#L18 [2020-07-29 01:28:50,483 INFO L796 eck$LassoCheckResult]: Loop: 352#L18 assume !(main_~x~0 > main_~K~0);main_~x~0 := 1 + main_~x~0; 354#L18-2 assume !!(main_~x~0 != main_~K~0); 352#L18 [2020-07-29 01:28:50,483 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 01:28:50,483 INFO L82 PathProgramCache]: Analyzing trace with hash 963335, now seen corresponding path program 2 times [2020-07-29 01:28:50,484 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 01:28:50,484 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [929575178] [2020-07-29 01:28:50,484 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 01:28:50,490 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 01:28:50,490 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 01:28:50,494 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 01:28:50,494 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 01:28:50,496 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-07-29 01:28:50,496 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 01:28:50,496 INFO L82 PathProgramCache]: Analyzing trace with hash 1436, now seen corresponding path program 2 times [2020-07-29 01:28:50,496 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 01:28:50,497 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1335995344] [2020-07-29 01:28:50,497 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 01:28:50,500 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 01:28:50,500 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 01:28:50,502 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 01:28:50,502 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 01:28:50,503 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-07-29 01:28:50,504 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 01:28:50,504 INFO L82 PathProgramCache]: Analyzing trace with hash 925765410, now seen corresponding path program 2 times [2020-07-29 01:28:50,504 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 01:28:50,504 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [508853894] [2020-07-29 01:28:50,504 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 01:28:50,509 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:28:50,588 INFO L280 TraceCheckUtils]: 0: Hoare triple {404#true} havoc main_#res;havoc main_#t~nondet0, main_#t~nondet1, main_~K~0, main_~x~0;havoc main_~K~0;havoc main_~x~0;main_~K~0 := main_#t~nondet0;havoc main_#t~nondet0;main_~x~0 := main_#t~nondet1;havoc main_#t~nondet1; {404#true} is VALID [2020-07-29 01:28:50,588 INFO L280 TraceCheckUtils]: 1: Hoare triple {404#true} assume !!(main_~x~0 != main_~K~0); {404#true} is VALID [2020-07-29 01:28:50,589 INFO L280 TraceCheckUtils]: 2: Hoare triple {404#true} assume main_~x~0 > main_~K~0;main_~x~0 := main_~x~0 - 1; {406#(<= ULTIMATE.start_main_~K~0 ULTIMATE.start_main_~x~0)} is VALID [2020-07-29 01:28:50,590 INFO L280 TraceCheckUtils]: 3: Hoare triple {406#(<= ULTIMATE.start_main_~K~0 ULTIMATE.start_main_~x~0)} assume !!(main_~x~0 != main_~K~0); {407#(and (not (= ULTIMATE.start_main_~K~0 ULTIMATE.start_main_~x~0)) (<= ULTIMATE.start_main_~K~0 ULTIMATE.start_main_~x~0))} is VALID [2020-07-29 01:28:50,592 INFO L280 TraceCheckUtils]: 4: Hoare triple {407#(and (not (= ULTIMATE.start_main_~K~0 ULTIMATE.start_main_~x~0)) (<= ULTIMATE.start_main_~K~0 ULTIMATE.start_main_~x~0))} assume !(main_~x~0 > main_~K~0);main_~x~0 := 1 + main_~x~0; {405#false} is VALID [2020-07-29 01:28:50,592 INFO L280 TraceCheckUtils]: 5: Hoare triple {405#false} assume !!(main_~x~0 != main_~K~0); {405#false} is VALID [2020-07-29 01:28:50,593 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-29 01:28:50,593 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [508853894] [2020-07-29 01:28:50,593 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-29 01:28:50,593 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-07-29 01:28:50,594 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [395314257] [2020-07-29 01:28:50,617 INFO L210 LassoAnalysis]: Preferences: [2020-07-29 01:28:50,617 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2020-07-29 01:28:50,617 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2020-07-29 01:28:50,617 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2020-07-29 01:28:50,617 INFO L129 ssoRankerPreferences]: Use exernal solver: true [2020-07-29 01:28:50,617 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:28:50,617 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2020-07-29 01:28:50,617 INFO L132 ssoRankerPreferences]: Path of dumped script: [2020-07-29 01:28:50,617 INFO L133 ssoRankerPreferences]: Filename of dumped script: CookSeeZuleger-TACAS2013-Fig8a-modified.c_Iteration4_Loop [2020-07-29 01:28:50,618 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2020-07-29 01:28:50,618 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2020-07-29 01:28:50,627 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 01:28:50,637 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 01:28:50,642 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 01:28:50,778 INFO L292 LassoAnalysis]: Preprocessing complete. [2020-07-29 01:28:50,778 INFO L404 LassoAnalysis]: Checking for nontermination... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 22 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2020-07-29 01:28:50,785 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2020-07-29 01:28:50,786 INFO L160 nArgumentSynthesizer]: Using integer mode. Waiting until toolchain timeout for monitored process 22 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 23 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 23 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:28:50,826 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2020-07-29 01:28:50,826 INFO L160 nArgumentSynthesizer]: Using integer mode. [2020-07-29 01:28:53,086 INFO L444 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2020-07-29 01:28:53,088 INFO L210 LassoAnalysis]: Preferences: [2020-07-29 01:28:53,089 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2020-07-29 01:28:53,089 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2020-07-29 01:28:53,089 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2020-07-29 01:28:53,089 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2020-07-29 01:28:53,089 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:28:53,089 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2020-07-29 01:28:53,090 INFO L132 ssoRankerPreferences]: Path of dumped script: [2020-07-29 01:28:53,090 INFO L133 ssoRankerPreferences]: Filename of dumped script: CookSeeZuleger-TACAS2013-Fig8a-modified.c_Iteration4_Loop [2020-07-29 01:28:53,090 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2020-07-29 01:28:53,090 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2020-07-29 01:28:53,099 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 01:28:53,107 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 01:28:53,113 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 01:28:53,249 INFO L292 LassoAnalysis]: Preprocessing complete. [2020-07-29 01:28:53,249 INFO L489 LassoAnalysis]: Using template 'affine'. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 24 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2020-07-29 01:28:53,252 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-07-29 01:28:53,254 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 01:28:53,254 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-07-29 01:28:53,254 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 01:28:53,254 INFO L204 nArgumentSynthesizer]: 2 loop disjuncts [2020-07-29 01:28:53,254 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 01:28:53,256 INFO L401 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2020-07-29 01:28:53,256 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. Waiting until toolchain timeout for monitored process 24 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:28:53,260 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2020-07-29 01:28:53,263 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2020-07-29 01:28:53,263 INFO L444 ModelExtractionUtils]: 0 out of 4 variables were initially zero. Simplification set additionally 0 variables to zero. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 25 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2020-07-29 01:28:53,266 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2020-07-29 01:28:53,266 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2020-07-29 01:28:53,266 INFO L510 LassoAnalysis]: Proved termination. [2020-07-29 01:28:53,267 INFO L512 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~x~0, ULTIMATE.start_main_~K~0) = -2*ULTIMATE.start_main_~x~0 + 2*ULTIMATE.start_main_~K~0 + 1 Supporting invariants [] Waiting until toolchain timeout for monitored process 25 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:28:53,288 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2020-07-29 01:28:53,291 INFO L393 LassoCheck]: Loop: "assume !(main_~x~0 > main_~K~0);main_~x~0 := 1 + main_~x~0;" "assume !!(main_~x~0 != main_~K~0);" [2020-07-29 01:28:53,298 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:28:53,315 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 01:28:53,319 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:28:53,319 INFO L263 TraceCheckSpWp]: Trace formula consists of 11 conjuncts, 2 conjunts are in the unsatisfiable core [2020-07-29 01:28:53,325 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:28:53,325 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-29 01:28:53,336 INFO L280 TraceCheckUtils]: 0: Hoare triple {408#unseeded} havoc main_#res;havoc main_#t~nondet0, main_#t~nondet1, main_~K~0, main_~x~0;havoc main_~K~0;havoc main_~x~0;main_~K~0 := main_#t~nondet0;havoc main_#t~nondet0;main_~x~0 := main_#t~nondet1;havoc main_#t~nondet1; {408#unseeded} is VALID [2020-07-29 01:28:53,337 INFO L280 TraceCheckUtils]: 1: Hoare triple {408#unseeded} assume !!(main_~x~0 != main_~K~0); {408#unseeded} is VALID [2020-07-29 01:28:53,338 INFO L280 TraceCheckUtils]: 2: Hoare triple {408#unseeded} assume main_~x~0 > main_~K~0;main_~x~0 := main_~x~0 - 1; {408#unseeded} is VALID [2020-07-29 01:28:53,339 INFO L280 TraceCheckUtils]: 3: Hoare triple {408#unseeded} assume !!(main_~x~0 != main_~K~0); {408#unseeded} is VALID [2020-07-29 01:28:53,342 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:28:53,343 WARN L261 TraceCheckSpWp]: Trace formula consists of 6 conjuncts, 4 conjunts are in the unsatisfiable core [2020-07-29 01:28:53,349 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:28:53,349 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-29 01:28:53,438 INFO L280 TraceCheckUtils]: 0: Hoare triple {411#(>= oldRank0 (+ (* (- 2) ULTIMATE.start_main_~x~0) (* 2 ULTIMATE.start_main_~K~0) 1))} assume !(main_~x~0 > main_~K~0);main_~x~0 := 1 + main_~x~0; {435#(and (<= (div (+ oldRank0 (* ULTIMATE.start_main_~K~0 (- 2)) (- 1)) (- 2)) ULTIMATE.start_main_~K~0) (<= (+ (div (+ oldRank0 (* ULTIMATE.start_main_~K~0 (- 2)) (- 1)) (- 2)) 1) ULTIMATE.start_main_~x~0))} is VALID [2020-07-29 01:28:53,439 INFO L280 TraceCheckUtils]: 1: Hoare triple {435#(and (<= (div (+ oldRank0 (* ULTIMATE.start_main_~K~0 (- 2)) (- 1)) (- 2)) ULTIMATE.start_main_~K~0) (<= (+ (div (+ oldRank0 (* ULTIMATE.start_main_~K~0 (- 2)) (- 1)) (- 2)) 1) ULTIMATE.start_main_~x~0))} assume !!(main_~x~0 != main_~K~0); {421#(or (and (> oldRank0 (+ (* (- 2) ULTIMATE.start_main_~x~0) (* 2 ULTIMATE.start_main_~K~0) 1)) (>= oldRank0 0)) unseeded)} is VALID [2020-07-29 01:28:53,439 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-29 01:28:53,440 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2020-07-29 01:28:53,445 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 6 edges. 6 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-29 01:28:53,446 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 4 letters. Loop has 2 letters. [2020-07-29 01:28:53,446 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:53,446 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2020-07-29 01:28:53,447 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 6 states and 7 transitions. cyclomatic complexity: 3 Second operand 3 states. [2020-07-29 01:28:53,463 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 6 states and 7 transitions. cyclomatic complexity: 3. Second operand 3 states. Result 7 states and 8 transitions. Complement of second has 3 states. [2020-07-29 01:28:53,463 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 2 states 1 stem states 0 non-accepting loop states 1 accepting loop states [2020-07-29 01:28:53,463 INFO L123 tractBuchiDifference]: Start testing correctness of buchiDifferenceNCSBLazy3 [2020-07-29 01:28:53,463 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 6 states and 7 transitions. cyclomatic complexity: 3 [2020-07-29 01:28:53,463 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 01:28:53,463 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 01:28:53,463 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 3 states. [2020-07-29 01:28:53,464 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2020-07-29 01:28:53,464 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2020-07-29 01:28:53,464 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 7 states and 8 transitions. [2020-07-29 01:28:53,464 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2020-07-29 01:28:53,465 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 01:28:53,465 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 01:28:53,465 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 6 states and 7 transitions. cyclomatic complexity: 3 [2020-07-29 01:28:53,465 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 2 examples of accepted words. [2020-07-29 01:28:53,465 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 3 states. [2020-07-29 01:28:53,466 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2020-07-29 01:28:53,466 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 2 states and 2 transitions. cyclomatic complexity: 1 [2020-07-29 01:28:53,466 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2020-07-29 01:28:53,466 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 0 examples of accepted words. [2020-07-29 01:28:53,466 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 7 states and 8 transitions. cyclomatic complexity: 3 [2020-07-29 01:28:53,467 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 2 examples of accepted words. [2020-07-29 01:28:53,467 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 7 transitions. cyclomatic complexity: 3 Stem has 4 letters. Loop has 2 letters. [2020-07-29 01:28:53,467 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:53,467 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 4 letters. Loop has 2 letters. [2020-07-29 01:28:53,467 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:53,467 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 8 transitions. cyclomatic complexity: 3 Stem has 4 letters. Loop has 2 letters. [2020-07-29 01:28:53,467 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:53,467 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 7 transitions. cyclomatic complexity: 3 Stem has 4 letters. Loop has 2 letters. [2020-07-29 01:28:53,467 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:53,468 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 4 letters. Loop has 2 letters. [2020-07-29 01:28:53,468 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:53,468 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 8 transitions. cyclomatic complexity: 3 Stem has 4 letters. Loop has 2 letters. [2020-07-29 01:28:53,468 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:53,468 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 7 transitions. cyclomatic complexity: 3 Stem has 7 letters. Loop has 7 letters. [2020-07-29 01:28:53,468 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:53,468 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 7 letters. Loop has 7 letters. [2020-07-29 01:28:53,468 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:53,468 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 8 transitions. cyclomatic complexity: 3 Stem has 7 letters. Loop has 7 letters. [2020-07-29 01:28:53,468 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:53,469 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 7 transitions. cyclomatic complexity: 3 Stem has 6 letters. Loop has 6 letters. [2020-07-29 01:28:53,469 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:53,469 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 6 letters. Loop has 6 letters. [2020-07-29 01:28:53,469 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:53,469 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 8 transitions. cyclomatic complexity: 3 Stem has 6 letters. Loop has 6 letters. [2020-07-29 01:28:53,469 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:53,469 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 7 transitions. cyclomatic complexity: 3 Stem has 2 letters. Loop has 2 letters. [2020-07-29 01:28:53,469 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:53,470 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 2 letters. Loop has 2 letters. [2020-07-29 01:28:53,470 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:53,470 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 8 transitions. cyclomatic complexity: 3 Stem has 2 letters. Loop has 2 letters. [2020-07-29 01:28:53,470 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:53,470 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 7 transitions. cyclomatic complexity: 3 Stem has 4 letters. Loop has 2 letters. [2020-07-29 01:28:53,470 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:53,470 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 4 letters. Loop has 2 letters. [2020-07-29 01:28:53,470 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:53,470 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 8 transitions. cyclomatic complexity: 3 Stem has 4 letters. Loop has 2 letters. [2020-07-29 01:28:53,471 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:53,471 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 7 transitions. cyclomatic complexity: 3 Stem has 5 letters. Loop has 2 letters. [2020-07-29 01:28:53,471 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:53,471 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 5 letters. Loop has 2 letters. [2020-07-29 01:28:53,471 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:53,471 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 8 transitions. cyclomatic complexity: 3 Stem has 5 letters. Loop has 2 letters. [2020-07-29 01:28:53,471 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:53,471 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 7 transitions. cyclomatic complexity: 3 Stem has 5 letters. Loop has 2 letters. [2020-07-29 01:28:53,471 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:53,471 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 5 letters. Loop has 2 letters. [2020-07-29 01:28:53,472 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:53,472 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 8 transitions. cyclomatic complexity: 3 Stem has 5 letters. Loop has 2 letters. [2020-07-29 01:28:53,472 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:53,472 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 7 transitions. cyclomatic complexity: 3 Stem has 4 letters. Loop has 2 letters. [2020-07-29 01:28:53,472 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:53,472 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 4 letters. Loop has 2 letters. [2020-07-29 01:28:53,472 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:53,472 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 8 transitions. cyclomatic complexity: 3 Stem has 4 letters. Loop has 2 letters. [2020-07-29 01:28:53,473 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:53,473 INFO L161 tractBuchiDifference]: Finished testing correctness of buchiDifferenceNCSBLazy3 [2020-07-29 01:28:53,473 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-07-29 01:28:53,473 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 2 transitions. [2020-07-29 01:28:53,473 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 2 states and 2 transitions. Stem has 4 letters. Loop has 2 letters. [2020-07-29 01:28:53,473 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:53,473 INFO L639 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2020-07-29 01:28:53,489 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 01:28:53,493 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:28:53,493 INFO L263 TraceCheckSpWp]: Trace formula consists of 11 conjuncts, 2 conjunts are in the unsatisfiable core [2020-07-29 01:28:53,497 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:28:53,497 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-29 01:28:53,500 INFO L280 TraceCheckUtils]: 0: Hoare triple {408#unseeded} havoc main_#res;havoc main_#t~nondet0, main_#t~nondet1, main_~K~0, main_~x~0;havoc main_~K~0;havoc main_~x~0;main_~K~0 := main_#t~nondet0;havoc main_#t~nondet0;main_~x~0 := main_#t~nondet1;havoc main_#t~nondet1; {408#unseeded} is VALID [2020-07-29 01:28:53,501 INFO L280 TraceCheckUtils]: 1: Hoare triple {408#unseeded} assume !!(main_~x~0 != main_~K~0); {408#unseeded} is VALID [2020-07-29 01:28:53,502 INFO L280 TraceCheckUtils]: 2: Hoare triple {408#unseeded} assume main_~x~0 > main_~K~0;main_~x~0 := main_~x~0 - 1; {408#unseeded} is VALID [2020-07-29 01:28:53,503 INFO L280 TraceCheckUtils]: 3: Hoare triple {408#unseeded} assume !!(main_~x~0 != main_~K~0); {408#unseeded} is VALID [2020-07-29 01:28:53,505 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:28:53,506 WARN L261 TraceCheckSpWp]: Trace formula consists of 6 conjuncts, 4 conjunts are in the unsatisfiable core [2020-07-29 01:28:53,508 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:28:53,509 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-29 01:28:53,603 INFO L280 TraceCheckUtils]: 0: Hoare triple {411#(>= oldRank0 (+ (* (- 2) ULTIMATE.start_main_~x~0) (* 2 ULTIMATE.start_main_~K~0) 1))} assume !(main_~x~0 > main_~K~0);main_~x~0 := 1 + main_~x~0; {463#(and (<= (div (+ oldRank0 (* ULTIMATE.start_main_~K~0 (- 2)) (- 1)) (- 2)) ULTIMATE.start_main_~K~0) (<= (+ (div (+ oldRank0 (* ULTIMATE.start_main_~K~0 (- 2)) (- 1)) (- 2)) 1) ULTIMATE.start_main_~x~0))} is VALID [2020-07-29 01:28:53,605 INFO L280 TraceCheckUtils]: 1: Hoare triple {463#(and (<= (div (+ oldRank0 (* ULTIMATE.start_main_~K~0 (- 2)) (- 1)) (- 2)) ULTIMATE.start_main_~K~0) (<= (+ (div (+ oldRank0 (* ULTIMATE.start_main_~K~0 (- 2)) (- 1)) (- 2)) 1) ULTIMATE.start_main_~x~0))} assume !!(main_~x~0 != main_~K~0); {421#(or (and (> oldRank0 (+ (* (- 2) ULTIMATE.start_main_~x~0) (* 2 ULTIMATE.start_main_~K~0) 1)) (>= oldRank0 0)) unseeded)} is VALID [2020-07-29 01:28:53,605 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-29 01:28:53,605 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2020-07-29 01:28:53,614 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 6 edges. 6 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-29 01:28:53,614 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 4 letters. Loop has 2 letters. [2020-07-29 01:28:53,614 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:53,614 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and with honda bouncer for loop.1 stem predicates 2 loop predicates [2020-07-29 01:28:53,614 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 6 states and 7 transitions. cyclomatic complexity: 3 Second operand 3 states. [2020-07-29 01:28:53,625 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 6 states and 7 transitions. cyclomatic complexity: 3. Second operand 3 states. Result 7 states and 8 transitions. Complement of second has 3 states. [2020-07-29 01:28:53,626 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 2 states 1 stem states 0 non-accepting loop states 1 accepting loop states [2020-07-29 01:28:53,626 INFO L123 tractBuchiDifference]: Start testing correctness of buchiDifferenceNCSBLazy3 [2020-07-29 01:28:53,626 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 6 states and 7 transitions. cyclomatic complexity: 3 [2020-07-29 01:28:53,626 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 01:28:53,626 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 01:28:53,627 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 3 states. [2020-07-29 01:28:53,627 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2020-07-29 01:28:53,627 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2020-07-29 01:28:53,627 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 7 states and 8 transitions. [2020-07-29 01:28:53,628 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2020-07-29 01:28:53,628 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 01:28:53,628 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 01:28:53,628 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 6 states and 7 transitions. cyclomatic complexity: 3 [2020-07-29 01:28:53,628 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 2 examples of accepted words. [2020-07-29 01:28:53,629 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 3 states. [2020-07-29 01:28:53,629 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2020-07-29 01:28:53,629 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 2 states and 2 transitions. cyclomatic complexity: 1 [2020-07-29 01:28:53,629 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2020-07-29 01:28:53,629 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 0 examples of accepted words. [2020-07-29 01:28:53,630 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 7 states and 8 transitions. cyclomatic complexity: 3 [2020-07-29 01:28:53,630 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 2 examples of accepted words. [2020-07-29 01:28:53,630 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 7 transitions. cyclomatic complexity: 3 Stem has 4 letters. Loop has 2 letters. [2020-07-29 01:28:53,632 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:53,632 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 4 letters. Loop has 2 letters. [2020-07-29 01:28:53,632 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:53,632 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 8 transitions. cyclomatic complexity: 3 Stem has 4 letters. Loop has 2 letters. [2020-07-29 01:28:53,632 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:53,633 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 7 transitions. cyclomatic complexity: 3 Stem has 4 letters. Loop has 2 letters. [2020-07-29 01:28:53,633 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:53,633 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 4 letters. Loop has 2 letters. [2020-07-29 01:28:53,633 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:53,633 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 8 transitions. cyclomatic complexity: 3 Stem has 4 letters. Loop has 2 letters. [2020-07-29 01:28:53,633 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:53,634 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 7 transitions. cyclomatic complexity: 3 Stem has 7 letters. Loop has 7 letters. [2020-07-29 01:28:53,634 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:53,634 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 7 letters. Loop has 7 letters. [2020-07-29 01:28:53,634 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:53,634 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 8 transitions. cyclomatic complexity: 3 Stem has 7 letters. Loop has 7 letters. [2020-07-29 01:28:53,634 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:53,634 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 7 transitions. cyclomatic complexity: 3 Stem has 6 letters. Loop has 6 letters. [2020-07-29 01:28:53,635 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:53,635 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 6 letters. Loop has 6 letters. [2020-07-29 01:28:53,635 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:53,635 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 8 transitions. cyclomatic complexity: 3 Stem has 6 letters. Loop has 6 letters. [2020-07-29 01:28:53,635 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:53,635 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 7 transitions. cyclomatic complexity: 3 Stem has 2 letters. Loop has 2 letters. [2020-07-29 01:28:53,636 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:53,636 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 2 letters. Loop has 2 letters. [2020-07-29 01:28:53,636 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:53,636 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 8 transitions. cyclomatic complexity: 3 Stem has 2 letters. Loop has 2 letters. [2020-07-29 01:28:53,636 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:53,636 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 7 transitions. cyclomatic complexity: 3 Stem has 4 letters. Loop has 2 letters. [2020-07-29 01:28:53,636 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:53,637 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 4 letters. Loop has 2 letters. [2020-07-29 01:28:53,637 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:53,637 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 8 transitions. cyclomatic complexity: 3 Stem has 4 letters. Loop has 2 letters. [2020-07-29 01:28:53,637 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:53,637 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 7 transitions. cyclomatic complexity: 3 Stem has 5 letters. Loop has 2 letters. [2020-07-29 01:28:53,637 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:53,638 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 5 letters. Loop has 2 letters. [2020-07-29 01:28:53,638 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:53,638 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 8 transitions. cyclomatic complexity: 3 Stem has 5 letters. Loop has 2 letters. [2020-07-29 01:28:53,638 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:53,638 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 7 transitions. cyclomatic complexity: 3 Stem has 4 letters. Loop has 2 letters. [2020-07-29 01:28:53,640 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:53,640 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 4 letters. Loop has 2 letters. [2020-07-29 01:28:53,640 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:53,640 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 8 transitions. cyclomatic complexity: 3 Stem has 4 letters. Loop has 2 letters. [2020-07-29 01:28:53,640 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:53,641 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 7 transitions. cyclomatic complexity: 3 Stem has 5 letters. Loop has 2 letters. [2020-07-29 01:28:53,641 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:53,641 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 5 letters. Loop has 2 letters. [2020-07-29 01:28:53,641 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:53,641 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 8 transitions. cyclomatic complexity: 3 Stem has 5 letters. Loop has 2 letters. [2020-07-29 01:28:53,641 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:53,642 INFO L161 tractBuchiDifference]: Finished testing correctness of buchiDifferenceNCSBLazy3 [2020-07-29 01:28:53,642 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-07-29 01:28:53,642 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 2 transitions. [2020-07-29 01:28:53,642 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 2 states and 2 transitions. Stem has 4 letters. Loop has 2 letters. [2020-07-29 01:28:53,642 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:53,643 INFO L639 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2020-07-29 01:28:53,667 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 01:28:53,673 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:28:53,674 INFO L263 TraceCheckSpWp]: Trace formula consists of 11 conjuncts, 2 conjunts are in the unsatisfiable core [2020-07-29 01:28:53,678 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:28:53,679 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-29 01:28:53,688 INFO L280 TraceCheckUtils]: 0: Hoare triple {408#unseeded} havoc main_#res;havoc main_#t~nondet0, main_#t~nondet1, main_~K~0, main_~x~0;havoc main_~K~0;havoc main_~x~0;main_~K~0 := main_#t~nondet0;havoc main_#t~nondet0;main_~x~0 := main_#t~nondet1;havoc main_#t~nondet1; {408#unseeded} is VALID [2020-07-29 01:28:53,688 INFO L280 TraceCheckUtils]: 1: Hoare triple {408#unseeded} assume !!(main_~x~0 != main_~K~0); {408#unseeded} is VALID [2020-07-29 01:28:53,689 INFO L280 TraceCheckUtils]: 2: Hoare triple {408#unseeded} assume main_~x~0 > main_~K~0;main_~x~0 := main_~x~0 - 1; {408#unseeded} is VALID [2020-07-29 01:28:53,690 INFO L280 TraceCheckUtils]: 3: Hoare triple {408#unseeded} assume !!(main_~x~0 != main_~K~0); {408#unseeded} is VALID [2020-07-29 01:28:53,693 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:28:53,694 WARN L261 TraceCheckSpWp]: Trace formula consists of 6 conjuncts, 4 conjunts are in the unsatisfiable core [2020-07-29 01:28:53,698 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:28:53,699 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-29 01:28:53,783 INFO L280 TraceCheckUtils]: 0: Hoare triple {411#(>= oldRank0 (+ (* (- 2) ULTIMATE.start_main_~x~0) (* 2 ULTIMATE.start_main_~K~0) 1))} assume !(main_~x~0 > main_~K~0);main_~x~0 := 1 + main_~x~0; {491#(and (<= (div (+ oldRank0 (* ULTIMATE.start_main_~K~0 (- 2)) (- 1)) (- 2)) ULTIMATE.start_main_~K~0) (<= (+ (div (+ oldRank0 (* ULTIMATE.start_main_~K~0 (- 2)) (- 1)) (- 2)) 1) ULTIMATE.start_main_~x~0))} is VALID [2020-07-29 01:28:53,785 INFO L280 TraceCheckUtils]: 1: Hoare triple {491#(and (<= (div (+ oldRank0 (* ULTIMATE.start_main_~K~0 (- 2)) (- 1)) (- 2)) ULTIMATE.start_main_~K~0) (<= (+ (div (+ oldRank0 (* ULTIMATE.start_main_~K~0 (- 2)) (- 1)) (- 2)) 1) ULTIMATE.start_main_~x~0))} assume !!(main_~x~0 != main_~K~0); {421#(or (and (> oldRank0 (+ (* (- 2) ULTIMATE.start_main_~x~0) (* 2 ULTIMATE.start_main_~K~0) 1)) (>= oldRank0 0)) unseeded)} is VALID [2020-07-29 01:28:53,786 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-29 01:28:53,786 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2020-07-29 01:28:53,793 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 6 edges. 6 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-29 01:28:53,793 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 4 letters. Loop has 2 letters. [2020-07-29 01:28:53,793 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:53,793 INFO L152 lantAutomatonBouncer]: Defining Buchi interpolant automaton with scrooge nondeterminism in stemwith honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2020-07-29 01:28:53,793 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 6 states and 7 transitions. cyclomatic complexity: 3 Second operand 3 states. [2020-07-29 01:28:53,815 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 6 states and 7 transitions. cyclomatic complexity: 3. Second operand 3 states. Result 8 states and 9 transitions. Complement of second has 4 states. [2020-07-29 01:28:53,816 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 3 states 1 stem states 1 non-accepting loop states 1 accepting loop states [2020-07-29 01:28:53,816 INFO L123 tractBuchiDifference]: Start testing correctness of buchiDifferenceNCSBLazy3 [2020-07-29 01:28:53,816 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 6 states and 7 transitions. cyclomatic complexity: 3 [2020-07-29 01:28:53,816 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 01:28:53,816 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 01:28:53,816 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 3 states. [2020-07-29 01:28:53,817 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2020-07-29 01:28:53,818 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 01:28:53,818 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 01:28:53,818 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 8 states and 9 transitions. [2020-07-29 01:28:53,818 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2020-07-29 01:28:53,818 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2020-07-29 01:28:53,819 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 6 states and 7 transitions. cyclomatic complexity: 3 [2020-07-29 01:28:53,819 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 2 examples of accepted words. [2020-07-29 01:28:53,819 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 3 states. [2020-07-29 01:28:53,819 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2020-07-29 01:28:53,819 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 1 examples of accepted words. [2020-07-29 01:28:53,820 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 8 states and 9 transitions. cyclomatic complexity: 3 [2020-07-29 01:28:53,820 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 8 states and 9 transitions. cyclomatic complexity: 3 [2020-07-29 01:28:53,820 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2020-07-29 01:28:53,820 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 0 examples of accepted words. [2020-07-29 01:28:53,820 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 7 transitions. cyclomatic complexity: 3 Stem has 4 letters. Loop has 2 letters. [2020-07-29 01:28:53,820 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:53,820 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 4 letters. Loop has 2 letters. [2020-07-29 01:28:53,820 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:53,820 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states and 9 transitions. cyclomatic complexity: 3 Stem has 4 letters. Loop has 2 letters. [2020-07-29 01:28:53,821 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:53,821 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 7 transitions. cyclomatic complexity: 3 Stem has 1 letters. Loop has 1 letters. [2020-07-29 01:28:53,821 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:53,821 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 1 letters. Loop has 1 letters. [2020-07-29 01:28:53,821 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:53,822 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states and 9 transitions. cyclomatic complexity: 3 Stem has 1 letters. Loop has 1 letters. [2020-07-29 01:28:53,822 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:53,823 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 7 transitions. cyclomatic complexity: 3 Stem has 8 letters. Loop has 8 letters. [2020-07-29 01:28:53,823 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:53,823 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 8 letters. Loop has 8 letters. [2020-07-29 01:28:53,823 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:53,823 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states and 9 transitions. cyclomatic complexity: 3 Stem has 8 letters. Loop has 8 letters. [2020-07-29 01:28:53,823 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:53,824 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 7 transitions. cyclomatic complexity: 3 Stem has 6 letters. Loop has 6 letters. [2020-07-29 01:28:53,824 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:53,824 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 6 letters. Loop has 6 letters. [2020-07-29 01:28:53,824 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:53,824 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states and 9 transitions. cyclomatic complexity: 3 Stem has 6 letters. Loop has 6 letters. [2020-07-29 01:28:53,825 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:53,825 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 7 transitions. cyclomatic complexity: 3 Stem has 3 letters. Loop has 3 letters. [2020-07-29 01:28:53,825 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:53,825 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 3 letters. Loop has 3 letters. [2020-07-29 01:28:53,825 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:53,825 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states and 9 transitions. cyclomatic complexity: 3 Stem has 3 letters. Loop has 3 letters. [2020-07-29 01:28:53,826 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:53,826 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 7 transitions. cyclomatic complexity: 3 Stem has 4 letters. Loop has 2 letters. [2020-07-29 01:28:53,826 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:53,826 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 4 letters. Loop has 2 letters. [2020-07-29 01:28:53,826 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:53,827 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states and 9 transitions. cyclomatic complexity: 3 Stem has 4 letters. Loop has 2 letters. [2020-07-29 01:28:53,827 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:53,827 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 7 transitions. cyclomatic complexity: 3 Stem has 5 letters. Loop has 2 letters. [2020-07-29 01:28:53,827 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:53,828 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 5 letters. Loop has 2 letters. [2020-07-29 01:28:53,828 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:53,828 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states and 9 transitions. cyclomatic complexity: 3 Stem has 5 letters. Loop has 2 letters. [2020-07-29 01:28:53,828 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:53,829 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 7 transitions. cyclomatic complexity: 3 Stem has 1 letters. Loop has 1 letters. [2020-07-29 01:28:53,829 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:53,829 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 1 letters. Loop has 1 letters. [2020-07-29 01:28:53,829 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:53,829 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states and 9 transitions. cyclomatic complexity: 3 Stem has 1 letters. Loop has 1 letters. [2020-07-29 01:28:53,829 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:53,830 INFO L161 tractBuchiDifference]: Finished testing correctness of buchiDifferenceNCSBLazy3 [2020-07-29 01:28:53,830 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-07-29 01:28:53,830 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 8 transitions. [2020-07-29 01:28:53,830 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 8 transitions. Stem has 4 letters. Loop has 2 letters. [2020-07-29 01:28:53,831 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:53,831 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 8 transitions. Stem has 6 letters. Loop has 2 letters. [2020-07-29 01:28:53,831 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:53,831 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 8 transitions. Stem has 4 letters. Loop has 4 letters. [2020-07-29 01:28:53,831 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:53,831 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 8 states and 9 transitions. cyclomatic complexity: 3 [2020-07-29 01:28:53,832 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2020-07-29 01:28:53,832 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 8 states to 0 states and 0 transitions. [2020-07-29 01:28:53,832 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2020-07-29 01:28:53,832 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2020-07-29 01:28:53,832 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2020-07-29 01:28:53,833 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-07-29 01:28:53,833 INFO L688 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2020-07-29 01:28:53,833 INFO L711 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2020-07-29 01:28:53,833 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-29 01:28:53,833 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-07-29 01:28:53,833 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2020-07-29 01:28:53,833 INFO L87 Difference]: Start difference. First operand 0 states and 0 transitions. Second operand 4 states. [2020-07-29 01:28:53,833 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-29 01:28:53,834 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2020-07-29 01:28:53,834 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2020-07-29 01:28:53,834 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states. [2020-07-29 01:28:53,839 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 6 edges. 6 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-29 01:28:53,840 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 0 states and 0 transitions. [2020-07-29 01:28:53,840 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2020-07-29 01:28:53,840 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 0 states to 0 states and 0 transitions. [2020-07-29 01:28:53,840 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2020-07-29 01:28:53,840 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2020-07-29 01:28:53,840 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2020-07-29 01:28:53,840 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-07-29 01:28:53,841 INFO L688 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2020-07-29 01:28:53,841 INFO L711 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2020-07-29 01:28:53,841 INFO L591 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2020-07-29 01:28:53,841 INFO L424 BuchiCegarLoop]: ======== Iteration 5============ [2020-07-29 01:28:53,841 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2020-07-29 01:28:53,841 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2020-07-29 01:28:53,841 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2020-07-29 01:28:53,847 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 29.07 01:28:53 BoogieIcfgContainer [2020-07-29 01:28:53,847 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2020-07-29 01:28:53,847 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2020-07-29 01:28:53,847 INFO L271 PluginConnector]: Initializing Witness Printer... [2020-07-29 01:28:53,848 INFO L275 PluginConnector]: Witness Printer initialized [2020-07-29 01:28:53,848 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.07 01:28:44" (3/4) ... [2020-07-29 01:28:53,851 INFO L140 WitnessPrinter]: No result that supports witness generation found [2020-07-29 01:28:53,851 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2020-07-29 01:28:53,853 INFO L168 Benchmark]: Toolchain (without parser) took 9856.89 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 206.0 MB). Free memory was 960.2 MB in the beginning and 955.6 MB in the end (delta: 4.7 MB). Peak memory consumption was 210.7 MB. Max. memory is 11.5 GB. [2020-07-29 01:28:53,854 INFO L168 Benchmark]: CDTParser took 0.33 ms. Allocated memory is still 1.0 GB. Free memory is still 987.1 MB. There was no memory consumed. Max. memory is 11.5 GB. [2020-07-29 01:28:53,855 INFO L168 Benchmark]: CACSL2BoogieTranslator took 241.47 ms. Allocated memory is still 1.0 GB. Free memory was 960.2 MB in the beginning and 949.5 MB in the end (delta: 10.7 MB). Peak memory consumption was 10.7 MB. Max. memory is 11.5 GB. [2020-07-29 01:28:53,855 INFO L168 Benchmark]: Boogie Procedure Inliner took 35.88 ms. Allocated memory is still 1.0 GB. Free memory is still 949.5 MB. There was no memory consumed. Max. memory is 11.5 GB. [2020-07-29 01:28:53,856 INFO L168 Benchmark]: Boogie Preprocessor took 74.43 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 132.6 MB). Free memory was 949.5 MB in the beginning and 1.1 GB in the end (delta: -179.6 MB). Peak memory consumption was 9.7 MB. Max. memory is 11.5 GB. [2020-07-29 01:28:53,857 INFO L168 Benchmark]: RCFGBuilder took 275.21 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 18.5 MB). Peak memory consumption was 18.5 MB. Max. memory is 11.5 GB. [2020-07-29 01:28:53,857 INFO L168 Benchmark]: BuchiAutomizer took 9219.93 ms. Allocated memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 73.4 MB). Free memory was 1.1 GB in the beginning and 955.6 MB in the end (delta: 155.0 MB). Peak memory consumption was 228.4 MB. Max. memory is 11.5 GB. [2020-07-29 01:28:53,858 INFO L168 Benchmark]: Witness Printer took 3.57 ms. Allocated memory is still 1.2 GB. Free memory is still 955.6 MB. There was no memory consumed. Max. memory is 11.5 GB. [2020-07-29 01:28:53,862 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - AssertionsEnabledResult: Assertions are enabled Assertions are enabled - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.33 ms. Allocated memory is still 1.0 GB. Free memory is still 987.1 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 241.47 ms. Allocated memory is still 1.0 GB. Free memory was 960.2 MB in the beginning and 949.5 MB in the end (delta: 10.7 MB). Peak memory consumption was 10.7 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 35.88 ms. Allocated memory is still 1.0 GB. Free memory is still 949.5 MB. There was no memory consumed. Max. memory is 11.5 GB. * Boogie Preprocessor took 74.43 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 132.6 MB). Free memory was 949.5 MB in the beginning and 1.1 GB in the end (delta: -179.6 MB). Peak memory consumption was 9.7 MB. Max. memory is 11.5 GB. * RCFGBuilder took 275.21 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 18.5 MB). Peak memory consumption was 18.5 MB. Max. memory is 11.5 GB. * BuchiAutomizer took 9219.93 ms. Allocated memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 73.4 MB). Free memory was 1.1 GB in the beginning and 955.6 MB in the end (delta: 155.0 MB). Peak memory consumption was 228.4 MB. Max. memory is 11.5 GB. * Witness Printer took 3.57 ms. Allocated memory is still 1.2 GB. Free memory is still 955.6 MB. There was no memory consumed. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Constructed decomposition of program Your program was decomposed into 6 terminating modules (2 trivial, 3 deterministic, 1 nondeterministic). One deterministic module has affine ranking function x + -1 * K and consists of 4 locations. One deterministic module has affine ranking function x + -1 * K and consists of 3 locations. One deterministic module has affine ranking function 2 * K + -2 * x + 1 and consists of 3 locations. One nondeterministic module has affine ranking function -2 * x + 2 * K + 1 and consists of 3 locations. 2 modules have a trivial ranking function, the largest among these consists of 4 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 9.1s and 5 iterations. TraceHistogramMax:2. Analysis of lassos took 7.8s. Construction of modules took 0.0s. Büchi inclusion checks took 0.9s. Highest rank in rank-based complementation 3. Minimization of det autom 2. Minimization of nondet autom 4. Automata minimization 0.0s AutomataMinimizationTime, 4 MinimizatonAttempts, 4 StatesRemovedByMinimization, 2 NontrivialMinimizations. Non-live state removal took 0.0s Buchi closure took 0.0s. Biggest automaton had 7 states and ocurred in iteration 1. Nontrivial modules had stage [3, 0, 1, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 20 SDtfs, 32 SDslu, 3 SDs, 0 SdLazy, 42 SolverSat, 8 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.0s Time LassoAnalysisResults: nont0 unkn0 SFLI0 SFLT2 conc0 concLT2 SILN0 SILU0 SILI0 SILT0 lasso0 LassoPreprocessingBenchmarks: Lassos: inital12 mio100 ax200 hnf98 lsp49 ukn100 mio100 lsp100 div100 bol100 ite100 ukn100 eq165 hnf94 smp100 dnf132 smp89 tf110 neg96 sie112 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 0 Time: 23ms VariablesStem: 1 VariablesLoop: 0 DisjunctsStem: 1 DisjunctsLoop: 1 SupportingInvariants: 2 MotzkinApplications: 6 LassoTerminationAnalysisBenchmarks: LassoNonterminationAnalysisSatFixpoint: 5 LassoNonterminationAnalysisSatUnbounded: 0 LassoNonterminationAnalysisUnsat: 4 LassoNonterminationAnalysisUnknown: 0 LassoNonterminationAnalysisTime: 5.0s - TerminationAnalysisResult: Termination proven Buchi Automizer proved that your program is terminating RESULT: Ultimate proved your program to be correct! Received shutdown request...