./Ultimate.py --spec ../sv-benchmarks/c/properties/termination.prp --file ../sv-benchmarks/c/termination-crafted/NestedRecursion_1d.c --full-output -ea --architecture 64bit -------------------------------------------------------------------------------- Checking for termination Using default analysis Version 03d7b7b3 Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -ea -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.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/NestedRecursion_1d.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 9c9c032ca120503dfa93615a57a0bb47775014248f579f3a3fd38a4985b2298b --- Real Ultimate output --- This is Ultimate 0.2.2-dev-03d7b7b [2022-02-21 03:23:43,041 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-02-21 03:23:43,043 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-02-21 03:23:43,098 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-02-21 03:23:43,099 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-02-21 03:23:43,101 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-02-21 03:23:43,103 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-02-21 03:23:43,105 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-02-21 03:23:43,106 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-02-21 03:23:43,109 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-02-21 03:23:43,110 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-02-21 03:23:43,111 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-02-21 03:23:43,111 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-02-21 03:23:43,113 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-02-21 03:23:43,114 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-02-21 03:23:43,116 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-02-21 03:23:43,117 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-02-21 03:23:43,117 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-02-21 03:23:43,119 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-02-21 03:23:43,123 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-02-21 03:23:43,124 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-02-21 03:23:43,125 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-02-21 03:23:43,126 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-02-21 03:23:43,127 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-02-21 03:23:43,131 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-02-21 03:23:43,132 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-02-21 03:23:43,132 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-02-21 03:23:43,133 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-02-21 03:23:43,134 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-02-21 03:23:43,134 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-02-21 03:23:43,134 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-02-21 03:23:43,135 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-02-21 03:23:43,136 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-02-21 03:23:43,137 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-02-21 03:23:43,138 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-02-21 03:23:43,138 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-02-21 03:23:43,139 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-02-21 03:23:43,139 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-02-21 03:23:43,139 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-02-21 03:23:43,139 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-02-21 03:23:43,141 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-02-21 03:23:43,141 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-64bit-Automizer_Default.epf [2022-02-21 03:23:43,164 INFO L113 SettingsManager]: Loading preferences was successful [2022-02-21 03:23:43,165 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-02-21 03:23:43,165 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-02-21 03:23:43,165 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-02-21 03:23:43,166 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-02-21 03:23:43,166 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-02-21 03:23:43,167 INFO L138 SettingsManager]: * Use SBE=true [2022-02-21 03:23:43,167 INFO L136 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2022-02-21 03:23:43,167 INFO L138 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2022-02-21 03:23:43,167 INFO L138 SettingsManager]: * Use old map elimination=false [2022-02-21 03:23:43,168 INFO L138 SettingsManager]: * Use external solver (rank synthesis)=false [2022-02-21 03:23:43,168 INFO L138 SettingsManager]: * Use only trivial implications for array writes=true [2022-02-21 03:23:43,168 INFO L138 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2022-02-21 03:23:43,168 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-02-21 03:23:43,169 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2022-02-21 03:23:43,169 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-02-21 03:23:43,169 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-02-21 03:23:43,169 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2022-02-21 03:23:43,169 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2022-02-21 03:23:43,169 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2022-02-21 03:23:43,170 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-02-21 03:23:43,170 INFO L138 SettingsManager]: * Assume nondeterminstic values are in range=false [2022-02-21 03:23:43,170 INFO L138 SettingsManager]: * Use constant arrays=true [2022-02-21 03:23:43,170 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2022-02-21 03:23:43,170 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-02-21 03:23:43,170 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-02-21 03:23:43,171 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-02-21 03:23:43,171 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-02-21 03:23:43,172 INFO L136 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2022-02-21 03:23:43,172 INFO L138 SettingsManager]: * TransformationType=MODULO_NEIGHBOR WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release 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 -> 9c9c032ca120503dfa93615a57a0bb47775014248f579f3a3fd38a4985b2298b [2022-02-21 03:23:43,376 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-02-21 03:23:43,397 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-02-21 03:23:43,399 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-02-21 03:23:43,401 INFO L271 PluginConnector]: Initializing CDTParser... [2022-02-21 03:23:43,401 INFO L275 PluginConnector]: CDTParser initialized [2022-02-21 03:23:43,402 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/termination-crafted/NestedRecursion_1d.c [2022-02-21 03:23:43,446 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/76d41711f/2ae0392d616b4f578cd1653bf2e6ecd3/FLAG7d93ca58c [2022-02-21 03:23:43,853 INFO L306 CDTParser]: Found 1 translation units. [2022-02-21 03:23:43,854 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/termination-crafted/NestedRecursion_1d.c [2022-02-21 03:23:43,858 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/76d41711f/2ae0392d616b4f578cd1653bf2e6ecd3/FLAG7d93ca58c [2022-02-21 03:23:44,230 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/76d41711f/2ae0392d616b4f578cd1653bf2e6ecd3 [2022-02-21 03:23:44,232 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-02-21 03:23:44,234 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-02-21 03:23:44,236 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-02-21 03:23:44,236 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-02-21 03:23:44,238 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-02-21 03:23:44,239 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.02 03:23:44" (1/1) ... [2022-02-21 03:23:44,240 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@59917d7d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 03:23:44, skipping insertion in model container [2022-02-21 03:23:44,240 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.02 03:23:44" (1/1) ... [2022-02-21 03:23:44,245 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-02-21 03:23:44,255 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-02-21 03:23:44,371 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-21 03:23:44,373 INFO L203 MainTranslator]: Completed pre-run [2022-02-21 03:23:44,386 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-21 03:23:44,395 INFO L208 MainTranslator]: Completed translation [2022-02-21 03:23:44,395 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 03:23:44 WrapperNode [2022-02-21 03:23:44,395 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-02-21 03:23:44,396 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-02-21 03:23:44,396 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-02-21 03:23:44,396 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-02-21 03:23:44,401 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 03:23:44" (1/1) ... [2022-02-21 03:23:44,404 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 03:23:44" (1/1) ... [2022-02-21 03:23:44,415 INFO L137 Inliner]: procedures = 6, calls = 8, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 6 [2022-02-21 03:23:44,415 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-02-21 03:23:44,416 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-02-21 03:23:44,416 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-02-21 03:23:44,416 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-02-21 03:23:44,421 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 03:23:44" (1/1) ... [2022-02-21 03:23:44,421 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 03:23:44" (1/1) ... [2022-02-21 03:23:44,422 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 03:23:44" (1/1) ... [2022-02-21 03:23:44,422 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 03:23:44" (1/1) ... [2022-02-21 03:23:44,424 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 03:23:44" (1/1) ... [2022-02-21 03:23:44,425 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 03:23:44" (1/1) ... [2022-02-21 03:23:44,425 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 03:23:44" (1/1) ... [2022-02-21 03:23:44,426 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-02-21 03:23:44,426 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-02-21 03:23:44,427 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-02-21 03:23:44,427 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-02-21 03:23:44,427 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 03:23:44" (1/1) ... [2022-02-21 03:23:44,432 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:23:44,439 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:23:44,450 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-02-21 03:23:44,478 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (1)] Waiting until timeout for monitored process [2022-02-21 03:23:44,487 INFO L130 BoogieDeclarations]: Found specification of procedure rec1 [2022-02-21 03:23:44,487 INFO L138 BoogieDeclarations]: Found implementation of procedure rec1 [2022-02-21 03:23:44,488 INFO L130 BoogieDeclarations]: Found specification of procedure rec2 [2022-02-21 03:23:44,488 INFO L138 BoogieDeclarations]: Found implementation of procedure rec2 [2022-02-21 03:23:44,488 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-02-21 03:23:44,488 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-02-21 03:23:44,521 INFO L234 CfgBuilder]: Building ICFG [2022-02-21 03:23:44,522 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-02-21 03:23:44,616 INFO L275 CfgBuilder]: Performing block encoding [2022-02-21 03:23:44,628 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-02-21 03:23:44,628 INFO L299 CfgBuilder]: Removed 0 assume(true) statements. [2022-02-21 03:23:44,632 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.02 03:23:44 BoogieIcfgContainer [2022-02-21 03:23:44,632 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-02-21 03:23:44,633 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2022-02-21 03:23:44,637 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2022-02-21 03:23:44,640 INFO L275 PluginConnector]: BuchiAutomizer initialized [2022-02-21 03:23:44,640 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2022-02-21 03:23:44,641 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 21.02 03:23:44" (1/3) ... [2022-02-21 03:23:44,641 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@4e5866da and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 21.02 03:23:44, skipping insertion in model container [2022-02-21 03:23:44,655 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2022-02-21 03:23:44,655 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 03:23:44" (2/3) ... [2022-02-21 03:23:44,656 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@4e5866da and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 21.02 03:23:44, skipping insertion in model container [2022-02-21 03:23:44,656 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2022-02-21 03:23:44,656 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.02 03:23:44" (3/3) ... [2022-02-21 03:23:44,657 INFO L388 chiAutomizerObserver]: Analyzing ICFG NestedRecursion_1d.c [2022-02-21 03:23:44,713 INFO L359 BuchiCegarLoop]: Interprodecural is true [2022-02-21 03:23:44,713 INFO L360 BuchiCegarLoop]: Hoare is false [2022-02-21 03:23:44,713 INFO L361 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2022-02-21 03:23:44,713 INFO L362 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2022-02-21 03:23:44,714 INFO L363 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2022-02-21 03:23:44,714 INFO L364 BuchiCegarLoop]: Difference is false [2022-02-21 03:23:44,714 INFO L365 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2022-02-21 03:23:44,714 INFO L368 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2022-02-21 03:23:44,735 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 22 states, 13 states have (on average 1.1538461538461537) internal successors, (15), 13 states have internal predecessors, (15), 6 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-02-21 03:23:44,785 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 9 [2022-02-21 03:23:44,785 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 03:23:44,786 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 03:23:44,789 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1] [2022-02-21 03:23:44,789 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1] [2022-02-21 03:23:44,789 INFO L425 BuchiCegarLoop]: ======== Iteration 1============ [2022-02-21 03:23:44,790 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 22 states, 13 states have (on average 1.1538461538461537) internal successors, (15), 13 states have internal predecessors, (15), 6 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-02-21 03:23:44,806 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 9 [2022-02-21 03:23:44,806 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 03:23:44,806 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 03:23:44,807 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1] [2022-02-21 03:23:44,807 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1] [2022-02-21 03:23:44,811 INFO L791 eck$LassoCheckResult]: Stem: 5#ULTIMATE.startENTRYtrue assume { :begin_inline_ULTIMATE.init } true; 14#L-1true assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet5#1, main_#t~ret6#1, main_~x~0#1;main_~x~0#1 := main_#t~nondet5#1;havoc main_#t~nondet5#1; 10#L25true call main_#t~ret6#1 := rec2(main_~x~0#1);< 17#rec2ENTRYtrue [2022-02-21 03:23:44,812 INFO L793 eck$LassoCheckResult]: Loop: 17#rec2ENTRYtrue ~j := #in~j; 18#L18true assume !(~j <= 0); 21#L20true call #t~ret3 := rec1(~j);< 23#rec1ENTRYtrue ~i := #in~i; 19#L12true assume ~i <= 0;#res := 0; 15#rec1FINALtrue assume true; 16#rec1EXITtrue >#34#return; 4#L20-1true call #t~ret4 := rec2(#t~ret3 - 1);< 17#rec2ENTRYtrue [2022-02-21 03:23:44,815 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:23:44,816 INFO L85 PathProgramCache]: Analyzing trace with hash 48738, now seen corresponding path program 1 times [2022-02-21 03:23:44,837 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 03:23:44,837 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [187770386] [2022-02-21 03:23:44,838 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:23:44,838 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 03:23:44,912 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:23:44,913 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-02-21 03:23:44,922 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:23:44,936 INFO L138 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-02-21 03:23:44,939 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:23:44,940 INFO L85 PathProgramCache]: Analyzing trace with hash -1074209557, now seen corresponding path program 1 times [2022-02-21 03:23:44,940 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 03:23:44,941 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [963093048] [2022-02-21 03:23:44,941 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:23:44,942 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 03:23:44,967 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:23:45,025 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-02-21 03:23:45,031 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:23:45,071 INFO L290 TraceCheckUtils]: 0: Hoare triple {28#true} ~i := #in~i; {35#(= |rec1_#in~i| rec1_~i)} is VALID [2022-02-21 03:23:45,073 INFO L290 TraceCheckUtils]: 1: Hoare triple {35#(= |rec1_#in~i| rec1_~i)} assume ~i <= 0;#res := 0; {36#(<= |rec1_#in~i| 0)} is VALID [2022-02-21 03:23:45,073 INFO L290 TraceCheckUtils]: 2: Hoare triple {36#(<= |rec1_#in~i| 0)} assume true; {36#(<= |rec1_#in~i| 0)} is VALID [2022-02-21 03:23:45,075 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {36#(<= |rec1_#in~i| 0)} {30#(<= 1 rec2_~j)} #34#return; {29#false} is VALID [2022-02-21 03:23:45,076 INFO L290 TraceCheckUtils]: 0: Hoare triple {28#true} ~j := #in~j; {28#true} is VALID [2022-02-21 03:23:45,076 INFO L290 TraceCheckUtils]: 1: Hoare triple {28#true} assume !(~j <= 0); {30#(<= 1 rec2_~j)} is VALID [2022-02-21 03:23:45,077 INFO L272 TraceCheckUtils]: 2: Hoare triple {30#(<= 1 rec2_~j)} call #t~ret3 := rec1(~j); {28#true} is VALID [2022-02-21 03:23:45,077 INFO L290 TraceCheckUtils]: 3: Hoare triple {28#true} ~i := #in~i; {35#(= |rec1_#in~i| rec1_~i)} is VALID [2022-02-21 03:23:45,078 INFO L290 TraceCheckUtils]: 4: Hoare triple {35#(= |rec1_#in~i| rec1_~i)} assume ~i <= 0;#res := 0; {36#(<= |rec1_#in~i| 0)} is VALID [2022-02-21 03:23:45,079 INFO L290 TraceCheckUtils]: 5: Hoare triple {36#(<= |rec1_#in~i| 0)} assume true; {36#(<= |rec1_#in~i| 0)} is VALID [2022-02-21 03:23:45,081 INFO L284 TraceCheckUtils]: 6: Hoare quadruple {36#(<= |rec1_#in~i| 0)} {30#(<= 1 rec2_~j)} #34#return; {29#false} is VALID [2022-02-21 03:23:45,081 INFO L272 TraceCheckUtils]: 7: Hoare triple {29#false} call #t~ret4 := rec2(#t~ret3 - 1); {29#false} is VALID [2022-02-21 03:23:45,082 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-21 03:23:45,082 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-21 03:23:45,083 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [963093048] [2022-02-21 03:23:45,083 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [963093048] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-21 03:23:45,083 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-21 03:23:45,084 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-02-21 03:23:45,084 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [625114096] [2022-02-21 03:23:45,085 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-21 03:23:45,088 INFO L808 eck$LassoCheckResult]: loop already infeasible [2022-02-21 03:23:45,089 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-21 03:23:45,114 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-02-21 03:23:45,116 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-02-21 03:23:45,117 INFO L87 Difference]: Start difference. First operand has 22 states, 13 states have (on average 1.1538461538461537) internal successors, (15), 13 states have internal predecessors, (15), 6 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) Second operand has 5 states, 3 states have (on average 1.6666666666666667) internal successors, (5), 4 states have internal predecessors, (5), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-21 03:23:45,281 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:23:45,282 INFO L93 Difference]: Finished difference Result 26 states and 34 transitions. [2022-02-21 03:23:45,282 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-02-21 03:23:45,283 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 5 states, 3 states have (on average 1.6666666666666667) internal successors, (5), 4 states have internal predecessors, (5), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-21 03:23:45,291 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 8 edges. 8 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-21 03:23:45,295 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 26 states and 34 transitions. [2022-02-21 03:23:45,305 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 9 [2022-02-21 03:23:45,318 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 26 states to 17 states and 23 transitions. [2022-02-21 03:23:45,319 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 17 [2022-02-21 03:23:45,319 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 17 [2022-02-21 03:23:45,320 INFO L73 IsDeterministic]: Start isDeterministic. Operand 17 states and 23 transitions. [2022-02-21 03:23:45,320 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-02-21 03:23:45,320 INFO L681 BuchiCegarLoop]: Abstraction has 17 states and 23 transitions. [2022-02-21 03:23:45,330 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17 states and 23 transitions. [2022-02-21 03:23:45,337 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17 to 17. [2022-02-21 03:23:45,337 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-21 03:23:45,338 INFO L82 GeneralOperation]: Start isEquivalent. First operand 17 states and 23 transitions. Second operand has 17 states, 9 states have (on average 1.1111111111111112) internal successors, (10), 10 states have internal predecessors, (10), 6 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (7), 4 states have call predecessors, (7), 4 states have call successors, (7) [2022-02-21 03:23:45,338 INFO L74 IsIncluded]: Start isIncluded. First operand 17 states and 23 transitions. Second operand has 17 states, 9 states have (on average 1.1111111111111112) internal successors, (10), 10 states have internal predecessors, (10), 6 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (7), 4 states have call predecessors, (7), 4 states have call successors, (7) [2022-02-21 03:23:45,339 INFO L87 Difference]: Start difference. First operand 17 states and 23 transitions. Second operand has 17 states, 9 states have (on average 1.1111111111111112) internal successors, (10), 10 states have internal predecessors, (10), 6 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (7), 4 states have call predecessors, (7), 4 states have call successors, (7) [2022-02-21 03:23:45,341 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:23:45,341 INFO L93 Difference]: Finished difference Result 17 states and 23 transitions. [2022-02-21 03:23:45,342 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 23 transitions. [2022-02-21 03:23:45,343 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 03:23:45,343 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 03:23:45,343 INFO L74 IsIncluded]: Start isIncluded. First operand has 17 states, 9 states have (on average 1.1111111111111112) internal successors, (10), 10 states have internal predecessors, (10), 6 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (7), 4 states have call predecessors, (7), 4 states have call successors, (7) Second operand 17 states and 23 transitions. [2022-02-21 03:23:45,343 INFO L87 Difference]: Start difference. First operand has 17 states, 9 states have (on average 1.1111111111111112) internal successors, (10), 10 states have internal predecessors, (10), 6 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (7), 4 states have call predecessors, (7), 4 states have call successors, (7) Second operand 17 states and 23 transitions. [2022-02-21 03:23:45,345 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:23:45,345 INFO L93 Difference]: Finished difference Result 17 states and 23 transitions. [2022-02-21 03:23:45,345 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 23 transitions. [2022-02-21 03:23:45,346 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 03:23:45,346 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 03:23:45,346 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-21 03:23:45,346 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-21 03:23:45,347 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 17 states, 9 states have (on average 1.1111111111111112) internal successors, (10), 10 states have internal predecessors, (10), 6 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (7), 4 states have call predecessors, (7), 4 states have call successors, (7) [2022-02-21 03:23:45,349 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 23 transitions. [2022-02-21 03:23:45,350 INFO L704 BuchiCegarLoop]: Abstraction has 17 states and 23 transitions. [2022-02-21 03:23:45,350 INFO L587 BuchiCegarLoop]: Abstraction has 17 states and 23 transitions. [2022-02-21 03:23:45,350 INFO L425 BuchiCegarLoop]: ======== Iteration 2============ [2022-02-21 03:23:45,350 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 17 states and 23 transitions. [2022-02-21 03:23:45,350 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 9 [2022-02-21 03:23:45,351 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 03:23:45,351 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 03:23:45,351 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1] [2022-02-21 03:23:45,352 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [4, 4, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-21 03:23:45,352 INFO L791 eck$LassoCheckResult]: Stem: 68#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true; 69#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet5#1, main_#t~ret6#1, main_~x~0#1;main_~x~0#1 := main_#t~nondet5#1;havoc main_#t~nondet5#1; 66#L25 call main_#t~ret6#1 := rec2(main_~x~0#1);< 67#rec2ENTRY [2022-02-21 03:23:45,352 INFO L793 eck$LassoCheckResult]: Loop: 67#rec2ENTRY ~j := #in~j; 79#L18 assume !(~j <= 0); 73#L20 call #t~ret3 := rec1(~j);< 76#rec1ENTRY ~i := #in~i; 80#L12 assume !(~i <= 0); 74#L14 call #t~ret0 := rec1(~i - 2);< 76#rec1ENTRY ~i := #in~i; 80#L12 assume ~i <= 0;#res := 0; 77#rec1FINAL assume true; 78#rec1EXIT >#28#return; 71#L14-1 call #t~ret1 := rec1(#t~ret0 - 1);< 76#rec1ENTRY ~i := #in~i; 80#L12 assume ~i <= 0;#res := 0; 77#rec1FINAL assume true; 78#rec1EXIT >#30#return; 72#L14-2 call #t~ret2 := rec1(#t~ret1);< 76#rec1ENTRY ~i := #in~i; 80#L12 assume ~i <= 0;#res := 0; 77#rec1FINAL assume true; 78#rec1EXIT >#32#return; 70#L14-3 #res := 1 + #t~ret2;havoc #t~ret0;havoc #t~ret1;havoc #t~ret2; 75#rec1FINAL assume true; 81#rec1EXIT >#34#return; 65#L20-1 call #t~ret4 := rec2(#t~ret3 - 1);< 67#rec2ENTRY [2022-02-21 03:23:45,352 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:23:45,353 INFO L85 PathProgramCache]: Analyzing trace with hash 48738, now seen corresponding path program 2 times [2022-02-21 03:23:45,353 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 03:23:45,353 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1316656882] [2022-02-21 03:23:45,353 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:23:45,353 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 03:23:45,356 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:23:45,356 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-02-21 03:23:45,357 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:23:45,358 INFO L138 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-02-21 03:23:45,358 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:23:45,358 INFO L85 PathProgramCache]: Analyzing trace with hash -204878921, now seen corresponding path program 1 times [2022-02-21 03:23:45,358 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 03:23:45,359 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [846216444] [2022-02-21 03:23:45,359 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:23:45,359 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 03:23:45,372 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:23:45,372 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-02-21 03:23:45,382 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:23:45,391 INFO L138 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-02-21 03:23:45,403 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:23:45,404 INFO L85 PathProgramCache]: Analyzing trace with hash -482494696, now seen corresponding path program 1 times [2022-02-21 03:23:45,404 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 03:23:45,404 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [954666107] [2022-02-21 03:23:45,404 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:23:45,404 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 03:23:45,427 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:23:45,427 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-02-21 03:23:45,436 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:23:45,439 INFO L138 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-02-21 03:23:45,861 INFO L210 LassoAnalysis]: Preferences: [2022-02-21 03:23:45,862 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2022-02-21 03:23:45,862 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2022-02-21 03:23:45,862 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2022-02-21 03:23:45,862 INFO L129 ssoRankerPreferences]: Use exernal solver: true [2022-02-21 03:23:45,869 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:23:45,869 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2022-02-21 03:23:45,869 INFO L132 ssoRankerPreferences]: Path of dumped script: [2022-02-21 03:23:45,870 INFO L133 ssoRankerPreferences]: Filename of dumped script: NestedRecursion_1d.c_Iteration2_Loop [2022-02-21 03:23:45,870 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2022-02-21 03:23:45,870 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2022-02-21 03:23:45,880 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 03:23:45,885 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 03:23:45,887 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 03:23:45,889 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 03:23:45,890 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 03:23:45,936 INFO L294 LassoAnalysis]: Preprocessing complete. [2022-02-21 03:23:45,937 INFO L404 LassoAnalysis]: Checking for nontermination... [2022-02-21 03:23:45,938 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:23:45,938 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:23:45,956 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-02-21 03:23:45,959 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2022-02-21 03:23:45,959 INFO L160 nArgumentSynthesizer]: Using integer mode. [2022-02-21 03:23:45,970 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (2)] Waiting until timeout for monitored process [2022-02-21 03:23:45,974 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2022-02-21 03:23:45,974 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {rec2_~j=0} Honda state: {rec2_~j=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2022-02-21 03:23:45,993 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (2)] Forceful destruction successful, exit code 0 [2022-02-21 03:23:45,993 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:23:45,994 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:23:46,020 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-02-21 03:23:46,022 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (3)] Waiting until timeout for monitored process [2022-02-21 03:23:46,023 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2022-02-21 03:23:46,023 INFO L160 nArgumentSynthesizer]: Using integer mode. [2022-02-21 03:23:46,045 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2022-02-21 03:23:46,045 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {rec2_#t~ret3=0} Honda state: {rec2_#t~ret3=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2022-02-21 03:23:46,075 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (3)] Forceful destruction successful, exit code 0 [2022-02-21 03:23:46,075 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:23:46,075 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:23:46,076 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-02-21 03:23:46,093 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2022-02-21 03:23:46,093 INFO L160 nArgumentSynthesizer]: Using integer mode. [2022-02-21 03:23:46,102 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (4)] Waiting until timeout for monitored process [2022-02-21 03:23:46,120 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2022-02-21 03:23:46,120 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {rec2_#res=0} Honda state: {rec2_#res=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2022-02-21 03:23:46,152 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (4)] Forceful destruction successful, exit code 0 [2022-02-21 03:23:46,153 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:23:46,153 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:23:46,154 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-02-21 03:23:46,163 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2022-02-21 03:23:46,163 INFO L160 nArgumentSynthesizer]: Using integer mode. [2022-02-21 03:23:46,163 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (5)] Waiting until timeout for monitored process [2022-02-21 03:23:46,188 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2022-02-21 03:23:46,188 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {rec2_#t~ret4=0} Honda state: {rec2_#t~ret4=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2022-02-21 03:23:46,205 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (5)] Forceful destruction successful, exit code 0 [2022-02-21 03:23:46,205 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:23:46,205 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:23:46,207 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-02-21 03:23:46,208 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (6)] Waiting until timeout for monitored process [2022-02-21 03:23:46,209 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2022-02-21 03:23:46,209 INFO L160 nArgumentSynthesizer]: Using integer mode. [2022-02-21 03:23:46,235 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (6)] Forceful destruction successful, exit code 0 [2022-02-21 03:23:46,235 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:23:46,235 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:23:46,236 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-02-21 03:23:46,237 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (7)] Waiting until timeout for monitored process [2022-02-21 03:23:46,238 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2022-02-21 03:23:46,239 INFO L160 nArgumentSynthesizer]: Using integer mode. [2022-02-21 03:23:46,260 INFO L444 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2022-02-21 03:23:46,279 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (7)] Ended with exit code 0 [2022-02-21 03:23:46,279 INFO L210 LassoAnalysis]: Preferences: [2022-02-21 03:23:46,279 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2022-02-21 03:23:46,279 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2022-02-21 03:23:46,279 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2022-02-21 03:23:46,279 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2022-02-21 03:23:46,279 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:23:46,279 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2022-02-21 03:23:46,280 INFO L132 ssoRankerPreferences]: Path of dumped script: [2022-02-21 03:23:46,280 INFO L133 ssoRankerPreferences]: Filename of dumped script: NestedRecursion_1d.c_Iteration2_Loop [2022-02-21 03:23:46,280 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2022-02-21 03:23:46,280 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2022-02-21 03:23:46,280 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 03:23:46,283 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 03:23:46,286 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 03:23:46,292 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 03:23:46,298 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 03:23:46,341 INFO L294 LassoAnalysis]: Preprocessing complete. [2022-02-21 03:23:46,344 INFO L490 LassoAnalysis]: Using template 'affine'. [2022-02-21 03:23:46,345 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:23:46,345 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:23:46,346 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-02-21 03:23:46,348 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (8)] Waiting until timeout for monitored process [2022-02-21 03:23:46,349 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-02-21 03:23:46,354 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 03:23:46,355 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 03:23:46,355 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 03:23:46,355 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 03:23:46,355 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 03:23:46,356 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-02-21 03:23:46,356 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 03:23:46,373 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 03:23:46,391 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (8)] Forceful destruction successful, exit code 0 [2022-02-21 03:23:46,391 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:23:46,391 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:23:46,393 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-02-21 03:23:46,396 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (9)] Waiting until timeout for monitored process [2022-02-21 03:23:46,399 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-02-21 03:23:46,406 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 03:23:46,406 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 03:23:46,406 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 03:23:46,407 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 03:23:46,407 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 03:23:46,407 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-02-21 03:23:46,407 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 03:23:46,410 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 03:23:46,428 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (9)] Ended with exit code 0 [2022-02-21 03:23:46,429 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:23:46,429 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:23:46,430 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-02-21 03:23:46,431 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (10)] Waiting until timeout for monitored process [2022-02-21 03:23:46,432 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-02-21 03:23:46,438 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 03:23:46,438 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 03:23:46,438 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 03:23:46,438 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 03:23:46,438 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 03:23:46,438 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-02-21 03:23:46,439 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 03:23:46,454 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 03:23:46,470 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (10)] Forceful destruction successful, exit code 0 [2022-02-21 03:23:46,470 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:23:46,470 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:23:46,472 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-02-21 03:23:46,473 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (11)] Waiting until timeout for monitored process [2022-02-21 03:23:46,474 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-02-21 03:23:46,479 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 03:23:46,479 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 03:23:46,480 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 03:23:46,480 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 03:23:46,480 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 03:23:46,481 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-02-21 03:23:46,481 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 03:23:46,486 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2022-02-21 03:23:46,491 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2022-02-21 03:23:46,491 INFO L444 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 1 variables to zero. [2022-02-21 03:23:46,492 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:23:46,492 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:23:46,494 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-02-21 03:23:46,495 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (12)] Waiting until timeout for monitored process [2022-02-21 03:23:46,496 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2022-02-21 03:23:46,496 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2022-02-21 03:23:46,496 INFO L513 LassoAnalysis]: Proved termination. [2022-02-21 03:23:46,496 INFO L515 LassoAnalysis]: Termination argument consisting of: Ranking function f(rec2_#in~j) = 1*rec2_#in~j Supporting invariants [] [2022-02-21 03:23:46,515 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (11)] Forceful destruction successful, exit code 0 [2022-02-21 03:23:46,527 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2022-02-21 03:23:46,534 INFO L390 LassoCheck]: Loop: "~j := #in~j;" "assume !(~j <= 0);" "call #t~ret3 := rec1(~j);"< "~i := #in~i;" "assume !(~i <= 0);" "call #t~ret0 := rec1(~i - 2);"< "~i := #in~i;" "assume ~i <= 0;#res := 0;" "assume true;" >"#28#return;" "call #t~ret1 := rec1(#t~ret0 - 1);"< "~i := #in~i;" "assume ~i <= 0;#res := 0;" "assume true;" >"#30#return;" "call #t~ret2 := rec1(#t~ret1);"< "~i := #in~i;" "assume ~i <= 0;#res := 0;" "assume true;" >"#32#return;" "#res := 1 + #t~ret2;havoc #t~ret0;havoc #t~ret1;havoc #t~ret2;" "assume true;" >"#34#return;" "call #t~ret4 := rec2(#t~ret3 - 1);"< [2022-02-21 03:23:46,566 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:23:46,593 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:23:46,602 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:23:46,603 INFO L263 TraceCheckSpWp]: Trace formula consists of 36 conjuncts, 4 conjunts are in the unsatisfiable core [2022-02-21 03:23:46,614 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:23:46,614 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-21 03:23:46,637 INFO L290 TraceCheckUtils]: 0: Hoare triple {125#unseeded} assume { :begin_inline_ULTIMATE.init } true; {125#unseeded} is VALID [2022-02-21 03:23:46,637 INFO L290 TraceCheckUtils]: 1: Hoare triple {125#unseeded} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet5#1, main_#t~ret6#1, main_~x~0#1;main_~x~0#1 := main_#t~nondet5#1;havoc main_#t~nondet5#1; {125#unseeded} is VALID [2022-02-21 03:23:46,637 INFO L272 TraceCheckUtils]: 2: Hoare triple {125#unseeded} call main_#t~ret6#1 := rec2(main_~x~0#1); {125#unseeded} is VALID [2022-02-21 03:23:46,693 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:23:46,694 INFO L263 TraceCheckSpWp]: Trace formula consists of 197 conjuncts, 19 conjunts are in the unsatisfiable core [2022-02-21 03:23:46,715 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:23:46,717 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-21 03:23:46,954 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (12)] Forceful destruction successful, exit code 0 [2022-02-21 03:23:47,078 INFO L290 TraceCheckUtils]: 0: Hoare triple {128#(>= oldRank0 |rec2_#in~j|)} ~j := #in~j; {149#(<= rec2_~j oldRank0)} is VALID [2022-02-21 03:23:47,079 INFO L290 TraceCheckUtils]: 1: Hoare triple {149#(<= rec2_~j oldRank0)} assume !(~j <= 0); {153#(< 0 oldRank0)} is VALID [2022-02-21 03:23:47,080 INFO L272 TraceCheckUtils]: 2: Hoare triple {153#(< 0 oldRank0)} call #t~ret3 := rec1(~j); {157#(<= |old(oldRank0)| oldRank0)} is VALID [2022-02-21 03:23:47,080 INFO L290 TraceCheckUtils]: 3: Hoare triple {157#(<= |old(oldRank0)| oldRank0)} ~i := #in~i; {157#(<= |old(oldRank0)| oldRank0)} is VALID [2022-02-21 03:23:47,080 INFO L290 TraceCheckUtils]: 4: Hoare triple {157#(<= |old(oldRank0)| oldRank0)} assume !(~i <= 0); {157#(<= |old(oldRank0)| oldRank0)} is VALID [2022-02-21 03:23:47,081 INFO L272 TraceCheckUtils]: 5: Hoare triple {157#(<= |old(oldRank0)| oldRank0)} call #t~ret0 := rec1(~i - 2); {157#(<= |old(oldRank0)| oldRank0)} is VALID [2022-02-21 03:23:47,081 INFO L290 TraceCheckUtils]: 6: Hoare triple {157#(<= |old(oldRank0)| oldRank0)} ~i := #in~i; {157#(<= |old(oldRank0)| oldRank0)} is VALID [2022-02-21 03:23:47,081 INFO L290 TraceCheckUtils]: 7: Hoare triple {157#(<= |old(oldRank0)| oldRank0)} assume ~i <= 0;#res := 0; {157#(<= |old(oldRank0)| oldRank0)} is VALID [2022-02-21 03:23:47,082 INFO L290 TraceCheckUtils]: 8: Hoare triple {157#(<= |old(oldRank0)| oldRank0)} assume true; {157#(<= |old(oldRank0)| oldRank0)} is VALID [2022-02-21 03:23:47,083 INFO L284 TraceCheckUtils]: 9: Hoare quadruple {157#(<= |old(oldRank0)| oldRank0)} {157#(<= |old(oldRank0)| oldRank0)} #28#return; {157#(<= |old(oldRank0)| oldRank0)} is VALID [2022-02-21 03:23:47,083 INFO L272 TraceCheckUtils]: 10: Hoare triple {157#(<= |old(oldRank0)| oldRank0)} call #t~ret1 := rec1(#t~ret0 - 1); {157#(<= |old(oldRank0)| oldRank0)} is VALID [2022-02-21 03:23:47,084 INFO L290 TraceCheckUtils]: 11: Hoare triple {157#(<= |old(oldRank0)| oldRank0)} ~i := #in~i; {157#(<= |old(oldRank0)| oldRank0)} is VALID [2022-02-21 03:23:47,084 INFO L290 TraceCheckUtils]: 12: Hoare triple {157#(<= |old(oldRank0)| oldRank0)} assume ~i <= 0;#res := 0; {157#(<= |old(oldRank0)| oldRank0)} is VALID [2022-02-21 03:23:47,084 INFO L290 TraceCheckUtils]: 13: Hoare triple {157#(<= |old(oldRank0)| oldRank0)} assume true; {157#(<= |old(oldRank0)| oldRank0)} is VALID [2022-02-21 03:23:47,085 INFO L284 TraceCheckUtils]: 14: Hoare quadruple {157#(<= |old(oldRank0)| oldRank0)} {157#(<= |old(oldRank0)| oldRank0)} #30#return; {157#(<= |old(oldRank0)| oldRank0)} is VALID [2022-02-21 03:23:47,086 INFO L272 TraceCheckUtils]: 15: Hoare triple {157#(<= |old(oldRank0)| oldRank0)} call #t~ret2 := rec1(#t~ret1); {157#(<= |old(oldRank0)| oldRank0)} is VALID [2022-02-21 03:23:47,086 INFO L290 TraceCheckUtils]: 16: Hoare triple {157#(<= |old(oldRank0)| oldRank0)} ~i := #in~i; {157#(<= |old(oldRank0)| oldRank0)} is VALID [2022-02-21 03:23:47,086 INFO L290 TraceCheckUtils]: 17: Hoare triple {157#(<= |old(oldRank0)| oldRank0)} assume ~i <= 0;#res := 0; {203#(and (<= |rec1_#res| 0) (<= |old(oldRank0)| oldRank0))} is VALID [2022-02-21 03:23:47,087 INFO L290 TraceCheckUtils]: 18: Hoare triple {203#(and (<= |rec1_#res| 0) (<= |old(oldRank0)| oldRank0))} assume true; {203#(and (<= |rec1_#res| 0) (<= |old(oldRank0)| oldRank0))} is VALID [2022-02-21 03:23:47,088 INFO L284 TraceCheckUtils]: 19: Hoare quadruple {203#(and (<= |rec1_#res| 0) (<= |old(oldRank0)| oldRank0))} {157#(<= |old(oldRank0)| oldRank0)} #32#return; {210#(and (<= |rec1_#t~ret2| 0) (<= |old(oldRank0)| oldRank0))} is VALID [2022-02-21 03:23:47,088 INFO L290 TraceCheckUtils]: 20: Hoare triple {210#(and (<= |rec1_#t~ret2| 0) (<= |old(oldRank0)| oldRank0))} #res := 1 + #t~ret2;havoc #t~ret0;havoc #t~ret1;havoc #t~ret2; {214#(and (<= |rec1_#res| 1) (<= |old(oldRank0)| oldRank0))} is VALID [2022-02-21 03:23:47,089 INFO L290 TraceCheckUtils]: 21: Hoare triple {214#(and (<= |rec1_#res| 1) (<= |old(oldRank0)| oldRank0))} assume true; {214#(and (<= |rec1_#res| 1) (<= |old(oldRank0)| oldRank0))} is VALID [2022-02-21 03:23:47,089 INFO L284 TraceCheckUtils]: 22: Hoare quadruple {214#(and (<= |rec1_#res| 1) (<= |old(oldRank0)| oldRank0))} {153#(< 0 oldRank0)} #34#return; {221#(and (<= |rec2_#t~ret3| 1) (< 0 oldRank0))} is VALID [2022-02-21 03:23:47,090 INFO L272 TraceCheckUtils]: 23: Hoare triple {221#(and (<= |rec2_#t~ret3| 1) (< 0 oldRank0))} call #t~ret4 := rec2(#t~ret3 - 1); {138#(or (and (>= oldRank0 0) (> oldRank0 |rec2_#in~j|)) unseeded)} is VALID [2022-02-21 03:23:47,090 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 8 proven. 2 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2022-02-21 03:23:47,092 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 9 states, 7 states have (on average 1.7142857142857142) internal successors, (12), 6 states have internal predecessors, (12), 4 states have call successors, (6), 2 states have call predecessors, (6), 3 states have return successors, (4), 3 states have call predecessors, (4), 2 states have call successors, (4) [2022-02-21 03:23:47,117 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 22 edges. 22 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-21 03:23:47,119 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 9 states, 7 states have (on average 1.7142857142857142) internal successors, (12), 6 states have internal predecessors, (12), 4 states have call successors, (6), 2 states have call predecessors, (6), 3 states have return successors, (4), 3 states have call predecessors, (4), 2 states have call successors, (4) Stem has 3 letters. Loop has 24 letters. [2022-02-21 03:23:47,119 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:23:47,121 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 8 loop predicates [2022-02-21 03:23:47,122 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 17 states and 23 transitions. cyclomatic complexity: 8 Second operand has 9 states, 7 states have (on average 1.7142857142857142) internal successors, (12), 6 states have internal predecessors, (12), 4 states have call successors, (6), 2 states have call predecessors, (6), 3 states have return successors, (4), 3 states have call predecessors, (4), 2 states have call successors, (4) [2022-02-21 03:23:47,613 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 17 states and 23 transitions. cyclomatic complexity: 8. Second operand has 9 states, 7 states have (on average 1.7142857142857142) internal successors, (12), 6 states have internal predecessors, (12), 4 states have call successors, (6), 2 states have call predecessors, (6), 3 states have return successors, (4), 3 states have call predecessors, (4), 2 states have call successors, (4) Result 102 states and 148 transitions. Complement of second has 42 states. [2022-02-21 03:23:47,614 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 10 states 1 stem states 8 non-accepting loop states 1 accepting loop states [2022-02-21 03:23:47,614 INFO L123 tractBuchiDifference]: Start testing correctness of buchiDifferenceNCSBLazy3 [2022-02-21 03:23:47,614 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 17 states and 23 transitions. cyclomatic complexity: 8 [2022-02-21 03:23:47,614 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 03:23:47,614 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 03:23:47,614 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 9 states, 7 states have (on average 1.7142857142857142) internal successors, (12), 6 states have internal predecessors, (12), 4 states have call successors, (6), 2 states have call predecessors, (6), 3 states have return successors, (4), 3 states have call predecessors, (4), 2 states have call successors, (4) [2022-02-21 03:23:47,618 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 6 [2022-02-21 03:23:47,618 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 03:23:47,618 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 03:23:47,619 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 102 states and 148 transitions. [2022-02-21 03:23:47,620 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 9 [2022-02-21 03:23:47,621 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 03:23:47,621 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 03:23:47,622 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 17 states and 23 transitions. cyclomatic complexity: 8 [2022-02-21 03:23:47,629 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 14 examples of accepted words. [2022-02-21 03:23:47,630 INFO L70 LassoExtractor]: Start lassoExtractor. Operand has 9 states, 7 states have (on average 1.7142857142857142) internal successors, (12), 6 states have internal predecessors, (12), 4 states have call successors, (6), 2 states have call predecessors, (6), 3 states have return successors, (4), 3 states have call predecessors, (4), 2 states have call successors, (4) [2022-02-21 03:23:47,632 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 6 [2022-02-21 03:23:47,632 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 1 examples of accepted words. [2022-02-21 03:23:47,632 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 102 states and 148 transitions. cyclomatic complexity: 50 [2022-02-21 03:23:47,644 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 16 examples of accepted words. [2022-02-21 03:23:47,644 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 17 states and 23 transitions. cyclomatic complexity: 8 Stem has 3 letters. Loop has 24 letters. [2022-02-21 03:23:47,645 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:23:47,645 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 9 states, 7 states have (on average 1.7142857142857142) internal successors, (12), 6 states have internal predecessors, (12), 4 states have call successors, (6), 2 states have call predecessors, (6), 3 states have return successors, (4), 3 states have call predecessors, (4), 2 states have call successors, (4) Stem has 3 letters. Loop has 24 letters. [2022-02-21 03:23:47,645 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:23:47,645 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 102 states and 148 transitions. cyclomatic complexity: 50 Stem has 3 letters. Loop has 24 letters. [2022-02-21 03:23:47,646 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:23:47,646 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 17 states and 23 transitions. cyclomatic complexity: 8 Stem has 1 letters. Loop has 9 letters. [2022-02-21 03:23:47,646 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:23:47,647 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 9 states, 7 states have (on average 1.7142857142857142) internal successors, (12), 6 states have internal predecessors, (12), 4 states have call successors, (6), 2 states have call predecessors, (6), 3 states have return successors, (4), 3 states have call predecessors, (4), 2 states have call successors, (4) Stem has 1 letters. Loop has 9 letters. [2022-02-21 03:23:47,647 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:23:47,647 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 102 states and 148 transitions. cyclomatic complexity: 50 Stem has 1 letters. Loop has 9 letters. [2022-02-21 03:23:47,647 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:23:47,647 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 17 states and 23 transitions. cyclomatic complexity: 8 Stem has 9 letters. Loop has 3 letters. [2022-02-21 03:23:47,647 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:23:47,648 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 9 states, 7 states have (on average 1.7142857142857142) internal successors, (12), 6 states have internal predecessors, (12), 4 states have call successors, (6), 2 states have call predecessors, (6), 3 states have return successors, (4), 3 states have call predecessors, (4), 2 states have call successors, (4) Stem has 9 letters. Loop has 3 letters. [2022-02-21 03:23:47,648 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:23:47,648 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 102 states and 148 transitions. cyclomatic complexity: 50 Stem has 9 letters. Loop has 3 letters. [2022-02-21 03:23:47,648 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:23:47,648 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 17 states and 23 transitions. cyclomatic complexity: 8 Stem has 102 letters. Loop has 102 letters. [2022-02-21 03:23:47,649 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:23:47,649 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 9 states, 7 states have (on average 1.7142857142857142) internal successors, (12), 6 states have internal predecessors, (12), 4 states have call successors, (6), 2 states have call predecessors, (6), 3 states have return successors, (4), 3 states have call predecessors, (4), 2 states have call successors, (4) Stem has 102 letters. Loop has 102 letters. [2022-02-21 03:23:47,649 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:23:47,649 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 102 states and 148 transitions. cyclomatic complexity: 50 Stem has 102 letters. Loop has 102 letters. [2022-02-21 03:23:47,649 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:23:47,649 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 17 states and 23 transitions. cyclomatic complexity: 8 Stem has 17 letters. Loop has 17 letters. [2022-02-21 03:23:47,650 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:23:47,650 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 9 states, 7 states have (on average 1.7142857142857142) internal successors, (12), 6 states have internal predecessors, (12), 4 states have call successors, (6), 2 states have call predecessors, (6), 3 states have return successors, (4), 3 states have call predecessors, (4), 2 states have call successors, (4) Stem has 17 letters. Loop has 17 letters. [2022-02-21 03:23:47,650 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:23:47,650 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 102 states and 148 transitions. cyclomatic complexity: 50 Stem has 17 letters. Loop has 17 letters. [2022-02-21 03:23:47,650 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:23:47,650 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 17 states and 23 transitions. cyclomatic complexity: 8 Stem has 10 letters. Loop has 10 letters. [2022-02-21 03:23:47,650 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:23:47,651 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 9 states, 7 states have (on average 1.7142857142857142) internal successors, (12), 6 states have internal predecessors, (12), 4 states have call successors, (6), 2 states have call predecessors, (6), 3 states have return successors, (4), 3 states have call predecessors, (4), 2 states have call successors, (4) Stem has 10 letters. Loop has 10 letters. [2022-02-21 03:23:47,651 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:23:47,651 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 102 states and 148 transitions. cyclomatic complexity: 50 Stem has 10 letters. Loop has 10 letters. [2022-02-21 03:23:47,651 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:23:47,651 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 17 states and 23 transitions. cyclomatic complexity: 8 Stem has 7 letters. Loop has 3 letters. [2022-02-21 03:23:47,651 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:23:47,651 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 9 states, 7 states have (on average 1.7142857142857142) internal successors, (12), 6 states have internal predecessors, (12), 4 states have call successors, (6), 2 states have call predecessors, (6), 3 states have return successors, (4), 3 states have call predecessors, (4), 2 states have call successors, (4) Stem has 7 letters. Loop has 3 letters. [2022-02-21 03:23:47,652 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:23:47,652 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 102 states and 148 transitions. cyclomatic complexity: 50 Stem has 7 letters. Loop has 3 letters. [2022-02-21 03:23:47,652 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:23:47,652 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 17 states and 23 transitions. cyclomatic complexity: 8 Stem has 13 letters. Loop has 24 letters. [2022-02-21 03:23:47,652 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:23:47,652 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 9 states, 7 states have (on average 1.7142857142857142) internal successors, (12), 6 states have internal predecessors, (12), 4 states have call successors, (6), 2 states have call predecessors, (6), 3 states have return successors, (4), 3 states have call predecessors, (4), 2 states have call successors, (4) Stem has 13 letters. Loop has 24 letters. [2022-02-21 03:23:47,653 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:23:47,653 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 102 states and 148 transitions. cyclomatic complexity: 50 Stem has 13 letters. Loop has 24 letters. [2022-02-21 03:23:47,654 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:23:47,654 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 17 states and 23 transitions. cyclomatic complexity: 8 Stem has 18 letters. Loop has 45 letters. [2022-02-21 03:23:47,654 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:23:47,654 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 9 states, 7 states have (on average 1.7142857142857142) internal successors, (12), 6 states have internal predecessors, (12), 4 states have call successors, (6), 2 states have call predecessors, (6), 3 states have return successors, (4), 3 states have call predecessors, (4), 2 states have call successors, (4) Stem has 18 letters. Loop has 45 letters. [2022-02-21 03:23:47,655 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:23:47,655 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 102 states and 148 transitions. cyclomatic complexity: 50 Stem has 18 letters. Loop has 45 letters. [2022-02-21 03:23:47,656 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:23:47,656 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 17 states and 23 transitions. cyclomatic complexity: 8 Stem has 8 letters. Loop has 3 letters. [2022-02-21 03:23:47,656 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:23:47,656 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 9 states, 7 states have (on average 1.7142857142857142) internal successors, (12), 6 states have internal predecessors, (12), 4 states have call successors, (6), 2 states have call predecessors, (6), 3 states have return successors, (4), 3 states have call predecessors, (4), 2 states have call successors, (4) Stem has 8 letters. Loop has 3 letters. [2022-02-21 03:23:47,656 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:23:47,656 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 102 states and 148 transitions. cyclomatic complexity: 50 Stem has 8 letters. Loop has 3 letters. [2022-02-21 03:23:47,657 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:23:47,657 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 17 states and 23 transitions. cyclomatic complexity: 8 Stem has 6 letters. Loop has 3 letters. [2022-02-21 03:23:47,657 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:23:47,657 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 9 states, 7 states have (on average 1.7142857142857142) internal successors, (12), 6 states have internal predecessors, (12), 4 states have call successors, (6), 2 states have call predecessors, (6), 3 states have return successors, (4), 3 states have call predecessors, (4), 2 states have call successors, (4) Stem has 6 letters. Loop has 3 letters. [2022-02-21 03:23:47,657 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:23:47,657 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 102 states and 148 transitions. cyclomatic complexity: 50 Stem has 6 letters. Loop has 3 letters. [2022-02-21 03:23:47,658 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:23:47,658 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 17 states and 23 transitions. cyclomatic complexity: 8 Stem has 18 letters. Loop has 29 letters. [2022-02-21 03:23:47,658 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:23:47,658 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 9 states, 7 states have (on average 1.7142857142857142) internal successors, (12), 6 states have internal predecessors, (12), 4 states have call successors, (6), 2 states have call predecessors, (6), 3 states have return successors, (4), 3 states have call predecessors, (4), 2 states have call successors, (4) Stem has 18 letters. Loop has 29 letters. [2022-02-21 03:23:47,659 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:23:47,659 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 102 states and 148 transitions. cyclomatic complexity: 50 Stem has 18 letters. Loop has 29 letters. [2022-02-21 03:23:47,659 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:23:47,659 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 17 states and 23 transitions. cyclomatic complexity: 8 Stem has 18 letters. Loop has 45 letters. [2022-02-21 03:23:47,680 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:23:47,680 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 9 states, 7 states have (on average 1.7142857142857142) internal successors, (12), 6 states have internal predecessors, (12), 4 states have call successors, (6), 2 states have call predecessors, (6), 3 states have return successors, (4), 3 states have call predecessors, (4), 2 states have call successors, (4) Stem has 18 letters. Loop has 45 letters. [2022-02-21 03:23:47,681 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:23:47,681 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 102 states and 148 transitions. cyclomatic complexity: 50 Stem has 18 letters. Loop has 45 letters. [2022-02-21 03:23:47,682 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:23:47,682 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 17 states and 23 transitions. cyclomatic complexity: 8 Stem has 13 letters. Loop has 8 letters. [2022-02-21 03:23:47,682 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:23:47,683 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 9 states, 7 states have (on average 1.7142857142857142) internal successors, (12), 6 states have internal predecessors, (12), 4 states have call successors, (6), 2 states have call predecessors, (6), 3 states have return successors, (4), 3 states have call predecessors, (4), 2 states have call successors, (4) Stem has 13 letters. Loop has 8 letters. [2022-02-21 03:23:47,683 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:23:47,683 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 102 states and 148 transitions. cyclomatic complexity: 50 Stem has 13 letters. Loop has 8 letters. [2022-02-21 03:23:47,684 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:23:47,684 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 17 states and 23 transitions. cyclomatic complexity: 8 Stem has 13 letters. Loop has 24 letters. [2022-02-21 03:23:47,684 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:23:47,684 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 9 states, 7 states have (on average 1.7142857142857142) internal successors, (12), 6 states have internal predecessors, (12), 4 states have call successors, (6), 2 states have call predecessors, (6), 3 states have return successors, (4), 3 states have call predecessors, (4), 2 states have call successors, (4) Stem has 13 letters. Loop has 24 letters. [2022-02-21 03:23:47,685 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:23:47,685 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 102 states and 148 transitions. cyclomatic complexity: 50 Stem has 13 letters. Loop has 24 letters. [2022-02-21 03:23:47,686 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:23:47,686 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 17 states and 23 transitions. cyclomatic complexity: 8 Stem has 26 letters. Loop has 24 letters. [2022-02-21 03:23:47,686 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:23:47,686 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 9 states, 7 states have (on average 1.7142857142857142) internal successors, (12), 6 states have internal predecessors, (12), 4 states have call successors, (6), 2 states have call predecessors, (6), 3 states have return successors, (4), 3 states have call predecessors, (4), 2 states have call successors, (4) Stem has 26 letters. Loop has 24 letters. [2022-02-21 03:23:47,687 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:23:47,687 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 102 states and 148 transitions. cyclomatic complexity: 50 Stem has 26 letters. Loop has 24 letters. [2022-02-21 03:23:47,687 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:23:47,688 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 17 states and 23 transitions. cyclomatic complexity: 8 Stem has 3 letters. Loop has 24 letters. [2022-02-21 03:23:47,688 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:23:47,688 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 9 states, 7 states have (on average 1.7142857142857142) internal successors, (12), 6 states have internal predecessors, (12), 4 states have call successors, (6), 2 states have call predecessors, (6), 3 states have return successors, (4), 3 states have call predecessors, (4), 2 states have call successors, (4) Stem has 3 letters. Loop has 24 letters. [2022-02-21 03:23:47,688 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:23:47,688 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 102 states and 148 transitions. cyclomatic complexity: 50 Stem has 3 letters. Loop has 24 letters. [2022-02-21 03:23:47,689 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:23:47,689 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 17 states and 23 transitions. cyclomatic complexity: 8 Stem has 5 letters. Loop has 24 letters. [2022-02-21 03:23:47,689 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:23:47,690 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 9 states, 7 states have (on average 1.7142857142857142) internal successors, (12), 6 states have internal predecessors, (12), 4 states have call successors, (6), 2 states have call predecessors, (6), 3 states have return successors, (4), 3 states have call predecessors, (4), 2 states have call successors, (4) Stem has 5 letters. Loop has 24 letters. [2022-02-21 03:23:47,690 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:23:47,690 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 102 states and 148 transitions. cyclomatic complexity: 50 Stem has 5 letters. Loop has 24 letters. [2022-02-21 03:23:47,691 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:23:47,691 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 17 states and 23 transitions. cyclomatic complexity: 8 Stem has 4 letters. Loop has 24 letters. [2022-02-21 03:23:47,691 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:23:47,691 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 9 states, 7 states have (on average 1.7142857142857142) internal successors, (12), 6 states have internal predecessors, (12), 4 states have call successors, (6), 2 states have call predecessors, (6), 3 states have return successors, (4), 3 states have call predecessors, (4), 2 states have call successors, (4) Stem has 4 letters. Loop has 24 letters. [2022-02-21 03:23:47,692 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:23:47,692 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 102 states and 148 transitions. cyclomatic complexity: 50 Stem has 4 letters. Loop has 24 letters. [2022-02-21 03:23:47,692 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:23:47,692 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 17 states and 23 transitions. cyclomatic complexity: 8 Stem has 26 letters. Loop has 24 letters. [2022-02-21 03:23:47,693 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:23:47,693 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 9 states, 7 states have (on average 1.7142857142857142) internal successors, (12), 6 states have internal predecessors, (12), 4 states have call successors, (6), 2 states have call predecessors, (6), 3 states have return successors, (4), 3 states have call predecessors, (4), 2 states have call successors, (4) Stem has 26 letters. Loop has 24 letters. [2022-02-21 03:23:47,693 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:23:47,693 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 102 states and 148 transitions. cyclomatic complexity: 50 Stem has 26 letters. Loop has 24 letters. [2022-02-21 03:23:47,694 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:23:47,694 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 17 states and 23 transitions. cyclomatic complexity: 8 Stem has 1 letters. Loop has 9 letters. [2022-02-21 03:23:47,694 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:23:47,695 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 9 states, 7 states have (on average 1.7142857142857142) internal successors, (12), 6 states have internal predecessors, (12), 4 states have call successors, (6), 2 states have call predecessors, (6), 3 states have return successors, (4), 3 states have call predecessors, (4), 2 states have call successors, (4) Stem has 1 letters. Loop has 9 letters. [2022-02-21 03:23:47,695 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:23:47,695 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 102 states and 148 transitions. cyclomatic complexity: 50 Stem has 1 letters. Loop has 9 letters. [2022-02-21 03:23:47,695 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:23:47,695 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 17 states and 23 transitions. cyclomatic complexity: 8 Stem has 11 letters. Loop has 3 letters. [2022-02-21 03:23:47,695 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:23:47,695 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 9 states, 7 states have (on average 1.7142857142857142) internal successors, (12), 6 states have internal predecessors, (12), 4 states have call successors, (6), 2 states have call predecessors, (6), 3 states have return successors, (4), 3 states have call predecessors, (4), 2 states have call successors, (4) Stem has 11 letters. Loop has 3 letters. [2022-02-21 03:23:47,696 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:23:47,696 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 102 states and 148 transitions. cyclomatic complexity: 50 Stem has 11 letters. Loop has 3 letters. [2022-02-21 03:23:47,696 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:23:47,696 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 17 states and 23 transitions. cyclomatic complexity: 8 Stem has 21 letters. Loop has 13 letters. [2022-02-21 03:23:47,696 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:23:47,696 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 9 states, 7 states have (on average 1.7142857142857142) internal successors, (12), 6 states have internal predecessors, (12), 4 states have call successors, (6), 2 states have call predecessors, (6), 3 states have return successors, (4), 3 states have call predecessors, (4), 2 states have call successors, (4) Stem has 21 letters. Loop has 13 letters. [2022-02-21 03:23:47,697 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:23:47,697 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 102 states and 148 transitions. cyclomatic complexity: 50 Stem has 21 letters. Loop has 13 letters. [2022-02-21 03:23:47,697 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:23:47,697 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 17 states and 23 transitions. cyclomatic complexity: 8 Stem has 16 letters. Loop has 8 letters. [2022-02-21 03:23:47,697 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:23:47,697 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 9 states, 7 states have (on average 1.7142857142857142) internal successors, (12), 6 states have internal predecessors, (12), 4 states have call successors, (6), 2 states have call predecessors, (6), 3 states have return successors, (4), 3 states have call predecessors, (4), 2 states have call successors, (4) Stem has 16 letters. Loop has 8 letters. [2022-02-21 03:23:47,698 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:23:47,698 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 102 states and 148 transitions. cyclomatic complexity: 50 Stem has 16 letters. Loop has 8 letters. [2022-02-21 03:23:47,698 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:23:47,698 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 17 states and 23 transitions. cyclomatic complexity: 8 Stem has 9 letters. Loop has 3 letters. [2022-02-21 03:23:47,698 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:23:47,698 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 9 states, 7 states have (on average 1.7142857142857142) internal successors, (12), 6 states have internal predecessors, (12), 4 states have call successors, (6), 2 states have call predecessors, (6), 3 states have return successors, (4), 3 states have call predecessors, (4), 2 states have call successors, (4) Stem has 9 letters. Loop has 3 letters. [2022-02-21 03:23:47,698 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:23:47,699 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 102 states and 148 transitions. cyclomatic complexity: 50 Stem has 9 letters. Loop has 3 letters. [2022-02-21 03:23:47,699 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:23:47,699 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 17 states and 23 transitions. cyclomatic complexity: 8 Stem has 10 letters. Loop has 3 letters. [2022-02-21 03:23:47,699 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:23:47,699 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 9 states, 7 states have (on average 1.7142857142857142) internal successors, (12), 6 states have internal predecessors, (12), 4 states have call successors, (6), 2 states have call predecessors, (6), 3 states have return successors, (4), 3 states have call predecessors, (4), 2 states have call successors, (4) Stem has 10 letters. Loop has 3 letters. [2022-02-21 03:23:47,699 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:23:47,700 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 102 states and 148 transitions. cyclomatic complexity: 50 Stem has 10 letters. Loop has 3 letters. [2022-02-21 03:23:47,700 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:23:47,700 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 17 states and 23 transitions. cyclomatic complexity: 8 Stem has 16 letters. Loop has 8 letters. [2022-02-21 03:23:47,700 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:23:47,700 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 9 states, 7 states have (on average 1.7142857142857142) internal successors, (12), 6 states have internal predecessors, (12), 4 states have call successors, (6), 2 states have call predecessors, (6), 3 states have return successors, (4), 3 states have call predecessors, (4), 2 states have call successors, (4) Stem has 16 letters. Loop has 8 letters. [2022-02-21 03:23:47,700 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:23:47,700 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 102 states and 148 transitions. cyclomatic complexity: 50 Stem has 16 letters. Loop has 8 letters. [2022-02-21 03:23:47,701 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:23:47,701 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 17 states and 23 transitions. cyclomatic complexity: 8 Stem has 16 letters. Loop has 24 letters. [2022-02-21 03:23:47,701 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:23:47,701 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 9 states, 7 states have (on average 1.7142857142857142) internal successors, (12), 6 states have internal predecessors, (12), 4 states have call successors, (6), 2 states have call predecessors, (6), 3 states have return successors, (4), 3 states have call predecessors, (4), 2 states have call successors, (4) Stem has 16 letters. Loop has 24 letters. [2022-02-21 03:23:47,701 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:23:47,701 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 102 states and 148 transitions. cyclomatic complexity: 50 Stem has 16 letters. Loop has 24 letters. [2022-02-21 03:23:47,702 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:23:47,702 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 17 states and 23 transitions. cyclomatic complexity: 8 Stem has 16 letters. Loop has 40 letters. [2022-02-21 03:23:47,702 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:23:47,702 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 9 states, 7 states have (on average 1.7142857142857142) internal successors, (12), 6 states have internal predecessors, (12), 4 states have call successors, (6), 2 states have call predecessors, (6), 3 states have return successors, (4), 3 states have call predecessors, (4), 2 states have call successors, (4) Stem has 16 letters. Loop has 40 letters. [2022-02-21 03:23:47,703 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:23:47,703 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 102 states and 148 transitions. cyclomatic complexity: 50 Stem has 16 letters. Loop has 40 letters. [2022-02-21 03:23:47,703 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:23:47,703 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 17 states and 23 transitions. cyclomatic complexity: 8 Stem has 21 letters. Loop has 13 letters. [2022-02-21 03:23:47,703 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:23:47,704 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 9 states, 7 states have (on average 1.7142857142857142) internal successors, (12), 6 states have internal predecessors, (12), 4 states have call successors, (6), 2 states have call predecessors, (6), 3 states have return successors, (4), 3 states have call predecessors, (4), 2 states have call successors, (4) Stem has 21 letters. Loop has 13 letters. [2022-02-21 03:23:47,704 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:23:47,704 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 102 states and 148 transitions. cyclomatic complexity: 50 Stem has 21 letters. Loop has 13 letters. [2022-02-21 03:23:47,704 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:23:47,704 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 17 states and 23 transitions. cyclomatic complexity: 8 Stem has 21 letters. Loop has 45 letters. [2022-02-21 03:23:47,704 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:23:47,705 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 9 states, 7 states have (on average 1.7142857142857142) internal successors, (12), 6 states have internal predecessors, (12), 4 states have call successors, (6), 2 states have call predecessors, (6), 3 states have return successors, (4), 3 states have call predecessors, (4), 2 states have call successors, (4) Stem has 21 letters. Loop has 45 letters. [2022-02-21 03:23:47,705 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:23:47,705 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 102 states and 148 transitions. cyclomatic complexity: 50 Stem has 21 letters. Loop has 45 letters. [2022-02-21 03:23:47,705 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:23:47,705 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 17 states and 23 transitions. cyclomatic complexity: 8 Stem has 21 letters. Loop has 29 letters. [2022-02-21 03:23:47,706 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:23:47,706 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 9 states, 7 states have (on average 1.7142857142857142) internal successors, (12), 6 states have internal predecessors, (12), 4 states have call successors, (6), 2 states have call predecessors, (6), 3 states have return successors, (4), 3 states have call predecessors, (4), 2 states have call successors, (4) Stem has 21 letters. Loop has 29 letters. [2022-02-21 03:23:47,706 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:23:47,706 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 102 states and 148 transitions. cyclomatic complexity: 50 Stem has 21 letters. Loop has 29 letters. [2022-02-21 03:23:47,706 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:23:47,706 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 17 states and 23 transitions. cyclomatic complexity: 8 Stem has 107 letters. Loop has 40 letters. [2022-02-21 03:23:47,707 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:23:47,707 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 9 states, 7 states have (on average 1.7142857142857142) internal successors, (12), 6 states have internal predecessors, (12), 4 states have call successors, (6), 2 states have call predecessors, (6), 3 states have return successors, (4), 3 states have call predecessors, (4), 2 states have call successors, (4) Stem has 107 letters. Loop has 40 letters. [2022-02-21 03:23:47,707 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:23:47,707 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 102 states and 148 transitions. cyclomatic complexity: 50 Stem has 107 letters. Loop has 40 letters. [2022-02-21 03:23:47,708 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:23:47,708 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 17 states and 23 transitions. cyclomatic complexity: 8 Stem has 108 letters. Loop has 40 letters. [2022-02-21 03:23:47,708 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:23:47,708 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 9 states, 7 states have (on average 1.7142857142857142) internal successors, (12), 6 states have internal predecessors, (12), 4 states have call successors, (6), 2 states have call predecessors, (6), 3 states have return successors, (4), 3 states have call predecessors, (4), 2 states have call successors, (4) Stem has 108 letters. Loop has 40 letters. [2022-02-21 03:23:47,709 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:23:47,709 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 102 states and 148 transitions. cyclomatic complexity: 50 Stem has 108 letters. Loop has 40 letters. [2022-02-21 03:23:47,709 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:23:47,709 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 17 states and 23 transitions. cyclomatic complexity: 8 Stem has 109 letters. Loop has 40 letters. [2022-02-21 03:23:47,710 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:23:47,710 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 9 states, 7 states have (on average 1.7142857142857142) internal successors, (12), 6 states have internal predecessors, (12), 4 states have call successors, (6), 2 states have call predecessors, (6), 3 states have return successors, (4), 3 states have call predecessors, (4), 2 states have call successors, (4) Stem has 109 letters. Loop has 40 letters. [2022-02-21 03:23:47,710 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:23:47,710 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 102 states and 148 transitions. cyclomatic complexity: 50 Stem has 109 letters. Loop has 40 letters. [2022-02-21 03:23:47,711 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:23:47,711 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 17 states and 23 transitions. cyclomatic complexity: 8 Stem has 146 letters. Loop has 40 letters. [2022-02-21 03:23:47,711 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:23:47,711 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 9 states, 7 states have (on average 1.7142857142857142) internal successors, (12), 6 states have internal predecessors, (12), 4 states have call successors, (6), 2 states have call predecessors, (6), 3 states have return successors, (4), 3 states have call predecessors, (4), 2 states have call successors, (4) Stem has 146 letters. Loop has 40 letters. [2022-02-21 03:23:47,712 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:23:47,712 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 102 states and 148 transitions. cyclomatic complexity: 50 Stem has 146 letters. Loop has 40 letters. [2022-02-21 03:23:47,712 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:23:47,712 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 17 states and 23 transitions. cyclomatic complexity: 8 Stem has 146 letters. Loop has 40 letters. [2022-02-21 03:23:47,713 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:23:47,713 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 9 states, 7 states have (on average 1.7142857142857142) internal successors, (12), 6 states have internal predecessors, (12), 4 states have call successors, (6), 2 states have call predecessors, (6), 3 states have return successors, (4), 3 states have call predecessors, (4), 2 states have call successors, (4) Stem has 146 letters. Loop has 40 letters. [2022-02-21 03:23:47,713 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:23:47,713 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 102 states and 148 transitions. cyclomatic complexity: 50 Stem has 146 letters. Loop has 40 letters. [2022-02-21 03:23:47,714 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:23:47,714 INFO L161 tractBuchiDifference]: Finished testing correctness of buchiDifferenceNCSBLazy3 [2022-02-21 03:23:47,715 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9 states, 7 states have (on average 1.7142857142857142) internal successors, (12), 6 states have internal predecessors, (12), 4 states have call successors, (6), 2 states have call predecessors, (6), 3 states have return successors, (4), 3 states have call predecessors, (4), 2 states have call successors, (4) [2022-02-21 03:23:47,716 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 37 transitions. [2022-02-21 03:23:47,716 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 10 states and 37 transitions. Stem has 3 letters. Loop has 24 letters. [2022-02-21 03:23:47,716 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:23:47,717 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 10 states and 37 transitions. Stem has 27 letters. Loop has 24 letters. [2022-02-21 03:23:47,717 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:23:47,717 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 10 states and 37 transitions. Stem has 3 letters. Loop has 48 letters. [2022-02-21 03:23:47,717 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:23:47,717 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 102 states and 148 transitions. cyclomatic complexity: 50 [2022-02-21 03:23:47,724 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 9 [2022-02-21 03:23:47,729 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 102 states to 90 states and 136 transitions. [2022-02-21 03:23:47,730 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 39 [2022-02-21 03:23:47,730 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 42 [2022-02-21 03:23:47,730 INFO L73 IsDeterministic]: Start isDeterministic. Operand 90 states and 136 transitions. [2022-02-21 03:23:47,730 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2022-02-21 03:23:47,730 INFO L681 BuchiCegarLoop]: Abstraction has 90 states and 136 transitions. [2022-02-21 03:23:47,731 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 90 states and 136 transitions. [2022-02-21 03:23:47,737 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 90 to 63. [2022-02-21 03:23:47,737 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-21 03:23:47,738 INFO L82 GeneralOperation]: Start isEquivalent. First operand 90 states and 136 transitions. Second operand has 63 states, 34 states have (on average 1.1176470588235294) internal successors, (38), 36 states have internal predecessors, (38), 20 states have call successors, (20), 8 states have call predecessors, (20), 9 states have return successors, (41), 18 states have call predecessors, (41), 16 states have call successors, (41) [2022-02-21 03:23:47,738 INFO L74 IsIncluded]: Start isIncluded. First operand 90 states and 136 transitions. Second operand has 63 states, 34 states have (on average 1.1176470588235294) internal successors, (38), 36 states have internal predecessors, (38), 20 states have call successors, (20), 8 states have call predecessors, (20), 9 states have return successors, (41), 18 states have call predecessors, (41), 16 states have call successors, (41) [2022-02-21 03:23:47,738 INFO L87 Difference]: Start difference. First operand 90 states and 136 transitions. Second operand has 63 states, 34 states have (on average 1.1176470588235294) internal successors, (38), 36 states have internal predecessors, (38), 20 states have call successors, (20), 8 states have call predecessors, (20), 9 states have return successors, (41), 18 states have call predecessors, (41), 16 states have call successors, (41) [2022-02-21 03:23:47,739 INFO L149 Difference]: Subtrahend was not deterministic. Recomputing result with determinization. [2022-02-21 03:23:47,755 INFO L93 Difference]: Finished difference Result 246 states and 376 transitions. [2022-02-21 03:23:47,756 INFO L276 IsEmpty]: Start isEmpty. Operand 246 states and 376 transitions. [2022-02-21 03:23:47,759 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 03:23:47,759 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 03:23:47,759 INFO L74 IsIncluded]: Start isIncluded. First operand has 63 states, 34 states have (on average 1.1176470588235294) internal successors, (38), 36 states have internal predecessors, (38), 20 states have call successors, (20), 8 states have call predecessors, (20), 9 states have return successors, (41), 18 states have call predecessors, (41), 16 states have call successors, (41) Second operand 90 states and 136 transitions. [2022-02-21 03:23:47,760 INFO L87 Difference]: Start difference. First operand has 63 states, 34 states have (on average 1.1176470588235294) internal successors, (38), 36 states have internal predecessors, (38), 20 states have call successors, (20), 8 states have call predecessors, (20), 9 states have return successors, (41), 18 states have call predecessors, (41), 16 states have call successors, (41) Second operand 90 states and 136 transitions. [2022-02-21 03:23:47,760 INFO L149 Difference]: Subtrahend was not deterministic. Recomputing result with determinization. [2022-02-21 03:23:47,792 INFO L93 Difference]: Finished difference Result 361 states and 554 transitions. [2022-02-21 03:23:47,793 INFO L276 IsEmpty]: Start isEmpty. Operand 361 states and 554 transitions. [2022-02-21 03:23:47,795 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 03:23:47,796 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 03:23:47,796 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-21 03:23:47,796 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-21 03:23:47,796 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 63 states, 34 states have (on average 1.1176470588235294) internal successors, (38), 36 states have internal predecessors, (38), 20 states have call successors, (20), 8 states have call predecessors, (20), 9 states have return successors, (41), 18 states have call predecessors, (41), 16 states have call successors, (41) [2022-02-21 03:23:47,800 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 99 transitions. [2022-02-21 03:23:47,801 INFO L704 BuchiCegarLoop]: Abstraction has 63 states and 99 transitions. [2022-02-21 03:23:47,801 INFO L587 BuchiCegarLoop]: Abstraction has 63 states and 99 transitions. [2022-02-21 03:23:47,801 INFO L425 BuchiCegarLoop]: ======== Iteration 3============ [2022-02-21 03:23:47,802 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 63 states and 99 transitions. [2022-02-21 03:23:47,803 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 9 [2022-02-21 03:23:47,804 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 03:23:47,804 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 03:23:47,804 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-21 03:23:47,804 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2022-02-21 03:23:47,804 INFO L791 eck$LassoCheckResult]: Stem: 392#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true; 393#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet5#1, main_#t~ret6#1, main_~x~0#1;main_~x~0#1 := main_#t~nondet5#1;havoc main_#t~nondet5#1; 387#L25 call main_#t~ret6#1 := rec2(main_~x~0#1);< 412#rec2ENTRY ~j := #in~j; 423#L18 assume !(~j <= 0); 415#L20 call #t~ret3 := rec1(~j);< 433#rec1ENTRY ~i := #in~i; 424#L12 assume !(~i <= 0); 397#L14 call #t~ret0 := rec1(~i - 2);< 413#rec1ENTRY [2022-02-21 03:23:47,804 INFO L793 eck$LassoCheckResult]: Loop: 413#rec1ENTRY ~i := #in~i; 426#L12 assume !(~i <= 0); 395#L14 call #t~ret0 := rec1(~i - 2);< 413#rec1ENTRY [2022-02-21 03:23:47,805 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:23:47,805 INFO L85 PathProgramCache]: Analyzing trace with hash 838970620, now seen corresponding path program 1 times [2022-02-21 03:23:47,805 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 03:23:47,805 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1919463254] [2022-02-21 03:23:47,805 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:23:47,805 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 03:23:47,816 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:23:47,817 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-02-21 03:23:47,820 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:23:47,823 INFO L138 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-02-21 03:23:47,825 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:23:47,825 INFO L85 PathProgramCache]: Analyzing trace with hash 29942, now seen corresponding path program 1 times [2022-02-21 03:23:47,825 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 03:23:47,825 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [463101758] [2022-02-21 03:23:47,826 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:23:47,826 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 03:23:47,830 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:23:47,830 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-02-21 03:23:47,833 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:23:47,833 INFO L138 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-02-21 03:23:47,834 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:23:47,834 INFO L85 PathProgramCache]: Analyzing trace with hash 1359045147, now seen corresponding path program 2 times [2022-02-21 03:23:47,834 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 03:23:47,834 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [481805547] [2022-02-21 03:23:47,834 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:23:47,834 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 03:23:47,839 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:23:47,839 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-02-21 03:23:47,842 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:23:47,843 INFO L138 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-02-21 03:23:47,880 INFO L210 LassoAnalysis]: Preferences: [2022-02-21 03:23:47,881 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2022-02-21 03:23:47,881 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2022-02-21 03:23:47,881 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2022-02-21 03:23:47,881 INFO L129 ssoRankerPreferences]: Use exernal solver: true [2022-02-21 03:23:47,881 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:23:47,881 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2022-02-21 03:23:47,881 INFO L132 ssoRankerPreferences]: Path of dumped script: [2022-02-21 03:23:47,881 INFO L133 ssoRankerPreferences]: Filename of dumped script: NestedRecursion_1d.c_Iteration3_Loop [2022-02-21 03:23:47,881 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2022-02-21 03:23:47,881 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2022-02-21 03:23:47,882 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 03:23:47,884 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 03:23:47,885 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 03:23:47,887 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 03:23:47,889 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 03:23:47,893 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 03:23:47,929 INFO L294 LassoAnalysis]: Preprocessing complete. [2022-02-21 03:23:47,929 INFO L404 LassoAnalysis]: Checking for nontermination... [2022-02-21 03:23:47,930 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:23:47,930 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:23:47,948 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-02-21 03:23:47,949 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (13)] Waiting until timeout for monitored process [2022-02-21 03:23:47,951 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2022-02-21 03:23:47,951 INFO L160 nArgumentSynthesizer]: Using integer mode. [2022-02-21 03:23:47,966 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2022-02-21 03:23:47,966 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {rec1_#t~ret0=0} Honda state: {rec1_#t~ret0=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2022-02-21 03:23:47,984 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (13)] Forceful destruction successful, exit code 0 [2022-02-21 03:23:47,985 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:23:47,985 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:23:47,986 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-02-21 03:23:47,997 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (14)] Waiting until timeout for monitored process [2022-02-21 03:23:47,998 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2022-02-21 03:23:47,998 INFO L160 nArgumentSynthesizer]: Using integer mode. [2022-02-21 03:23:48,016 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2022-02-21 03:23:48,016 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {rec1_#res=0} Honda state: {rec1_#res=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2022-02-21 03:23:48,033 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (14)] Forceful destruction successful, exit code 0 [2022-02-21 03:23:48,033 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:23:48,033 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:23:48,034 INFO L229 MonitoredProcess]: Starting monitored process 15 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-02-21 03:23:48,035 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (15)] Waiting until timeout for monitored process [2022-02-21 03:23:48,037 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2022-02-21 03:23:48,037 INFO L160 nArgumentSynthesizer]: Using integer mode. [2022-02-21 03:23:48,045 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2022-02-21 03:23:48,046 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {rec1_#t~ret1=0} Honda state: {rec1_#t~ret1=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2022-02-21 03:23:48,062 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (15)] Forceful destruction successful, exit code 0 [2022-02-21 03:23:48,063 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:23:48,063 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:23:48,064 INFO L229 MonitoredProcess]: Starting monitored process 16 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-02-21 03:23:48,065 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (16)] Waiting until timeout for monitored process [2022-02-21 03:23:48,067 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2022-02-21 03:23:48,067 INFO L160 nArgumentSynthesizer]: Using integer mode. [2022-02-21 03:23:48,088 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2022-02-21 03:23:48,088 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {rec1_~i=0} Honda state: {rec1_~i=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2022-02-21 03:23:48,104 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (16)] Forceful destruction successful, exit code 0 [2022-02-21 03:23:48,104 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:23:48,104 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:23:48,105 INFO L229 MonitoredProcess]: Starting monitored process 17 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-02-21 03:23:48,106 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (17)] Waiting until timeout for monitored process [2022-02-21 03:23:48,108 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2022-02-21 03:23:48,108 INFO L160 nArgumentSynthesizer]: Using integer mode. [2022-02-21 03:23:48,145 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (17)] Forceful destruction successful, exit code 0 [2022-02-21 03:23:48,145 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:23:48,146 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:23:48,147 INFO L229 MonitoredProcess]: Starting monitored process 18 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-02-21 03:23:48,148 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (18)] Waiting until timeout for monitored process [2022-02-21 03:23:48,149 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2022-02-21 03:23:48,149 INFO L160 nArgumentSynthesizer]: Using integer mode. [2022-02-21 03:23:48,175 INFO L444 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2022-02-21 03:23:48,179 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (18)] Ended with exit code 0 [2022-02-21 03:23:48,179 INFO L210 LassoAnalysis]: Preferences: [2022-02-21 03:23:48,179 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2022-02-21 03:23:48,179 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2022-02-21 03:23:48,179 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2022-02-21 03:23:48,179 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2022-02-21 03:23:48,180 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:23:48,180 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2022-02-21 03:23:48,180 INFO L132 ssoRankerPreferences]: Path of dumped script: [2022-02-21 03:23:48,180 INFO L133 ssoRankerPreferences]: Filename of dumped script: NestedRecursion_1d.c_Iteration3_Loop [2022-02-21 03:23:48,180 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2022-02-21 03:23:48,180 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2022-02-21 03:23:48,180 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 03:23:48,183 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 03:23:48,184 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 03:23: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 [2022-02-21 03:23:48,196 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 03:23:48,198 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 03:23:48,248 INFO L294 LassoAnalysis]: Preprocessing complete. [2022-02-21 03:23:48,248 INFO L490 LassoAnalysis]: Using template 'affine'. [2022-02-21 03:23:48,248 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:23:48,249 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:23:48,250 INFO L229 MonitoredProcess]: Starting monitored process 19 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-02-21 03:23:48,251 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (19)] Waiting until timeout for monitored process [2022-02-21 03:23:48,252 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-02-21 03:23:48,258 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 03:23:48,259 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 03:23:48,259 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 03:23:48,259 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 03:23:48,259 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 03:23:48,259 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-02-21 03:23:48,259 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 03:23:48,274 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 03:23:48,291 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (19)] Ended with exit code 0 [2022-02-21 03:23:48,291 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:23:48,292 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:23:48,293 INFO L229 MonitoredProcess]: Starting monitored process 20 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-02-21 03:23:48,294 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (20)] Waiting until timeout for monitored process [2022-02-21 03:23:48,295 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-02-21 03:23:48,301 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 03:23:48,301 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 03:23:48,301 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 03:23:48,301 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 03:23:48,301 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 03:23:48,302 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-02-21 03:23:48,302 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 03:23:48,313 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 03:23:48,331 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (20)] Ended with exit code 0 [2022-02-21 03:23:48,331 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:23:48,332 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:23:48,333 INFO L229 MonitoredProcess]: Starting monitored process 21 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-02-21 03:23:48,336 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (21)] Waiting until timeout for monitored process [2022-02-21 03:23:48,337 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-02-21 03:23:48,342 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 03:23:48,343 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 03:23:48,343 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 03:23:48,343 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 03:23:48,343 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 03:23:48,343 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-02-21 03:23:48,343 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 03:23:48,352 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 03:23:48,399 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (21)] Ended with exit code 0 [2022-02-21 03:23:48,399 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:23:48,399 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:23:48,400 INFO L229 MonitoredProcess]: Starting monitored process 22 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-02-21 03:23:48,401 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (22)] Waiting until timeout for monitored process [2022-02-21 03:23:48,403 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-02-21 03:23:48,408 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 03:23:48,408 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 03:23:48,408 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 03:23:48,408 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 03:23:48,408 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 03:23:48,409 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-02-21 03:23:48,409 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 03:23:48,424 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2022-02-21 03:23:48,426 INFO L443 ModelExtractionUtils]: Simplification made 2 calls to the SMT solver. [2022-02-21 03:23:48,426 INFO L444 ModelExtractionUtils]: 1 out of 3 variables were initially zero. Simplification set additionally 0 variables to zero. [2022-02-21 03:23:48,426 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:23:48,427 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:23:48,430 INFO L229 MonitoredProcess]: Starting monitored process 23 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-02-21 03:23:48,431 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (23)] Waiting until timeout for monitored process [2022-02-21 03:23:48,432 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2022-02-21 03:23:48,432 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2022-02-21 03:23:48,432 INFO L513 LassoAnalysis]: Proved termination. [2022-02-21 03:23:48,432 INFO L515 LassoAnalysis]: Termination argument consisting of: Ranking function f(rec1_#in~i) = 1*rec1_#in~i Supporting invariants [] [2022-02-21 03:23:48,475 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (22)] Forceful destruction successful, exit code 0 [2022-02-21 03:23:48,480 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2022-02-21 03:23:48,482 INFO L390 LassoCheck]: Loop: "~i := #in~i;" "assume !(~i <= 0);" "call #t~ret0 := rec1(~i - 2);"< [2022-02-21 03:23:48,486 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:23:48,497 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:23:48,519 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:23:48,520 INFO L263 TraceCheckSpWp]: Trace formula consists of 106 conjuncts, 8 conjunts are in the unsatisfiable core [2022-02-21 03:23:48,528 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:23:48,529 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-21 03:23:48,561 INFO L290 TraceCheckUtils]: 0: Hoare triple {1392#unseeded} assume { :begin_inline_ULTIMATE.init } true; {1392#unseeded} is VALID [2022-02-21 03:23:48,562 INFO L290 TraceCheckUtils]: 1: Hoare triple {1392#unseeded} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet5#1, main_#t~ret6#1, main_~x~0#1;main_~x~0#1 := main_#t~nondet5#1;havoc main_#t~nondet5#1; {1392#unseeded} is VALID [2022-02-21 03:23:48,562 INFO L272 TraceCheckUtils]: 2: Hoare triple {1392#unseeded} call main_#t~ret6#1 := rec2(main_~x~0#1); {1392#unseeded} is VALID [2022-02-21 03:23:48,563 INFO L290 TraceCheckUtils]: 3: Hoare triple {1392#unseeded} ~j := #in~j; {1392#unseeded} is VALID [2022-02-21 03:23:48,563 INFO L290 TraceCheckUtils]: 4: Hoare triple {1392#unseeded} assume !(~j <= 0); {1392#unseeded} is VALID [2022-02-21 03:23:48,563 INFO L272 TraceCheckUtils]: 5: Hoare triple {1392#unseeded} call #t~ret3 := rec1(~j); {1392#unseeded} is VALID [2022-02-21 03:23:48,564 INFO L290 TraceCheckUtils]: 6: Hoare triple {1392#unseeded} ~i := #in~i; {1392#unseeded} is VALID [2022-02-21 03:23:48,564 INFO L290 TraceCheckUtils]: 7: Hoare triple {1392#unseeded} assume !(~i <= 0); {1392#unseeded} is VALID [2022-02-21 03:23:48,564 INFO L272 TraceCheckUtils]: 8: Hoare triple {1392#unseeded} call #t~ret0 := rec1(~i - 2); {1392#unseeded} is VALID [2022-02-21 03:23:48,571 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:23:48,571 INFO L263 TraceCheckSpWp]: Trace formula consists of 37 conjuncts, 7 conjunts are in the unsatisfiable core [2022-02-21 03:23:48,586 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:23:48,587 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-21 03:23:48,625 INFO L290 TraceCheckUtils]: 0: Hoare triple {1395#(>= oldRank0 |rec1_#in~i|)} ~i := #in~i; {1434#(<= rec1_~i oldRank0)} is VALID [2022-02-21 03:23:48,628 INFO L290 TraceCheckUtils]: 1: Hoare triple {1434#(<= rec1_~i oldRank0)} assume !(~i <= 0); {1438#(and (not (<= rec1_~i 0)) (<= rec1_~i oldRank0))} is VALID [2022-02-21 03:23:48,629 INFO L272 TraceCheckUtils]: 2: Hoare triple {1438#(and (not (<= rec1_~i 0)) (<= rec1_~i oldRank0))} call #t~ret0 := rec1(~i - 2); {1405#(or (and (>= oldRank0 0) (> oldRank0 |rec1_#in~i|)) unseeded)} is VALID [2022-02-21 03:23:48,630 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-21 03:23:48,631 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 4 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 3 states have internal predecessors, (8), 2 states have call successors, (4), 2 states have call predecessors, (4), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:23:48,637 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 12 edges. 12 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-21 03:23:48,638 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 4 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 3 states have internal predecessors, (8), 2 states have call successors, (4), 2 states have call predecessors, (4), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 9 letters. Loop has 3 letters. [2022-02-21 03:23:48,638 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:23:48,638 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 3 loop predicates [2022-02-21 03:23:48,638 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 63 states and 99 transitions. cyclomatic complexity: 40 Second operand has 4 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 3 states have internal predecessors, (8), 2 states have call successors, (4), 2 states have call predecessors, (4), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:23:48,738 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 63 states and 99 transitions. cyclomatic complexity: 40. Second operand has 4 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 3 states have internal predecessors, (8), 2 states have call successors, (4), 2 states have call predecessors, (4), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Result 109 states and 166 transitions. Complement of second has 13 states. [2022-02-21 03:23:48,738 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2022-02-21 03:23:48,738 INFO L123 tractBuchiDifference]: Start testing correctness of buchiDifferenceNCSBLazy3 [2022-02-21 03:23:48,738 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 63 states and 99 transitions. cyclomatic complexity: 40 [2022-02-21 03:23:48,738 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 03:23:48,738 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 03:23:48,738 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 4 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 3 states have internal predecessors, (8), 2 states have call successors, (4), 2 states have call predecessors, (4), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:23:48,739 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2022-02-21 03:23:48,739 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 03:23:48,739 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 03:23:48,740 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 109 states and 166 transitions. [2022-02-21 03:23:48,741 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 9 [2022-02-21 03:23:48,741 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 03:23:48,741 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 03:23:48,742 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 63 states and 99 transitions. cyclomatic complexity: 40 [2022-02-21 03:23:48,746 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 16 examples of accepted words. [2022-02-21 03:23:48,746 INFO L70 LassoExtractor]: Start lassoExtractor. Operand has 4 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 3 states have internal predecessors, (8), 2 states have call successors, (4), 2 states have call predecessors, (4), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:23:48,746 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2022-02-21 03:23:48,746 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 1 examples of accepted words. [2022-02-21 03:23:48,746 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 109 states and 166 transitions. cyclomatic complexity: 63 [2022-02-21 03:23:48,750 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 16 examples of accepted words. [2022-02-21 03:23:48,751 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 63 states and 99 transitions. cyclomatic complexity: 40 Stem has 9 letters. Loop has 3 letters. [2022-02-21 03:23:48,751 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:23:48,751 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 4 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 3 states have internal predecessors, (8), 2 states have call successors, (4), 2 states have call predecessors, (4), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 9 letters. Loop has 3 letters. [2022-02-21 03:23:48,751 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:23:48,751 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 109 states and 166 transitions. cyclomatic complexity: 63 Stem has 9 letters. Loop has 3 letters. [2022-02-21 03:23:48,751 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:23:48,751 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 63 states and 99 transitions. cyclomatic complexity: 40 Stem has 1 letters. Loop has 3 letters. [2022-02-21 03:23:48,752 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:23:48,752 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 4 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 3 states have internal predecessors, (8), 2 states have call successors, (4), 2 states have call predecessors, (4), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 1 letters. Loop has 3 letters. [2022-02-21 03:23:48,752 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:23:48,752 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 109 states and 166 transitions. cyclomatic complexity: 63 Stem has 1 letters. Loop has 3 letters. [2022-02-21 03:23:48,752 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:23:48,752 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 63 states and 99 transitions. cyclomatic complexity: 40 Stem has 14 letters. Loop has 3 letters. [2022-02-21 03:23:48,752 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:23:48,752 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 4 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 3 states have internal predecessors, (8), 2 states have call successors, (4), 2 states have call predecessors, (4), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 14 letters. Loop has 3 letters. [2022-02-21 03:23:48,752 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:23:48,752 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 109 states and 166 transitions. cyclomatic complexity: 63 Stem has 14 letters. Loop has 3 letters. [2022-02-21 03:23:48,753 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:23:48,753 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 63 states and 99 transitions. cyclomatic complexity: 40 Stem has 109 letters. Loop has 109 letters. [2022-02-21 03:23:48,753 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:23:48,753 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 4 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 3 states have internal predecessors, (8), 2 states have call successors, (4), 2 states have call predecessors, (4), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 109 letters. Loop has 109 letters. [2022-02-21 03:23:48,753 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:23:48,753 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 109 states and 166 transitions. cyclomatic complexity: 63 Stem has 109 letters. Loop has 109 letters. [2022-02-21 03:23:48,753 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:23:48,753 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 63 states and 99 transitions. cyclomatic complexity: 40 Stem has 63 letters. Loop has 63 letters. [2022-02-21 03:23:48,753 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:23:48,754 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 4 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 3 states have internal predecessors, (8), 2 states have call successors, (4), 2 states have call predecessors, (4), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 63 letters. Loop has 63 letters. [2022-02-21 03:23:48,754 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:23:48,754 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 109 states and 166 transitions. cyclomatic complexity: 63 Stem has 63 letters. Loop has 63 letters. [2022-02-21 03:23:48,754 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:23:48,754 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 63 states and 99 transitions. cyclomatic complexity: 40 Stem has 4 letters. Loop has 4 letters. [2022-02-21 03:23:48,754 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:23:48,754 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 4 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 3 states have internal predecessors, (8), 2 states have call successors, (4), 2 states have call predecessors, (4), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 4 letters. Loop has 4 letters. [2022-02-21 03:23:48,754 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:23:48,754 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 109 states and 166 transitions. cyclomatic complexity: 63 Stem has 4 letters. Loop has 4 letters. [2022-02-21 03:23:48,754 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:23:48,754 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 63 states and 99 transitions. cyclomatic complexity: 40 Stem has 16 letters. Loop has 40 letters. [2022-02-21 03:23:48,755 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:23:48,755 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (23)] Forceful destruction successful, exit code 0 [2022-02-21 03:23:48,755 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 4 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 3 states have internal predecessors, (8), 2 states have call successors, (4), 2 states have call predecessors, (4), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 16 letters. Loop has 40 letters. [2022-02-21 03:23:48,771 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:23:48,771 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 109 states and 166 transitions. cyclomatic complexity: 63 Stem has 16 letters. Loop has 40 letters. [2022-02-21 03:23:48,771 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:23:48,771 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 63 states and 99 transitions. cyclomatic complexity: 40 Stem has 10 letters. Loop has 3 letters. [2022-02-21 03:23:48,772 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:23:48,772 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 4 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 3 states have internal predecessors, (8), 2 states have call successors, (4), 2 states have call predecessors, (4), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 10 letters. Loop has 3 letters. [2022-02-21 03:23:48,772 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:23:48,772 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 109 states and 166 transitions. cyclomatic complexity: 63 Stem has 10 letters. Loop has 3 letters. [2022-02-21 03:23:48,773 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:23:48,773 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 63 states and 99 transitions. cyclomatic complexity: 40 Stem has 11 letters. Loop has 3 letters. [2022-02-21 03:23:48,774 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:23:48,774 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 4 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 3 states have internal predecessors, (8), 2 states have call successors, (4), 2 states have call predecessors, (4), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 11 letters. Loop has 3 letters. [2022-02-21 03:23:48,774 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:23:48,774 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 109 states and 166 transitions. cyclomatic complexity: 63 Stem has 11 letters. Loop has 3 letters. [2022-02-21 03:23:48,774 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:23:48,774 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 63 states and 99 transitions. cyclomatic complexity: 40 Stem has 21 letters. Loop has 77 letters. [2022-02-21 03:23:48,775 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:23:48,775 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 4 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 3 states have internal predecessors, (8), 2 states have call successors, (4), 2 states have call predecessors, (4), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 21 letters. Loop has 77 letters. [2022-02-21 03:23:48,775 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:23:48,775 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 109 states and 166 transitions. cyclomatic complexity: 63 Stem has 21 letters. Loop has 77 letters. [2022-02-21 03:23:48,775 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:23:48,775 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 63 states and 99 transitions. cyclomatic complexity: 40 Stem has 9 letters. Loop has 3 letters. [2022-02-21 03:23:48,775 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:23:48,776 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 4 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 3 states have internal predecessors, (8), 2 states have call successors, (4), 2 states have call predecessors, (4), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 9 letters. Loop has 3 letters. [2022-02-21 03:23:48,776 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:23:48,776 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 109 states and 166 transitions. cyclomatic complexity: 63 Stem has 9 letters. Loop has 3 letters. [2022-02-21 03:23:48,776 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:23:48,776 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 63 states and 99 transitions. cyclomatic complexity: 40 Stem has 21 letters. Loop has 45 letters. [2022-02-21 03:23:48,776 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:23:48,777 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 4 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 3 states have internal predecessors, (8), 2 states have call successors, (4), 2 states have call predecessors, (4), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 21 letters. Loop has 45 letters. [2022-02-21 03:23:48,777 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:23:48,777 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 109 states and 166 transitions. cyclomatic complexity: 63 Stem has 21 letters. Loop has 45 letters. [2022-02-21 03:23:48,777 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:23:48,777 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 63 states and 99 transitions. cyclomatic complexity: 40 Stem has 21 letters. Loop has 61 letters. [2022-02-21 03:23:48,778 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:23:48,778 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 4 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 3 states have internal predecessors, (8), 2 states have call successors, (4), 2 states have call predecessors, (4), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 21 letters. Loop has 61 letters. [2022-02-21 03:23:48,778 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:23:48,778 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 109 states and 166 transitions. cyclomatic complexity: 63 Stem has 21 letters. Loop has 61 letters. [2022-02-21 03:23:48,778 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:23:48,778 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 63 states and 99 transitions. cyclomatic complexity: 40 Stem has 21 letters. Loop has 77 letters. [2022-02-21 03:23:48,779 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:23:48,779 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 4 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 3 states have internal predecessors, (8), 2 states have call successors, (4), 2 states have call predecessors, (4), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 21 letters. Loop has 77 letters. [2022-02-21 03:23:48,779 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:23:48,779 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 109 states and 166 transitions. cyclomatic complexity: 63 Stem has 21 letters. Loop has 77 letters. [2022-02-21 03:23:48,779 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:23:48,779 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 63 states and 99 transitions. cyclomatic complexity: 40 Stem has 16 letters. Loop has 24 letters. [2022-02-21 03:23:48,782 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:23:48,782 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 4 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 3 states have internal predecessors, (8), 2 states have call successors, (4), 2 states have call predecessors, (4), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 16 letters. Loop has 24 letters. [2022-02-21 03:23:48,782 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:23:48,782 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 109 states and 166 transitions. cyclomatic complexity: 63 Stem has 16 letters. Loop has 24 letters. [2022-02-21 03:23:48,782 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:23:48,782 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 63 states and 99 transitions. cyclomatic complexity: 40 Stem has 16 letters. Loop has 8 letters. [2022-02-21 03:23:48,783 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:23:48,783 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 4 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 3 states have internal predecessors, (8), 2 states have call successors, (4), 2 states have call predecessors, (4), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 16 letters. Loop has 8 letters. [2022-02-21 03:23:48,783 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:23:48,783 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 109 states and 166 transitions. cyclomatic complexity: 63 Stem has 16 letters. Loop has 8 letters. [2022-02-21 03:23:48,783 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:23:48,783 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 63 states and 99 transitions. cyclomatic complexity: 40 Stem has 16 letters. Loop has 40 letters. [2022-02-21 03:23:48,783 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:23:48,783 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 4 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 3 states have internal predecessors, (8), 2 states have call successors, (4), 2 states have call predecessors, (4), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 16 letters. Loop has 40 letters. [2022-02-21 03:23:48,784 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:23:48,784 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 109 states and 166 transitions. cyclomatic complexity: 63 Stem has 16 letters. Loop has 40 letters. [2022-02-21 03:23:48,784 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:23:48,784 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 63 states and 99 transitions. cyclomatic complexity: 40 Stem has 42 letters. Loop has 40 letters. [2022-02-21 03:23:48,784 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:23:48,784 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 4 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 3 states have internal predecessors, (8), 2 states have call successors, (4), 2 states have call predecessors, (4), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 42 letters. Loop has 40 letters. [2022-02-21 03:23:48,784 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:23:48,785 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 109 states and 166 transitions. cyclomatic complexity: 63 Stem has 42 letters. Loop has 40 letters. [2022-02-21 03:23:48,785 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:23:48,785 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 63 states and 99 transitions. cyclomatic complexity: 40 Stem has 43 letters. Loop has 40 letters. [2022-02-21 03:23:48,785 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:23:48,785 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 4 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 3 states have internal predecessors, (8), 2 states have call successors, (4), 2 states have call predecessors, (4), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 43 letters. Loop has 40 letters. [2022-02-21 03:23:48,785 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:23:48,785 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 109 states and 166 transitions. cyclomatic complexity: 63 Stem has 43 letters. Loop has 40 letters. [2022-02-21 03:23:48,786 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:23:48,786 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 63 states and 99 transitions. cyclomatic complexity: 40 Stem has 44 letters. Loop has 40 letters. [2022-02-21 03:23:48,786 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:23:48,786 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 4 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 3 states have internal predecessors, (8), 2 states have call successors, (4), 2 states have call predecessors, (4), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 44 letters. Loop has 40 letters. [2022-02-21 03:23:48,786 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:23:48,786 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 109 states and 166 transitions. cyclomatic complexity: 63 Stem has 44 letters. Loop has 40 letters. [2022-02-21 03:23:48,786 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:23:48,787 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 63 states and 99 transitions. cyclomatic complexity: 40 Stem has 45 letters. Loop has 40 letters. [2022-02-21 03:23:48,787 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:23:48,787 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 4 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 3 states have internal predecessors, (8), 2 states have call successors, (4), 2 states have call predecessors, (4), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 45 letters. Loop has 40 letters. [2022-02-21 03:23:48,787 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:23:48,787 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 109 states and 166 transitions. cyclomatic complexity: 63 Stem has 45 letters. Loop has 40 letters. [2022-02-21 03:23:48,787 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:23:48,788 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 63 states and 99 transitions. cyclomatic complexity: 40 Stem has 42 letters. Loop has 40 letters. [2022-02-21 03:23:48,788 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:23:48,788 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 4 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 3 states have internal predecessors, (8), 2 states have call successors, (4), 2 states have call predecessors, (4), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 42 letters. Loop has 40 letters. [2022-02-21 03:23:48,788 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:23:48,788 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 109 states and 166 transitions. cyclomatic complexity: 63 Stem has 42 letters. Loop has 40 letters. [2022-02-21 03:23:48,788 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:23:48,788 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 63 states and 99 transitions. cyclomatic complexity: 40 Stem has 1 letters. Loop has 3 letters. [2022-02-21 03:23:48,788 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:23:48,789 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 4 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 3 states have internal predecessors, (8), 2 states have call successors, (4), 2 states have call predecessors, (4), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 1 letters. Loop has 3 letters. [2022-02-21 03:23:48,789 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:23:48,789 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 109 states and 166 transitions. cyclomatic complexity: 63 Stem has 1 letters. Loop has 3 letters. [2022-02-21 03:23:48,789 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:23:48,789 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 63 states and 99 transitions. cyclomatic complexity: 40 Stem has 16 letters. Loop has 3 letters. [2022-02-21 03:23:48,789 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:23:48,789 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 4 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 3 states have internal predecessors, (8), 2 states have call successors, (4), 2 states have call predecessors, (4), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 16 letters. Loop has 3 letters. [2022-02-21 03:23:48,789 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:23:48,789 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 109 states and 166 transitions. cyclomatic complexity: 63 Stem has 16 letters. Loop has 3 letters. [2022-02-21 03:23:48,790 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:23:48,790 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 63 states and 99 transitions. cyclomatic complexity: 40 Stem has 14 letters. Loop has 3 letters. [2022-02-21 03:23:48,790 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:23:48,790 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 4 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 3 states have internal predecessors, (8), 2 states have call successors, (4), 2 states have call predecessors, (4), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 14 letters. Loop has 3 letters. [2022-02-21 03:23:48,790 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:23:48,790 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 109 states and 166 transitions. cyclomatic complexity: 63 Stem has 14 letters. Loop has 3 letters. [2022-02-21 03:23:48,790 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:23:48,791 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 63 states and 99 transitions. cyclomatic complexity: 40 Stem has 21 letters. Loop has 77 letters. [2022-02-21 03:23:48,792 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:23:48,792 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 4 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 3 states have internal predecessors, (8), 2 states have call successors, (4), 2 states have call predecessors, (4), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 21 letters. Loop has 77 letters. [2022-02-21 03:23:48,792 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:23:48,792 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 109 states and 166 transitions. cyclomatic complexity: 63 Stem has 21 letters. Loop has 77 letters. [2022-02-21 03:23:48,793 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:23:48,793 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 63 states and 99 transitions. cyclomatic complexity: 40 Stem has 15 letters. Loop has 3 letters. [2022-02-21 03:23:48,793 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:23:48,793 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 4 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 3 states have internal predecessors, (8), 2 states have call successors, (4), 2 states have call predecessors, (4), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 15 letters. Loop has 3 letters. [2022-02-21 03:23:48,793 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:23:48,793 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 109 states and 166 transitions. cyclomatic complexity: 63 Stem has 15 letters. Loop has 3 letters. [2022-02-21 03:23:48,793 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:23:48,793 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 63 states and 99 transitions. cyclomatic complexity: 40 Stem has 16 letters. Loop has 40 letters. [2022-02-21 03:23:48,794 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:23:48,794 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 4 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 3 states have internal predecessors, (8), 2 states have call successors, (4), 2 states have call predecessors, (4), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 16 letters. Loop has 40 letters. [2022-02-21 03:23:48,794 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:23:48,794 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 109 states and 166 transitions. cyclomatic complexity: 63 Stem has 16 letters. Loop has 40 letters. [2022-02-21 03:23:48,794 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:23:48,795 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 63 states and 99 transitions. cyclomatic complexity: 40 Stem has 16 letters. Loop has 40 letters. [2022-02-21 03:23:48,795 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:23:48,795 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 4 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 3 states have internal predecessors, (8), 2 states have call successors, (4), 2 states have call predecessors, (4), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 16 letters. Loop has 40 letters. [2022-02-21 03:23:48,795 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:23:48,795 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 109 states and 166 transitions. cyclomatic complexity: 63 Stem has 16 letters. Loop has 40 letters. [2022-02-21 03:23:48,796 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:23:48,796 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 63 states and 99 transitions. cyclomatic complexity: 40 Stem has 16 letters. Loop has 24 letters. [2022-02-21 03:23:48,796 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:23:48,796 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 4 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 3 states have internal predecessors, (8), 2 states have call successors, (4), 2 states have call predecessors, (4), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 16 letters. Loop has 24 letters. [2022-02-21 03:23:48,796 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:23:48,797 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 109 states and 166 transitions. cyclomatic complexity: 63 Stem has 16 letters. Loop has 24 letters. [2022-02-21 03:23:48,797 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:23:48,797 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 63 states and 99 transitions. cyclomatic complexity: 40 Stem has 16 letters. Loop has 8 letters. [2022-02-21 03:23:48,797 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:23:48,797 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 4 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 3 states have internal predecessors, (8), 2 states have call successors, (4), 2 states have call predecessors, (4), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 16 letters. Loop has 8 letters. [2022-02-21 03:23:48,797 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:23:48,797 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 109 states and 166 transitions. cyclomatic complexity: 63 Stem has 16 letters. Loop has 8 letters. [2022-02-21 03:23:48,798 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:23:48,798 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 63 states and 99 transitions. cyclomatic complexity: 40 Stem has 21 letters. Loop has 77 letters. [2022-02-21 03:23:48,798 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:23:48,798 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 4 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 3 states have internal predecessors, (8), 2 states have call successors, (4), 2 states have call predecessors, (4), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 21 letters. Loop has 77 letters. [2022-02-21 03:23:48,799 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:23:48,799 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 109 states and 166 transitions. cyclomatic complexity: 63 Stem has 21 letters. Loop has 77 letters. [2022-02-21 03:23:48,799 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:23:48,799 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 63 states and 99 transitions. cyclomatic complexity: 40 Stem has 21 letters. Loop has 61 letters. [2022-02-21 03:23:48,801 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:23:48,801 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 4 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 3 states have internal predecessors, (8), 2 states have call successors, (4), 2 states have call predecessors, (4), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 21 letters. Loop has 61 letters. [2022-02-21 03:23:48,802 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:23:48,802 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 109 states and 166 transitions. cyclomatic complexity: 63 Stem has 21 letters. Loop has 61 letters. [2022-02-21 03:23:48,802 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:23:48,802 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 63 states and 99 transitions. cyclomatic complexity: 40 Stem has 21 letters. Loop has 45 letters. [2022-02-21 03:23:48,802 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:23:48,802 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 4 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 3 states have internal predecessors, (8), 2 states have call successors, (4), 2 states have call predecessors, (4), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 21 letters. Loop has 45 letters. [2022-02-21 03:23:48,802 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:23:48,803 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 109 states and 166 transitions. cyclomatic complexity: 63 Stem has 21 letters. Loop has 45 letters. [2022-02-21 03:23:48,803 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:23:48,803 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 63 states and 99 transitions. cyclomatic complexity: 40 Stem has 42 letters. Loop has 40 letters. [2022-02-21 03:23:48,803 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:23:48,803 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 4 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 3 states have internal predecessors, (8), 2 states have call successors, (4), 2 states have call predecessors, (4), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 42 letters. Loop has 40 letters. [2022-02-21 03:23:48,803 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:23:48,803 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 109 states and 166 transitions. cyclomatic complexity: 63 Stem has 42 letters. Loop has 40 letters. [2022-02-21 03:23:48,804 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:23:48,804 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 63 states and 99 transitions. cyclomatic complexity: 40 Stem has 43 letters. Loop has 40 letters. [2022-02-21 03:23:48,804 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:23:48,804 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 4 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 3 states have internal predecessors, (8), 2 states have call successors, (4), 2 states have call predecessors, (4), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 43 letters. Loop has 40 letters. [2022-02-21 03:23:48,804 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:23:48,804 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 109 states and 166 transitions. cyclomatic complexity: 63 Stem has 43 letters. Loop has 40 letters. [2022-02-21 03:23:48,804 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:23:48,805 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 63 states and 99 transitions. cyclomatic complexity: 40 Stem has 44 letters. Loop has 40 letters. [2022-02-21 03:23:48,805 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:23:48,805 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 4 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 3 states have internal predecessors, (8), 2 states have call successors, (4), 2 states have call predecessors, (4), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 44 letters. Loop has 40 letters. [2022-02-21 03:23:48,805 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:23:48,805 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 109 states and 166 transitions. cyclomatic complexity: 63 Stem has 44 letters. Loop has 40 letters. [2022-02-21 03:23:48,805 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:23:48,805 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 63 states and 99 transitions. cyclomatic complexity: 40 Stem has 45 letters. Loop has 40 letters. [2022-02-21 03:23:48,806 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:23:48,806 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 4 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 3 states have internal predecessors, (8), 2 states have call successors, (4), 2 states have call predecessors, (4), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 45 letters. Loop has 40 letters. [2022-02-21 03:23:48,806 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:23:48,806 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 109 states and 166 transitions. cyclomatic complexity: 63 Stem has 45 letters. Loop has 40 letters. [2022-02-21 03:23:48,806 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:23:48,806 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 63 states and 99 transitions. cyclomatic complexity: 40 Stem has 42 letters. Loop has 40 letters. [2022-02-21 03:23:48,806 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:23:48,807 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 4 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 3 states have internal predecessors, (8), 2 states have call successors, (4), 2 states have call predecessors, (4), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 42 letters. Loop has 40 letters. [2022-02-21 03:23:48,807 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:23:48,807 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 109 states and 166 transitions. cyclomatic complexity: 63 Stem has 42 letters. Loop has 40 letters. [2022-02-21 03:23:48,807 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:23:48,807 INFO L161 tractBuchiDifference]: Finished testing correctness of buchiDifferenceNCSBLazy3 [2022-02-21 03:23:48,809 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 3 states have internal predecessors, (8), 2 states have call successors, (4), 2 states have call predecessors, (4), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:23:48,810 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 14 transitions. [2022-02-21 03:23:48,810 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 14 transitions. Stem has 9 letters. Loop has 3 letters. [2022-02-21 03:23:48,810 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:23:48,810 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 14 transitions. Stem has 12 letters. Loop has 3 letters. [2022-02-21 03:23:48,810 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:23:48,810 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 14 transitions. Stem has 9 letters. Loop has 6 letters. [2022-02-21 03:23:48,810 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:23:48,811 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 109 states and 166 transitions. cyclomatic complexity: 63 [2022-02-21 03:23:48,818 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 9 [2022-02-21 03:23:48,825 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 109 states to 97 states and 154 transitions. [2022-02-21 03:23:48,825 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 41 [2022-02-21 03:23:48,825 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 43 [2022-02-21 03:23:48,825 INFO L73 IsDeterministic]: Start isDeterministic. Operand 97 states and 154 transitions. [2022-02-21 03:23:48,827 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2022-02-21 03:23:48,827 INFO L681 BuchiCegarLoop]: Abstraction has 97 states and 154 transitions. [2022-02-21 03:23:48,828 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 97 states and 154 transitions. [2022-02-21 03:23:48,842 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 97 to 93. [2022-02-21 03:23:48,843 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-21 03:23:48,844 INFO L82 GeneralOperation]: Start isEquivalent. First operand 97 states and 154 transitions. Second operand has 93 states, 54 states have (on average 1.1481481481481481) internal successors, (62), 60 states have internal predecessors, (62), 26 states have call successors, (26), 14 states have call predecessors, (26), 13 states have return successors, (56), 18 states have call predecessors, (56), 22 states have call successors, (56) [2022-02-21 03:23:48,848 INFO L74 IsIncluded]: Start isIncluded. First operand 97 states and 154 transitions. Second operand has 93 states, 54 states have (on average 1.1481481481481481) internal successors, (62), 60 states have internal predecessors, (62), 26 states have call successors, (26), 14 states have call predecessors, (26), 13 states have return successors, (56), 18 states have call predecessors, (56), 22 states have call successors, (56) [2022-02-21 03:23:48,850 INFO L87 Difference]: Start difference. First operand 97 states and 154 transitions. Second operand has 93 states, 54 states have (on average 1.1481481481481481) internal successors, (62), 60 states have internal predecessors, (62), 26 states have call successors, (26), 14 states have call predecessors, (26), 13 states have return successors, (56), 18 states have call predecessors, (56), 22 states have call successors, (56) [2022-02-21 03:23:48,850 INFO L149 Difference]: Subtrahend was not deterministic. Recomputing result with determinization. [2022-02-21 03:23:48,870 INFO L93 Difference]: Finished difference Result 304 states and 469 transitions. [2022-02-21 03:23:48,870 INFO L276 IsEmpty]: Start isEmpty. Operand 304 states and 469 transitions. [2022-02-21 03:23:48,873 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 03:23:48,873 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 03:23:48,874 INFO L74 IsIncluded]: Start isIncluded. First operand has 93 states, 54 states have (on average 1.1481481481481481) internal successors, (62), 60 states have internal predecessors, (62), 26 states have call successors, (26), 14 states have call predecessors, (26), 13 states have return successors, (56), 18 states have call predecessors, (56), 22 states have call successors, (56) Second operand 97 states and 154 transitions. [2022-02-21 03:23:48,875 INFO L87 Difference]: Start difference. First operand has 93 states, 54 states have (on average 1.1481481481481481) internal successors, (62), 60 states have internal predecessors, (62), 26 states have call successors, (26), 14 states have call predecessors, (26), 13 states have return successors, (56), 18 states have call predecessors, (56), 22 states have call successors, (56) Second operand 97 states and 154 transitions. [2022-02-21 03:23:48,876 INFO L149 Difference]: Subtrahend was not deterministic. Recomputing result with determinization. [2022-02-21 03:23:48,903 INFO L93 Difference]: Finished difference Result 332 states and 511 transitions. [2022-02-21 03:23:48,904 INFO L276 IsEmpty]: Start isEmpty. Operand 332 states and 511 transitions. [2022-02-21 03:23:48,905 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 03:23:48,905 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 03:23:48,905 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-21 03:23:48,905 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-21 03:23:48,907 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 93 states, 54 states have (on average 1.1481481481481481) internal successors, (62), 60 states have internal predecessors, (62), 26 states have call successors, (26), 14 states have call predecessors, (26), 13 states have return successors, (56), 18 states have call predecessors, (56), 22 states have call successors, (56) [2022-02-21 03:23:48,911 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93 states to 93 states and 144 transitions. [2022-02-21 03:23:48,911 INFO L704 BuchiCegarLoop]: Abstraction has 93 states and 144 transitions. [2022-02-21 03:23:48,911 INFO L587 BuchiCegarLoop]: Abstraction has 93 states and 144 transitions. [2022-02-21 03:23:48,911 INFO L425 BuchiCegarLoop]: ======== Iteration 4============ [2022-02-21 03:23:48,911 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 93 states and 144 transitions. [2022-02-21 03:23:48,915 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 9 [2022-02-21 03:23:48,915 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 03:23:48,915 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 03:23:48,916 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-21 03:23:48,916 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2022-02-21 03:23:48,916 INFO L791 eck$LassoCheckResult]: Stem: 1575#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true; 1576#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet5#1, main_#t~ret6#1, main_~x~0#1;main_~x~0#1 := main_#t~nondet5#1;havoc main_#t~nondet5#1; 1571#L25 call main_#t~ret6#1 := rec2(main_~x~0#1);< 1592#rec2ENTRY ~j := #in~j; 1611#L18 assume !(~j <= 0); 1613#L20 call #t~ret3 := rec1(~j);< 1638#rec1ENTRY ~i := #in~i; 1637#L12 assume !(~i <= 0); 1585#L14 call #t~ret0 := rec1(~i - 2);< 1616#rec1ENTRY ~i := #in~i; 1614#L12 assume ~i <= 0;#res := 0; 1604#rec1FINAL assume true; 1605#rec1EXIT >#28#return; 1583#L14-1 call #t~ret1 := rec1(#t~ret0 - 1);< 1593#rec1ENTRY [2022-02-21 03:23:48,916 INFO L793 eck$LassoCheckResult]: Loop: 1593#rec1ENTRY ~i := #in~i; 1636#L12 assume !(~i <= 0); 1578#L14 call #t~ret0 := rec1(~i - 2);< 1593#rec1ENTRY [2022-02-21 03:23:48,917 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:23:48,917 INFO L85 PathProgramCache]: Analyzing trace with hash 372282091, now seen corresponding path program 1 times [2022-02-21 03:23:48,918 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 03:23:48,918 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [245321970] [2022-02-21 03:23:48,918 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:23:48,918 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 03:23:48,928 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:23:48,929 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-02-21 03:23:48,941 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:23:48,945 INFO L138 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-02-21 03:23:48,945 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:23:48,945 INFO L85 PathProgramCache]: Analyzing trace with hash 29942, now seen corresponding path program 2 times [2022-02-21 03:23:48,945 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 03:23:48,946 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1241448986] [2022-02-21 03:23:48,946 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:23:48,946 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 03:23:48,952 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:23:48,953 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-02-21 03:23:48,955 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:23:48,956 INFO L138 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-02-21 03:23:48,956 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:23:48,956 INFO L85 PathProgramCache]: Analyzing trace with hash 1050214860, now seen corresponding path program 2 times [2022-02-21 03:23:48,958 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 03:23:48,958 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1929343439] [2022-02-21 03:23:48,959 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:23:48,960 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 03:23:48,967 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:23:48,991 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2022-02-21 03:23:48,996 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:23:49,007 INFO L290 TraceCheckUtils]: 0: Hoare triple {2644#true} ~i := #in~i; {2644#true} is VALID [2022-02-21 03:23:49,009 INFO L290 TraceCheckUtils]: 1: Hoare triple {2644#true} assume ~i <= 0;#res := 0; {2653#(<= |rec1_#res| 0)} is VALID [2022-02-21 03:23:49,009 INFO L290 TraceCheckUtils]: 2: Hoare triple {2653#(<= |rec1_#res| 0)} assume true; {2653#(<= |rec1_#res| 0)} is VALID [2022-02-21 03:23:49,010 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2653#(<= |rec1_#res| 0)} {2644#true} #28#return; {2650#(<= |rec1_#t~ret0| 0)} is VALID [2022-02-21 03:23:49,010 INFO L290 TraceCheckUtils]: 0: Hoare triple {2644#true} assume { :begin_inline_ULTIMATE.init } true; {2644#true} is VALID [2022-02-21 03:23:49,010 INFO L290 TraceCheckUtils]: 1: Hoare triple {2644#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet5#1, main_#t~ret6#1, main_~x~0#1;main_~x~0#1 := main_#t~nondet5#1;havoc main_#t~nondet5#1; {2644#true} is VALID [2022-02-21 03:23:49,010 INFO L272 TraceCheckUtils]: 2: Hoare triple {2644#true} call main_#t~ret6#1 := rec2(main_~x~0#1); {2644#true} is VALID [2022-02-21 03:23:49,010 INFO L290 TraceCheckUtils]: 3: Hoare triple {2644#true} ~j := #in~j; {2644#true} is VALID [2022-02-21 03:23:49,010 INFO L290 TraceCheckUtils]: 4: Hoare triple {2644#true} assume !(~j <= 0); {2644#true} is VALID [2022-02-21 03:23:49,011 INFO L272 TraceCheckUtils]: 5: Hoare triple {2644#true} call #t~ret3 := rec1(~j); {2644#true} is VALID [2022-02-21 03:23:49,011 INFO L290 TraceCheckUtils]: 6: Hoare triple {2644#true} ~i := #in~i; {2644#true} is VALID [2022-02-21 03:23:49,011 INFO L290 TraceCheckUtils]: 7: Hoare triple {2644#true} assume !(~i <= 0); {2644#true} is VALID [2022-02-21 03:23:49,011 INFO L272 TraceCheckUtils]: 8: Hoare triple {2644#true} call #t~ret0 := rec1(~i - 2); {2644#true} is VALID [2022-02-21 03:23:49,011 INFO L290 TraceCheckUtils]: 9: Hoare triple {2644#true} ~i := #in~i; {2644#true} is VALID [2022-02-21 03:23:49,011 INFO L290 TraceCheckUtils]: 10: Hoare triple {2644#true} assume ~i <= 0;#res := 0; {2653#(<= |rec1_#res| 0)} is VALID [2022-02-21 03:23:49,012 INFO L290 TraceCheckUtils]: 11: Hoare triple {2653#(<= |rec1_#res| 0)} assume true; {2653#(<= |rec1_#res| 0)} is VALID [2022-02-21 03:23:49,012 INFO L284 TraceCheckUtils]: 12: Hoare quadruple {2653#(<= |rec1_#res| 0)} {2644#true} #28#return; {2650#(<= |rec1_#t~ret0| 0)} is VALID [2022-02-21 03:23:49,013 INFO L272 TraceCheckUtils]: 13: Hoare triple {2650#(<= |rec1_#t~ret0| 0)} call #t~ret1 := rec1(#t~ret0 - 1); {2651#(<= (+ |rec1_#in~i| 1) 0)} is VALID [2022-02-21 03:23:49,014 INFO L290 TraceCheckUtils]: 14: Hoare triple {2651#(<= (+ |rec1_#in~i| 1) 0)} ~i := #in~i; {2652#(<= (+ rec1_~i 1) 0)} is VALID [2022-02-21 03:23:49,014 INFO L290 TraceCheckUtils]: 15: Hoare triple {2652#(<= (+ rec1_~i 1) 0)} assume !(~i <= 0); {2645#false} is VALID [2022-02-21 03:23:49,014 INFO L272 TraceCheckUtils]: 16: Hoare triple {2645#false} call #t~ret0 := rec1(~i - 2); {2645#false} is VALID [2022-02-21 03:23:49,015 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-02-21 03:23:49,015 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-21 03:23:49,015 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1929343439] [2022-02-21 03:23:49,015 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1929343439] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-21 03:23:49,015 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-21 03:23:49,015 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-02-21 03:23:49,015 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1403458492] [2022-02-21 03:23:49,016 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-21 03:23:49,052 INFO L210 LassoAnalysis]: Preferences: [2022-02-21 03:23:49,053 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2022-02-21 03:23:49,053 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2022-02-21 03:23:49,053 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2022-02-21 03:23:49,053 INFO L129 ssoRankerPreferences]: Use exernal solver: true [2022-02-21 03:23:49,053 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:23:49,053 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2022-02-21 03:23:49,053 INFO L132 ssoRankerPreferences]: Path of dumped script: [2022-02-21 03:23:49,053 INFO L133 ssoRankerPreferences]: Filename of dumped script: NestedRecursion_1d.c_Iteration4_Loop [2022-02-21 03:23:49,053 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2022-02-21 03:23:49,053 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2022-02-21 03:23:49,054 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 03:23:49,056 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 03:23:49,057 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 03:23:49,058 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 03:23:49,060 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 03:23:49,063 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 03:23:49,100 INFO L294 LassoAnalysis]: Preprocessing complete. [2022-02-21 03:23:49,100 INFO L404 LassoAnalysis]: Checking for nontermination... [2022-02-21 03:23:49,100 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:23:49,100 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:23:49,101 INFO L229 MonitoredProcess]: Starting monitored process 24 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-02-21 03:23:49,102 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (24)] Waiting until timeout for monitored process [2022-02-21 03:23:49,109 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2022-02-21 03:23:49,109 INFO L160 nArgumentSynthesizer]: Using integer mode. [2022-02-21 03:23:49,123 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2022-02-21 03:23:49,124 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {rec1_#res=0} Honda state: {rec1_#res=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2022-02-21 03:23:49,141 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (24)] Forceful destruction successful, exit code 0 [2022-02-21 03:23:49,142 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:23:49,142 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:23:49,143 INFO L229 MonitoredProcess]: Starting monitored process 25 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-02-21 03:23:49,144 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (25)] Waiting until timeout for monitored process [2022-02-21 03:23:49,145 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2022-02-21 03:23:49,145 INFO L160 nArgumentSynthesizer]: Using integer mode. [2022-02-21 03:23:49,163 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2022-02-21 03:23:49,163 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {rec1_#t~ret1=0} Honda state: {rec1_#t~ret1=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2022-02-21 03:23:49,182 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (25)] Ended with exit code 0 [2022-02-21 03:23:49,183 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:23:49,183 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:23:49,184 INFO L229 MonitoredProcess]: Starting monitored process 26 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-02-21 03:23:49,185 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (26)] Waiting until timeout for monitored process [2022-02-21 03:23:49,186 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2022-02-21 03:23:49,186 INFO L160 nArgumentSynthesizer]: Using integer mode. [2022-02-21 03:23:49,193 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2022-02-21 03:23:49,193 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {rec1_~i=0} Honda state: {rec1_~i=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2022-02-21 03:23:49,240 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (26)] Ended with exit code 0 [2022-02-21 03:23:49,241 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:23:49,241 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:23:49,242 INFO L229 MonitoredProcess]: Starting monitored process 27 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-02-21 03:23:49,242 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (27)] Waiting until timeout for monitored process [2022-02-21 03:23:49,244 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2022-02-21 03:23:49,244 INFO L160 nArgumentSynthesizer]: Using integer mode. [2022-02-21 03:23:49,258 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2022-02-21 03:23:49,259 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {rec1_#t~ret2=0} Honda state: {rec1_#t~ret2=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2022-02-21 03:23:49,274 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (27)] Ended with exit code 0 [2022-02-21 03:23:49,274 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:23:49,275 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:23:49,276 INFO L229 MonitoredProcess]: Starting monitored process 28 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-02-21 03:23:49,279 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2022-02-21 03:23:49,279 INFO L160 nArgumentSynthesizer]: Using integer mode. [2022-02-21 03:23:49,279 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (28)] Waiting until timeout for monitored process [2022-02-21 03:23:49,302 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (28)] Forceful destruction successful, exit code 0 [2022-02-21 03:23:49,302 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:23:49,302 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:23:49,303 INFO L229 MonitoredProcess]: Starting monitored process 29 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-02-21 03:23:49,304 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (29)] Waiting until timeout for monitored process [2022-02-21 03:23:49,307 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2022-02-21 03:23:49,307 INFO L160 nArgumentSynthesizer]: Using integer mode. [2022-02-21 03:23:49,369 INFO L444 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2022-02-21 03:23:49,372 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (29)] Forceful destruction successful, exit code 0 [2022-02-21 03:23:49,372 INFO L210 LassoAnalysis]: Preferences: [2022-02-21 03:23:49,372 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2022-02-21 03:23:49,372 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2022-02-21 03:23:49,372 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2022-02-21 03:23:49,372 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2022-02-21 03:23:49,372 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:23:49,372 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2022-02-21 03:23:49,372 INFO L132 ssoRankerPreferences]: Path of dumped script: [2022-02-21 03:23:49,372 INFO L133 ssoRankerPreferences]: Filename of dumped script: NestedRecursion_1d.c_Iteration4_Loop [2022-02-21 03:23:49,372 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2022-02-21 03:23:49,372 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2022-02-21 03:23:49,373 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 03:23:49,376 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 03:23:49,378 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 03:23:49,380 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 03:23:49,386 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 03:23:49,388 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 03:23:49,445 INFO L294 LassoAnalysis]: Preprocessing complete. [2022-02-21 03:23:49,445 INFO L490 LassoAnalysis]: Using template 'affine'. [2022-02-21 03:23:49,445 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:23:49,446 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:23:49,447 INFO L229 MonitoredProcess]: Starting monitored process 30 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-02-21 03:23:49,455 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (30)] Waiting until timeout for monitored process [2022-02-21 03:23:49,456 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-02-21 03:23:49,462 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 03:23:49,462 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 03:23:49,462 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 03:23:49,463 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 03:23:49,463 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 03:23:49,464 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-02-21 03:23:49,465 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 03:23:49,465 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 03:23:49,481 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (30)] Forceful destruction successful, exit code 0 [2022-02-21 03:23:49,482 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:23:49,482 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:23:49,483 INFO L229 MonitoredProcess]: Starting monitored process 31 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-02-21 03:23:49,483 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (31)] Waiting until timeout for monitored process [2022-02-21 03:23:49,485 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-02-21 03:23:49,491 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 03:23:49,491 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 03:23:49,491 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 03:23:49,492 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 03:23:49,492 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 03:23:49,492 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-02-21 03:23:49,492 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 03:23:49,503 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 03:23:49,521 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (31)] Forceful destruction successful, exit code 0 [2022-02-21 03:23:49,521 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:23:49,521 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:23:49,522 INFO L229 MonitoredProcess]: Starting monitored process 32 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-02-21 03:23:49,524 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (32)] Waiting until timeout for monitored process [2022-02-21 03:23:49,525 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-02-21 03:23:49,531 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 03:23:49,531 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 03:23:49,531 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 03:23:49,531 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 03:23:49,531 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 03:23:49,532 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-02-21 03:23:49,532 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 03:23:49,533 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 03:23:49,551 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (32)] Forceful destruction successful, exit code 0 [2022-02-21 03:23:49,552 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:23:49,552 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:23:49,553 INFO L229 MonitoredProcess]: Starting monitored process 33 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-02-21 03:23:49,555 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (33)] Waiting until timeout for monitored process [2022-02-21 03:23:49,556 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-02-21 03:23:49,562 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 03:23:49,563 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 03:23:49,563 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 03:23:49,563 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 03:23:49,563 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 03:23:49,563 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-02-21 03:23:49,563 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 03:23:49,565 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2022-02-21 03:23:49,566 INFO L443 ModelExtractionUtils]: Simplification made 2 calls to the SMT solver. [2022-02-21 03:23:49,566 INFO L444 ModelExtractionUtils]: 1 out of 3 variables were initially zero. Simplification set additionally 0 variables to zero. [2022-02-21 03:23:49,566 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:23:49,566 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:23:49,567 INFO L229 MonitoredProcess]: Starting monitored process 34 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-02-21 03:23:49,569 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (34)] Waiting until timeout for monitored process [2022-02-21 03:23:49,570 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2022-02-21 03:23:49,570 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2022-02-21 03:23:49,570 INFO L513 LassoAnalysis]: Proved termination. [2022-02-21 03:23:49,570 INFO L515 LassoAnalysis]: Termination argument consisting of: Ranking function f(rec1_#in~i) = 1*rec1_#in~i Supporting invariants [] [2022-02-21 03:23:49,588 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (33)] Forceful destruction successful, exit code 0 [2022-02-21 03:23:49,601 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2022-02-21 03:23:49,606 INFO L390 LassoCheck]: Loop: "~i := #in~i;" "assume !(~i <= 0);" "call #t~ret0 := rec1(~i - 2);"< [2022-02-21 03:23:49,610 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:23:49,620 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:23:49,640 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:23:49,641 INFO L263 TraceCheckSpWp]: Trace formula consists of 146 conjuncts, 10 conjunts are in the unsatisfiable core [2022-02-21 03:23:49,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:23:49,649 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-21 03:23:49,708 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (34)] Forceful destruction successful, exit code 0 [2022-02-21 03:23:49,754 INFO L290 TraceCheckUtils]: 0: Hoare triple {2654#unseeded} assume { :begin_inline_ULTIMATE.init } true; {2654#unseeded} is VALID [2022-02-21 03:23:49,754 INFO L290 TraceCheckUtils]: 1: Hoare triple {2654#unseeded} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet5#1, main_#t~ret6#1, main_~x~0#1;main_~x~0#1 := main_#t~nondet5#1;havoc main_#t~nondet5#1; {2654#unseeded} is VALID [2022-02-21 03:23:49,755 INFO L272 TraceCheckUtils]: 2: Hoare triple {2654#unseeded} call main_#t~ret6#1 := rec2(main_~x~0#1); {2654#unseeded} is VALID [2022-02-21 03:23:49,755 INFO L290 TraceCheckUtils]: 3: Hoare triple {2654#unseeded} ~j := #in~j; {2654#unseeded} is VALID [2022-02-21 03:23:49,755 INFO L290 TraceCheckUtils]: 4: Hoare triple {2654#unseeded} assume !(~j <= 0); {2654#unseeded} is VALID [2022-02-21 03:23:49,756 INFO L272 TraceCheckUtils]: 5: Hoare triple {2654#unseeded} call #t~ret3 := rec1(~j); {2654#unseeded} is VALID [2022-02-21 03:23:49,756 INFO L290 TraceCheckUtils]: 6: Hoare triple {2654#unseeded} ~i := #in~i; {2654#unseeded} is VALID [2022-02-21 03:23:49,756 INFO L290 TraceCheckUtils]: 7: Hoare triple {2654#unseeded} assume !(~i <= 0); {2654#unseeded} is VALID [2022-02-21 03:23:49,757 INFO L272 TraceCheckUtils]: 8: Hoare triple {2654#unseeded} call #t~ret0 := rec1(~i - 2); {2696#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2022-02-21 03:23:49,757 INFO L290 TraceCheckUtils]: 9: Hoare triple {2696#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} ~i := #in~i; {2696#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2022-02-21 03:23:49,758 INFO L290 TraceCheckUtils]: 10: Hoare triple {2696#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} assume ~i <= 0;#res := 0; {2696#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2022-02-21 03:23:49,758 INFO L290 TraceCheckUtils]: 11: Hoare triple {2696#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} assume true; {2696#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2022-02-21 03:23:49,759 INFO L284 TraceCheckUtils]: 12: Hoare quadruple {2696#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} {2654#unseeded} #28#return; {2654#unseeded} is VALID [2022-02-21 03:23:49,759 INFO L272 TraceCheckUtils]: 13: Hoare triple {2654#unseeded} call #t~ret1 := rec1(#t~ret0 - 1); {2654#unseeded} is VALID [2022-02-21 03:23:49,765 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:23:49,765 INFO L263 TraceCheckSpWp]: Trace formula consists of 37 conjuncts, 7 conjunts are in the unsatisfiable core [2022-02-21 03:23:49,788 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:23:49,789 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-21 03:23:49,818 INFO L290 TraceCheckUtils]: 0: Hoare triple {2657#(>= oldRank0 |rec1_#in~i|)} ~i := #in~i; {2712#(<= rec1_~i oldRank0)} is VALID [2022-02-21 03:23:49,818 INFO L290 TraceCheckUtils]: 1: Hoare triple {2712#(<= rec1_~i oldRank0)} assume !(~i <= 0); {2716#(and (not (<= rec1_~i 0)) (<= rec1_~i oldRank0))} is VALID [2022-02-21 03:23:49,819 INFO L272 TraceCheckUtils]: 2: Hoare triple {2716#(and (not (<= rec1_~i 0)) (<= rec1_~i oldRank0))} call #t~ret0 := rec1(~i - 2); {2667#(or (and (>= oldRank0 0) (> oldRank0 |rec1_#in~i|)) unseeded)} is VALID [2022-02-21 03:23:49,819 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-21 03:23:49,819 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 5 states, 4 states have (on average 2.75) internal successors, (11), 4 states have internal predecessors, (11), 2 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-21 03:23:49,851 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 17 edges. 17 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-21 03:23:49,851 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 5 states, 4 states have (on average 2.75) internal successors, (11), 4 states have internal predecessors, (11), 2 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Stem has 14 letters. Loop has 3 letters. [2022-02-21 03:23:49,852 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:23:49,852 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.2 stem predicates 3 loop predicates [2022-02-21 03:23:49,852 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 93 states and 144 transitions. cyclomatic complexity: 57 Second operand has 5 states, 4 states have (on average 2.75) internal successors, (11), 4 states have internal predecessors, (11), 2 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-21 03:23:50,001 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 93 states and 144 transitions. cyclomatic complexity: 57. Second operand has 5 states, 4 states have (on average 2.75) internal successors, (11), 4 states have internal predecessors, (11), 2 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Result 133 states and 208 transitions. Complement of second has 14 states. [2022-02-21 03:23:50,001 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 5 states 2 stem states 2 non-accepting loop states 1 accepting loop states [2022-02-21 03:23:50,001 INFO L123 tractBuchiDifference]: Start testing correctness of buchiDifferenceNCSBLazy3 [2022-02-21 03:23:50,001 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 93 states and 144 transitions. cyclomatic complexity: 57 [2022-02-21 03:23:50,001 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 03:23:50,001 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 03:23:50,001 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 5 states, 4 states have (on average 2.75) internal successors, (11), 4 states have internal predecessors, (11), 2 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-21 03:23:50,002 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2022-02-21 03:23:50,002 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 03:23:50,002 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 03:23:50,003 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 133 states and 208 transitions. [2022-02-21 03:23:50,004 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 9 [2022-02-21 03:23:50,004 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 03:23:50,004 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 03:23:50,005 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 93 states and 144 transitions. cyclomatic complexity: 57 [2022-02-21 03:23:50,010 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 16 examples of accepted words. [2022-02-21 03:23:50,010 INFO L70 LassoExtractor]: Start lassoExtractor. Operand has 5 states, 4 states have (on average 2.75) internal successors, (11), 4 states have internal predecessors, (11), 2 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-21 03:23:50,011 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2022-02-21 03:23:50,011 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 1 examples of accepted words. [2022-02-21 03:23:50,011 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 133 states and 208 transitions. cyclomatic complexity: 83 [2022-02-21 03:23:50,014 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 16 examples of accepted words. [2022-02-21 03:23:50,014 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 93 states and 144 transitions. cyclomatic complexity: 57 Stem has 14 letters. Loop has 3 letters. [2022-02-21 03:23:50,014 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:23:50,014 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 5 states, 4 states have (on average 2.75) internal successors, (11), 4 states have internal predecessors, (11), 2 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Stem has 14 letters. Loop has 3 letters. [2022-02-21 03:23:50,015 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:23:50,015 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 133 states and 208 transitions. cyclomatic complexity: 83 Stem has 14 letters. Loop has 3 letters. [2022-02-21 03:23:50,015 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:23:50,015 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 93 states and 144 transitions. cyclomatic complexity: 57 Stem has 2 letters. Loop has 3 letters. [2022-02-21 03:23:50,016 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:23:50,016 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 5 states, 4 states have (on average 2.75) internal successors, (11), 4 states have internal predecessors, (11), 2 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Stem has 2 letters. Loop has 3 letters. [2022-02-21 03:23:50,016 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:23:50,016 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 133 states and 208 transitions. cyclomatic complexity: 83 Stem has 2 letters. Loop has 3 letters. [2022-02-21 03:23:50,016 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:23:50,016 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 93 states and 144 transitions. cyclomatic complexity: 57 Stem has 19 letters. Loop has 3 letters. [2022-02-21 03:23:50,016 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:23:50,016 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 5 states, 4 states have (on average 2.75) internal successors, (11), 4 states have internal predecessors, (11), 2 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Stem has 19 letters. Loop has 3 letters. [2022-02-21 03:23:50,016 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:23:50,016 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 133 states and 208 transitions. cyclomatic complexity: 83 Stem has 19 letters. Loop has 3 letters. [2022-02-21 03:23:50,016 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:23:50,016 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 93 states and 144 transitions. cyclomatic complexity: 57 Stem has 133 letters. Loop has 133 letters. [2022-02-21 03:23:50,016 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:23:50,016 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 5 states, 4 states have (on average 2.75) internal successors, (11), 4 states have internal predecessors, (11), 2 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Stem has 133 letters. Loop has 133 letters. [2022-02-21 03:23:50,016 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:23:50,016 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 133 states and 208 transitions. cyclomatic complexity: 83 Stem has 133 letters. Loop has 133 letters. [2022-02-21 03:23:50,016 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:23:50,016 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 93 states and 144 transitions. cyclomatic complexity: 57 Stem has 93 letters. Loop has 93 letters. [2022-02-21 03:23:50,016 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:23:50,017 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 5 states, 4 states have (on average 2.75) internal successors, (11), 4 states have internal predecessors, (11), 2 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Stem has 93 letters. Loop has 93 letters. [2022-02-21 03:23:50,017 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:23:50,017 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 133 states and 208 transitions. cyclomatic complexity: 83 Stem has 93 letters. Loop has 93 letters. [2022-02-21 03:23:50,017 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:23:50,017 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 93 states and 144 transitions. cyclomatic complexity: 57 Stem has 5 letters. Loop has 5 letters. [2022-02-21 03:23:50,017 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:23:50,017 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 5 states, 4 states have (on average 2.75) internal successors, (11), 4 states have internal predecessors, (11), 2 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Stem has 5 letters. Loop has 5 letters. [2022-02-21 03:23:50,017 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:23:50,017 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 133 states and 208 transitions. cyclomatic complexity: 83 Stem has 5 letters. Loop has 5 letters. [2022-02-21 03:23:50,017 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:23:50,018 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 93 states and 144 transitions. cyclomatic complexity: 57 Stem has 16 letters. Loop has 40 letters. [2022-02-21 03:23:50,018 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:23:50,018 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 5 states, 4 states have (on average 2.75) internal successors, (11), 4 states have internal predecessors, (11), 2 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Stem has 16 letters. Loop has 40 letters. [2022-02-21 03:23:50,019 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:23:50,019 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 133 states and 208 transitions. cyclomatic complexity: 83 Stem has 16 letters. Loop has 40 letters. [2022-02-21 03:23:50,019 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:23:50,019 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 93 states and 144 transitions. cyclomatic complexity: 57 Stem has 15 letters. Loop has 3 letters. [2022-02-21 03:23:50,019 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:23:50,019 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 5 states, 4 states have (on average 2.75) internal successors, (11), 4 states have internal predecessors, (11), 2 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Stem has 15 letters. Loop has 3 letters. [2022-02-21 03:23:50,019 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:23:50,019 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 133 states and 208 transitions. cyclomatic complexity: 83 Stem has 15 letters. Loop has 3 letters. [2022-02-21 03:23:50,019 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:23:50,019 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 93 states and 144 transitions. cyclomatic complexity: 57 Stem has 14 letters. Loop has 3 letters. [2022-02-21 03:23:50,019 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:23:50,019 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 5 states, 4 states have (on average 2.75) internal successors, (11), 4 states have internal predecessors, (11), 2 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Stem has 14 letters. Loop has 3 letters. [2022-02-21 03:23:50,019 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:23:50,019 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 133 states and 208 transitions. cyclomatic complexity: 83 Stem has 14 letters. Loop has 3 letters. [2022-02-21 03:23:50,020 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:23:50,020 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 93 states and 144 transitions. cyclomatic complexity: 57 Stem has 16 letters. Loop has 3 letters. [2022-02-21 03:23:50,020 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:23:50,020 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 5 states, 4 states have (on average 2.75) internal successors, (11), 4 states have internal predecessors, (11), 2 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Stem has 16 letters. Loop has 3 letters. [2022-02-21 03:23:50,020 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:23:50,020 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 133 states and 208 transitions. cyclomatic complexity: 83 Stem has 16 letters. Loop has 3 letters. [2022-02-21 03:23:50,020 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:23:50,020 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 93 states and 144 transitions. cyclomatic complexity: 57 Stem has 21 letters. Loop has 77 letters. [2022-02-21 03:23:50,021 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:23:50,021 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 5 states, 4 states have (on average 2.75) internal successors, (11), 4 states have internal predecessors, (11), 2 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Stem has 21 letters. Loop has 77 letters. [2022-02-21 03:23:50,021 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:23:50,021 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 133 states and 208 transitions. cyclomatic complexity: 83 Stem has 21 letters. Loop has 77 letters. [2022-02-21 03:23:50,021 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:23:50,021 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 93 states and 144 transitions. cyclomatic complexity: 57 Stem has 21 letters. Loop has 45 letters. [2022-02-21 03:23:50,021 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:23:50,021 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 5 states, 4 states have (on average 2.75) internal successors, (11), 4 states have internal predecessors, (11), 2 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Stem has 21 letters. Loop has 45 letters. [2022-02-21 03:23:50,021 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:23:50,021 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 133 states and 208 transitions. cyclomatic complexity: 83 Stem has 21 letters. Loop has 45 letters. [2022-02-21 03:23:50,022 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:23:50,022 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 93 states and 144 transitions. cyclomatic complexity: 57 Stem has 21 letters. Loop has 61 letters. [2022-02-21 03:23:50,022 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:23:50,022 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 5 states, 4 states have (on average 2.75) internal successors, (11), 4 states have internal predecessors, (11), 2 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Stem has 21 letters. Loop has 61 letters. [2022-02-21 03:23:50,022 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:23:50,022 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 133 states and 208 transitions. cyclomatic complexity: 83 Stem has 21 letters. Loop has 61 letters. [2022-02-21 03:23:50,022 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:23:50,022 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 93 states and 144 transitions. cyclomatic complexity: 57 Stem has 21 letters. Loop has 77 letters. [2022-02-21 03:23:50,023 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:23:50,023 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 5 states, 4 states have (on average 2.75) internal successors, (11), 4 states have internal predecessors, (11), 2 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Stem has 21 letters. Loop has 77 letters. [2022-02-21 03:23:50,023 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:23:50,023 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 133 states and 208 transitions. cyclomatic complexity: 83 Stem has 21 letters. Loop has 77 letters. [2022-02-21 03:23:50,023 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:23:50,023 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 93 states and 144 transitions. cyclomatic complexity: 57 Stem has 16 letters. Loop has 8 letters. [2022-02-21 03:23:50,023 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:23:50,023 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 5 states, 4 states have (on average 2.75) internal successors, (11), 4 states have internal predecessors, (11), 2 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Stem has 16 letters. Loop has 8 letters. [2022-02-21 03:23:50,023 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:23:50,023 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 133 states and 208 transitions. cyclomatic complexity: 83 Stem has 16 letters. Loop has 8 letters. [2022-02-21 03:23:50,023 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:23:50,023 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 93 states and 144 transitions. cyclomatic complexity: 57 Stem has 16 letters. Loop has 24 letters. [2022-02-21 03:23:50,024 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:23:50,024 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 5 states, 4 states have (on average 2.75) internal successors, (11), 4 states have internal predecessors, (11), 2 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Stem has 16 letters. Loop has 24 letters. [2022-02-21 03:23:50,024 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:23:50,024 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 133 states and 208 transitions. cyclomatic complexity: 83 Stem has 16 letters. Loop has 24 letters. [2022-02-21 03:23:50,024 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:23:50,024 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 93 states and 144 transitions. cyclomatic complexity: 57 Stem has 16 letters. Loop has 40 letters. [2022-02-21 03:23:50,024 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:23:50,024 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 5 states, 4 states have (on average 2.75) internal successors, (11), 4 states have internal predecessors, (11), 2 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Stem has 16 letters. Loop has 40 letters. [2022-02-21 03:23:50,024 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:23:50,024 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 133 states and 208 transitions. cyclomatic complexity: 83 Stem has 16 letters. Loop has 40 letters. [2022-02-21 03:23:50,025 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:23:50,025 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 93 states and 144 transitions. cyclomatic complexity: 57 Stem has 45 letters. Loop has 40 letters. [2022-02-21 03:23:50,025 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:23:50,025 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 5 states, 4 states have (on average 2.75) internal successors, (11), 4 states have internal predecessors, (11), 2 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Stem has 45 letters. Loop has 40 letters. [2022-02-21 03:23:50,025 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:23:50,025 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 133 states and 208 transitions. cyclomatic complexity: 83 Stem has 45 letters. Loop has 40 letters. [2022-02-21 03:23:50,025 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:23:50,025 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 93 states and 144 transitions. cyclomatic complexity: 57 Stem has 42 letters. Loop has 40 letters. [2022-02-21 03:23:50,025 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:23:50,025 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 5 states, 4 states have (on average 2.75) internal successors, (11), 4 states have internal predecessors, (11), 2 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Stem has 42 letters. Loop has 40 letters. [2022-02-21 03:23:50,025 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:23:50,025 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 133 states and 208 transitions. cyclomatic complexity: 83 Stem has 42 letters. Loop has 40 letters. [2022-02-21 03:23:50,025 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:23:50,026 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 93 states and 144 transitions. cyclomatic complexity: 57 Stem has 44 letters. Loop has 40 letters. [2022-02-21 03:23:50,026 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:23:50,026 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 5 states, 4 states have (on average 2.75) internal successors, (11), 4 states have internal predecessors, (11), 2 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Stem has 44 letters. Loop has 40 letters. [2022-02-21 03:23:50,026 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:23:50,026 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 133 states and 208 transitions. cyclomatic complexity: 83 Stem has 44 letters. Loop has 40 letters. [2022-02-21 03:23:50,026 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:23:50,026 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 93 states and 144 transitions. cyclomatic complexity: 57 Stem has 43 letters. Loop has 40 letters. [2022-02-21 03:23:50,026 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:23:50,026 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 5 states, 4 states have (on average 2.75) internal successors, (11), 4 states have internal predecessors, (11), 2 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Stem has 43 letters. Loop has 40 letters. [2022-02-21 03:23:50,026 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:23:50,026 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 133 states and 208 transitions. cyclomatic complexity: 83 Stem has 43 letters. Loop has 40 letters. [2022-02-21 03:23:50,026 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:23:50,026 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 93 states and 144 transitions. cyclomatic complexity: 57 Stem has 42 letters. Loop has 40 letters. [2022-02-21 03:23:50,027 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:23:50,027 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 5 states, 4 states have (on average 2.75) internal successors, (11), 4 states have internal predecessors, (11), 2 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Stem has 42 letters. Loop has 40 letters. [2022-02-21 03:23:50,027 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:23:50,027 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 133 states and 208 transitions. cyclomatic complexity: 83 Stem has 42 letters. Loop has 40 letters. [2022-02-21 03:23:50,027 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:23:50,027 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 93 states and 144 transitions. cyclomatic complexity: 57 Stem has 2 letters. Loop has 3 letters. [2022-02-21 03:23:50,027 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:23:50,027 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 5 states, 4 states have (on average 2.75) internal successors, (11), 4 states have internal predecessors, (11), 2 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Stem has 2 letters. Loop has 3 letters. [2022-02-21 03:23:50,027 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:23:50,027 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 133 states and 208 transitions. cyclomatic complexity: 83 Stem has 2 letters. Loop has 3 letters. [2022-02-21 03:23:50,027 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:23:50,027 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 93 states and 144 transitions. cyclomatic complexity: 57 Stem has 20 letters. Loop has 3 letters. [2022-02-21 03:23:50,027 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:23:50,027 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 5 states, 4 states have (on average 2.75) internal successors, (11), 4 states have internal predecessors, (11), 2 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Stem has 20 letters. Loop has 3 letters. [2022-02-21 03:23:50,027 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:23:50,027 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 133 states and 208 transitions. cyclomatic complexity: 83 Stem has 20 letters. Loop has 3 letters. [2022-02-21 03:23:50,027 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:23:50,027 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 93 states and 144 transitions. cyclomatic complexity: 57 Stem has 32 letters. Loop has 40 letters. [2022-02-21 03:23:50,028 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:23:50,028 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 5 states, 4 states have (on average 2.75) internal successors, (11), 4 states have internal predecessors, (11), 2 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Stem has 32 letters. Loop has 40 letters. [2022-02-21 03:23:50,028 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:23:50,028 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 133 states and 208 transitions. cyclomatic complexity: 83 Stem has 32 letters. Loop has 40 letters. [2022-02-21 03:23:50,028 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:23:50,028 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 93 states and 144 transitions. cyclomatic complexity: 57 Stem has 21 letters. Loop has 3 letters. [2022-02-21 03:23:50,028 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:23:50,028 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 5 states, 4 states have (on average 2.75) internal successors, (11), 4 states have internal predecessors, (11), 2 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Stem has 21 letters. Loop has 3 letters. [2022-02-21 03:23:50,028 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:23:50,028 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 133 states and 208 transitions. cyclomatic complexity: 83 Stem has 21 letters. Loop has 3 letters. [2022-02-21 03:23:50,028 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:23:50,028 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 93 states and 144 transitions. cyclomatic complexity: 57 Stem has 21 letters. Loop has 77 letters. [2022-02-21 03:23:50,028 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:23:50,029 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 5 states, 4 states have (on average 2.75) internal successors, (11), 4 states have internal predecessors, (11), 2 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Stem has 21 letters. Loop has 77 letters. [2022-02-21 03:23:50,029 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:23:50,029 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 133 states and 208 transitions. cyclomatic complexity: 83 Stem has 21 letters. Loop has 77 letters. [2022-02-21 03:23:50,029 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:23:50,029 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 93 states and 144 transitions. cyclomatic complexity: 57 Stem has 19 letters. Loop has 3 letters. [2022-02-21 03:23:50,029 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:23:50,029 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 5 states, 4 states have (on average 2.75) internal successors, (11), 4 states have internal predecessors, (11), 2 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Stem has 19 letters. Loop has 3 letters. [2022-02-21 03:23:50,029 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:23:50,029 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 133 states and 208 transitions. cyclomatic complexity: 83 Stem has 19 letters. Loop has 3 letters. [2022-02-21 03:23:50,029 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:23:50,029 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 93 states and 144 transitions. cyclomatic complexity: 57 Stem has 21 letters. Loop has 77 letters. [2022-02-21 03:23:50,030 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:23:50,030 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 5 states, 4 states have (on average 2.75) internal successors, (11), 4 states have internal predecessors, (11), 2 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Stem has 21 letters. Loop has 77 letters. [2022-02-21 03:23:50,030 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:23:50,030 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 133 states and 208 transitions. cyclomatic complexity: 83 Stem has 21 letters. Loop has 77 letters. [2022-02-21 03:23:50,030 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:23:50,030 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 93 states and 144 transitions. cyclomatic complexity: 57 Stem has 21 letters. Loop has 45 letters. [2022-02-21 03:23:50,030 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:23:50,030 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 5 states, 4 states have (on average 2.75) internal successors, (11), 4 states have internal predecessors, (11), 2 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Stem has 21 letters. Loop has 45 letters. [2022-02-21 03:23:50,030 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:23:50,030 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 133 states and 208 transitions. cyclomatic complexity: 83 Stem has 21 letters. Loop has 45 letters. [2022-02-21 03:23:50,031 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:23:50,031 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 93 states and 144 transitions. cyclomatic complexity: 57 Stem has 21 letters. Loop has 61 letters. [2022-02-21 03:23:50,031 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:23:50,031 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 5 states, 4 states have (on average 2.75) internal successors, (11), 4 states have internal predecessors, (11), 2 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Stem has 21 letters. Loop has 61 letters. [2022-02-21 03:23:50,031 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:23:50,031 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 133 states and 208 transitions. cyclomatic complexity: 83 Stem has 21 letters. Loop has 61 letters. [2022-02-21 03:23:50,031 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:23:50,031 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 93 states and 144 transitions. cyclomatic complexity: 57 Stem has 32 letters. Loop has 40 letters. [2022-02-21 03:23:50,031 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:23:50,031 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 5 states, 4 states have (on average 2.75) internal successors, (11), 4 states have internal predecessors, (11), 2 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Stem has 32 letters. Loop has 40 letters. [2022-02-21 03:23:50,032 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:23:50,032 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 133 states and 208 transitions. cyclomatic complexity: 83 Stem has 32 letters. Loop has 40 letters. [2022-02-21 03:23:50,032 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:23:50,032 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 93 states and 144 transitions. cyclomatic complexity: 57 Stem has 32 letters. Loop has 8 letters. [2022-02-21 03:23:50,032 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:23:50,032 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 5 states, 4 states have (on average 2.75) internal successors, (11), 4 states have internal predecessors, (11), 2 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Stem has 32 letters. Loop has 8 letters. [2022-02-21 03:23:50,032 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:23:50,032 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 133 states and 208 transitions. cyclomatic complexity: 83 Stem has 32 letters. Loop has 8 letters. [2022-02-21 03:23:50,032 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:23:50,032 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 93 states and 144 transitions. cyclomatic complexity: 57 Stem has 32 letters. Loop has 24 letters. [2022-02-21 03:23:50,032 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:23:50,032 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 5 states, 4 states have (on average 2.75) internal successors, (11), 4 states have internal predecessors, (11), 2 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Stem has 32 letters. Loop has 24 letters. [2022-02-21 03:23:50,032 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:23:50,032 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 133 states and 208 transitions. cyclomatic complexity: 83 Stem has 32 letters. Loop has 24 letters. [2022-02-21 03:23:50,033 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:23:50,033 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 93 states and 144 transitions. cyclomatic complexity: 57 Stem has 42 letters. Loop has 40 letters. [2022-02-21 03:23:50,033 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:23:50,033 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 5 states, 4 states have (on average 2.75) internal successors, (11), 4 states have internal predecessors, (11), 2 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Stem has 42 letters. Loop has 40 letters. [2022-02-21 03:23:50,033 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:23:50,033 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 133 states and 208 transitions. cyclomatic complexity: 83 Stem has 42 letters. Loop has 40 letters. [2022-02-21 03:23:50,033 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:23:50,033 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 93 states and 144 transitions. cyclomatic complexity: 57 Stem has 43 letters. Loop has 40 letters. [2022-02-21 03:23:50,033 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:23:50,033 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 5 states, 4 states have (on average 2.75) internal successors, (11), 4 states have internal predecessors, (11), 2 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Stem has 43 letters. Loop has 40 letters. [2022-02-21 03:23:50,033 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:23:50,033 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 133 states and 208 transitions. cyclomatic complexity: 83 Stem has 43 letters. Loop has 40 letters. [2022-02-21 03:23:50,033 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:23:50,033 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 93 states and 144 transitions. cyclomatic complexity: 57 Stem has 44 letters. Loop has 40 letters. [2022-02-21 03:23:50,034 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:23:50,034 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 5 states, 4 states have (on average 2.75) internal successors, (11), 4 states have internal predecessors, (11), 2 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Stem has 44 letters. Loop has 40 letters. [2022-02-21 03:23:50,034 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:23:50,034 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 133 states and 208 transitions. cyclomatic complexity: 83 Stem has 44 letters. Loop has 40 letters. [2022-02-21 03:23:50,034 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:23:50,034 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 93 states and 144 transitions. cyclomatic complexity: 57 Stem has 45 letters. Loop has 40 letters. [2022-02-21 03:23:50,034 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:23:50,034 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 5 states, 4 states have (on average 2.75) internal successors, (11), 4 states have internal predecessors, (11), 2 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Stem has 45 letters. Loop has 40 letters. [2022-02-21 03:23:50,034 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:23:50,034 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 133 states and 208 transitions. cyclomatic complexity: 83 Stem has 45 letters. Loop has 40 letters. [2022-02-21 03:23:50,034 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:23:50,034 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 93 states and 144 transitions. cyclomatic complexity: 57 Stem has 42 letters. Loop has 40 letters. [2022-02-21 03:23:50,035 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:23:50,035 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 5 states, 4 states have (on average 2.75) internal successors, (11), 4 states have internal predecessors, (11), 2 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Stem has 42 letters. Loop has 40 letters. [2022-02-21 03:23:50,035 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:23:50,035 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 133 states and 208 transitions. cyclomatic complexity: 83 Stem has 42 letters. Loop has 40 letters. [2022-02-21 03:23:50,035 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:23:50,035 INFO L161 tractBuchiDifference]: Finished testing correctness of buchiDifferenceNCSBLazy3 [2022-02-21 03:23:50,035 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 4 states have (on average 2.75) internal successors, (11), 4 states have internal predecessors, (11), 2 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-21 03:23:50,036 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 18 transitions. [2022-02-21 03:23:50,036 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 18 transitions. Stem has 14 letters. Loop has 3 letters. [2022-02-21 03:23:50,036 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:23:50,036 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 18 transitions. Stem has 17 letters. Loop has 3 letters. [2022-02-21 03:23:50,036 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:23:50,036 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 18 transitions. Stem has 14 letters. Loop has 6 letters. [2022-02-21 03:23:50,036 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:23:50,036 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 133 states and 208 transitions. cyclomatic complexity: 83 [2022-02-21 03:23:50,041 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 9 [2022-02-21 03:23:50,046 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 133 states to 121 states and 196 transitions. [2022-02-21 03:23:50,046 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 50 [2022-02-21 03:23:50,046 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 52 [2022-02-21 03:23:50,046 INFO L73 IsDeterministic]: Start isDeterministic. Operand 121 states and 196 transitions. [2022-02-21 03:23:50,046 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2022-02-21 03:23:50,046 INFO L681 BuchiCegarLoop]: Abstraction has 121 states and 196 transitions. [2022-02-21 03:23:50,047 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 121 states and 196 transitions. [2022-02-21 03:23:50,051 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 121 to 117. [2022-02-21 03:23:50,051 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-21 03:23:50,051 INFO L82 GeneralOperation]: Start isEquivalent. First operand 121 states and 196 transitions. Second operand has 117 states, 68 states have (on average 1.1764705882352942) internal successors, (80), 76 states have internal predecessors, (80), 32 states have call successors, (32), 18 states have call predecessors, (32), 17 states have return successors, (74), 22 states have call predecessors, (74), 28 states have call successors, (74) [2022-02-21 03:23:50,051 INFO L74 IsIncluded]: Start isIncluded. First operand 121 states and 196 transitions. Second operand has 117 states, 68 states have (on average 1.1764705882352942) internal successors, (80), 76 states have internal predecessors, (80), 32 states have call successors, (32), 18 states have call predecessors, (32), 17 states have return successors, (74), 22 states have call predecessors, (74), 28 states have call successors, (74) [2022-02-21 03:23:50,052 INFO L87 Difference]: Start difference. First operand 121 states and 196 transitions. Second operand has 117 states, 68 states have (on average 1.1764705882352942) internal successors, (80), 76 states have internal predecessors, (80), 32 states have call successors, (32), 18 states have call predecessors, (32), 17 states have return successors, (74), 22 states have call predecessors, (74), 28 states have call successors, (74) [2022-02-21 03:23:50,052 INFO L149 Difference]: Subtrahend was not deterministic. Recomputing result with determinization. [2022-02-21 03:23:50,073 INFO L93 Difference]: Finished difference Result 394 states and 619 transitions. [2022-02-21 03:23:50,074 INFO L276 IsEmpty]: Start isEmpty. Operand 394 states and 619 transitions. [2022-02-21 03:23:50,075 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 03:23:50,075 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 03:23:50,076 INFO L74 IsIncluded]: Start isIncluded. First operand has 117 states, 68 states have (on average 1.1764705882352942) internal successors, (80), 76 states have internal predecessors, (80), 32 states have call successors, (32), 18 states have call predecessors, (32), 17 states have return successors, (74), 22 states have call predecessors, (74), 28 states have call successors, (74) Second operand 121 states and 196 transitions. [2022-02-21 03:23:50,077 INFO L87 Difference]: Start difference. First operand has 117 states, 68 states have (on average 1.1764705882352942) internal successors, (80), 76 states have internal predecessors, (80), 32 states have call successors, (32), 18 states have call predecessors, (32), 17 states have return successors, (74), 22 states have call predecessors, (74), 28 states have call successors, (74) Second operand 121 states and 196 transitions. [2022-02-21 03:23:50,077 INFO L149 Difference]: Subtrahend was not deterministic. Recomputing result with determinization. [2022-02-21 03:23:50,097 INFO L93 Difference]: Finished difference Result 422 states and 661 transitions. [2022-02-21 03:23:50,098 INFO L276 IsEmpty]: Start isEmpty. Operand 422 states and 661 transitions. [2022-02-21 03:23:50,099 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 03:23:50,100 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 03:23:50,100 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-21 03:23:50,100 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-21 03:23:50,100 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 117 states, 68 states have (on average 1.1764705882352942) internal successors, (80), 76 states have internal predecessors, (80), 32 states have call successors, (32), 18 states have call predecessors, (32), 17 states have return successors, (74), 22 states have call predecessors, (74), 28 states have call successors, (74) [2022-02-21 03:23:50,104 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 117 states to 117 states and 186 transitions. [2022-02-21 03:23:50,104 INFO L704 BuchiCegarLoop]: Abstraction has 117 states and 186 transitions. [2022-02-21 03:23:50,104 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-21 03:23:50,105 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-02-21 03:23:50,105 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-02-21 03:23:50,105 INFO L87 Difference]: Start difference. First operand 117 states and 186 transitions. Second operand has 6 states, 4 states have (on average 2.5) internal successors, (10), 4 states have internal predecessors, (10), 3 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-21 03:23:50,191 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:23:50,191 INFO L93 Difference]: Finished difference Result 130 states and 196 transitions. [2022-02-21 03:23:50,191 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-02-21 03:23:50,191 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 6 states, 4 states have (on average 2.5) internal successors, (10), 4 states have internal predecessors, (10), 3 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-21 03:23:50,202 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 16 edges. 16 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-21 03:23:50,203 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 130 states and 196 transitions. [2022-02-21 03:23:50,208 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 11 [2022-02-21 03:23:50,215 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 130 states to 128 states and 194 transitions. [2022-02-21 03:23:50,215 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 60 [2022-02-21 03:23:50,215 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 60 [2022-02-21 03:23:50,215 INFO L73 IsDeterministic]: Start isDeterministic. Operand 128 states and 194 transitions. [2022-02-21 03:23:50,215 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2022-02-21 03:23:50,215 INFO L681 BuchiCegarLoop]: Abstraction has 128 states and 194 transitions. [2022-02-21 03:23:50,215 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 128 states and 194 transitions. [2022-02-21 03:23:50,225 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 128 to 105. [2022-02-21 03:23:50,225 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-21 03:23:50,226 INFO L82 GeneralOperation]: Start isEquivalent. First operand 128 states and 194 transitions. Second operand has 105 states, 60 states have (on average 1.1333333333333333) internal successors, (68), 66 states have internal predecessors, (68), 30 states have call successors, (30), 16 states have call predecessors, (30), 15 states have return successors, (60), 22 states have call predecessors, (60), 26 states have call successors, (60) [2022-02-21 03:23:50,226 INFO L74 IsIncluded]: Start isIncluded. First operand 128 states and 194 transitions. Second operand has 105 states, 60 states have (on average 1.1333333333333333) internal successors, (68), 66 states have internal predecessors, (68), 30 states have call successors, (30), 16 states have call predecessors, (30), 15 states have return successors, (60), 22 states have call predecessors, (60), 26 states have call successors, (60) [2022-02-21 03:23:50,228 INFO L87 Difference]: Start difference. First operand 128 states and 194 transitions. Second operand has 105 states, 60 states have (on average 1.1333333333333333) internal successors, (68), 66 states have internal predecessors, (68), 30 states have call successors, (30), 16 states have call predecessors, (30), 15 states have return successors, (60), 22 states have call predecessors, (60), 26 states have call successors, (60) [2022-02-21 03:23:50,228 INFO L149 Difference]: Subtrahend was not deterministic. Recomputing result with determinization. [2022-02-21 03:23:50,272 INFO L93 Difference]: Finished difference Result 422 states and 665 transitions. [2022-02-21 03:23:50,272 INFO L276 IsEmpty]: Start isEmpty. Operand 422 states and 665 transitions. [2022-02-21 03:23:50,274 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 03:23:50,274 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 03:23:50,275 INFO L74 IsIncluded]: Start isIncluded. First operand has 105 states, 60 states have (on average 1.1333333333333333) internal successors, (68), 66 states have internal predecessors, (68), 30 states have call successors, (30), 16 states have call predecessors, (30), 15 states have return successors, (60), 22 states have call predecessors, (60), 26 states have call successors, (60) Second operand 128 states and 194 transitions. [2022-02-21 03:23:50,275 INFO L87 Difference]: Start difference. First operand has 105 states, 60 states have (on average 1.1333333333333333) internal successors, (68), 66 states have internal predecessors, (68), 30 states have call successors, (30), 16 states have call predecessors, (30), 15 states have return successors, (60), 22 states have call predecessors, (60), 26 states have call successors, (60) Second operand 128 states and 194 transitions. [2022-02-21 03:23:50,275 INFO L149 Difference]: Subtrahend was not deterministic. Recomputing result with determinization. [2022-02-21 03:23:50,296 INFO L93 Difference]: Finished difference Result 490 states and 777 transitions. [2022-02-21 03:23:50,296 INFO L276 IsEmpty]: Start isEmpty. Operand 490 states and 777 transitions. [2022-02-21 03:23:50,299 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 03:23:50,299 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 03:23:50,299 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-21 03:23:50,299 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-21 03:23:50,300 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 105 states, 60 states have (on average 1.1333333333333333) internal successors, (68), 66 states have internal predecessors, (68), 30 states have call successors, (30), 16 states have call predecessors, (30), 15 states have return successors, (60), 22 states have call predecessors, (60), 26 states have call successors, (60) [2022-02-21 03:23:50,302 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 105 states to 105 states and 158 transitions. [2022-02-21 03:23:50,302 INFO L704 BuchiCegarLoop]: Abstraction has 105 states and 158 transitions. [2022-02-21 03:23:50,302 INFO L587 BuchiCegarLoop]: Abstraction has 105 states and 158 transitions. [2022-02-21 03:23:50,302 INFO L425 BuchiCegarLoop]: ======== Iteration 5============ [2022-02-21 03:23:50,302 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 105 states and 158 transitions. [2022-02-21 03:23:50,303 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 10 [2022-02-21 03:23:50,303 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 03:23:50,303 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 03:23:50,303 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-21 03:23:50,303 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [3, 2, 2, 1, 1, 1, 1, 1, 1] [2022-02-21 03:23:50,303 INFO L791 eck$LassoCheckResult]: Stem: 4372#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true; 4373#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet5#1, main_#t~ret6#1, main_~x~0#1;main_~x~0#1 := main_#t~nondet5#1;havoc main_#t~nondet5#1; 4367#L25 call main_#t~ret6#1 := rec2(main_~x~0#1);< 4396#rec2ENTRY ~j := #in~j; 4437#L18 assume !(~j <= 0); 4428#L20 call #t~ret3 := rec1(~j);< 4436#rec1ENTRY ~i := #in~i; 4435#L12 assume !(~i <= 0); 4377#L14 call #t~ret0 := rec1(~i - 2);< 4433#rec1ENTRY ~i := #in~i; 4431#L12 assume !(~i <= 0); 4382#L14 call #t~ret0 := rec1(~i - 2);< 4430#rec1ENTRY ~i := #in~i; 4432#L12 assume ~i <= 0;#res := 0; 4447#rec1FINAL assume true; 4408#rec1EXIT >#28#return; 4399#L14-1 [2022-02-21 03:23:50,303 INFO L793 eck$LassoCheckResult]: Loop: 4399#L14-1 call #t~ret1 := rec1(#t~ret0 - 1);< 4400#rec1ENTRY ~i := #in~i; 4416#L12 assume ~i <= 0;#res := 0; 4403#rec1FINAL assume true; 4405#rec1EXIT >#30#return; 4379#L14-2 call #t~ret2 := rec1(#t~ret1);< 4397#rec1ENTRY ~i := #in~i; 4443#L12 assume !(~i <= 0); 4376#L14 call #t~ret0 := rec1(~i - 2);< 4397#rec1ENTRY ~i := #in~i; 4443#L12 assume ~i <= 0;#res := 0; 4442#rec1FINAL assume true; 4441#rec1EXIT >#28#return; 4399#L14-1 [2022-02-21 03:23:50,304 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:23:50,304 INFO L85 PathProgramCache]: Analyzing trace with hash 1325197585, now seen corresponding path program 1 times [2022-02-21 03:23:50,304 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 03:23:50,304 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [640549694] [2022-02-21 03:23:50,304 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:23:50,304 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 03:23:50,315 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:23:50,315 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-02-21 03:23:50,320 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:23:50,321 INFO L138 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-02-21 03:23:50,321 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:23:50,321 INFO L85 PathProgramCache]: Analyzing trace with hash 949089090, now seen corresponding path program 1 times [2022-02-21 03:23:50,321 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 03:23:50,322 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [785576477] [2022-02-21 03:23:50,322 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:23:50,322 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 03:23:50,325 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:23:50,341 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-02-21 03:23:50,343 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:23:50,351 INFO L290 TraceCheckUtils]: 0: Hoare triple {5827#true} ~i := #in~i; {5827#true} is VALID [2022-02-21 03:23:50,351 INFO L290 TraceCheckUtils]: 1: Hoare triple {5827#true} assume ~i <= 0;#res := 0; {5840#(<= |rec1_#res| 0)} is VALID [2022-02-21 03:23:50,351 INFO L290 TraceCheckUtils]: 2: Hoare triple {5840#(<= |rec1_#res| 0)} assume true; {5840#(<= |rec1_#res| 0)} is VALID [2022-02-21 03:23:50,352 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {5840#(<= |rec1_#res| 0)} {5827#true} #30#return; {5833#(<= |rec1_#t~ret1| 0)} is VALID [2022-02-21 03:23:50,352 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2022-02-21 03:23:50,354 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:23:50,356 INFO L290 TraceCheckUtils]: 0: Hoare triple {5827#true} ~i := #in~i; {5827#true} is VALID [2022-02-21 03:23:50,356 INFO L290 TraceCheckUtils]: 1: Hoare triple {5827#true} assume ~i <= 0;#res := 0; {5827#true} is VALID [2022-02-21 03:23:50,356 INFO L290 TraceCheckUtils]: 2: Hoare triple {5827#true} assume true; {5827#true} is VALID [2022-02-21 03:23:50,356 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {5827#true} {5828#false} #28#return; {5828#false} is VALID [2022-02-21 03:23:50,356 INFO L272 TraceCheckUtils]: 0: Hoare triple {5827#true} call #t~ret1 := rec1(#t~ret0 - 1); {5827#true} is VALID [2022-02-21 03:23:50,356 INFO L290 TraceCheckUtils]: 1: Hoare triple {5827#true} ~i := #in~i; {5827#true} is VALID [2022-02-21 03:23:50,357 INFO L290 TraceCheckUtils]: 2: Hoare triple {5827#true} assume ~i <= 0;#res := 0; {5840#(<= |rec1_#res| 0)} is VALID [2022-02-21 03:23:50,357 INFO L290 TraceCheckUtils]: 3: Hoare triple {5840#(<= |rec1_#res| 0)} assume true; {5840#(<= |rec1_#res| 0)} is VALID [2022-02-21 03:23:50,358 INFO L284 TraceCheckUtils]: 4: Hoare quadruple {5840#(<= |rec1_#res| 0)} {5827#true} #30#return; {5833#(<= |rec1_#t~ret1| 0)} is VALID [2022-02-21 03:23:50,358 INFO L272 TraceCheckUtils]: 5: Hoare triple {5833#(<= |rec1_#t~ret1| 0)} call #t~ret2 := rec1(#t~ret1); {5834#(<= |rec1_#in~i| 0)} is VALID [2022-02-21 03:23:50,358 INFO L290 TraceCheckUtils]: 6: Hoare triple {5834#(<= |rec1_#in~i| 0)} ~i := #in~i; {5835#(<= rec1_~i 0)} is VALID [2022-02-21 03:23:50,359 INFO L290 TraceCheckUtils]: 7: Hoare triple {5835#(<= rec1_~i 0)} assume !(~i <= 0); {5828#false} is VALID [2022-02-21 03:23:50,359 INFO L272 TraceCheckUtils]: 8: Hoare triple {5828#false} call #t~ret0 := rec1(~i - 2); {5827#true} is VALID [2022-02-21 03:23:50,359 INFO L290 TraceCheckUtils]: 9: Hoare triple {5827#true} ~i := #in~i; {5827#true} is VALID [2022-02-21 03:23:50,359 INFO L290 TraceCheckUtils]: 10: Hoare triple {5827#true} assume ~i <= 0;#res := 0; {5827#true} is VALID [2022-02-21 03:23:50,359 INFO L290 TraceCheckUtils]: 11: Hoare triple {5827#true} assume true; {5827#true} is VALID [2022-02-21 03:23:50,359 INFO L284 TraceCheckUtils]: 12: Hoare quadruple {5827#true} {5828#false} #28#return; {5828#false} is VALID [2022-02-21 03:23:50,359 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 2 proven. 4 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-02-21 03:23:50,359 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-21 03:23:50,359 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [785576477] [2022-02-21 03:23:50,359 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [785576477] provided 0 perfect and 1 imperfect interpolant sequences [2022-02-21 03:23:50,359 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [473331664] [2022-02-21 03:23:50,359 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:23:50,360 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-21 03:23:50,360 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:23:50,361 INFO L229 MonitoredProcess]: Starting monitored process 35 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-02-21 03:23:50,385 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (35)] Waiting until timeout for monitored process [2022-02-21 03:23:50,394 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:23:50,394 INFO L263 TraceCheckSpWp]: Trace formula consists of 33 conjuncts, 5 conjunts are in the unsatisfiable core [2022-02-21 03:23:50,399 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:23:50,399 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-21 03:23:50,445 INFO L272 TraceCheckUtils]: 0: Hoare triple {5827#true} call #t~ret1 := rec1(#t~ret0 - 1); {5827#true} is VALID [2022-02-21 03:23:50,446 INFO L290 TraceCheckUtils]: 1: Hoare triple {5827#true} ~i := #in~i; {5827#true} is VALID [2022-02-21 03:23:50,447 INFO L290 TraceCheckUtils]: 2: Hoare triple {5827#true} assume ~i <= 0;#res := 0; {5840#(<= |rec1_#res| 0)} is VALID [2022-02-21 03:23:50,447 INFO L290 TraceCheckUtils]: 3: Hoare triple {5840#(<= |rec1_#res| 0)} assume true; {5840#(<= |rec1_#res| 0)} is VALID [2022-02-21 03:23:50,449 INFO L284 TraceCheckUtils]: 4: Hoare quadruple {5840#(<= |rec1_#res| 0)} {5827#true} #30#return; {5833#(<= |rec1_#t~ret1| 0)} is VALID [2022-02-21 03:23:50,449 INFO L272 TraceCheckUtils]: 5: Hoare triple {5833#(<= |rec1_#t~ret1| 0)} call #t~ret2 := rec1(#t~ret1); {5834#(<= |rec1_#in~i| 0)} is VALID [2022-02-21 03:23:50,460 INFO L290 TraceCheckUtils]: 6: Hoare triple {5834#(<= |rec1_#in~i| 0)} ~i := #in~i; {5835#(<= rec1_~i 0)} is VALID [2022-02-21 03:23:50,461 INFO L290 TraceCheckUtils]: 7: Hoare triple {5835#(<= rec1_~i 0)} assume !(~i <= 0); {5828#false} is VALID [2022-02-21 03:23:50,461 INFO L272 TraceCheckUtils]: 8: Hoare triple {5828#false} call #t~ret0 := rec1(~i - 2); {5828#false} is VALID [2022-02-21 03:23:50,461 INFO L290 TraceCheckUtils]: 9: Hoare triple {5828#false} ~i := #in~i; {5828#false} is VALID [2022-02-21 03:23:50,461 INFO L290 TraceCheckUtils]: 10: Hoare triple {5828#false} assume ~i <= 0;#res := 0; {5828#false} is VALID [2022-02-21 03:23:50,461 INFO L290 TraceCheckUtils]: 11: Hoare triple {5828#false} assume true; {5828#false} is VALID [2022-02-21 03:23:50,461 INFO L284 TraceCheckUtils]: 12: Hoare quadruple {5828#false} {5828#false} #28#return; {5828#false} is VALID [2022-02-21 03:23:50,462 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-21 03:23:50,462 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-02-21 03:23:50,462 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [473331664] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-21 03:23:50,462 INFO L191 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-02-21 03:23:50,462 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [6] total 6 [2022-02-21 03:23:50,462 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1083427503] [2022-02-21 03:23:50,462 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-21 03:23:50,463 INFO L808 eck$LassoCheckResult]: loop already infeasible [2022-02-21 03:23:50,463 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-21 03:23:50,463 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-02-21 03:23:50,463 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-02-21 03:23:50,464 INFO L87 Difference]: Start difference. First operand 105 states and 158 transitions. cyclomatic complexity: 59 Second operand has 6 states, 5 states have (on average 1.6) internal successors, (8), 4 states have internal predecessors, (8), 3 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-02-21 03:23:50,562 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:23:50,562 INFO L93 Difference]: Finished difference Result 120 states and 174 transitions. [2022-02-21 03:23:50,563 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-02-21 03:23:50,563 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 6 states, 5 states have (on average 1.6) internal successors, (8), 4 states have internal predecessors, (8), 3 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-02-21 03:23:50,572 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 13 edges. 13 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-21 03:23:50,573 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 120 states and 174 transitions. [2022-02-21 03:23:50,576 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 9 [2022-02-21 03:23:50,579 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 120 states to 115 states and 165 transitions. [2022-02-21 03:23:50,579 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 51 [2022-02-21 03:23:50,579 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 51 [2022-02-21 03:23:50,580 INFO L73 IsDeterministic]: Start isDeterministic. Operand 115 states and 165 transitions. [2022-02-21 03:23:50,580 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2022-02-21 03:23:50,580 INFO L681 BuchiCegarLoop]: Abstraction has 115 states and 165 transitions. [2022-02-21 03:23:50,580 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 115 states and 165 transitions. [2022-02-21 03:23:50,582 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 115 to 112. [2022-02-21 03:23:50,582 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-21 03:23:50,583 INFO L82 GeneralOperation]: Start isEquivalent. First operand 115 states and 165 transitions. Second operand has 112 states, 64 states have (on average 1.109375) internal successors, (71), 69 states have internal predecessors, (71), 32 states have call successors, (32), 18 states have call predecessors, (32), 16 states have return successors, (59), 24 states have call predecessors, (59), 28 states have call successors, (59) [2022-02-21 03:23:50,583 INFO L74 IsIncluded]: Start isIncluded. First operand 115 states and 165 transitions. Second operand has 112 states, 64 states have (on average 1.109375) internal successors, (71), 69 states have internal predecessors, (71), 32 states have call successors, (32), 18 states have call predecessors, (32), 16 states have return successors, (59), 24 states have call predecessors, (59), 28 states have call successors, (59) [2022-02-21 03:23:50,583 INFO L87 Difference]: Start difference. First operand 115 states and 165 transitions. Second operand has 112 states, 64 states have (on average 1.109375) internal successors, (71), 69 states have internal predecessors, (71), 32 states have call successors, (32), 18 states have call predecessors, (32), 16 states have return successors, (59), 24 states have call predecessors, (59), 28 states have call successors, (59) [2022-02-21 03:23:50,583 INFO L149 Difference]: Subtrahend was not deterministic. Recomputing result with determinization. [2022-02-21 03:23:50,595 INFO L93 Difference]: Finished difference Result 385 states and 580 transitions. [2022-02-21 03:23:50,596 INFO L276 IsEmpty]: Start isEmpty. Operand 385 states and 580 transitions. [2022-02-21 03:23:50,597 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 03:23:50,598 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 03:23:50,598 INFO L74 IsIncluded]: Start isIncluded. First operand has 112 states, 64 states have (on average 1.109375) internal successors, (71), 69 states have internal predecessors, (71), 32 states have call successors, (32), 18 states have call predecessors, (32), 16 states have return successors, (59), 24 states have call predecessors, (59), 28 states have call successors, (59) Second operand 115 states and 165 transitions. [2022-02-21 03:23:50,598 INFO L87 Difference]: Start difference. First operand has 112 states, 64 states have (on average 1.109375) internal successors, (71), 69 states have internal predecessors, (71), 32 states have call successors, (32), 18 states have call predecessors, (32), 16 states have return successors, (59), 24 states have call predecessors, (59), 28 states have call successors, (59) Second operand 115 states and 165 transitions. [2022-02-21 03:23:50,598 INFO L149 Difference]: Subtrahend was not deterministic. Recomputing result with determinization. [2022-02-21 03:23:50,610 INFO L93 Difference]: Finished difference Result 385 states and 580 transitions. [2022-02-21 03:23:50,611 INFO L276 IsEmpty]: Start isEmpty. Operand 385 states and 580 transitions. [2022-02-21 03:23:50,612 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 03:23:50,612 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 03:23:50,613 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-21 03:23:50,613 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-21 03:23:50,613 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 112 states, 64 states have (on average 1.109375) internal successors, (71), 69 states have internal predecessors, (71), 32 states have call successors, (32), 18 states have call predecessors, (32), 16 states have return successors, (59), 24 states have call predecessors, (59), 28 states have call successors, (59) [2022-02-21 03:23:50,615 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 112 states to 112 states and 162 transitions. [2022-02-21 03:23:50,615 INFO L704 BuchiCegarLoop]: Abstraction has 112 states and 162 transitions. [2022-02-21 03:23:50,615 INFO L587 BuchiCegarLoop]: Abstraction has 112 states and 162 transitions. [2022-02-21 03:23:50,615 INFO L425 BuchiCegarLoop]: ======== Iteration 6============ [2022-02-21 03:23:50,616 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 112 states and 162 transitions. [2022-02-21 03:23:50,616 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 9 [2022-02-21 03:23:50,616 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 03:23:50,616 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 03:23:50,617 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [5, 4, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-21 03:23:50,617 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2022-02-21 03:23:50,617 INFO L791 eck$LassoCheckResult]: Stem: 6009#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true; 6010#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet5#1, main_#t~ret6#1, main_~x~0#1;main_~x~0#1 := main_#t~nondet5#1;havoc main_#t~nondet5#1; 6005#L25 call main_#t~ret6#1 := rec2(main_~x~0#1);< 6026#rec2ENTRY ~j := #in~j; 6088#L18 assume !(~j <= 0); 6012#L20 call #t~ret3 := rec1(~j);< 6074#rec1ENTRY ~i := #in~i; 6072#L12 assume !(~i <= 0); 6028#L14 call #t~ret0 := rec1(~i - 2);< 6070#rec1ENTRY ~i := #in~i; 6068#L12 assume !(~i <= 0); 6036#L14 call #t~ret0 := rec1(~i - 2);< 6067#rec1ENTRY ~i := #in~i; 6069#L12 assume ~i <= 0;#res := 0; 6084#rec1FINAL assume true; 6081#rec1EXIT >#28#return; 6042#L14-1 call #t~ret1 := rec1(#t~ret0 - 1);< 6043#rec1ENTRY ~i := #in~i; 6056#L12 assume ~i <= 0;#res := 0; 6046#rec1FINAL assume true; 6047#rec1EXIT >#30#return; 6027#L14-2 call #t~ret2 := rec1(#t~ret1);< 6037#rec1ENTRY ~i := #in~i; 6087#L12 assume ~i <= 0;#res := 0; 6085#rec1FINAL assume true; 6050#rec1EXIT >#32#return; 6051#L14-3 #res := 1 + #t~ret2;havoc #t~ret0;havoc #t~ret1;havoc #t~ret2; 6083#rec1FINAL assume true; 6080#rec1EXIT >#28#return; 6029#L14-1 call #t~ret1 := rec1(#t~ret0 - 1);< 6058#rec1ENTRY [2022-02-21 03:23:50,617 INFO L793 eck$LassoCheckResult]: Loop: 6058#rec1ENTRY ~i := #in~i; 6075#L12 assume !(~i <= 0); 6034#L14 call #t~ret0 := rec1(~i - 2);< 6058#rec1ENTRY [2022-02-21 03:23:50,618 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:23:50,618 INFO L85 PathProgramCache]: Analyzing trace with hash 1060897207, now seen corresponding path program 1 times [2022-02-21 03:23:50,618 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 03:23:50,618 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1163434965] [2022-02-21 03:23:50,618 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:23:50,618 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 03:23:50,628 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:23:50,628 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-02-21 03:23:50,632 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:23:50,634 INFO L138 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-02-21 03:23:50,634 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:23:50,634 INFO L85 PathProgramCache]: Analyzing trace with hash 29942, now seen corresponding path program 3 times [2022-02-21 03:23:50,634 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 03:23:50,634 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1708873294] [2022-02-21 03:23:50,634 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:23:50,635 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 03:23:50,637 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:23:50,637 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-02-21 03:23:50,638 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:23:50,638 INFO L138 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-02-21 03:23:50,638 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:23:50,639 INFO L85 PathProgramCache]: Analyzing trace with hash -1475637376, now seen corresponding path program 2 times [2022-02-21 03:23:50,639 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 03:23:50,639 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1105756308] [2022-02-21 03:23:50,639 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:23:50,639 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 03:23:50,645 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:23:50,663 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2022-02-21 03:23:50,667 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:23:50,681 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-02-21 03:23:50,682 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:23:50,684 INFO L290 TraceCheckUtils]: 0: Hoare triple {7305#true} ~i := #in~i; {7305#true} is VALID [2022-02-21 03:23:50,684 INFO L290 TraceCheckUtils]: 1: Hoare triple {7305#true} assume ~i <= 0;#res := 0; {7305#true} is VALID [2022-02-21 03:23:50,684 INFO L290 TraceCheckUtils]: 2: Hoare triple {7305#true} assume true; {7305#true} is VALID [2022-02-21 03:23:50,685 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {7305#true} {7305#true} #28#return; {7305#true} is VALID [2022-02-21 03:23:50,685 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-02-21 03:23:50,685 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:23:50,687 INFO L290 TraceCheckUtils]: 0: Hoare triple {7305#true} ~i := #in~i; {7305#true} is VALID [2022-02-21 03:23:50,687 INFO L290 TraceCheckUtils]: 1: Hoare triple {7305#true} assume ~i <= 0;#res := 0; {7305#true} is VALID [2022-02-21 03:23:50,688 INFO L290 TraceCheckUtils]: 2: Hoare triple {7305#true} assume true; {7305#true} is VALID [2022-02-21 03:23:50,688 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {7305#true} {7305#true} #30#return; {7305#true} is VALID [2022-02-21 03:23:50,688 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-02-21 03:23:50,689 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:23:50,697 INFO L290 TraceCheckUtils]: 0: Hoare triple {7305#true} ~i := #in~i; {7305#true} is VALID [2022-02-21 03:23:50,697 INFO L290 TraceCheckUtils]: 1: Hoare triple {7305#true} assume ~i <= 0;#res := 0; {7344#(<= |rec1_#res| 0)} is VALID [2022-02-21 03:23:50,698 INFO L290 TraceCheckUtils]: 2: Hoare triple {7344#(<= |rec1_#res| 0)} assume true; {7344#(<= |rec1_#res| 0)} is VALID [2022-02-21 03:23:50,698 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {7344#(<= |rec1_#res| 0)} {7305#true} #32#return; {7342#(<= |rec1_#t~ret2| 0)} is VALID [2022-02-21 03:23:50,698 INFO L290 TraceCheckUtils]: 0: Hoare triple {7305#true} ~i := #in~i; {7305#true} is VALID [2022-02-21 03:23:50,699 INFO L290 TraceCheckUtils]: 1: Hoare triple {7305#true} assume !(~i <= 0); {7305#true} is VALID [2022-02-21 03:23:50,699 INFO L272 TraceCheckUtils]: 2: Hoare triple {7305#true} call #t~ret0 := rec1(~i - 2); {7305#true} is VALID [2022-02-21 03:23:50,699 INFO L290 TraceCheckUtils]: 3: Hoare triple {7305#true} ~i := #in~i; {7305#true} is VALID [2022-02-21 03:23:50,699 INFO L290 TraceCheckUtils]: 4: Hoare triple {7305#true} assume ~i <= 0;#res := 0; {7305#true} is VALID [2022-02-21 03:23:50,699 INFO L290 TraceCheckUtils]: 5: Hoare triple {7305#true} assume true; {7305#true} is VALID [2022-02-21 03:23:50,699 INFO L284 TraceCheckUtils]: 6: Hoare quadruple {7305#true} {7305#true} #28#return; {7305#true} is VALID [2022-02-21 03:23:50,699 INFO L272 TraceCheckUtils]: 7: Hoare triple {7305#true} call #t~ret1 := rec1(#t~ret0 - 1); {7305#true} is VALID [2022-02-21 03:23:50,699 INFO L290 TraceCheckUtils]: 8: Hoare triple {7305#true} ~i := #in~i; {7305#true} is VALID [2022-02-21 03:23:50,700 INFO L290 TraceCheckUtils]: 9: Hoare triple {7305#true} assume ~i <= 0;#res := 0; {7305#true} is VALID [2022-02-21 03:23:50,700 INFO L290 TraceCheckUtils]: 10: Hoare triple {7305#true} assume true; {7305#true} is VALID [2022-02-21 03:23:50,700 INFO L284 TraceCheckUtils]: 11: Hoare quadruple {7305#true} {7305#true} #30#return; {7305#true} is VALID [2022-02-21 03:23:50,700 INFO L272 TraceCheckUtils]: 12: Hoare triple {7305#true} call #t~ret2 := rec1(#t~ret1); {7305#true} is VALID [2022-02-21 03:23:50,700 INFO L290 TraceCheckUtils]: 13: Hoare triple {7305#true} ~i := #in~i; {7305#true} is VALID [2022-02-21 03:23:50,700 INFO L290 TraceCheckUtils]: 14: Hoare triple {7305#true} assume ~i <= 0;#res := 0; {7344#(<= |rec1_#res| 0)} is VALID [2022-02-21 03:23:50,701 INFO L290 TraceCheckUtils]: 15: Hoare triple {7344#(<= |rec1_#res| 0)} assume true; {7344#(<= |rec1_#res| 0)} is VALID [2022-02-21 03:23:50,701 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {7344#(<= |rec1_#res| 0)} {7305#true} #32#return; {7342#(<= |rec1_#t~ret2| 0)} is VALID [2022-02-21 03:23:50,702 INFO L290 TraceCheckUtils]: 17: Hoare triple {7342#(<= |rec1_#t~ret2| 0)} #res := 1 + #t~ret2;havoc #t~ret0;havoc #t~ret1;havoc #t~ret2; {7343#(<= |rec1_#res| 1)} is VALID [2022-02-21 03:23:50,702 INFO L290 TraceCheckUtils]: 18: Hoare triple {7343#(<= |rec1_#res| 1)} assume true; {7343#(<= |rec1_#res| 1)} is VALID [2022-02-21 03:23:50,703 INFO L284 TraceCheckUtils]: 19: Hoare quadruple {7343#(<= |rec1_#res| 1)} {7305#true} #28#return; {7327#(<= |rec1_#t~ret0| 1)} is VALID [2022-02-21 03:23:50,703 INFO L290 TraceCheckUtils]: 0: Hoare triple {7305#true} assume { :begin_inline_ULTIMATE.init } true; {7305#true} is VALID [2022-02-21 03:23:50,703 INFO L290 TraceCheckUtils]: 1: Hoare triple {7305#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet5#1, main_#t~ret6#1, main_~x~0#1;main_~x~0#1 := main_#t~nondet5#1;havoc main_#t~nondet5#1; {7305#true} is VALID [2022-02-21 03:23:50,703 INFO L272 TraceCheckUtils]: 2: Hoare triple {7305#true} call main_#t~ret6#1 := rec2(main_~x~0#1); {7305#true} is VALID [2022-02-21 03:23:50,703 INFO L290 TraceCheckUtils]: 3: Hoare triple {7305#true} ~j := #in~j; {7305#true} is VALID [2022-02-21 03:23:50,703 INFO L290 TraceCheckUtils]: 4: Hoare triple {7305#true} assume !(~j <= 0); {7305#true} is VALID [2022-02-21 03:23:50,703 INFO L272 TraceCheckUtils]: 5: Hoare triple {7305#true} call #t~ret3 := rec1(~j); {7305#true} is VALID [2022-02-21 03:23:50,704 INFO L290 TraceCheckUtils]: 6: Hoare triple {7305#true} ~i := #in~i; {7305#true} is VALID [2022-02-21 03:23:50,704 INFO L290 TraceCheckUtils]: 7: Hoare triple {7305#true} assume !(~i <= 0); {7305#true} is VALID [2022-02-21 03:23:50,704 INFO L272 TraceCheckUtils]: 8: Hoare triple {7305#true} call #t~ret0 := rec1(~i - 2); {7305#true} is VALID [2022-02-21 03:23:50,704 INFO L290 TraceCheckUtils]: 9: Hoare triple {7305#true} ~i := #in~i; {7305#true} is VALID [2022-02-21 03:23:50,704 INFO L290 TraceCheckUtils]: 10: Hoare triple {7305#true} assume !(~i <= 0); {7305#true} is VALID [2022-02-21 03:23:50,704 INFO L272 TraceCheckUtils]: 11: Hoare triple {7305#true} call #t~ret0 := rec1(~i - 2); {7305#true} is VALID [2022-02-21 03:23:50,704 INFO L290 TraceCheckUtils]: 12: Hoare triple {7305#true} ~i := #in~i; {7305#true} is VALID [2022-02-21 03:23:50,704 INFO L290 TraceCheckUtils]: 13: Hoare triple {7305#true} assume ~i <= 0;#res := 0; {7305#true} is VALID [2022-02-21 03:23:50,705 INFO L290 TraceCheckUtils]: 14: Hoare triple {7305#true} assume true; {7305#true} is VALID [2022-02-21 03:23:50,705 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {7305#true} {7305#true} #28#return; {7305#true} is VALID [2022-02-21 03:23:50,705 INFO L272 TraceCheckUtils]: 16: Hoare triple {7305#true} call #t~ret1 := rec1(#t~ret0 - 1); {7305#true} is VALID [2022-02-21 03:23:50,705 INFO L290 TraceCheckUtils]: 17: Hoare triple {7305#true} ~i := #in~i; {7305#true} is VALID [2022-02-21 03:23:50,705 INFO L290 TraceCheckUtils]: 18: Hoare triple {7305#true} assume ~i <= 0;#res := 0; {7305#true} is VALID [2022-02-21 03:23:50,705 INFO L290 TraceCheckUtils]: 19: Hoare triple {7305#true} assume true; {7305#true} is VALID [2022-02-21 03:23:50,705 INFO L284 TraceCheckUtils]: 20: Hoare quadruple {7305#true} {7305#true} #30#return; {7305#true} is VALID [2022-02-21 03:23:50,705 INFO L272 TraceCheckUtils]: 21: Hoare triple {7305#true} call #t~ret2 := rec1(#t~ret1); {7305#true} is VALID [2022-02-21 03:23:50,705 INFO L290 TraceCheckUtils]: 22: Hoare triple {7305#true} ~i := #in~i; {7305#true} is VALID [2022-02-21 03:23:50,706 INFO L290 TraceCheckUtils]: 23: Hoare triple {7305#true} assume ~i <= 0;#res := 0; {7344#(<= |rec1_#res| 0)} is VALID [2022-02-21 03:23:50,706 INFO L290 TraceCheckUtils]: 24: Hoare triple {7344#(<= |rec1_#res| 0)} assume true; {7344#(<= |rec1_#res| 0)} is VALID [2022-02-21 03:23:50,707 INFO L284 TraceCheckUtils]: 25: Hoare quadruple {7344#(<= |rec1_#res| 0)} {7305#true} #32#return; {7342#(<= |rec1_#t~ret2| 0)} is VALID [2022-02-21 03:23:50,707 INFO L290 TraceCheckUtils]: 26: Hoare triple {7342#(<= |rec1_#t~ret2| 0)} #res := 1 + #t~ret2;havoc #t~ret0;havoc #t~ret1;havoc #t~ret2; {7343#(<= |rec1_#res| 1)} is VALID [2022-02-21 03:23:50,707 INFO L290 TraceCheckUtils]: 27: Hoare triple {7343#(<= |rec1_#res| 1)} assume true; {7343#(<= |rec1_#res| 1)} is VALID [2022-02-21 03:23:50,708 INFO L284 TraceCheckUtils]: 28: Hoare quadruple {7343#(<= |rec1_#res| 1)} {7305#true} #28#return; {7327#(<= |rec1_#t~ret0| 1)} is VALID [2022-02-21 03:23:50,708 INFO L272 TraceCheckUtils]: 29: Hoare triple {7327#(<= |rec1_#t~ret0| 1)} call #t~ret1 := rec1(#t~ret0 - 1); {7328#(<= |rec1_#in~i| 0)} is VALID [2022-02-21 03:23:50,709 INFO L290 TraceCheckUtils]: 30: Hoare triple {7328#(<= |rec1_#in~i| 0)} ~i := #in~i; {7329#(<= rec1_~i 0)} is VALID [2022-02-21 03:23:50,709 INFO L290 TraceCheckUtils]: 31: Hoare triple {7329#(<= rec1_~i 0)} assume !(~i <= 0); {7306#false} is VALID [2022-02-21 03:23:50,709 INFO L272 TraceCheckUtils]: 32: Hoare triple {7306#false} call #t~ret0 := rec1(~i - 2); {7306#false} is VALID [2022-02-21 03:23:50,709 INFO L134 CoverageAnalysis]: Checked inductivity of 46 backedges. 21 proven. 2 refuted. 0 times theorem prover too weak. 23 trivial. 0 not checked. [2022-02-21 03:23:50,710 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-21 03:23:50,710 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1105756308] [2022-02-21 03:23:50,710 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1105756308] provided 0 perfect and 1 imperfect interpolant sequences [2022-02-21 03:23:50,710 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [455380129] [2022-02-21 03:23:50,710 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-02-21 03:23:50,710 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-21 03:23:50,710 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:23:50,711 INFO L229 MonitoredProcess]: Starting monitored process 36 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-02-21 03:23:50,726 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (36)] Waiting until timeout for monitored process [2022-02-21 03:23:50,749 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-02-21 03:23:50,750 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-02-21 03:23:50,750 INFO L263 TraceCheckSpWp]: Trace formula consists of 77 conjuncts, 7 conjunts are in the unsatisfiable core [2022-02-21 03:23:50,757 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:23:50,757 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-21 03:23:50,874 INFO L290 TraceCheckUtils]: 0: Hoare triple {7305#true} assume { :begin_inline_ULTIMATE.init } true; {7305#true} is VALID [2022-02-21 03:23:50,875 INFO L290 TraceCheckUtils]: 1: Hoare triple {7305#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet5#1, main_#t~ret6#1, main_~x~0#1;main_~x~0#1 := main_#t~nondet5#1;havoc main_#t~nondet5#1; {7305#true} is VALID [2022-02-21 03:23:50,875 INFO L272 TraceCheckUtils]: 2: Hoare triple {7305#true} call main_#t~ret6#1 := rec2(main_~x~0#1); {7305#true} is VALID [2022-02-21 03:23:50,875 INFO L290 TraceCheckUtils]: 3: Hoare triple {7305#true} ~j := #in~j; {7305#true} is VALID [2022-02-21 03:23:50,875 INFO L290 TraceCheckUtils]: 4: Hoare triple {7305#true} assume !(~j <= 0); {7305#true} is VALID [2022-02-21 03:23:50,875 INFO L272 TraceCheckUtils]: 5: Hoare triple {7305#true} call #t~ret3 := rec1(~j); {7305#true} is VALID [2022-02-21 03:23:50,876 INFO L290 TraceCheckUtils]: 6: Hoare triple {7305#true} ~i := #in~i; {7305#true} is VALID [2022-02-21 03:23:50,876 INFO L290 TraceCheckUtils]: 7: Hoare triple {7305#true} assume !(~i <= 0); {7305#true} is VALID [2022-02-21 03:23:50,876 INFO L272 TraceCheckUtils]: 8: Hoare triple {7305#true} call #t~ret0 := rec1(~i - 2); {7305#true} is VALID [2022-02-21 03:23:50,876 INFO L290 TraceCheckUtils]: 9: Hoare triple {7305#true} ~i := #in~i; {7305#true} is VALID [2022-02-21 03:23:50,876 INFO L290 TraceCheckUtils]: 10: Hoare triple {7305#true} assume !(~i <= 0); {7305#true} is VALID [2022-02-21 03:23:50,876 INFO L272 TraceCheckUtils]: 11: Hoare triple {7305#true} call #t~ret0 := rec1(~i - 2); {7305#true} is VALID [2022-02-21 03:23:50,876 INFO L290 TraceCheckUtils]: 12: Hoare triple {7305#true} ~i := #in~i; {7305#true} is VALID [2022-02-21 03:23:50,876 INFO L290 TraceCheckUtils]: 13: Hoare triple {7305#true} assume ~i <= 0;#res := 0; {7305#true} is VALID [2022-02-21 03:23:50,877 INFO L290 TraceCheckUtils]: 14: Hoare triple {7305#true} assume true; {7305#true} is VALID [2022-02-21 03:23:50,877 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {7305#true} {7305#true} #28#return; {7305#true} is VALID [2022-02-21 03:23:50,877 INFO L272 TraceCheckUtils]: 16: Hoare triple {7305#true} call #t~ret1 := rec1(#t~ret0 - 1); {7305#true} is VALID [2022-02-21 03:23:50,877 INFO L290 TraceCheckUtils]: 17: Hoare triple {7305#true} ~i := #in~i; {7305#true} is VALID [2022-02-21 03:23:50,877 INFO L290 TraceCheckUtils]: 18: Hoare triple {7305#true} assume ~i <= 0;#res := 0; {7305#true} is VALID [2022-02-21 03:23:50,877 INFO L290 TraceCheckUtils]: 19: Hoare triple {7305#true} assume true; {7305#true} is VALID [2022-02-21 03:23:50,877 INFO L284 TraceCheckUtils]: 20: Hoare quadruple {7305#true} {7305#true} #30#return; {7305#true} is VALID [2022-02-21 03:23:50,878 INFO L272 TraceCheckUtils]: 21: Hoare triple {7305#true} call #t~ret2 := rec1(#t~ret1); {7305#true} is VALID [2022-02-21 03:23:50,878 INFO L290 TraceCheckUtils]: 22: Hoare triple {7305#true} ~i := #in~i; {7305#true} is VALID [2022-02-21 03:23:50,880 INFO L290 TraceCheckUtils]: 23: Hoare triple {7305#true} assume ~i <= 0;#res := 0; {7344#(<= |rec1_#res| 0)} is VALID [2022-02-21 03:23:50,880 INFO L290 TraceCheckUtils]: 24: Hoare triple {7344#(<= |rec1_#res| 0)} assume true; {7344#(<= |rec1_#res| 0)} is VALID [2022-02-21 03:23:50,881 INFO L284 TraceCheckUtils]: 25: Hoare quadruple {7344#(<= |rec1_#res| 0)} {7305#true} #32#return; {7342#(<= |rec1_#t~ret2| 0)} is VALID [2022-02-21 03:23:50,881 INFO L290 TraceCheckUtils]: 26: Hoare triple {7342#(<= |rec1_#t~ret2| 0)} #res := 1 + #t~ret2;havoc #t~ret0;havoc #t~ret1;havoc #t~ret2; {7343#(<= |rec1_#res| 1)} is VALID [2022-02-21 03:23:50,882 INFO L290 TraceCheckUtils]: 27: Hoare triple {7343#(<= |rec1_#res| 1)} assume true; {7343#(<= |rec1_#res| 1)} is VALID [2022-02-21 03:23:50,882 INFO L284 TraceCheckUtils]: 28: Hoare quadruple {7343#(<= |rec1_#res| 1)} {7305#true} #28#return; {7327#(<= |rec1_#t~ret0| 1)} is VALID [2022-02-21 03:23:50,883 INFO L272 TraceCheckUtils]: 29: Hoare triple {7327#(<= |rec1_#t~ret0| 1)} call #t~ret1 := rec1(#t~ret0 - 1); {7328#(<= |rec1_#in~i| 0)} is VALID [2022-02-21 03:23:50,883 INFO L290 TraceCheckUtils]: 30: Hoare triple {7328#(<= |rec1_#in~i| 0)} ~i := #in~i; {7329#(<= rec1_~i 0)} is VALID [2022-02-21 03:23:50,883 INFO L290 TraceCheckUtils]: 31: Hoare triple {7329#(<= rec1_~i 0)} assume !(~i <= 0); {7306#false} is VALID [2022-02-21 03:23:50,884 INFO L272 TraceCheckUtils]: 32: Hoare triple {7306#false} call #t~ret0 := rec1(~i - 2); {7306#false} is VALID [2022-02-21 03:23:50,884 INFO L134 CoverageAnalysis]: Checked inductivity of 46 backedges. 21 proven. 2 refuted. 0 times theorem prover too weak. 23 trivial. 0 not checked. [2022-02-21 03:23:50,884 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-02-21 03:23:51,162 INFO L272 TraceCheckUtils]: 32: Hoare triple {7306#false} call #t~ret0 := rec1(~i - 2); {7306#false} is VALID [2022-02-21 03:23:51,163 INFO L290 TraceCheckUtils]: 31: Hoare triple {7329#(<= rec1_~i 0)} assume !(~i <= 0); {7306#false} is VALID [2022-02-21 03:23:51,163 INFO L290 TraceCheckUtils]: 30: Hoare triple {7328#(<= |rec1_#in~i| 0)} ~i := #in~i; {7329#(<= rec1_~i 0)} is VALID [2022-02-21 03:23:51,164 INFO L272 TraceCheckUtils]: 29: Hoare triple {7327#(<= |rec1_#t~ret0| 1)} call #t~ret1 := rec1(#t~ret0 - 1); {7328#(<= |rec1_#in~i| 0)} is VALID [2022-02-21 03:23:51,164 INFO L284 TraceCheckUtils]: 28: Hoare quadruple {7343#(<= |rec1_#res| 1)} {7305#true} #28#return; {7327#(<= |rec1_#t~ret0| 1)} is VALID [2022-02-21 03:23:51,165 INFO L290 TraceCheckUtils]: 27: Hoare triple {7343#(<= |rec1_#res| 1)} assume true; {7343#(<= |rec1_#res| 1)} is VALID [2022-02-21 03:23:51,165 INFO L290 TraceCheckUtils]: 26: Hoare triple {7342#(<= |rec1_#t~ret2| 0)} #res := 1 + #t~ret2;havoc #t~ret0;havoc #t~ret1;havoc #t~ret2; {7343#(<= |rec1_#res| 1)} is VALID [2022-02-21 03:23:51,166 INFO L284 TraceCheckUtils]: 25: Hoare quadruple {7344#(<= |rec1_#res| 0)} {7305#true} #32#return; {7342#(<= |rec1_#t~ret2| 0)} is VALID [2022-02-21 03:23:51,166 INFO L290 TraceCheckUtils]: 24: Hoare triple {7344#(<= |rec1_#res| 0)} assume true; {7344#(<= |rec1_#res| 0)} is VALID [2022-02-21 03:23:51,167 INFO L290 TraceCheckUtils]: 23: Hoare triple {7305#true} assume ~i <= 0;#res := 0; {7344#(<= |rec1_#res| 0)} is VALID [2022-02-21 03:23:51,167 INFO L290 TraceCheckUtils]: 22: Hoare triple {7305#true} ~i := #in~i; {7305#true} is VALID [2022-02-21 03:23:51,167 INFO L272 TraceCheckUtils]: 21: Hoare triple {7305#true} call #t~ret2 := rec1(#t~ret1); {7305#true} is VALID [2022-02-21 03:23:51,167 INFO L284 TraceCheckUtils]: 20: Hoare quadruple {7305#true} {7305#true} #30#return; {7305#true} is VALID [2022-02-21 03:23:51,167 INFO L290 TraceCheckUtils]: 19: Hoare triple {7305#true} assume true; {7305#true} is VALID [2022-02-21 03:23:51,167 INFO L290 TraceCheckUtils]: 18: Hoare triple {7305#true} assume ~i <= 0;#res := 0; {7305#true} is VALID [2022-02-21 03:23:51,167 INFO L290 TraceCheckUtils]: 17: Hoare triple {7305#true} ~i := #in~i; {7305#true} is VALID [2022-02-21 03:23:51,167 INFO L272 TraceCheckUtils]: 16: Hoare triple {7305#true} call #t~ret1 := rec1(#t~ret0 - 1); {7305#true} is VALID [2022-02-21 03:23:51,168 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {7305#true} {7305#true} #28#return; {7305#true} is VALID [2022-02-21 03:23:51,168 INFO L290 TraceCheckUtils]: 14: Hoare triple {7305#true} assume true; {7305#true} is VALID [2022-02-21 03:23:51,168 INFO L290 TraceCheckUtils]: 13: Hoare triple {7305#true} assume ~i <= 0;#res := 0; {7305#true} is VALID [2022-02-21 03:23:51,168 INFO L290 TraceCheckUtils]: 12: Hoare triple {7305#true} ~i := #in~i; {7305#true} is VALID [2022-02-21 03:23:51,168 INFO L272 TraceCheckUtils]: 11: Hoare triple {7305#true} call #t~ret0 := rec1(~i - 2); {7305#true} is VALID [2022-02-21 03:23:51,168 INFO L290 TraceCheckUtils]: 10: Hoare triple {7305#true} assume !(~i <= 0); {7305#true} is VALID [2022-02-21 03:23:51,168 INFO L290 TraceCheckUtils]: 9: Hoare triple {7305#true} ~i := #in~i; {7305#true} is VALID [2022-02-21 03:23:51,168 INFO L272 TraceCheckUtils]: 8: Hoare triple {7305#true} call #t~ret0 := rec1(~i - 2); {7305#true} is VALID [2022-02-21 03:23:51,168 INFO L290 TraceCheckUtils]: 7: Hoare triple {7305#true} assume !(~i <= 0); {7305#true} is VALID [2022-02-21 03:23:51,169 INFO L290 TraceCheckUtils]: 6: Hoare triple {7305#true} ~i := #in~i; {7305#true} is VALID [2022-02-21 03:23:51,169 INFO L272 TraceCheckUtils]: 5: Hoare triple {7305#true} call #t~ret3 := rec1(~j); {7305#true} is VALID [2022-02-21 03:23:51,169 INFO L290 TraceCheckUtils]: 4: Hoare triple {7305#true} assume !(~j <= 0); {7305#true} is VALID [2022-02-21 03:23:51,169 INFO L290 TraceCheckUtils]: 3: Hoare triple {7305#true} ~j := #in~j; {7305#true} is VALID [2022-02-21 03:23:51,169 INFO L272 TraceCheckUtils]: 2: Hoare triple {7305#true} call main_#t~ret6#1 := rec2(main_~x~0#1); {7305#true} is VALID [2022-02-21 03:23:51,169 INFO L290 TraceCheckUtils]: 1: Hoare triple {7305#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet5#1, main_#t~ret6#1, main_~x~0#1;main_~x~0#1 := main_#t~nondet5#1;havoc main_#t~nondet5#1; {7305#true} is VALID [2022-02-21 03:23:51,169 INFO L290 TraceCheckUtils]: 0: Hoare triple {7305#true} assume { :begin_inline_ULTIMATE.init } true; {7305#true} is VALID [2022-02-21 03:23:51,170 INFO L134 CoverageAnalysis]: Checked inductivity of 46 backedges. 21 proven. 2 refuted. 0 times theorem prover too weak. 23 trivial. 0 not checked. [2022-02-21 03:23:51,170 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [455380129] provided 0 perfect and 2 imperfect interpolant sequences [2022-02-21 03:23:51,170 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-02-21 03:23:51,170 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 8 [2022-02-21 03:23:51,170 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1745729066] [2022-02-21 03:23:51,170 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-02-21 03:23:51,209 INFO L210 LassoAnalysis]: Preferences: [2022-02-21 03:23:51,209 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2022-02-21 03:23:51,209 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2022-02-21 03:23:51,210 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2022-02-21 03:23:51,210 INFO L129 ssoRankerPreferences]: Use exernal solver: true [2022-02-21 03:23:51,210 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:23:51,210 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2022-02-21 03:23:51,210 INFO L132 ssoRankerPreferences]: Path of dumped script: [2022-02-21 03:23:51,210 INFO L133 ssoRankerPreferences]: Filename of dumped script: NestedRecursion_1d.c_Iteration6_Loop [2022-02-21 03:23:51,210 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2022-02-21 03:23:51,210 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2022-02-21 03:23:51,211 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 03:23:51,213 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 03:23:51,215 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 03:23:51,216 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 03:23:51,218 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 03:23:51,219 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 03:23:51,256 INFO L294 LassoAnalysis]: Preprocessing complete. [2022-02-21 03:23:51,256 INFO L404 LassoAnalysis]: Checking for nontermination... [2022-02-21 03:23:51,256 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:23:51,256 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:23:51,258 INFO L229 MonitoredProcess]: Starting monitored process 37 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-02-21 03:23:51,281 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (37)] Waiting until timeout for monitored process [2022-02-21 03:23:51,282 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2022-02-21 03:23:51,282 INFO L160 nArgumentSynthesizer]: Using integer mode. [2022-02-21 03:23:51,295 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2022-02-21 03:23:51,296 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {rec1_#t~ret1=0} Honda state: {rec1_#t~ret1=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2022-02-21 03:23:51,323 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (37)] Ended with exit code 0 [2022-02-21 03:23:51,324 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:23:51,324 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:23:51,325 INFO L229 MonitoredProcess]: Starting monitored process 38 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-02-21 03:23:51,327 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (38)] Waiting until timeout for monitored process [2022-02-21 03:23:51,328 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2022-02-21 03:23:51,328 INFO L160 nArgumentSynthesizer]: Using integer mode. [2022-02-21 03:23:51,337 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2022-02-21 03:23:51,338 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {rec1_#t~ret2=0} Honda state: {rec1_#t~ret2=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2022-02-21 03:23:51,355 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (38)] Forceful destruction successful, exit code 0 [2022-02-21 03:23:51,356 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:23:51,356 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:23:51,357 INFO L229 MonitoredProcess]: Starting monitored process 39 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-02-21 03:23:51,358 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (39)] Waiting until timeout for monitored process [2022-02-21 03:23:51,359 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2022-02-21 03:23:51,359 INFO L160 nArgumentSynthesizer]: Using integer mode. [2022-02-21 03:23:51,365 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2022-02-21 03:23:51,365 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {rec1_~i=0} Honda state: {rec1_~i=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2022-02-21 03:23:51,381 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (39)] Forceful destruction successful, exit code 0 [2022-02-21 03:23:51,381 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:23:51,381 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:23:51,382 INFO L229 MonitoredProcess]: Starting monitored process 40 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-02-21 03:23:51,384 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (40)] Waiting until timeout for monitored process [2022-02-21 03:23:51,385 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2022-02-21 03:23:51,385 INFO L160 nArgumentSynthesizer]: Using integer mode. [2022-02-21 03:23:51,392 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2022-02-21 03:23:51,392 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {rec1_#t~ret0=0} Honda state: {rec1_#t~ret0=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2022-02-21 03:23:51,408 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (40)] Ended with exit code 0 [2022-02-21 03:23:51,408 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:23:51,408 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:23:51,409 INFO L229 MonitoredProcess]: Starting monitored process 41 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-02-21 03:23:51,410 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (41)] Waiting until timeout for monitored process [2022-02-21 03:23:51,412 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2022-02-21 03:23:51,412 INFO L160 nArgumentSynthesizer]: Using integer mode. [2022-02-21 03:23:51,432 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2022-02-21 03:23:51,433 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {rec1_#res=0} Honda state: {rec1_#res=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2022-02-21 03:23:51,448 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (41)] Forceful destruction successful, exit code 0 [2022-02-21 03:23:51,448 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:23:51,448 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:23:51,449 INFO L229 MonitoredProcess]: Starting monitored process 42 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-02-21 03:23:51,450 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (42)] Waiting until timeout for monitored process [2022-02-21 03:23:51,452 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2022-02-21 03:23:51,453 INFO L160 nArgumentSynthesizer]: Using integer mode. [2022-02-21 03:23:51,484 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (42)] Forceful destruction successful, exit code 0 [2022-02-21 03:23:51,484 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:23:51,484 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:23:51,485 INFO L229 MonitoredProcess]: Starting monitored process 43 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-02-21 03:23:51,486 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (43)] Waiting until timeout for monitored process [2022-02-21 03:23:51,488 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2022-02-21 03:23:51,488 INFO L160 nArgumentSynthesizer]: Using integer mode. [2022-02-21 03:23:51,515 INFO L444 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2022-02-21 03:23:51,518 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (43)] Ended with exit code 0 [2022-02-21 03:23:51,518 INFO L210 LassoAnalysis]: Preferences: [2022-02-21 03:23:51,519 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2022-02-21 03:23:51,519 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2022-02-21 03:23:51,519 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2022-02-21 03:23:51,519 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2022-02-21 03:23:51,519 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:23:51,519 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2022-02-21 03:23:51,519 INFO L132 ssoRankerPreferences]: Path of dumped script: [2022-02-21 03:23:51,519 INFO L133 ssoRankerPreferences]: Filename of dumped script: NestedRecursion_1d.c_Iteration6_Loop [2022-02-21 03:23:51,519 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2022-02-21 03:23:51,519 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2022-02-21 03:23:51,519 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 03:23:51,533 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 03:23:51,535 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 03:23:51,537 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 03:23:51,540 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 03:23:51,544 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 03:23:51,584 INFO L294 LassoAnalysis]: Preprocessing complete. [2022-02-21 03:23:51,585 INFO L490 LassoAnalysis]: Using template 'affine'. [2022-02-21 03:23:51,585 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:23:51,585 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:23:51,586 INFO L229 MonitoredProcess]: Starting monitored process 44 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-02-21 03:23:51,587 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (44)] Waiting until timeout for monitored process [2022-02-21 03:23:51,588 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-02-21 03:23:51,593 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 03:23:51,593 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 03:23:51,593 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 03:23:51,593 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 03:23:51,593 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 03:23:51,594 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-02-21 03:23:51,594 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 03:23:51,609 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 03:23:51,625 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (44)] Forceful destruction successful, exit code 0 [2022-02-21 03:23:51,625 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:23:51,625 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:23:51,627 INFO L229 MonitoredProcess]: Starting monitored process 45 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-02-21 03:23:51,627 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (45)] Waiting until timeout for monitored process [2022-02-21 03:23:51,629 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-02-21 03:23:51,633 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 03:23:51,634 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 03:23:51,634 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 03:23:51,634 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 03:23:51,634 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 03:23:51,634 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-02-21 03:23:51,634 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 03:23:51,644 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 03:23:51,660 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (45)] Forceful destruction successful, exit code 0 [2022-02-21 03:23:51,660 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:23:51,660 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:23:51,661 INFO L229 MonitoredProcess]: Starting monitored process 46 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-02-21 03:23:51,663 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (46)] Waiting until timeout for monitored process [2022-02-21 03:23:51,665 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-02-21 03:23:51,670 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 03:23:51,670 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 03:23:51,670 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 03:23:51,670 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 03:23:51,670 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 03:23:51,670 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-02-21 03:23:51,670 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 03:23:51,677 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 03:23:51,692 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (46)] Forceful destruction successful, exit code 0 [2022-02-21 03:23:51,692 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:23:51,692 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:23:51,693 INFO L229 MonitoredProcess]: Starting monitored process 47 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-02-21 03:23:51,694 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (47)] Waiting until timeout for monitored process [2022-02-21 03:23:51,695 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-02-21 03:23:51,700 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 03:23:51,701 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 03:23:51,701 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 03:23:51,701 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 03:23:51,701 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 03:23:51,701 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-02-21 03:23:51,701 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 03:23:51,703 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 03:23:51,718 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (47)] Forceful destruction successful, exit code 0 [2022-02-21 03:23:51,719 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:23:51,719 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:23:51,720 INFO L229 MonitoredProcess]: Starting monitored process 48 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-02-21 03:23:51,721 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (48)] Waiting until timeout for monitored process [2022-02-21 03:23:51,722 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-02-21 03:23:51,727 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 03:23:51,727 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 03:23:51,727 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 03:23:51,727 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 03:23:51,727 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 03:23:51,728 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-02-21 03:23:51,728 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 03:23:51,746 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2022-02-21 03:23:51,747 INFO L443 ModelExtractionUtils]: Simplification made 2 calls to the SMT solver. [2022-02-21 03:23:51,747 INFO L444 ModelExtractionUtils]: 1 out of 3 variables were initially zero. Simplification set additionally 0 variables to zero. [2022-02-21 03:23:51,747 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:23:51,747 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:23:51,749 INFO L229 MonitoredProcess]: Starting monitored process 49 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-02-21 03:23:51,750 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (49)] Waiting until timeout for monitored process [2022-02-21 03:23:51,750 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2022-02-21 03:23:51,750 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2022-02-21 03:23:51,751 INFO L513 LassoAnalysis]: Proved termination. [2022-02-21 03:23:51,751 INFO L515 LassoAnalysis]: Termination argument consisting of: Ranking function f(rec1_#in~i) = 1*rec1_#in~i Supporting invariants [] [2022-02-21 03:23:51,765 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (48)] Ended with exit code 0 [2022-02-21 03:23:51,770 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2022-02-21 03:23:51,771 INFO L390 LassoCheck]: Loop: "~i := #in~i;" "assume !(~i <= 0);" "call #t~ret0 := rec1(~i - 2);"< [2022-02-21 03:23:51,774 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:23:51,781 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:23:51,827 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:23:51,829 INFO L263 TraceCheckSpWp]: Trace formula consists of 266 conjuncts, 16 conjunts are in the unsatisfiable core [2022-02-21 03:23:51,837 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:23:51,838 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-21 03:23:52,043 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (49)] Forceful destruction successful, exit code 0 [2022-02-21 03:23:52,102 INFO L290 TraceCheckUtils]: 0: Hoare triple {7537#unseeded} assume { :begin_inline_ULTIMATE.init } true; {7537#unseeded} is VALID [2022-02-21 03:23:52,105 INFO L290 TraceCheckUtils]: 1: Hoare triple {7537#unseeded} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet5#1, main_#t~ret6#1, main_~x~0#1;main_~x~0#1 := main_#t~nondet5#1;havoc main_#t~nondet5#1; {7537#unseeded} is VALID [2022-02-21 03:23:52,105 INFO L272 TraceCheckUtils]: 2: Hoare triple {7537#unseeded} call main_#t~ret6#1 := rec2(main_~x~0#1); {7537#unseeded} is VALID [2022-02-21 03:23:52,105 INFO L290 TraceCheckUtils]: 3: Hoare triple {7537#unseeded} ~j := #in~j; {7537#unseeded} is VALID [2022-02-21 03:23:52,106 INFO L290 TraceCheckUtils]: 4: Hoare triple {7537#unseeded} assume !(~j <= 0); {7537#unseeded} is VALID [2022-02-21 03:23:52,106 INFO L272 TraceCheckUtils]: 5: Hoare triple {7537#unseeded} call #t~ret3 := rec1(~j); {7537#unseeded} is VALID [2022-02-21 03:23:52,106 INFO L290 TraceCheckUtils]: 6: Hoare triple {7537#unseeded} ~i := #in~i; {7537#unseeded} is VALID [2022-02-21 03:23:52,107 INFO L290 TraceCheckUtils]: 7: Hoare triple {7537#unseeded} assume !(~i <= 0); {7537#unseeded} is VALID [2022-02-21 03:23:52,107 INFO L272 TraceCheckUtils]: 8: Hoare triple {7537#unseeded} call #t~ret0 := rec1(~i - 2); {7579#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2022-02-21 03:23:52,108 INFO L290 TraceCheckUtils]: 9: Hoare triple {7579#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} ~i := #in~i; {7579#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2022-02-21 03:23:52,108 INFO L290 TraceCheckUtils]: 10: Hoare triple {7579#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} assume !(~i <= 0); {7579#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2022-02-21 03:23:52,109 INFO L272 TraceCheckUtils]: 11: Hoare triple {7579#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} call #t~ret0 := rec1(~i - 2); {7579#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2022-02-21 03:23:52,109 INFO L290 TraceCheckUtils]: 12: Hoare triple {7579#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} ~i := #in~i; {7579#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2022-02-21 03:23:52,109 INFO L290 TraceCheckUtils]: 13: Hoare triple {7579#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} assume ~i <= 0;#res := 0; {7579#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2022-02-21 03:23:52,110 INFO L290 TraceCheckUtils]: 14: Hoare triple {7579#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} assume true; {7579#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2022-02-21 03:23:52,111 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {7579#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} {7579#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} #28#return; {7579#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2022-02-21 03:23:52,112 INFO L272 TraceCheckUtils]: 16: Hoare triple {7579#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} call #t~ret1 := rec1(#t~ret0 - 1); {7579#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2022-02-21 03:23:52,112 INFO L290 TraceCheckUtils]: 17: Hoare triple {7579#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} ~i := #in~i; {7579#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2022-02-21 03:23:52,112 INFO L290 TraceCheckUtils]: 18: Hoare triple {7579#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} assume ~i <= 0;#res := 0; {7579#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2022-02-21 03:23:52,113 INFO L290 TraceCheckUtils]: 19: Hoare triple {7579#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} assume true; {7579#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2022-02-21 03:23:52,113 INFO L284 TraceCheckUtils]: 20: Hoare quadruple {7579#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} {7579#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} #30#return; {7579#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2022-02-21 03:23:52,114 INFO L272 TraceCheckUtils]: 21: Hoare triple {7579#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} call #t~ret2 := rec1(#t~ret1); {7579#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2022-02-21 03:23:52,114 INFO L290 TraceCheckUtils]: 22: Hoare triple {7579#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} ~i := #in~i; {7579#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2022-02-21 03:23:52,115 INFO L290 TraceCheckUtils]: 23: Hoare triple {7579#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} assume ~i <= 0;#res := 0; {7579#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2022-02-21 03:23:52,115 INFO L290 TraceCheckUtils]: 24: Hoare triple {7579#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} assume true; {7579#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2022-02-21 03:23:52,116 INFO L284 TraceCheckUtils]: 25: Hoare quadruple {7579#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} {7579#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} #32#return; {7579#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2022-02-21 03:23:52,117 INFO L290 TraceCheckUtils]: 26: Hoare triple {7579#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} #res := 1 + #t~ret2;havoc #t~ret0;havoc #t~ret1;havoc #t~ret2; {7579#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2022-02-21 03:23:52,117 INFO L290 TraceCheckUtils]: 27: Hoare triple {7579#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} assume true; {7579#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2022-02-21 03:23:52,118 INFO L284 TraceCheckUtils]: 28: Hoare quadruple {7579#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} {7537#unseeded} #28#return; {7537#unseeded} is VALID [2022-02-21 03:23:52,118 INFO L272 TraceCheckUtils]: 29: Hoare triple {7537#unseeded} call #t~ret1 := rec1(#t~ret0 - 1); {7537#unseeded} is VALID [2022-02-21 03:23:52,125 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:23:52,125 INFO L263 TraceCheckSpWp]: Trace formula consists of 37 conjuncts, 7 conjunts are in the unsatisfiable core [2022-02-21 03:23:52,129 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:23:52,130 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-21 03:23:52,160 INFO L290 TraceCheckUtils]: 0: Hoare triple {7540#(>= oldRank0 |rec1_#in~i|)} ~i := #in~i; {7643#(<= rec1_~i oldRank0)} is VALID [2022-02-21 03:23:52,160 INFO L290 TraceCheckUtils]: 1: Hoare triple {7643#(<= rec1_~i oldRank0)} assume !(~i <= 0); {7647#(and (not (<= rec1_~i 0)) (<= rec1_~i oldRank0))} is VALID [2022-02-21 03:23:52,161 INFO L272 TraceCheckUtils]: 2: Hoare triple {7647#(and (not (<= rec1_~i 0)) (<= rec1_~i oldRank0))} call #t~ret0 := rec1(~i - 2); {7550#(or (and (>= oldRank0 0) (> oldRank0 |rec1_#in~i|)) unseeded)} is VALID [2022-02-21 03:23:52,161 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-21 03:23:52,161 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 5 states, 4 states have (on average 3.25) internal successors, (13), 4 states have internal predecessors, (13), 3 states have call successors, (8), 3 states have call predecessors, (8), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2022-02-21 03:23:52,190 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 25 edges. 25 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-21 03:23:52,191 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 5 states, 4 states have (on average 3.25) internal successors, (13), 4 states have internal predecessors, (13), 3 states have call successors, (8), 3 states have call predecessors, (8), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Stem has 30 letters. Loop has 3 letters. [2022-02-21 03:23:52,191 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:23:52,191 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.2 stem predicates 3 loop predicates [2022-02-21 03:23:52,191 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 112 states and 162 transitions. cyclomatic complexity: 56 Second operand has 5 states, 4 states have (on average 3.25) internal successors, (13), 4 states have internal predecessors, (13), 3 states have call successors, (8), 3 states have call predecessors, (8), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2022-02-21 03:23:52,269 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 112 states and 162 transitions. cyclomatic complexity: 56. Second operand has 5 states, 4 states have (on average 3.25) internal successors, (13), 4 states have internal predecessors, (13), 3 states have call successors, (8), 3 states have call predecessors, (8), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Result 129 states and 180 transitions. Complement of second has 7 states. [2022-02-21 03:23:52,269 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 2 stem states 1 non-accepting loop states 1 accepting loop states [2022-02-21 03:23:52,269 INFO L123 tractBuchiDifference]: Start testing correctness of buchiDifferenceNCSBLazy3 [2022-02-21 03:23:52,269 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 112 states and 162 transitions. cyclomatic complexity: 56 [2022-02-21 03:23:52,269 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 03:23:52,269 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 03:23:52,269 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 5 states, 4 states have (on average 3.25) internal successors, (13), 4 states have internal predecessors, (13), 3 states have call successors, (8), 3 states have call predecessors, (8), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2022-02-21 03:23:52,270 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2022-02-21 03:23:52,270 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2022-02-21 03:23:52,270 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 129 states and 180 transitions. [2022-02-21 03:23:52,270 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 9 [2022-02-21 03:23:52,270 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 03:23:52,270 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 03:23:52,271 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 112 states and 162 transitions. cyclomatic complexity: 56 [2022-02-21 03:23:52,273 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 14 examples of accepted words. [2022-02-21 03:23:52,273 INFO L70 LassoExtractor]: Start lassoExtractor. Operand has 5 states, 4 states have (on average 3.25) internal successors, (13), 4 states have internal predecessors, (13), 3 states have call successors, (8), 3 states have call predecessors, (8), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2022-02-21 03:23:52,274 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2022-02-21 03:23:52,274 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 4 states and 16 transitions. cyclomatic complexity: 15 [2022-02-21 03:23:52,274 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2022-02-21 03:23:52,274 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 0 examples of accepted words. [2022-02-21 03:23:52,274 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 129 states and 180 transitions. cyclomatic complexity: 57 [2022-02-21 03:23:52,276 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 14 examples of accepted words. [2022-02-21 03:23:52,276 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 112 states and 162 transitions. cyclomatic complexity: 56 Stem has 30 letters. Loop has 3 letters. [2022-02-21 03:23:52,276 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:23:52,276 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 5 states, 4 states have (on average 3.25) internal successors, (13), 4 states have internal predecessors, (13), 3 states have call successors, (8), 3 states have call predecessors, (8), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Stem has 30 letters. Loop has 3 letters. [2022-02-21 03:23:52,276 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:23:52,276 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 129 states and 180 transitions. cyclomatic complexity: 57 Stem has 30 letters. Loop has 3 letters. [2022-02-21 03:23:52,276 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:23:52,276 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 112 states and 162 transitions. cyclomatic complexity: 56 Stem has 30 letters. Loop has 3 letters. [2022-02-21 03:23:52,277 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:23:52,277 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 5 states, 4 states have (on average 3.25) internal successors, (13), 4 states have internal predecessors, (13), 3 states have call successors, (8), 3 states have call predecessors, (8), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Stem has 30 letters. Loop has 3 letters. [2022-02-21 03:23:52,277 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:23:52,277 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 129 states and 180 transitions. cyclomatic complexity: 57 Stem has 30 letters. Loop has 3 letters. [2022-02-21 03:23:52,277 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:23:52,277 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 112 states and 162 transitions. cyclomatic complexity: 56 Stem has 129 letters. Loop has 129 letters. [2022-02-21 03:23:52,277 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:23:52,277 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 5 states, 4 states have (on average 3.25) internal successors, (13), 4 states have internal predecessors, (13), 3 states have call successors, (8), 3 states have call predecessors, (8), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Stem has 129 letters. Loop has 129 letters. [2022-02-21 03:23:52,277 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:23:52,277 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 129 states and 180 transitions. cyclomatic complexity: 57 Stem has 129 letters. Loop has 129 letters. [2022-02-21 03:23:52,277 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:23:52,277 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 112 states and 162 transitions. cyclomatic complexity: 56 Stem has 112 letters. Loop has 112 letters. [2022-02-21 03:23:52,277 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:23:52,277 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 5 states, 4 states have (on average 3.25) internal successors, (13), 4 states have internal predecessors, (13), 3 states have call successors, (8), 3 states have call predecessors, (8), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Stem has 112 letters. Loop has 112 letters. [2022-02-21 03:23:52,277 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:23:52,277 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 129 states and 180 transitions. cyclomatic complexity: 57 Stem has 112 letters. Loop has 112 letters. [2022-02-21 03:23:52,277 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:23:52,277 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 112 states and 162 transitions. cyclomatic complexity: 56 Stem has 4 letters. Loop has 4 letters. [2022-02-21 03:23:52,277 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:23:52,277 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 5 states, 4 states have (on average 3.25) internal successors, (13), 4 states have internal predecessors, (13), 3 states have call successors, (8), 3 states have call predecessors, (8), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Stem has 4 letters. Loop has 4 letters. [2022-02-21 03:23:52,277 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:23:52,277 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 129 states and 180 transitions. cyclomatic complexity: 57 Stem has 4 letters. Loop has 4 letters. [2022-02-21 03:23:52,277 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:23:52,277 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 112 states and 162 transitions. cyclomatic complexity: 56 Stem has 32 letters. Loop has 3 letters. [2022-02-21 03:23:52,277 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:23:52,277 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 5 states, 4 states have (on average 3.25) internal successors, (13), 4 states have internal predecessors, (13), 3 states have call successors, (8), 3 states have call predecessors, (8), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Stem has 32 letters. Loop has 3 letters. [2022-02-21 03:23:52,278 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:23:52,278 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 129 states and 180 transitions. cyclomatic complexity: 57 Stem has 32 letters. Loop has 3 letters. [2022-02-21 03:23:52,278 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:23:52,278 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 112 states and 162 transitions. cyclomatic complexity: 56 Stem has 53 letters. Loop has 45 letters. [2022-02-21 03:23:52,278 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:23:52,278 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 5 states, 4 states have (on average 3.25) internal successors, (13), 4 states have internal predecessors, (13), 3 states have call successors, (8), 3 states have call predecessors, (8), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Stem has 53 letters. Loop has 45 letters. [2022-02-21 03:23:52,278 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:23:52,278 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 129 states and 180 transitions. cyclomatic complexity: 57 Stem has 53 letters. Loop has 45 letters. [2022-02-21 03:23:52,278 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:23:52,278 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 112 states and 162 transitions. cyclomatic complexity: 56 Stem has 30 letters. Loop has 3 letters. [2022-02-21 03:23:52,278 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:23:52,278 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 5 states, 4 states have (on average 3.25) internal successors, (13), 4 states have internal predecessors, (13), 3 states have call successors, (8), 3 states have call predecessors, (8), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Stem has 30 letters. Loop has 3 letters. [2022-02-21 03:23:52,278 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:23:52,278 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 129 states and 180 transitions. cyclomatic complexity: 57 Stem has 30 letters. Loop has 3 letters. [2022-02-21 03:23:52,278 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:23:52,278 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 112 states and 162 transitions. cyclomatic complexity: 56 Stem has 31 letters. Loop has 3 letters. [2022-02-21 03:23:52,278 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:23:52,278 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 5 states, 4 states have (on average 3.25) internal successors, (13), 4 states have internal predecessors, (13), 3 states have call successors, (8), 3 states have call predecessors, (8), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Stem has 31 letters. Loop has 3 letters. [2022-02-21 03:23:52,278 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:23:52,278 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 129 states and 180 transitions. cyclomatic complexity: 57 Stem has 31 letters. Loop has 3 letters. [2022-02-21 03:23:52,278 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:23:52,278 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 112 states and 162 transitions. cyclomatic complexity: 56 Stem has 32 letters. Loop has 24 letters. [2022-02-21 03:23:52,279 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:23:52,279 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 5 states, 4 states have (on average 3.25) internal successors, (13), 4 states have internal predecessors, (13), 3 states have call successors, (8), 3 states have call predecessors, (8), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Stem has 32 letters. Loop has 24 letters. [2022-02-21 03:23:52,279 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:23:52,279 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 129 states and 180 transitions. cyclomatic complexity: 57 Stem has 32 letters. Loop has 24 letters. [2022-02-21 03:23:52,279 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:23:52,279 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 112 states and 162 transitions. cyclomatic complexity: 56 Stem has 32 letters. Loop has 72 letters. [2022-02-21 03:23:52,279 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:23:52,279 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 5 states, 4 states have (on average 3.25) internal successors, (13), 4 states have internal predecessors, (13), 3 states have call successors, (8), 3 states have call predecessors, (8), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Stem has 32 letters. Loop has 72 letters. [2022-02-21 03:23:52,279 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:23:52,279 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 129 states and 180 transitions. cyclomatic complexity: 57 Stem has 32 letters. Loop has 72 letters. [2022-02-21 03:23:52,279 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:23:52,279 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 112 states and 162 transitions. cyclomatic complexity: 56 Stem has 32 letters. Loop has 24 letters. [2022-02-21 03:23:52,279 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:23:52,279 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 5 states, 4 states have (on average 3.25) internal successors, (13), 4 states have internal predecessors, (13), 3 states have call successors, (8), 3 states have call predecessors, (8), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Stem has 32 letters. Loop has 24 letters. [2022-02-21 03:23:52,279 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:23:52,279 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 129 states and 180 transitions. cyclomatic complexity: 57 Stem has 32 letters. Loop has 24 letters. [2022-02-21 03:23:52,280 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:23:52,280 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 112 states and 162 transitions. cyclomatic complexity: 56 Stem has 53 letters. Loop has 93 letters. [2022-02-21 03:23:52,280 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:23:52,280 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 5 states, 4 states have (on average 3.25) internal successors, (13), 4 states have internal predecessors, (13), 3 states have call successors, (8), 3 states have call predecessors, (8), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Stem has 53 letters. Loop has 93 letters. [2022-02-21 03:23:52,280 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:23:52,280 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 129 states and 180 transitions. cyclomatic complexity: 57 Stem has 53 letters. Loop has 93 letters. [2022-02-21 03:23:52,280 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:23:52,280 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 112 states and 162 transitions. cyclomatic complexity: 56 Stem has 53 letters. Loop has 45 letters. [2022-02-21 03:23:52,280 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:23:52,280 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 5 states, 4 states have (on average 3.25) internal successors, (13), 4 states have internal predecessors, (13), 3 states have call successors, (8), 3 states have call predecessors, (8), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Stem has 53 letters. Loop has 45 letters. [2022-02-21 03:23:52,280 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:23:52,280 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 129 states and 180 transitions. cyclomatic complexity: 57 Stem has 53 letters. Loop has 45 letters. [2022-02-21 03:23:52,280 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:23:52,280 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 112 states and 162 transitions. cyclomatic complexity: 56 Stem has 77 letters. Loop has 72 letters. [2022-02-21 03:23:52,280 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:23:52,280 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 5 states, 4 states have (on average 3.25) internal successors, (13), 4 states have internal predecessors, (13), 3 states have call successors, (8), 3 states have call predecessors, (8), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Stem has 77 letters. Loop has 72 letters. [2022-02-21 03:23:52,281 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:23:52,281 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 129 states and 180 transitions. cyclomatic complexity: 57 Stem has 77 letters. Loop has 72 letters. [2022-02-21 03:23:52,281 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:23:52,281 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 112 states and 162 transitions. cyclomatic complexity: 56 Stem has 74 letters. Loop has 72 letters. [2022-02-21 03:23:52,281 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:23:52,281 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 5 states, 4 states have (on average 3.25) internal successors, (13), 4 states have internal predecessors, (13), 3 states have call successors, (8), 3 states have call predecessors, (8), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Stem has 74 letters. Loop has 72 letters. [2022-02-21 03:23:52,281 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:23:52,281 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 129 states and 180 transitions. cyclomatic complexity: 57 Stem has 74 letters. Loop has 72 letters. [2022-02-21 03:23:52,281 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:23:52,281 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 112 states and 162 transitions. cyclomatic complexity: 56 Stem has 76 letters. Loop has 72 letters. [2022-02-21 03:23:52,281 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:23:52,281 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 5 states, 4 states have (on average 3.25) internal successors, (13), 4 states have internal predecessors, (13), 3 states have call successors, (8), 3 states have call predecessors, (8), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Stem has 76 letters. Loop has 72 letters. [2022-02-21 03:23:52,281 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:23:52,281 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 129 states and 180 transitions. cyclomatic complexity: 57 Stem has 76 letters. Loop has 72 letters. [2022-02-21 03:23:52,282 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:23:52,282 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 112 states and 162 transitions. cyclomatic complexity: 56 Stem has 75 letters. Loop has 72 letters. [2022-02-21 03:23:52,282 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:23:52,282 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 5 states, 4 states have (on average 3.25) internal successors, (13), 4 states have internal predecessors, (13), 3 states have call successors, (8), 3 states have call predecessors, (8), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Stem has 75 letters. Loop has 72 letters. [2022-02-21 03:23:52,282 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:23:52,282 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 129 states and 180 transitions. cyclomatic complexity: 57 Stem has 75 letters. Loop has 72 letters. [2022-02-21 03:23:52,282 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:23:52,282 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 112 states and 162 transitions. cyclomatic complexity: 56 Stem has 74 letters. Loop has 72 letters. [2022-02-21 03:23:52,282 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:23:52,282 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 5 states, 4 states have (on average 3.25) internal successors, (13), 4 states have internal predecessors, (13), 3 states have call successors, (8), 3 states have call predecessors, (8), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Stem has 74 letters. Loop has 72 letters. [2022-02-21 03:23:52,282 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:23:52,282 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 129 states and 180 transitions. cyclomatic complexity: 57 Stem has 74 letters. Loop has 72 letters. [2022-02-21 03:23:52,282 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:23:52,282 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 112 states and 162 transitions. cyclomatic complexity: 56 Stem has 32 letters. Loop has 24 letters. [2022-02-21 03:23:52,283 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:23:52,283 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 5 states, 4 states have (on average 3.25) internal successors, (13), 4 states have internal predecessors, (13), 3 states have call successors, (8), 3 states have call predecessors, (8), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Stem has 32 letters. Loop has 24 letters. [2022-02-21 03:23:52,283 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:23:52,283 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 129 states and 180 transitions. cyclomatic complexity: 57 Stem has 32 letters. Loop has 24 letters. [2022-02-21 03:23:52,283 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:23:52,283 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 112 states and 162 transitions. cyclomatic complexity: 56 Stem has 30 letters. Loop has 3 letters. [2022-02-21 03:23:52,283 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:23:52,283 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 5 states, 4 states have (on average 3.25) internal successors, (13), 4 states have internal predecessors, (13), 3 states have call successors, (8), 3 states have call predecessors, (8), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Stem has 30 letters. Loop has 3 letters. [2022-02-21 03:23:52,283 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:23:52,283 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 129 states and 180 transitions. cyclomatic complexity: 57 Stem has 30 letters. Loop has 3 letters. [2022-02-21 03:23:52,283 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:23:52,283 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 112 states and 162 transitions. cyclomatic complexity: 56 Stem has 53 letters. Loop has 45 letters. [2022-02-21 03:23:52,283 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:23:52,283 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 5 states, 4 states have (on average 3.25) internal successors, (13), 4 states have internal predecessors, (13), 3 states have call successors, (8), 3 states have call predecessors, (8), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Stem has 53 letters. Loop has 45 letters. [2022-02-21 03:23:52,283 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:23:52,283 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 129 states and 180 transitions. cyclomatic complexity: 57 Stem has 53 letters. Loop has 45 letters. [2022-02-21 03:23:52,283 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:23:52,283 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 112 states and 162 transitions. cyclomatic complexity: 56 Stem has 31 letters. Loop has 3 letters. [2022-02-21 03:23:52,283 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:23:52,283 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 5 states, 4 states have (on average 3.25) internal successors, (13), 4 states have internal predecessors, (13), 3 states have call successors, (8), 3 states have call predecessors, (8), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Stem has 31 letters. Loop has 3 letters. [2022-02-21 03:23:52,284 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:23:52,284 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 129 states and 180 transitions. cyclomatic complexity: 57 Stem has 31 letters. Loop has 3 letters. [2022-02-21 03:23:52,284 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:23:52,284 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 112 states and 162 transitions. cyclomatic complexity: 56 Stem has 32 letters. Loop has 3 letters. [2022-02-21 03:23:52,284 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:23:52,284 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 5 states, 4 states have (on average 3.25) internal successors, (13), 4 states have internal predecessors, (13), 3 states have call successors, (8), 3 states have call predecessors, (8), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Stem has 32 letters. Loop has 3 letters. [2022-02-21 03:23:52,284 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:23:52,284 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 129 states and 180 transitions. cyclomatic complexity: 57 Stem has 32 letters. Loop has 3 letters. [2022-02-21 03:23:52,284 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:23:52,284 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 112 states and 162 transitions. cyclomatic complexity: 56 Stem has 53 letters. Loop has 93 letters. [2022-02-21 03:23:52,284 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:23:52,284 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 5 states, 4 states have (on average 3.25) internal successors, (13), 4 states have internal predecessors, (13), 3 states have call successors, (8), 3 states have call predecessors, (8), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Stem has 53 letters. Loop has 93 letters. [2022-02-21 03:23:52,284 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:23:52,284 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 129 states and 180 transitions. cyclomatic complexity: 57 Stem has 53 letters. Loop has 93 letters. [2022-02-21 03:23:52,284 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:23:52,284 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 112 states and 162 transitions. cyclomatic complexity: 56 Stem has 53 letters. Loop has 45 letters. [2022-02-21 03:23:52,284 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:23:52,284 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 5 states, 4 states have (on average 3.25) internal successors, (13), 4 states have internal predecessors, (13), 3 states have call successors, (8), 3 states have call predecessors, (8), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Stem has 53 letters. Loop has 45 letters. [2022-02-21 03:23:52,284 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:23:52,284 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 129 states and 180 transitions. cyclomatic complexity: 57 Stem has 53 letters. Loop has 45 letters. [2022-02-21 03:23:52,285 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:23:52,285 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 112 states and 162 transitions. cyclomatic complexity: 56 Stem has 32 letters. Loop has 24 letters. [2022-02-21 03:23:52,285 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:23:52,285 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 5 states, 4 states have (on average 3.25) internal successors, (13), 4 states have internal predecessors, (13), 3 states have call successors, (8), 3 states have call predecessors, (8), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Stem has 32 letters. Loop has 24 letters. [2022-02-21 03:23:52,285 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:23:52,285 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 129 states and 180 transitions. cyclomatic complexity: 57 Stem has 32 letters. Loop has 24 letters. [2022-02-21 03:23:52,285 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:23:52,285 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 112 states and 162 transitions. cyclomatic complexity: 56 Stem has 32 letters. Loop has 72 letters. [2022-02-21 03:23:52,285 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:23:52,285 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 5 states, 4 states have (on average 3.25) internal successors, (13), 4 states have internal predecessors, (13), 3 states have call successors, (8), 3 states have call predecessors, (8), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Stem has 32 letters. Loop has 72 letters. [2022-02-21 03:23:52,285 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:23:52,285 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 129 states and 180 transitions. cyclomatic complexity: 57 Stem has 32 letters. Loop has 72 letters. [2022-02-21 03:23:52,285 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:23:52,285 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 112 states and 162 transitions. cyclomatic complexity: 56 Stem has 75 letters. Loop has 72 letters. [2022-02-21 03:23:52,286 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:23:52,286 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 5 states, 4 states have (on average 3.25) internal successors, (13), 4 states have internal predecessors, (13), 3 states have call successors, (8), 3 states have call predecessors, (8), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Stem has 75 letters. Loop has 72 letters. [2022-02-21 03:23:52,286 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:23:52,286 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 129 states and 180 transitions. cyclomatic complexity: 57 Stem has 75 letters. Loop has 72 letters. [2022-02-21 03:23:52,286 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:23:52,286 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 112 states and 162 transitions. cyclomatic complexity: 56 Stem has 76 letters. Loop has 72 letters. [2022-02-21 03:23:52,286 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:23:52,286 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 5 states, 4 states have (on average 3.25) internal successors, (13), 4 states have internal predecessors, (13), 3 states have call successors, (8), 3 states have call predecessors, (8), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Stem has 76 letters. Loop has 72 letters. [2022-02-21 03:23:52,286 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:23:52,286 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 129 states and 180 transitions. cyclomatic complexity: 57 Stem has 76 letters. Loop has 72 letters. [2022-02-21 03:23:52,286 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:23:52,286 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 112 states and 162 transitions. cyclomatic complexity: 56 Stem has 77 letters. Loop has 72 letters. [2022-02-21 03:23:52,286 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:23:52,286 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 5 states, 4 states have (on average 3.25) internal successors, (13), 4 states have internal predecessors, (13), 3 states have call successors, (8), 3 states have call predecessors, (8), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Stem has 77 letters. Loop has 72 letters. [2022-02-21 03:23:52,286 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:23:52,286 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 129 states and 180 transitions. cyclomatic complexity: 57 Stem has 77 letters. Loop has 72 letters. [2022-02-21 03:23:52,287 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:23:52,287 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 112 states and 162 transitions. cyclomatic complexity: 56 Stem has 74 letters. Loop has 72 letters. [2022-02-21 03:23:52,291 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:23:52,291 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 5 states, 4 states have (on average 3.25) internal successors, (13), 4 states have internal predecessors, (13), 3 states have call successors, (8), 3 states have call predecessors, (8), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Stem has 74 letters. Loop has 72 letters. [2022-02-21 03:23:52,291 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:23:52,291 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 129 states and 180 transitions. cyclomatic complexity: 57 Stem has 74 letters. Loop has 72 letters. [2022-02-21 03:23:52,291 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:23:52,291 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 112 states and 162 transitions. cyclomatic complexity: 56 Stem has 74 letters. Loop has 72 letters. [2022-02-21 03:23:52,291 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:23:52,291 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 5 states, 4 states have (on average 3.25) internal successors, (13), 4 states have internal predecessors, (13), 3 states have call successors, (8), 3 states have call predecessors, (8), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Stem has 74 letters. Loop has 72 letters. [2022-02-21 03:23:52,291 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:23:52,292 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 129 states and 180 transitions. cyclomatic complexity: 57 Stem has 74 letters. Loop has 72 letters. [2022-02-21 03:23:52,292 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:23:52,292 INFO L161 tractBuchiDifference]: Finished testing correctness of buchiDifferenceNCSBLazy3 [2022-02-21 03:23:52,292 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 4 states have (on average 3.25) internal successors, (13), 4 states have internal predecessors, (13), 3 states have call successors, (8), 3 states have call predecessors, (8), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2022-02-21 03:23:52,292 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 16 transitions. [2022-02-21 03:23:52,293 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 16 transitions. Stem has 30 letters. Loop has 3 letters. [2022-02-21 03:23:52,293 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:23:52,293 INFO L634 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2022-02-21 03:23:52,300 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:23:52,340 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:23:52,342 INFO L263 TraceCheckSpWp]: Trace formula consists of 266 conjuncts, 16 conjunts are in the unsatisfiable core [2022-02-21 03:23:52,354 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:23:52,354 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-21 03:23:52,562 INFO L290 TraceCheckUtils]: 0: Hoare triple {7537#unseeded} assume { :begin_inline_ULTIMATE.init } true; {7537#unseeded} is VALID [2022-02-21 03:23:52,562 INFO L290 TraceCheckUtils]: 1: Hoare triple {7537#unseeded} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet5#1, main_#t~ret6#1, main_~x~0#1;main_~x~0#1 := main_#t~nondet5#1;havoc main_#t~nondet5#1; {7537#unseeded} is VALID [2022-02-21 03:23:52,563 INFO L272 TraceCheckUtils]: 2: Hoare triple {7537#unseeded} call main_#t~ret6#1 := rec2(main_~x~0#1); {7537#unseeded} is VALID [2022-02-21 03:23:52,563 INFO L290 TraceCheckUtils]: 3: Hoare triple {7537#unseeded} ~j := #in~j; {7537#unseeded} is VALID [2022-02-21 03:23:52,563 INFO L290 TraceCheckUtils]: 4: Hoare triple {7537#unseeded} assume !(~j <= 0); {7537#unseeded} is VALID [2022-02-21 03:23:52,564 INFO L272 TraceCheckUtils]: 5: Hoare triple {7537#unseeded} call #t~ret3 := rec1(~j); {7537#unseeded} is VALID [2022-02-21 03:23:52,564 INFO L290 TraceCheckUtils]: 6: Hoare triple {7537#unseeded} ~i := #in~i; {7537#unseeded} is VALID [2022-02-21 03:23:52,564 INFO L290 TraceCheckUtils]: 7: Hoare triple {7537#unseeded} assume !(~i <= 0); {7537#unseeded} is VALID [2022-02-21 03:23:52,565 INFO L272 TraceCheckUtils]: 8: Hoare triple {7537#unseeded} call #t~ret0 := rec1(~i - 2); {7820#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2022-02-21 03:23:52,565 INFO L290 TraceCheckUtils]: 9: Hoare triple {7820#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} ~i := #in~i; {7820#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2022-02-21 03:23:52,565 INFO L290 TraceCheckUtils]: 10: Hoare triple {7820#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} assume !(~i <= 0); {7820#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2022-02-21 03:23:52,566 INFO L272 TraceCheckUtils]: 11: Hoare triple {7820#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} call #t~ret0 := rec1(~i - 2); {7820#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2022-02-21 03:23:52,566 INFO L290 TraceCheckUtils]: 12: Hoare triple {7820#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} ~i := #in~i; {7820#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2022-02-21 03:23:52,566 INFO L290 TraceCheckUtils]: 13: Hoare triple {7820#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} assume ~i <= 0;#res := 0; {7820#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2022-02-21 03:23:52,567 INFO L290 TraceCheckUtils]: 14: Hoare triple {7820#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} assume true; {7820#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2022-02-21 03:23:52,567 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {7820#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} {7820#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} #28#return; {7820#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2022-02-21 03:23:52,568 INFO L272 TraceCheckUtils]: 16: Hoare triple {7820#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} call #t~ret1 := rec1(#t~ret0 - 1); {7820#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2022-02-21 03:23:52,568 INFO L290 TraceCheckUtils]: 17: Hoare triple {7820#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} ~i := #in~i; {7820#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2022-02-21 03:23:52,569 INFO L290 TraceCheckUtils]: 18: Hoare triple {7820#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} assume ~i <= 0;#res := 0; {7820#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2022-02-21 03:23:52,569 INFO L290 TraceCheckUtils]: 19: Hoare triple {7820#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} assume true; {7820#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2022-02-21 03:23:52,570 INFO L284 TraceCheckUtils]: 20: Hoare quadruple {7820#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} {7820#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} #30#return; {7820#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2022-02-21 03:23:52,570 INFO L272 TraceCheckUtils]: 21: Hoare triple {7820#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} call #t~ret2 := rec1(#t~ret1); {7820#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2022-02-21 03:23:52,570 INFO L290 TraceCheckUtils]: 22: Hoare triple {7820#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} ~i := #in~i; {7820#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2022-02-21 03:23:52,571 INFO L290 TraceCheckUtils]: 23: Hoare triple {7820#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} assume ~i <= 0;#res := 0; {7820#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2022-02-21 03:23:52,571 INFO L290 TraceCheckUtils]: 24: Hoare triple {7820#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} assume true; {7820#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2022-02-21 03:23:52,572 INFO L284 TraceCheckUtils]: 25: Hoare quadruple {7820#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} {7820#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} #32#return; {7820#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2022-02-21 03:23:52,572 INFO L290 TraceCheckUtils]: 26: Hoare triple {7820#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} #res := 1 + #t~ret2;havoc #t~ret0;havoc #t~ret1;havoc #t~ret2; {7820#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2022-02-21 03:23:52,572 INFO L290 TraceCheckUtils]: 27: Hoare triple {7820#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} assume true; {7820#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2022-02-21 03:23:52,573 INFO L284 TraceCheckUtils]: 28: Hoare quadruple {7820#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} {7537#unseeded} #28#return; {7537#unseeded} is VALID [2022-02-21 03:23:52,573 INFO L272 TraceCheckUtils]: 29: Hoare triple {7537#unseeded} call #t~ret1 := rec1(#t~ret0 - 1); {7537#unseeded} is VALID [2022-02-21 03:23:52,578 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:23:52,579 INFO L263 TraceCheckSpWp]: Trace formula consists of 37 conjuncts, 7 conjunts are in the unsatisfiable core [2022-02-21 03:23:52,582 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:23:52,583 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-21 03:23:52,609 INFO L290 TraceCheckUtils]: 0: Hoare triple {7540#(>= oldRank0 |rec1_#in~i|)} ~i := #in~i; {7884#(<= rec1_~i oldRank0)} is VALID [2022-02-21 03:23:52,609 INFO L290 TraceCheckUtils]: 1: Hoare triple {7884#(<= rec1_~i oldRank0)} assume !(~i <= 0); {7888#(and (not (<= rec1_~i 0)) (<= rec1_~i oldRank0))} is VALID [2022-02-21 03:23:52,610 INFO L272 TraceCheckUtils]: 2: Hoare triple {7888#(and (not (<= rec1_~i 0)) (<= rec1_~i oldRank0))} call #t~ret0 := rec1(~i - 2); {7550#(or (and (>= oldRank0 0) (> oldRank0 |rec1_#in~i|)) unseeded)} is VALID [2022-02-21 03:23:52,610 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-21 03:23:52,610 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 5 states, 4 states have (on average 3.25) internal successors, (13), 4 states have internal predecessors, (13), 3 states have call successors, (8), 3 states have call predecessors, (8), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2022-02-21 03:23:52,631 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 25 edges. 25 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-21 03:23:52,631 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 5 states, 4 states have (on average 3.25) internal successors, (13), 4 states have internal predecessors, (13), 3 states have call successors, (8), 3 states have call predecessors, (8), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Stem has 30 letters. Loop has 3 letters. [2022-02-21 03:23:52,631 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:23:52,631 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and with honda bouncer for loop.2 stem predicates 3 loop predicates [2022-02-21 03:23:52,631 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 112 states and 162 transitions. cyclomatic complexity: 56 Second operand has 5 states, 4 states have (on average 3.25) internal successors, (13), 4 states have internal predecessors, (13), 3 states have call successors, (8), 3 states have call predecessors, (8), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2022-02-21 03:23:52,700 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 112 states and 162 transitions. cyclomatic complexity: 56. Second operand has 5 states, 4 states have (on average 3.25) internal successors, (13), 4 states have internal predecessors, (13), 3 states have call successors, (8), 3 states have call predecessors, (8), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Result 129 states and 180 transitions. Complement of second has 7 states. [2022-02-21 03:23:52,700 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 2 stem states 1 non-accepting loop states 1 accepting loop states [2022-02-21 03:23:52,700 INFO L123 tractBuchiDifference]: Start testing correctness of buchiDifferenceNCSBLazy3 [2022-02-21 03:23:52,700 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 112 states and 162 transitions. cyclomatic complexity: 56 [2022-02-21 03:23:52,700 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 03:23:52,700 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 03:23:52,700 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 5 states, 4 states have (on average 3.25) internal successors, (13), 4 states have internal predecessors, (13), 3 states have call successors, (8), 3 states have call predecessors, (8), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2022-02-21 03:23:52,700 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2022-02-21 03:23:52,700 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2022-02-21 03:23:52,700 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 129 states and 180 transitions. [2022-02-21 03:23:52,701 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 9 [2022-02-21 03:23:52,701 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 03:23:52,701 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 03:23:52,701 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 112 states and 162 transitions. cyclomatic complexity: 56 [2022-02-21 03:23:52,701 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 14 examples of accepted words. [2022-02-21 03:23:52,701 INFO L70 LassoExtractor]: Start lassoExtractor. Operand has 5 states, 4 states have (on average 3.25) internal successors, (13), 4 states have internal predecessors, (13), 3 states have call successors, (8), 3 states have call predecessors, (8), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2022-02-21 03:23:52,702 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2022-02-21 03:23:52,702 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 4 states and 16 transitions. cyclomatic complexity: 15 [2022-02-21 03:23:52,702 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2022-02-21 03:23:52,702 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 0 examples of accepted words. [2022-02-21 03:23:52,702 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 129 states and 180 transitions. cyclomatic complexity: 57 [2022-02-21 03:23:52,704 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 14 examples of accepted words. [2022-02-21 03:23:52,704 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 112 states and 162 transitions. cyclomatic complexity: 56 Stem has 30 letters. Loop has 3 letters. [2022-02-21 03:23:52,704 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:23:52,704 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 5 states, 4 states have (on average 3.25) internal successors, (13), 4 states have internal predecessors, (13), 3 states have call successors, (8), 3 states have call predecessors, (8), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Stem has 30 letters. Loop has 3 letters. [2022-02-21 03:23:52,704 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:23:52,704 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 129 states and 180 transitions. cyclomatic complexity: 57 Stem has 30 letters. Loop has 3 letters. [2022-02-21 03:23:52,704 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:23:52,704 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 112 states and 162 transitions. cyclomatic complexity: 56 Stem has 30 letters. Loop has 3 letters. [2022-02-21 03:23:52,704 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:23:52,705 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 5 states, 4 states have (on average 3.25) internal successors, (13), 4 states have internal predecessors, (13), 3 states have call successors, (8), 3 states have call predecessors, (8), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Stem has 30 letters. Loop has 3 letters. [2022-02-21 03:23:52,705 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:23:52,705 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 129 states and 180 transitions. cyclomatic complexity: 57 Stem has 30 letters. Loop has 3 letters. [2022-02-21 03:23:52,705 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:23:52,705 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 112 states and 162 transitions. cyclomatic complexity: 56 Stem has 129 letters. Loop has 129 letters. [2022-02-21 03:23:52,705 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:23:52,705 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 5 states, 4 states have (on average 3.25) internal successors, (13), 4 states have internal predecessors, (13), 3 states have call successors, (8), 3 states have call predecessors, (8), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Stem has 129 letters. Loop has 129 letters. [2022-02-21 03:23:52,705 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:23:52,705 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 129 states and 180 transitions. cyclomatic complexity: 57 Stem has 129 letters. Loop has 129 letters. [2022-02-21 03:23:52,705 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:23:52,705 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 112 states and 162 transitions. cyclomatic complexity: 56 Stem has 112 letters. Loop has 112 letters. [2022-02-21 03:23:52,705 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:23:52,705 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 5 states, 4 states have (on average 3.25) internal successors, (13), 4 states have internal predecessors, (13), 3 states have call successors, (8), 3 states have call predecessors, (8), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Stem has 112 letters. Loop has 112 letters. [2022-02-21 03:23:52,705 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:23:52,705 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 129 states and 180 transitions. cyclomatic complexity: 57 Stem has 112 letters. Loop has 112 letters. [2022-02-21 03:23:52,705 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:23:52,705 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 112 states and 162 transitions. cyclomatic complexity: 56 Stem has 4 letters. Loop has 4 letters. [2022-02-21 03:23:52,705 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:23:52,705 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 5 states, 4 states have (on average 3.25) internal successors, (13), 4 states have internal predecessors, (13), 3 states have call successors, (8), 3 states have call predecessors, (8), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Stem has 4 letters. Loop has 4 letters. [2022-02-21 03:23:52,705 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:23:52,705 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 129 states and 180 transitions. cyclomatic complexity: 57 Stem has 4 letters. Loop has 4 letters. [2022-02-21 03:23:52,705 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:23:52,705 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 112 states and 162 transitions. cyclomatic complexity: 56 Stem has 32 letters. Loop has 3 letters. [2022-02-21 03:23:52,705 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:23:52,705 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 5 states, 4 states have (on average 3.25) internal successors, (13), 4 states have internal predecessors, (13), 3 states have call successors, (8), 3 states have call predecessors, (8), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Stem has 32 letters. Loop has 3 letters. [2022-02-21 03:23:52,705 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:23:52,705 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 129 states and 180 transitions. cyclomatic complexity: 57 Stem has 32 letters. Loop has 3 letters. [2022-02-21 03:23:52,706 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:23:52,706 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 112 states and 162 transitions. cyclomatic complexity: 56 Stem has 53 letters. Loop has 45 letters. [2022-02-21 03:23:52,706 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:23:52,706 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 5 states, 4 states have (on average 3.25) internal successors, (13), 4 states have internal predecessors, (13), 3 states have call successors, (8), 3 states have call predecessors, (8), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Stem has 53 letters. Loop has 45 letters. [2022-02-21 03:23:52,706 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:23:52,706 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 129 states and 180 transitions. cyclomatic complexity: 57 Stem has 53 letters. Loop has 45 letters. [2022-02-21 03:23:52,706 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:23:52,706 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 112 states and 162 transitions. cyclomatic complexity: 56 Stem has 30 letters. Loop has 3 letters. [2022-02-21 03:23:52,706 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:23:52,706 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 5 states, 4 states have (on average 3.25) internal successors, (13), 4 states have internal predecessors, (13), 3 states have call successors, (8), 3 states have call predecessors, (8), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Stem has 30 letters. Loop has 3 letters. [2022-02-21 03:23:52,706 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:23:52,706 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 129 states and 180 transitions. cyclomatic complexity: 57 Stem has 30 letters. Loop has 3 letters. [2022-02-21 03:23:52,707 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:23:52,707 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 112 states and 162 transitions. cyclomatic complexity: 56 Stem has 31 letters. Loop has 3 letters. [2022-02-21 03:23:52,707 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:23:52,707 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 5 states, 4 states have (on average 3.25) internal successors, (13), 4 states have internal predecessors, (13), 3 states have call successors, (8), 3 states have call predecessors, (8), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Stem has 31 letters. Loop has 3 letters. [2022-02-21 03:23:52,707 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:23:52,707 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 129 states and 180 transitions. cyclomatic complexity: 57 Stem has 31 letters. Loop has 3 letters. [2022-02-21 03:23:52,707 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:23:52,707 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 112 states and 162 transitions. cyclomatic complexity: 56 Stem has 32 letters. Loop has 24 letters. [2022-02-21 03:23:52,707 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:23:52,707 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 5 states, 4 states have (on average 3.25) internal successors, (13), 4 states have internal predecessors, (13), 3 states have call successors, (8), 3 states have call predecessors, (8), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Stem has 32 letters. Loop has 24 letters. [2022-02-21 03:23:52,707 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:23:52,707 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 129 states and 180 transitions. cyclomatic complexity: 57 Stem has 32 letters. Loop has 24 letters. [2022-02-21 03:23:52,707 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:23:52,707 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 112 states and 162 transitions. cyclomatic complexity: 56 Stem has 32 letters. Loop has 72 letters. [2022-02-21 03:23:52,708 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:23:52,708 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 5 states, 4 states have (on average 3.25) internal successors, (13), 4 states have internal predecessors, (13), 3 states have call successors, (8), 3 states have call predecessors, (8), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Stem has 32 letters. Loop has 72 letters. [2022-02-21 03:23:52,708 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:23:52,708 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 129 states and 180 transitions. cyclomatic complexity: 57 Stem has 32 letters. Loop has 72 letters. [2022-02-21 03:23:52,708 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:23:52,708 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 112 states and 162 transitions. cyclomatic complexity: 56 Stem has 32 letters. Loop has 24 letters. [2022-02-21 03:23:52,708 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:23:52,708 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 5 states, 4 states have (on average 3.25) internal successors, (13), 4 states have internal predecessors, (13), 3 states have call successors, (8), 3 states have call predecessors, (8), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Stem has 32 letters. Loop has 24 letters. [2022-02-21 03:23:52,708 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:23:52,708 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 129 states and 180 transitions. cyclomatic complexity: 57 Stem has 32 letters. Loop has 24 letters. [2022-02-21 03:23:52,708 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:23:52,708 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 112 states and 162 transitions. cyclomatic complexity: 56 Stem has 53 letters. Loop has 93 letters. [2022-02-21 03:23:52,708 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:23:52,708 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 5 states, 4 states have (on average 3.25) internal successors, (13), 4 states have internal predecessors, (13), 3 states have call successors, (8), 3 states have call predecessors, (8), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Stem has 53 letters. Loop has 93 letters. [2022-02-21 03:23:52,708 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:23:52,708 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 129 states and 180 transitions. cyclomatic complexity: 57 Stem has 53 letters. Loop has 93 letters. [2022-02-21 03:23:52,708 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:23:52,709 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 112 states and 162 transitions. cyclomatic complexity: 56 Stem has 53 letters. Loop has 45 letters. [2022-02-21 03:23:52,709 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:23:52,709 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 5 states, 4 states have (on average 3.25) internal successors, (13), 4 states have internal predecessors, (13), 3 states have call successors, (8), 3 states have call predecessors, (8), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Stem has 53 letters. Loop has 45 letters. [2022-02-21 03:23:52,709 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:23:52,709 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 129 states and 180 transitions. cyclomatic complexity: 57 Stem has 53 letters. Loop has 45 letters. [2022-02-21 03:23:52,709 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:23:52,709 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 112 states and 162 transitions. cyclomatic complexity: 56 Stem has 77 letters. Loop has 72 letters. [2022-02-21 03:23:52,709 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:23:52,709 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 5 states, 4 states have (on average 3.25) internal successors, (13), 4 states have internal predecessors, (13), 3 states have call successors, (8), 3 states have call predecessors, (8), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Stem has 77 letters. Loop has 72 letters. [2022-02-21 03:23:52,709 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:23:52,709 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 129 states and 180 transitions. cyclomatic complexity: 57 Stem has 77 letters. Loop has 72 letters. [2022-02-21 03:23:52,709 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:23:52,709 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 112 states and 162 transitions. cyclomatic complexity: 56 Stem has 74 letters. Loop has 72 letters. [2022-02-21 03:23:52,709 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:23:52,709 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 5 states, 4 states have (on average 3.25) internal successors, (13), 4 states have internal predecessors, (13), 3 states have call successors, (8), 3 states have call predecessors, (8), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Stem has 74 letters. Loop has 72 letters. [2022-02-21 03:23:52,709 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:23:52,710 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 129 states and 180 transitions. cyclomatic complexity: 57 Stem has 74 letters. Loop has 72 letters. [2022-02-21 03:23:52,710 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:23:52,710 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 112 states and 162 transitions. cyclomatic complexity: 56 Stem has 76 letters. Loop has 72 letters. [2022-02-21 03:23:52,710 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:23:52,710 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 5 states, 4 states have (on average 3.25) internal successors, (13), 4 states have internal predecessors, (13), 3 states have call successors, (8), 3 states have call predecessors, (8), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Stem has 76 letters. Loop has 72 letters. [2022-02-21 03:23:52,710 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:23:52,710 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 129 states and 180 transitions. cyclomatic complexity: 57 Stem has 76 letters. Loop has 72 letters. [2022-02-21 03:23:52,710 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:23:52,710 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 112 states and 162 transitions. cyclomatic complexity: 56 Stem has 75 letters. Loop has 72 letters. [2022-02-21 03:23:52,710 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:23:52,710 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 5 states, 4 states have (on average 3.25) internal successors, (13), 4 states have internal predecessors, (13), 3 states have call successors, (8), 3 states have call predecessors, (8), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Stem has 75 letters. Loop has 72 letters. [2022-02-21 03:23:52,710 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:23:52,710 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 129 states and 180 transitions. cyclomatic complexity: 57 Stem has 75 letters. Loop has 72 letters. [2022-02-21 03:23:52,710 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:23:52,710 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 112 states and 162 transitions. cyclomatic complexity: 56 Stem has 74 letters. Loop has 72 letters. [2022-02-21 03:23:52,711 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:23:52,711 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 5 states, 4 states have (on average 3.25) internal successors, (13), 4 states have internal predecessors, (13), 3 states have call successors, (8), 3 states have call predecessors, (8), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Stem has 74 letters. Loop has 72 letters. [2022-02-21 03:23:52,711 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:23:52,711 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 129 states and 180 transitions. cyclomatic complexity: 57 Stem has 74 letters. Loop has 72 letters. [2022-02-21 03:23:52,711 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:23:52,711 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 112 states and 162 transitions. cyclomatic complexity: 56 Stem has 32 letters. Loop has 3 letters. [2022-02-21 03:23:52,711 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:23:52,711 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 5 states, 4 states have (on average 3.25) internal successors, (13), 4 states have internal predecessors, (13), 3 states have call successors, (8), 3 states have call predecessors, (8), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Stem has 32 letters. Loop has 3 letters. [2022-02-21 03:23:52,711 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:23:52,711 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 129 states and 180 transitions. cyclomatic complexity: 57 Stem has 32 letters. Loop has 3 letters. [2022-02-21 03:23:52,711 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:23:52,711 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 112 states and 162 transitions. cyclomatic complexity: 56 Stem has 32 letters. Loop has 24 letters. [2022-02-21 03:23:52,711 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:23:52,711 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 5 states, 4 states have (on average 3.25) internal successors, (13), 4 states have internal predecessors, (13), 3 states have call successors, (8), 3 states have call predecessors, (8), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Stem has 32 letters. Loop has 24 letters. [2022-02-21 03:23:52,711 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:23:52,711 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 129 states and 180 transitions. cyclomatic complexity: 57 Stem has 32 letters. Loop has 24 letters. [2022-02-21 03:23:52,711 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:23:52,711 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 112 states and 162 transitions. cyclomatic complexity: 56 Stem has 30 letters. Loop has 3 letters. [2022-02-21 03:23:52,711 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:23:52,712 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 5 states, 4 states have (on average 3.25) internal successors, (13), 4 states have internal predecessors, (13), 3 states have call successors, (8), 3 states have call predecessors, (8), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Stem has 30 letters. Loop has 3 letters. [2022-02-21 03:23:52,712 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:23:52,712 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 129 states and 180 transitions. cyclomatic complexity: 57 Stem has 30 letters. Loop has 3 letters. [2022-02-21 03:23:52,712 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:23:52,712 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 112 states and 162 transitions. cyclomatic complexity: 56 Stem has 53 letters. Loop has 45 letters. [2022-02-21 03:23:52,712 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:23:52,712 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 5 states, 4 states have (on average 3.25) internal successors, (13), 4 states have internal predecessors, (13), 3 states have call successors, (8), 3 states have call predecessors, (8), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Stem has 53 letters. Loop has 45 letters. [2022-02-21 03:23:52,712 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:23:52,712 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 129 states and 180 transitions. cyclomatic complexity: 57 Stem has 53 letters. Loop has 45 letters. [2022-02-21 03:23:52,712 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:23:52,712 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 112 states and 162 transitions. cyclomatic complexity: 56 Stem has 31 letters. Loop has 3 letters. [2022-02-21 03:23:52,712 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:23:52,712 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 5 states, 4 states have (on average 3.25) internal successors, (13), 4 states have internal predecessors, (13), 3 states have call successors, (8), 3 states have call predecessors, (8), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Stem has 31 letters. Loop has 3 letters. [2022-02-21 03:23:52,712 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:23:52,712 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 129 states and 180 transitions. cyclomatic complexity: 57 Stem has 31 letters. Loop has 3 letters. [2022-02-21 03:23:52,712 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:23:52,712 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 112 states and 162 transitions. cyclomatic complexity: 56 Stem has 32 letters. Loop has 72 letters. [2022-02-21 03:23:52,712 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:23:52,712 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 5 states, 4 states have (on average 3.25) internal successors, (13), 4 states have internal predecessors, (13), 3 states have call successors, (8), 3 states have call predecessors, (8), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Stem has 32 letters. Loop has 72 letters. [2022-02-21 03:23:52,712 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:23:52,712 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 129 states and 180 transitions. cyclomatic complexity: 57 Stem has 32 letters. Loop has 72 letters. [2022-02-21 03:23:52,713 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:23:52,713 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 112 states and 162 transitions. cyclomatic complexity: 56 Stem has 32 letters. Loop has 24 letters. [2022-02-21 03:23:52,713 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:23:52,713 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 5 states, 4 states have (on average 3.25) internal successors, (13), 4 states have internal predecessors, (13), 3 states have call successors, (8), 3 states have call predecessors, (8), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Stem has 32 letters. Loop has 24 letters. [2022-02-21 03:23:52,713 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:23:52,713 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 129 states and 180 transitions. cyclomatic complexity: 57 Stem has 32 letters. Loop has 24 letters. [2022-02-21 03:23:52,713 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:23:52,713 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 112 states and 162 transitions. cyclomatic complexity: 56 Stem has 53 letters. Loop has 45 letters. [2022-02-21 03:23:52,713 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:23:52,713 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 5 states, 4 states have (on average 3.25) internal successors, (13), 4 states have internal predecessors, (13), 3 states have call successors, (8), 3 states have call predecessors, (8), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Stem has 53 letters. Loop has 45 letters. [2022-02-21 03:23:52,713 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:23:52,713 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 129 states and 180 transitions. cyclomatic complexity: 57 Stem has 53 letters. Loop has 45 letters. [2022-02-21 03:23:52,713 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:23:52,713 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 112 states and 162 transitions. cyclomatic complexity: 56 Stem has 53 letters. Loop has 93 letters. [2022-02-21 03:23:52,713 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:23:52,713 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 5 states, 4 states have (on average 3.25) internal successors, (13), 4 states have internal predecessors, (13), 3 states have call successors, (8), 3 states have call predecessors, (8), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Stem has 53 letters. Loop has 93 letters. [2022-02-21 03:23:52,713 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:23:52,713 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 129 states and 180 transitions. cyclomatic complexity: 57 Stem has 53 letters. Loop has 93 letters. [2022-02-21 03:23:52,714 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:23:52,714 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 112 states and 162 transitions. cyclomatic complexity: 56 Stem has 74 letters. Loop has 72 letters. [2022-02-21 03:23:52,714 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:23:52,714 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 5 states, 4 states have (on average 3.25) internal successors, (13), 4 states have internal predecessors, (13), 3 states have call successors, (8), 3 states have call predecessors, (8), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Stem has 74 letters. Loop has 72 letters. [2022-02-21 03:23:52,714 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:23:52,714 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 129 states and 180 transitions. cyclomatic complexity: 57 Stem has 74 letters. Loop has 72 letters. [2022-02-21 03:23:52,714 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:23:52,714 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 112 states and 162 transitions. cyclomatic complexity: 56 Stem has 75 letters. Loop has 72 letters. [2022-02-21 03:23:52,714 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:23:52,714 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 5 states, 4 states have (on average 3.25) internal successors, (13), 4 states have internal predecessors, (13), 3 states have call successors, (8), 3 states have call predecessors, (8), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Stem has 75 letters. Loop has 72 letters. [2022-02-21 03:23:52,714 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:23:52,714 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 129 states and 180 transitions. cyclomatic complexity: 57 Stem has 75 letters. Loop has 72 letters. [2022-02-21 03:23:52,714 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:23:52,714 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 112 states and 162 transitions. cyclomatic complexity: 56 Stem has 76 letters. Loop has 72 letters. [2022-02-21 03:23:52,715 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:23:52,715 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 5 states, 4 states have (on average 3.25) internal successors, (13), 4 states have internal predecessors, (13), 3 states have call successors, (8), 3 states have call predecessors, (8), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Stem has 76 letters. Loop has 72 letters. [2022-02-21 03:23:52,715 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:23:52,715 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 129 states and 180 transitions. cyclomatic complexity: 57 Stem has 76 letters. Loop has 72 letters. [2022-02-21 03:23:52,715 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:23:52,715 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 112 states and 162 transitions. cyclomatic complexity: 56 Stem has 77 letters. Loop has 72 letters. [2022-02-21 03:23:52,715 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:23:52,715 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 5 states, 4 states have (on average 3.25) internal successors, (13), 4 states have internal predecessors, (13), 3 states have call successors, (8), 3 states have call predecessors, (8), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Stem has 77 letters. Loop has 72 letters. [2022-02-21 03:23:52,715 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:23:52,715 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 129 states and 180 transitions. cyclomatic complexity: 57 Stem has 77 letters. Loop has 72 letters. [2022-02-21 03:23:52,715 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:23:52,715 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 112 states and 162 transitions. cyclomatic complexity: 56 Stem has 74 letters. Loop has 72 letters. [2022-02-21 03:23:52,715 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:23:52,715 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 5 states, 4 states have (on average 3.25) internal successors, (13), 4 states have internal predecessors, (13), 3 states have call successors, (8), 3 states have call predecessors, (8), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Stem has 74 letters. Loop has 72 letters. [2022-02-21 03:23:52,715 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:23:52,716 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 129 states and 180 transitions. cyclomatic complexity: 57 Stem has 74 letters. Loop has 72 letters. [2022-02-21 03:23:52,716 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:23:52,716 INFO L161 tractBuchiDifference]: Finished testing correctness of buchiDifferenceNCSBLazy3 [2022-02-21 03:23:52,716 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 4 states have (on average 3.25) internal successors, (13), 4 states have internal predecessors, (13), 3 states have call successors, (8), 3 states have call predecessors, (8), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2022-02-21 03:23:52,716 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 16 transitions. [2022-02-21 03:23:52,716 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 16 transitions. Stem has 30 letters. Loop has 3 letters. [2022-02-21 03:23:52,716 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:23:52,716 INFO L634 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2022-02-21 03:23:52,724 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:23:52,752 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:23:52,753 INFO L263 TraceCheckSpWp]: Trace formula consists of 266 conjuncts, 16 conjunts are in the unsatisfiable core [2022-02-21 03:23:52,763 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:23:52,764 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-21 03:23:52,961 INFO L290 TraceCheckUtils]: 0: Hoare triple {7537#unseeded} assume { :begin_inline_ULTIMATE.init } true; {7537#unseeded} is VALID [2022-02-21 03:23:52,961 INFO L290 TraceCheckUtils]: 1: Hoare triple {7537#unseeded} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet5#1, main_#t~ret6#1, main_~x~0#1;main_~x~0#1 := main_#t~nondet5#1;havoc main_#t~nondet5#1; {7537#unseeded} is VALID [2022-02-21 03:23:52,962 INFO L272 TraceCheckUtils]: 2: Hoare triple {7537#unseeded} call main_#t~ret6#1 := rec2(main_~x~0#1); {7537#unseeded} is VALID [2022-02-21 03:23:52,962 INFO L290 TraceCheckUtils]: 3: Hoare triple {7537#unseeded} ~j := #in~j; {7537#unseeded} is VALID [2022-02-21 03:23:52,962 INFO L290 TraceCheckUtils]: 4: Hoare triple {7537#unseeded} assume !(~j <= 0); {7537#unseeded} is VALID [2022-02-21 03:23:52,962 INFO L272 TraceCheckUtils]: 5: Hoare triple {7537#unseeded} call #t~ret3 := rec1(~j); {7537#unseeded} is VALID [2022-02-21 03:23:52,963 INFO L290 TraceCheckUtils]: 6: Hoare triple {7537#unseeded} ~i := #in~i; {7537#unseeded} is VALID [2022-02-21 03:23:52,963 INFO L290 TraceCheckUtils]: 7: Hoare triple {7537#unseeded} assume !(~i <= 0); {7537#unseeded} is VALID [2022-02-21 03:23:52,963 INFO L272 TraceCheckUtils]: 8: Hoare triple {7537#unseeded} call #t~ret0 := rec1(~i - 2); {8061#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2022-02-21 03:23:52,964 INFO L290 TraceCheckUtils]: 9: Hoare triple {8061#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} ~i := #in~i; {8061#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2022-02-21 03:23:52,964 INFO L290 TraceCheckUtils]: 10: Hoare triple {8061#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} assume !(~i <= 0); {8061#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2022-02-21 03:23:52,964 INFO L272 TraceCheckUtils]: 11: Hoare triple {8061#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} call #t~ret0 := rec1(~i - 2); {8061#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2022-02-21 03:23:52,965 INFO L290 TraceCheckUtils]: 12: Hoare triple {8061#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} ~i := #in~i; {8061#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2022-02-21 03:23:52,965 INFO L290 TraceCheckUtils]: 13: Hoare triple {8061#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} assume ~i <= 0;#res := 0; {8061#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2022-02-21 03:23:52,965 INFO L290 TraceCheckUtils]: 14: Hoare triple {8061#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} assume true; {8061#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2022-02-21 03:23:52,966 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {8061#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} {8061#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} #28#return; {8061#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2022-02-21 03:23:52,967 INFO L272 TraceCheckUtils]: 16: Hoare triple {8061#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} call #t~ret1 := rec1(#t~ret0 - 1); {8061#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2022-02-21 03:23:52,967 INFO L290 TraceCheckUtils]: 17: Hoare triple {8061#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} ~i := #in~i; {8061#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2022-02-21 03:23:52,967 INFO L290 TraceCheckUtils]: 18: Hoare triple {8061#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} assume ~i <= 0;#res := 0; {8061#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2022-02-21 03:23:52,967 INFO L290 TraceCheckUtils]: 19: Hoare triple {8061#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} assume true; {8061#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2022-02-21 03:23:52,968 INFO L284 TraceCheckUtils]: 20: Hoare quadruple {8061#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} {8061#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} #30#return; {8061#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2022-02-21 03:23:52,969 INFO L272 TraceCheckUtils]: 21: Hoare triple {8061#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} call #t~ret2 := rec1(#t~ret1); {8061#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2022-02-21 03:23:52,969 INFO L290 TraceCheckUtils]: 22: Hoare triple {8061#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} ~i := #in~i; {8061#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2022-02-21 03:23:52,969 INFO L290 TraceCheckUtils]: 23: Hoare triple {8061#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} assume ~i <= 0;#res := 0; {8061#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2022-02-21 03:23:52,970 INFO L290 TraceCheckUtils]: 24: Hoare triple {8061#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} assume true; {8061#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2022-02-21 03:23:52,970 INFO L284 TraceCheckUtils]: 25: Hoare quadruple {8061#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} {8061#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} #32#return; {8061#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2022-02-21 03:23:52,971 INFO L290 TraceCheckUtils]: 26: Hoare triple {8061#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} #res := 1 + #t~ret2;havoc #t~ret0;havoc #t~ret1;havoc #t~ret2; {8061#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2022-02-21 03:23:52,971 INFO L290 TraceCheckUtils]: 27: Hoare triple {8061#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} assume true; {8061#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2022-02-21 03:23:52,971 INFO L284 TraceCheckUtils]: 28: Hoare quadruple {8061#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} {7537#unseeded} #28#return; {7537#unseeded} is VALID [2022-02-21 03:23:52,972 INFO L272 TraceCheckUtils]: 29: Hoare triple {7537#unseeded} call #t~ret1 := rec1(#t~ret0 - 1); {7537#unseeded} is VALID [2022-02-21 03:23:52,977 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:23:52,977 INFO L263 TraceCheckSpWp]: Trace formula consists of 37 conjuncts, 7 conjunts are in the unsatisfiable core [2022-02-21 03:23:52,981 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:23:52,981 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-21 03:23:53,009 INFO L290 TraceCheckUtils]: 0: Hoare triple {7540#(>= oldRank0 |rec1_#in~i|)} ~i := #in~i; {8125#(<= rec1_~i oldRank0)} is VALID [2022-02-21 03:23:53,009 INFO L290 TraceCheckUtils]: 1: Hoare triple {8125#(<= rec1_~i oldRank0)} assume !(~i <= 0); {8129#(and (not (<= rec1_~i 0)) (<= rec1_~i oldRank0))} is VALID [2022-02-21 03:23:53,010 INFO L272 TraceCheckUtils]: 2: Hoare triple {8129#(and (not (<= rec1_~i 0)) (<= rec1_~i oldRank0))} call #t~ret0 := rec1(~i - 2); {7550#(or (and (>= oldRank0 0) (> oldRank0 |rec1_#in~i|)) unseeded)} is VALID [2022-02-21 03:23:53,010 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-21 03:23:53,011 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 5 states, 4 states have (on average 3.25) internal successors, (13), 4 states have internal predecessors, (13), 3 states have call successors, (8), 3 states have call predecessors, (8), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2022-02-21 03:23:53,032 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 25 edges. 25 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-21 03:23:53,032 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 5 states, 4 states have (on average 3.25) internal successors, (13), 4 states have internal predecessors, (13), 3 states have call successors, (8), 3 states have call predecessors, (8), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Stem has 30 letters. Loop has 3 letters. [2022-02-21 03:23:53,032 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:23:53,032 INFO L152 lantAutomatonBouncer]: Defining Buchi interpolant automaton with scrooge nondeterminism in stemwith honda bouncer for stem and without honda bouncer for loop.2 stem predicates 3 loop predicates [2022-02-21 03:23:53,032 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 112 states and 162 transitions. cyclomatic complexity: 56 Second operand has 5 states, 4 states have (on average 3.25) internal successors, (13), 4 states have internal predecessors, (13), 3 states have call successors, (8), 3 states have call predecessors, (8), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2022-02-21 03:23:53,167 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 112 states and 162 transitions. cyclomatic complexity: 56. Second operand has 5 states, 4 states have (on average 3.25) internal successors, (13), 4 states have internal predecessors, (13), 3 states have call successors, (8), 3 states have call predecessors, (8), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Result 157 states and 219 transitions. Complement of second has 13 states. [2022-02-21 03:23:53,168 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 5 states 2 stem states 2 non-accepting loop states 1 accepting loop states [2022-02-21 03:23:53,168 INFO L123 tractBuchiDifference]: Start testing correctness of buchiDifferenceNCSBLazy3 [2022-02-21 03:23:53,168 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 112 states and 162 transitions. cyclomatic complexity: 56 [2022-02-21 03:23:53,168 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 03:23:53,168 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 03:23:53,168 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 5 states, 4 states have (on average 3.25) internal successors, (13), 4 states have internal predecessors, (13), 3 states have call successors, (8), 3 states have call predecessors, (8), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2022-02-21 03:23:53,192 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2022-02-21 03:23:53,192 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 03:23:53,192 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 03:23:53,193 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 157 states and 219 transitions. [2022-02-21 03:23:53,194 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 15 [2022-02-21 03:23:53,194 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 03:23:53,194 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 03:23:53,194 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 112 states and 162 transitions. cyclomatic complexity: 56 [2022-02-21 03:23:53,194 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 14 examples of accepted words. [2022-02-21 03:23:53,194 INFO L70 LassoExtractor]: Start lassoExtractor. Operand has 5 states, 4 states have (on average 3.25) internal successors, (13), 4 states have internal predecessors, (13), 3 states have call successors, (8), 3 states have call predecessors, (8), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2022-02-21 03:23:53,195 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2022-02-21 03:23:53,195 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 1 examples of accepted words. [2022-02-21 03:23:53,195 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 157 states and 219 transitions. cyclomatic complexity: 68 [2022-02-21 03:23:53,198 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 19 examples of accepted words. [2022-02-21 03:23:53,198 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 112 states and 162 transitions. cyclomatic complexity: 56 Stem has 30 letters. Loop has 3 letters. [2022-02-21 03:23:53,199 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:23:53,199 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 5 states, 4 states have (on average 3.25) internal successors, (13), 4 states have internal predecessors, (13), 3 states have call successors, (8), 3 states have call predecessors, (8), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Stem has 30 letters. Loop has 3 letters. [2022-02-21 03:23:53,199 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:23:53,199 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 157 states and 219 transitions. cyclomatic complexity: 68 Stem has 30 letters. Loop has 3 letters. [2022-02-21 03:23:53,199 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:23:53,199 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 112 states and 162 transitions. cyclomatic complexity: 56 Stem has 2 letters. Loop has 3 letters. [2022-02-21 03:23:53,199 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:23:53,199 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 5 states, 4 states have (on average 3.25) internal successors, (13), 4 states have internal predecessors, (13), 3 states have call successors, (8), 3 states have call predecessors, (8), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Stem has 2 letters. Loop has 3 letters. [2022-02-21 03:23:53,199 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:23:53,199 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 157 states and 219 transitions. cyclomatic complexity: 68 Stem has 2 letters. Loop has 3 letters. [2022-02-21 03:23:53,200 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:23:53,200 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 112 states and 162 transitions. cyclomatic complexity: 56 Stem has 30 letters. Loop has 24 letters. [2022-02-21 03:23:53,200 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:23:53,200 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 5 states, 4 states have (on average 3.25) internal successors, (13), 4 states have internal predecessors, (13), 3 states have call successors, (8), 3 states have call predecessors, (8), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Stem has 30 letters. Loop has 24 letters. [2022-02-21 03:23:53,200 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:23:53,200 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 157 states and 219 transitions. cyclomatic complexity: 68 Stem has 30 letters. Loop has 24 letters. [2022-02-21 03:23:53,200 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:23:53,200 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 112 states and 162 transitions. cyclomatic complexity: 56 Stem has 157 letters. Loop has 157 letters. [2022-02-21 03:23:53,200 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:23:53,201 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 5 states, 4 states have (on average 3.25) internal successors, (13), 4 states have internal predecessors, (13), 3 states have call successors, (8), 3 states have call predecessors, (8), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Stem has 157 letters. Loop has 157 letters. [2022-02-21 03:23:53,201 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:23:53,201 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 157 states and 219 transitions. cyclomatic complexity: 68 Stem has 157 letters. Loop has 157 letters. [2022-02-21 03:23:53,201 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:23:53,201 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 112 states and 162 transitions. cyclomatic complexity: 56 Stem has 112 letters. Loop has 112 letters. [2022-02-21 03:23:53,201 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:23:53,201 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 5 states, 4 states have (on average 3.25) internal successors, (13), 4 states have internal predecessors, (13), 3 states have call successors, (8), 3 states have call predecessors, (8), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Stem has 112 letters. Loop has 112 letters. [2022-02-21 03:23:53,201 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:23:53,201 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 157 states and 219 transitions. cyclomatic complexity: 68 Stem has 112 letters. Loop has 112 letters. [2022-02-21 03:23:53,201 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:23:53,201 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 112 states and 162 transitions. cyclomatic complexity: 56 Stem has 5 letters. Loop has 5 letters. [2022-02-21 03:23:53,201 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:23:53,202 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 5 states, 4 states have (on average 3.25) internal successors, (13), 4 states have internal predecessors, (13), 3 states have call successors, (8), 3 states have call predecessors, (8), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Stem has 5 letters. Loop has 5 letters. [2022-02-21 03:23:53,202 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:23:53,202 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 157 states and 219 transitions. cyclomatic complexity: 68 Stem has 5 letters. Loop has 5 letters. [2022-02-21 03:23:53,202 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:23:53,202 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 112 states and 162 transitions. cyclomatic complexity: 56 Stem has 32 letters. Loop has 3 letters. [2022-02-21 03:23:53,202 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:23:53,202 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 5 states, 4 states have (on average 3.25) internal successors, (13), 4 states have internal predecessors, (13), 3 states have call successors, (8), 3 states have call predecessors, (8), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Stem has 32 letters. Loop has 3 letters. [2022-02-21 03:23:53,202 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:23:53,202 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 157 states and 219 transitions. cyclomatic complexity: 68 Stem has 32 letters. Loop has 3 letters. [2022-02-21 03:23:53,202 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:23:53,202 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 112 states and 162 transitions. cyclomatic complexity: 56 Stem has 53 letters. Loop has 45 letters. [2022-02-21 03:23:53,203 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:23:53,203 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 5 states, 4 states have (on average 3.25) internal successors, (13), 4 states have internal predecessors, (13), 3 states have call successors, (8), 3 states have call predecessors, (8), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Stem has 53 letters. Loop has 45 letters. [2022-02-21 03:23:53,203 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:23:53,203 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 157 states and 219 transitions. cyclomatic complexity: 68 Stem has 53 letters. Loop has 45 letters. [2022-02-21 03:23:53,203 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:23:53,203 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 112 states and 162 transitions. cyclomatic complexity: 56 Stem has 30 letters. Loop has 3 letters. [2022-02-21 03:23:53,203 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:23:53,204 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 5 states, 4 states have (on average 3.25) internal successors, (13), 4 states have internal predecessors, (13), 3 states have call successors, (8), 3 states have call predecessors, (8), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Stem has 30 letters. Loop has 3 letters. [2022-02-21 03:23:53,204 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:23:53,204 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 157 states and 219 transitions. cyclomatic complexity: 68 Stem has 30 letters. Loop has 3 letters. [2022-02-21 03:23:53,204 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:23:53,204 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 112 states and 162 transitions. cyclomatic complexity: 56 Stem has 31 letters. Loop has 3 letters. [2022-02-21 03:23:53,204 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:23:53,204 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 5 states, 4 states have (on average 3.25) internal successors, (13), 4 states have internal predecessors, (13), 3 states have call successors, (8), 3 states have call predecessors, (8), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Stem has 31 letters. Loop has 3 letters. [2022-02-21 03:23:53,204 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:23:53,204 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 157 states and 219 transitions. cyclomatic complexity: 68 Stem has 31 letters. Loop has 3 letters. [2022-02-21 03:23:53,204 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:23:53,205 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 112 states and 162 transitions. cyclomatic complexity: 56 Stem has 32 letters. Loop has 24 letters. [2022-02-21 03:23:53,205 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:23:53,205 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 5 states, 4 states have (on average 3.25) internal successors, (13), 4 states have internal predecessors, (13), 3 states have call successors, (8), 3 states have call predecessors, (8), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Stem has 32 letters. Loop has 24 letters. [2022-02-21 03:23:53,205 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:23:53,205 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 157 states and 219 transitions. cyclomatic complexity: 68 Stem has 32 letters. Loop has 24 letters. [2022-02-21 03:23:53,205 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:23:53,205 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 112 states and 162 transitions. cyclomatic complexity: 56 Stem has 32 letters. Loop has 72 letters. [2022-02-21 03:23:53,205 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:23:53,206 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 5 states, 4 states have (on average 3.25) internal successors, (13), 4 states have internal predecessors, (13), 3 states have call successors, (8), 3 states have call predecessors, (8), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Stem has 32 letters. Loop has 72 letters. [2022-02-21 03:23:53,206 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:23:53,206 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 157 states and 219 transitions. cyclomatic complexity: 68 Stem has 32 letters. Loop has 72 letters. [2022-02-21 03:23:53,206 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:23:53,206 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 112 states and 162 transitions. cyclomatic complexity: 56 Stem has 32 letters. Loop has 24 letters. [2022-02-21 03:23:53,206 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:23:53,206 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 5 states, 4 states have (on average 3.25) internal successors, (13), 4 states have internal predecessors, (13), 3 states have call successors, (8), 3 states have call predecessors, (8), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Stem has 32 letters. Loop has 24 letters. [2022-02-21 03:23:53,206 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:23:53,207 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 157 states and 219 transitions. cyclomatic complexity: 68 Stem has 32 letters. Loop has 24 letters. [2022-02-21 03:23:53,207 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:23:53,207 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 112 states and 162 transitions. cyclomatic complexity: 56 Stem has 53 letters. Loop has 93 letters. [2022-02-21 03:23:53,207 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:23:53,207 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 5 states, 4 states have (on average 3.25) internal successors, (13), 4 states have internal predecessors, (13), 3 states have call successors, (8), 3 states have call predecessors, (8), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Stem has 53 letters. Loop has 93 letters. [2022-02-21 03:23:53,207 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:23:53,207 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 157 states and 219 transitions. cyclomatic complexity: 68 Stem has 53 letters. Loop has 93 letters. [2022-02-21 03:23:53,208 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:23:53,208 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 112 states and 162 transitions. cyclomatic complexity: 56 Stem has 53 letters. Loop has 45 letters. [2022-02-21 03:23:53,208 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:23:53,208 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 5 states, 4 states have (on average 3.25) internal successors, (13), 4 states have internal predecessors, (13), 3 states have call successors, (8), 3 states have call predecessors, (8), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Stem has 53 letters. Loop has 45 letters. [2022-02-21 03:23:53,208 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:23:53,208 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 157 states and 219 transitions. cyclomatic complexity: 68 Stem has 53 letters. Loop has 45 letters. [2022-02-21 03:23:53,208 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:23:53,208 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 112 states and 162 transitions. cyclomatic complexity: 56 Stem has 77 letters. Loop has 72 letters. [2022-02-21 03:23:53,209 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:23:53,209 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 5 states, 4 states have (on average 3.25) internal successors, (13), 4 states have internal predecessors, (13), 3 states have call successors, (8), 3 states have call predecessors, (8), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Stem has 77 letters. Loop has 72 letters. [2022-02-21 03:23:53,209 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:23:53,209 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 157 states and 219 transitions. cyclomatic complexity: 68 Stem has 77 letters. Loop has 72 letters. [2022-02-21 03:23:53,209 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:23:53,209 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 112 states and 162 transitions. cyclomatic complexity: 56 Stem has 74 letters. Loop has 72 letters. [2022-02-21 03:23:53,210 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:23:53,210 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 5 states, 4 states have (on average 3.25) internal successors, (13), 4 states have internal predecessors, (13), 3 states have call successors, (8), 3 states have call predecessors, (8), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Stem has 74 letters. Loop has 72 letters. [2022-02-21 03:23:53,210 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:23:53,210 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 157 states and 219 transitions. cyclomatic complexity: 68 Stem has 74 letters. Loop has 72 letters. [2022-02-21 03:23:53,210 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:23:53,210 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 112 states and 162 transitions. cyclomatic complexity: 56 Stem has 76 letters. Loop has 72 letters. [2022-02-21 03:23:53,211 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:23:53,211 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 5 states, 4 states have (on average 3.25) internal successors, (13), 4 states have internal predecessors, (13), 3 states have call successors, (8), 3 states have call predecessors, (8), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Stem has 76 letters. Loop has 72 letters. [2022-02-21 03:23:53,211 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:23:53,211 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 157 states and 219 transitions. cyclomatic complexity: 68 Stem has 76 letters. Loop has 72 letters. [2022-02-21 03:23:53,211 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:23:53,212 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 112 states and 162 transitions. cyclomatic complexity: 56 Stem has 75 letters. Loop has 72 letters. [2022-02-21 03:23:53,212 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:23:53,212 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 5 states, 4 states have (on average 3.25) internal successors, (13), 4 states have internal predecessors, (13), 3 states have call successors, (8), 3 states have call predecessors, (8), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Stem has 75 letters. Loop has 72 letters. [2022-02-21 03:23:53,212 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:23:53,212 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 157 states and 219 transitions. cyclomatic complexity: 68 Stem has 75 letters. Loop has 72 letters. [2022-02-21 03:23:53,213 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:23:53,213 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 112 states and 162 transitions. cyclomatic complexity: 56 Stem has 74 letters. Loop has 72 letters. [2022-02-21 03:23:53,213 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:23:53,213 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 5 states, 4 states have (on average 3.25) internal successors, (13), 4 states have internal predecessors, (13), 3 states have call successors, (8), 3 states have call predecessors, (8), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Stem has 74 letters. Loop has 72 letters. [2022-02-21 03:23:53,213 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:23:53,213 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 157 states and 219 transitions. cyclomatic complexity: 68 Stem has 74 letters. Loop has 72 letters. [2022-02-21 03:23:53,214 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:23:53,214 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 112 states and 162 transitions. cyclomatic complexity: 56 Stem has 2 letters. Loop has 3 letters. [2022-02-21 03:23:53,214 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:23:53,214 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 5 states, 4 states have (on average 3.25) internal successors, (13), 4 states have internal predecessors, (13), 3 states have call successors, (8), 3 states have call predecessors, (8), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Stem has 2 letters. Loop has 3 letters. [2022-02-21 03:23:53,214 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:23:53,214 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 157 states and 219 transitions. cyclomatic complexity: 68 Stem has 2 letters. Loop has 3 letters. [2022-02-21 03:23:53,214 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:23:53,214 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 112 states and 162 transitions. cyclomatic complexity: 56 Stem has 35 letters. Loop has 3 letters. [2022-02-21 03:23:53,214 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:23:53,214 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 5 states, 4 states have (on average 3.25) internal successors, (13), 4 states have internal predecessors, (13), 3 states have call successors, (8), 3 states have call predecessors, (8), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Stem has 35 letters. Loop has 3 letters. [2022-02-21 03:23:53,215 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:23:53,215 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 157 states and 219 transitions. cyclomatic complexity: 68 Stem has 35 letters. Loop has 3 letters. [2022-02-21 03:23:53,215 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:23:53,215 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 112 states and 162 transitions. cyclomatic complexity: 56 Stem has 32 letters. Loop has 24 letters. [2022-02-21 03:23:53,215 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:23:53,215 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 5 states, 4 states have (on average 3.25) internal successors, (13), 4 states have internal predecessors, (13), 3 states have call successors, (8), 3 states have call predecessors, (8), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Stem has 32 letters. Loop has 24 letters. [2022-02-21 03:23:53,215 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:23:53,215 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 157 states and 219 transitions. cyclomatic complexity: 68 Stem has 32 letters. Loop has 24 letters. [2022-02-21 03:23:53,215 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:23:53,215 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 112 states and 162 transitions. cyclomatic complexity: 56 Stem has 53 letters. Loop has 45 letters. [2022-02-21 03:23:53,216 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:23:53,216 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 5 states, 4 states have (on average 3.25) internal successors, (13), 4 states have internal predecessors, (13), 3 states have call successors, (8), 3 states have call predecessors, (8), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Stem has 53 letters. Loop has 45 letters. [2022-02-21 03:23:53,216 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:23:53,216 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 157 states and 219 transitions. cyclomatic complexity: 68 Stem has 53 letters. Loop has 45 letters. [2022-02-21 03:23:53,216 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:23:53,216 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 112 states and 162 transitions. cyclomatic complexity: 56 Stem has 33 letters. Loop has 3 letters. [2022-02-21 03:23:53,216 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:23:53,216 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 5 states, 4 states have (on average 3.25) internal successors, (13), 4 states have internal predecessors, (13), 3 states have call successors, (8), 3 states have call predecessors, (8), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Stem has 33 letters. Loop has 3 letters. [2022-02-21 03:23:53,217 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:23:53,217 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 157 states and 219 transitions. cyclomatic complexity: 68 Stem has 33 letters. Loop has 3 letters. [2022-02-21 03:23:53,217 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:23:53,217 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 112 states and 162 transitions. cyclomatic complexity: 56 Stem has 30 letters. Loop has 24 letters. [2022-02-21 03:23:53,217 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:23:53,217 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 5 states, 4 states have (on average 3.25) internal successors, (13), 4 states have internal predecessors, (13), 3 states have call successors, (8), 3 states have call predecessors, (8), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Stem has 30 letters. Loop has 24 letters. [2022-02-21 03:23:53,217 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:23:53,217 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 157 states and 219 transitions. cyclomatic complexity: 68 Stem has 30 letters. Loop has 24 letters. [2022-02-21 03:23:53,217 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:23:53,217 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 112 states and 162 transitions. cyclomatic complexity: 56 Stem has 34 letters. Loop has 3 letters. [2022-02-21 03:23:53,218 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:23:53,218 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 5 states, 4 states have (on average 3.25) internal successors, (13), 4 states have internal predecessors, (13), 3 states have call successors, (8), 3 states have call predecessors, (8), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Stem has 34 letters. Loop has 3 letters. [2022-02-21 03:23:53,218 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:23:53,218 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 157 states and 219 transitions. cyclomatic complexity: 68 Stem has 34 letters. Loop has 3 letters. [2022-02-21 03:23:53,218 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:23:53,218 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 112 states and 162 transitions. cyclomatic complexity: 56 Stem has 32 letters. Loop has 24 letters. [2022-02-21 03:23:53,218 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:23:53,218 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 5 states, 4 states have (on average 3.25) internal successors, (13), 4 states have internal predecessors, (13), 3 states have call successors, (8), 3 states have call predecessors, (8), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Stem has 32 letters. Loop has 24 letters. [2022-02-21 03:23:53,218 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:23:53,218 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 157 states and 219 transitions. cyclomatic complexity: 68 Stem has 32 letters. Loop has 24 letters. [2022-02-21 03:23:53,219 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:23:53,219 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 112 states and 162 transitions. cyclomatic complexity: 56 Stem has 32 letters. Loop has 72 letters. [2022-02-21 03:23:53,219 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:23:53,219 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 5 states, 4 states have (on average 3.25) internal successors, (13), 4 states have internal predecessors, (13), 3 states have call successors, (8), 3 states have call predecessors, (8), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Stem has 32 letters. Loop has 72 letters. [2022-02-21 03:23:53,219 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:23:53,219 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 157 states and 219 transitions. cyclomatic complexity: 68 Stem has 32 letters. Loop has 72 letters. [2022-02-21 03:23:53,220 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:23:53,220 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 112 states and 162 transitions. cyclomatic complexity: 56 Stem has 32 letters. Loop has 93 letters. [2022-02-21 03:23:53,220 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:23:53,220 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 5 states, 4 states have (on average 3.25) internal successors, (13), 4 states have internal predecessors, (13), 3 states have call successors, (8), 3 states have call predecessors, (8), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Stem has 32 letters. Loop has 93 letters. [2022-02-21 03:23:53,220 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:23:53,220 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 157 states and 219 transitions. cyclomatic complexity: 68 Stem has 32 letters. Loop has 93 letters. [2022-02-21 03:23:53,220 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:23:53,221 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 112 states and 162 transitions. cyclomatic complexity: 56 Stem has 32 letters. Loop has 45 letters. [2022-02-21 03:23:53,221 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:23:53,221 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 5 states, 4 states have (on average 3.25) internal successors, (13), 4 states have internal predecessors, (13), 3 states have call successors, (8), 3 states have call predecessors, (8), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Stem has 32 letters. Loop has 45 letters. [2022-02-21 03:23:53,222 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:23:53,222 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 157 states and 219 transitions. cyclomatic complexity: 68 Stem has 32 letters. Loop has 45 letters. [2022-02-21 03:23:53,222 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:23:53,222 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 112 states and 162 transitions. cyclomatic complexity: 56 Stem has 53 letters. Loop has 45 letters. [2022-02-21 03:23:53,222 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:23:53,222 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 5 states, 4 states have (on average 3.25) internal successors, (13), 4 states have internal predecessors, (13), 3 states have call successors, (8), 3 states have call predecessors, (8), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Stem has 53 letters. Loop has 45 letters. [2022-02-21 03:23:53,232 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:23:53,232 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 157 states and 219 transitions. cyclomatic complexity: 68 Stem has 53 letters. Loop has 45 letters. [2022-02-21 03:23:53,232 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:23:53,232 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 112 states and 162 transitions. cyclomatic complexity: 56 Stem has 53 letters. Loop has 93 letters. [2022-02-21 03:23:53,232 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:23:53,233 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 5 states, 4 states have (on average 3.25) internal successors, (13), 4 states have internal predecessors, (13), 3 states have call successors, (8), 3 states have call predecessors, (8), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Stem has 53 letters. Loop has 93 letters. [2022-02-21 03:23:53,233 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:23:53,233 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 157 states and 219 transitions. cyclomatic complexity: 68 Stem has 53 letters. Loop has 93 letters. [2022-02-21 03:23:53,233 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:23:53,233 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 112 states and 162 transitions. cyclomatic complexity: 56 Stem has 32 letters. Loop has 75 letters. [2022-02-21 03:23:53,233 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:23:53,234 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 5 states, 4 states have (on average 3.25) internal successors, (13), 4 states have internal predecessors, (13), 3 states have call successors, (8), 3 states have call predecessors, (8), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Stem has 32 letters. Loop has 75 letters. [2022-02-21 03:23:53,234 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:23:53,234 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 157 states and 219 transitions. cyclomatic complexity: 68 Stem has 32 letters. Loop has 75 letters. [2022-02-21 03:23:53,234 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:23:53,234 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 112 states and 162 transitions. cyclomatic complexity: 56 Stem has 32 letters. Loop has 27 letters. [2022-02-21 03:23:53,234 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:23:53,234 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 5 states, 4 states have (on average 3.25) internal successors, (13), 4 states have internal predecessors, (13), 3 states have call successors, (8), 3 states have call predecessors, (8), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Stem has 32 letters. Loop has 27 letters. [2022-02-21 03:23:53,235 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:23:53,235 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 157 states and 219 transitions. cyclomatic complexity: 68 Stem has 32 letters. Loop has 27 letters. [2022-02-21 03:23:53,235 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:23:53,235 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 112 states and 162 transitions. cyclomatic complexity: 56 Stem has 98 letters. Loop has 72 letters. [2022-02-21 03:23:53,235 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:23:53,235 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 5 states, 4 states have (on average 3.25) internal successors, (13), 4 states have internal predecessors, (13), 3 states have call successors, (8), 3 states have call predecessors, (8), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Stem has 98 letters. Loop has 72 letters. [2022-02-21 03:23:53,235 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:23:53,235 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 157 states and 219 transitions. cyclomatic complexity: 68 Stem has 98 letters. Loop has 72 letters. [2022-02-21 03:23:53,236 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:23:53,236 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 112 states and 162 transitions. cyclomatic complexity: 56 Stem has 99 letters. Loop has 72 letters. [2022-02-21 03:23:53,236 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:23:53,236 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 5 states, 4 states have (on average 3.25) internal successors, (13), 4 states have internal predecessors, (13), 3 states have call successors, (8), 3 states have call predecessors, (8), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Stem has 99 letters. Loop has 72 letters. [2022-02-21 03:23:53,237 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:23:53,237 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 157 states and 219 transitions. cyclomatic complexity: 68 Stem has 99 letters. Loop has 72 letters. [2022-02-21 03:23:53,238 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:23:53,238 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 112 states and 162 transitions. cyclomatic complexity: 56 Stem has 100 letters. Loop has 72 letters. [2022-02-21 03:23:53,238 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:23:53,238 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 5 states, 4 states have (on average 3.25) internal successors, (13), 4 states have internal predecessors, (13), 3 states have call successors, (8), 3 states have call predecessors, (8), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Stem has 100 letters. Loop has 72 letters. [2022-02-21 03:23:53,238 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:23:53,238 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 157 states and 219 transitions. cyclomatic complexity: 68 Stem has 100 letters. Loop has 72 letters. [2022-02-21 03:23:53,239 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:23:53,239 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 112 states and 162 transitions. cyclomatic complexity: 56 Stem has 101 letters. Loop has 72 letters. [2022-02-21 03:23:53,239 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:23:53,239 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 5 states, 4 states have (on average 3.25) internal successors, (13), 4 states have internal predecessors, (13), 3 states have call successors, (8), 3 states have call predecessors, (8), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Stem has 101 letters. Loop has 72 letters. [2022-02-21 03:23:53,239 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:23:53,239 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 157 states and 219 transitions. cyclomatic complexity: 68 Stem has 101 letters. Loop has 72 letters. [2022-02-21 03:23:53,240 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:23:53,240 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 112 states and 162 transitions. cyclomatic complexity: 56 Stem has 98 letters. Loop has 72 letters. [2022-02-21 03:23:53,240 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:23:53,240 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 5 states, 4 states have (on average 3.25) internal successors, (13), 4 states have internal predecessors, (13), 3 states have call successors, (8), 3 states have call predecessors, (8), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Stem has 98 letters. Loop has 72 letters. [2022-02-21 03:23:53,240 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:23:53,240 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 157 states and 219 transitions. cyclomatic complexity: 68 Stem has 98 letters. Loop has 72 letters. [2022-02-21 03:23:53,240 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:23:53,241 INFO L161 tractBuchiDifference]: Finished testing correctness of buchiDifferenceNCSBLazy3 [2022-02-21 03:23:53,241 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 4 states have (on average 3.25) internal successors, (13), 4 states have internal predecessors, (13), 3 states have call successors, (8), 3 states have call predecessors, (8), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2022-02-21 03:23:53,241 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 25 transitions. [2022-02-21 03:23:53,242 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 25 transitions. Stem has 30 letters. Loop has 3 letters. [2022-02-21 03:23:53,242 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:23:53,242 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 25 transitions. Stem has 33 letters. Loop has 3 letters. [2022-02-21 03:23:53,242 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:23:53,242 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 25 transitions. Stem has 30 letters. Loop has 6 letters. [2022-02-21 03:23:53,242 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:23:53,242 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 157 states and 219 transitions. cyclomatic complexity: 68 [2022-02-21 03:23:53,246 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 15 [2022-02-21 03:23:53,249 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 157 states to 139 states and 201 transitions. [2022-02-21 03:23:53,250 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 55 [2022-02-21 03:23:53,250 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 58 [2022-02-21 03:23:53,250 INFO L73 IsDeterministic]: Start isDeterministic. Operand 139 states and 201 transitions. [2022-02-21 03:23:53,250 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2022-02-21 03:23:53,250 INFO L681 BuchiCegarLoop]: Abstraction has 139 states and 201 transitions. [2022-02-21 03:23:53,250 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 139 states and 201 transitions. [2022-02-21 03:23:53,252 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 139 to 120. [2022-02-21 03:23:53,253 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-21 03:23:53,253 INFO L82 GeneralOperation]: Start isEquivalent. First operand 139 states and 201 transitions. Second operand has 120 states, 70 states have (on average 1.1285714285714286) internal successors, (79), 75 states have internal predecessors, (79), 32 states have call successors, (32), 20 states have call predecessors, (32), 18 states have return successors, (59), 24 states have call predecessors, (59), 28 states have call successors, (59) [2022-02-21 03:23:53,253 INFO L74 IsIncluded]: Start isIncluded. First operand 139 states and 201 transitions. Second operand has 120 states, 70 states have (on average 1.1285714285714286) internal successors, (79), 75 states have internal predecessors, (79), 32 states have call successors, (32), 20 states have call predecessors, (32), 18 states have return successors, (59), 24 states have call predecessors, (59), 28 states have call successors, (59) [2022-02-21 03:23:53,253 INFO L87 Difference]: Start difference. First operand 139 states and 201 transitions. Second operand has 120 states, 70 states have (on average 1.1285714285714286) internal successors, (79), 75 states have internal predecessors, (79), 32 states have call successors, (32), 20 states have call predecessors, (32), 18 states have return successors, (59), 24 states have call predecessors, (59), 28 states have call successors, (59) [2022-02-21 03:23:53,254 INFO L149 Difference]: Subtrahend was not deterministic. Recomputing result with determinization. [2022-02-21 03:23:53,265 INFO L93 Difference]: Finished difference Result 381 states and 582 transitions. [2022-02-21 03:23:53,265 INFO L276 IsEmpty]: Start isEmpty. Operand 381 states and 582 transitions. [2022-02-21 03:23:53,267 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 03:23:53,267 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 03:23:53,267 INFO L74 IsIncluded]: Start isIncluded. First operand has 120 states, 70 states have (on average 1.1285714285714286) internal successors, (79), 75 states have internal predecessors, (79), 32 states have call successors, (32), 20 states have call predecessors, (32), 18 states have return successors, (59), 24 states have call predecessors, (59), 28 states have call successors, (59) Second operand 139 states and 201 transitions. [2022-02-21 03:23:53,267 INFO L87 Difference]: Start difference. First operand has 120 states, 70 states have (on average 1.1285714285714286) internal successors, (79), 75 states have internal predecessors, (79), 32 states have call successors, (32), 20 states have call predecessors, (32), 18 states have return successors, (59), 24 states have call predecessors, (59), 28 states have call successors, (59) Second operand 139 states and 201 transitions. [2022-02-21 03:23:53,268 INFO L149 Difference]: Subtrahend was not deterministic. Recomputing result with determinization. [2022-02-21 03:23:53,282 INFO L93 Difference]: Finished difference Result 450 states and 688 transitions. [2022-02-21 03:23:53,282 INFO L276 IsEmpty]: Start isEmpty. Operand 450 states and 688 transitions. [2022-02-21 03:23:53,284 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 03:23:53,284 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 03:23:53,284 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-21 03:23:53,285 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-21 03:23:53,285 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 120 states, 70 states have (on average 1.1285714285714286) internal successors, (79), 75 states have internal predecessors, (79), 32 states have call successors, (32), 20 states have call predecessors, (32), 18 states have return successors, (59), 24 states have call predecessors, (59), 28 states have call successors, (59) [2022-02-21 03:23:53,287 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 120 states to 120 states and 170 transitions. [2022-02-21 03:23:53,287 INFO L704 BuchiCegarLoop]: Abstraction has 120 states and 170 transitions. [2022-02-21 03:23:53,287 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-21 03:23:53,288 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-02-21 03:23:53,288 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2022-02-21 03:23:53,288 INFO L87 Difference]: Start difference. First operand 120 states and 170 transitions. Second operand has 8 states, 6 states have (on average 2.3333333333333335) internal successors, (14), 5 states have internal predecessors, (14), 3 states have call successors, (7), 3 states have call predecessors, (7), 3 states have return successors, (4), 3 states have call predecessors, (4), 1 states have call successors, (4) [2022-02-21 03:23:53,422 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:23:53,422 INFO L93 Difference]: Finished difference Result 98 states and 116 transitions. [2022-02-21 03:23:53,422 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-02-21 03:23:53,422 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 8 states, 6 states have (on average 2.3333333333333335) internal successors, (14), 5 states have internal predecessors, (14), 3 states have call successors, (7), 3 states have call predecessors, (7), 3 states have return successors, (4), 3 states have call predecessors, (4), 1 states have call successors, (4) [2022-02-21 03:23:53,440 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 25 edges. 25 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-21 03:23:53,441 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 98 states and 116 transitions. [2022-02-21 03:23:53,443 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2022-02-21 03:23:53,444 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 98 states to 63 states and 75 transitions. [2022-02-21 03:23:53,444 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 12 [2022-02-21 03:23:53,444 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 12 [2022-02-21 03:23:53,444 INFO L73 IsDeterministic]: Start isDeterministic. Operand 63 states and 75 transitions. [2022-02-21 03:23:53,444 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2022-02-21 03:23:53,444 INFO L681 BuchiCegarLoop]: Abstraction has 63 states and 75 transitions. [2022-02-21 03:23:53,444 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63 states and 75 transitions. [2022-02-21 03:23:53,445 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63 to 54. [2022-02-21 03:23:53,445 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-21 03:23:53,445 INFO L82 GeneralOperation]: Start isEquivalent. First operand 63 states and 75 transitions. Second operand has 54 states, 33 states have (on average 1.121212121212121) internal successors, (37), 36 states have internal predecessors, (37), 14 states have call successors, (14), 10 states have call predecessors, (14), 7 states have return successors, (14), 7 states have call predecessors, (14), 10 states have call successors, (14) [2022-02-21 03:23:53,446 INFO L74 IsIncluded]: Start isIncluded. First operand 63 states and 75 transitions. Second operand has 54 states, 33 states have (on average 1.121212121212121) internal successors, (37), 36 states have internal predecessors, (37), 14 states have call successors, (14), 10 states have call predecessors, (14), 7 states have return successors, (14), 7 states have call predecessors, (14), 10 states have call successors, (14) [2022-02-21 03:23:53,446 INFO L87 Difference]: Start difference. First operand 63 states and 75 transitions. Second operand has 54 states, 33 states have (on average 1.121212121212121) internal successors, (37), 36 states have internal predecessors, (37), 14 states have call successors, (14), 10 states have call predecessors, (14), 7 states have return successors, (14), 7 states have call predecessors, (14), 10 states have call successors, (14) [2022-02-21 03:23:53,446 INFO L149 Difference]: Subtrahend was not deterministic. Recomputing result with determinization. [2022-02-21 03:23:53,448 INFO L93 Difference]: Finished difference Result 110 states and 131 transitions. [2022-02-21 03:23:53,448 INFO L276 IsEmpty]: Start isEmpty. Operand 110 states and 131 transitions. [2022-02-21 03:23:53,448 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 03:23:53,448 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 03:23:53,448 INFO L74 IsIncluded]: Start isIncluded. First operand has 54 states, 33 states have (on average 1.121212121212121) internal successors, (37), 36 states have internal predecessors, (37), 14 states have call successors, (14), 10 states have call predecessors, (14), 7 states have return successors, (14), 7 states have call predecessors, (14), 10 states have call successors, (14) Second operand 63 states and 75 transitions. [2022-02-21 03:23:53,449 INFO L87 Difference]: Start difference. First operand has 54 states, 33 states have (on average 1.121212121212121) internal successors, (37), 36 states have internal predecessors, (37), 14 states have call successors, (14), 10 states have call predecessors, (14), 7 states have return successors, (14), 7 states have call predecessors, (14), 10 states have call successors, (14) Second operand 63 states and 75 transitions. [2022-02-21 03:23:53,449 INFO L149 Difference]: Subtrahend was not deterministic. Recomputing result with determinization. [2022-02-21 03:23:53,451 INFO L93 Difference]: Finished difference Result 110 states and 131 transitions. [2022-02-21 03:23:53,451 INFO L276 IsEmpty]: Start isEmpty. Operand 110 states and 131 transitions. [2022-02-21 03:23:53,451 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 03:23:53,451 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 03:23:53,451 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-21 03:23:53,451 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-21 03:23:53,451 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 54 states, 33 states have (on average 1.121212121212121) internal successors, (37), 36 states have internal predecessors, (37), 14 states have call successors, (14), 10 states have call predecessors, (14), 7 states have return successors, (14), 7 states have call predecessors, (14), 10 states have call successors, (14) [2022-02-21 03:23:53,452 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 65 transitions. [2022-02-21 03:23:53,452 INFO L704 BuchiCegarLoop]: Abstraction has 54 states and 65 transitions. [2022-02-21 03:23:53,452 INFO L587 BuchiCegarLoop]: Abstraction has 54 states and 65 transitions. [2022-02-21 03:23:53,452 INFO L425 BuchiCegarLoop]: ======== Iteration 7============ [2022-02-21 03:23:53,452 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 54 states and 65 transitions. [2022-02-21 03:23:53,453 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2022-02-21 03:23:53,453 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 03:23:53,453 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 03:23:53,453 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [4, 4, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-21 03:23:53,453 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2022-02-21 03:23:53,453 INFO L791 eck$LassoCheckResult]: Stem: 9814#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true; 9815#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet5#1, main_#t~ret6#1, main_~x~0#1;main_~x~0#1 := main_#t~nondet5#1;havoc main_#t~nondet5#1; 9812#L25 call main_#t~ret6#1 := rec2(main_~x~0#1);< 9822#rec2ENTRY ~j := #in~j; 9833#L18 assume !(~j <= 0); 9826#L20 call #t~ret3 := rec1(~j);< 9842#rec1ENTRY ~i := #in~i; 9853#L12 assume !(~i <= 0); 9820#L14 call #t~ret0 := rec1(~i - 2);< 9855#rec1ENTRY ~i := #in~i; 9856#L12 assume ~i <= 0;#res := 0; 9854#rec1FINAL assume true; 9832#rec1EXIT >#28#return; 9825#L14-1 call #t~ret1 := rec1(#t~ret0 - 1);< 9828#rec1ENTRY ~i := #in~i; 9839#L12 assume ~i <= 0;#res := 0; 9829#rec1FINAL assume true; 9831#rec1EXIT >#30#return; 9847#L14-2 call #t~ret2 := rec1(#t~ret1);< 9824#rec1ENTRY ~i := #in~i; 9849#L12 assume ~i <= 0;#res := 0; 9848#rec1FINAL assume true; 9846#rec1EXIT >#32#return; 9845#L14-3 #res := 1 + #t~ret2;havoc #t~ret0;havoc #t~ret1;havoc #t~ret2; 9844#rec1FINAL assume true; 9843#rec1EXIT >#34#return; 9811#L20-1 call #t~ret4 := rec2(#t~ret3 - 1);< 9813#rec2ENTRY ~j := #in~j; 9835#L18 assume !(~j <= 0); 9836#L20 call #t~ret3 := rec1(~j);< 9840#rec1ENTRY [2022-02-21 03:23:53,454 INFO L793 eck$LassoCheckResult]: Loop: 9840#rec1ENTRY ~i := #in~i; 9837#L12 assume !(~i <= 0); 9838#L14 call #t~ret0 := rec1(~i - 2);< 9840#rec1ENTRY [2022-02-21 03:23:53,454 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:23:53,454 INFO L85 PathProgramCache]: Analyzing trace with hash 1256061253, now seen corresponding path program 2 times [2022-02-21 03:23:53,454 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 03:23:53,454 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [195341716] [2022-02-21 03:23:53,454 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:23:53,454 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 03:23:53,460 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:23:53,480 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2022-02-21 03:23:53,484 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:23:53,508 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-02-21 03:23:53,515 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:23:53,520 INFO L290 TraceCheckUtils]: 0: Hoare triple {10292#true} ~i := #in~i; {10292#true} is VALID [2022-02-21 03:23:53,520 INFO L290 TraceCheckUtils]: 1: Hoare triple {10292#true} assume ~i <= 0;#res := 0; {10292#true} is VALID [2022-02-21 03:23:53,520 INFO L290 TraceCheckUtils]: 2: Hoare triple {10292#true} assume true; {10292#true} is VALID [2022-02-21 03:23:53,520 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {10292#true} {10292#true} #28#return; {10292#true} is VALID [2022-02-21 03:23:53,520 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-02-21 03:23:53,521 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:23:53,524 INFO L290 TraceCheckUtils]: 0: Hoare triple {10292#true} ~i := #in~i; {10292#true} is VALID [2022-02-21 03:23:53,525 INFO L290 TraceCheckUtils]: 1: Hoare triple {10292#true} assume ~i <= 0;#res := 0; {10292#true} is VALID [2022-02-21 03:23:53,525 INFO L290 TraceCheckUtils]: 2: Hoare triple {10292#true} assume true; {10292#true} is VALID [2022-02-21 03:23:53,525 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {10292#true} {10292#true} #30#return; {10292#true} is VALID [2022-02-21 03:23:53,525 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-02-21 03:23:53,526 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:23:53,536 INFO L290 TraceCheckUtils]: 0: Hoare triple {10292#true} ~i := #in~i; {10292#true} is VALID [2022-02-21 03:23:53,536 INFO L290 TraceCheckUtils]: 1: Hoare triple {10292#true} assume ~i <= 0;#res := 0; {10331#(<= |rec1_#res| 0)} is VALID [2022-02-21 03:23:53,537 INFO L290 TraceCheckUtils]: 2: Hoare triple {10331#(<= |rec1_#res| 0)} assume true; {10331#(<= |rec1_#res| 0)} is VALID [2022-02-21 03:23:53,537 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {10331#(<= |rec1_#res| 0)} {10292#true} #32#return; {10329#(<= |rec1_#t~ret2| 0)} is VALID [2022-02-21 03:23:53,537 INFO L290 TraceCheckUtils]: 0: Hoare triple {10292#true} ~i := #in~i; {10292#true} is VALID [2022-02-21 03:23:53,537 INFO L290 TraceCheckUtils]: 1: Hoare triple {10292#true} assume !(~i <= 0); {10292#true} is VALID [2022-02-21 03:23:53,538 INFO L272 TraceCheckUtils]: 2: Hoare triple {10292#true} call #t~ret0 := rec1(~i - 2); {10292#true} is VALID [2022-02-21 03:23:53,538 INFO L290 TraceCheckUtils]: 3: Hoare triple {10292#true} ~i := #in~i; {10292#true} is VALID [2022-02-21 03:23:53,538 INFO L290 TraceCheckUtils]: 4: Hoare triple {10292#true} assume ~i <= 0;#res := 0; {10292#true} is VALID [2022-02-21 03:23:53,539 INFO L290 TraceCheckUtils]: 5: Hoare triple {10292#true} assume true; {10292#true} is VALID [2022-02-21 03:23:53,541 INFO L284 TraceCheckUtils]: 6: Hoare quadruple {10292#true} {10292#true} #28#return; {10292#true} is VALID [2022-02-21 03:23:53,542 INFO L272 TraceCheckUtils]: 7: Hoare triple {10292#true} call #t~ret1 := rec1(#t~ret0 - 1); {10292#true} is VALID [2022-02-21 03:23:53,544 INFO L290 TraceCheckUtils]: 8: Hoare triple {10292#true} ~i := #in~i; {10292#true} is VALID [2022-02-21 03:23:53,544 INFO L290 TraceCheckUtils]: 9: Hoare triple {10292#true} assume ~i <= 0;#res := 0; {10292#true} is VALID [2022-02-21 03:23:53,544 INFO L290 TraceCheckUtils]: 10: Hoare triple {10292#true} assume true; {10292#true} is VALID [2022-02-21 03:23:53,544 INFO L284 TraceCheckUtils]: 11: Hoare quadruple {10292#true} {10292#true} #30#return; {10292#true} is VALID [2022-02-21 03:23:53,545 INFO L272 TraceCheckUtils]: 12: Hoare triple {10292#true} call #t~ret2 := rec1(#t~ret1); {10292#true} is VALID [2022-02-21 03:23:53,546 INFO L290 TraceCheckUtils]: 13: Hoare triple {10292#true} ~i := #in~i; {10292#true} is VALID [2022-02-21 03:23:53,546 INFO L290 TraceCheckUtils]: 14: Hoare triple {10292#true} assume ~i <= 0;#res := 0; {10331#(<= |rec1_#res| 0)} is VALID [2022-02-21 03:23:53,546 INFO L290 TraceCheckUtils]: 15: Hoare triple {10331#(<= |rec1_#res| 0)} assume true; {10331#(<= |rec1_#res| 0)} is VALID [2022-02-21 03:23:53,547 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {10331#(<= |rec1_#res| 0)} {10292#true} #32#return; {10329#(<= |rec1_#t~ret2| 0)} is VALID [2022-02-21 03:23:53,547 INFO L290 TraceCheckUtils]: 17: Hoare triple {10329#(<= |rec1_#t~ret2| 0)} #res := 1 + #t~ret2;havoc #t~ret0;havoc #t~ret1;havoc #t~ret2; {10330#(<= |rec1_#res| 1)} is VALID [2022-02-21 03:23:53,548 INFO L290 TraceCheckUtils]: 18: Hoare triple {10330#(<= |rec1_#res| 1)} assume true; {10330#(<= |rec1_#res| 1)} is VALID [2022-02-21 03:23:53,548 INFO L284 TraceCheckUtils]: 19: Hoare quadruple {10330#(<= |rec1_#res| 1)} {10292#true} #34#return; {10314#(<= |rec2_#t~ret3| 1)} is VALID [2022-02-21 03:23:53,548 INFO L290 TraceCheckUtils]: 0: Hoare triple {10292#true} assume { :begin_inline_ULTIMATE.init } true; {10292#true} is VALID [2022-02-21 03:23:53,549 INFO L290 TraceCheckUtils]: 1: Hoare triple {10292#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet5#1, main_#t~ret6#1, main_~x~0#1;main_~x~0#1 := main_#t~nondet5#1;havoc main_#t~nondet5#1; {10292#true} is VALID [2022-02-21 03:23:53,549 INFO L272 TraceCheckUtils]: 2: Hoare triple {10292#true} call main_#t~ret6#1 := rec2(main_~x~0#1); {10292#true} is VALID [2022-02-21 03:23:53,549 INFO L290 TraceCheckUtils]: 3: Hoare triple {10292#true} ~j := #in~j; {10292#true} is VALID [2022-02-21 03:23:53,549 INFO L290 TraceCheckUtils]: 4: Hoare triple {10292#true} assume !(~j <= 0); {10292#true} is VALID [2022-02-21 03:23:53,549 INFO L272 TraceCheckUtils]: 5: Hoare triple {10292#true} call #t~ret3 := rec1(~j); {10292#true} is VALID [2022-02-21 03:23:53,549 INFO L290 TraceCheckUtils]: 6: Hoare triple {10292#true} ~i := #in~i; {10292#true} is VALID [2022-02-21 03:23:53,549 INFO L290 TraceCheckUtils]: 7: Hoare triple {10292#true} assume !(~i <= 0); {10292#true} is VALID [2022-02-21 03:23:53,549 INFO L272 TraceCheckUtils]: 8: Hoare triple {10292#true} call #t~ret0 := rec1(~i - 2); {10292#true} is VALID [2022-02-21 03:23:53,549 INFO L290 TraceCheckUtils]: 9: Hoare triple {10292#true} ~i := #in~i; {10292#true} is VALID [2022-02-21 03:23:53,549 INFO L290 TraceCheckUtils]: 10: Hoare triple {10292#true} assume ~i <= 0;#res := 0; {10292#true} is VALID [2022-02-21 03:23:53,550 INFO L290 TraceCheckUtils]: 11: Hoare triple {10292#true} assume true; {10292#true} is VALID [2022-02-21 03:23:53,550 INFO L284 TraceCheckUtils]: 12: Hoare quadruple {10292#true} {10292#true} #28#return; {10292#true} is VALID [2022-02-21 03:23:53,550 INFO L272 TraceCheckUtils]: 13: Hoare triple {10292#true} call #t~ret1 := rec1(#t~ret0 - 1); {10292#true} is VALID [2022-02-21 03:23:53,550 INFO L290 TraceCheckUtils]: 14: Hoare triple {10292#true} ~i := #in~i; {10292#true} is VALID [2022-02-21 03:23:53,550 INFO L290 TraceCheckUtils]: 15: Hoare triple {10292#true} assume ~i <= 0;#res := 0; {10292#true} is VALID [2022-02-21 03:23:53,550 INFO L290 TraceCheckUtils]: 16: Hoare triple {10292#true} assume true; {10292#true} is VALID [2022-02-21 03:23:53,550 INFO L284 TraceCheckUtils]: 17: Hoare quadruple {10292#true} {10292#true} #30#return; {10292#true} is VALID [2022-02-21 03:23:53,551 INFO L272 TraceCheckUtils]: 18: Hoare triple {10292#true} call #t~ret2 := rec1(#t~ret1); {10292#true} is VALID [2022-02-21 03:23:53,551 INFO L290 TraceCheckUtils]: 19: Hoare triple {10292#true} ~i := #in~i; {10292#true} is VALID [2022-02-21 03:23:53,551 INFO L290 TraceCheckUtils]: 20: Hoare triple {10292#true} assume ~i <= 0;#res := 0; {10331#(<= |rec1_#res| 0)} is VALID [2022-02-21 03:23:53,551 INFO L290 TraceCheckUtils]: 21: Hoare triple {10331#(<= |rec1_#res| 0)} assume true; {10331#(<= |rec1_#res| 0)} is VALID [2022-02-21 03:23:53,552 INFO L284 TraceCheckUtils]: 22: Hoare quadruple {10331#(<= |rec1_#res| 0)} {10292#true} #32#return; {10329#(<= |rec1_#t~ret2| 0)} is VALID [2022-02-21 03:23:53,552 INFO L290 TraceCheckUtils]: 23: Hoare triple {10329#(<= |rec1_#t~ret2| 0)} #res := 1 + #t~ret2;havoc #t~ret0;havoc #t~ret1;havoc #t~ret2; {10330#(<= |rec1_#res| 1)} is VALID [2022-02-21 03:23:53,552 INFO L290 TraceCheckUtils]: 24: Hoare triple {10330#(<= |rec1_#res| 1)} assume true; {10330#(<= |rec1_#res| 1)} is VALID [2022-02-21 03:23:53,553 INFO L284 TraceCheckUtils]: 25: Hoare quadruple {10330#(<= |rec1_#res| 1)} {10292#true} #34#return; {10314#(<= |rec2_#t~ret3| 1)} is VALID [2022-02-21 03:23:53,553 INFO L272 TraceCheckUtils]: 26: Hoare triple {10314#(<= |rec2_#t~ret3| 1)} call #t~ret4 := rec2(#t~ret3 - 1); {10315#(<= |rec2_#in~j| 0)} is VALID [2022-02-21 03:23:53,554 INFO L290 TraceCheckUtils]: 27: Hoare triple {10315#(<= |rec2_#in~j| 0)} ~j := #in~j; {10316#(<= rec2_~j 0)} is VALID [2022-02-21 03:23:53,554 INFO L290 TraceCheckUtils]: 28: Hoare triple {10316#(<= rec2_~j 0)} assume !(~j <= 0); {10293#false} is VALID [2022-02-21 03:23:53,554 INFO L272 TraceCheckUtils]: 29: Hoare triple {10293#false} call #t~ret3 := rec1(~j); {10293#false} is VALID [2022-02-21 03:23:53,555 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 11 proven. 2 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2022-02-21 03:23:53,555 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-21 03:23:53,555 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [195341716] [2022-02-21 03:23:53,555 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [195341716] provided 0 perfect and 1 imperfect interpolant sequences [2022-02-21 03:23:53,555 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [689287837] [2022-02-21 03:23:53,556 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-02-21 03:23:53,556 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-21 03:23:53,556 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:23:53,557 INFO L229 MonitoredProcess]: Starting monitored process 50 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-02-21 03:23:53,567 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (50)] Waiting until timeout for monitored process [2022-02-21 03:23:53,589 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-02-21 03:23:53,590 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-02-21 03:23:53,590 INFO L263 TraceCheckSpWp]: Trace formula consists of 70 conjuncts, 7 conjunts are in the unsatisfiable core [2022-02-21 03:23:53,596 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:23:53,597 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-21 03:23:53,701 INFO L290 TraceCheckUtils]: 0: Hoare triple {10292#true} assume { :begin_inline_ULTIMATE.init } true; {10292#true} is VALID [2022-02-21 03:23:53,702 INFO L290 TraceCheckUtils]: 1: Hoare triple {10292#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet5#1, main_#t~ret6#1, main_~x~0#1;main_~x~0#1 := main_#t~nondet5#1;havoc main_#t~nondet5#1; {10292#true} is VALID [2022-02-21 03:23:53,702 INFO L272 TraceCheckUtils]: 2: Hoare triple {10292#true} call main_#t~ret6#1 := rec2(main_~x~0#1); {10292#true} is VALID [2022-02-21 03:23:53,702 INFO L290 TraceCheckUtils]: 3: Hoare triple {10292#true} ~j := #in~j; {10292#true} is VALID [2022-02-21 03:23:53,702 INFO L290 TraceCheckUtils]: 4: Hoare triple {10292#true} assume !(~j <= 0); {10292#true} is VALID [2022-02-21 03:23:53,702 INFO L272 TraceCheckUtils]: 5: Hoare triple {10292#true} call #t~ret3 := rec1(~j); {10292#true} is VALID [2022-02-21 03:23:53,702 INFO L290 TraceCheckUtils]: 6: Hoare triple {10292#true} ~i := #in~i; {10292#true} is VALID [2022-02-21 03:23:53,702 INFO L290 TraceCheckUtils]: 7: Hoare triple {10292#true} assume !(~i <= 0); {10292#true} is VALID [2022-02-21 03:23:53,703 INFO L272 TraceCheckUtils]: 8: Hoare triple {10292#true} call #t~ret0 := rec1(~i - 2); {10292#true} is VALID [2022-02-21 03:23:53,703 INFO L290 TraceCheckUtils]: 9: Hoare triple {10292#true} ~i := #in~i; {10292#true} is VALID [2022-02-21 03:23:53,703 INFO L290 TraceCheckUtils]: 10: Hoare triple {10292#true} assume ~i <= 0;#res := 0; {10292#true} is VALID [2022-02-21 03:23:53,703 INFO L290 TraceCheckUtils]: 11: Hoare triple {10292#true} assume true; {10292#true} is VALID [2022-02-21 03:23:53,703 INFO L284 TraceCheckUtils]: 12: Hoare quadruple {10292#true} {10292#true} #28#return; {10292#true} is VALID [2022-02-21 03:23:53,703 INFO L272 TraceCheckUtils]: 13: Hoare triple {10292#true} call #t~ret1 := rec1(#t~ret0 - 1); {10292#true} is VALID [2022-02-21 03:23:53,703 INFO L290 TraceCheckUtils]: 14: Hoare triple {10292#true} ~i := #in~i; {10292#true} is VALID [2022-02-21 03:23:53,703 INFO L290 TraceCheckUtils]: 15: Hoare triple {10292#true} assume ~i <= 0;#res := 0; {10292#true} is VALID [2022-02-21 03:23:53,703 INFO L290 TraceCheckUtils]: 16: Hoare triple {10292#true} assume true; {10292#true} is VALID [2022-02-21 03:23:53,704 INFO L284 TraceCheckUtils]: 17: Hoare quadruple {10292#true} {10292#true} #30#return; {10292#true} is VALID [2022-02-21 03:23:53,704 INFO L272 TraceCheckUtils]: 18: Hoare triple {10292#true} call #t~ret2 := rec1(#t~ret1); {10292#true} is VALID [2022-02-21 03:23:53,704 INFO L290 TraceCheckUtils]: 19: Hoare triple {10292#true} ~i := #in~i; {10292#true} is VALID [2022-02-21 03:23:53,704 INFO L290 TraceCheckUtils]: 20: Hoare triple {10292#true} assume ~i <= 0;#res := 0; {10331#(<= |rec1_#res| 0)} is VALID [2022-02-21 03:23:53,705 INFO L290 TraceCheckUtils]: 21: Hoare triple {10331#(<= |rec1_#res| 0)} assume true; {10331#(<= |rec1_#res| 0)} is VALID [2022-02-21 03:23:53,705 INFO L284 TraceCheckUtils]: 22: Hoare quadruple {10331#(<= |rec1_#res| 0)} {10292#true} #32#return; {10329#(<= |rec1_#t~ret2| 0)} is VALID [2022-02-21 03:23:53,706 INFO L290 TraceCheckUtils]: 23: Hoare triple {10329#(<= |rec1_#t~ret2| 0)} #res := 1 + #t~ret2;havoc #t~ret0;havoc #t~ret1;havoc #t~ret2; {10330#(<= |rec1_#res| 1)} is VALID [2022-02-21 03:23:53,706 INFO L290 TraceCheckUtils]: 24: Hoare triple {10330#(<= |rec1_#res| 1)} assume true; {10330#(<= |rec1_#res| 1)} is VALID [2022-02-21 03:23:53,706 INFO L284 TraceCheckUtils]: 25: Hoare quadruple {10330#(<= |rec1_#res| 1)} {10292#true} #34#return; {10314#(<= |rec2_#t~ret3| 1)} is VALID [2022-02-21 03:23:53,707 INFO L272 TraceCheckUtils]: 26: Hoare triple {10314#(<= |rec2_#t~ret3| 1)} call #t~ret4 := rec2(#t~ret3 - 1); {10315#(<= |rec2_#in~j| 0)} is VALID [2022-02-21 03:23:53,707 INFO L290 TraceCheckUtils]: 27: Hoare triple {10315#(<= |rec2_#in~j| 0)} ~j := #in~j; {10316#(<= rec2_~j 0)} is VALID [2022-02-21 03:23:53,707 INFO L290 TraceCheckUtils]: 28: Hoare triple {10316#(<= rec2_~j 0)} assume !(~j <= 0); {10293#false} is VALID [2022-02-21 03:23:53,708 INFO L272 TraceCheckUtils]: 29: Hoare triple {10293#false} call #t~ret3 := rec1(~j); {10293#false} is VALID [2022-02-21 03:23:53,708 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 11 proven. 2 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2022-02-21 03:23:53,708 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-02-21 03:23:54,006 INFO L272 TraceCheckUtils]: 29: Hoare triple {10293#false} call #t~ret3 := rec1(~j); {10293#false} is VALID [2022-02-21 03:23:54,006 INFO L290 TraceCheckUtils]: 28: Hoare triple {10316#(<= rec2_~j 0)} assume !(~j <= 0); {10293#false} is VALID [2022-02-21 03:23:54,007 INFO L290 TraceCheckUtils]: 27: Hoare triple {10315#(<= |rec2_#in~j| 0)} ~j := #in~j; {10316#(<= rec2_~j 0)} is VALID [2022-02-21 03:23:54,007 INFO L272 TraceCheckUtils]: 26: Hoare triple {10314#(<= |rec2_#t~ret3| 1)} call #t~ret4 := rec2(#t~ret3 - 1); {10315#(<= |rec2_#in~j| 0)} is VALID [2022-02-21 03:23:54,008 INFO L284 TraceCheckUtils]: 25: Hoare quadruple {10330#(<= |rec1_#res| 1)} {10292#true} #34#return; {10314#(<= |rec2_#t~ret3| 1)} is VALID [2022-02-21 03:23:54,008 INFO L290 TraceCheckUtils]: 24: Hoare triple {10330#(<= |rec1_#res| 1)} assume true; {10330#(<= |rec1_#res| 1)} is VALID [2022-02-21 03:23:54,009 INFO L290 TraceCheckUtils]: 23: Hoare triple {10329#(<= |rec1_#t~ret2| 0)} #res := 1 + #t~ret2;havoc #t~ret0;havoc #t~ret1;havoc #t~ret2; {10330#(<= |rec1_#res| 1)} is VALID [2022-02-21 03:23:54,009 INFO L284 TraceCheckUtils]: 22: Hoare quadruple {10331#(<= |rec1_#res| 0)} {10292#true} #32#return; {10329#(<= |rec1_#t~ret2| 0)} is VALID [2022-02-21 03:23:54,009 INFO L290 TraceCheckUtils]: 21: Hoare triple {10331#(<= |rec1_#res| 0)} assume true; {10331#(<= |rec1_#res| 0)} is VALID [2022-02-21 03:23:54,010 INFO L290 TraceCheckUtils]: 20: Hoare triple {10292#true} assume ~i <= 0;#res := 0; {10331#(<= |rec1_#res| 0)} is VALID [2022-02-21 03:23:54,010 INFO L290 TraceCheckUtils]: 19: Hoare triple {10292#true} ~i := #in~i; {10292#true} is VALID [2022-02-21 03:23:54,010 INFO L272 TraceCheckUtils]: 18: Hoare triple {10292#true} call #t~ret2 := rec1(#t~ret1); {10292#true} is VALID [2022-02-21 03:23:54,010 INFO L284 TraceCheckUtils]: 17: Hoare quadruple {10292#true} {10292#true} #30#return; {10292#true} is VALID [2022-02-21 03:23:54,010 INFO L290 TraceCheckUtils]: 16: Hoare triple {10292#true} assume true; {10292#true} is VALID [2022-02-21 03:23:54,010 INFO L290 TraceCheckUtils]: 15: Hoare triple {10292#true} assume ~i <= 0;#res := 0; {10292#true} is VALID [2022-02-21 03:23:54,010 INFO L290 TraceCheckUtils]: 14: Hoare triple {10292#true} ~i := #in~i; {10292#true} is VALID [2022-02-21 03:23:54,010 INFO L272 TraceCheckUtils]: 13: Hoare triple {10292#true} call #t~ret1 := rec1(#t~ret0 - 1); {10292#true} is VALID [2022-02-21 03:23:54,010 INFO L284 TraceCheckUtils]: 12: Hoare quadruple {10292#true} {10292#true} #28#return; {10292#true} is VALID [2022-02-21 03:23:54,011 INFO L290 TraceCheckUtils]: 11: Hoare triple {10292#true} assume true; {10292#true} is VALID [2022-02-21 03:23:54,011 INFO L290 TraceCheckUtils]: 10: Hoare triple {10292#true} assume ~i <= 0;#res := 0; {10292#true} is VALID [2022-02-21 03:23:54,011 INFO L290 TraceCheckUtils]: 9: Hoare triple {10292#true} ~i := #in~i; {10292#true} is VALID [2022-02-21 03:23:54,011 INFO L272 TraceCheckUtils]: 8: Hoare triple {10292#true} call #t~ret0 := rec1(~i - 2); {10292#true} is VALID [2022-02-21 03:23:54,011 INFO L290 TraceCheckUtils]: 7: Hoare triple {10292#true} assume !(~i <= 0); {10292#true} is VALID [2022-02-21 03:23:54,011 INFO L290 TraceCheckUtils]: 6: Hoare triple {10292#true} ~i := #in~i; {10292#true} is VALID [2022-02-21 03:23:54,011 INFO L272 TraceCheckUtils]: 5: Hoare triple {10292#true} call #t~ret3 := rec1(~j); {10292#true} is VALID [2022-02-21 03:23:54,011 INFO L290 TraceCheckUtils]: 4: Hoare triple {10292#true} assume !(~j <= 0); {10292#true} is VALID [2022-02-21 03:23:54,011 INFO L290 TraceCheckUtils]: 3: Hoare triple {10292#true} ~j := #in~j; {10292#true} is VALID [2022-02-21 03:23:54,012 INFO L272 TraceCheckUtils]: 2: Hoare triple {10292#true} call main_#t~ret6#1 := rec2(main_~x~0#1); {10292#true} is VALID [2022-02-21 03:23:54,012 INFO L290 TraceCheckUtils]: 1: Hoare triple {10292#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet5#1, main_#t~ret6#1, main_~x~0#1;main_~x~0#1 := main_#t~nondet5#1;havoc main_#t~nondet5#1; {10292#true} is VALID [2022-02-21 03:23:54,012 INFO L290 TraceCheckUtils]: 0: Hoare triple {10292#true} assume { :begin_inline_ULTIMATE.init } true; {10292#true} is VALID [2022-02-21 03:23:54,012 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 11 proven. 2 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2022-02-21 03:23:54,012 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [689287837] provided 0 perfect and 2 imperfect interpolant sequences [2022-02-21 03:23:54,012 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-02-21 03:23:54,012 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 8 [2022-02-21 03:23:54,012 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [991232167] [2022-02-21 03:23:54,013 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-02-21 03:23:54,013 INFO L796 eck$LassoCheckResult]: stem already infeasible [2022-02-21 03:23:54,013 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:23:54,013 INFO L85 PathProgramCache]: Analyzing trace with hash 29942, now seen corresponding path program 4 times [2022-02-21 03:23:54,013 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 03:23:54,013 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [546830366] [2022-02-21 03:23:54,014 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:23:54,014 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 03:23:54,016 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:23:54,016 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-02-21 03:23:54,017 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:23:54,017 INFO L138 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-02-21 03:23:54,071 INFO L210 LassoAnalysis]: Preferences: [2022-02-21 03:23:54,071 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2022-02-21 03:23:54,072 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2022-02-21 03:23:54,072 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2022-02-21 03:23:54,072 INFO L129 ssoRankerPreferences]: Use exernal solver: true [2022-02-21 03:23:54,072 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:23:54,072 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2022-02-21 03:23:54,072 INFO L132 ssoRankerPreferences]: Path of dumped script: [2022-02-21 03:23:54,072 INFO L133 ssoRankerPreferences]: Filename of dumped script: NestedRecursion_1d.c_Iteration7_Loop [2022-02-21 03:23:54,072 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2022-02-21 03:23:54,072 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2022-02-21 03:23:54,073 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 03:23:54,074 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 03:23:54,075 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 03:23:54,077 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 03:23:54,080 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 03:23:54,082 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 03:23:54,113 INFO L294 LassoAnalysis]: Preprocessing complete. [2022-02-21 03:23:54,114 INFO L404 LassoAnalysis]: Checking for nontermination... [2022-02-21 03:23:54,114 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:23:54,114 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:23:54,115 INFO L229 MonitoredProcess]: Starting monitored process 51 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-02-21 03:23:54,127 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2022-02-21 03:23:54,127 INFO L160 nArgumentSynthesizer]: Using integer mode. [2022-02-21 03:23:54,136 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (51)] Waiting until timeout for monitored process [2022-02-21 03:23:54,145 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2022-02-21 03:23:54,145 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {rec1_#t~ret0=0} Honda state: {rec1_#t~ret0=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2022-02-21 03:23:54,160 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (51)] Forceful destruction successful, exit code 0 [2022-02-21 03:23:54,160 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:23:54,160 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:23:54,161 INFO L229 MonitoredProcess]: Starting monitored process 52 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-02-21 03:23:54,163 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (52)] Waiting until timeout for monitored process [2022-02-21 03:23:54,164 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2022-02-21 03:23:54,164 INFO L160 nArgumentSynthesizer]: Using integer mode. [2022-02-21 03:23:54,185 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2022-02-21 03:23:54,185 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {rec1_~i=0} Honda state: {rec1_~i=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2022-02-21 03:23:54,200 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (52)] Forceful destruction successful, exit code 0 [2022-02-21 03:23:54,201 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:23:54,201 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:23:54,202 INFO L229 MonitoredProcess]: Starting monitored process 53 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-02-21 03:23:54,202 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (53)] Waiting until timeout for monitored process [2022-02-21 03:23:54,204 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2022-02-21 03:23:54,204 INFO L160 nArgumentSynthesizer]: Using integer mode. [2022-02-21 03:23:54,217 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2022-02-21 03:23:54,217 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {rec1_#res=0} Honda state: {rec1_#res=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2022-02-21 03:23:54,233 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (53)] Forceful destruction successful, exit code 0 [2022-02-21 03:23:54,233 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:23:54,233 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:23:54,234 INFO L229 MonitoredProcess]: Starting monitored process 54 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-02-21 03:23:54,236 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (54)] Waiting until timeout for monitored process [2022-02-21 03:23:54,236 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2022-02-21 03:23:54,236 INFO L160 nArgumentSynthesizer]: Using integer mode. [2022-02-21 03:23:54,257 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (54)] Ended with exit code 0 [2022-02-21 03:23:54,258 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:23:54,258 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:23:54,259 INFO L229 MonitoredProcess]: Starting monitored process 55 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-02-21 03:23:54,260 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (55)] Waiting until timeout for monitored process [2022-02-21 03:23:54,261 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2022-02-21 03:23:54,261 INFO L160 nArgumentSynthesizer]: Using integer mode. [2022-02-21 03:23:54,331 INFO L444 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2022-02-21 03:23:54,335 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (55)] Forceful destruction successful, exit code 0 [2022-02-21 03:23:54,335 INFO L210 LassoAnalysis]: Preferences: [2022-02-21 03:23:54,335 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2022-02-21 03:23:54,335 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2022-02-21 03:23:54,335 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2022-02-21 03:23:54,335 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2022-02-21 03:23:54,335 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:23:54,335 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2022-02-21 03:23:54,335 INFO L132 ssoRankerPreferences]: Path of dumped script: [2022-02-21 03:23:54,335 INFO L133 ssoRankerPreferences]: Filename of dumped script: NestedRecursion_1d.c_Iteration7_Loop [2022-02-21 03:23:54,335 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2022-02-21 03:23:54,335 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2022-02-21 03:23:54,336 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 03:23:54,344 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 03:23:54,346 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 03:23:54,347 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 03:23:54,351 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 03:23:54,353 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 03:23:54,389 INFO L294 LassoAnalysis]: Preprocessing complete. [2022-02-21 03:23:54,390 INFO L490 LassoAnalysis]: Using template 'affine'. [2022-02-21 03:23:54,390 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:23:54,390 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:23:54,391 INFO L229 MonitoredProcess]: Starting monitored process 56 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-02-21 03:23:54,401 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-02-21 03:23:54,402 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (56)] Waiting until timeout for monitored process [2022-02-21 03:23:54,406 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 03:23:54,406 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 03:23:54,407 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 03:23:54,407 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 03:23:54,407 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 03:23:54,407 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-02-21 03:23:54,407 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 03:23:54,423 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 03:23:54,438 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (56)] Forceful destruction successful, exit code 0 [2022-02-21 03:23:54,438 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:23:54,438 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:23:54,440 INFO L229 MonitoredProcess]: Starting monitored process 57 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-02-21 03:23:54,440 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (57)] Waiting until timeout for monitored process [2022-02-21 03:23:54,441 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-02-21 03:23:54,446 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 03:23:54,447 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 03:23:54,447 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 03:23:54,447 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 03:23:54,447 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 03:23:54,447 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-02-21 03:23:54,447 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 03:23:54,459 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 03:23:54,475 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (57)] Forceful destruction successful, exit code 0 [2022-02-21 03:23:54,475 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:23:54,475 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:23:54,476 INFO L229 MonitoredProcess]: Starting monitored process 58 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-02-21 03:23:54,477 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (58)] Waiting until timeout for monitored process [2022-02-21 03:23:54,478 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-02-21 03:23:54,483 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 03:23:54,483 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 03:23:54,483 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 03:23:54,483 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 03:23:54,483 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 03:23:54,483 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-02-21 03:23:54,483 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 03:23:54,499 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 03:23:54,514 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (58)] Forceful destruction successful, exit code 0 [2022-02-21 03:23:54,515 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:23:54,515 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:23:54,516 INFO L229 MonitoredProcess]: Starting monitored process 59 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-02-21 03:23:54,516 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (59)] Waiting until timeout for monitored process [2022-02-21 03:23:54,518 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-02-21 03:23:54,523 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 03:23:54,523 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 03:23:54,523 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 03:23:54,523 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 03:23:54,523 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 03:23:54,524 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-02-21 03:23:54,524 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 03:23:54,525 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2022-02-21 03:23:54,527 INFO L443 ModelExtractionUtils]: Simplification made 2 calls to the SMT solver. [2022-02-21 03:23:54,527 INFO L444 ModelExtractionUtils]: 1 out of 3 variables were initially zero. Simplification set additionally 0 variables to zero. [2022-02-21 03:23:54,527 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:23:54,527 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:23:54,528 INFO L229 MonitoredProcess]: Starting monitored process 60 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-02-21 03:23:54,529 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (60)] Waiting until timeout for monitored process [2022-02-21 03:23:54,529 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2022-02-21 03:23:54,530 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2022-02-21 03:23:54,530 INFO L513 LassoAnalysis]: Proved termination. [2022-02-21 03:23:54,530 INFO L515 LassoAnalysis]: Termination argument consisting of: Ranking function f(rec1_#in~i) = 1*rec1_#in~i Supporting invariants [] [2022-02-21 03:23:54,545 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (59)] Forceful destruction successful, exit code 0 [2022-02-21 03:23:54,552 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2022-02-21 03:23:54,555 INFO L390 LassoCheck]: Loop: "~i := #in~i;" "assume !(~i <= 0);" "call #t~ret0 := rec1(~i - 2);"< [2022-02-21 03:23:54,557 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:23:54,566 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:23:54,597 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:23:54,599 INFO L263 TraceCheckSpWp]: Trace formula consists of 266 conjuncts, 16 conjunts are in the unsatisfiable core [2022-02-21 03:23:54,628 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:23:54,629 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-21 03:23:54,856 INFO L290 TraceCheckUtils]: 0: Hoare triple {10508#unseeded} assume { :begin_inline_ULTIMATE.init } true; {10508#unseeded} is VALID [2022-02-21 03:23:54,856 INFO L290 TraceCheckUtils]: 1: Hoare triple {10508#unseeded} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet5#1, main_#t~ret6#1, main_~x~0#1;main_~x~0#1 := main_#t~nondet5#1;havoc main_#t~nondet5#1; {10508#unseeded} is VALID [2022-02-21 03:23:54,856 INFO L272 TraceCheckUtils]: 2: Hoare triple {10508#unseeded} call main_#t~ret6#1 := rec2(main_~x~0#1); {10508#unseeded} is VALID [2022-02-21 03:23:54,857 INFO L290 TraceCheckUtils]: 3: Hoare triple {10508#unseeded} ~j := #in~j; {10508#unseeded} is VALID [2022-02-21 03:23:54,857 INFO L290 TraceCheckUtils]: 4: Hoare triple {10508#unseeded} assume !(~j <= 0); {10508#unseeded} is VALID [2022-02-21 03:23:54,857 INFO L272 TraceCheckUtils]: 5: Hoare triple {10508#unseeded} call #t~ret3 := rec1(~j); {10541#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2022-02-21 03:23:54,858 INFO L290 TraceCheckUtils]: 6: Hoare triple {10541#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} ~i := #in~i; {10541#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2022-02-21 03:23:54,858 INFO L290 TraceCheckUtils]: 7: Hoare triple {10541#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} assume !(~i <= 0); {10541#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2022-02-21 03:23:54,859 INFO L272 TraceCheckUtils]: 8: Hoare triple {10541#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} call #t~ret0 := rec1(~i - 2); {10541#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2022-02-21 03:23:54,859 INFO L290 TraceCheckUtils]: 9: Hoare triple {10541#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} ~i := #in~i; {10541#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2022-02-21 03:23:54,859 INFO L290 TraceCheckUtils]: 10: Hoare triple {10541#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} assume ~i <= 0;#res := 0; {10541#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2022-02-21 03:23:54,860 INFO L290 TraceCheckUtils]: 11: Hoare triple {10541#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} assume true; {10541#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2022-02-21 03:23:54,860 INFO L284 TraceCheckUtils]: 12: Hoare quadruple {10541#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} {10541#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} #28#return; {10541#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2022-02-21 03:23:54,861 INFO L272 TraceCheckUtils]: 13: Hoare triple {10541#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} call #t~ret1 := rec1(#t~ret0 - 1); {10541#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2022-02-21 03:23:54,861 INFO L290 TraceCheckUtils]: 14: Hoare triple {10541#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} ~i := #in~i; {10541#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2022-02-21 03:23:54,862 INFO L290 TraceCheckUtils]: 15: Hoare triple {10541#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} assume ~i <= 0;#res := 0; {10541#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2022-02-21 03:23:54,862 INFO L290 TraceCheckUtils]: 16: Hoare triple {10541#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} assume true; {10541#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2022-02-21 03:23:54,863 INFO L284 TraceCheckUtils]: 17: Hoare quadruple {10541#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} {10541#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} #30#return; {10541#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2022-02-21 03:23:54,863 INFO L272 TraceCheckUtils]: 18: Hoare triple {10541#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} call #t~ret2 := rec1(#t~ret1); {10541#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2022-02-21 03:23:54,863 INFO L290 TraceCheckUtils]: 19: Hoare triple {10541#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} ~i := #in~i; {10541#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2022-02-21 03:23:54,864 INFO L290 TraceCheckUtils]: 20: Hoare triple {10541#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} assume ~i <= 0;#res := 0; {10541#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2022-02-21 03:23:54,864 INFO L290 TraceCheckUtils]: 21: Hoare triple {10541#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} assume true; {10541#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2022-02-21 03:23:54,866 INFO L284 TraceCheckUtils]: 22: Hoare quadruple {10541#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} {10541#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} #32#return; {10541#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2022-02-21 03:23:54,866 INFO L290 TraceCheckUtils]: 23: Hoare triple {10541#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} #res := 1 + #t~ret2;havoc #t~ret0;havoc #t~ret1;havoc #t~ret2; {10541#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2022-02-21 03:23:54,868 INFO L290 TraceCheckUtils]: 24: Hoare triple {10541#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} assume true; {10541#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2022-02-21 03:23:54,868 INFO L284 TraceCheckUtils]: 25: Hoare quadruple {10541#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} {10508#unseeded} #34#return; {10508#unseeded} is VALID [2022-02-21 03:23:54,869 INFO L272 TraceCheckUtils]: 26: Hoare triple {10508#unseeded} call #t~ret4 := rec2(#t~ret3 - 1); {10508#unseeded} is VALID [2022-02-21 03:23:54,869 INFO L290 TraceCheckUtils]: 27: Hoare triple {10508#unseeded} ~j := #in~j; {10508#unseeded} is VALID [2022-02-21 03:23:54,869 INFO L290 TraceCheckUtils]: 28: Hoare triple {10508#unseeded} assume !(~j <= 0); {10508#unseeded} is VALID [2022-02-21 03:23:54,870 INFO L272 TraceCheckUtils]: 29: Hoare triple {10508#unseeded} call #t~ret3 := rec1(~j); {10508#unseeded} is VALID [2022-02-21 03:23:54,875 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:23:54,875 INFO L263 TraceCheckSpWp]: Trace formula consists of 37 conjuncts, 7 conjunts are in the unsatisfiable core [2022-02-21 03:23:54,878 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:23:54,879 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-21 03:23:54,918 INFO L290 TraceCheckUtils]: 0: Hoare triple {10511#(>= oldRank0 |rec1_#in~i|)} ~i := #in~i; {10614#(<= rec1_~i oldRank0)} is VALID [2022-02-21 03:23:54,919 INFO L290 TraceCheckUtils]: 1: Hoare triple {10614#(<= rec1_~i oldRank0)} assume !(~i <= 0); {10618#(and (not (<= rec1_~i 0)) (<= rec1_~i oldRank0))} is VALID [2022-02-21 03:23:54,920 INFO L272 TraceCheckUtils]: 2: Hoare triple {10618#(and (not (<= rec1_~i 0)) (<= rec1_~i oldRank0))} call #t~ret0 := rec1(~i - 2); {10521#(or (and (>= oldRank0 0) (> oldRank0 |rec1_#in~i|)) unseeded)} is VALID [2022-02-21 03:23:54,920 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-21 03:23:54,920 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 5 states, 4 states have (on average 2.75) internal successors, (11), 4 states have internal predecessors, (11), 3 states have call successors, (8), 3 states have call predecessors, (8), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2022-02-21 03:23:54,941 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 23 edges. 23 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-21 03:23:54,941 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 5 states, 4 states have (on average 2.75) internal successors, (11), 4 states have internal predecessors, (11), 3 states have call successors, (8), 3 states have call predecessors, (8), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Stem has 30 letters. Loop has 3 letters. [2022-02-21 03:23:54,941 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:23:54,941 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.2 stem predicates 3 loop predicates [2022-02-21 03:23:54,941 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 54 states and 65 transitions. cyclomatic complexity: 15 Second operand has 5 states, 4 states have (on average 2.75) internal successors, (11), 4 states have internal predecessors, (11), 3 states have call successors, (8), 3 states have call predecessors, (8), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2022-02-21 03:23:55,024 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 54 states and 65 transitions. cyclomatic complexity: 15. Second operand has 5 states, 4 states have (on average 2.75) internal successors, (11), 4 states have internal predecessors, (11), 3 states have call successors, (8), 3 states have call predecessors, (8), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Result 64 states and 76 transitions. Complement of second has 13 states. [2022-02-21 03:23:55,024 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 5 states 2 stem states 2 non-accepting loop states 1 accepting loop states [2022-02-21 03:23:55,025 INFO L123 tractBuchiDifference]: Start testing correctness of buchiDifferenceNCSBLazy3 [2022-02-21 03:23:55,025 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 54 states and 65 transitions. cyclomatic complexity: 15 [2022-02-21 03:23:55,025 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 03:23:55,025 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 03:23:55,025 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 5 states, 4 states have (on average 2.75) internal successors, (11), 4 states have internal predecessors, (11), 3 states have call successors, (8), 3 states have call predecessors, (8), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2022-02-21 03:23:55,025 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2022-02-21 03:23:55,025 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 03:23:55,025 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 03:23:55,025 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 64 states and 76 transitions. [2022-02-21 03:23:55,025 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2022-02-21 03:23:55,025 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 03:23:55,025 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 03:23:55,025 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 54 states and 65 transitions. cyclomatic complexity: 15 [2022-02-21 03:23:55,026 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 3 examples of accepted words. [2022-02-21 03:23:55,026 INFO L70 LassoExtractor]: Start lassoExtractor. Operand has 5 states, 4 states have (on average 2.75) internal successors, (11), 4 states have internal predecessors, (11), 3 states have call successors, (8), 3 states have call predecessors, (8), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2022-02-21 03:23:55,026 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2022-02-21 03:23:55,026 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 1 examples of accepted words. [2022-02-21 03:23:55,026 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 64 states and 76 transitions. cyclomatic complexity: 16 [2022-02-21 03:23:55,026 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 3 examples of accepted words. [2022-02-21 03:23:55,026 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 54 states and 65 transitions. cyclomatic complexity: 15 Stem has 30 letters. Loop has 3 letters. [2022-02-21 03:23:55,026 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:23:55,027 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 5 states, 4 states have (on average 2.75) internal successors, (11), 4 states have internal predecessors, (11), 3 states have call successors, (8), 3 states have call predecessors, (8), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Stem has 30 letters. Loop has 3 letters. [2022-02-21 03:23:55,027 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:23:55,027 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 64 states and 76 transitions. cyclomatic complexity: 16 Stem has 30 letters. Loop has 3 letters. [2022-02-21 03:23:55,027 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:23:55,027 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 54 states and 65 transitions. cyclomatic complexity: 15 Stem has 2 letters. Loop has 3 letters. [2022-02-21 03:23:55,027 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:23:55,027 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 5 states, 4 states have (on average 2.75) internal successors, (11), 4 states have internal predecessors, (11), 3 states have call successors, (8), 3 states have call predecessors, (8), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Stem has 2 letters. Loop has 3 letters. [2022-02-21 03:23:55,027 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:23:55,027 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 64 states and 76 transitions. cyclomatic complexity: 16 Stem has 2 letters. Loop has 3 letters. [2022-02-21 03:23:55,027 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:23:55,027 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 54 states and 65 transitions. cyclomatic complexity: 15 Stem has 30 letters. Loop has 3 letters. [2022-02-21 03:23:55,027 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:23:55,027 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 5 states, 4 states have (on average 2.75) internal successors, (11), 4 states have internal predecessors, (11), 3 states have call successors, (8), 3 states have call predecessors, (8), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Stem has 30 letters. Loop has 3 letters. [2022-02-21 03:23:55,027 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:23:55,027 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 64 states and 76 transitions. cyclomatic complexity: 16 Stem has 30 letters. Loop has 3 letters. [2022-02-21 03:23:55,027 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:23:55,027 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 54 states and 65 transitions. cyclomatic complexity: 15 Stem has 64 letters. Loop has 64 letters. [2022-02-21 03:23:55,027 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:23:55,027 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 5 states, 4 states have (on average 2.75) internal successors, (11), 4 states have internal predecessors, (11), 3 states have call successors, (8), 3 states have call predecessors, (8), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Stem has 64 letters. Loop has 64 letters. [2022-02-21 03:23:55,027 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:23:55,027 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 64 states and 76 transitions. cyclomatic complexity: 16 Stem has 64 letters. Loop has 64 letters. [2022-02-21 03:23:55,027 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:23:55,027 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 54 states and 65 transitions. cyclomatic complexity: 15 Stem has 54 letters. Loop has 54 letters. [2022-02-21 03:23:55,027 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:23:55,027 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 5 states, 4 states have (on average 2.75) internal successors, (11), 4 states have internal predecessors, (11), 3 states have call successors, (8), 3 states have call predecessors, (8), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Stem has 54 letters. Loop has 54 letters. [2022-02-21 03:23:55,027 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:23:55,027 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 64 states and 76 transitions. cyclomatic complexity: 16 Stem has 54 letters. Loop has 54 letters. [2022-02-21 03:23:55,027 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:23:55,028 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 54 states and 65 transitions. cyclomatic complexity: 15 Stem has 5 letters. Loop has 5 letters. [2022-02-21 03:23:55,028 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:23:55,028 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 5 states, 4 states have (on average 2.75) internal successors, (11), 4 states have internal predecessors, (11), 3 states have call successors, (8), 3 states have call predecessors, (8), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Stem has 5 letters. Loop has 5 letters. [2022-02-21 03:23:55,028 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:23:55,028 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 64 states and 76 transitions. cyclomatic complexity: 16 Stem has 5 letters. Loop has 5 letters. [2022-02-21 03:23:55,028 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:23:55,028 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 54 states and 65 transitions. cyclomatic complexity: 15 Stem has 30 letters. Loop has 3 letters. [2022-02-21 03:23:55,028 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:23:55,028 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 5 states, 4 states have (on average 2.75) internal successors, (11), 4 states have internal predecessors, (11), 3 states have call successors, (8), 3 states have call predecessors, (8), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Stem has 30 letters. Loop has 3 letters. [2022-02-21 03:23:55,028 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:23:55,028 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 64 states and 76 transitions. cyclomatic complexity: 16 Stem has 30 letters. Loop has 3 letters. [2022-02-21 03:23:55,028 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:23:55,028 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 54 states and 65 transitions. cyclomatic complexity: 15 Stem has 31 letters. Loop has 3 letters. [2022-02-21 03:23:55,028 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:23:55,028 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 5 states, 4 states have (on average 2.75) internal successors, (11), 4 states have internal predecessors, (11), 3 states have call successors, (8), 3 states have call predecessors, (8), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Stem has 31 letters. Loop has 3 letters. [2022-02-21 03:23:55,028 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:23:55,028 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 64 states and 76 transitions. cyclomatic complexity: 16 Stem has 31 letters. Loop has 3 letters. [2022-02-21 03:23:55,028 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:23:55,028 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 54 states and 65 transitions. cyclomatic complexity: 15 Stem has 32 letters. Loop has 3 letters. [2022-02-21 03:23:55,028 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:23:55,028 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 5 states, 4 states have (on average 2.75) internal successors, (11), 4 states have internal predecessors, (11), 3 states have call successors, (8), 3 states have call predecessors, (8), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Stem has 32 letters. Loop has 3 letters. [2022-02-21 03:23:55,028 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:23:55,028 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 64 states and 76 transitions. cyclomatic complexity: 16 Stem has 32 letters. Loop has 3 letters. [2022-02-21 03:23:55,028 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:23:55,028 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 54 states and 65 transitions. cyclomatic complexity: 15 Stem has 2 letters. Loop has 3 letters. [2022-02-21 03:23:55,028 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:23:55,028 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 5 states, 4 states have (on average 2.75) internal successors, (11), 4 states have internal predecessors, (11), 3 states have call successors, (8), 3 states have call predecessors, (8), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Stem has 2 letters. Loop has 3 letters. [2022-02-21 03:23:55,029 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:23:55,029 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 64 states and 76 transitions. cyclomatic complexity: 16 Stem has 2 letters. Loop has 3 letters. [2022-02-21 03:23:55,029 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:23:55,029 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 54 states and 65 transitions. cyclomatic complexity: 15 Stem has 30 letters. Loop has 3 letters. [2022-02-21 03:23:55,029 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:23:55,029 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 5 states, 4 states have (on average 2.75) internal successors, (11), 4 states have internal predecessors, (11), 3 states have call successors, (8), 3 states have call predecessors, (8), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Stem has 30 letters. Loop has 3 letters. [2022-02-21 03:23:55,029 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:23:55,029 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 64 states and 76 transitions. cyclomatic complexity: 16 Stem has 30 letters. Loop has 3 letters. [2022-02-21 03:23:55,029 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:23:55,029 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 54 states and 65 transitions. cyclomatic complexity: 15 Stem has 31 letters. Loop has 3 letters. [2022-02-21 03:23:55,029 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:23:55,029 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 5 states, 4 states have (on average 2.75) internal successors, (11), 4 states have internal predecessors, (11), 3 states have call successors, (8), 3 states have call predecessors, (8), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Stem has 31 letters. Loop has 3 letters. [2022-02-21 03:23:55,030 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:23:55,030 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 64 states and 76 transitions. cyclomatic complexity: 16 Stem has 31 letters. Loop has 3 letters. [2022-02-21 03:23:55,030 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:23:55,030 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 54 states and 65 transitions. cyclomatic complexity: 15 Stem has 32 letters. Loop has 3 letters. [2022-02-21 03:23:55,030 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:23:55,030 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 5 states, 4 states have (on average 2.75) internal successors, (11), 4 states have internal predecessors, (11), 3 states have call successors, (8), 3 states have call predecessors, (8), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Stem has 32 letters. Loop has 3 letters. [2022-02-21 03:23:55,030 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:23:55,030 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 64 states and 76 transitions. cyclomatic complexity: 16 Stem has 32 letters. Loop has 3 letters. [2022-02-21 03:23:55,030 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:23:55,030 INFO L161 tractBuchiDifference]: Finished testing correctness of buchiDifferenceNCSBLazy3 [2022-02-21 03:23:55,031 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 4 states have (on average 2.75) internal successors, (11), 4 states have internal predecessors, (11), 3 states have call successors, (8), 3 states have call predecessors, (8), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2022-02-21 03:23:55,031 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 11 transitions. [2022-02-21 03:23:55,031 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 11 transitions. Stem has 30 letters. Loop has 3 letters. [2022-02-21 03:23:55,031 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:23:55,031 INFO L634 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2022-02-21 03:23:55,039 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:23:55,067 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:23:55,069 INFO L263 TraceCheckSpWp]: Trace formula consists of 266 conjuncts, 16 conjunts are in the unsatisfiable core [2022-02-21 03:23:55,083 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:23:55,084 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-21 03:23:55,198 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (60)] Forceful destruction successful, exit code 0 [2022-02-21 03:23:55,355 INFO L290 TraceCheckUtils]: 0: Hoare triple {10508#unseeded} assume { :begin_inline_ULTIMATE.init } true; {10508#unseeded} is VALID [2022-02-21 03:23:55,355 INFO L290 TraceCheckUtils]: 1: Hoare triple {10508#unseeded} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet5#1, main_#t~ret6#1, main_~x~0#1;main_~x~0#1 := main_#t~nondet5#1;havoc main_#t~nondet5#1; {10508#unseeded} is VALID [2022-02-21 03:23:55,356 INFO L272 TraceCheckUtils]: 2: Hoare triple {10508#unseeded} call main_#t~ret6#1 := rec2(main_~x~0#1); {10508#unseeded} is VALID [2022-02-21 03:23:55,356 INFO L290 TraceCheckUtils]: 3: Hoare triple {10508#unseeded} ~j := #in~j; {10508#unseeded} is VALID [2022-02-21 03:23:55,356 INFO L290 TraceCheckUtils]: 4: Hoare triple {10508#unseeded} assume !(~j <= 0); {10508#unseeded} is VALID [2022-02-21 03:23:55,357 INFO L272 TraceCheckUtils]: 5: Hoare triple {10508#unseeded} call #t~ret3 := rec1(~j); {10725#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2022-02-21 03:23:55,357 INFO L290 TraceCheckUtils]: 6: Hoare triple {10725#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} ~i := #in~i; {10725#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2022-02-21 03:23:55,358 INFO L290 TraceCheckUtils]: 7: Hoare triple {10725#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} assume !(~i <= 0); {10725#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2022-02-21 03:23:55,358 INFO L272 TraceCheckUtils]: 8: Hoare triple {10725#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} call #t~ret0 := rec1(~i - 2); {10725#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2022-02-21 03:23:55,358 INFO L290 TraceCheckUtils]: 9: Hoare triple {10725#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} ~i := #in~i; {10725#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2022-02-21 03:23:55,359 INFO L290 TraceCheckUtils]: 10: Hoare triple {10725#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} assume ~i <= 0;#res := 0; {10725#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2022-02-21 03:23:55,359 INFO L290 TraceCheckUtils]: 11: Hoare triple {10725#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} assume true; {10725#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2022-02-21 03:23:55,360 INFO L284 TraceCheckUtils]: 12: Hoare quadruple {10725#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} {10725#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} #28#return; {10725#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2022-02-21 03:23:55,360 INFO L272 TraceCheckUtils]: 13: Hoare triple {10725#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} call #t~ret1 := rec1(#t~ret0 - 1); {10725#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2022-02-21 03:23:55,361 INFO L290 TraceCheckUtils]: 14: Hoare triple {10725#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} ~i := #in~i; {10725#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2022-02-21 03:23:55,361 INFO L290 TraceCheckUtils]: 15: Hoare triple {10725#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} assume ~i <= 0;#res := 0; {10725#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2022-02-21 03:23:55,362 INFO L290 TraceCheckUtils]: 16: Hoare triple {10725#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} assume true; {10725#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2022-02-21 03:23:55,362 INFO L284 TraceCheckUtils]: 17: Hoare quadruple {10725#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} {10725#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} #30#return; {10725#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2022-02-21 03:23:55,363 INFO L272 TraceCheckUtils]: 18: Hoare triple {10725#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} call #t~ret2 := rec1(#t~ret1); {10725#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2022-02-21 03:23:55,363 INFO L290 TraceCheckUtils]: 19: Hoare triple {10725#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} ~i := #in~i; {10725#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2022-02-21 03:23:55,363 INFO L290 TraceCheckUtils]: 20: Hoare triple {10725#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} assume ~i <= 0;#res := 0; {10725#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2022-02-21 03:23:55,364 INFO L290 TraceCheckUtils]: 21: Hoare triple {10725#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} assume true; {10725#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2022-02-21 03:23:55,364 INFO L284 TraceCheckUtils]: 22: Hoare quadruple {10725#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} {10725#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} #32#return; {10725#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2022-02-21 03:23:55,365 INFO L290 TraceCheckUtils]: 23: Hoare triple {10725#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} #res := 1 + #t~ret2;havoc #t~ret0;havoc #t~ret1;havoc #t~ret2; {10725#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2022-02-21 03:23:55,365 INFO L290 TraceCheckUtils]: 24: Hoare triple {10725#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} assume true; {10725#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2022-02-21 03:23:55,366 INFO L284 TraceCheckUtils]: 25: Hoare quadruple {10725#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} {10508#unseeded} #34#return; {10508#unseeded} is VALID [2022-02-21 03:23:55,366 INFO L272 TraceCheckUtils]: 26: Hoare triple {10508#unseeded} call #t~ret4 := rec2(#t~ret3 - 1); {10508#unseeded} is VALID [2022-02-21 03:23:55,366 INFO L290 TraceCheckUtils]: 27: Hoare triple {10508#unseeded} ~j := #in~j; {10508#unseeded} is VALID [2022-02-21 03:23:55,367 INFO L290 TraceCheckUtils]: 28: Hoare triple {10508#unseeded} assume !(~j <= 0); {10508#unseeded} is VALID [2022-02-21 03:23:55,367 INFO L272 TraceCheckUtils]: 29: Hoare triple {10508#unseeded} call #t~ret3 := rec1(~j); {10508#unseeded} is VALID [2022-02-21 03:23:55,372 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:23:55,372 INFO L263 TraceCheckSpWp]: Trace formula consists of 37 conjuncts, 7 conjunts are in the unsatisfiable core [2022-02-21 03:23:55,376 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:23:55,376 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-21 03:23:55,404 INFO L290 TraceCheckUtils]: 0: Hoare triple {10511#(>= oldRank0 |rec1_#in~i|)} ~i := #in~i; {10798#(<= rec1_~i oldRank0)} is VALID [2022-02-21 03:23:55,405 INFO L290 TraceCheckUtils]: 1: Hoare triple {10798#(<= rec1_~i oldRank0)} assume !(~i <= 0); {10802#(and (not (<= rec1_~i 0)) (<= rec1_~i oldRank0))} is VALID [2022-02-21 03:23:55,405 INFO L272 TraceCheckUtils]: 2: Hoare triple {10802#(and (not (<= rec1_~i 0)) (<= rec1_~i oldRank0))} call #t~ret0 := rec1(~i - 2); {10521#(or (and (>= oldRank0 0) (> oldRank0 |rec1_#in~i|)) unseeded)} is VALID [2022-02-21 03:23:55,405 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-21 03:23:55,406 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 5 states, 4 states have (on average 2.75) internal successors, (11), 4 states have internal predecessors, (11), 3 states have call successors, (8), 3 states have call predecessors, (8), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2022-02-21 03:23:55,438 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 23 edges. 23 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-21 03:23:55,438 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 5 states, 4 states have (on average 2.75) internal successors, (11), 4 states have internal predecessors, (11), 3 states have call successors, (8), 3 states have call predecessors, (8), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Stem has 30 letters. Loop has 3 letters. [2022-02-21 03:23:55,438 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:23:55,438 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and with honda bouncer for loop.2 stem predicates 3 loop predicates [2022-02-21 03:23:55,438 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 54 states and 65 transitions. cyclomatic complexity: 15 Second operand has 5 states, 4 states have (on average 2.75) internal successors, (11), 4 states have internal predecessors, (11), 3 states have call successors, (8), 3 states have call predecessors, (8), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2022-02-21 03:23:55,508 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 54 states and 65 transitions. cyclomatic complexity: 15. Second operand has 5 states, 4 states have (on average 2.75) internal successors, (11), 4 states have internal predecessors, (11), 3 states have call successors, (8), 3 states have call predecessors, (8), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Result 64 states and 76 transitions. Complement of second has 13 states. [2022-02-21 03:23:55,509 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 5 states 2 stem states 2 non-accepting loop states 1 accepting loop states [2022-02-21 03:23:55,509 INFO L123 tractBuchiDifference]: Start testing correctness of buchiDifferenceNCSBLazy3 [2022-02-21 03:23:55,509 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 54 states and 65 transitions. cyclomatic complexity: 15 [2022-02-21 03:23:55,509 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 03:23:55,509 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 03:23:55,509 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 5 states, 4 states have (on average 2.75) internal successors, (11), 4 states have internal predecessors, (11), 3 states have call successors, (8), 3 states have call predecessors, (8), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2022-02-21 03:23:55,509 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2022-02-21 03:23:55,509 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 03:23:55,509 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 03:23:55,509 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 64 states and 76 transitions. [2022-02-21 03:23:55,509 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2022-02-21 03:23:55,509 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 03:23:55,509 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 03:23:55,510 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 54 states and 65 transitions. cyclomatic complexity: 15 [2022-02-21 03:23:55,510 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 3 examples of accepted words. [2022-02-21 03:23:55,510 INFO L70 LassoExtractor]: Start lassoExtractor. Operand has 5 states, 4 states have (on average 2.75) internal successors, (11), 4 states have internal predecessors, (11), 3 states have call successors, (8), 3 states have call predecessors, (8), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2022-02-21 03:23:55,510 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2022-02-21 03:23:55,510 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 1 examples of accepted words. [2022-02-21 03:23:55,510 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 64 states and 76 transitions. cyclomatic complexity: 16 [2022-02-21 03:23:55,510 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 3 examples of accepted words. [2022-02-21 03:23:55,510 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 54 states and 65 transitions. cyclomatic complexity: 15 Stem has 30 letters. Loop has 3 letters. [2022-02-21 03:23:55,510 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:23:55,510 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 5 states, 4 states have (on average 2.75) internal successors, (11), 4 states have internal predecessors, (11), 3 states have call successors, (8), 3 states have call predecessors, (8), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Stem has 30 letters. Loop has 3 letters. [2022-02-21 03:23:55,511 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:23:55,511 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 64 states and 76 transitions. cyclomatic complexity: 16 Stem has 30 letters. Loop has 3 letters. [2022-02-21 03:23:55,511 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:23:55,511 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 54 states and 65 transitions. cyclomatic complexity: 15 Stem has 2 letters. Loop has 3 letters. [2022-02-21 03:23:55,511 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:23:55,511 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 5 states, 4 states have (on average 2.75) internal successors, (11), 4 states have internal predecessors, (11), 3 states have call successors, (8), 3 states have call predecessors, (8), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Stem has 2 letters. Loop has 3 letters. [2022-02-21 03:23:55,511 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:23:55,511 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 64 states and 76 transitions. cyclomatic complexity: 16 Stem has 2 letters. Loop has 3 letters. [2022-02-21 03:23:55,511 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:23:55,511 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 54 states and 65 transitions. cyclomatic complexity: 15 Stem has 30 letters. Loop has 3 letters. [2022-02-21 03:23:55,511 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:23:55,511 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 5 states, 4 states have (on average 2.75) internal successors, (11), 4 states have internal predecessors, (11), 3 states have call successors, (8), 3 states have call predecessors, (8), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Stem has 30 letters. Loop has 3 letters. [2022-02-21 03:23:55,511 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:23:55,511 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 64 states and 76 transitions. cyclomatic complexity: 16 Stem has 30 letters. Loop has 3 letters. [2022-02-21 03:23:55,511 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:23:55,511 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 54 states and 65 transitions. cyclomatic complexity: 15 Stem has 64 letters. Loop has 64 letters. [2022-02-21 03:23:55,511 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:23:55,511 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 5 states, 4 states have (on average 2.75) internal successors, (11), 4 states have internal predecessors, (11), 3 states have call successors, (8), 3 states have call predecessors, (8), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Stem has 64 letters. Loop has 64 letters. [2022-02-21 03:23:55,511 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:23:55,511 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 64 states and 76 transitions. cyclomatic complexity: 16 Stem has 64 letters. Loop has 64 letters. [2022-02-21 03:23:55,511 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:23:55,511 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 54 states and 65 transitions. cyclomatic complexity: 15 Stem has 54 letters. Loop has 54 letters. [2022-02-21 03:23:55,512 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:23:55,512 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 5 states, 4 states have (on average 2.75) internal successors, (11), 4 states have internal predecessors, (11), 3 states have call successors, (8), 3 states have call predecessors, (8), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Stem has 54 letters. Loop has 54 letters. [2022-02-21 03:23:55,512 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:23:55,512 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 64 states and 76 transitions. cyclomatic complexity: 16 Stem has 54 letters. Loop has 54 letters. [2022-02-21 03:23:55,512 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:23:55,512 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 54 states and 65 transitions. cyclomatic complexity: 15 Stem has 5 letters. Loop has 5 letters. [2022-02-21 03:23:55,512 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:23:55,512 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 5 states, 4 states have (on average 2.75) internal successors, (11), 4 states have internal predecessors, (11), 3 states have call successors, (8), 3 states have call predecessors, (8), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Stem has 5 letters. Loop has 5 letters. [2022-02-21 03:23:55,512 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:23:55,512 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 64 states and 76 transitions. cyclomatic complexity: 16 Stem has 5 letters. Loop has 5 letters. [2022-02-21 03:23:55,512 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:23:55,512 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 54 states and 65 transitions. cyclomatic complexity: 15 Stem has 30 letters. Loop has 3 letters. [2022-02-21 03:23:55,512 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:23:55,512 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 5 states, 4 states have (on average 2.75) internal successors, (11), 4 states have internal predecessors, (11), 3 states have call successors, (8), 3 states have call predecessors, (8), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Stem has 30 letters. Loop has 3 letters. [2022-02-21 03:23:55,512 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:23:55,512 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 64 states and 76 transitions. cyclomatic complexity: 16 Stem has 30 letters. Loop has 3 letters. [2022-02-21 03:23:55,512 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:23:55,512 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 54 states and 65 transitions. cyclomatic complexity: 15 Stem has 31 letters. Loop has 3 letters. [2022-02-21 03:23:55,512 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:23:55,512 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 5 states, 4 states have (on average 2.75) internal successors, (11), 4 states have internal predecessors, (11), 3 states have call successors, (8), 3 states have call predecessors, (8), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Stem has 31 letters. Loop has 3 letters. [2022-02-21 03:23:55,512 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:23:55,512 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 64 states and 76 transitions. cyclomatic complexity: 16 Stem has 31 letters. Loop has 3 letters. [2022-02-21 03:23:55,513 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:23:55,513 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 54 states and 65 transitions. cyclomatic complexity: 15 Stem has 32 letters. Loop has 3 letters. [2022-02-21 03:23:55,513 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:23:55,513 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 5 states, 4 states have (on average 2.75) internal successors, (11), 4 states have internal predecessors, (11), 3 states have call successors, (8), 3 states have call predecessors, (8), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Stem has 32 letters. Loop has 3 letters. [2022-02-21 03:23:55,513 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:23:55,513 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 64 states and 76 transitions. cyclomatic complexity: 16 Stem has 32 letters. Loop has 3 letters. [2022-02-21 03:23:55,513 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:23:55,513 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 54 states and 65 transitions. cyclomatic complexity: 15 Stem has 2 letters. Loop has 3 letters. [2022-02-21 03:23:55,513 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:23:55,513 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 5 states, 4 states have (on average 2.75) internal successors, (11), 4 states have internal predecessors, (11), 3 states have call successors, (8), 3 states have call predecessors, (8), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Stem has 2 letters. Loop has 3 letters. [2022-02-21 03:23:55,513 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:23:55,514 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 64 states and 76 transitions. cyclomatic complexity: 16 Stem has 2 letters. Loop has 3 letters. [2022-02-21 03:23:55,514 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:23:55,514 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 54 states and 65 transitions. cyclomatic complexity: 15 Stem has 32 letters. Loop has 3 letters. [2022-02-21 03:23:55,514 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:23:55,514 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 5 states, 4 states have (on average 2.75) internal successors, (11), 4 states have internal predecessors, (11), 3 states have call successors, (8), 3 states have call predecessors, (8), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Stem has 32 letters. Loop has 3 letters. [2022-02-21 03:23:55,514 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:23:55,514 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 64 states and 76 transitions. cyclomatic complexity: 16 Stem has 32 letters. Loop has 3 letters. [2022-02-21 03:23:55,514 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:23:55,514 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 54 states and 65 transitions. cyclomatic complexity: 15 Stem has 30 letters. Loop has 3 letters. [2022-02-21 03:23:55,514 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:23:55,514 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 5 states, 4 states have (on average 2.75) internal successors, (11), 4 states have internal predecessors, (11), 3 states have call successors, (8), 3 states have call predecessors, (8), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Stem has 30 letters. Loop has 3 letters. [2022-02-21 03:23:55,515 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:23:55,515 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 64 states and 76 transitions. cyclomatic complexity: 16 Stem has 30 letters. Loop has 3 letters. [2022-02-21 03:23:55,515 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:23:55,515 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 54 states and 65 transitions. cyclomatic complexity: 15 Stem has 31 letters. Loop has 3 letters. [2022-02-21 03:23:55,515 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:23:55,515 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 5 states, 4 states have (on average 2.75) internal successors, (11), 4 states have internal predecessors, (11), 3 states have call successors, (8), 3 states have call predecessors, (8), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Stem has 31 letters. Loop has 3 letters. [2022-02-21 03:23:55,515 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:23:55,515 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 64 states and 76 transitions. cyclomatic complexity: 16 Stem has 31 letters. Loop has 3 letters. [2022-02-21 03:23:55,515 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:23:55,515 INFO L161 tractBuchiDifference]: Finished testing correctness of buchiDifferenceNCSBLazy3 [2022-02-21 03:23:55,516 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 4 states have (on average 2.75) internal successors, (11), 4 states have internal predecessors, (11), 3 states have call successors, (8), 3 states have call predecessors, (8), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2022-02-21 03:23:55,516 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 11 transitions. [2022-02-21 03:23:55,516 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 11 transitions. Stem has 30 letters. Loop has 3 letters. [2022-02-21 03:23:55,516 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:23:55,516 INFO L634 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2022-02-21 03:23:55,523 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:23:55,549 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:23:55,550 INFO L263 TraceCheckSpWp]: Trace formula consists of 266 conjuncts, 16 conjunts are in the unsatisfiable core [2022-02-21 03:23:55,559 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:23:55,559 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-21 03:23:55,779 INFO L290 TraceCheckUtils]: 0: Hoare triple {10508#unseeded} assume { :begin_inline_ULTIMATE.init } true; {10508#unseeded} is VALID [2022-02-21 03:23:55,780 INFO L290 TraceCheckUtils]: 1: Hoare triple {10508#unseeded} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet5#1, main_#t~ret6#1, main_~x~0#1;main_~x~0#1 := main_#t~nondet5#1;havoc main_#t~nondet5#1; {10508#unseeded} is VALID [2022-02-21 03:23:55,780 INFO L272 TraceCheckUtils]: 2: Hoare triple {10508#unseeded} call main_#t~ret6#1 := rec2(main_~x~0#1); {10508#unseeded} is VALID [2022-02-21 03:23:55,780 INFO L290 TraceCheckUtils]: 3: Hoare triple {10508#unseeded} ~j := #in~j; {10508#unseeded} is VALID [2022-02-21 03:23:55,781 INFO L290 TraceCheckUtils]: 4: Hoare triple {10508#unseeded} assume !(~j <= 0); {10508#unseeded} is VALID [2022-02-21 03:23:55,781 INFO L272 TraceCheckUtils]: 5: Hoare triple {10508#unseeded} call #t~ret3 := rec1(~j); {10909#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2022-02-21 03:23:55,782 INFO L290 TraceCheckUtils]: 6: Hoare triple {10909#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} ~i := #in~i; {10909#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2022-02-21 03:23:55,782 INFO L290 TraceCheckUtils]: 7: Hoare triple {10909#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} assume !(~i <= 0); {10909#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2022-02-21 03:23:55,783 INFO L272 TraceCheckUtils]: 8: Hoare triple {10909#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} call #t~ret0 := rec1(~i - 2); {10909#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2022-02-21 03:23:55,783 INFO L290 TraceCheckUtils]: 9: Hoare triple {10909#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} ~i := #in~i; {10909#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2022-02-21 03:23:55,783 INFO L290 TraceCheckUtils]: 10: Hoare triple {10909#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} assume ~i <= 0;#res := 0; {10909#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2022-02-21 03:23:55,784 INFO L290 TraceCheckUtils]: 11: Hoare triple {10909#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} assume true; {10909#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2022-02-21 03:23:55,785 INFO L284 TraceCheckUtils]: 12: Hoare quadruple {10909#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} {10909#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} #28#return; {10909#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2022-02-21 03:23:55,785 INFO L272 TraceCheckUtils]: 13: Hoare triple {10909#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} call #t~ret1 := rec1(#t~ret0 - 1); {10909#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2022-02-21 03:23:55,785 INFO L290 TraceCheckUtils]: 14: Hoare triple {10909#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} ~i := #in~i; {10909#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2022-02-21 03:23:55,786 INFO L290 TraceCheckUtils]: 15: Hoare triple {10909#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} assume ~i <= 0;#res := 0; {10909#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2022-02-21 03:23:55,786 INFO L290 TraceCheckUtils]: 16: Hoare triple {10909#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} assume true; {10909#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2022-02-21 03:23:55,787 INFO L284 TraceCheckUtils]: 17: Hoare quadruple {10909#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} {10909#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} #30#return; {10909#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2022-02-21 03:23:55,788 INFO L272 TraceCheckUtils]: 18: Hoare triple {10909#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} call #t~ret2 := rec1(#t~ret1); {10909#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2022-02-21 03:23:55,788 INFO L290 TraceCheckUtils]: 19: Hoare triple {10909#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} ~i := #in~i; {10909#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2022-02-21 03:23:55,788 INFO L290 TraceCheckUtils]: 20: Hoare triple {10909#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} assume ~i <= 0;#res := 0; {10909#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2022-02-21 03:23:55,789 INFO L290 TraceCheckUtils]: 21: Hoare triple {10909#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} assume true; {10909#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2022-02-21 03:23:55,789 INFO L284 TraceCheckUtils]: 22: Hoare quadruple {10909#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} {10909#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} #32#return; {10909#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2022-02-21 03:23:55,790 INFO L290 TraceCheckUtils]: 23: Hoare triple {10909#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} #res := 1 + #t~ret2;havoc #t~ret0;havoc #t~ret1;havoc #t~ret2; {10909#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2022-02-21 03:23:55,790 INFO L290 TraceCheckUtils]: 24: Hoare triple {10909#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} assume true; {10909#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2022-02-21 03:23:55,791 INFO L284 TraceCheckUtils]: 25: Hoare quadruple {10909#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} {10508#unseeded} #34#return; {10508#unseeded} is VALID [2022-02-21 03:23:55,791 INFO L272 TraceCheckUtils]: 26: Hoare triple {10508#unseeded} call #t~ret4 := rec2(#t~ret3 - 1); {10508#unseeded} is VALID [2022-02-21 03:23:55,792 INFO L290 TraceCheckUtils]: 27: Hoare triple {10508#unseeded} ~j := #in~j; {10508#unseeded} is VALID [2022-02-21 03:23:55,792 INFO L290 TraceCheckUtils]: 28: Hoare triple {10508#unseeded} assume !(~j <= 0); {10508#unseeded} is VALID [2022-02-21 03:23:55,793 INFO L272 TraceCheckUtils]: 29: Hoare triple {10508#unseeded} call #t~ret3 := rec1(~j); {10508#unseeded} is VALID [2022-02-21 03:23:55,798 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:23:55,799 INFO L263 TraceCheckSpWp]: Trace formula consists of 37 conjuncts, 7 conjunts are in the unsatisfiable core [2022-02-21 03:23:55,802 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:23:55,803 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-21 03:23:55,831 INFO L290 TraceCheckUtils]: 0: Hoare triple {10511#(>= oldRank0 |rec1_#in~i|)} ~i := #in~i; {10982#(<= rec1_~i oldRank0)} is VALID [2022-02-21 03:23:55,831 INFO L290 TraceCheckUtils]: 1: Hoare triple {10982#(<= rec1_~i oldRank0)} assume !(~i <= 0); {10986#(and (not (<= rec1_~i 0)) (<= rec1_~i oldRank0))} is VALID [2022-02-21 03:23:55,832 INFO L272 TraceCheckUtils]: 2: Hoare triple {10986#(and (not (<= rec1_~i 0)) (<= rec1_~i oldRank0))} call #t~ret0 := rec1(~i - 2); {10521#(or (and (>= oldRank0 0) (> oldRank0 |rec1_#in~i|)) unseeded)} is VALID [2022-02-21 03:23:55,832 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-21 03:23:55,833 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 5 states, 4 states have (on average 2.75) internal successors, (11), 4 states have internal predecessors, (11), 3 states have call successors, (8), 3 states have call predecessors, (8), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2022-02-21 03:23:55,854 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 23 edges. 23 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-21 03:23:55,855 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 5 states, 4 states have (on average 2.75) internal successors, (11), 4 states have internal predecessors, (11), 3 states have call successors, (8), 3 states have call predecessors, (8), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Stem has 30 letters. Loop has 3 letters. [2022-02-21 03:23:55,855 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:23:55,855 INFO L152 lantAutomatonBouncer]: Defining Buchi interpolant automaton with scrooge nondeterminism in stemwith honda bouncer for stem and without honda bouncer for loop.2 stem predicates 3 loop predicates [2022-02-21 03:23:55,855 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 54 states and 65 transitions. cyclomatic complexity: 15 Second operand has 5 states, 4 states have (on average 2.75) internal successors, (11), 4 states have internal predecessors, (11), 3 states have call successors, (8), 3 states have call predecessors, (8), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2022-02-21 03:23:55,975 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 54 states and 65 transitions. cyclomatic complexity: 15. Second operand has 5 states, 4 states have (on average 2.75) internal successors, (11), 4 states have internal predecessors, (11), 3 states have call successors, (8), 3 states have call predecessors, (8), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Result 78 states and 90 transitions. Complement of second has 13 states. [2022-02-21 03:23:55,976 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 5 states 2 stem states 2 non-accepting loop states 1 accepting loop states [2022-02-21 03:23:55,976 INFO L123 tractBuchiDifference]: Start testing correctness of buchiDifferenceNCSBLazy3 [2022-02-21 03:23:55,976 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 54 states and 65 transitions. cyclomatic complexity: 15 [2022-02-21 03:23:55,976 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 03:23:55,976 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 03:23:55,976 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 5 states, 4 states have (on average 2.75) internal successors, (11), 4 states have internal predecessors, (11), 3 states have call successors, (8), 3 states have call predecessors, (8), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2022-02-21 03:23:55,977 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2022-02-21 03:23:55,977 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 03:23:55,977 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 03:23:55,977 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 78 states and 90 transitions. [2022-02-21 03:23:55,977 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2022-02-21 03:23:55,977 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2022-02-21 03:23:55,978 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 54 states and 65 transitions. cyclomatic complexity: 15 [2022-02-21 03:23:55,978 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 3 examples of accepted words. [2022-02-21 03:23:55,978 INFO L70 LassoExtractor]: Start lassoExtractor. Operand has 5 states, 4 states have (on average 2.75) internal successors, (11), 4 states have internal predecessors, (11), 3 states have call successors, (8), 3 states have call predecessors, (8), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2022-02-21 03:23:55,978 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2022-02-21 03:23:55,978 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 1 examples of accepted words. [2022-02-21 03:23:55,979 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 78 states and 90 transitions. cyclomatic complexity: 16 [2022-02-21 03:23:55,979 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 78 states and 90 transitions. cyclomatic complexity: 16 [2022-02-21 03:23:55,979 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2022-02-21 03:23:55,979 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 0 examples of accepted words. [2022-02-21 03:23:55,979 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 54 states and 65 transitions. cyclomatic complexity: 15 Stem has 30 letters. Loop has 3 letters. [2022-02-21 03:23:55,979 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:23:55,979 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 5 states, 4 states have (on average 2.75) internal successors, (11), 4 states have internal predecessors, (11), 3 states have call successors, (8), 3 states have call predecessors, (8), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Stem has 30 letters. Loop has 3 letters. [2022-02-21 03:23:55,979 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:23:55,979 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 78 states and 90 transitions. cyclomatic complexity: 16 Stem has 30 letters. Loop has 3 letters. [2022-02-21 03:23:55,980 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:23:55,980 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 54 states and 65 transitions. cyclomatic complexity: 15 Stem has 2 letters. Loop has 3 letters. [2022-02-21 03:23:55,980 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:23:55,980 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 5 states, 4 states have (on average 2.75) internal successors, (11), 4 states have internal predecessors, (11), 3 states have call successors, (8), 3 states have call predecessors, (8), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Stem has 2 letters. Loop has 3 letters. [2022-02-21 03:23:55,980 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:23:55,980 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 78 states and 90 transitions. cyclomatic complexity: 16 Stem has 2 letters. Loop has 3 letters. [2022-02-21 03:23:55,980 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:23:55,980 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 54 states and 65 transitions. cyclomatic complexity: 15 Stem has 78 letters. Loop has 78 letters. [2022-02-21 03:23:55,980 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:23:55,981 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 5 states, 4 states have (on average 2.75) internal successors, (11), 4 states have internal predecessors, (11), 3 states have call successors, (8), 3 states have call predecessors, (8), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Stem has 78 letters. Loop has 78 letters. [2022-02-21 03:23:55,981 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:23:55,981 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 78 states and 90 transitions. cyclomatic complexity: 16 Stem has 78 letters. Loop has 78 letters. [2022-02-21 03:23:55,981 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:23:55,981 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 54 states and 65 transitions. cyclomatic complexity: 15 Stem has 54 letters. Loop has 54 letters. [2022-02-21 03:23:55,981 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:23:55,981 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 5 states, 4 states have (on average 2.75) internal successors, (11), 4 states have internal predecessors, (11), 3 states have call successors, (8), 3 states have call predecessors, (8), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Stem has 54 letters. Loop has 54 letters. [2022-02-21 03:23:55,981 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:23:55,981 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 78 states and 90 transitions. cyclomatic complexity: 16 Stem has 54 letters. Loop has 54 letters. [2022-02-21 03:23:55,981 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:23:55,982 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 54 states and 65 transitions. cyclomatic complexity: 15 Stem has 5 letters. Loop has 5 letters. [2022-02-21 03:23:55,982 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:23:55,982 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 5 states, 4 states have (on average 2.75) internal successors, (11), 4 states have internal predecessors, (11), 3 states have call successors, (8), 3 states have call predecessors, (8), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Stem has 5 letters. Loop has 5 letters. [2022-02-21 03:23:55,982 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:23:55,982 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 78 states and 90 transitions. cyclomatic complexity: 16 Stem has 5 letters. Loop has 5 letters. [2022-02-21 03:23:55,982 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:23:55,982 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 54 states and 65 transitions. cyclomatic complexity: 15 Stem has 30 letters. Loop has 3 letters. [2022-02-21 03:23:55,982 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:23:55,982 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 5 states, 4 states have (on average 2.75) internal successors, (11), 4 states have internal predecessors, (11), 3 states have call successors, (8), 3 states have call predecessors, (8), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Stem has 30 letters. Loop has 3 letters. [2022-02-21 03:23:55,983 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:23:55,983 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 78 states and 90 transitions. cyclomatic complexity: 16 Stem has 30 letters. Loop has 3 letters. [2022-02-21 03:23:55,983 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:23:55,983 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 54 states and 65 transitions. cyclomatic complexity: 15 Stem has 31 letters. Loop has 3 letters. [2022-02-21 03:23:55,983 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:23:55,983 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 5 states, 4 states have (on average 2.75) internal successors, (11), 4 states have internal predecessors, (11), 3 states have call successors, (8), 3 states have call predecessors, (8), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Stem has 31 letters. Loop has 3 letters. [2022-02-21 03:23:55,983 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:23:55,983 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 78 states and 90 transitions. cyclomatic complexity: 16 Stem has 31 letters. Loop has 3 letters. [2022-02-21 03:23:55,984 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:23:55,984 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 54 states and 65 transitions. cyclomatic complexity: 15 Stem has 32 letters. Loop has 3 letters. [2022-02-21 03:23:55,984 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:23:55,984 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 5 states, 4 states have (on average 2.75) internal successors, (11), 4 states have internal predecessors, (11), 3 states have call successors, (8), 3 states have call predecessors, (8), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Stem has 32 letters. Loop has 3 letters. [2022-02-21 03:23:55,984 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:23:55,984 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 78 states and 90 transitions. cyclomatic complexity: 16 Stem has 32 letters. Loop has 3 letters. [2022-02-21 03:23:55,984 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:23:55,984 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 54 states and 65 transitions. cyclomatic complexity: 15 Stem has 2 letters. Loop has 3 letters. [2022-02-21 03:23:55,984 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:23:55,985 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 5 states, 4 states have (on average 2.75) internal successors, (11), 4 states have internal predecessors, (11), 3 states have call successors, (8), 3 states have call predecessors, (8), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Stem has 2 letters. Loop has 3 letters. [2022-02-21 03:23:55,985 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:23:55,985 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 78 states and 90 transitions. cyclomatic complexity: 16 Stem has 2 letters. Loop has 3 letters. [2022-02-21 03:23:55,985 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:23:55,985 INFO L161 tractBuchiDifference]: Finished testing correctness of buchiDifferenceNCSBLazy3 [2022-02-21 03:23:55,985 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 4 states have (on average 2.75) internal successors, (11), 4 states have internal predecessors, (11), 3 states have call successors, (8), 3 states have call predecessors, (8), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2022-02-21 03:23:55,986 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 25 transitions. [2022-02-21 03:23:55,986 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 25 transitions. Stem has 30 letters. Loop has 3 letters. [2022-02-21 03:23:55,986 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:23:55,986 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 25 transitions. Stem has 33 letters. Loop has 3 letters. [2022-02-21 03:23:55,986 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:23:55,986 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 25 transitions. Stem has 30 letters. Loop has 6 letters. [2022-02-21 03:23:55,987 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:23:55,987 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 78 states and 90 transitions. cyclomatic complexity: 16 [2022-02-21 03:23:55,988 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2022-02-21 03:23:55,988 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 78 states to 0 states and 0 transitions. [2022-02-21 03:23:55,988 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2022-02-21 03:23:55,988 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2022-02-21 03:23:55,988 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2022-02-21 03:23:55,989 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-02-21 03:23:55,989 INFO L681 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2022-02-21 03:23:55,989 INFO L704 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2022-02-21 03:23:55,989 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-21 03:23:55,989 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-02-21 03:23:55,989 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2022-02-21 03:23:55,989 INFO L87 Difference]: Start difference. First operand 0 states and 0 transitions. Second operand has 8 states, 6 states have (on average 2.3333333333333335) internal successors, (14), 5 states have internal predecessors, (14), 3 states have call successors, (7), 3 states have call predecessors, (7), 3 states have return successors, (4), 3 states have call predecessors, (4), 1 states have call successors, (4) [2022-02-21 03:23:55,990 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:23:55,990 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2022-02-21 03:23:55,990 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-02-21 03:23:55,990 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 8 states, 6 states have (on average 2.3333333333333335) internal successors, (14), 5 states have internal predecessors, (14), 3 states have call successors, (7), 3 states have call predecessors, (7), 3 states have return successors, (4), 3 states have call predecessors, (4), 1 states have call successors, (4) [2022-02-21 03:23:56,006 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 25 edges. 25 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-21 03:23:56,007 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 0 states and 0 transitions. [2022-02-21 03:23:56,007 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2022-02-21 03:23:56,007 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 0 states to 0 states and 0 transitions. [2022-02-21 03:23:56,008 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2022-02-21 03:23:56,008 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2022-02-21 03:23:56,008 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2022-02-21 03:23:56,008 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-02-21 03:23:56,008 INFO L681 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2022-02-21 03:23:56,008 INFO L704 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2022-02-21 03:23:56,008 INFO L587 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2022-02-21 03:23:56,008 INFO L425 BuchiCegarLoop]: ======== Iteration 8============ [2022-02-21 03:23:56,008 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2022-02-21 03:23:56,008 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2022-02-21 03:23:56,008 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2022-02-21 03:23:56,013 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 21.02 03:23:56 BoogieIcfgContainer [2022-02-21 03:23:56,013 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2022-02-21 03:23:56,014 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2022-02-21 03:23:56,014 INFO L271 PluginConnector]: Initializing Witness Printer... [2022-02-21 03:23:56,014 INFO L275 PluginConnector]: Witness Printer initialized [2022-02-21 03:23:56,014 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.02 03:23:44" (3/4) ... [2022-02-21 03:23:56,016 INFO L140 WitnessPrinter]: No result that supports witness generation found [2022-02-21 03:23:56,016 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2022-02-21 03:23:56,017 INFO L158 Benchmark]: Toolchain (without parser) took 11783.46ms. Allocated memory was 104.9MB in the beginning and 220.2MB in the end (delta: 115.3MB). Free memory was 76.3MB in the beginning and 178.2MB in the end (delta: -102.0MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2022-02-21 03:23:56,017 INFO L158 Benchmark]: CDTParser took 0.16ms. Allocated memory is still 104.9MB. Free memory was 62.1MB in the beginning and 62.0MB in the end (delta: 86.5kB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-02-21 03:23:56,018 INFO L158 Benchmark]: CACSL2BoogieTranslator took 159.59ms. Allocated memory was 104.9MB in the beginning and 125.8MB in the end (delta: 21.0MB). Free memory was 76.0MB in the beginning and 102.2MB in the end (delta: -26.3MB). Peak memory consumption was 9.0MB. Max. memory is 16.1GB. [2022-02-21 03:23:56,018 INFO L158 Benchmark]: Boogie Procedure Inliner took 19.21ms. Allocated memory is still 125.8MB. Free memory was 101.7MB in the beginning and 100.6MB in the end (delta: 1.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-02-21 03:23:56,018 INFO L158 Benchmark]: Boogie Preprocessor took 10.10ms. Allocated memory is still 125.8MB. Free memory was 100.6MB in the beginning and 99.7MB in the end (delta: 977.8kB). There was no memory consumed. Max. memory is 16.1GB. [2022-02-21 03:23:56,018 INFO L158 Benchmark]: RCFGBuilder took 205.61ms. Allocated memory is still 125.8MB. Free memory was 99.7MB in the beginning and 90.8MB in the end (delta: 8.9MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2022-02-21 03:23:56,018 INFO L158 Benchmark]: BuchiAutomizer took 11380.88ms. Allocated memory was 125.8MB in the beginning and 220.2MB in the end (delta: 94.4MB). Free memory was 90.8MB in the beginning and 178.2MB in the end (delta: -87.5MB). Peak memory consumption was 7.8MB. Max. memory is 16.1GB. [2022-02-21 03:23:56,018 INFO L158 Benchmark]: Witness Printer took 2.63ms. Allocated memory is still 220.2MB. Free memory is still 178.2MB. There was no memory consumed. Max. memory is 16.1GB. [2022-02-21 03:23:56,019 INFO L339 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.16ms. Allocated memory is still 104.9MB. Free memory was 62.1MB in the beginning and 62.0MB in the end (delta: 86.5kB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 159.59ms. Allocated memory was 104.9MB in the beginning and 125.8MB in the end (delta: 21.0MB). Free memory was 76.0MB in the beginning and 102.2MB in the end (delta: -26.3MB). Peak memory consumption was 9.0MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 19.21ms. Allocated memory is still 125.8MB. Free memory was 101.7MB in the beginning and 100.6MB in the end (delta: 1.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 10.10ms. Allocated memory is still 125.8MB. Free memory was 100.6MB in the beginning and 99.7MB in the end (delta: 977.8kB). There was no memory consumed. Max. memory is 16.1GB. * RCFGBuilder took 205.61ms. Allocated memory is still 125.8MB. Free memory was 99.7MB in the beginning and 90.8MB in the end (delta: 8.9MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * BuchiAutomizer took 11380.88ms. Allocated memory was 125.8MB in the beginning and 220.2MB in the end (delta: 94.4MB). Free memory was 90.8MB in the beginning and 178.2MB in the end (delta: -87.5MB). Peak memory consumption was 7.8MB. Max. memory is 16.1GB. * Witness Printer took 2.63ms. Allocated memory is still 220.2MB. Free memory is still 178.2MB. There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Constructed decomposition of program Your program was decomposed into 10 terminating modules (5 trivial, 3 deterministic, 2 nondeterministic). One deterministic module has affine ranking function \old(j) and consists of 10 locations. One deterministic module has affine ranking function \old(i) and consists of 4 locations. One deterministic module has affine ranking function \old(i) and consists of 5 locations. One nondeterministic module has affine ranking function \old(i) and consists of 5 locations. One nondeterministic module has affine ranking function \old(i) and consists of 5 locations. 5 modules have a trivial ranking function, the largest among these consists of 8 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 11.3s and 8 iterations. TraceHistogramMax:5. Analysis of lassos took 5.2s. Construction of modules took 0.5s. Büchi inclusion checks took 4.8s. Highest rank in rank-based complementation 3. Minimization of det autom 3. Minimization of nondet autom 7. Automata minimization 0.4s AutomataMinimizationTime, 8 MinimizatonAttempts, 89 StatesRemovedByMinimization, 7 NontrivialMinimizations. Non-live state removal took 0.0s Buchi closure took 0.0s. Biggest automaton had 112 states and ocurred in iteration 5. Nontrivial modules had stage [3, 0, 2, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 22/24 HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 223 SdHoareTripleChecker+Valid, 0.6s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 209 mSDsluCounter, 536 SdHoareTripleChecker+Invalid, 0.6s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 335 mSDsCounter, 191 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 311 IncrementalHoareTripleChecker+Invalid, 502 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 191 mSolverCounterUnsat, 201 mSDtfsCounter, 311 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown LassoAnalysisResults: nont0 unkn0 SFLI2 SFLT2 conc0 concLT2 SILN0 SILU0 SILI0 SILT1 lasso0 LassoPreprocessingBenchmarks: Lassos: inital12 mio100 ax100 hnf100 lsp100 ukn100 mio100 lsp100 div100 bol100 ite100 ukn100 eq148 hnf94 smp100 dnf100 smp100 tf111 neg94 sie110 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 0 Time: 28ms VariablesStem: 0 VariablesLoop: 0 DisjunctsStem: 1 DisjunctsLoop: 1 SupportingInvariants: 0 MotzkinApplications: 2 LassoTerminationAnalysisBenchmarks: LassoNonterminationAnalysisSatFixpoint: 20 LassoNonterminationAnalysisSatUnbounded: 0 LassoNonterminationAnalysisUnsat: 5 LassoNonterminationAnalysisUnknown: 0 LassoNonterminationAnalysisTime: 0.9s - TerminationAnalysisResult: Termination proven Buchi Automizer proved that your program is terminating RESULT: Ultimate proved your program to be correct! [2022-02-21 03:23:56,050 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (50)] Forceful destruction successful, exit code 0 [2022-02-21 03:23:56,257 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (36)] Forceful destruction successful, exit code 0 [2022-02-21 03:23:56,470 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (35)] Forceful destruction successful, exit code 0 [2022-02-21 03:23:56,670 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE