./Ultimate.py --spec ../sv-benchmarks/c/properties/termination.prp --file ../sv-benchmarks/c/termination-crafted-lit/CookSeeZuleger-TACAS2013-Fig8b.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-Fig8b.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 413fc6a41e04b7b618ff9ab274418b4a8dcf040d ...................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... 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:43,940 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-07-29 01:28:43,942 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-07-29 01:28:43,961 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-07-29 01:28:43,961 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-07-29 01:28:43,963 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-07-29 01:28:43,965 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-07-29 01:28:43,975 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-07-29 01:28:43,980 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-07-29 01:28:43,983 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-07-29 01:28:43,985 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-07-29 01:28:43,986 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-07-29 01:28:43,987 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-07-29 01:28:43,990 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-07-29 01:28:43,991 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-07-29 01:28:43,992 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-07-29 01:28:43,994 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-07-29 01:28:43,995 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-07-29 01:28:43,997 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-07-29 01:28:44,001 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-07-29 01:28:44,006 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-07-29 01:28:44,010 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-07-29 01:28:44,011 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-07-29 01:28:44,013 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-07-29 01:28:44,015 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-07-29 01:28:44,015 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-07-29 01:28:44,016 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-07-29 01:28:44,017 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-07-29 01:28:44,018 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-07-29 01:28:44,019 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-07-29 01:28:44,019 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-07-29 01:28:44,021 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-07-29 01:28:44,021 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-07-29 01:28:44,022 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-07-29 01:28:44,023 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-07-29 01:28:44,024 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-07-29 01:28:44,024 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-07-29 01:28:44,024 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-07-29 01:28:44,025 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-07-29 01:28:44,025 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-07-29 01:28:44,027 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-07-29 01:28:44,027 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:44,066 INFO L113 SettingsManager]: Loading preferences was successful [2020-07-29 01:28:44,067 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-07-29 01:28:44,070 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2020-07-29 01:28:44,070 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2020-07-29 01:28:44,070 INFO L138 SettingsManager]: * Use SBE=true [2020-07-29 01:28:44,071 INFO L136 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2020-07-29 01:28:44,071 INFO L138 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2020-07-29 01:28:44,071 INFO L138 SettingsManager]: * Use old map elimination=false [2020-07-29 01:28:44,071 INFO L138 SettingsManager]: * Use external solver (rank synthesis)=false [2020-07-29 01:28:44,072 INFO L138 SettingsManager]: * Use only trivial implications for array writes=true [2020-07-29 01:28:44,072 INFO L138 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2020-07-29 01:28:44,072 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-07-29 01:28:44,073 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2020-07-29 01:28:44,073 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-07-29 01:28:44,073 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-07-29 01:28:44,073 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2020-07-29 01:28:44,074 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2020-07-29 01:28:44,074 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2020-07-29 01:28:44,074 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-07-29 01:28:44,074 INFO L138 SettingsManager]: * Assume nondeterminstic values are in range=false [2020-07-29 01:28:44,074 INFO L138 SettingsManager]: * Use constant arrays=true [2020-07-29 01:28:44,075 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2020-07-29 01:28:44,075 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-07-29 01:28:44,076 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2020-07-29 01:28:44,076 INFO L138 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2020-07-29 01:28:44,076 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-07-29 01:28:44,076 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2020-07-29 01:28:44,076 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2020-07-29 01:28:44,077 INFO L138 SettingsManager]: * Dump automata to the following directory=/home/matthias/ultimate/dump/auto [2020-07-29 01:28:44,078 INFO L136 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2020-07-29 01:28:44,079 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 -> 413fc6a41e04b7b618ff9ab274418b4a8dcf040d [2020-07-29 01:28:44,371 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2020-07-29 01:28:44,387 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-07-29 01:28:44,392 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-07-29 01:28:44,396 INFO L271 PluginConnector]: Initializing CDTParser... [2020-07-29 01:28:44,397 INFO L275 PluginConnector]: CDTParser initialized [2020-07-29 01:28:44,398 INFO L429 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/termination-crafted-lit/CookSeeZuleger-TACAS2013-Fig8b.c [2020-07-29 01:28:44,475 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/994f365bb/e098756c228f40949aac5b2166bdcf94/FLAG4e55e4f49 [2020-07-29 01:28:44,925 INFO L306 CDTParser]: Found 1 translation units. [2020-07-29 01:28:44,926 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/termination-crafted-lit/CookSeeZuleger-TACAS2013-Fig8b.c [2020-07-29 01:28:44,933 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/994f365bb/e098756c228f40949aac5b2166bdcf94/FLAG4e55e4f49 [2020-07-29 01:28:45,325 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/994f365bb/e098756c228f40949aac5b2166bdcf94 [2020-07-29 01:28:45,329 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-07-29 01:28:45,332 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2020-07-29 01:28:45,335 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-07-29 01:28:45,335 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-07-29 01:28:45,339 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-07-29 01:28:45,340 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 29.07 01:28:45" (1/1) ... [2020-07-29 01:28:45,343 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@82c6bb1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.07 01:28:45, skipping insertion in model container [2020-07-29 01:28:45,343 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 29.07 01:28:45" (1/1) ... [2020-07-29 01:28:45,351 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-07-29 01:28:45,369 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-07-29 01:28:45,572 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-07-29 01:28:45,578 INFO L203 MainTranslator]: Completed pre-run [2020-07-29 01:28:45,594 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-07-29 01:28:45,610 INFO L208 MainTranslator]: Completed translation [2020-07-29 01:28:45,610 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.07 01:28:45 WrapperNode [2020-07-29 01:28:45,610 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-07-29 01:28:45,611 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2020-07-29 01:28:45,611 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2020-07-29 01:28:45,611 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2020-07-29 01:28:45,622 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:45" (1/1) ... [2020-07-29 01:28:45,627 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:45" (1/1) ... [2020-07-29 01:28:45,705 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2020-07-29 01:28:45,706 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-07-29 01:28:45,706 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-07-29 01:28:45,706 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-07-29 01:28:45,715 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:45" (1/1) ... [2020-07-29 01:28:45,716 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:45" (1/1) ... [2020-07-29 01:28:45,716 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:45" (1/1) ... [2020-07-29 01:28:45,717 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:45" (1/1) ... [2020-07-29 01:28:45,719 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:45" (1/1) ... [2020-07-29 01:28:45,724 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:45" (1/1) ... [2020-07-29 01:28:45,725 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:45" (1/1) ... [2020-07-29 01:28:45,726 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-07-29 01:28:45,726 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-07-29 01:28:45,727 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-07-29 01:28:45,727 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-07-29 01:28:45,728 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.07 01:28:45" (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:45,790 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-07-29 01:28:45,791 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-07-29 01:28:46,001 INFO L290 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-07-29 01:28:46,005 INFO L295 CfgBuilder]: Removed 5 assume(true) statements. [2020-07-29 01:28:46,014 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.07 01:28:46 BoogieIcfgContainer [2020-07-29 01:28:46,017 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-07-29 01:28:46,018 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2020-07-29 01:28:46,019 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2020-07-29 01:28:46,027 INFO L275 PluginConnector]: BuchiAutomizer initialized [2020-07-29 01:28:46,028 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2020-07-29 01:28:46,033 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 29.07 01:28:45" (1/3) ... [2020-07-29 01:28:46,038 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@3bd319ad and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 29.07 01:28:46, skipping insertion in model container [2020-07-29 01:28:46,038 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2020-07-29 01:28:46,038 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.07 01:28:45" (2/3) ... [2020-07-29 01:28:46,039 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@3bd319ad and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 29.07 01:28:46, skipping insertion in model container [2020-07-29 01:28:46,039 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2020-07-29 01:28:46,039 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.07 01:28:46" (3/3) ... [2020-07-29 01:28:46,041 INFO L371 chiAutomizerObserver]: Analyzing ICFG CookSeeZuleger-TACAS2013-Fig8b.c [2020-07-29 01:28:46,109 INFO L356 BuchiCegarLoop]: Interprodecural is true [2020-07-29 01:28:46,109 INFO L357 BuchiCegarLoop]: Hoare is false [2020-07-29 01:28:46,110 INFO L358 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2020-07-29 01:28:46,110 INFO L359 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2020-07-29 01:28:46,110 INFO L360 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-07-29 01:28:46,110 INFO L361 BuchiCegarLoop]: Difference is false [2020-07-29 01:28:46,110 INFO L362 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-07-29 01:28:46,110 INFO L365 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2020-07-29 01:28:46,122 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 8 states. [2020-07-29 01:28:46,144 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2020-07-29 01:28:46,144 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 01:28:46,145 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 01:28:46,150 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2020-07-29 01:28:46,150 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2020-07-29 01:28:46,150 INFO L424 BuchiCegarLoop]: ======== Iteration 1============ [2020-07-29 01:28:46,150 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 8 states. [2020-07-29 01:28:46,152 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2020-07-29 01:28:46,153 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 01:28:46,153 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 01:28:46,153 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2020-07-29 01:28:46,153 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2020-07-29 01:28:46,160 INFO L794 eck$LassoCheckResult]: Stem: 4#ULTIMATE.startENTRYtrue havoc main_#res;havoc main_#t~nondet0, main_#t~nondet1, main_~x~0, main_~M~0;havoc main_~x~0;havoc main_~M~0;main_~x~0 := main_#t~nondet0;havoc main_#t~nondet0;main_~M~0 := main_#t~nondet1;havoc main_#t~nondet1; 6#L17true assume main_~M~0 > 0; 7#L19-2true [2020-07-29 01:28:46,161 INFO L796 eck$LassoCheckResult]: Loop: 7#L19-2true assume !!(main_~x~0 != main_~M~0); 9#L19true assume main_~x~0 > main_~M~0;main_~x~0 := 0; 7#L19-2true [2020-07-29 01:28:46,167 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 01:28:46,167 INFO L82 PathProgramCache]: Analyzing trace with hash 996, now seen corresponding path program 1 times [2020-07-29 01:28:46,177 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 01:28:46,178 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1155217257] [2020-07-29 01:28:46,178 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 01:28:46,244 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 01:28:46,245 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 01:28:46,249 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 01:28:46,249 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 01:28:46,264 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-07-29 01:28:46,265 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 01:28:46,265 INFO L82 PathProgramCache]: Analyzing trace with hash 1380, now seen corresponding path program 1 times [2020-07-29 01:28:46,266 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 01:28:46,266 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1813362077] [2020-07-29 01:28:46,266 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 01:28:46,276 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 01:28:46,277 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 01:28:46,280 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 01:28:46,280 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 01:28:46,282 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-07-29 01:28:46,284 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 01:28:46,284 INFO L82 PathProgramCache]: Analyzing trace with hash 957575, now seen corresponding path program 1 times [2020-07-29 01:28:46,284 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 01:28:46,285 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1356560692] [2020-07-29 01:28:46,285 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 01:28:46,292 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 01:28:46,292 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 01:28:46,297 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 01:28:46,298 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 01:28:46,300 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-07-29 01:28:46,430 INFO L210 LassoAnalysis]: Preferences: [2020-07-29 01:28:46,431 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2020-07-29 01:28:46,431 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2020-07-29 01:28:46,431 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2020-07-29 01:28:46,431 INFO L129 ssoRankerPreferences]: Use exernal solver: true [2020-07-29 01:28:46,432 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:28:46,432 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2020-07-29 01:28:46,432 INFO L132 ssoRankerPreferences]: Path of dumped script: [2020-07-29 01:28:46,432 INFO L133 ssoRankerPreferences]: Filename of dumped script: CookSeeZuleger-TACAS2013-Fig8b.c_Iteration1_Lasso [2020-07-29 01:28:46,432 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2020-07-29 01:28:46,432 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2020-07-29 01:28:46,462 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,471 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,493 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,502 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,508 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,513 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,746 INFO L292 LassoAnalysis]: Preprocessing complete. [2020-07-29 01:28:46,747 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) [2020-07-29 01:28:46,753 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2020-07-29 01:28:46,754 INFO L160 nArgumentSynthesizer]: Using integer mode. Waiting until toolchain timeout for monitored process 2 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:28:46,761 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2020-07-29 01:28:46,762 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_main_#t~nondet0=0} Honda state: {ULTIMATE.start_main_#t~nondet0=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) Waiting until toolchain timeout for monitored process 3 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:28:46,797 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2020-07-29 01:28:46,797 INFO L160 nArgumentSynthesizer]: Using integer mode. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:28:46,827 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2020-07-29 01:28:46,827 INFO L160 nArgumentSynthesizer]: Using integer mode. [2020-07-29 01:28:46,927 INFO L444 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2020-07-29 01:28:46,929 INFO L210 LassoAnalysis]: Preferences: [2020-07-29 01:28:46,930 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2020-07-29 01:28:46,930 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2020-07-29 01:28:46,930 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2020-07-29 01:28:46,930 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2020-07-29 01:28:46,931 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:28:46,931 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2020-07-29 01:28:46,931 INFO L132 ssoRankerPreferences]: Path of dumped script: [2020-07-29 01:28:46,931 INFO L133 ssoRankerPreferences]: Filename of dumped script: CookSeeZuleger-TACAS2013-Fig8b.c_Iteration1_Lasso [2020-07-29 01:28:46,931 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2020-07-29 01:28:46,931 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2020-07-29 01:28:46,946 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,953 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,965 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,970 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,976 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,982 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,147 INFO L292 LassoAnalysis]: Preprocessing complete. [2020-07-29 01:28:47,154 INFO L489 LassoAnalysis]: Using template 'affine'. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:28:47,160 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,164 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 01:28:47,164 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 01:28:47,165 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 01:28:47,165 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 01:28:47,171 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-07-29 01:28:47,172 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-07-29 01:28:47,178 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 6 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2020-07-29 01:28:47,224 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 6 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:28:47,226 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 01:28:47,227 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 01:28:47,227 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 01:28:47,227 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 01:28:47,233 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-07-29 01:28:47,234 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-07-29 01:28:47,243 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2020-07-29 01:28:47,257 INFO L443 ModelExtractionUtils]: Simplification made 6 calls to the SMT solver. [2020-07-29 01:28:47,257 INFO L444 ModelExtractionUtils]: 3 out of 10 variables were initially zero. Simplification set additionally 3 variables to zero. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 7 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2020-07-29 01:28:47,272 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... Waiting until toolchain timeout for monitored process 7 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:28:47,277 INFO L438 nArgumentSynthesizer]: Removed 1 redundant supporting invariants from a total of 2. [2020-07-29 01:28:47,278 INFO L510 LassoAnalysis]: Proved termination. [2020-07-29 01:28:47,279 INFO L512 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~M~0, ULTIMATE.start_main_~x~0) = -1*ULTIMATE.start_main_~M~0 + 1*ULTIMATE.start_main_~x~0 Supporting invariants [1*ULTIMATE.start_main_~M~0 >= 0] [2020-07-29 01:28:47,324 INFO L297 tatePredicateManager]: 0 out of 1 supporting invariants were superfluous and have been removed [2020-07-29 01:28:47,330 INFO L393 LassoCheck]: Loop: "assume !!(main_~x~0 != main_~M~0);" "assume main_~x~0 > main_~M~0;main_~x~0 := 0;" [2020-07-29 01:28:47,335 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:28:47,378 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 01:28:47,387 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:28:47,390 INFO L263 TraceCheckSpWp]: Trace formula consists of 7 conjuncts, 3 conjunts are in the unsatisfiable core [2020-07-29 01:28:47,395 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:28:47,396 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-29 01:28:47,409 INFO L280 TraceCheckUtils]: 0: Hoare triple {18#unseeded} havoc main_#res;havoc main_#t~nondet0, main_#t~nondet1, main_~x~0, main_~M~0;havoc main_~x~0;havoc main_~M~0;main_~x~0 := main_#t~nondet0;havoc main_#t~nondet0;main_~M~0 := main_#t~nondet1;havoc main_#t~nondet1; {18#unseeded} is VALID [2020-07-29 01:28:47,411 INFO L280 TraceCheckUtils]: 1: Hoare triple {18#unseeded} assume main_~M~0 > 0; {37#(and (>= ULTIMATE.start_main_~M~0 0) unseeded)} is VALID [2020-07-29 01:28:47,416 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:28:47,417 WARN L261 TraceCheckSpWp]: Trace formula consists of 7 conjuncts, 5 conjunts are in the unsatisfiable core [2020-07-29 01:28:47,422 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:28:47,423 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-29 01:28:47,427 INFO L280 TraceCheckUtils]: 0: Hoare triple {38#(and (>= ULTIMATE.start_main_~M~0 0) (>= oldRank0 (+ (* (- 1) ULTIMATE.start_main_~M~0) ULTIMATE.start_main_~x~0)))} assume !!(main_~x~0 != main_~M~0); {38#(and (>= ULTIMATE.start_main_~M~0 0) (>= oldRank0 (+ (* (- 1) ULTIMATE.start_main_~M~0) ULTIMATE.start_main_~x~0)))} is VALID [2020-07-29 01:28:47,429 INFO L280 TraceCheckUtils]: 1: Hoare triple {38#(and (>= ULTIMATE.start_main_~M~0 0) (>= oldRank0 (+ (* (- 1) ULTIMATE.start_main_~M~0) ULTIMATE.start_main_~x~0)))} assume main_~x~0 > main_~M~0;main_~x~0 := 0; {40#(and (or (and (> oldRank0 (+ (* (- 1) ULTIMATE.start_main_~M~0) ULTIMATE.start_main_~x~0)) (>= oldRank0 0)) unseeded) (>= ULTIMATE.start_main_~M~0 0))} is VALID [2020-07-29 01:28:47,429 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,441 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2020-07-29 01:28:47,454 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:47,457 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 2 letters. Loop has 2 letters. [2020-07-29 01:28:47,461 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:47,469 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,471 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 8 states. Second operand 3 states. [2020-07-29 01:28:47,579 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 8 states.. Second operand 3 states. Result 28 states and 35 transitions. Complement of second has 6 states. [2020-07-29 01:28:47,579 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:47,580 INFO L123 tractBuchiDifference]: Start testing correctness of buchiDifferenceNCSBLazy3 [2020-07-29 01:28:47,580 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 8 states. [2020-07-29 01:28:47,582 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2020-07-29 01:28:47,582 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 01:28:47,582 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 01:28:47,583 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 3 states. [2020-07-29 01:28:47,587 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 3 [2020-07-29 01:28:47,587 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 01:28:47,588 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 01:28:47,588 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 28 states and 35 transitions. [2020-07-29 01:28:47,590 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2020-07-29 01:28:47,590 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 01:28:47,590 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 01:28:47,593 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 8 states. [2020-07-29 01:28:47,594 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2020-07-29 01:28:47,595 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 2 examples of accepted words. [2020-07-29 01:28:47,595 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 3 states. [2020-07-29 01:28:47,597 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 3 [2020-07-29 01:28:47,598 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 2 examples of accepted words. [2020-07-29 01:28:47,598 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 28 states and 35 transitions. cyclomatic complexity: 9 [2020-07-29 01:28:47,599 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 2 examples of accepted words. [2020-07-29 01:28:47,599 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states. Stem has 2 letters. Loop has 2 letters. [2020-07-29 01:28:47,600 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:47,600 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 2 letters. Loop has 2 letters. [2020-07-29 01:28:47,600 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:47,600 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 28 states and 35 transitions. cyclomatic complexity: 9 Stem has 2 letters. Loop has 2 letters. [2020-07-29 01:28:47,601 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:47,601 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states. Stem has 1 letters. Loop has 2 letters. [2020-07-29 01:28:47,601 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:47,602 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 1 letters. Loop has 2 letters. [2020-07-29 01:28:47,602 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:47,602 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 28 states and 35 transitions. cyclomatic complexity: 9 Stem has 1 letters. Loop has 2 letters. [2020-07-29 01:28:47,603 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:47,603 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states. Stem has 4 letters. Loop has 2 letters. [2020-07-29 01:28:47,603 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:47,603 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 4 letters. Loop has 2 letters. [2020-07-29 01:28:47,604 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:47,604 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 28 states and 35 transitions. cyclomatic complexity: 9 Stem has 4 letters. Loop has 2 letters. [2020-07-29 01:28:47,604 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:47,605 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states. Stem has 28 letters. Loop has 28 letters. [2020-07-29 01:28:47,605 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:47,605 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 28 letters. Loop has 28 letters. [2020-07-29 01:28:47,606 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:47,606 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 28 states and 35 transitions. cyclomatic complexity: 9 Stem has 28 letters. Loop has 28 letters. [2020-07-29 01:28:47,606 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:47,606 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states. Stem has 8 letters. Loop has 8 letters. [2020-07-29 01:28:47,607 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:47,607 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 8 letters. Loop has 8 letters. [2020-07-29 01:28:47,607 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:47,607 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 28 states and 35 transitions. cyclomatic complexity: 9 Stem has 8 letters. Loop has 8 letters. [2020-07-29 01:28:47,608 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:47,608 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states. Stem has 4 letters. Loop has 4 letters. [2020-07-29 01:28:47,608 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:47,609 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 4 letters. Loop has 4 letters. [2020-07-29 01:28:47,609 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:47,609 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 28 states and 35 transitions. cyclomatic complexity: 9 Stem has 4 letters. Loop has 4 letters. [2020-07-29 01:28:47,609 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:47,610 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states. Stem has 2 letters. Loop has 2 letters. [2020-07-29 01:28:47,610 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:47,610 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 2 letters. Loop has 2 letters. [2020-07-29 01:28:47,611 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:47,611 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 28 states and 35 transitions. cyclomatic complexity: 9 Stem has 2 letters. Loop has 2 letters. [2020-07-29 01:28:47,611 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:47,611 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states. Stem has 3 letters. Loop has 2 letters. [2020-07-29 01:28:47,612 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:47,612 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 3 letters. Loop has 2 letters. [2020-07-29 01:28:47,612 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:47,613 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 28 states and 35 transitions. cyclomatic complexity: 9 Stem has 3 letters. Loop has 2 letters. [2020-07-29 01:28:47,613 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:47,613 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states. Stem has 2 letters. Loop has 1 letters. [2020-07-29 01:28:47,614 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:47,614 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 2 letters. Loop has 1 letters. [2020-07-29 01:28:47,614 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:47,614 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 28 states and 35 transitions. cyclomatic complexity: 9 Stem has 2 letters. Loop has 1 letters. [2020-07-29 01:28:47,615 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:47,615 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states. Stem has 1 letters. Loop has 2 letters. [2020-07-29 01:28:47,615 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:47,615 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 1 letters. Loop has 2 letters. [2020-07-29 01:28:47,616 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:47,616 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 28 states and 35 transitions. cyclomatic complexity: 9 Stem has 1 letters. Loop has 2 letters. [2020-07-29 01:28:47,616 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:47,617 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states. Stem has 5 letters. Loop has 2 letters. [2020-07-29 01:28:47,617 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:47,617 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 5 letters. Loop has 2 letters. [2020-07-29 01:28:47,618 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:47,618 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 28 states and 35 transitions. cyclomatic complexity: 9 Stem has 5 letters. Loop has 2 letters. [2020-07-29 01:28:47,618 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:47,619 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states. Stem has 4 letters. Loop has 2 letters. [2020-07-29 01:28:47,619 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:47,619 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 4 letters. Loop has 2 letters. [2020-07-29 01:28:47,619 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:47,620 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 28 states and 35 transitions. cyclomatic complexity: 9 Stem has 4 letters. Loop has 2 letters. [2020-07-29 01:28:47,620 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:47,620 INFO L161 tractBuchiDifference]: Finished testing correctness of buchiDifferenceNCSBLazy3 [2020-07-29 01:28:47,622 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-07-29 01:28:47,624 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 16 transitions. [2020-07-29 01:28:47,624 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 16 transitions. Stem has 2 letters. Loop has 2 letters. [2020-07-29 01:28:47,625 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:47,625 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 16 transitions. Stem has 4 letters. Loop has 2 letters. [2020-07-29 01:28:47,625 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:47,625 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 16 transitions. Stem has 2 letters. Loop has 4 letters. [2020-07-29 01:28:47,626 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:47,627 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 28 states and 35 transitions. cyclomatic complexity: 9 [2020-07-29 01:28:47,631 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2020-07-29 01:28:47,636 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 28 states to 8 states and 11 transitions. [2020-07-29 01:28:47,638 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 5 [2020-07-29 01:28:47,638 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 6 [2020-07-29 01:28:47,639 INFO L73 IsDeterministic]: Start isDeterministic. Operand 8 states and 11 transitions. [2020-07-29 01:28:47,640 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2020-07-29 01:28:47,640 INFO L688 BuchiCegarLoop]: Abstraction has 8 states and 11 transitions. [2020-07-29 01:28:47,659 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8 states and 11 transitions. [2020-07-29 01:28:47,669 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8 to 8. [2020-07-29 01:28:47,669 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-29 01:28:47,670 INFO L82 GeneralOperation]: Start isEquivalent. First operand 8 states and 11 transitions. Second operand 8 states. [2020-07-29 01:28:47,671 INFO L74 IsIncluded]: Start isIncluded. First operand 8 states and 11 transitions. Second operand 8 states. [2020-07-29 01:28:47,674 INFO L87 Difference]: Start difference. First operand 8 states and 11 transitions. Second operand 8 states. [2020-07-29 01:28:47,678 INFO L149 Difference]: Subtrahend was not deterministic. Recomputing result with determinization. [2020-07-29 01:28:47,680 INFO L93 Difference]: Finished difference Result 8 states and 11 transitions. [2020-07-29 01:28:47,681 INFO L276 IsEmpty]: Start isEmpty. Operand 8 states and 11 transitions. [2020-07-29 01:28:47,682 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-29 01:28:47,683 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-29 01:28:47,683 INFO L74 IsIncluded]: Start isIncluded. First operand 8 states. Second operand 8 states and 11 transitions. [2020-07-29 01:28:47,683 INFO L87 Difference]: Start difference. First operand 8 states. Second operand 8 states and 11 transitions. [2020-07-29 01:28:47,684 INFO L149 Difference]: Subtrahend was not deterministic. Recomputing result with determinization. [2020-07-29 01:28:47,685 INFO L93 Difference]: Finished difference Result 8 states and 11 transitions. [2020-07-29 01:28:47,686 INFO L276 IsEmpty]: Start isEmpty. Operand 8 states and 11 transitions. [2020-07-29 01:28:47,686 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-29 01:28:47,686 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-29 01:28:47,687 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-29 01:28:47,687 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-29 01:28:47,687 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2020-07-29 01:28:47,688 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 11 transitions. [2020-07-29 01:28:47,690 INFO L711 BuchiCegarLoop]: Abstraction has 8 states and 11 transitions. [2020-07-29 01:28:47,690 INFO L591 BuchiCegarLoop]: Abstraction has 8 states and 11 transitions. [2020-07-29 01:28:47,690 INFO L424 BuchiCegarLoop]: ======== Iteration 2============ [2020-07-29 01:28:47,690 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 8 states and 11 transitions. [2020-07-29 01:28:47,691 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2020-07-29 01:28:47,691 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 01:28:47,692 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 01:28:47,692 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1] [2020-07-29 01:28:47,692 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2020-07-29 01:28:47,693 INFO L794 eck$LassoCheckResult]: Stem: 89#ULTIMATE.startENTRY havoc main_#res;havoc main_#t~nondet0, main_#t~nondet1, main_~x~0, main_~M~0;havoc main_~x~0;havoc main_~M~0;main_~x~0 := main_#t~nondet0;havoc main_#t~nondet0;main_~M~0 := main_#t~nondet1;havoc main_#t~nondet1; 90#L17 assume main_~M~0 > 0; 91#L19-2 assume !!(main_~x~0 != main_~M~0); 95#L19 assume !(main_~x~0 > main_~M~0);main_~x~0 := 1 + main_~x~0; 92#L19-2 [2020-07-29 01:28:47,693 INFO L796 eck$LassoCheckResult]: Loop: 92#L19-2 assume !!(main_~x~0 != main_~M~0); 93#L19 assume main_~x~0 > main_~M~0;main_~x~0 := 0; 92#L19-2 [2020-07-29 01:28:47,693 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 01:28:47,694 INFO L82 PathProgramCache]: Analyzing trace with hash 957577, now seen corresponding path program 1 times [2020-07-29 01:28:47,694 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 01:28:47,694 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1803794101] [2020-07-29 01:28:47,695 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 01:28:47,702 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 01:28:47,703 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 01:28:47,708 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 01:28:47,708 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 01:28:47,710 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-07-29 01:28:47,711 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 01:28:47,711 INFO L82 PathProgramCache]: Analyzing trace with hash 1380, now seen corresponding path program 2 times [2020-07-29 01:28:47,712 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 01:28:47,712 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1542148088] [2020-07-29 01:28:47,712 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 01:28:47,717 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 01:28:47,717 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 01:28:47,720 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 01:28:47,721 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 01:28:47,722 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,723 INFO L82 PathProgramCache]: Analyzing trace with hash 920231916, now seen corresponding path program 1 times [2020-07-29 01:28:47,723 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 01:28:47,724 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [229193955] [2020-07-29 01:28:47,724 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 01:28:47,736 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:28:47,816 INFO L280 TraceCheckUtils]: 0: Hoare triple {144#true} havoc main_#res;havoc main_#t~nondet0, main_#t~nondet1, main_~x~0, main_~M~0;havoc main_~x~0;havoc main_~M~0;main_~x~0 := main_#t~nondet0;havoc main_#t~nondet0;main_~M~0 := main_#t~nondet1;havoc main_#t~nondet1; {144#true} is VALID [2020-07-29 01:28:47,816 INFO L280 TraceCheckUtils]: 1: Hoare triple {144#true} assume main_~M~0 > 0; {144#true} is VALID [2020-07-29 01:28:47,818 INFO L280 TraceCheckUtils]: 2: Hoare triple {144#true} assume !!(main_~x~0 != main_~M~0); {146#(not (= ULTIMATE.start_main_~x~0 ULTIMATE.start_main_~M~0))} is VALID [2020-07-29 01:28:47,819 INFO L280 TraceCheckUtils]: 3: Hoare triple {146#(not (= ULTIMATE.start_main_~x~0 ULTIMATE.start_main_~M~0))} assume !(main_~x~0 > main_~M~0);main_~x~0 := 1 + main_~x~0; {147#(<= ULTIMATE.start_main_~x~0 ULTIMATE.start_main_~M~0)} is VALID [2020-07-29 01:28:47,820 INFO L280 TraceCheckUtils]: 4: Hoare triple {147#(<= ULTIMATE.start_main_~x~0 ULTIMATE.start_main_~M~0)} assume !!(main_~x~0 != main_~M~0); {147#(<= ULTIMATE.start_main_~x~0 ULTIMATE.start_main_~M~0)} is VALID [2020-07-29 01:28:47,821 INFO L280 TraceCheckUtils]: 5: Hoare triple {147#(<= ULTIMATE.start_main_~x~0 ULTIMATE.start_main_~M~0)} assume main_~x~0 > main_~M~0;main_~x~0 := 0; {145#false} is VALID [2020-07-29 01:28:47,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:47,823 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [229193955] [2020-07-29 01:28:47,824 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [618886735] [2020-07-29 01:28:47,824 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-07-29 01:28:47,848 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:28:47,849 INFO L263 TraceCheckSpWp]: Trace formula consists of 15 conjuncts, 4 conjunts are in the unsatisfiable core [2020-07-29 01:28:47,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:28:47,854 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-29 01:28:47,942 INFO L280 TraceCheckUtils]: 0: Hoare triple {144#true} havoc main_#res;havoc main_#t~nondet0, main_#t~nondet1, main_~x~0, main_~M~0;havoc main_~x~0;havoc main_~M~0;main_~x~0 := main_#t~nondet0;havoc main_#t~nondet0;main_~M~0 := main_#t~nondet1;havoc main_#t~nondet1; {144#true} is VALID [2020-07-29 01:28:47,943 INFO L280 TraceCheckUtils]: 1: Hoare triple {144#true} assume main_~M~0 > 0; {144#true} is VALID [2020-07-29 01:28:47,944 INFO L280 TraceCheckUtils]: 2: Hoare triple {144#true} assume !!(main_~x~0 != main_~M~0); {146#(not (= ULTIMATE.start_main_~x~0 ULTIMATE.start_main_~M~0))} is VALID [2020-07-29 01:28:47,946 INFO L280 TraceCheckUtils]: 3: Hoare triple {146#(not (= ULTIMATE.start_main_~x~0 ULTIMATE.start_main_~M~0))} assume !(main_~x~0 > main_~M~0);main_~x~0 := 1 + main_~x~0; {147#(<= ULTIMATE.start_main_~x~0 ULTIMATE.start_main_~M~0)} is VALID [2020-07-29 01:28:47,947 INFO L280 TraceCheckUtils]: 4: Hoare triple {147#(<= ULTIMATE.start_main_~x~0 ULTIMATE.start_main_~M~0)} assume !!(main_~x~0 != main_~M~0); {147#(<= ULTIMATE.start_main_~x~0 ULTIMATE.start_main_~M~0)} is VALID [2020-07-29 01:28:47,948 INFO L280 TraceCheckUtils]: 5: Hoare triple {147#(<= ULTIMATE.start_main_~x~0 ULTIMATE.start_main_~M~0)} assume main_~x~0 > main_~M~0;main_~x~0 := 0; {145#false} is VALID [2020-07-29 01:28:47,948 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:47,949 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-07-29 01:28:47,949 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3] total 3 [2020-07-29 01:28:47,950 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [341552294] [2020-07-29 01:28:47,975 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-29 01:28:47,978 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-07-29 01:28:47,979 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-07-29 01:28:47,979 INFO L87 Difference]: Start difference. First operand 8 states and 11 transitions. cyclomatic complexity: 5 Second operand 4 states. [2020-07-29 01:28:48,045 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-29 01:28:48,045 INFO L93 Difference]: Finished difference Result 8 states and 10 transitions. [2020-07-29 01:28:48,045 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-07-29 01:28:48,046 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states. [2020-07-29 01:28:48,057 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:48,057 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 8 states and 10 transitions. [2020-07-29 01:28:48,058 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2020-07-29 01:28:48,061 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 8 states to 8 states and 10 transitions. [2020-07-29 01:28:48,062 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 6 [2020-07-29 01:28:48,062 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 6 [2020-07-29 01:28:48,062 INFO L73 IsDeterministic]: Start isDeterministic. Operand 8 states and 10 transitions. [2020-07-29 01:28:48,062 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2020-07-29 01:28:48,062 INFO L688 BuchiCegarLoop]: Abstraction has 8 states and 10 transitions. [2020-07-29 01:28:48,062 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8 states and 10 transitions. [2020-07-29 01:28:48,063 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8 to 7. [2020-07-29 01:28:48,064 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-29 01:28:48,064 INFO L82 GeneralOperation]: Start isEquivalent. First operand 8 states and 10 transitions. Second operand 7 states. [2020-07-29 01:28:48,064 INFO L74 IsIncluded]: Start isIncluded. First operand 8 states and 10 transitions. Second operand 7 states. [2020-07-29 01:28:48,064 INFO L87 Difference]: Start difference. First operand 8 states and 10 transitions. Second operand 7 states. [2020-07-29 01:28:48,065 INFO L149 Difference]: Subtrahend was not deterministic. Recomputing result with determinization. [2020-07-29 01:28:48,067 INFO L93 Difference]: Finished difference Result 8 states and 10 transitions. [2020-07-29 01:28:48,068 INFO L276 IsEmpty]: Start isEmpty. Operand 8 states and 10 transitions. [2020-07-29 01:28:48,068 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-29 01:28:48,068 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-29 01:28:48,068 INFO L74 IsIncluded]: Start isIncluded. First operand 7 states. Second operand 8 states and 10 transitions. [2020-07-29 01:28:48,068 INFO L87 Difference]: Start difference. First operand 7 states. Second operand 8 states and 10 transitions. [2020-07-29 01:28:48,069 INFO L149 Difference]: Subtrahend was not deterministic. Recomputing result with determinization. [2020-07-29 01:28:48,072 INFO L93 Difference]: Finished difference Result 8 states and 10 transitions. [2020-07-29 01:28:48,073 INFO L276 IsEmpty]: Start isEmpty. Operand 8 states and 10 transitions. [2020-07-29 01:28:48,073 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-29 01:28:48,075 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-29 01:28:48,075 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-29 01:28:48,076 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-29 01:28:48,076 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2020-07-29 01:28:48,077 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 9 transitions. [2020-07-29 01:28:48,078 INFO L711 BuchiCegarLoop]: Abstraction has 7 states and 9 transitions. [2020-07-29 01:28:48,078 INFO L591 BuchiCegarLoop]: Abstraction has 7 states and 9 transitions. [2020-07-29 01:28:48,078 INFO L424 BuchiCegarLoop]: ======== Iteration 3============ [2020-07-29 01:28:48,078 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 7 states and 9 transitions. [2020-07-29 01:28:48,079 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2020-07-29 01:28:48,079 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 01:28:48,079 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 01:28:48,080 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1] [2020-07-29 01:28:48,080 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2020-07-29 01:28:48,080 INFO L794 eck$LassoCheckResult]: Stem: 173#ULTIMATE.startENTRY havoc main_#res;havoc main_#t~nondet0, main_#t~nondet1, main_~x~0, main_~M~0;havoc main_~x~0;havoc main_~M~0;main_~x~0 := main_#t~nondet0;havoc main_#t~nondet0;main_~M~0 := main_#t~nondet1;havoc main_#t~nondet1; 174#L17 assume main_~M~0 > 0; 175#L19-2 assume !!(main_~x~0 != main_~M~0); 177#L19 [2020-07-29 01:28:48,080 INFO L796 eck$LassoCheckResult]: Loop: 177#L19 assume !(main_~x~0 > main_~M~0);main_~x~0 := 1 + main_~x~0; 176#L19-2 assume !!(main_~x~0 != main_~M~0); 177#L19 [2020-07-29 01:28:48,080 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 01:28:48,081 INFO L82 PathProgramCache]: Analyzing trace with hash 30889, now seen corresponding path program 1 times [2020-07-29 01:28:48,081 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 01:28:48,081 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [877969541] [2020-07-29 01:28:48,082 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 01:28:48,093 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 01:28:48,094 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 01:28:48,100 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 01:28:48,100 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 01:28:48,103 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-07-29 01:28:48,103 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 01:28:48,104 INFO L82 PathProgramCache]: Analyzing trace with hash 1532, now seen corresponding path program 1 times [2020-07-29 01:28:48,104 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 01:28:48,104 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [707470179] [2020-07-29 01:28:48,105 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 01:28:48,114 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 01:28:48,115 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 01:28:48,123 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 01:28:48,123 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 01:28:48,133 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-07-29 01:28:48,133 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 01:28:48,134 INFO L82 PathProgramCache]: Analyzing trace with hash 29684900, now seen corresponding path program 2 times [2020-07-29 01:28:48,134 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 01:28:48,134 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1487410257] [2020-07-29 01:28:48,135 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 01:28:48,144 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 01:28:48,144 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 01:28:48,148 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 01:28:48,148 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 01:28:48,150 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-07-29 01:28:48,169 INFO L210 LassoAnalysis]: Preferences: [2020-07-29 01:28:48,169 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2020-07-29 01:28:48,169 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2020-07-29 01:28:48,169 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2020-07-29 01:28:48,170 INFO L129 ssoRankerPreferences]: Use exernal solver: true [2020-07-29 01:28:48,170 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:28:48,170 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2020-07-29 01:28:48,170 INFO L132 ssoRankerPreferences]: Path of dumped script: [2020-07-29 01:28:48,170 INFO L133 ssoRankerPreferences]: Filename of dumped script: CookSeeZuleger-TACAS2013-Fig8b.c_Iteration3_Loop [2020-07-29 01:28:48,170 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2020-07-29 01:28:48,170 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2020-07-29 01:28:48,181 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,186 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,192 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,339 INFO L292 LassoAnalysis]: Preprocessing complete. [2020-07-29 01:28:48,339 INFO L404 LassoAnalysis]: Checking for nontermination... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 9 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2020-07-29 01:28:48,347 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2020-07-29 01:28:48,347 INFO L160 nArgumentSynthesizer]: Using integer mode. Waiting until toolchain timeout for monitored process 9 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:28:48,353 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2020-07-29 01:28:48,353 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {v_rep~unnamed0~0~false_3=0} Honda state: {v_rep~unnamed0~0~false_3=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 10 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2020-07-29 01:28:48,404 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2020-07-29 01:28:48,404 INFO L160 nArgumentSynthesizer]: Using integer mode. Waiting until toolchain timeout for monitored process 10 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:28:48,409 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2020-07-29 01:28:48,409 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {v_rep~unnamed0~0~true_3=1} Honda state: {v_rep~unnamed0~0~true_3=1} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 11 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2020-07-29 01:28:48,463 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2020-07-29 01:28:48,463 INFO L160 nArgumentSynthesizer]: Using integer mode. Waiting until toolchain timeout for monitored process 11 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 12 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2020-07-29 01:28:48,507 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2020-07-29 01:28:48,507 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:50,954 INFO L444 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2020-07-29 01:28:50,958 INFO L210 LassoAnalysis]: Preferences: [2020-07-29 01:28:50,958 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2020-07-29 01:28:50,958 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2020-07-29 01:28:50,958 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2020-07-29 01:28:50,958 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2020-07-29 01:28:50,958 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:28:50,959 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2020-07-29 01:28:50,959 INFO L132 ssoRankerPreferences]: Path of dumped script: [2020-07-29 01:28:50,959 INFO L133 ssoRankerPreferences]: Filename of dumped script: CookSeeZuleger-TACAS2013-Fig8b.c_Iteration3_Loop [2020-07-29 01:28:50,959 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2020-07-29 01:28:50,959 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2020-07-29 01:28:50,969 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 01:28:50,975 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 01:28:50,982 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:51,147 INFO L292 LassoAnalysis]: Preprocessing complete. [2020-07-29 01:28:51,148 INFO L489 LassoAnalysis]: Using template 'affine'. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 13 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 13 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:28:51,158 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:51,160 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 01:28:51,161 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 01:28:51,161 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 01:28:51,161 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 01:28:51,165 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-07-29 01:28:51,165 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-07-29 01:28:51,169 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 14 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 14 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:28:51,201 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:51,202 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 01:28:51,202 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 01:28:51,202 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 01:28:51,203 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 01:28:51,207 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-07-29 01:28:51,207 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-07-29 01:28:51,213 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 15 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2020-07-29 01:28:51,257 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:51,259 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 01:28:51,259 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-07-29 01:28:51,260 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 01:28:51,260 INFO L204 nArgumentSynthesizer]: 2 loop disjuncts [2020-07-29 01:28:51,260 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 01:28:51,262 INFO L401 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2020-07-29 01:28:51,262 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. Waiting until toolchain timeout for monitored process 15 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:28:51,266 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2020-07-29 01:28:51,275 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2020-07-29 01:28:51,275 INFO L444 ModelExtractionUtils]: 0 out of 4 variables were initially zero. Simplification set additionally 0 variables to zero. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 16 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2020-07-29 01:28:51,286 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2020-07-29 01:28:51,287 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2020-07-29 01:28:51,287 INFO L510 LassoAnalysis]: Proved termination. [2020-07-29 01:28:51,287 INFO L512 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~x~0, ULTIMATE.start_main_~M~0) = -2*ULTIMATE.start_main_~x~0 + 2*ULTIMATE.start_main_~M~0 + 1 Supporting invariants [] Waiting until toolchain timeout for monitored process 16 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:28:51,321 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2020-07-29 01:28:51,324 INFO L393 LassoCheck]: Loop: "assume !(main_~x~0 > main_~M~0);main_~x~0 := 1 + main_~x~0;" "assume !!(main_~x~0 != main_~M~0);" [2020-07-29 01:28:51,327 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:28:51,342 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 01:28:51,389 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:28:51,390 INFO L263 TraceCheckSpWp]: Trace formula consists of 8 conjuncts, 2 conjunts are in the unsatisfiable core [2020-07-29 01:28:51,400 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:28:51,401 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-29 01:28:51,428 INFO L280 TraceCheckUtils]: 0: Hoare triple {229#unseeded} havoc main_#res;havoc main_#t~nondet0, main_#t~nondet1, main_~x~0, main_~M~0;havoc main_~x~0;havoc main_~M~0;main_~x~0 := main_#t~nondet0;havoc main_#t~nondet0;main_~M~0 := main_#t~nondet1;havoc main_#t~nondet1; {229#unseeded} is VALID [2020-07-29 01:28:51,428 INFO L280 TraceCheckUtils]: 1: Hoare triple {229#unseeded} assume main_~M~0 > 0; {229#unseeded} is VALID [2020-07-29 01:28:51,429 INFO L280 TraceCheckUtils]: 2: Hoare triple {229#unseeded} assume !!(main_~x~0 != main_~M~0); {229#unseeded} is VALID [2020-07-29 01:28:51,436 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:28:51,436 WARN L261 TraceCheckSpWp]: Trace formula consists of 6 conjuncts, 4 conjunts are in the unsatisfiable core [2020-07-29 01:28:51,440 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:28:51,440 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-29 01:28:51,526 INFO L280 TraceCheckUtils]: 0: Hoare triple {232#(>= oldRank0 (+ (* (- 2) ULTIMATE.start_main_~x~0) (* 2 ULTIMATE.start_main_~M~0) 1))} assume !(main_~x~0 > main_~M~0);main_~x~0 := 1 + main_~x~0; {253#(and (<= (div (+ (* ULTIMATE.start_main_~M~0 (- 2)) oldRank0 (- 1)) (- 2)) ULTIMATE.start_main_~M~0) (<= (+ (div (+ (* ULTIMATE.start_main_~M~0 (- 2)) oldRank0 (- 1)) (- 2)) 1) ULTIMATE.start_main_~x~0))} is VALID [2020-07-29 01:28:51,528 INFO L280 TraceCheckUtils]: 1: Hoare triple {253#(and (<= (div (+ (* ULTIMATE.start_main_~M~0 (- 2)) oldRank0 (- 1)) (- 2)) ULTIMATE.start_main_~M~0) (<= (+ (div (+ (* ULTIMATE.start_main_~M~0 (- 2)) oldRank0 (- 1)) (- 2)) 1) ULTIMATE.start_main_~x~0))} assume !!(main_~x~0 != main_~M~0); {242#(or unseeded (and (> oldRank0 (+ (* (- 2) ULTIMATE.start_main_~x~0) (* 2 ULTIMATE.start_main_~M~0) 1)) (>= oldRank0 0)))} is VALID [2020-07-29 01:28:51,528 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:51,529 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2020-07-29 01:28:51,536 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:51,536 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 3 letters. Loop has 2 letters. [2020-07-29 01:28:51,536 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:51,537 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:51,537 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 7 states and 9 transitions. cyclomatic complexity: 4 Second operand 3 states. [2020-07-29 01:28:51,560 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 7 states and 9 transitions. cyclomatic complexity: 4. Second operand 3 states. Result 12 states and 14 transitions. Complement of second has 5 states. [2020-07-29 01:28:51,560 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:51,560 INFO L123 tractBuchiDifference]: Start testing correctness of buchiDifferenceNCSBLazy3 [2020-07-29 01:28:51,560 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 7 states and 9 transitions. cyclomatic complexity: 4 [2020-07-29 01:28:51,561 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 01:28:51,561 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 01:28:51,561 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 3 states. [2020-07-29 01:28:51,562 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2020-07-29 01:28:51,562 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 01:28:51,562 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 01:28:51,563 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 12 states and 14 transitions. [2020-07-29 01:28:51,563 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2020-07-29 01:28:51,563 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 01:28:51,564 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 01:28:51,564 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 7 states and 9 transitions. cyclomatic complexity: 4 [2020-07-29 01:28:51,565 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 2 examples of accepted words. [2020-07-29 01:28:51,565 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 3 states. [2020-07-29 01:28:51,566 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2020-07-29 01:28:51,566 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 1 examples of accepted words. [2020-07-29 01:28:51,566 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 12 states and 14 transitions. cyclomatic complexity: 5 [2020-07-29 01:28:51,567 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 2 examples of accepted words. [2020-07-29 01:28:51,567 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 9 transitions. cyclomatic complexity: 4 Stem has 3 letters. Loop has 2 letters. [2020-07-29 01:28:51,568 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:51,568 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 3 letters. Loop has 2 letters. [2020-07-29 01:28:51,568 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:51,568 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 12 states and 14 transitions. cyclomatic complexity: 5 Stem has 3 letters. Loop has 2 letters. [2020-07-29 01:28:51,569 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:51,569 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 9 transitions. cyclomatic complexity: 4 Stem has 1 letters. Loop has 1 letters. [2020-07-29 01:28:51,569 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:51,569 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 1 letters. Loop has 1 letters. [2020-07-29 01:28:51,570 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:51,570 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 12 states and 14 transitions. cyclomatic complexity: 5 Stem has 1 letters. Loop has 1 letters. [2020-07-29 01:28:51,570 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:51,570 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 9 transitions. cyclomatic complexity: 4 Stem has 5 letters. Loop has 2 letters. [2020-07-29 01:28:51,570 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:51,571 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 5 letters. Loop has 2 letters. [2020-07-29 01:28:51,571 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:51,571 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 12 states and 14 transitions. cyclomatic complexity: 5 Stem has 5 letters. Loop has 2 letters. [2020-07-29 01:28:51,571 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:51,571 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 9 transitions. cyclomatic complexity: 4 Stem has 12 letters. Loop has 12 letters. [2020-07-29 01:28:51,572 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:51,572 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 12 letters. Loop has 12 letters. [2020-07-29 01:28:51,572 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:51,572 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 12 states and 14 transitions. cyclomatic complexity: 5 Stem has 12 letters. Loop has 12 letters. [2020-07-29 01:28:51,572 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:51,573 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 9 transitions. cyclomatic complexity: 4 Stem has 7 letters. Loop has 7 letters. [2020-07-29 01:28:51,573 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:51,573 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 7 letters. Loop has 7 letters. [2020-07-29 01:28:51,573 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:51,573 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 12 states and 14 transitions. cyclomatic complexity: 5 Stem has 7 letters. Loop has 7 letters. [2020-07-29 01:28:51,574 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:51,574 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 9 transitions. cyclomatic complexity: 4 Stem has 3 letters. Loop has 3 letters. [2020-07-29 01:28:51,574 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:51,574 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 3 letters. Loop has 3 letters. [2020-07-29 01:28:51,574 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:51,575 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 12 states and 14 transitions. cyclomatic complexity: 5 Stem has 3 letters. Loop has 3 letters. [2020-07-29 01:28:51,575 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:51,575 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 9 transitions. cyclomatic complexity: 4 Stem has 4 letters. Loop has 2 letters. [2020-07-29 01:28:51,575 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:51,576 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 4 letters. Loop has 2 letters. [2020-07-29 01:28:51,576 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:51,576 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 12 states and 14 transitions. cyclomatic complexity: 5 Stem has 4 letters. Loop has 2 letters. [2020-07-29 01:28:51,576 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:51,577 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 9 transitions. cyclomatic complexity: 4 Stem has 3 letters. Loop has 2 letters. [2020-07-29 01:28:51,577 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:51,577 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 3 letters. Loop has 2 letters. [2020-07-29 01:28:51,577 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:51,577 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 12 states and 14 transitions. cyclomatic complexity: 5 Stem has 3 letters. Loop has 2 letters. [2020-07-29 01:28:51,578 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:51,578 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 9 transitions. cyclomatic complexity: 4 Stem has 1 letters. Loop has 1 letters. [2020-07-29 01:28:51,579 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:51,579 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 1 letters. Loop has 1 letters. [2020-07-29 01:28:51,579 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:51,579 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 12 states and 14 transitions. cyclomatic complexity: 5 Stem has 1 letters. Loop has 1 letters. [2020-07-29 01:28:51,580 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:51,580 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 9 transitions. cyclomatic complexity: 4 Stem has 5 letters. Loop has 2 letters. [2020-07-29 01:28:51,580 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:51,580 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 5 letters. Loop has 2 letters. [2020-07-29 01:28:51,580 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:51,581 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 12 states and 14 transitions. cyclomatic complexity: 5 Stem has 5 letters. Loop has 2 letters. [2020-07-29 01:28:51,581 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:51,581 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 9 transitions. cyclomatic complexity: 4 Stem has 6 letters. Loop has 2 letters. [2020-07-29 01:28:51,582 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:51,582 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 6 letters. Loop has 2 letters. [2020-07-29 01:28:51,582 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:51,583 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 12 states and 14 transitions. cyclomatic complexity: 5 Stem has 6 letters. Loop has 2 letters. [2020-07-29 01:28:51,583 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:51,583 INFO L161 tractBuchiDifference]: Finished testing correctness of buchiDifferenceNCSBLazy3 [2020-07-29 01:28:51,583 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-07-29 01:28:51,584 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 6 transitions. [2020-07-29 01:28:51,584 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 6 transitions. Stem has 3 letters. Loop has 2 letters. [2020-07-29 01:28:51,585 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:51,585 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 6 transitions. Stem has 5 letters. Loop has 2 letters. [2020-07-29 01:28:51,585 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:51,585 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 6 transitions. Stem has 3 letters. Loop has 4 letters. [2020-07-29 01:28:51,586 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:51,586 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 12 states and 14 transitions. cyclomatic complexity: 5 [2020-07-29 01:28:51,587 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2020-07-29 01:28:51,588 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 12 states to 8 states and 9 transitions. [2020-07-29 01:28:51,588 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 5 [2020-07-29 01:28:51,589 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 5 [2020-07-29 01:28:51,589 INFO L73 IsDeterministic]: Start isDeterministic. Operand 8 states and 9 transitions. [2020-07-29 01:28:51,589 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2020-07-29 01:28:51,589 INFO L688 BuchiCegarLoop]: Abstraction has 8 states and 9 transitions. [2020-07-29 01:28:51,589 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8 states and 9 transitions. [2020-07-29 01:28:51,590 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8 to 7. [2020-07-29 01:28:51,590 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-29 01:28:51,591 INFO L82 GeneralOperation]: Start isEquivalent. First operand 8 states and 9 transitions. Second operand 7 states. [2020-07-29 01:28:51,591 INFO L74 IsIncluded]: Start isIncluded. First operand 8 states and 9 transitions. Second operand 7 states. [2020-07-29 01:28:51,591 INFO L87 Difference]: Start difference. First operand 8 states and 9 transitions. Second operand 7 states. [2020-07-29 01:28:51,592 INFO L149 Difference]: Subtrahend was not deterministic. Recomputing result with determinization. [2020-07-29 01:28:51,593 INFO L93 Difference]: Finished difference Result 9 states and 10 transitions. [2020-07-29 01:28:51,593 INFO L276 IsEmpty]: Start isEmpty. Operand 9 states and 10 transitions. [2020-07-29 01:28:51,593 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-29 01:28:51,593 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-29 01:28:51,594 INFO L74 IsIncluded]: Start isIncluded. First operand 7 states. Second operand 8 states and 9 transitions. [2020-07-29 01:28:51,594 INFO L87 Difference]: Start difference. First operand 7 states. Second operand 8 states and 9 transitions. [2020-07-29 01:28:51,594 INFO L149 Difference]: Subtrahend was not deterministic. Recomputing result with determinization. [2020-07-29 01:28:51,595 INFO L93 Difference]: Finished difference Result 9 states and 10 transitions. [2020-07-29 01:28:51,596 INFO L276 IsEmpty]: Start isEmpty. Operand 9 states and 10 transitions. [2020-07-29 01:28:51,596 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-29 01:28:51,596 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-29 01:28:51,596 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-29 01:28:51,597 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-29 01:28:51,597 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2020-07-29 01:28:51,597 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 8 transitions. [2020-07-29 01:28:51,598 INFO L711 BuchiCegarLoop]: Abstraction has 7 states and 8 transitions. [2020-07-29 01:28:51,598 INFO L591 BuchiCegarLoop]: Abstraction has 7 states and 8 transitions. [2020-07-29 01:28:51,598 INFO L424 BuchiCegarLoop]: ======== Iteration 4============ [2020-07-29 01:28:51,598 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 7 states and 8 transitions. [2020-07-29 01:28:51,599 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2020-07-29 01:28:51,599 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 01:28:51,599 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 01:28:51,599 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [2, 1, 1, 1] [2020-07-29 01:28:51,600 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2020-07-29 01:28:51,600 INFO L794 eck$LassoCheckResult]: Stem: 276#ULTIMATE.startENTRY havoc main_#res;havoc main_#t~nondet0, main_#t~nondet1, main_~x~0, main_~M~0;havoc main_~x~0;havoc main_~M~0;main_~x~0 := main_#t~nondet0;havoc main_#t~nondet0;main_~M~0 := main_#t~nondet1;havoc main_#t~nondet1; 277#L17 assume main_~M~0 > 0; 278#L19-2 assume !!(main_~x~0 != main_~M~0); 279#L19 assume main_~x~0 > main_~M~0;main_~x~0 := 0; 280#L19-2 assume !!(main_~x~0 != main_~M~0); 281#L19 [2020-07-29 01:28:51,600 INFO L796 eck$LassoCheckResult]: Loop: 281#L19 assume !(main_~x~0 > main_~M~0);main_~x~0 := 1 + main_~x~0; 282#L19-2 assume !!(main_~x~0 != main_~M~0); 281#L19 [2020-07-29 01:28:51,600 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 01:28:51,600 INFO L82 PathProgramCache]: Analyzing trace with hash 29684838, now seen corresponding path program 2 times [2020-07-29 01:28:51,601 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 01:28:51,601 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [125358721] [2020-07-29 01:28:51,601 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 01:28:51,606 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 01:28:51,606 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 01:28:51,610 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 01:28:51,611 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 01:28:51,612 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-07-29 01:28:51,613 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 01:28:51,613 INFO L82 PathProgramCache]: Analyzing trace with hash 1532, now seen corresponding path program 2 times [2020-07-29 01:28:51,613 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 01:28:51,614 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [262693519] [2020-07-29 01:28:51,614 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 01:28:51,618 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 01:28:51,618 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 01:28:51,620 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 01:28:51,621 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 01:28:51,622 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-07-29 01:28:51,623 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 01:28:51,623 INFO L82 PathProgramCache]: Analyzing trace with hash -1537641183, now seen corresponding path program 2 times [2020-07-29 01:28:51,623 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 01:28:51,624 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1619805048] [2020-07-29 01:28:51,624 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 01:28:51,630 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 01:28:51,630 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 01:28:51,635 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 01:28:51,635 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 01:28:51,637 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-07-29 01:28:51,653 INFO L210 LassoAnalysis]: Preferences: [2020-07-29 01:28:51,653 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2020-07-29 01:28:51,653 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2020-07-29 01:28:51,653 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2020-07-29 01:28:51,653 INFO L129 ssoRankerPreferences]: Use exernal solver: true [2020-07-29 01:28:51,654 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:28:51,654 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2020-07-29 01:28:51,654 INFO L132 ssoRankerPreferences]: Path of dumped script: [2020-07-29 01:28:51,654 INFO L133 ssoRankerPreferences]: Filename of dumped script: CookSeeZuleger-TACAS2013-Fig8b.c_Iteration4_Loop [2020-07-29 01:28:51,654 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2020-07-29 01:28:51,654 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2020-07-29 01:28:51,666 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:51,671 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:51,681 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:51,810 INFO L292 LassoAnalysis]: Preprocessing complete. [2020-07-29 01:28:51,810 INFO L404 LassoAnalysis]: Checking for nontermination... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 17 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2020-07-29 01:28:51,827 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2020-07-29 01:28:51,827 INFO L160 nArgumentSynthesizer]: Using integer mode. Waiting until toolchain timeout for monitored process 17 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:28:51,833 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2020-07-29 01:28:51,833 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {v_rep~unnamed0~0~true_5=1} Honda state: {v_rep~unnamed0~0~true_5=1} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 18 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2020-07-29 01:28:51,881 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2020-07-29 01:28:51,881 INFO L160 nArgumentSynthesizer]: Using integer mode. Waiting until toolchain timeout for monitored process 18 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 19 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2020-07-29 01:28:51,935 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2020-07-29 01:28:51,935 INFO L160 nArgumentSynthesizer]: Using integer mode. Waiting until toolchain timeout for monitored process 19 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:28:54,349 INFO L444 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2020-07-29 01:28:54,351 INFO L210 LassoAnalysis]: Preferences: [2020-07-29 01:28:54,352 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2020-07-29 01:28:54,352 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2020-07-29 01:28:54,352 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2020-07-29 01:28:54,352 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2020-07-29 01:28:54,352 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:28:54,352 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2020-07-29 01:28:54,352 INFO L132 ssoRankerPreferences]: Path of dumped script: [2020-07-29 01:28:54,352 INFO L133 ssoRankerPreferences]: Filename of dumped script: CookSeeZuleger-TACAS2013-Fig8b.c_Iteration4_Loop [2020-07-29 01:28:54,352 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2020-07-29 01:28:54,352 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2020-07-29 01:28:54,360 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:54,372 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:54,377 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:54,500 INFO L292 LassoAnalysis]: Preprocessing complete. [2020-07-29 01:28:54,500 INFO L489 LassoAnalysis]: Using template 'affine'. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 20 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2020-07-29 01:28:54,513 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:54,515 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 01:28:54,515 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-07-29 01:28:54,516 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 01:28:54,516 INFO L204 nArgumentSynthesizer]: 2 loop disjuncts [2020-07-29 01:28:54,516 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 01:28:54,520 INFO L401 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2020-07-29 01:28:54,520 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. Waiting until toolchain timeout for monitored process 20 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:28:54,533 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2020-07-29 01:28:54,541 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2020-07-29 01:28:54,541 INFO L444 ModelExtractionUtils]: 0 out of 4 variables were initially zero. Simplification set additionally 0 variables to zero. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 21 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2020-07-29 01:28:54,549 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2020-07-29 01:28:54,549 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2020-07-29 01:28:54,549 INFO L510 LassoAnalysis]: Proved termination. [2020-07-29 01:28:54,549 INFO L512 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~M~0, ULTIMATE.start_main_~x~0) = 2*ULTIMATE.start_main_~M~0 - 2*ULTIMATE.start_main_~x~0 + 1 Supporting invariants [] Waiting until toolchain timeout for monitored process 21 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:28:54,588 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2020-07-29 01:28:54,591 INFO L393 LassoCheck]: Loop: "assume !(main_~x~0 > main_~M~0);main_~x~0 := 1 + main_~x~0;" "assume !!(main_~x~0 != main_~M~0);" [2020-07-29 01:28:54,597 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:28:54,611 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 01:28:54,615 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:28:54,616 INFO L263 TraceCheckSpWp]: Trace formula consists of 12 conjuncts, 2 conjunts are in the unsatisfiable core [2020-07-29 01:28:54,618 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:28:54,619 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-29 01:28:54,624 INFO L280 TraceCheckUtils]: 0: Hoare triple {340#unseeded} havoc main_#res;havoc main_#t~nondet0, main_#t~nondet1, main_~x~0, main_~M~0;havoc main_~x~0;havoc main_~M~0;main_~x~0 := main_#t~nondet0;havoc main_#t~nondet0;main_~M~0 := main_#t~nondet1;havoc main_#t~nondet1; {340#unseeded} is VALID [2020-07-29 01:28:54,625 INFO L280 TraceCheckUtils]: 1: Hoare triple {340#unseeded} assume main_~M~0 > 0; {340#unseeded} is VALID [2020-07-29 01:28:54,625 INFO L280 TraceCheckUtils]: 2: Hoare triple {340#unseeded} assume !!(main_~x~0 != main_~M~0); {340#unseeded} is VALID [2020-07-29 01:28:54,625 INFO L280 TraceCheckUtils]: 3: Hoare triple {340#unseeded} assume main_~x~0 > main_~M~0;main_~x~0 := 0; {340#unseeded} is VALID [2020-07-29 01:28:54,626 INFO L280 TraceCheckUtils]: 4: Hoare triple {340#unseeded} assume !!(main_~x~0 != main_~M~0); {340#unseeded} is VALID [2020-07-29 01:28:54,629 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:28:54,629 WARN L261 TraceCheckSpWp]: Trace formula consists of 6 conjuncts, 4 conjunts are in the unsatisfiable core [2020-07-29 01:28:54,632 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:28:54,633 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-29 01:28:54,725 INFO L280 TraceCheckUtils]: 0: Hoare triple {343#(>= oldRank0 (+ (* 2 ULTIMATE.start_main_~M~0) (* (- 2) ULTIMATE.start_main_~x~0) 1))} assume !(main_~x~0 > main_~M~0);main_~x~0 := 1 + main_~x~0; {370#(and (<= (div (+ (* ULTIMATE.start_main_~M~0 (- 2)) oldRank0 (- 1)) (- 2)) ULTIMATE.start_main_~M~0) (<= (+ (div (+ (* ULTIMATE.start_main_~M~0 (- 2)) oldRank0 (- 1)) (- 2)) 1) ULTIMATE.start_main_~x~0))} is VALID [2020-07-29 01:28:54,726 INFO L280 TraceCheckUtils]: 1: Hoare triple {370#(and (<= (div (+ (* ULTIMATE.start_main_~M~0 (- 2)) oldRank0 (- 1)) (- 2)) ULTIMATE.start_main_~M~0) (<= (+ (div (+ (* ULTIMATE.start_main_~M~0 (- 2)) oldRank0 (- 1)) (- 2)) 1) ULTIMATE.start_main_~x~0))} assume !!(main_~x~0 != main_~M~0); {353#(or (and (> oldRank0 (+ (* 2 ULTIMATE.start_main_~M~0) (* (- 2) ULTIMATE.start_main_~x~0) 1)) (>= oldRank0 0)) unseeded)} is VALID [2020-07-29 01:28:54,726 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:54,726 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2020-07-29 01:28:54,733 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 7 edges. 7 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-29 01:28:54,733 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 5 letters. Loop has 2 letters. [2020-07-29 01:28:54,734 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:54,734 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:54,734 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 7 states and 8 transitions. cyclomatic complexity: 3 Second operand 3 states. [2020-07-29 01:28:54,745 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 7 states and 8 transitions. cyclomatic complexity: 3. Second operand 3 states. Result 8 states and 9 transitions. Complement of second has 3 states. [2020-07-29 01:28:54,745 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:54,746 INFO L123 tractBuchiDifference]: Start testing correctness of buchiDifferenceNCSBLazy3 [2020-07-29 01:28:54,746 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 7 states and 8 transitions. cyclomatic complexity: 3 [2020-07-29 01:28:54,746 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 01:28:54,746 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 01:28:54,746 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 3 states. [2020-07-29 01:28:54,747 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2020-07-29 01:28:54,747 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2020-07-29 01:28:54,747 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 8 states and 9 transitions. [2020-07-29 01:28:54,747 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2020-07-29 01:28:54,747 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 01:28:54,748 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 01:28:54,748 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 7 states and 8 transitions. cyclomatic complexity: 3 [2020-07-29 01:28:54,749 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 2 examples of accepted words. [2020-07-29 01:28:54,749 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 3 states. [2020-07-29 01:28:54,749 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2020-07-29 01:28:54,749 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 2 states and 3 transitions. cyclomatic complexity: 2 [2020-07-29 01:28:54,749 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2020-07-29 01:28:54,750 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 0 examples of accepted words. [2020-07-29 01:28:54,750 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 8 states and 9 transitions. cyclomatic complexity: 3 [2020-07-29 01:28:54,750 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 2 examples of accepted words. [2020-07-29 01:28:54,750 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:54,751 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:54,751 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 5 letters. Loop has 2 letters. [2020-07-29 01:28:54,751 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:54,751 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:54,751 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:54,751 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:54,752 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:54,752 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 5 letters. Loop has 2 letters. [2020-07-29 01:28:54,752 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:54,752 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:54,752 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:54,752 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 8 transitions. cyclomatic complexity: 3 Stem has 8 letters. Loop has 8 letters. [2020-07-29 01:28:54,752 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:54,753 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 8 letters. Loop has 8 letters. [2020-07-29 01:28:54,753 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:54,753 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:54,753 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:54,753 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:54,753 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:54,754 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 7 letters. Loop has 7 letters. [2020-07-29 01:28:54,754 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:54,754 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states and 9 transitions. cyclomatic complexity: 3 Stem has 7 letters. Loop has 7 letters. [2020-07-29 01:28:54,754 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:54,754 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:54,754 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:54,754 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 2 letters. Loop has 2 letters. [2020-07-29 01:28:54,755 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:54,755 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states and 9 transitions. cyclomatic complexity: 3 Stem has 2 letters. Loop has 2 letters. [2020-07-29 01:28:54,755 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:54,755 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:54,755 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:54,755 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 5 letters. Loop has 2 letters. [2020-07-29 01:28:54,755 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:54,756 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:54,756 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:54,756 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 8 transitions. cyclomatic complexity: 3 Stem has 6 letters. Loop has 2 letters. [2020-07-29 01:28:54,756 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:54,756 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 6 letters. Loop has 2 letters. [2020-07-29 01:28:54,756 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:54,757 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states and 9 transitions. cyclomatic complexity: 3 Stem has 6 letters. Loop has 2 letters. [2020-07-29 01:28:54,757 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:54,757 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:54,757 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:54,757 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 5 letters. Loop has 2 letters. [2020-07-29 01:28:54,757 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:54,757 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:54,758 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:54,758 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 8 transitions. cyclomatic complexity: 3 Stem has 6 letters. Loop has 2 letters. [2020-07-29 01:28:54,758 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:54,758 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 6 letters. Loop has 2 letters. [2020-07-29 01:28:54,758 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:54,758 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states and 9 transitions. cyclomatic complexity: 3 Stem has 6 letters. Loop has 2 letters. [2020-07-29 01:28:54,758 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:54,758 INFO L161 tractBuchiDifference]: Finished testing correctness of buchiDifferenceNCSBLazy3 [2020-07-29 01:28:54,759 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-07-29 01:28:54,759 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 3 transitions. [2020-07-29 01:28:54,759 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 2 states and 3 transitions. Stem has 5 letters. Loop has 2 letters. [2020-07-29 01:28:54,759 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:54,759 INFO L639 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2020-07-29 01:28:54,772 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 01:28:54,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:28:54,778 INFO L263 TraceCheckSpWp]: Trace formula consists of 12 conjuncts, 2 conjunts are in the unsatisfiable core [2020-07-29 01:28:54,781 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:28:54,782 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-29 01:28:54,791 INFO L280 TraceCheckUtils]: 0: Hoare triple {340#unseeded} havoc main_#res;havoc main_#t~nondet0, main_#t~nondet1, main_~x~0, main_~M~0;havoc main_~x~0;havoc main_~M~0;main_~x~0 := main_#t~nondet0;havoc main_#t~nondet0;main_~M~0 := main_#t~nondet1;havoc main_#t~nondet1; {340#unseeded} is VALID [2020-07-29 01:28:54,791 INFO L280 TraceCheckUtils]: 1: Hoare triple {340#unseeded} assume main_~M~0 > 0; {340#unseeded} is VALID [2020-07-29 01:28:54,792 INFO L280 TraceCheckUtils]: 2: Hoare triple {340#unseeded} assume !!(main_~x~0 != main_~M~0); {340#unseeded} is VALID [2020-07-29 01:28:54,792 INFO L280 TraceCheckUtils]: 3: Hoare triple {340#unseeded} assume main_~x~0 > main_~M~0;main_~x~0 := 0; {340#unseeded} is VALID [2020-07-29 01:28:54,793 INFO L280 TraceCheckUtils]: 4: Hoare triple {340#unseeded} assume !!(main_~x~0 != main_~M~0); {340#unseeded} is VALID [2020-07-29 01:28:54,796 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:28:54,797 WARN L261 TraceCheckSpWp]: Trace formula consists of 6 conjuncts, 4 conjunts are in the unsatisfiable core [2020-07-29 01:28:54,800 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:28:54,800 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-29 01:28:54,879 INFO L280 TraceCheckUtils]: 0: Hoare triple {343#(>= oldRank0 (+ (* 2 ULTIMATE.start_main_~M~0) (* (- 2) ULTIMATE.start_main_~x~0) 1))} assume !(main_~x~0 > main_~M~0);main_~x~0 := 1 + main_~x~0; {402#(and (<= (div (+ (* ULTIMATE.start_main_~M~0 (- 2)) oldRank0 (- 1)) (- 2)) ULTIMATE.start_main_~M~0) (<= (+ (div (+ (* ULTIMATE.start_main_~M~0 (- 2)) oldRank0 (- 1)) (- 2)) 1) ULTIMATE.start_main_~x~0))} is VALID [2020-07-29 01:28:54,880 INFO L280 TraceCheckUtils]: 1: Hoare triple {402#(and (<= (div (+ (* ULTIMATE.start_main_~M~0 (- 2)) oldRank0 (- 1)) (- 2)) ULTIMATE.start_main_~M~0) (<= (+ (div (+ (* ULTIMATE.start_main_~M~0 (- 2)) oldRank0 (- 1)) (- 2)) 1) ULTIMATE.start_main_~x~0))} assume !!(main_~x~0 != main_~M~0); {353#(or (and (> oldRank0 (+ (* 2 ULTIMATE.start_main_~M~0) (* (- 2) ULTIMATE.start_main_~x~0) 1)) (>= oldRank0 0)) unseeded)} is VALID [2020-07-29 01:28:54,881 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:54,881 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2020-07-29 01:28:54,887 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 7 edges. 7 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-29 01:28:54,887 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 5 letters. Loop has 2 letters. [2020-07-29 01:28:54,887 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:54,888 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:54,888 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 7 states and 8 transitions. cyclomatic complexity: 3 Second operand 3 states. [2020-07-29 01:28:54,906 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 7 states and 8 transitions. cyclomatic complexity: 3. Second operand 3 states. Result 8 states and 9 transitions. Complement of second has 3 states. [2020-07-29 01:28:54,906 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:54,906 INFO L123 tractBuchiDifference]: Start testing correctness of buchiDifferenceNCSBLazy3 [2020-07-29 01:28:54,906 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 7 states and 8 transitions. cyclomatic complexity: 3 [2020-07-29 01:28:54,906 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 01:28:54,906 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 01:28:54,907 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 3 states. [2020-07-29 01:28:54,907 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2020-07-29 01:28:54,907 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2020-07-29 01:28:54,907 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 8 states and 9 transitions. [2020-07-29 01:28:54,908 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2020-07-29 01:28:54,908 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 01:28:54,908 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 01:28:54,908 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 7 states and 8 transitions. cyclomatic complexity: 3 [2020-07-29 01:28:54,908 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 2 examples of accepted words. [2020-07-29 01:28:54,908 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 3 states. [2020-07-29 01:28:54,909 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2020-07-29 01:28:54,909 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 2 states and 3 transitions. cyclomatic complexity: 2 [2020-07-29 01:28:54,909 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2020-07-29 01:28:54,909 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 0 examples of accepted words. [2020-07-29 01:28:54,909 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 8 states and 9 transitions. cyclomatic complexity: 3 [2020-07-29 01:28:54,910 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 2 examples of accepted words. [2020-07-29 01:28:54,910 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:54,910 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:54,910 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 5 letters. Loop has 2 letters. [2020-07-29 01:28:54,910 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:54,910 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:54,910 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:54,911 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:54,911 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:54,911 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 5 letters. Loop has 2 letters. [2020-07-29 01:28:54,911 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:54,911 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:54,911 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:54,911 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 8 transitions. cyclomatic complexity: 3 Stem has 8 letters. Loop has 8 letters. [2020-07-29 01:28:54,911 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:54,911 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 8 letters. Loop has 8 letters. [2020-07-29 01:28:54,912 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:54,912 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:54,912 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:54,912 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:54,912 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:54,912 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 7 letters. Loop has 7 letters. [2020-07-29 01:28:54,912 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:54,912 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states and 9 transitions. cyclomatic complexity: 3 Stem has 7 letters. Loop has 7 letters. [2020-07-29 01:28:54,913 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:54,913 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:54,913 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:54,913 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 2 letters. Loop has 2 letters. [2020-07-29 01:28:54,913 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:54,913 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states and 9 transitions. cyclomatic complexity: 3 Stem has 2 letters. Loop has 2 letters. [2020-07-29 01:28:54,913 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:54,913 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:54,913 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:54,914 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 5 letters. Loop has 2 letters. [2020-07-29 01:28:54,914 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:54,914 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:54,914 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:54,914 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 8 transitions. cyclomatic complexity: 3 Stem has 6 letters. Loop has 2 letters. [2020-07-29 01:28:54,914 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:54,914 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 6 letters. Loop has 2 letters. [2020-07-29 01:28:54,914 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:54,915 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states and 9 transitions. cyclomatic complexity: 3 Stem has 6 letters. Loop has 2 letters. [2020-07-29 01:28:54,915 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:54,915 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:54,915 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:54,915 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 5 letters. Loop has 2 letters. [2020-07-29 01:28:54,915 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:54,915 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:54,915 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:54,916 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 8 transitions. cyclomatic complexity: 3 Stem has 6 letters. Loop has 2 letters. [2020-07-29 01:28:54,916 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:54,916 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 6 letters. Loop has 2 letters. [2020-07-29 01:28:54,916 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:54,916 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states and 9 transitions. cyclomatic complexity: 3 Stem has 6 letters. Loop has 2 letters. [2020-07-29 01:28:54,916 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:54,916 INFO L161 tractBuchiDifference]: Finished testing correctness of buchiDifferenceNCSBLazy3 [2020-07-29 01:28:54,917 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-07-29 01:28:54,917 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 3 transitions. [2020-07-29 01:28:54,917 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 2 states and 3 transitions. Stem has 5 letters. Loop has 2 letters. [2020-07-29 01:28:54,917 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:54,917 INFO L639 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2020-07-29 01:28:54,928 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 01:28:54,932 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:28:54,933 INFO L263 TraceCheckSpWp]: Trace formula consists of 12 conjuncts, 2 conjunts are in the unsatisfiable core [2020-07-29 01:28:54,936 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:28:54,936 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-29 01:28:54,940 INFO L280 TraceCheckUtils]: 0: Hoare triple {340#unseeded} havoc main_#res;havoc main_#t~nondet0, main_#t~nondet1, main_~x~0, main_~M~0;havoc main_~x~0;havoc main_~M~0;main_~x~0 := main_#t~nondet0;havoc main_#t~nondet0;main_~M~0 := main_#t~nondet1;havoc main_#t~nondet1; {340#unseeded} is VALID [2020-07-29 01:28:54,951 INFO L280 TraceCheckUtils]: 1: Hoare triple {340#unseeded} assume main_~M~0 > 0; {340#unseeded} is VALID [2020-07-29 01:28:54,952 INFO L280 TraceCheckUtils]: 2: Hoare triple {340#unseeded} assume !!(main_~x~0 != main_~M~0); {340#unseeded} is VALID [2020-07-29 01:28:54,952 INFO L280 TraceCheckUtils]: 3: Hoare triple {340#unseeded} assume main_~x~0 > main_~M~0;main_~x~0 := 0; {340#unseeded} is VALID [2020-07-29 01:28:54,953 INFO L280 TraceCheckUtils]: 4: Hoare triple {340#unseeded} assume !!(main_~x~0 != main_~M~0); {340#unseeded} is VALID [2020-07-29 01:28:54,957 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:28:54,958 WARN L261 TraceCheckSpWp]: Trace formula consists of 6 conjuncts, 4 conjunts are in the unsatisfiable core [2020-07-29 01:28:54,962 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:28:54,963 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-29 01:28:55,047 INFO L280 TraceCheckUtils]: 0: Hoare triple {343#(>= oldRank0 (+ (* 2 ULTIMATE.start_main_~M~0) (* (- 2) ULTIMATE.start_main_~x~0) 1))} assume !(main_~x~0 > main_~M~0);main_~x~0 := 1 + main_~x~0; {434#(and (<= (div (+ (* ULTIMATE.start_main_~M~0 (- 2)) oldRank0 (- 1)) (- 2)) ULTIMATE.start_main_~M~0) (<= (+ (div (+ (* ULTIMATE.start_main_~M~0 (- 2)) oldRank0 (- 1)) (- 2)) 1) ULTIMATE.start_main_~x~0))} is VALID [2020-07-29 01:28:55,048 INFO L280 TraceCheckUtils]: 1: Hoare triple {434#(and (<= (div (+ (* ULTIMATE.start_main_~M~0 (- 2)) oldRank0 (- 1)) (- 2)) ULTIMATE.start_main_~M~0) (<= (+ (div (+ (* ULTIMATE.start_main_~M~0 (- 2)) oldRank0 (- 1)) (- 2)) 1) ULTIMATE.start_main_~x~0))} assume !!(main_~x~0 != main_~M~0); {353#(or (and (> oldRank0 (+ (* 2 ULTIMATE.start_main_~M~0) (* (- 2) ULTIMATE.start_main_~x~0) 1)) (>= oldRank0 0)) unseeded)} is VALID [2020-07-29 01:28:55,049 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:55,049 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2020-07-29 01:28:55,054 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 7 edges. 7 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-29 01:28:55,054 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 5 letters. Loop has 2 letters. [2020-07-29 01:28:55,055 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:55,055 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:55,055 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 7 states and 8 transitions. cyclomatic complexity: 3 Second operand 3 states. [2020-07-29 01:28:55,102 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 7 states and 8 transitions. cyclomatic complexity: 3. Second operand 3 states. Result 9 states and 10 transitions. Complement of second has 4 states. [2020-07-29 01:28:55,102 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:55,102 INFO L123 tractBuchiDifference]: Start testing correctness of buchiDifferenceNCSBLazy3 [2020-07-29 01:28:55,102 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 7 states and 8 transitions. cyclomatic complexity: 3 [2020-07-29 01:28:55,102 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 01:28:55,102 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 01:28:55,103 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 3 states. [2020-07-29 01:28:55,104 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2020-07-29 01:28:55,104 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 01:28:55,104 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 01:28:55,105 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 9 states and 10 transitions. [2020-07-29 01:28:55,105 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2020-07-29 01:28:55,105 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2020-07-29 01:28:55,105 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 7 states and 8 transitions. cyclomatic complexity: 3 [2020-07-29 01:28:55,106 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 2 examples of accepted words. [2020-07-29 01:28:55,106 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 3 states. [2020-07-29 01:28:55,107 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2020-07-29 01:28:55,107 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 1 examples of accepted words. [2020-07-29 01:28:55,108 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 9 states and 10 transitions. cyclomatic complexity: 3 [2020-07-29 01:28:55,108 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 9 states and 10 transitions. cyclomatic complexity: 3 [2020-07-29 01:28:55,108 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2020-07-29 01:28:55,109 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 0 examples of accepted words. [2020-07-29 01:28:55,109 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:55,110 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:55,110 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 5 letters. Loop has 2 letters. [2020-07-29 01:28:55,111 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:55,111 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 9 states and 10 transitions. cyclomatic complexity: 3 Stem has 5 letters. Loop has 2 letters. [2020-07-29 01:28:55,111 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:55,112 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 8 transitions. cyclomatic complexity: 3 Stem has 1 letters. Loop has 1 letters. [2020-07-29 01:28:55,112 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:55,112 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 1 letters. Loop has 1 letters. [2020-07-29 01:28:55,112 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:55,113 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 9 states and 10 transitions. cyclomatic complexity: 3 Stem has 1 letters. Loop has 1 letters. [2020-07-29 01:28:55,113 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:55,113 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 8 transitions. cyclomatic complexity: 3 Stem has 9 letters. Loop has 9 letters. [2020-07-29 01:28:55,113 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:55,113 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 9 letters. Loop has 9 letters. [2020-07-29 01:28:55,114 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:55,114 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 9 states and 10 transitions. cyclomatic complexity: 3 Stem has 9 letters. Loop has 9 letters. [2020-07-29 01:28:55,114 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:55,114 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:55,114 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:55,115 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 7 letters. Loop has 7 letters. [2020-07-29 01:28:55,115 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:55,115 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 9 states and 10 transitions. cyclomatic complexity: 3 Stem has 7 letters. Loop has 7 letters. [2020-07-29 01:28:55,115 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:55,115 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 8 transitions. cyclomatic complexity: 3 Stem has 3 letters. Loop has 3 letters. [2020-07-29 01:28:55,116 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:55,116 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 3 letters. Loop has 3 letters. [2020-07-29 01:28:55,116 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:55,116 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 9 states and 10 transitions. cyclomatic complexity: 3 Stem has 3 letters. Loop has 3 letters. [2020-07-29 01:28:55,116 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:55,117 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:55,117 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:55,117 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 5 letters. Loop has 2 letters. [2020-07-29 01:28:55,117 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:55,117 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 9 states and 10 transitions. cyclomatic complexity: 3 Stem has 5 letters. Loop has 2 letters. [2020-07-29 01:28:55,118 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:55,118 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 8 transitions. cyclomatic complexity: 3 Stem has 6 letters. Loop has 2 letters. [2020-07-29 01:28:55,118 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:55,118 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 6 letters. Loop has 2 letters. [2020-07-29 01:28:55,118 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:55,119 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 9 states and 10 transitions. cyclomatic complexity: 3 Stem has 6 letters. Loop has 2 letters. [2020-07-29 01:28:55,119 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:55,119 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 8 transitions. cyclomatic complexity: 3 Stem has 1 letters. Loop has 1 letters. [2020-07-29 01:28:55,119 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:55,119 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 1 letters. Loop has 1 letters. [2020-07-29 01:28:55,119 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:55,119 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 9 states and 10 transitions. cyclomatic complexity: 3 Stem has 1 letters. Loop has 1 letters. [2020-07-29 01:28:55,120 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:55,120 INFO L161 tractBuchiDifference]: Finished testing correctness of buchiDifferenceNCSBLazy3 [2020-07-29 01:28:55,120 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-07-29 01:28:55,121 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 9 transitions. [2020-07-29 01:28:55,121 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 9 transitions. Stem has 5 letters. Loop has 2 letters. [2020-07-29 01:28:55,121 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:55,121 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 9 transitions. Stem has 7 letters. Loop has 2 letters. [2020-07-29 01:28:55,121 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:55,121 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 9 transitions. Stem has 5 letters. Loop has 4 letters. [2020-07-29 01:28:55,122 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:55,122 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 9 states and 10 transitions. cyclomatic complexity: 3 [2020-07-29 01:28:55,125 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2020-07-29 01:28:55,126 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 9 states to 0 states and 0 transitions. [2020-07-29 01:28:55,126 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2020-07-29 01:28:55,126 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2020-07-29 01:28:55,126 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2020-07-29 01:28:55,127 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-07-29 01:28:55,127 INFO L688 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2020-07-29 01:28:55,127 INFO L711 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2020-07-29 01:28:55,127 INFO L591 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2020-07-29 01:28:55,127 INFO L424 BuchiCegarLoop]: ======== Iteration 5============ [2020-07-29 01:28:55,127 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2020-07-29 01:28:55,127 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2020-07-29 01:28:55,128 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2020-07-29 01:28:55,134 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 29.07 01:28:55 BoogieIcfgContainer [2020-07-29 01:28:55,134 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2020-07-29 01:28:55,135 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2020-07-29 01:28:55,135 INFO L271 PluginConnector]: Initializing Witness Printer... [2020-07-29 01:28:55,135 INFO L275 PluginConnector]: Witness Printer initialized [2020-07-29 01:28:55,136 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:46" (3/4) ... [2020-07-29 01:28:55,140 INFO L140 WitnessPrinter]: No result that supports witness generation found [2020-07-29 01:28:55,140 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2020-07-29 01:28:55,144 INFO L168 Benchmark]: Toolchain (without parser) took 9812.59 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 212.9 MB). Free memory was 956.2 MB in the beginning and 1.0 GB in the end (delta: -55.1 MB). Peak memory consumption was 157.7 MB. Max. memory is 11.5 GB. [2020-07-29 01:28:55,145 INFO L168 Benchmark]: CDTParser took 0.34 ms. Allocated memory is still 1.0 GB. Free memory is still 981.7 MB. There was no memory consumed. Max. memory is 11.5 GB. [2020-07-29 01:28:55,145 INFO L168 Benchmark]: CACSL2BoogieTranslator took 275.81 ms. Allocated memory is still 1.0 GB. Free memory was 956.2 MB in the beginning and 945.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:55,146 INFO L168 Benchmark]: Boogie Procedure Inliner took 94.07 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 148.9 MB). Free memory was 945.5 MB in the beginning and 1.1 GB in the end (delta: -200.1 MB). Peak memory consumption was 9.7 MB. Max. memory is 11.5 GB. [2020-07-29 01:28:55,147 INFO L168 Benchmark]: Boogie Preprocessor took 20.69 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2020-07-29 01:28:55,148 INFO L168 Benchmark]: RCFGBuilder took 291.11 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 19.1 MB). Peak memory consumption was 19.1 MB. Max. memory is 11.5 GB. [2020-07-29 01:28:55,149 INFO L168 Benchmark]: BuchiAutomizer took 9116.25 ms. Allocated memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 64.0 MB). Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 115.2 MB). Peak memory consumption was 179.1 MB. Max. memory is 11.5 GB. [2020-07-29 01:28:55,150 INFO L168 Benchmark]: Witness Printer took 5.46 ms. Allocated memory is still 1.2 GB. Free memory is still 1.0 GB. There was no memory consumed. Max. memory is 11.5 GB. [2020-07-29 01:28:55,154 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.34 ms. Allocated memory is still 1.0 GB. Free memory is still 981.7 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 275.81 ms. Allocated memory is still 1.0 GB. Free memory was 956.2 MB in the beginning and 945.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 94.07 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 148.9 MB). Free memory was 945.5 MB in the beginning and 1.1 GB in the end (delta: -200.1 MB). Peak memory consumption was 9.7 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 20.69 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * RCFGBuilder took 291.11 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 19.1 MB). Peak memory consumption was 19.1 MB. Max. memory is 11.5 GB. * BuchiAutomizer took 9116.25 ms. Allocated memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 64.0 MB). Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 115.2 MB). Peak memory consumption was 179.1 MB. Max. memory is 11.5 GB. * Witness Printer took 5.46 ms. Allocated memory is still 1.2 GB. Free memory is still 1.0 GB. There was no memory consumed. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Constructed decomposition of program Your program was decomposed into 4 terminating modules (1 trivial, 2 deterministic, 1 nondeterministic). One deterministic module has affine ranking function -1 * M + x and consists of 4 locations. One deterministic module has affine ranking function -2 * x + 2 * M + 1 and consists of 3 locations. One nondeterministic module has affine ranking function 2 * M + -2 * x + 1 and consists of 3 locations. 1 modules have a trivial ranking function, the largest among these consists of 4 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 9.0s and 5 iterations. TraceHistogramMax:2. Analysis of lassos took 7.7s. Construction of modules took 0.0s. Büchi inclusion checks took 1.0s. Highest rank in rank-based complementation 3. Minimization of det autom 1. Minimization of nondet autom 3. Automata minimization 0.0s AutomataMinimizationTime, 3 MinimizatonAttempts, 2 StatesRemovedByMinimization, 2 NontrivialMinimizations. Non-live state removal took 0.0s Buchi closure took 0.0s. Biggest automaton had 8 states and ocurred in iteration 1. Nontrivial modules had stage [2, 0, 1, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 26 SDtfs, 35 SDslu, 3 SDs, 0 SdLazy, 39 SolverSat, 7 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.0s Time LassoAnalysisResults: nont0 unkn0 SFLI0 SFLT2 conc1 concLT0 SILN0 SILU0 SILI0 SILT0 lasso1 LassoPreprocessingBenchmarks: Lassos: inital13 mio100 ax196 hnf97 lsp50 ukn100 mio100 lsp100 div100 bol100 ite100 ukn100 eq160 hnf94 smp100 dnf143 smp85 tf104 neg95 sie119 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 0 Time: 23ms VariablesStem: 1 VariablesLoop: 0 DisjunctsStem: 1 DisjunctsLoop: 1 SupportingInvariants: 2 MotzkinApplications: 6 LassoTerminationAnalysisBenchmarks: LassoNonterminationAnalysisSatFixpoint: 4 LassoNonterminationAnalysisSatUnbounded: 0 LassoNonterminationAnalysisUnsat: 3 LassoNonterminationAnalysisUnknown: 0 LassoNonterminationAnalysisTime: 5.1s - TerminationAnalysisResult: Termination proven Buchi Automizer proved that your program is terminating RESULT: Ultimate proved your program to be correct! Received shutdown request...