./Ultimate.py --spec ../sv-benchmarks/c/properties/termination.prp --file ../sv-benchmarks/c/termination-crafted-lit/CookSeeZuleger-TACAS2013-Fig8a.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.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 df3ddc93bc6339292c9158119f1fdb949bb8842d .................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... 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,928 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-07-29 01:28:42,931 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-07-29 01:28:42,944 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-07-29 01:28:42,944 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-07-29 01:28:42,945 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-07-29 01:28:42,947 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-07-29 01:28:42,949 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-07-29 01:28:42,951 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-07-29 01:28:42,952 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-07-29 01:28:42,953 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-07-29 01:28:42,955 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-07-29 01:28:42,955 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-07-29 01:28:42,956 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-07-29 01:28:42,958 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-07-29 01:28:42,959 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-07-29 01:28:42,960 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-07-29 01:28:42,961 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-07-29 01:28:42,963 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-07-29 01:28:42,965 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-07-29 01:28:42,967 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-07-29 01:28:42,968 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-07-29 01:28:42,970 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-07-29 01:28:42,971 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-07-29 01:28:42,973 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-07-29 01:28:42,974 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-07-29 01:28:42,974 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-07-29 01:28:42,975 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-07-29 01:28:42,976 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-07-29 01:28:42,977 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-07-29 01:28:42,977 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-07-29 01:28:42,978 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-07-29 01:28:42,979 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-07-29 01:28:42,980 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-07-29 01:28:42,981 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-07-29 01:28:42,981 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-07-29 01:28:42,982 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-07-29 01:28:42,982 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-07-29 01:28:42,983 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-07-29 01:28:42,984 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-07-29 01:28:42,985 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-07-29 01:28:42,986 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:43,013 INFO L113 SettingsManager]: Loading preferences was successful [2020-07-29 01:28:43,014 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-07-29 01:28:43,016 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2020-07-29 01:28:43,016 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2020-07-29 01:28:43,016 INFO L138 SettingsManager]: * Use SBE=true [2020-07-29 01:28:43,017 INFO L136 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2020-07-29 01:28:43,017 INFO L138 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2020-07-29 01:28:43,017 INFO L138 SettingsManager]: * Use old map elimination=false [2020-07-29 01:28:43,017 INFO L138 SettingsManager]: * Use external solver (rank synthesis)=false [2020-07-29 01:28:43,018 INFO L138 SettingsManager]: * Use only trivial implications for array writes=true [2020-07-29 01:28:43,019 INFO L138 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2020-07-29 01:28:43,019 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-07-29 01:28:43,019 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2020-07-29 01:28:43,020 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-07-29 01:28:43,020 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-07-29 01:28:43,021 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2020-07-29 01:28:43,021 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2020-07-29 01:28:43,021 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2020-07-29 01:28:43,021 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-07-29 01:28:43,022 INFO L138 SettingsManager]: * Assume nondeterminstic values are in range=false [2020-07-29 01:28:43,022 INFO L138 SettingsManager]: * Use constant arrays=true [2020-07-29 01:28:43,022 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2020-07-29 01:28:43,022 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-07-29 01:28:43,023 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2020-07-29 01:28:43,023 INFO L138 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2020-07-29 01:28:43,023 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-07-29 01:28:43,024 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2020-07-29 01:28:43,024 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2020-07-29 01:28:43,024 INFO L138 SettingsManager]: * Dump automata to the following directory=/home/matthias/ultimate/dump/auto [2020-07-29 01:28:43,026 INFO L136 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2020-07-29 01:28:43,026 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 -> df3ddc93bc6339292c9158119f1fdb949bb8842d [2020-07-29 01:28:43,342 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2020-07-29 01:28:43,356 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-07-29 01:28:43,360 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-07-29 01:28:43,362 INFO L271 PluginConnector]: Initializing CDTParser... [2020-07-29 01:28:43,362 INFO L275 PluginConnector]: CDTParser initialized [2020-07-29 01:28:43,363 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.c [2020-07-29 01:28:43,438 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/09b3fcb2b/8c920203b1304673b422343ba955ef44/FLAG0689ecd29 [2020-07-29 01:28:43,889 INFO L306 CDTParser]: Found 1 translation units. [2020-07-29 01:28:43,890 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/termination-crafted-lit/CookSeeZuleger-TACAS2013-Fig8a.c [2020-07-29 01:28:43,898 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/09b3fcb2b/8c920203b1304673b422343ba955ef44/FLAG0689ecd29 [2020-07-29 01:28:44,272 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/09b3fcb2b/8c920203b1304673b422343ba955ef44 [2020-07-29 01:28:44,276 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-07-29 01:28:44,279 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2020-07-29 01:28:44,280 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-07-29 01:28:44,281 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-07-29 01:28:44,284 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-07-29 01:28:44,286 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 29.07 01:28:44" (1/1) ... [2020-07-29 01:28:44,289 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3a2e0197 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,290 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 29.07 01:28:44" (1/1) ... [2020-07-29 01:28:44,297 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-07-29 01:28:44,319 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-07-29 01:28:44,474 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-07-29 01:28:44,480 INFO L203 MainTranslator]: Completed pre-run [2020-07-29 01:28:44,496 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-07-29 01:28:44,512 INFO L208 MainTranslator]: Completed translation [2020-07-29 01:28:44,512 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,513 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-07-29 01:28:44,513 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2020-07-29 01:28:44,514 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2020-07-29 01:28:44,514 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2020-07-29 01:28:44,523 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,529 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,548 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2020-07-29 01:28:44,549 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-07-29 01:28:44,549 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-07-29 01:28:44,549 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-07-29 01:28:44,559 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,559 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,560 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,560 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,563 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,630 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,630 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,632 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-07-29 01:28:44,633 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-07-29 01:28:44,633 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-07-29 01:28:44,633 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-07-29 01:28:44,634 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,709 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-07-29 01:28:44,710 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-07-29 01:28:44,909 INFO L290 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-07-29 01:28:44,910 INFO L295 CfgBuilder]: Removed 5 assume(true) statements. [2020-07-29 01:28:44,913 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,913 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-07-29 01:28:44,914 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2020-07-29 01:28:44,914 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2020-07-29 01:28:44,917 INFO L275 PluginConnector]: BuchiAutomizer initialized [2020-07-29 01:28:44,918 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2020-07-29 01:28:44,918 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 29.07 01:28:44" (1/3) ... [2020-07-29 01:28:44,919 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@20b80a83 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,919 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2020-07-29 01:28:44,920 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,920 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@20b80a83 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,920 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2020-07-29 01:28:44,920 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,922 INFO L371 chiAutomizerObserver]: Analyzing ICFG CookSeeZuleger-TACAS2013-Fig8a.c [2020-07-29 01:28:44,973 INFO L356 BuchiCegarLoop]: Interprodecural is true [2020-07-29 01:28:44,973 INFO L357 BuchiCegarLoop]: Hoare is false [2020-07-29 01:28:44,974 INFO L358 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2020-07-29 01:28:44,974 INFO L359 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2020-07-29 01:28:44,974 INFO L360 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-07-29 01:28:44,974 INFO L361 BuchiCegarLoop]: Difference is false [2020-07-29 01:28:44,974 INFO L362 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-07-29 01:28:44,974 INFO L365 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2020-07-29 01:28:44,985 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 7 states. [2020-07-29 01:28:45,008 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2020-07-29 01:28:45,009 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 01:28:45,009 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 01:28:45,014 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1] [2020-07-29 01:28:45,014 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2020-07-29 01:28:45,014 INFO L424 BuchiCegarLoop]: ======== Iteration 1============ [2020-07-29 01:28:45,014 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 7 states. [2020-07-29 01:28:45,016 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2020-07-29 01:28:45,016 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 01:28:45,017 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 01:28:45,017 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1] [2020-07-29 01:28:45,017 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2020-07-29 01:28:45,024 INFO L794 eck$LassoCheckResult]: Stem: 4#ULTIMATE.startENTRYtrue havoc main_#res;havoc main_#t~nondet0, main_~x~0;havoc main_~x~0;main_~x~0 := main_#t~nondet0;havoc main_#t~nondet0; 3#L17-2true [2020-07-29 01:28:45,024 INFO L796 eck$LassoCheckResult]: Loop: 3#L17-2true assume !!(0 != main_~x~0); 5#L17true assume main_~x~0 > 0;main_~x~0 := main_~x~0 - 1; 3#L17-2true [2020-07-29 01:28:45,028 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 01:28:45,029 INFO L82 PathProgramCache]: Analyzing trace with hash 32, now seen corresponding path program 1 times [2020-07-29 01:28:45,036 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 01:28:45,037 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1449462957] [2020-07-29 01:28:45,037 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 01:28:45,100 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 01:28:45,100 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 01:28:45,103 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 01:28:45,103 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 01:28:45,118 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-07-29 01:28:45,120 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 01:28:45,120 INFO L82 PathProgramCache]: Analyzing trace with hash 1284, now seen corresponding path program 1 times [2020-07-29 01:28:45,120 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 01:28:45,121 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [189489053] [2020-07-29 01:28:45,121 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 01:28:45,130 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 01:28:45,130 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 01:28:45,133 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 01:28:45,133 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 01:28:45,135 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-07-29 01:28:45,136 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 01:28:45,137 INFO L82 PathProgramCache]: Analyzing trace with hash 31075, now seen corresponding path program 1 times [2020-07-29 01:28:45,137 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 01:28:45,137 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [164137637] [2020-07-29 01:28:45,137 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 01:28:45,143 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 01:28:45,143 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 01:28:45,146 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 01:28:45,147 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 01:28:45,148 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-07-29 01:28:45,344 WARN L193 SmtUtils]: Spent 185.00 ms on a formula simplification. DAG size of input: 10 DAG size of output: 8 [2020-07-29 01:28:45,419 INFO L210 LassoAnalysis]: Preferences: [2020-07-29 01:28:45,420 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2020-07-29 01:28:45,420 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2020-07-29 01:28:45,421 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2020-07-29 01:28:45,421 INFO L129 ssoRankerPreferences]: Use exernal solver: true [2020-07-29 01:28:45,421 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:28:45,421 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2020-07-29 01:28:45,421 INFO L132 ssoRankerPreferences]: Path of dumped script: [2020-07-29 01:28:45,422 INFO L133 ssoRankerPreferences]: Filename of dumped script: CookSeeZuleger-TACAS2013-Fig8a.c_Iteration1_Loop [2020-07-29 01:28:45,422 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2020-07-29 01:28:45,422 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2020-07-29 01:28:45,477 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,500 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,509 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,694 INFO L292 LassoAnalysis]: Preprocessing complete. [2020-07-29 01:28:45,696 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,706 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2020-07-29 01:28:45,707 INFO L160 nArgumentSynthesizer]: Using integer mode. [2020-07-29 01:28:45,717 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2020-07-29 01:28:45,718 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,758 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2020-07-29 01:28:45,758 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,763 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2020-07-29 01:28:45,763 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) [2020-07-29 01:28:45,811 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2020-07-29 01:28:45,812 INFO L160 nArgumentSynthesizer]: Using integer mode. Waiting until toolchain timeout for monitored process 4 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2020-07-29 01:28:45,863 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2020-07-29 01:28:45,864 INFO L160 nArgumentSynthesizer]: Using integer mode. Waiting until toolchain timeout for monitored process 5 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:28:45,905 INFO L444 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2020-07-29 01:28:45,907 INFO L210 LassoAnalysis]: Preferences: [2020-07-29 01:28:45,907 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2020-07-29 01:28:45,908 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2020-07-29 01:28:45,908 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2020-07-29 01:28:45,908 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2020-07-29 01:28:45,908 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:28:45,909 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2020-07-29 01:28:45,909 INFO L132 ssoRankerPreferences]: Path of dumped script: [2020-07-29 01:28:45,909 INFO L133 ssoRankerPreferences]: Filename of dumped script: CookSeeZuleger-TACAS2013-Fig8a.c_Iteration1_Loop [2020-07-29 01:28:45,910 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2020-07-29 01:28:45,911 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2020-07-29 01:28:45,927 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,935 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,943 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,090 INFO L292 LassoAnalysis]: Preprocessing complete. [2020-07-29 01:28:46,096 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:46,108 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:46,111 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 01:28:46,111 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 01:28:46,112 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 01:28:46,112 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 01:28:46,119 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-07-29 01:28:46,120 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-07-29 01:28:46,129 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 7 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:28:46,174 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:46,176 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 01:28:46,176 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 01:28:46,177 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 01:28:46,177 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 01:28:46,181 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-07-29 01:28:46,181 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-07-29 01:28:46,187 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 8 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:28:46,230 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:46,232 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 01:28:46,233 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-07-29 01:28:46,233 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 01:28:46,234 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 01:28:46,234 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 01:28:46,236 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-07-29 01:28:46,236 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-07-29 01:28:46,240 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2020-07-29 01:28:46,249 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2020-07-29 01:28:46,250 INFO L444 ModelExtractionUtils]: 0 out of 3 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 9 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 9 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:28:46,266 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2020-07-29 01:28:46,267 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2020-07-29 01:28:46,267 INFO L510 LassoAnalysis]: Proved termination. [2020-07-29 01:28:46,268 INFO L512 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~x~0) = 1*ULTIMATE.start_main_~x~0 Supporting invariants [] [2020-07-29 01:28:46,295 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2020-07-29 01:28:46,300 INFO L393 LassoCheck]: Loop: "assume !!(0 != main_~x~0);" "assume main_~x~0 > 0;main_~x~0 := main_~x~0 - 1;" [2020-07-29 01:28:46,305 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:28:46,343 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 01:28:46,350 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:28:46,353 WARN L261 TraceCheckSpWp]: Trace formula consists of 4 conjuncts, 2 conjunts are in the unsatisfiable core [2020-07-29 01:28:46,358 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:28:46,359 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-29 01:28:46,369 INFO L280 TraceCheckUtils]: 0: Hoare triple {17#unseeded} havoc main_#res;havoc main_#t~nondet0, main_~x~0;havoc main_~x~0;main_~x~0 := main_#t~nondet0;havoc main_#t~nondet0; {17#unseeded} is VALID [2020-07-29 01:28:46,374 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:28:46,375 WARN L261 TraceCheckSpWp]: Trace formula consists of 6 conjuncts, 4 conjunts are in the unsatisfiable core [2020-07-29 01:28:46,382 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:28:46,383 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-29 01:28:46,390 INFO L280 TraceCheckUtils]: 0: Hoare triple {20#(>= oldRank0 ULTIMATE.start_main_~x~0)} assume !!(0 != main_~x~0); {20#(>= oldRank0 ULTIMATE.start_main_~x~0)} is VALID [2020-07-29 01:28:46,392 INFO L280 TraceCheckUtils]: 1: Hoare triple {20#(>= oldRank0 ULTIMATE.start_main_~x~0)} assume main_~x~0 > 0;main_~x~0 := main_~x~0 - 1; {30#(or (and (> oldRank0 ULTIMATE.start_main_~x~0) (>= oldRank0 0)) unseeded)} is VALID [2020-07-29 01:28:46,392 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,401 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2020-07-29 01:28:46,408 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,410 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 1 letters. Loop has 2 letters. [2020-07-29 01:28:46,413 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:46,418 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,419 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 7 states. Second operand 3 states. [2020-07-29 01:28:46,494 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,494 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,494 INFO L123 tractBuchiDifference]: Start testing correctness of buchiDifferenceNCSBLazy3 [2020-07-29 01:28:46,495 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 7 states. [2020-07-29 01:28:46,496 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2020-07-29 01:28:46,496 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 01:28:46,497 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 01:28:46,497 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 3 states. [2020-07-29 01:28:46,500 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 3 [2020-07-29 01:28:46,501 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 01:28:46,501 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 01:28:46,501 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 23 states and 30 transitions. [2020-07-29 01:28:46,503 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2020-07-29 01:28:46,503 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 01:28:46,503 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 01:28:46,505 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 7 states. [2020-07-29 01:28:46,507 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2020-07-29 01:28:46,507 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 2 examples of accepted words. [2020-07-29 01:28:46,507 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 3 states. [2020-07-29 01:28:46,509 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 3 [2020-07-29 01:28:46,509 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 2 examples of accepted words. [2020-07-29 01:28:46,510 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 23 states and 30 transitions. cyclomatic complexity: 9 [2020-07-29 01:28:46,510 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 2 examples of accepted words. [2020-07-29 01:28:46,510 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states. Stem has 1 letters. Loop has 2 letters. [2020-07-29 01:28:46,511 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:46,511 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 1 letters. Loop has 2 letters. [2020-07-29 01:28:46,511 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:46,511 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,512 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:46,512 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states. Stem has 1 letters. Loop has 2 letters. [2020-07-29 01:28:46,512 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:46,512 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 1 letters. Loop has 2 letters. [2020-07-29 01:28:46,512 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:46,513 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,513 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:46,513 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states. Stem has 3 letters. Loop has 2 letters. [2020-07-29 01:28:46,513 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:46,513 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 3 letters. Loop has 2 letters. [2020-07-29 01:28:46,514 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:46,514 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,514 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:46,514 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states. Stem has 23 letters. Loop has 23 letters. [2020-07-29 01:28:46,514 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:46,515 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 23 letters. Loop has 23 letters. [2020-07-29 01:28:46,515 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:46,515 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,515 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:46,515 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states. Stem has 7 letters. Loop has 7 letters. [2020-07-29 01:28:46,516 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:46,516 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 7 letters. Loop has 7 letters. [2020-07-29 01:28:46,516 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:46,516 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,516 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:46,517 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states. Stem has 4 letters. Loop has 4 letters. [2020-07-29 01:28:46,517 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:46,517 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 4 letters. Loop has 4 letters. [2020-07-29 01:28:46,517 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:46,517 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,518 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:46,518 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states. Stem has 1 letters. Loop has 2 letters. [2020-07-29 01:28:46,518 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:46,518 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 1 letters. Loop has 2 letters. [2020-07-29 01:28:46,518 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:46,519 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,519 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:46,519 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states. Stem has 2 letters. Loop has 2 letters. [2020-07-29 01:28:46,520 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:46,520 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 2 letters. Loop has 2 letters. [2020-07-29 01:28:46,520 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:46,520 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,521 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:46,521 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states. Stem has 2 letters. Loop has 1 letters. [2020-07-29 01:28:46,521 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:46,521 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 2 letters. Loop has 1 letters. [2020-07-29 01:28:46,521 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:46,522 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,522 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:46,522 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states. Stem has 1 letters. Loop has 2 letters. [2020-07-29 01:28:46,522 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:46,522 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 1 letters. Loop has 2 letters. [2020-07-29 01:28:46,523 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:46,523 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,523 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:46,523 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states. Stem has 3 letters. Loop has 2 letters. [2020-07-29 01:28:46,524 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:46,524 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 3 letters. Loop has 2 letters. [2020-07-29 01:28:46,524 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:46,524 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,524 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:46,525 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states. Stem has 4 letters. Loop has 2 letters. [2020-07-29 01:28:46,525 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:46,525 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 4 letters. Loop has 2 letters. [2020-07-29 01:28:46,525 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:46,526 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,526 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:46,526 INFO L161 tractBuchiDifference]: Finished testing correctness of buchiDifferenceNCSBLazy3 [2020-07-29 01:28:46,528 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-07-29 01:28:46,529 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 11 transitions. [2020-07-29 01:28:46,530 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,530 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:46,530 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,530 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:46,531 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,531 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:46,532 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 23 states and 30 transitions. cyclomatic complexity: 9 [2020-07-29 01:28:46,537 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2020-07-29 01:28:46,543 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 23 states to 7 states and 10 transitions. [2020-07-29 01:28:46,544 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 4 [2020-07-29 01:28:46,545 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 5 [2020-07-29 01:28:46,546 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 10 transitions. [2020-07-29 01:28:46,546 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2020-07-29 01:28:46,546 INFO L688 BuchiCegarLoop]: Abstraction has 7 states and 10 transitions. [2020-07-29 01:28:46,565 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7 states and 10 transitions. [2020-07-29 01:28:46,574 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7 to 7. [2020-07-29 01:28:46,574 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-29 01:28:46,574 INFO L82 GeneralOperation]: Start isEquivalent. First operand 7 states and 10 transitions. Second operand 7 states. [2020-07-29 01:28:46,575 INFO L74 IsIncluded]: Start isIncluded. First operand 7 states and 10 transitions. Second operand 7 states. [2020-07-29 01:28:46,577 INFO L87 Difference]: Start difference. First operand 7 states and 10 transitions. Second operand 7 states. [2020-07-29 01:28:46,581 INFO L149 Difference]: Subtrahend was not deterministic. Recomputing result with determinization. [2020-07-29 01:28:46,583 INFO L93 Difference]: Finished difference Result 7 states and 10 transitions. [2020-07-29 01:28:46,584 INFO L276 IsEmpty]: Start isEmpty. Operand 7 states and 10 transitions. [2020-07-29 01:28:46,585 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-29 01:28:46,585 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-29 01:28:46,585 INFO L74 IsIncluded]: Start isIncluded. First operand 7 states. Second operand 7 states and 10 transitions. [2020-07-29 01:28:46,585 INFO L87 Difference]: Start difference. First operand 7 states. Second operand 7 states and 10 transitions. [2020-07-29 01:28:46,586 INFO L149 Difference]: Subtrahend was not deterministic. Recomputing result with determinization. [2020-07-29 01:28:46,587 INFO L93 Difference]: Finished difference Result 7 states and 10 transitions. [2020-07-29 01:28:46,588 INFO L276 IsEmpty]: Start isEmpty. Operand 7 states and 10 transitions. [2020-07-29 01:28:46,588 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-29 01:28:46,588 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-29 01:28:46,588 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-29 01:28:46,588 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-29 01:28:46,589 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2020-07-29 01:28:46,590 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 10 transitions. [2020-07-29 01:28:46,591 INFO L711 BuchiCegarLoop]: Abstraction has 7 states and 10 transitions. [2020-07-29 01:28:46,591 INFO L591 BuchiCegarLoop]: Abstraction has 7 states and 10 transitions. [2020-07-29 01:28:46,591 INFO L424 BuchiCegarLoop]: ======== Iteration 2============ [2020-07-29 01:28:46,591 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 7 states and 10 transitions. [2020-07-29 01:28:46,592 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2020-07-29 01:28:46,592 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 01:28:46,592 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 01:28:46,593 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1] [2020-07-29 01:28:46,593 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2020-07-29 01:28:46,593 INFO L794 eck$LassoCheckResult]: Stem: 74#ULTIMATE.startENTRY havoc main_#res;havoc main_#t~nondet0, main_~x~0;havoc main_~x~0;main_~x~0 := main_#t~nondet0;havoc main_#t~nondet0; 75#L17-2 assume !!(0 != main_~x~0); 73#L17 assume !(main_~x~0 > 0);main_~x~0 := 1 + main_~x~0; 69#L17-2 [2020-07-29 01:28:46,593 INFO L796 eck$LassoCheckResult]: Loop: 69#L17-2 assume !!(0 != main_~x~0); 70#L17 assume main_~x~0 > 0;main_~x~0 := main_~x~0 - 1; 69#L17-2 [2020-07-29 01:28:46,594 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 01:28:46,594 INFO L82 PathProgramCache]: Analyzing trace with hash 31077, now seen corresponding path program 1 times [2020-07-29 01:28:46,594 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 01:28:46,594 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [328867868] [2020-07-29 01:28:46,595 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 01:28:46,602 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 01:28:46,602 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 01:28:46,606 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 01:28:46,606 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 01:28:46,608 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-07-29 01:28:46,609 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 01:28:46,609 INFO L82 PathProgramCache]: Analyzing trace with hash 1284, now seen corresponding path program 2 times [2020-07-29 01:28:46,609 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 01:28:46,610 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [215372575] [2020-07-29 01:28:46,610 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 01:28:46,614 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 01:28:46,614 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 01:28:46,617 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 01:28:46,617 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 01:28:46,618 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-07-29 01:28:46,619 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 01:28:46,619 INFO L82 PathProgramCache]: Analyzing trace with hash 29865320, now seen corresponding path program 1 times [2020-07-29 01:28:46,619 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 01:28:46,620 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1958176693] [2020-07-29 01:28:46,620 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 01:28:46,629 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:28:46,685 INFO L280 TraceCheckUtils]: 0: Hoare triple {117#true} havoc main_#res;havoc main_#t~nondet0, main_~x~0;havoc main_~x~0;main_~x~0 := main_#t~nondet0;havoc main_#t~nondet0; {117#true} is VALID [2020-07-29 01:28:46,687 INFO L280 TraceCheckUtils]: 1: Hoare triple {117#true} assume !!(0 != main_~x~0); {119#(not (= 0 ULTIMATE.start_main_~x~0))} is VALID [2020-07-29 01:28:46,689 INFO L280 TraceCheckUtils]: 2: Hoare triple {119#(not (= 0 ULTIMATE.start_main_~x~0))} assume !(main_~x~0 > 0);main_~x~0 := 1 + main_~x~0; {120#(<= ULTIMATE.start_main_~x~0 0)} is VALID [2020-07-29 01:28:46,691 INFO L280 TraceCheckUtils]: 3: Hoare triple {120#(<= ULTIMATE.start_main_~x~0 0)} assume !!(0 != main_~x~0); {120#(<= ULTIMATE.start_main_~x~0 0)} is VALID [2020-07-29 01:28:46,693 INFO L280 TraceCheckUtils]: 4: Hoare triple {120#(<= ULTIMATE.start_main_~x~0 0)} assume main_~x~0 > 0;main_~x~0 := main_~x~0 - 1; {118#false} is VALID [2020-07-29 01:28:46,694 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,695 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1958176693] [2020-07-29 01:28:46,696 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1979307447] [2020-07-29 01:28:46,696 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2020-07-29 01:28:46,717 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:28:46,718 INFO L263 TraceCheckSpWp]: Trace formula consists of 12 conjuncts, 4 conjunts are in the unsatisfiable core Waiting until toolchain timeout for monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-07-29 01:28:46,724 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:28:46,725 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-29 01:28:46,818 INFO L280 TraceCheckUtils]: 0: Hoare triple {117#true} havoc main_#res;havoc main_#t~nondet0, main_~x~0;havoc main_~x~0;main_~x~0 := main_#t~nondet0;havoc main_#t~nondet0; {117#true} is VALID [2020-07-29 01:28:46,819 INFO L280 TraceCheckUtils]: 1: Hoare triple {117#true} assume !!(0 != main_~x~0); {119#(not (= 0 ULTIMATE.start_main_~x~0))} is VALID [2020-07-29 01:28:46,820 INFO L280 TraceCheckUtils]: 2: Hoare triple {119#(not (= 0 ULTIMATE.start_main_~x~0))} assume !(main_~x~0 > 0);main_~x~0 := 1 + main_~x~0; {120#(<= ULTIMATE.start_main_~x~0 0)} is VALID [2020-07-29 01:28:46,821 INFO L280 TraceCheckUtils]: 3: Hoare triple {120#(<= ULTIMATE.start_main_~x~0 0)} assume !!(0 != main_~x~0); {120#(<= ULTIMATE.start_main_~x~0 0)} is VALID [2020-07-29 01:28:46,822 INFO L280 TraceCheckUtils]: 4: Hoare triple {120#(<= ULTIMATE.start_main_~x~0 0)} assume main_~x~0 > 0;main_~x~0 := main_~x~0 - 1; {118#false} is VALID [2020-07-29 01:28:46,823 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,823 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-07-29 01:28:46,824 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3] total 3 [2020-07-29 01:28:46,824 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1136155964] [2020-07-29 01:28:46,850 INFO L210 LassoAnalysis]: Preferences: [2020-07-29 01:28:46,850 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2020-07-29 01:28:46,851 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2020-07-29 01:28:46,851 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2020-07-29 01:28:46,851 INFO L129 ssoRankerPreferences]: Use exernal solver: true [2020-07-29 01:28:46,851 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:28:46,851 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2020-07-29 01:28:46,852 INFO L132 ssoRankerPreferences]: Path of dumped script: [2020-07-29 01:28:46,852 INFO L133 ssoRankerPreferences]: Filename of dumped script: CookSeeZuleger-TACAS2013-Fig8a.c_Iteration2_Loop [2020-07-29 01:28:46,852 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2020-07-29 01:28:46,852 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2020-07-29 01:28:46,861 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,868 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,874 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,972 INFO L292 LassoAnalysis]: Preprocessing complete. [2020-07-29 01:28:46,972 INFO L404 LassoAnalysis]: Checking for nontermination... 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,976 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2020-07-29 01:28:46,977 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 [2020-07-29 01:28:46,983 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2020-07-29 01:28:46,983 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 12 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2020-07-29 01:28:47,027 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2020-07-29 01:28:47,027 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,033 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2020-07-29 01:28:47,033 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 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,076 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2020-07-29 01:28:47,077 INFO L160 nArgumentSynthesizer]: Using integer mode. Waiting until toolchain timeout for monitored process 13 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 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,116 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2020-07-29 01:28:47,116 INFO L160 nArgumentSynthesizer]: Using integer mode. Waiting until toolchain timeout for monitored process 14 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:28:47,145 INFO L444 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2020-07-29 01:28:47,149 INFO L210 LassoAnalysis]: Preferences: [2020-07-29 01:28:47,149 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2020-07-29 01:28:47,149 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2020-07-29 01:28:47,149 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2020-07-29 01:28:47,150 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2020-07-29 01:28:47,150 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:28:47,150 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2020-07-29 01:28:47,150 INFO L132 ssoRankerPreferences]: Path of dumped script: [2020-07-29 01:28:47,151 INFO L133 ssoRankerPreferences]: Filename of dumped script: CookSeeZuleger-TACAS2013-Fig8a.c_Iteration2_Loop [2020-07-29 01:28:47,152 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2020-07-29 01:28:47,152 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2020-07-29 01:28:47,162 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,168 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,174 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,271 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 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,276 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 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,278 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 01:28:47,279 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 01:28:47,279 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 01:28:47,279 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 01:28:47,282 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-07-29 01:28:47,283 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-07-29 01:28:47,287 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 16 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2020-07-29 01:28:47,336 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,338 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 01:28:47,338 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 01:28:47,338 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 01:28:47,338 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 01:28:47,341 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-07-29 01:28:47,342 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-07-29 01:28:47,346 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. Waiting until toolchain timeout for monitored process 16 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 17 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2020-07-29 01:28:47,398 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,401 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 01:28:47,401 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-07-29 01:28:47,401 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 01:28:47,402 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 01:28:47,402 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 01:28:47,403 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-07-29 01:28:47,403 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. 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,406 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2020-07-29 01:28:47,409 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2020-07-29 01:28:47,409 INFO L444 ModelExtractionUtils]: 0 out of 3 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 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,413 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2020-07-29 01:28:47,413 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2020-07-29 01:28:47,414 INFO L510 LassoAnalysis]: Proved termination. [2020-07-29 01:28:47,414 INFO L512 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~x~0) = 1*ULTIMATE.start_main_~x~0 Supporting invariants [] [2020-07-29 01:28:47,456 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2020-07-29 01:28:47,459 INFO L393 LassoCheck]: Loop: "assume !!(0 != main_~x~0);" "assume main_~x~0 > 0;main_~x~0 := main_~x~0 - 1;" [2020-07-29 01:28:47,463 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:28:47,480 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 01:28:47,485 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:28:47,486 INFO L263 TraceCheckSpWp]: Trace formula consists of 8 conjuncts, 2 conjunts are in the unsatisfiable core [2020-07-29 01:28:47,490 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:28:47,491 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-29 01:28:47,495 INFO L280 TraceCheckUtils]: 0: Hoare triple {133#unseeded} havoc main_#res;havoc main_#t~nondet0, main_~x~0;havoc main_~x~0;main_~x~0 := main_#t~nondet0;havoc main_#t~nondet0; {133#unseeded} is VALID [2020-07-29 01:28:47,496 INFO L280 TraceCheckUtils]: 1: Hoare triple {133#unseeded} assume !!(0 != main_~x~0); {133#unseeded} is VALID [2020-07-29 01:28:47,497 INFO L280 TraceCheckUtils]: 2: Hoare triple {133#unseeded} assume !(main_~x~0 > 0);main_~x~0 := 1 + main_~x~0; {133#unseeded} is VALID [2020-07-29 01:28:47,502 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:28:47,503 WARN L261 TraceCheckSpWp]: Trace formula consists of 6 conjuncts, 4 conjunts are in the unsatisfiable core [2020-07-29 01:28:47,507 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:28:47,508 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-29 01:28:47,512 INFO L280 TraceCheckUtils]: 0: Hoare triple {136#(>= oldRank0 ULTIMATE.start_main_~x~0)} assume !!(0 != main_~x~0); {136#(>= oldRank0 ULTIMATE.start_main_~x~0)} is VALID [2020-07-29 01:28:47,514 INFO L280 TraceCheckUtils]: 1: Hoare triple {136#(>= oldRank0 ULTIMATE.start_main_~x~0)} assume main_~x~0 > 0;main_~x~0 := main_~x~0 - 1; {146#(or (and (> oldRank0 ULTIMATE.start_main_~x~0) (>= oldRank0 0)) unseeded)} is VALID [2020-07-29 01:28:47,514 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,515 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2020-07-29 01:28:47,523 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,523 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 3 letters. Loop has 2 letters. [2020-07-29 01:28:47,523 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:47,524 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,524 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,554 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,555 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,555 INFO L123 tractBuchiDifference]: Start testing correctness of buchiDifferenceNCSBLazy3 [2020-07-29 01:28:47,555 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 7 states and 10 transitions. cyclomatic complexity: 5 [2020-07-29 01:28:47,555 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 01:28:47,555 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 01:28:47,555 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 3 states. [2020-07-29 01:28:47,557 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2020-07-29 01:28:47,557 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 01:28:47,557 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 01:28:47,557 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 11 states and 16 transitions. [2020-07-29 01:28:47,558 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2020-07-29 01:28:47,558 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 01:28:47,558 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 01:28:47,559 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 7 states and 10 transitions. cyclomatic complexity: 5 [2020-07-29 01:28:47,560 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 2 examples of accepted words. [2020-07-29 01:28:47,560 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 3 states. [2020-07-29 01:28:47,561 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2020-07-29 01:28:47,561 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 1 examples of accepted words. [2020-07-29 01:28:47,562 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 11 states and 16 transitions. cyclomatic complexity: 8 [2020-07-29 01:28:47,562 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 2 examples of accepted words. [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 2 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 3 states. Stem has 3 letters. Loop has 2 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 11 states and 16 transitions. cyclomatic complexity: 8 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 7 states and 10 transitions. cyclomatic complexity: 5 Stem has 1 letters. Loop has 2 letters. [2020-07-29 01:28:47,564 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:47,565 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 1 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 11 states and 16 transitions. cyclomatic complexity: 8 Stem has 1 letters. Loop has 2 letters. [2020-07-29 01:28:47,565 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 5 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 3 states. Stem has 5 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 5 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 11 letters. Loop has 11 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 11 letters. Loop has 11 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 11 letters. Loop has 11 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 7 letters. Loop has 7 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 7 letters. Loop has 7 letters. [2020-07-29 01:28:47,569 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:47,570 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,570 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:47,570 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,570 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:47,571 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 3 letters. Loop has 3 letters. [2020-07-29 01:28:47,571 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:47,571 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,571 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:47,571 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,572 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:47,572 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. 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 11 states and 16 transitions. cyclomatic complexity: 8 Stem has 3 letters. Loop has 2 letters. [2020-07-29 01:28:47,573 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:47,573 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,573 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:47,574 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 4 letters. Loop has 2 letters. [2020-07-29 01:28:47,574 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:47,574 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,575 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:47,575 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,575 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:47,575 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 1 letters. Loop has 2 letters. [2020-07-29 01:28:47,576 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:47,576 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,576 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:47,576 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,576 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:47,577 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 5 letters. Loop has 2 letters. [2020-07-29 01:28:47,577 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:47,577 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,577 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:47,578 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,578 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:47,578 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 6 letters. Loop has 2 letters. [2020-07-29 01:28:47,579 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:47,579 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,579 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:47,579 INFO L161 tractBuchiDifference]: Finished testing correctness of buchiDifferenceNCSBLazy3 [2020-07-29 01:28:47,580 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-07-29 01:28:47,581 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 6 transitions. [2020-07-29 01:28:47,581 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,582 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:47,582 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,582 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:47,582 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,583 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:47,583 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 11 states and 16 transitions. cyclomatic complexity: 8 [2020-07-29 01:28:47,584 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2020-07-29 01:28:47,586 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 11 states to 11 states and 16 transitions. [2020-07-29 01:28:47,587 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 6 [2020-07-29 01:28:47,587 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 7 [2020-07-29 01:28:47,587 INFO L73 IsDeterministic]: Start isDeterministic. Operand 11 states and 16 transitions. [2020-07-29 01:28:47,587 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2020-07-29 01:28:47,588 INFO L688 BuchiCegarLoop]: Abstraction has 11 states and 16 transitions. [2020-07-29 01:28:47,588 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11 states and 16 transitions. [2020-07-29 01:28:47,590 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11 to 11. [2020-07-29 01:28:47,591 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-29 01:28:47,591 INFO L82 GeneralOperation]: Start isEquivalent. First operand 11 states and 16 transitions. Second operand 11 states. [2020-07-29 01:28:47,591 INFO L74 IsIncluded]: Start isIncluded. First operand 11 states and 16 transitions. Second operand 11 states. [2020-07-29 01:28:47,591 INFO L87 Difference]: Start difference. First operand 11 states and 16 transitions. Second operand 11 states. [2020-07-29 01:28:47,592 INFO L149 Difference]: Subtrahend was not deterministic. Recomputing result with determinization. [2020-07-29 01:28:47,594 INFO L93 Difference]: Finished difference Result 11 states and 16 transitions. [2020-07-29 01:28:47,595 INFO L276 IsEmpty]: Start isEmpty. Operand 11 states and 16 transitions. [2020-07-29 01:28:47,595 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-29 01:28:47,595 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-29 01:28:47,595 INFO L74 IsIncluded]: Start isIncluded. First operand 11 states. Second operand 11 states and 16 transitions. [2020-07-29 01:28:47,596 INFO L87 Difference]: Start difference. First operand 11 states. Second operand 11 states and 16 transitions. [2020-07-29 01:28:47,596 INFO L149 Difference]: Subtrahend was not deterministic. Recomputing result with determinization. [2020-07-29 01:28:47,602 INFO L93 Difference]: Finished difference Result 11 states and 16 transitions. [2020-07-29 01:28:47,602 INFO L276 IsEmpty]: Start isEmpty. Operand 11 states and 16 transitions. [2020-07-29 01:28:47,602 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-29 01:28:47,603 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-29 01:28:47,603 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-29 01:28:47,603 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-29 01:28:47,603 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2020-07-29 01:28:47,604 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 16 transitions. [2020-07-29 01:28:47,604 INFO L711 BuchiCegarLoop]: Abstraction has 11 states and 16 transitions. [2020-07-29 01:28:47,605 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-29 01:28:47,607 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-07-29 01:28:47,608 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-07-29 01:28:47,609 INFO L87 Difference]: Start difference. First operand 11 states and 16 transitions. Second operand 4 states. [2020-07-29 01:28:47,657 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-29 01:28:47,657 INFO L93 Difference]: Finished difference Result 10 states and 12 transitions. [2020-07-29 01:28:47,657 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-07-29 01:28:47,657 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states. [2020-07-29 01:28:47,666 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,667 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 10 states and 12 transitions. [2020-07-29 01:28:47,668 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2020-07-29 01:28:47,669 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 10 states to 9 states and 11 transitions. [2020-07-29 01:28:47,671 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 7 [2020-07-29 01:28:47,671 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 7 [2020-07-29 01:28:47,672 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 11 transitions. [2020-07-29 01:28:47,672 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2020-07-29 01:28:47,672 INFO L688 BuchiCegarLoop]: Abstraction has 9 states and 11 transitions. [2020-07-29 01:28:47,673 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9 states and 11 transitions. [2020-07-29 01:28:47,673 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9 to 6. [2020-07-29 01:28:47,675 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-29 01:28:47,675 INFO L82 GeneralOperation]: Start isEquivalent. First operand 9 states and 11 transitions. Second operand 6 states. [2020-07-29 01:28:47,675 INFO L74 IsIncluded]: Start isIncluded. First operand 9 states and 11 transitions. Second operand 6 states. [2020-07-29 01:28:47,676 INFO L87 Difference]: Start difference. First operand 9 states and 11 transitions. Second operand 6 states. [2020-07-29 01:28:47,677 INFO L149 Difference]: Subtrahend was not deterministic. Recomputing result with determinization. [2020-07-29 01:28:47,679 INFO L93 Difference]: Finished difference Result 9 states and 11 transitions. [2020-07-29 01:28:47,680 INFO L276 IsEmpty]: Start isEmpty. Operand 9 states and 11 transitions. [2020-07-29 01:28:47,680 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-29 01:28:47,681 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-29 01:28:47,681 INFO L74 IsIncluded]: Start isIncluded. First operand 6 states. Second operand 9 states and 11 transitions. [2020-07-29 01:28:47,681 INFO L87 Difference]: Start difference. First operand 6 states. Second operand 9 states and 11 transitions. [2020-07-29 01:28:47,682 INFO L149 Difference]: Subtrahend was not deterministic. Recomputing result with determinization. [2020-07-29 01:28:47,684 INFO L93 Difference]: Finished difference Result 9 states and 11 transitions. [2020-07-29 01:28:47,685 INFO L276 IsEmpty]: Start isEmpty. Operand 9 states and 11 transitions. [2020-07-29 01:28:47,685 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-29 01:28:47,685 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-29 01:28:47,686 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-29 01:28:47,686 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-29 01:28:47,686 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2020-07-29 01:28:47,687 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 8 transitions. [2020-07-29 01:28:47,687 INFO L711 BuchiCegarLoop]: Abstraction has 6 states and 8 transitions. [2020-07-29 01:28:47,687 INFO L591 BuchiCegarLoop]: Abstraction has 6 states and 8 transitions. [2020-07-29 01:28:47,687 INFO L424 BuchiCegarLoop]: ======== Iteration 3============ [2020-07-29 01:28:47,688 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 6 states and 8 transitions. [2020-07-29 01:28:47,689 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2020-07-29 01:28:47,689 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 01:28:47,689 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 01:28:47,690 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2020-07-29 01:28:47,690 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2020-07-29 01:28:47,690 INFO L794 eck$LassoCheckResult]: Stem: 255#ULTIMATE.startENTRY havoc main_#res;havoc main_#t~nondet0, main_~x~0;havoc main_~x~0;main_~x~0 := main_#t~nondet0;havoc main_#t~nondet0; 256#L17-2 assume !!(0 != main_~x~0); 252#L17 [2020-07-29 01:28:47,691 INFO L796 eck$LassoCheckResult]: Loop: 252#L17 assume !(main_~x~0 > 0);main_~x~0 := 1 + main_~x~0; 251#L17-2 assume !!(0 != main_~x~0); 252#L17 [2020-07-29 01:28:47,691 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 01:28:47,691 INFO L82 PathProgramCache]: Analyzing trace with hash 1002, now seen corresponding path program 1 times [2020-07-29 01:28:47,692 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 01:28:47,692 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1669768283] [2020-07-29 01:28:47,692 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 01:28:47,703 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 01:28:47,704 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 01:28:47,719 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 01:28:47,719 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 01:28:47,721 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-07-29 01:28:47,723 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 01:28:47,724 INFO L82 PathProgramCache]: Analyzing trace with hash 1436, now seen corresponding path program 1 times [2020-07-29 01:28:47,724 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 01:28:47,725 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [42013281] [2020-07-29 01:28:47,725 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 01:28:47,733 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 01:28:47,736 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 01:28:47,740 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 01:28:47,741 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 01:28:47,742 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-07-29 01:28:47,743 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 01:28:47,744 INFO L82 PathProgramCache]: Analyzing trace with hash 963397, now seen corresponding path program 2 times [2020-07-29 01:28:47,744 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 01:28:47,744 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [395463803] [2020-07-29 01:28:47,745 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 01:28:47,752 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 01:28:47,752 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 01:28:47,759 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 01:28:47,759 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 01:28:47,763 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-07-29 01:28:47,790 INFO L210 LassoAnalysis]: Preferences: [2020-07-29 01:28:47,791 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2020-07-29 01:28:47,791 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2020-07-29 01:28:47,791 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2020-07-29 01:28:47,792 INFO L129 ssoRankerPreferences]: Use exernal solver: true [2020-07-29 01:28:47,792 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:28:47,792 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2020-07-29 01:28:47,792 INFO L132 ssoRankerPreferences]: Path of dumped script: [2020-07-29 01:28:47,792 INFO L133 ssoRankerPreferences]: Filename of dumped script: CookSeeZuleger-TACAS2013-Fig8a.c_Iteration3_Loop [2020-07-29 01:28:47,793 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2020-07-29 01:28:47,793 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2020-07-29 01:28:47,806 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,813 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,825 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:48,031 INFO L292 LassoAnalysis]: Preprocessing complete. [2020-07-29 01:28:48,031 INFO L404 LassoAnalysis]: Checking for nontermination... 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,035 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2020-07-29 01:28:48,035 INFO L160 nArgumentSynthesizer]: Using integer mode. [2020-07-29 01:28:48,040 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2020-07-29 01:28:48,040 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 20 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 20 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:28:48,068 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2020-07-29 01:28:48,068 INFO L160 nArgumentSynthesizer]: Using integer mode. 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) Waiting until toolchain timeout for monitored process 21 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:28:48,096 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2020-07-29 01:28:48,097 INFO L160 nArgumentSynthesizer]: Using integer mode. [2020-07-29 01:28:48,181 INFO L444 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2020-07-29 01:28:48,183 INFO L210 LassoAnalysis]: Preferences: [2020-07-29 01:28:48,184 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2020-07-29 01:28:48,184 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2020-07-29 01:28:48,184 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2020-07-29 01:28:48,184 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2020-07-29 01:28:48,184 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:28:48,184 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2020-07-29 01:28:48,184 INFO L132 ssoRankerPreferences]: Path of dumped script: [2020-07-29 01:28:48,184 INFO L133 ssoRankerPreferences]: Filename of dumped script: CookSeeZuleger-TACAS2013-Fig8a.c_Iteration3_Loop [2020-07-29 01:28:48,184 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2020-07-29 01:28:48,185 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2020-07-29 01:28:48,196 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:48,200 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:48,212 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:48,332 INFO L292 LassoAnalysis]: Preprocessing complete. [2020-07-29 01:28:48,332 INFO L489 LassoAnalysis]: Using template 'affine'. 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) Waiting until toolchain timeout for monitored process 22 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:28:48,336 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:48,337 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 01:28:48,338 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 01:28:48,338 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 01:28:48,338 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 01:28:48,340 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-07-29 01:28:48,340 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-07-29 01:28:48,345 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 23 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2020-07-29 01:28:48,373 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:48,375 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 01:28:48,375 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-07-29 01:28:48,375 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 01:28:48,376 INFO L204 nArgumentSynthesizer]: 2 loop disjuncts [2020-07-29 01:28:48,376 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 01:28:48,378 INFO L401 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2020-07-29 01:28:48,378 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. Waiting until toolchain timeout for monitored process 23 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:28:48,382 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2020-07-29 01:28:48,388 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2020-07-29 01:28:48,388 INFO L444 ModelExtractionUtils]: 0 out of 3 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 24 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2020-07-29 01:28:48,393 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... Waiting until toolchain timeout for monitored process 24 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:28:48,393 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2020-07-29 01:28:48,394 INFO L510 LassoAnalysis]: Proved termination. [2020-07-29 01:28:48,394 INFO L512 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~x~0) = -2*ULTIMATE.start_main_~x~0 + 1 Supporting invariants [] [2020-07-29 01:28:48,417 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2020-07-29 01:28:48,420 INFO L393 LassoCheck]: Loop: "assume !(main_~x~0 > 0);main_~x~0 := 1 + main_~x~0;" "assume !!(0 != main_~x~0);" [2020-07-29 01:28:48,427 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:28:48,453 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 01:28:48,455 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:28:48,456 INFO L263 TraceCheckSpWp]: Trace formula consists of 5 conjuncts, 2 conjunts are in the unsatisfiable core [2020-07-29 01:28:48,461 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:28:48,462 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-29 01:28:48,463 INFO L280 TraceCheckUtils]: 0: Hoare triple {306#unseeded} havoc main_#res;havoc main_#t~nondet0, main_~x~0;havoc main_~x~0;main_~x~0 := main_#t~nondet0;havoc main_#t~nondet0; {306#unseeded} is VALID [2020-07-29 01:28:48,464 INFO L280 TraceCheckUtils]: 1: Hoare triple {306#unseeded} assume !!(0 != main_~x~0); {306#unseeded} is VALID [2020-07-29 01:28:48,468 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:28:48,469 WARN L261 TraceCheckSpWp]: Trace formula consists of 6 conjuncts, 4 conjunts are in the unsatisfiable core [2020-07-29 01:28:48,477 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:28:48,478 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-29 01:28:48,558 INFO L280 TraceCheckUtils]: 0: Hoare triple {309#(>= oldRank0 (+ (* (- 2) ULTIMATE.start_main_~x~0) 1))} assume !(main_~x~0 > 0);main_~x~0 := 1 + main_~x~0; {327#(and (<= (+ (div (+ oldRank0 (- 1)) (- 2)) 1) ULTIMATE.start_main_~x~0) (<= (div (+ oldRank0 (- 1)) (- 2)) 0))} is VALID [2020-07-29 01:28:48,560 INFO L280 TraceCheckUtils]: 1: Hoare triple {327#(and (<= (+ (div (+ oldRank0 (- 1)) (- 2)) 1) ULTIMATE.start_main_~x~0) (<= (div (+ oldRank0 (- 1)) (- 2)) 0))} assume !!(0 != main_~x~0); {319#(or (and (> oldRank0 (+ (* (- 2) ULTIMATE.start_main_~x~0) 1)) (>= oldRank0 0)) unseeded)} is VALID [2020-07-29 01:28:48,561 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:48,561 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2020-07-29 01:28:48,567 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:48,568 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 2 letters. Loop has 2 letters. [2020-07-29 01:28:48,568 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:48,568 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:48,569 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 6 states and 8 transitions. cyclomatic complexity: 4 Second operand 3 states. [2020-07-29 01:28:48,601 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:48,602 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:48,602 INFO L123 tractBuchiDifference]: Start testing correctness of buchiDifferenceNCSBLazy3 [2020-07-29 01:28:48,602 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 6 states and 8 transitions. cyclomatic complexity: 4 [2020-07-29 01:28:48,602 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 01:28:48,602 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 01:28:48,602 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 3 states. [2020-07-29 01:28:48,606 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2020-07-29 01:28:48,606 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 01:28:48,606 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 01:28:48,607 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 11 states and 13 transitions. [2020-07-29 01:28:48,607 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2020-07-29 01:28:48,607 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 01:28:48,608 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 01:28:48,610 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 6 states and 8 transitions. cyclomatic complexity: 4 [2020-07-29 01:28:48,611 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 2 examples of accepted words. [2020-07-29 01:28:48,611 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 3 states. [2020-07-29 01:28:48,612 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2020-07-29 01:28:48,612 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 1 examples of accepted words. [2020-07-29 01:28:48,612 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 11 states and 13 transitions. cyclomatic complexity: 5 [2020-07-29 01:28:48,613 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 2 examples of accepted words. [2020-07-29 01:28:48,613 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:48,614 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:48,614 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 2 letters. Loop has 2 letters. [2020-07-29 01:28:48,614 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:48,614 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:48,615 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:48,615 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:48,615 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:48,615 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 1 letters. Loop has 1 letters. [2020-07-29 01:28:48,615 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:48,615 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:48,616 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:48,616 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:48,616 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:48,616 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 4 letters. Loop has 2 letters. [2020-07-29 01:28:48,617 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:48,617 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:48,617 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:48,617 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:48,618 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:48,618 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 11 letters. Loop has 11 letters. [2020-07-29 01:28:48,618 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:48,618 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:48,619 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:48,619 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:48,621 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:48,621 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 6 letters. Loop has 6 letters. [2020-07-29 01:28:48,621 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:48,622 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:48,622 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:48,622 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:48,622 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:48,623 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 3 letters. Loop has 3 letters. [2020-07-29 01:28:48,623 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:48,623 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:48,623 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:48,624 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:48,624 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:48,624 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 3 letters. Loop has 2 letters. [2020-07-29 01:28:48,624 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:48,625 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:48,625 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:48,625 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:48,625 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:48,625 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 2 letters. Loop has 2 letters. [2020-07-29 01:28:48,626 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:48,626 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:48,628 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:48,628 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:48,628 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:48,628 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 1 letters. Loop has 1 letters. [2020-07-29 01:28:48,629 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:48,629 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:48,629 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:48,629 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:48,629 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:48,630 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 4 letters. Loop has 2 letters. [2020-07-29 01:28:48,630 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:48,630 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:48,630 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:48,630 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:48,631 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:48,631 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 5 letters. Loop has 2 letters. [2020-07-29 01:28:48,631 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:48,631 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:48,631 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:48,632 INFO L161 tractBuchiDifference]: Finished testing correctness of buchiDifferenceNCSBLazy3 [2020-07-29 01:28:48,632 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-07-29 01:28:48,632 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 5 transitions. [2020-07-29 01:28:48,633 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 5 transitions. Stem has 2 letters. Loop has 2 letters. [2020-07-29 01:28:48,633 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:48,633 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 5 transitions. Stem has 4 letters. Loop has 2 letters. [2020-07-29 01:28:48,633 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:48,633 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 5 transitions. Stem has 2 letters. Loop has 4 letters. [2020-07-29 01:28:48,635 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:48,635 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 11 states and 13 transitions. cyclomatic complexity: 5 [2020-07-29 01:28:48,638 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2020-07-29 01:28:48,639 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 11 states to 7 states and 8 transitions. [2020-07-29 01:28:48,639 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 4 [2020-07-29 01:28:48,639 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 4 [2020-07-29 01:28:48,639 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 8 transitions. [2020-07-29 01:28:48,639 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2020-07-29 01:28:48,640 INFO L688 BuchiCegarLoop]: Abstraction has 7 states and 8 transitions. [2020-07-29 01:28:48,640 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7 states and 8 transitions. [2020-07-29 01:28:48,641 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7 to 6. [2020-07-29 01:28:48,641 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-29 01:28:48,641 INFO L82 GeneralOperation]: Start isEquivalent. First operand 7 states and 8 transitions. Second operand 6 states. [2020-07-29 01:28:48,641 INFO L74 IsIncluded]: Start isIncluded. First operand 7 states and 8 transitions. Second operand 6 states. [2020-07-29 01:28:48,642 INFO L87 Difference]: Start difference. First operand 7 states and 8 transitions. Second operand 6 states. [2020-07-29 01:28:48,642 INFO L149 Difference]: Subtrahend was not deterministic. Recomputing result with determinization. [2020-07-29 01:28:48,643 INFO L93 Difference]: Finished difference Result 8 states and 9 transitions. [2020-07-29 01:28:48,643 INFO L276 IsEmpty]: Start isEmpty. Operand 8 states and 9 transitions. [2020-07-29 01:28:48,644 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-29 01:28:48,644 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-29 01:28:48,644 INFO L74 IsIncluded]: Start isIncluded. First operand 6 states. Second operand 7 states and 8 transitions. [2020-07-29 01:28:48,644 INFO L87 Difference]: Start difference. First operand 6 states. Second operand 7 states and 8 transitions. [2020-07-29 01:28:48,645 INFO L149 Difference]: Subtrahend was not deterministic. Recomputing result with determinization. [2020-07-29 01:28:48,648 INFO L93 Difference]: Finished difference Result 8 states and 9 transitions. [2020-07-29 01:28:48,648 INFO L276 IsEmpty]: Start isEmpty. Operand 8 states and 9 transitions. [2020-07-29 01:28:48,649 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-29 01:28:48,649 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-29 01:28:48,649 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-29 01:28:48,649 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-29 01:28:48,649 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2020-07-29 01:28:48,650 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 7 transitions. [2020-07-29 01:28:48,650 INFO L711 BuchiCegarLoop]: Abstraction has 6 states and 7 transitions. [2020-07-29 01:28:48,650 INFO L591 BuchiCegarLoop]: Abstraction has 6 states and 7 transitions. [2020-07-29 01:28:48,651 INFO L424 BuchiCegarLoop]: ======== Iteration 4============ [2020-07-29 01:28:48,652 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 6 states and 7 transitions. [2020-07-29 01:28:48,652 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2020-07-29 01:28:48,653 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 01:28:48,653 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 01:28:48,653 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [2, 1, 1] [2020-07-29 01:28:48,654 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2020-07-29 01:28:48,654 INFO L794 eck$LassoCheckResult]: Stem: 353#ULTIMATE.startENTRY havoc main_#res;havoc main_#t~nondet0, main_~x~0;havoc main_~x~0;main_~x~0 := main_#t~nondet0;havoc main_#t~nondet0; 349#L17-2 assume !!(0 != main_~x~0); 350#L17 assume main_~x~0 > 0;main_~x~0 := main_~x~0 - 1; 351#L17-2 assume !!(0 != main_~x~0); 352#L17 [2020-07-29 01:28:48,654 INFO L796 eck$LassoCheckResult]: Loop: 352#L17 assume !(main_~x~0 > 0);main_~x~0 := 1 + main_~x~0; 354#L17-2 assume !!(0 != main_~x~0); 352#L17 [2020-07-29 01:28:48,655 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 01:28:48,655 INFO L82 PathProgramCache]: Analyzing trace with hash 963335, now seen corresponding path program 2 times [2020-07-29 01:28:48,655 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 01:28:48,656 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [903440227] [2020-07-29 01:28:48,657 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 01:28:48,674 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 01:28:48,676 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 01:28:48,685 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 01:28:48,687 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 01:28:48,691 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-07-29 01:28:48,693 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 01:28:48,693 INFO L82 PathProgramCache]: Analyzing trace with hash 1436, now seen corresponding path program 2 times [2020-07-29 01:28:48,694 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 01:28:48,694 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [753662777] [2020-07-29 01:28:48,694 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 01:28:48,700 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 01:28:48,701 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 01:28:48,707 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 01:28:48,709 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 01:28:48,711 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-07-29 01:28:48,713 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 01:28:48,714 INFO L82 PathProgramCache]: Analyzing trace with hash 925765410, now seen corresponding path program 2 times [2020-07-29 01:28:48,715 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 01:28:48,715 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2088213557] [2020-07-29 01:28:48,715 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 01:28:48,726 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:28:48,798 INFO L280 TraceCheckUtils]: 0: Hoare triple {404#true} havoc main_#res;havoc main_#t~nondet0, main_~x~0;havoc main_~x~0;main_~x~0 := main_#t~nondet0;havoc main_#t~nondet0; {404#true} is VALID [2020-07-29 01:28:48,798 INFO L280 TraceCheckUtils]: 1: Hoare triple {404#true} assume !!(0 != main_~x~0); {404#true} is VALID [2020-07-29 01:28:48,800 INFO L280 TraceCheckUtils]: 2: Hoare triple {404#true} assume main_~x~0 > 0;main_~x~0 := main_~x~0 - 1; {406#(<= 0 ULTIMATE.start_main_~x~0)} is VALID [2020-07-29 01:28:48,801 INFO L280 TraceCheckUtils]: 3: Hoare triple {406#(<= 0 ULTIMATE.start_main_~x~0)} assume !!(0 != main_~x~0); {407#(and (not (= 0 ULTIMATE.start_main_~x~0)) (<= 0 ULTIMATE.start_main_~x~0))} is VALID [2020-07-29 01:28:48,803 INFO L280 TraceCheckUtils]: 4: Hoare triple {407#(and (not (= 0 ULTIMATE.start_main_~x~0)) (<= 0 ULTIMATE.start_main_~x~0))} assume !(main_~x~0 > 0);main_~x~0 := 1 + main_~x~0; {405#false} is VALID [2020-07-29 01:28:48,803 INFO L280 TraceCheckUtils]: 5: Hoare triple {405#false} assume !!(0 != main_~x~0); {405#false} is VALID [2020-07-29 01:28:48,804 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:48,804 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2088213557] [2020-07-29 01:28:48,805 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-29 01:28:48,805 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-07-29 01:28:48,805 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [810093635] [2020-07-29 01:28:48,829 INFO L210 LassoAnalysis]: Preferences: [2020-07-29 01:28:48,829 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2020-07-29 01:28:48,830 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2020-07-29 01:28:48,830 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2020-07-29 01:28:48,830 INFO L129 ssoRankerPreferences]: Use exernal solver: true [2020-07-29 01:28:48,830 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:28:48,830 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2020-07-29 01:28:48,830 INFO L132 ssoRankerPreferences]: Path of dumped script: [2020-07-29 01:28:48,830 INFO L133 ssoRankerPreferences]: Filename of dumped script: CookSeeZuleger-TACAS2013-Fig8a.c_Iteration4_Loop [2020-07-29 01:28:48,831 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2020-07-29 01:28:48,831 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2020-07-29 01:28:48,841 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:48,847 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:48,858 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:48,981 INFO L292 LassoAnalysis]: Preprocessing complete. [2020-07-29 01:28:48,981 INFO L404 LassoAnalysis]: Checking for nontermination... 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) Waiting until toolchain timeout for monitored process 25 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:28:48,986 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2020-07-29 01:28:48,986 INFO L160 nArgumentSynthesizer]: Using integer mode. [2020-07-29 01:28:48,989 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2020-07-29 01:28:48,989 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {v_rep~unnamed0~0~true_7=1} Honda state: {v_rep~unnamed0~0~true_7=1} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 26 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 26 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:28:49,012 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2020-07-29 01:28:49,012 INFO L160 nArgumentSynthesizer]: Using integer mode. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 27 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 27 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:28:49,043 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2020-07-29 01:28:49,043 INFO L160 nArgumentSynthesizer]: Using integer mode. [2020-07-29 01:28:49,135 INFO L444 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2020-07-29 01:28:49,136 INFO L210 LassoAnalysis]: Preferences: [2020-07-29 01:28:49,136 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2020-07-29 01:28:49,136 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2020-07-29 01:28:49,137 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2020-07-29 01:28:49,137 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2020-07-29 01:28:49,137 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:28:49,137 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2020-07-29 01:28:49,137 INFO L132 ssoRankerPreferences]: Path of dumped script: [2020-07-29 01:28:49,137 INFO L133 ssoRankerPreferences]: Filename of dumped script: CookSeeZuleger-TACAS2013-Fig8a.c_Iteration4_Loop [2020-07-29 01:28:49,137 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2020-07-29 01:28:49,137 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2020-07-29 01:28:49,143 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:49,149 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:49,158 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 01:28:49,277 INFO L292 LassoAnalysis]: Preprocessing complete. [2020-07-29 01:28:49,277 INFO L489 LassoAnalysis]: Using template 'affine'. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 28 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 28 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:28:49,280 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:49,282 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 01:28:49,282 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 01:28:49,282 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 01:28:49,282 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 01:28:49,285 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-07-29 01:28:49,285 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-07-29 01:28:49,289 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 29 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 29 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:28:49,315 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:49,317 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 01:28:49,317 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-07-29 01:28:49,317 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 01:28:49,317 INFO L204 nArgumentSynthesizer]: 2 loop disjuncts [2020-07-29 01:28:49,317 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 01:28:49,319 INFO L401 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2020-07-29 01:28:49,319 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-07-29 01:28:49,323 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2020-07-29 01:28:49,330 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2020-07-29 01:28:49,330 INFO L444 ModelExtractionUtils]: 0 out of 3 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 30 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2020-07-29 01:28:49,333 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2020-07-29 01:28:49,334 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2020-07-29 01:28:49,334 INFO L510 LassoAnalysis]: Proved termination. [2020-07-29 01:28:49,334 INFO L512 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~x~0) = -2*ULTIMATE.start_main_~x~0 + 1 Supporting invariants [] Waiting until toolchain timeout for monitored process 30 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:28:49,367 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2020-07-29 01:28:49,370 INFO L393 LassoCheck]: Loop: "assume !(main_~x~0 > 0);main_~x~0 := 1 + main_~x~0;" "assume !!(0 != main_~x~0);" [2020-07-29 01:28:49,374 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:28:49,388 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 01:28:49,392 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:28:49,393 INFO L263 TraceCheckSpWp]: Trace formula consists of 9 conjuncts, 2 conjunts are in the unsatisfiable core [2020-07-29 01:28:49,396 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:28:49,396 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-29 01:28:49,399 INFO L280 TraceCheckUtils]: 0: Hoare triple {408#unseeded} havoc main_#res;havoc main_#t~nondet0, main_~x~0;havoc main_~x~0;main_~x~0 := main_#t~nondet0;havoc main_#t~nondet0; {408#unseeded} is VALID [2020-07-29 01:28:49,399 INFO L280 TraceCheckUtils]: 1: Hoare triple {408#unseeded} assume !!(0 != main_~x~0); {408#unseeded} is VALID [2020-07-29 01:28:49,400 INFO L280 TraceCheckUtils]: 2: Hoare triple {408#unseeded} assume main_~x~0 > 0;main_~x~0 := main_~x~0 - 1; {408#unseeded} is VALID [2020-07-29 01:28:49,401 INFO L280 TraceCheckUtils]: 3: Hoare triple {408#unseeded} assume !!(0 != main_~x~0); {408#unseeded} is VALID [2020-07-29 01:28:49,403 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:28:49,404 WARN L261 TraceCheckSpWp]: Trace formula consists of 6 conjuncts, 4 conjunts are in the unsatisfiable core [2020-07-29 01:28:49,406 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:28:49,406 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-29 01:28:49,486 INFO L280 TraceCheckUtils]: 0: Hoare triple {411#(>= oldRank0 (+ (* (- 2) ULTIMATE.start_main_~x~0) 1))} assume !(main_~x~0 > 0);main_~x~0 := 1 + main_~x~0; {435#(and (<= (+ (div (+ oldRank0 (- 1)) (- 2)) 1) ULTIMATE.start_main_~x~0) (<= (div (+ oldRank0 (- 1)) (- 2)) 0))} is VALID [2020-07-29 01:28:49,487 INFO L280 TraceCheckUtils]: 1: Hoare triple {435#(and (<= (+ (div (+ oldRank0 (- 1)) (- 2)) 1) ULTIMATE.start_main_~x~0) (<= (div (+ oldRank0 (- 1)) (- 2)) 0))} assume !!(0 != main_~x~0); {421#(or (and (> oldRank0 (+ (* (- 2) ULTIMATE.start_main_~x~0) 1)) (>= oldRank0 0)) unseeded)} is VALID [2020-07-29 01:28:49,487 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:49,487 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2020-07-29 01:28:49,492 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:49,492 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 4 letters. Loop has 2 letters. [2020-07-29 01:28:49,492 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:49,493 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:49,493 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 6 states and 7 transitions. cyclomatic complexity: 3 Second operand 3 states. [2020-07-29 01:28:49,513 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:49,513 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:49,513 INFO L123 tractBuchiDifference]: Start testing correctness of buchiDifferenceNCSBLazy3 [2020-07-29 01:28:49,513 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 6 states and 7 transitions. cyclomatic complexity: 3 [2020-07-29 01:28:49,513 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 01:28:49,513 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 01:28:49,513 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 3 states. [2020-07-29 01:28:49,514 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2020-07-29 01:28:49,514 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2020-07-29 01:28:49,514 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 7 states and 8 transitions. [2020-07-29 01:28:49,516 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2020-07-29 01:28:49,516 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 01:28:49,516 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 01:28:49,516 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 6 states and 7 transitions. cyclomatic complexity: 3 [2020-07-29 01:28:49,517 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 2 examples of accepted words. [2020-07-29 01:28:49,517 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 3 states. [2020-07-29 01:28:49,519 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2020-07-29 01:28:49,520 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 2 states and 2 transitions. cyclomatic complexity: 1 [2020-07-29 01:28:49,520 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2020-07-29 01:28:49,520 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 0 examples of accepted words. [2020-07-29 01:28:49,520 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 7 states and 8 transitions. cyclomatic complexity: 3 [2020-07-29 01:28:49,521 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 2 examples of accepted words. [2020-07-29 01:28:49,522 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:49,522 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:49,523 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 4 letters. Loop has 2 letters. [2020-07-29 01:28:49,523 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:49,523 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:49,523 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:49,523 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:49,524 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:49,524 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 4 letters. Loop has 2 letters. [2020-07-29 01:28:49,524 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:49,524 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:49,524 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:49,525 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:49,525 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:49,525 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 7 letters. Loop has 7 letters. [2020-07-29 01:28:49,525 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:49,525 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:49,526 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:49,526 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:49,526 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:49,527 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 6 letters. Loop has 6 letters. [2020-07-29 01:28:49,527 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:49,527 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:49,528 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:49,528 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:49,529 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:49,529 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 2 letters. Loop has 2 letters. [2020-07-29 01:28:49,529 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:49,529 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:49,530 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:49,530 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:49,530 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:49,530 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 4 letters. Loop has 2 letters. [2020-07-29 01:28:49,530 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:49,530 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:49,531 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:49,531 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:49,531 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:49,531 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 5 letters. Loop has 2 letters. [2020-07-29 01:28:49,531 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:49,532 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:49,532 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:49,532 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:49,532 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:49,533 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 5 letters. Loop has 2 letters. [2020-07-29 01:28:49,533 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:49,533 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:49,533 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:49,533 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:49,534 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:49,534 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 4 letters. Loop has 2 letters. [2020-07-29 01:28:49,534 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:49,534 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:49,534 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:49,535 INFO L161 tractBuchiDifference]: Finished testing correctness of buchiDifferenceNCSBLazy3 [2020-07-29 01:28:49,535 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-07-29 01:28:49,535 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 2 transitions. [2020-07-29 01:28:49,535 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 2 states and 2 transitions. Stem has 4 letters. Loop has 2 letters. [2020-07-29 01:28:49,536 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:49,536 INFO L639 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2020-07-29 01:28:49,548 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 01:28:49,552 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:28:49,553 INFO L263 TraceCheckSpWp]: Trace formula consists of 9 conjuncts, 2 conjunts are in the unsatisfiable core [2020-07-29 01:28:49,555 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:28:49,556 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-29 01:28:49,558 INFO L280 TraceCheckUtils]: 0: Hoare triple {408#unseeded} havoc main_#res;havoc main_#t~nondet0, main_~x~0;havoc main_~x~0;main_~x~0 := main_#t~nondet0;havoc main_#t~nondet0; {408#unseeded} is VALID [2020-07-29 01:28:49,559 INFO L280 TraceCheckUtils]: 1: Hoare triple {408#unseeded} assume !!(0 != main_~x~0); {408#unseeded} is VALID [2020-07-29 01:28:49,560 INFO L280 TraceCheckUtils]: 2: Hoare triple {408#unseeded} assume main_~x~0 > 0;main_~x~0 := main_~x~0 - 1; {408#unseeded} is VALID [2020-07-29 01:28:49,561 INFO L280 TraceCheckUtils]: 3: Hoare triple {408#unseeded} assume !!(0 != main_~x~0); {408#unseeded} is VALID [2020-07-29 01:28:49,564 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:28:49,564 WARN L261 TraceCheckSpWp]: Trace formula consists of 6 conjuncts, 4 conjunts are in the unsatisfiable core [2020-07-29 01:28:49,572 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:28:49,573 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-29 01:28:49,648 INFO L280 TraceCheckUtils]: 0: Hoare triple {411#(>= oldRank0 (+ (* (- 2) ULTIMATE.start_main_~x~0) 1))} assume !(main_~x~0 > 0);main_~x~0 := 1 + main_~x~0; {463#(and (<= (+ (div (+ oldRank0 (- 1)) (- 2)) 1) ULTIMATE.start_main_~x~0) (<= (div (+ oldRank0 (- 1)) (- 2)) 0))} is VALID [2020-07-29 01:28:49,650 INFO L280 TraceCheckUtils]: 1: Hoare triple {463#(and (<= (+ (div (+ oldRank0 (- 1)) (- 2)) 1) ULTIMATE.start_main_~x~0) (<= (div (+ oldRank0 (- 1)) (- 2)) 0))} assume !!(0 != main_~x~0); {421#(or (and (> oldRank0 (+ (* (- 2) ULTIMATE.start_main_~x~0) 1)) (>= oldRank0 0)) unseeded)} is VALID [2020-07-29 01:28:49,650 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:49,650 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2020-07-29 01:28:49,655 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:49,655 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 4 letters. Loop has 2 letters. [2020-07-29 01:28:49,655 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:49,655 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:49,656 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 6 states and 7 transitions. cyclomatic complexity: 3 Second operand 3 states. [2020-07-29 01:28:49,664 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:49,664 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:49,664 INFO L123 tractBuchiDifference]: Start testing correctness of buchiDifferenceNCSBLazy3 [2020-07-29 01:28:49,664 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 6 states and 7 transitions. cyclomatic complexity: 3 [2020-07-29 01:28:49,665 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 01:28:49,665 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 01:28:49,665 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 3 states. [2020-07-29 01:28:49,665 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2020-07-29 01:28:49,665 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2020-07-29 01:28:49,665 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 7 states and 8 transitions. [2020-07-29 01:28:49,666 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2020-07-29 01:28:49,666 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 01:28:49,666 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 01:28:49,667 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 6 states and 7 transitions. cyclomatic complexity: 3 [2020-07-29 01:28:49,667 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 2 examples of accepted words. [2020-07-29 01:28:49,667 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 3 states. [2020-07-29 01:28:49,667 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2020-07-29 01:28:49,667 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 2 states and 2 transitions. cyclomatic complexity: 1 [2020-07-29 01:28:49,667 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2020-07-29 01:28:49,668 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 0 examples of accepted words. [2020-07-29 01:28:49,668 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 7 states and 8 transitions. cyclomatic complexity: 3 [2020-07-29 01:28:49,668 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 2 examples of accepted words. [2020-07-29 01:28:49,668 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:49,668 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:49,669 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 4 letters. Loop has 2 letters. [2020-07-29 01:28:49,669 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:49,669 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:49,669 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:49,670 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:49,670 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:49,670 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 4 letters. Loop has 2 letters. [2020-07-29 01:28:49,671 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:49,671 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:49,671 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:49,671 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:49,672 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:49,672 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 7 letters. Loop has 7 letters. [2020-07-29 01:28:49,672 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:49,672 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:49,672 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:49,673 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:49,673 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:49,673 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 6 letters. Loop has 6 letters. [2020-07-29 01:28:49,673 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:49,673 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:49,674 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:49,674 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:49,674 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:49,674 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 2 letters. Loop has 2 letters. [2020-07-29 01:28:49,674 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:49,675 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:49,675 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:49,675 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:49,675 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:49,676 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 4 letters. Loop has 2 letters. [2020-07-29 01:28:49,676 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:49,676 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:49,676 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:49,676 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:49,677 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:49,677 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 5 letters. Loop has 2 letters. [2020-07-29 01:28:49,677 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:49,677 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:49,677 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:49,678 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:49,678 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:49,678 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 4 letters. Loop has 2 letters. [2020-07-29 01:28:49,678 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:49,679 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:49,679 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:49,679 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:49,679 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:49,679 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 5 letters. Loop has 2 letters. [2020-07-29 01:28:49,680 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:49,680 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:49,680 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:49,680 INFO L161 tractBuchiDifference]: Finished testing correctness of buchiDifferenceNCSBLazy3 [2020-07-29 01:28:49,681 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-07-29 01:28:49,681 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 2 transitions. [2020-07-29 01:28:49,681 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 2 states and 2 transitions. Stem has 4 letters. Loop has 2 letters. [2020-07-29 01:28:49,681 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:49,682 INFO L639 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2020-07-29 01:28:49,701 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 01:28:49,707 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:28:49,708 INFO L263 TraceCheckSpWp]: Trace formula consists of 9 conjuncts, 2 conjunts are in the unsatisfiable core [2020-07-29 01:28:49,711 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:28:49,711 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-29 01:28:49,714 INFO L280 TraceCheckUtils]: 0: Hoare triple {408#unseeded} havoc main_#res;havoc main_#t~nondet0, main_~x~0;havoc main_~x~0;main_~x~0 := main_#t~nondet0;havoc main_#t~nondet0; {408#unseeded} is VALID [2020-07-29 01:28:49,715 INFO L280 TraceCheckUtils]: 1: Hoare triple {408#unseeded} assume !!(0 != main_~x~0); {408#unseeded} is VALID [2020-07-29 01:28:49,716 INFO L280 TraceCheckUtils]: 2: Hoare triple {408#unseeded} assume main_~x~0 > 0;main_~x~0 := main_~x~0 - 1; {408#unseeded} is VALID [2020-07-29 01:28:49,716 INFO L280 TraceCheckUtils]: 3: Hoare triple {408#unseeded} assume !!(0 != main_~x~0); {408#unseeded} is VALID [2020-07-29 01:28:49,719 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:28:49,720 WARN L261 TraceCheckSpWp]: Trace formula consists of 6 conjuncts, 4 conjunts are in the unsatisfiable core [2020-07-29 01:28:49,723 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:28:49,723 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-29 01:28:49,810 INFO L280 TraceCheckUtils]: 0: Hoare triple {411#(>= oldRank0 (+ (* (- 2) ULTIMATE.start_main_~x~0) 1))} assume !(main_~x~0 > 0);main_~x~0 := 1 + main_~x~0; {491#(and (<= (+ (div (+ oldRank0 (- 1)) (- 2)) 1) ULTIMATE.start_main_~x~0) (<= (div (+ oldRank0 (- 1)) (- 2)) 0))} is VALID [2020-07-29 01:28:49,811 INFO L280 TraceCheckUtils]: 1: Hoare triple {491#(and (<= (+ (div (+ oldRank0 (- 1)) (- 2)) 1) ULTIMATE.start_main_~x~0) (<= (div (+ oldRank0 (- 1)) (- 2)) 0))} assume !!(0 != main_~x~0); {421#(or (and (> oldRank0 (+ (* (- 2) ULTIMATE.start_main_~x~0) 1)) (>= oldRank0 0)) unseeded)} is VALID [2020-07-29 01:28:49,811 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:49,812 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2020-07-29 01:28:49,816 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:49,816 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 4 letters. Loop has 2 letters. [2020-07-29 01:28:49,816 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:49,816 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:49,816 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 6 states and 7 transitions. cyclomatic complexity: 3 Second operand 3 states. [2020-07-29 01:28:49,841 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:49,841 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:49,841 INFO L123 tractBuchiDifference]: Start testing correctness of buchiDifferenceNCSBLazy3 [2020-07-29 01:28:49,842 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 6 states and 7 transitions. cyclomatic complexity: 3 [2020-07-29 01:28:49,842 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 01:28:49,842 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 01:28:49,842 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 3 states. [2020-07-29 01:28:49,843 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2020-07-29 01:28:49,844 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 01:28:49,844 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 01:28:49,844 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 8 states and 9 transitions. [2020-07-29 01:28:49,844 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2020-07-29 01:28:49,844 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2020-07-29 01:28:49,845 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 6 states and 7 transitions. cyclomatic complexity: 3 [2020-07-29 01:28:49,845 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 2 examples of accepted words. [2020-07-29 01:28:49,845 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 3 states. [2020-07-29 01:28:49,845 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2020-07-29 01:28:49,846 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 1 examples of accepted words. [2020-07-29 01:28:49,846 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 8 states and 9 transitions. cyclomatic complexity: 3 [2020-07-29 01:28:49,846 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 8 states and 9 transitions. cyclomatic complexity: 3 [2020-07-29 01:28:49,846 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2020-07-29 01:28:49,846 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 0 examples of accepted words. [2020-07-29 01:28:49,846 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:49,846 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:49,846 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 4 letters. Loop has 2 letters. [2020-07-29 01:28:49,847 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:49,847 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:49,847 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:49,847 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:49,847 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:49,847 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 1 letters. Loop has 1 letters. [2020-07-29 01:28:49,847 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:49,847 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:49,848 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:49,848 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:49,848 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:49,848 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 8 letters. Loop has 8 letters. [2020-07-29 01:28:49,848 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:49,848 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:49,848 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:49,848 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:49,848 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:49,849 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 6 letters. Loop has 6 letters. [2020-07-29 01:28:49,849 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:49,849 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:49,849 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:49,849 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:49,849 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:49,849 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 3 letters. Loop has 3 letters. [2020-07-29 01:28:49,849 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:49,849 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:49,849 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:49,850 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:49,850 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:49,850 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 4 letters. Loop has 2 letters. [2020-07-29 01:28:49,850 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:49,850 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:49,850 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:49,850 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:49,851 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:49,851 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 5 letters. Loop has 2 letters. [2020-07-29 01:28:49,851 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:49,851 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:49,851 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:49,851 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:49,851 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:49,851 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 1 letters. Loop has 1 letters. [2020-07-29 01:28:49,852 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:49,852 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:49,852 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:49,852 INFO L161 tractBuchiDifference]: Finished testing correctness of buchiDifferenceNCSBLazy3 [2020-07-29 01:28:49,852 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-07-29 01:28:49,853 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 8 transitions. [2020-07-29 01:28:49,853 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 8 transitions. Stem has 4 letters. Loop has 2 letters. [2020-07-29 01:28:49,853 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:49,853 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 8 transitions. Stem has 6 letters. Loop has 2 letters. [2020-07-29 01:28:49,853 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:49,853 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 8 transitions. Stem has 4 letters. Loop has 4 letters. [2020-07-29 01:28:49,854 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:49,854 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 8 states and 9 transitions. cyclomatic complexity: 3 [2020-07-29 01:28:49,854 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2020-07-29 01:28:49,855 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 8 states to 0 states and 0 transitions. [2020-07-29 01:28:49,855 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2020-07-29 01:28:49,855 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2020-07-29 01:28:49,855 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2020-07-29 01:28:49,855 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-07-29 01:28:49,855 INFO L688 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2020-07-29 01:28:49,855 INFO L711 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2020-07-29 01:28:49,855 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-29 01:28:49,856 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-07-29 01:28:49,856 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2020-07-29 01:28:49,856 INFO L87 Difference]: Start difference. First operand 0 states and 0 transitions. Second operand 4 states. [2020-07-29 01:28:49,856 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-29 01:28:49,856 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2020-07-29 01:28:49,856 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2020-07-29 01:28:49,856 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states. [2020-07-29 01:28:49,863 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:49,863 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 0 states and 0 transitions. [2020-07-29 01:28:49,863 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2020-07-29 01:28:49,863 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 0 states to 0 states and 0 transitions. [2020-07-29 01:28:49,863 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2020-07-29 01:28:49,863 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2020-07-29 01:28:49,863 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2020-07-29 01:28:49,863 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-07-29 01:28:49,864 INFO L688 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2020-07-29 01:28:49,864 INFO L711 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2020-07-29 01:28:49,864 INFO L591 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2020-07-29 01:28:49,864 INFO L424 BuchiCegarLoop]: ======== Iteration 5============ [2020-07-29 01:28:49,864 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2020-07-29 01:28:49,864 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2020-07-29 01:28:49,864 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2020-07-29 01:28:49,870 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 29.07 01:28:49 BoogieIcfgContainer [2020-07-29 01:28:49,871 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2020-07-29 01:28:49,871 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2020-07-29 01:28:49,871 INFO L271 PluginConnector]: Initializing Witness Printer... [2020-07-29 01:28:49,871 INFO L275 PluginConnector]: Witness Printer initialized [2020-07-29 01:28:49,872 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:49,876 INFO L140 WitnessPrinter]: No result that supports witness generation found [2020-07-29 01:28:49,876 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2020-07-29 01:28:49,878 INFO L168 Benchmark]: Toolchain (without parser) took 5601.30 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 939.7 MB in the end (delta: 20.6 MB). Peak memory consumption was 226.6 MB. Max. memory is 11.5 GB. [2020-07-29 01:28:49,879 INFO L168 Benchmark]: CDTParser took 0.32 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:49,880 INFO L168 Benchmark]: CACSL2BoogieTranslator took 232.79 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:49,880 INFO L168 Benchmark]: Boogie Procedure Inliner took 34.98 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:49,881 INFO L168 Benchmark]: Boogie Preprocessor took 83.67 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 125.3 MB). Free memory was 949.5 MB in the beginning and 1.1 GB in the end (delta: -172.0 MB). Peak memory consumption was 9.8 MB. Max. memory is 11.5 GB. [2020-07-29 01:28:49,881 INFO L168 Benchmark]: RCFGBuilder took 280.45 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: 25.7 MB). Peak memory consumption was 25.7 MB. Max. memory is 11.5 GB. [2020-07-29 01:28:49,882 INFO L168 Benchmark]: BuchiAutomizer took 4957.04 ms. Allocated memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 80.7 MB). Free memory was 1.1 GB in the beginning and 939.7 MB in the end (delta: 156.1 MB). Peak memory consumption was 236.9 MB. Max. memory is 11.5 GB. [2020-07-29 01:28:49,883 INFO L168 Benchmark]: Witness Printer took 4.80 ms. Allocated memory is still 1.2 GB. Free memory is still 939.7 MB. There was no memory consumed. Max. memory is 11.5 GB. [2020-07-29 01:28:49,886 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.32 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 232.79 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 34.98 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 83.67 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 125.3 MB). Free memory was 949.5 MB in the beginning and 1.1 GB in the end (delta: -172.0 MB). Peak memory consumption was 9.8 MB. Max. memory is 11.5 GB. * RCFGBuilder took 280.45 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: 25.7 MB). Peak memory consumption was 25.7 MB. Max. memory is 11.5 GB. * BuchiAutomizer took 4957.04 ms. Allocated memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 80.7 MB). Free memory was 1.1 GB in the beginning and 939.7 MB in the end (delta: 156.1 MB). Peak memory consumption was 236.9 MB. Max. memory is 11.5 GB. * Witness Printer took 4.80 ms. Allocated memory is still 1.2 GB. Free memory is still 939.7 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 and consists of 4 locations. One deterministic module has affine ranking function x and consists of 3 locations. One deterministic module has affine ranking function -2 * x + 1 and consists of 3 locations. One nondeterministic module has affine ranking function -2 * x + 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 4.9s and 5 iterations. TraceHistogramMax:2. Analysis of lassos took 3.6s. 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: 32ms VariablesStem: 1 VariablesLoop: 0 DisjunctsStem: 1 DisjunctsLoop: 1 SupportingInvariants: 2 MotzkinApplications: 6 LassoTerminationAnalysisBenchmarks: LassoNonterminationAnalysisSatFixpoint: 6 LassoNonterminationAnalysisSatUnbounded: 0 LassoNonterminationAnalysisUnsat: 4 LassoNonterminationAnalysisUnknown: 0 LassoNonterminationAnalysisTime: 0.5s - TerminationAnalysisResult: Termination proven Buchi Automizer proved that your program is terminating RESULT: Ultimate proved your program to be correct! Received shutdown request...