./Ultimate.py --spec ../sv-benchmarks/c/properties/termination.prp --file ../sv-benchmarks/c/recursive/Primes.c --full-output -ea --architecture 32bit -------------------------------------------------------------------------------- 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/recursive/Primes.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(F end) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 16beca065b3aeb336c54dcf96f3abbe61553e7d28b28c1a40f525ad89a5da56e --- Real Ultimate output --- This is Ultimate 0.2.2-dev-03d7b7b [2022-02-21 04:19:18,498 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-02-21 04:19:18,500 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-02-21 04:19:18,536 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-02-21 04:19:18,536 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-02-21 04:19:18,539 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-02-21 04:19:18,540 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-02-21 04:19:18,542 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-02-21 04:19:18,543 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-02-21 04:19:18,546 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-02-21 04:19:18,547 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-02-21 04:19:18,548 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-02-21 04:19:18,548 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-02-21 04:19:18,550 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-02-21 04:19:18,551 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-02-21 04:19:18,554 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-02-21 04:19:18,555 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-02-21 04:19:18,555 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-02-21 04:19:18,557 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-02-21 04:19:18,563 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-02-21 04:19:18,564 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-02-21 04:19:18,565 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-02-21 04:19:18,566 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-02-21 04:19:18,566 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-02-21 04:19:18,570 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-02-21 04:19:18,570 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-02-21 04:19:18,570 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-02-21 04:19:18,572 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-02-21 04:19:18,572 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-02-21 04:19:18,573 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-02-21 04:19:18,573 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-02-21 04:19:18,573 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-02-21 04:19:18,574 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-02-21 04:19:18,575 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-02-21 04:19:18,576 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-02-21 04:19:18,576 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-02-21 04:19:18,577 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-02-21 04:19:18,577 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-02-21 04:19:18,577 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-02-21 04:19:18,578 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-02-21 04:19:18,578 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-02-21 04:19:18,580 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-32bit-Automizer_Default.epf [2022-02-21 04:19:18,607 INFO L113 SettingsManager]: Loading preferences was successful [2022-02-21 04:19:18,607 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-02-21 04:19:18,607 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-02-21 04:19:18,608 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-02-21 04:19:18,609 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-02-21 04:19:18,609 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-02-21 04:19:18,609 INFO L138 SettingsManager]: * Use SBE=true [2022-02-21 04:19:18,609 INFO L136 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2022-02-21 04:19:18,609 INFO L138 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2022-02-21 04:19:18,610 INFO L138 SettingsManager]: * Use old map elimination=false [2022-02-21 04:19:18,610 INFO L138 SettingsManager]: * Use external solver (rank synthesis)=false [2022-02-21 04:19:18,611 INFO L138 SettingsManager]: * Use only trivial implications for array writes=true [2022-02-21 04:19:18,611 INFO L138 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2022-02-21 04:19:18,611 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-02-21 04:19:18,611 INFO L138 SettingsManager]: * sizeof long=4 [2022-02-21 04:19:18,611 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2022-02-21 04:19:18,611 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-02-21 04:19:18,611 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-02-21 04:19:18,612 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-02-21 04:19:18,612 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2022-02-21 04:19:18,612 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2022-02-21 04:19:18,612 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2022-02-21 04:19:18,612 INFO L138 SettingsManager]: * sizeof long double=12 [2022-02-21 04:19:18,612 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-02-21 04:19:18,612 INFO L138 SettingsManager]: * Assume nondeterminstic values are in range=false [2022-02-21 04:19:18,613 INFO L138 SettingsManager]: * Use constant arrays=true [2022-02-21 04:19:18,613 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2022-02-21 04:19:18,613 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-02-21 04:19:18,613 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-02-21 04:19:18,613 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-02-21 04:19:18,613 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-02-21 04:19:18,614 INFO L136 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2022-02-21 04:19:18,615 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 -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 16beca065b3aeb336c54dcf96f3abbe61553e7d28b28c1a40f525ad89a5da56e [2022-02-21 04:19:18,826 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-02-21 04:19:18,846 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-02-21 04:19:18,849 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-02-21 04:19:18,850 INFO L271 PluginConnector]: Initializing CDTParser... [2022-02-21 04:19:18,850 INFO L275 PluginConnector]: CDTParser initialized [2022-02-21 04:19:18,851 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/recursive/Primes.c [2022-02-21 04:19:18,925 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/bfd1265ce/edccadcbb7ab4111a379095569156bbd/FLAGd52b8f3c3 [2022-02-21 04:19:19,319 INFO L306 CDTParser]: Found 1 translation units. [2022-02-21 04:19:19,320 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/recursive/Primes.c [2022-02-21 04:19:19,326 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/bfd1265ce/edccadcbb7ab4111a379095569156bbd/FLAGd52b8f3c3 [2022-02-21 04:19:19,759 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/bfd1265ce/edccadcbb7ab4111a379095569156bbd [2022-02-21 04:19:19,761 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-02-21 04:19:19,762 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-02-21 04:19:19,765 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-02-21 04:19:19,765 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-02-21 04:19:19,767 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-02-21 04:19:19,768 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.02 04:19:19" (1/1) ... [2022-02-21 04:19:19,769 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@762d4155 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 04:19:19, skipping insertion in model container [2022-02-21 04:19:19,769 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.02 04:19:19" (1/1) ... [2022-02-21 04:19:19,774 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-02-21 04:19:19,785 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-02-21 04:19:19,928 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/recursive/Primes.c[2190,2203] [2022-02-21 04:19:19,929 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-21 04:19:19,937 INFO L203 MainTranslator]: Completed pre-run [2022-02-21 04:19:19,968 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/recursive/Primes.c[2190,2203] [2022-02-21 04:19:19,969 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-21 04:19:19,980 INFO L208 MainTranslator]: Completed translation [2022-02-21 04:19:19,981 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 04:19:19 WrapperNode [2022-02-21 04:19:19,981 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-02-21 04:19:19,982 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-02-21 04:19:19,982 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-02-21 04:19:19,982 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-02-21 04:19:19,988 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 04:19:19" (1/1) ... [2022-02-21 04:19:19,994 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 04:19:19" (1/1) ... [2022-02-21 04:19:20,012 INFO L137 Inliner]: procedures = 16, calls = 17, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 47 [2022-02-21 04:19:20,012 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-02-21 04:19:20,013 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-02-21 04:19:20,013 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-02-21 04:19:20,013 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-02-21 04:19:20,020 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 04:19:19" (1/1) ... [2022-02-21 04:19:20,020 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 04:19:19" (1/1) ... [2022-02-21 04:19:20,022 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 04:19:19" (1/1) ... [2022-02-21 04:19:20,022 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 04:19:19" (1/1) ... [2022-02-21 04:19:20,026 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 04:19:19" (1/1) ... [2022-02-21 04:19:20,029 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 04:19:19" (1/1) ... [2022-02-21 04:19:20,030 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 04:19:19" (1/1) ... [2022-02-21 04:19:20,031 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-02-21 04:19:20,032 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-02-21 04:19:20,032 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-02-21 04:19:20,033 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-02-21 04:19:20,033 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 04:19:19" (1/1) ... [2022-02-21 04:19:20,039 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 04:19:20,049 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 04:19:20,076 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 04:19:20,078 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 04:19:20,105 INFO L130 BoogieDeclarations]: Found specification of procedure multiple_of [2022-02-21 04:19:20,105 INFO L138 BoogieDeclarations]: Found implementation of procedure multiple_of [2022-02-21 04:19:20,105 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-02-21 04:19:20,105 INFO L130 BoogieDeclarations]: Found specification of procedure mult [2022-02-21 04:19:20,106 INFO L138 BoogieDeclarations]: Found implementation of procedure mult [2022-02-21 04:19:20,106 INFO L130 BoogieDeclarations]: Found specification of procedure is_prime_ [2022-02-21 04:19:20,106 INFO L138 BoogieDeclarations]: Found implementation of procedure is_prime_ [2022-02-21 04:19:20,106 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-02-21 04:19:20,106 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-02-21 04:19:20,106 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-02-21 04:19:20,158 INFO L234 CfgBuilder]: Building ICFG [2022-02-21 04:19:20,159 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-02-21 04:19:20,356 INFO L275 CfgBuilder]: Performing block encoding [2022-02-21 04:19:20,363 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-02-21 04:19:20,372 INFO L299 CfgBuilder]: Removed 0 assume(true) statements. [2022-02-21 04:19:20,374 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.02 04:19:20 BoogieIcfgContainer [2022-02-21 04:19:20,374 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-02-21 04:19:20,375 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2022-02-21 04:19:20,376 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2022-02-21 04:19:20,379 INFO L275 PluginConnector]: BuchiAutomizer initialized [2022-02-21 04:19:20,379 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2022-02-21 04:19:20,379 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 21.02 04:19:19" (1/3) ... [2022-02-21 04:19:20,381 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@34dbb62 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 21.02 04:19:20, skipping insertion in model container [2022-02-21 04:19:20,381 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2022-02-21 04:19:20,381 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 04:19:19" (2/3) ... [2022-02-21 04:19:20,381 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@34dbb62 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 21.02 04:19:20, skipping insertion in model container [2022-02-21 04:19:20,381 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2022-02-21 04:19:20,381 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.02 04:19:20" (3/3) ... [2022-02-21 04:19:20,395 INFO L388 chiAutomizerObserver]: Analyzing ICFG Primes.c [2022-02-21 04:19:20,434 INFO L359 BuchiCegarLoop]: Interprodecural is true [2022-02-21 04:19:20,434 INFO L360 BuchiCegarLoop]: Hoare is false [2022-02-21 04:19:20,434 INFO L361 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2022-02-21 04:19:20,435 INFO L362 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2022-02-21 04:19:20,435 INFO L363 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2022-02-21 04:19:20,447 INFO L364 BuchiCegarLoop]: Difference is false [2022-02-21 04:19:20,447 INFO L365 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2022-02-21 04:19:20,447 INFO L368 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2022-02-21 04:19:20,467 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 50 states, 37 states have (on average 1.4594594594594594) internal successors, (54), 37 states have internal predecessors, (54), 9 states have call successors, (9), 3 states have call predecessors, (9), 3 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2022-02-21 04:19:20,503 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 22 [2022-02-21 04:19:20,504 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 04:19:20,504 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 04:19:20,508 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1] [2022-02-21 04:19:20,509 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-21 04:19:20,509 INFO L425 BuchiCegarLoop]: ======== Iteration 1============ [2022-02-21 04:19:20,509 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 50 states, 37 states have (on average 1.4594594594594594) internal successors, (54), 37 states have internal predecessors, (54), 9 states have call successors, (9), 3 states have call predecessors, (9), 3 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2022-02-21 04:19:20,524 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 22 [2022-02-21 04:19:20,524 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 04:19:20,525 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 04:19:20,525 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1] [2022-02-21 04:19:20,525 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-21 04:19:20,531 INFO L791 eck$LassoCheckResult]: Stem: 36#ULTIMATE.startENTRYtrue assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(9, 2);call #Ultimate.allocInit(12, 3); 30#L-1true assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet12#1, main_#t~ret13#1, main_#t~nondet14#1, main_#t~nondet15#1, main_#t~ret16#1, main_#t~short17#1, main_~n~0#1, main_~result~0#1, main_~f1~0#1, main_~f2~0#1;main_~n~0#1 := main_#t~nondet12#1;havoc main_#t~nondet12#1; 16#L78true assume !(main_~n~0#1 < 1 || main_~n~0#1 > 46340);assume { :begin_inline_is_prime } true;is_prime_#in~n#1 := main_~n~0#1;havoc is_prime_#res#1;havoc is_prime_#t~ret9#1, is_prime_~n#1;is_prime_~n#1 := is_prime_#in~n#1; 23#L53true call is_prime_#t~ret9#1 := is_prime_(is_prime_~n#1, is_prime_~n#1 - 1);< 32#is_prime_ENTRYtrue [2022-02-21 04:19:20,534 INFO L793 eck$LassoCheckResult]: Loop: 32#is_prime_ENTRYtrue ~n := #in~n;~m := #in~m; 51#L58true assume !(~n <= 1); 33#L61true assume !(2 == ~n); 48#L64true assume ~n > 2; 9#L65true assume !(~m <= 1); 28#L68true call #t~ret10 := multiple_of(~n, ~m);< 46#multiple_ofENTRYtrue ~n := #in~n;~m := #in~m; 43#L32true assume !(~m < 0); 49#L35true assume !(~n < 0); 15#L38true assume 0 == ~m;#res := 0; 19#multiple_ofFINALtrue assume true; 20#multiple_ofEXITtrue >#122#return; 21#L68-1true assume !(0 == #t~ret10);havoc #t~ret10; 5#L71true call #t~ret11 := is_prime_(~n, ~m - 1);< 32#is_prime_ENTRYtrue [2022-02-21 04:19:20,538 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 04:19:20,539 INFO L85 PathProgramCache]: Analyzing trace with hash 2218663, now seen corresponding path program 1 times [2022-02-21 04:19:20,546 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 04:19:20,547 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [914239232] [2022-02-21 04:19:20,547 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 04:19:20,548 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 04:19:20,654 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 04:19:20,655 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-02-21 04:19:20,684 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 04:19:20,700 INFO L138 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-02-21 04:19:20,707 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 04:19:20,708 INFO L85 PathProgramCache]: Analyzing trace with hash -1788949215, now seen corresponding path program 1 times [2022-02-21 04:19:20,708 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 04:19:20,709 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [704900288] [2022-02-21 04:19:20,709 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 04:19:20,709 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 04:19:20,736 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 04:19:20,785 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2022-02-21 04:19:20,810 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 04:19:20,852 INFO L290 TraceCheckUtils]: 0: Hoare triple {56#true} ~n := #in~n;~m := #in~m; {65#(= |multiple_of_#in~m| multiple_of_~m)} is VALID [2022-02-21 04:19:20,853 INFO L290 TraceCheckUtils]: 1: Hoare triple {65#(= |multiple_of_#in~m| multiple_of_~m)} assume !(~m < 0); {65#(= |multiple_of_#in~m| multiple_of_~m)} is VALID [2022-02-21 04:19:20,854 INFO L290 TraceCheckUtils]: 2: Hoare triple {65#(= |multiple_of_#in~m| multiple_of_~m)} assume !(~n < 0); {65#(= |multiple_of_#in~m| multiple_of_~m)} is VALID [2022-02-21 04:19:20,855 INFO L290 TraceCheckUtils]: 3: Hoare triple {65#(= |multiple_of_#in~m| multiple_of_~m)} assume 0 == ~m;#res := 0; {66#(<= |multiple_of_#in~m| 0)} is VALID [2022-02-21 04:19:20,855 INFO L290 TraceCheckUtils]: 4: Hoare triple {66#(<= |multiple_of_#in~m| 0)} assume true; {66#(<= |multiple_of_#in~m| 0)} is VALID [2022-02-21 04:19:20,857 INFO L284 TraceCheckUtils]: 5: Hoare quadruple {66#(<= |multiple_of_#in~m| 0)} {58#(<= 2 is_prime__~m)} #122#return; {57#false} is VALID [2022-02-21 04:19:20,858 INFO L290 TraceCheckUtils]: 0: Hoare triple {56#true} ~n := #in~n;~m := #in~m; {56#true} is VALID [2022-02-21 04:19:20,858 INFO L290 TraceCheckUtils]: 1: Hoare triple {56#true} assume !(~n <= 1); {56#true} is VALID [2022-02-21 04:19:20,858 INFO L290 TraceCheckUtils]: 2: Hoare triple {56#true} assume !(2 == ~n); {56#true} is VALID [2022-02-21 04:19:20,859 INFO L290 TraceCheckUtils]: 3: Hoare triple {56#true} assume ~n > 2; {56#true} is VALID [2022-02-21 04:19:20,859 INFO L290 TraceCheckUtils]: 4: Hoare triple {56#true} assume !(~m <= 1); {58#(<= 2 is_prime__~m)} is VALID [2022-02-21 04:19:20,860 INFO L272 TraceCheckUtils]: 5: Hoare triple {58#(<= 2 is_prime__~m)} call #t~ret10 := multiple_of(~n, ~m); {56#true} is VALID [2022-02-21 04:19:20,860 INFO L290 TraceCheckUtils]: 6: Hoare triple {56#true} ~n := #in~n;~m := #in~m; {65#(= |multiple_of_#in~m| multiple_of_~m)} is VALID [2022-02-21 04:19:20,861 INFO L290 TraceCheckUtils]: 7: Hoare triple {65#(= |multiple_of_#in~m| multiple_of_~m)} assume !(~m < 0); {65#(= |multiple_of_#in~m| multiple_of_~m)} is VALID [2022-02-21 04:19:20,863 INFO L290 TraceCheckUtils]: 8: Hoare triple {65#(= |multiple_of_#in~m| multiple_of_~m)} assume !(~n < 0); {65#(= |multiple_of_#in~m| multiple_of_~m)} is VALID [2022-02-21 04:19:20,863 INFO L290 TraceCheckUtils]: 9: Hoare triple {65#(= |multiple_of_#in~m| multiple_of_~m)} assume 0 == ~m;#res := 0; {66#(<= |multiple_of_#in~m| 0)} is VALID [2022-02-21 04:19:20,864 INFO L290 TraceCheckUtils]: 10: Hoare triple {66#(<= |multiple_of_#in~m| 0)} assume true; {66#(<= |multiple_of_#in~m| 0)} is VALID [2022-02-21 04:19:20,866 INFO L284 TraceCheckUtils]: 11: Hoare quadruple {66#(<= |multiple_of_#in~m| 0)} {58#(<= 2 is_prime__~m)} #122#return; {57#false} is VALID [2022-02-21 04:19:20,866 INFO L290 TraceCheckUtils]: 12: Hoare triple {57#false} assume !(0 == #t~ret10);havoc #t~ret10; {57#false} is VALID [2022-02-21 04:19:20,866 INFO L272 TraceCheckUtils]: 13: Hoare triple {57#false} call #t~ret11 := is_prime_(~n, ~m - 1); {57#false} is VALID [2022-02-21 04:19:20,867 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 04:19:20,867 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-21 04:19:20,868 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [704900288] [2022-02-21 04:19:20,868 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [704900288] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-21 04:19:20,869 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-21 04:19:20,870 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-02-21 04:19:20,870 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1600981397] [2022-02-21 04:19:20,871 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-21 04:19:20,875 INFO L808 eck$LassoCheckResult]: loop already infeasible [2022-02-21 04:19:20,876 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-21 04:19:20,901 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-02-21 04:19:20,902 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-02-21 04:19:20,905 INFO L87 Difference]: Start difference. First operand has 50 states, 37 states have (on average 1.4594594594594594) internal successors, (54), 37 states have internal predecessors, (54), 9 states have call successors, (9), 3 states have call predecessors, (9), 3 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) Second operand has 5 states, 4 states have (on average 2.75) internal successors, (11), 5 states have internal predecessors, (11), 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 04:19:21,270 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 04:19:21,270 INFO L93 Difference]: Finished difference Result 56 states and 80 transitions. [2022-02-21 04:19:21,270 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-02-21 04:19:21,272 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), 5 states have internal predecessors, (11), 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 04:19:21,287 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 14 edges. 14 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-21 04:19:21,298 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 56 states and 80 transitions. [2022-02-21 04:19:21,305 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 22 [2022-02-21 04:19:21,311 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 56 states to 41 states and 54 transitions. [2022-02-21 04:19:21,312 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 41 [2022-02-21 04:19:21,313 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 41 [2022-02-21 04:19:21,313 INFO L73 IsDeterministic]: Start isDeterministic. Operand 41 states and 54 transitions. [2022-02-21 04:19:21,314 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-02-21 04:19:21,314 INFO L681 BuchiCegarLoop]: Abstraction has 41 states and 54 transitions. [2022-02-21 04:19:21,328 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states and 54 transitions. [2022-02-21 04:19:21,337 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 39. [2022-02-21 04:19:21,338 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-21 04:19:21,339 INFO L82 GeneralOperation]: Start isEquivalent. First operand 41 states and 54 transitions. Second operand has 39 states, 28 states have (on average 1.3214285714285714) internal successors, (37), 30 states have internal predecessors, (37), 9 states have call successors, (9), 3 states have call predecessors, (9), 2 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2022-02-21 04:19:21,339 INFO L74 IsIncluded]: Start isIncluded. First operand 41 states and 54 transitions. Second operand has 39 states, 28 states have (on average 1.3214285714285714) internal successors, (37), 30 states have internal predecessors, (37), 9 states have call successors, (9), 3 states have call predecessors, (9), 2 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2022-02-21 04:19:21,341 INFO L87 Difference]: Start difference. First operand 41 states and 54 transitions. Second operand has 39 states, 28 states have (on average 1.3214285714285714) internal successors, (37), 30 states have internal predecessors, (37), 9 states have call successors, (9), 3 states have call predecessors, (9), 2 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2022-02-21 04:19:21,345 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 04:19:21,345 INFO L93 Difference]: Finished difference Result 41 states and 54 transitions. [2022-02-21 04:19:21,346 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 54 transitions. [2022-02-21 04:19:21,347 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 04:19:21,347 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 04:19:21,348 INFO L74 IsIncluded]: Start isIncluded. First operand has 39 states, 28 states have (on average 1.3214285714285714) internal successors, (37), 30 states have internal predecessors, (37), 9 states have call successors, (9), 3 states have call predecessors, (9), 2 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) Second operand 41 states and 54 transitions. [2022-02-21 04:19:21,348 INFO L87 Difference]: Start difference. First operand has 39 states, 28 states have (on average 1.3214285714285714) internal successors, (37), 30 states have internal predecessors, (37), 9 states have call successors, (9), 3 states have call predecessors, (9), 2 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) Second operand 41 states and 54 transitions. [2022-02-21 04:19:21,351 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 04:19:21,352 INFO L93 Difference]: Finished difference Result 41 states and 54 transitions. [2022-02-21 04:19:21,352 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 54 transitions. [2022-02-21 04:19:21,353 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 04:19:21,353 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 04:19:21,353 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-21 04:19:21,353 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-21 04:19:21,354 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 39 states, 28 states have (on average 1.3214285714285714) internal successors, (37), 30 states have internal predecessors, (37), 9 states have call successors, (9), 3 states have call predecessors, (9), 2 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2022-02-21 04:19:21,356 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 51 transitions. [2022-02-21 04:19:21,358 INFO L704 BuchiCegarLoop]: Abstraction has 39 states and 51 transitions. [2022-02-21 04:19:21,358 INFO L587 BuchiCegarLoop]: Abstraction has 39 states and 51 transitions. [2022-02-21 04:19:21,358 INFO L425 BuchiCegarLoop]: ======== Iteration 2============ [2022-02-21 04:19:21,358 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 39 states and 51 transitions. [2022-02-21 04:19:21,359 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 22 [2022-02-21 04:19:21,359 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 04:19:21,359 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 04:19:21,360 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1] [2022-02-21 04:19:21,360 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-21 04:19:21,360 INFO L791 eck$LassoCheckResult]: Stem: 155#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(9, 2);call #Ultimate.allocInit(12, 3); 138#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet12#1, main_#t~ret13#1, main_#t~nondet14#1, main_#t~nondet15#1, main_#t~ret16#1, main_#t~short17#1, main_~n~0#1, main_~result~0#1, main_~f1~0#1, main_~f2~0#1;main_~n~0#1 := main_#t~nondet12#1;havoc main_#t~nondet12#1; 139#L78 assume !(main_~n~0#1 < 1 || main_~n~0#1 > 46340);assume { :begin_inline_is_prime } true;is_prime_#in~n#1 := main_~n~0#1;havoc is_prime_#res#1;havoc is_prime_#t~ret9#1, is_prime_~n#1;is_prime_~n#1 := is_prime_#in~n#1; 134#L53 call is_prime_#t~ret9#1 := is_prime_(is_prime_~n#1, is_prime_~n#1 - 1);< 135#is_prime_ENTRY [2022-02-21 04:19:21,361 INFO L793 eck$LassoCheckResult]: Loop: 135#is_prime_ENTRY ~n := #in~n;~m := #in~m; 149#L58 assume !(~n <= 1); 150#L61 assume !(2 == ~n); 151#L64 assume ~n > 2; 144#L65 assume !(~m <= 1); 126#L68 call #t~ret10 := multiple_of(~n, ~m);< 137#multiple_ofENTRY ~n := #in~n;~m := #in~m; 160#L32 assume !(~m < 0); 161#L35 assume !(~n < 0); 158#L38 assume !(0 == ~m); 159#L41 assume 0 == ~n;#res := 1; 130#multiple_ofFINAL assume true; 162#multiple_ofEXIT >#122#return; 163#L68-1 assume !(0 == #t~ret10);havoc #t~ret10; 133#L71 call #t~ret11 := is_prime_(~n, ~m - 1);< 135#is_prime_ENTRY [2022-02-21 04:19:21,361 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 04:19:21,361 INFO L85 PathProgramCache]: Analyzing trace with hash 2218663, now seen corresponding path program 2 times [2022-02-21 04:19:21,362 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 04:19:21,362 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1728731549] [2022-02-21 04:19:21,362 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 04:19:21,362 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 04:19:21,372 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 04:19:21,372 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-02-21 04:19:21,378 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 04:19:21,380 INFO L138 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-02-21 04:19:21,381 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 04:19:21,381 INFO L85 PathProgramCache]: Analyzing trace with hash 399153633, now seen corresponding path program 1 times [2022-02-21 04:19:21,382 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 04:19:21,382 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1099117127] [2022-02-21 04:19:21,382 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 04:19:21,382 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 04:19:21,390 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 04:19:21,406 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2022-02-21 04:19:21,410 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 04:19:21,430 INFO L290 TraceCheckUtils]: 0: Hoare triple {251#true} ~n := #in~n;~m := #in~m; {261#(= |multiple_of_#in~n| multiple_of_~n)} is VALID [2022-02-21 04:19:21,431 INFO L290 TraceCheckUtils]: 1: Hoare triple {261#(= |multiple_of_#in~n| multiple_of_~n)} assume !(~m < 0); {261#(= |multiple_of_#in~n| multiple_of_~n)} is VALID [2022-02-21 04:19:21,431 INFO L290 TraceCheckUtils]: 2: Hoare triple {261#(= |multiple_of_#in~n| multiple_of_~n)} assume !(~n < 0); {261#(= |multiple_of_#in~n| multiple_of_~n)} is VALID [2022-02-21 04:19:21,432 INFO L290 TraceCheckUtils]: 3: Hoare triple {261#(= |multiple_of_#in~n| multiple_of_~n)} assume !(0 == ~m); {261#(= |multiple_of_#in~n| multiple_of_~n)} is VALID [2022-02-21 04:19:21,432 INFO L290 TraceCheckUtils]: 4: Hoare triple {261#(= |multiple_of_#in~n| multiple_of_~n)} assume 0 == ~n;#res := 1; {262#(<= |multiple_of_#in~n| 0)} is VALID [2022-02-21 04:19:21,433 INFO L290 TraceCheckUtils]: 5: Hoare triple {262#(<= |multiple_of_#in~n| 0)} assume true; {262#(<= |multiple_of_#in~n| 0)} is VALID [2022-02-21 04:19:21,434 INFO L284 TraceCheckUtils]: 6: Hoare quadruple {262#(<= |multiple_of_#in~n| 0)} {253#(<= 2 is_prime__~n)} #122#return; {252#false} is VALID [2022-02-21 04:19:21,435 INFO L290 TraceCheckUtils]: 0: Hoare triple {251#true} ~n := #in~n;~m := #in~m; {251#true} is VALID [2022-02-21 04:19:21,435 INFO L290 TraceCheckUtils]: 1: Hoare triple {251#true} assume !(~n <= 1); {253#(<= 2 is_prime__~n)} is VALID [2022-02-21 04:19:21,436 INFO L290 TraceCheckUtils]: 2: Hoare triple {253#(<= 2 is_prime__~n)} assume !(2 == ~n); {253#(<= 2 is_prime__~n)} is VALID [2022-02-21 04:19:21,436 INFO L290 TraceCheckUtils]: 3: Hoare triple {253#(<= 2 is_prime__~n)} assume ~n > 2; {253#(<= 2 is_prime__~n)} is VALID [2022-02-21 04:19:21,437 INFO L290 TraceCheckUtils]: 4: Hoare triple {253#(<= 2 is_prime__~n)} assume !(~m <= 1); {253#(<= 2 is_prime__~n)} is VALID [2022-02-21 04:19:21,437 INFO L272 TraceCheckUtils]: 5: Hoare triple {253#(<= 2 is_prime__~n)} call #t~ret10 := multiple_of(~n, ~m); {251#true} is VALID [2022-02-21 04:19:21,438 INFO L290 TraceCheckUtils]: 6: Hoare triple {251#true} ~n := #in~n;~m := #in~m; {261#(= |multiple_of_#in~n| multiple_of_~n)} is VALID [2022-02-21 04:19:21,438 INFO L290 TraceCheckUtils]: 7: Hoare triple {261#(= |multiple_of_#in~n| multiple_of_~n)} assume !(~m < 0); {261#(= |multiple_of_#in~n| multiple_of_~n)} is VALID [2022-02-21 04:19:21,439 INFO L290 TraceCheckUtils]: 8: Hoare triple {261#(= |multiple_of_#in~n| multiple_of_~n)} assume !(~n < 0); {261#(= |multiple_of_#in~n| multiple_of_~n)} is VALID [2022-02-21 04:19:21,439 INFO L290 TraceCheckUtils]: 9: Hoare triple {261#(= |multiple_of_#in~n| multiple_of_~n)} assume !(0 == ~m); {261#(= |multiple_of_#in~n| multiple_of_~n)} is VALID [2022-02-21 04:19:21,440 INFO L290 TraceCheckUtils]: 10: Hoare triple {261#(= |multiple_of_#in~n| multiple_of_~n)} assume 0 == ~n;#res := 1; {262#(<= |multiple_of_#in~n| 0)} is VALID [2022-02-21 04:19:21,441 INFO L290 TraceCheckUtils]: 11: Hoare triple {262#(<= |multiple_of_#in~n| 0)} assume true; {262#(<= |multiple_of_#in~n| 0)} is VALID [2022-02-21 04:19:21,442 INFO L284 TraceCheckUtils]: 12: Hoare quadruple {262#(<= |multiple_of_#in~n| 0)} {253#(<= 2 is_prime__~n)} #122#return; {252#false} is VALID [2022-02-21 04:19:21,442 INFO L290 TraceCheckUtils]: 13: Hoare triple {252#false} assume !(0 == #t~ret10);havoc #t~ret10; {252#false} is VALID [2022-02-21 04:19:21,442 INFO L272 TraceCheckUtils]: 14: Hoare triple {252#false} call #t~ret11 := is_prime_(~n, ~m - 1); {252#false} is VALID [2022-02-21 04:19:21,442 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 04:19:21,442 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-21 04:19:21,443 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1099117127] [2022-02-21 04:19:21,443 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1099117127] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-21 04:19:21,443 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-21 04:19:21,443 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-02-21 04:19:21,443 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [131482838] [2022-02-21 04:19:21,443 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-21 04:19:21,443 INFO L808 eck$LassoCheckResult]: loop already infeasible [2022-02-21 04:19:21,444 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-21 04:19:21,445 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-02-21 04:19:21,445 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-02-21 04:19:21,445 INFO L87 Difference]: Start difference. First operand 39 states and 51 transitions. cyclomatic complexity: 15 Second operand has 5 states, 5 states have (on average 2.4) internal successors, (12), 5 states have internal predecessors, (12), 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 04:19:21,617 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 04:19:21,617 INFO L93 Difference]: Finished difference Result 43 states and 57 transitions. [2022-02-21 04:19:21,617 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-02-21 04:19:21,618 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 2.4) internal successors, (12), 5 states have internal predecessors, (12), 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 04:19:21,631 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 15 edges. 15 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-21 04:19:21,631 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 43 states and 57 transitions. [2022-02-21 04:19:21,634 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 22 [2022-02-21 04:19:21,636 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 43 states to 43 states and 57 transitions. [2022-02-21 04:19:21,636 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 43 [2022-02-21 04:19:21,636 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 43 [2022-02-21 04:19:21,636 INFO L73 IsDeterministic]: Start isDeterministic. Operand 43 states and 57 transitions. [2022-02-21 04:19:21,636 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-02-21 04:19:21,636 INFO L681 BuchiCegarLoop]: Abstraction has 43 states and 57 transitions. [2022-02-21 04:19:21,636 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states and 57 transitions. [2022-02-21 04:19:21,638 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 41. [2022-02-21 04:19:21,638 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-21 04:19:21,639 INFO L82 GeneralOperation]: Start isEquivalent. First operand 43 states and 57 transitions. Second operand has 41 states, 29 states have (on average 1.3103448275862069) internal successors, (38), 32 states have internal predecessors, (38), 9 states have call successors, (9), 3 states have call predecessors, (9), 3 states have return successors, (7), 5 states have call predecessors, (7), 5 states have call successors, (7) [2022-02-21 04:19:21,639 INFO L74 IsIncluded]: Start isIncluded. First operand 43 states and 57 transitions. Second operand has 41 states, 29 states have (on average 1.3103448275862069) internal successors, (38), 32 states have internal predecessors, (38), 9 states have call successors, (9), 3 states have call predecessors, (9), 3 states have return successors, (7), 5 states have call predecessors, (7), 5 states have call successors, (7) [2022-02-21 04:19:21,639 INFO L87 Difference]: Start difference. First operand 43 states and 57 transitions. Second operand has 41 states, 29 states have (on average 1.3103448275862069) internal successors, (38), 32 states have internal predecessors, (38), 9 states have call successors, (9), 3 states have call predecessors, (9), 3 states have return successors, (7), 5 states have call predecessors, (7), 5 states have call successors, (7) [2022-02-21 04:19:21,641 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 04:19:21,641 INFO L93 Difference]: Finished difference Result 43 states and 57 transitions. [2022-02-21 04:19:21,641 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 57 transitions. [2022-02-21 04:19:21,642 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 04:19:21,642 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 04:19:21,642 INFO L74 IsIncluded]: Start isIncluded. First operand has 41 states, 29 states have (on average 1.3103448275862069) internal successors, (38), 32 states have internal predecessors, (38), 9 states have call successors, (9), 3 states have call predecessors, (9), 3 states have return successors, (7), 5 states have call predecessors, (7), 5 states have call successors, (7) Second operand 43 states and 57 transitions. [2022-02-21 04:19:21,642 INFO L87 Difference]: Start difference. First operand has 41 states, 29 states have (on average 1.3103448275862069) internal successors, (38), 32 states have internal predecessors, (38), 9 states have call successors, (9), 3 states have call predecessors, (9), 3 states have return successors, (7), 5 states have call predecessors, (7), 5 states have call successors, (7) Second operand 43 states and 57 transitions. [2022-02-21 04:19:21,644 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 04:19:21,644 INFO L93 Difference]: Finished difference Result 43 states and 57 transitions. [2022-02-21 04:19:21,644 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 57 transitions. [2022-02-21 04:19:21,645 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 04:19:21,645 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 04:19:21,645 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-21 04:19:21,645 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-21 04:19:21,646 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 41 states, 29 states have (on average 1.3103448275862069) internal successors, (38), 32 states have internal predecessors, (38), 9 states have call successors, (9), 3 states have call predecessors, (9), 3 states have return successors, (7), 5 states have call predecessors, (7), 5 states have call successors, (7) [2022-02-21 04:19:21,647 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 54 transitions. [2022-02-21 04:19:21,647 INFO L704 BuchiCegarLoop]: Abstraction has 41 states and 54 transitions. [2022-02-21 04:19:21,647 INFO L587 BuchiCegarLoop]: Abstraction has 41 states and 54 transitions. [2022-02-21 04:19:21,647 INFO L425 BuchiCegarLoop]: ======== Iteration 3============ [2022-02-21 04:19:21,647 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 41 states and 54 transitions. [2022-02-21 04:19:21,648 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 22 [2022-02-21 04:19:21,648 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 04:19:21,648 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 04:19:21,663 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1] [2022-02-21 04:19:21,663 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-21 04:19:21,664 INFO L791 eck$LassoCheckResult]: Stem: 339#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(9, 2);call #Ultimate.allocInit(12, 3); 321#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet12#1, main_#t~ret13#1, main_#t~nondet14#1, main_#t~nondet15#1, main_#t~ret16#1, main_#t~short17#1, main_~n~0#1, main_~result~0#1, main_~f1~0#1, main_~f2~0#1;main_~n~0#1 := main_#t~nondet12#1;havoc main_#t~nondet12#1; 322#L78 assume !(main_~n~0#1 < 1 || main_~n~0#1 > 46340);assume { :begin_inline_is_prime } true;is_prime_#in~n#1 := main_~n~0#1;havoc is_prime_#res#1;havoc is_prime_#t~ret9#1, is_prime_~n#1;is_prime_~n#1 := is_prime_#in~n#1; 317#L53 call is_prime_#t~ret9#1 := is_prime_(is_prime_~n#1, is_prime_~n#1 - 1);< 318#is_prime_ENTRY [2022-02-21 04:19:21,664 INFO L793 eck$LassoCheckResult]: Loop: 318#is_prime_ENTRY ~n := #in~n;~m := #in~m; 332#L58 assume !(~n <= 1); 333#L61 assume !(2 == ~n); 334#L64 assume ~n > 2; 327#L65 assume !(~m <= 1); 311#L68 call #t~ret10 := multiple_of(~n, ~m);< 320#multiple_ofENTRY ~n := #in~n;~m := #in~m; 344#L32 assume !(~m < 0); 345#L35 assume !(~n < 0); 342#L38 assume !(0 == ~m); 343#L41 assume !(0 == ~n); 312#L44 call #t~ret8 := multiple_of(~n - ~m, ~m);< 320#multiple_ofENTRY ~n := #in~n;~m := #in~m; 344#L32 assume !(~m < 0); 345#L35 assume !(~n < 0); 342#L38 assume !(0 == ~m); 343#L41 assume 0 == ~n;#res := 1; 336#multiple_ofFINAL assume true; 346#multiple_ofEXIT >#112#return; 308#L44-1 #res := #t~ret8;havoc #t~ret8; 313#multiple_ofFINAL assume true; 348#multiple_ofEXIT >#122#return; 347#L68-1 assume !(0 == #t~ret10);havoc #t~ret10; 316#L71 call #t~ret11 := is_prime_(~n, ~m - 1);< 318#is_prime_ENTRY [2022-02-21 04:19:21,664 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 04:19:21,664 INFO L85 PathProgramCache]: Analyzing trace with hash 2218663, now seen corresponding path program 3 times [2022-02-21 04:19:21,664 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 04:19:21,665 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1941591587] [2022-02-21 04:19:21,665 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 04:19:21,665 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 04:19:21,672 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 04:19:21,673 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-02-21 04:19:21,677 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 04:19:21,680 INFO L138 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-02-21 04:19:21,680 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 04:19:21,681 INFO L85 PathProgramCache]: Analyzing trace with hash -1840266607, now seen corresponding path program 1 times [2022-02-21 04:19:21,681 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 04:19:21,681 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1441946642] [2022-02-21 04:19:21,681 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 04:19:21,681 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 04:19:21,705 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 04:19:21,705 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-02-21 04:19:21,712 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 04:19:21,715 INFO L138 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-02-21 04:19:21,715 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 04:19:21,716 INFO L85 PathProgramCache]: Analyzing trace with hash 1482001207, now seen corresponding path program 1 times [2022-02-21 04:19:21,716 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 04:19:21,716 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [625715573] [2022-02-21 04:19:21,716 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 04:19:21,716 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 04:19:21,753 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 04:19:21,798 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2022-02-21 04:19:21,805 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 04:19:21,834 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2022-02-21 04:19:21,844 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 04:19:21,866 INFO L290 TraceCheckUtils]: 0: Hoare triple {442#true} ~n := #in~n;~m := #in~m; {471#(= |multiple_of_#in~n| multiple_of_~n)} is VALID [2022-02-21 04:19:21,867 INFO L290 TraceCheckUtils]: 1: Hoare triple {471#(= |multiple_of_#in~n| multiple_of_~n)} assume !(~m < 0); {471#(= |multiple_of_#in~n| multiple_of_~n)} is VALID [2022-02-21 04:19:21,867 INFO L290 TraceCheckUtils]: 2: Hoare triple {471#(= |multiple_of_#in~n| multiple_of_~n)} assume !(~n < 0); {471#(= |multiple_of_#in~n| multiple_of_~n)} is VALID [2022-02-21 04:19:21,868 INFO L290 TraceCheckUtils]: 3: Hoare triple {471#(= |multiple_of_#in~n| multiple_of_~n)} assume !(0 == ~m); {471#(= |multiple_of_#in~n| multiple_of_~n)} is VALID [2022-02-21 04:19:21,868 INFO L290 TraceCheckUtils]: 4: Hoare triple {471#(= |multiple_of_#in~n| multiple_of_~n)} assume 0 == ~n;#res := 1; {472#(<= |multiple_of_#in~n| 0)} is VALID [2022-02-21 04:19:21,869 INFO L290 TraceCheckUtils]: 5: Hoare triple {472#(<= |multiple_of_#in~n| 0)} assume true; {472#(<= |multiple_of_#in~n| 0)} is VALID [2022-02-21 04:19:21,871 INFO L284 TraceCheckUtils]: 6: Hoare quadruple {472#(<= |multiple_of_#in~n| 0)} {462#(and (= |multiple_of_#in~m| multiple_of_~m) (= |multiple_of_#in~n| multiple_of_~n))} #112#return; {470#(<= |multiple_of_#in~n| |multiple_of_#in~m|)} is VALID [2022-02-21 04:19:21,872 INFO L290 TraceCheckUtils]: 0: Hoare triple {442#true} ~n := #in~n;~m := #in~m; {462#(and (= |multiple_of_#in~m| multiple_of_~m) (= |multiple_of_#in~n| multiple_of_~n))} is VALID [2022-02-21 04:19:21,872 INFO L290 TraceCheckUtils]: 1: Hoare triple {462#(and (= |multiple_of_#in~m| multiple_of_~m) (= |multiple_of_#in~n| multiple_of_~n))} assume !(~m < 0); {462#(and (= |multiple_of_#in~m| multiple_of_~m) (= |multiple_of_#in~n| multiple_of_~n))} is VALID [2022-02-21 04:19:21,873 INFO L290 TraceCheckUtils]: 2: Hoare triple {462#(and (= |multiple_of_#in~m| multiple_of_~m) (= |multiple_of_#in~n| multiple_of_~n))} assume !(~n < 0); {462#(and (= |multiple_of_#in~m| multiple_of_~m) (= |multiple_of_#in~n| multiple_of_~n))} is VALID [2022-02-21 04:19:21,873 INFO L290 TraceCheckUtils]: 3: Hoare triple {462#(and (= |multiple_of_#in~m| multiple_of_~m) (= |multiple_of_#in~n| multiple_of_~n))} assume !(0 == ~m); {462#(and (= |multiple_of_#in~m| multiple_of_~m) (= |multiple_of_#in~n| multiple_of_~n))} is VALID [2022-02-21 04:19:21,874 INFO L290 TraceCheckUtils]: 4: Hoare triple {462#(and (= |multiple_of_#in~m| multiple_of_~m) (= |multiple_of_#in~n| multiple_of_~n))} assume !(0 == ~n); {462#(and (= |multiple_of_#in~m| multiple_of_~m) (= |multiple_of_#in~n| multiple_of_~n))} is VALID [2022-02-21 04:19:21,874 INFO L272 TraceCheckUtils]: 5: Hoare triple {462#(and (= |multiple_of_#in~m| multiple_of_~m) (= |multiple_of_#in~n| multiple_of_~n))} call #t~ret8 := multiple_of(~n - ~m, ~m); {442#true} is VALID [2022-02-21 04:19:21,875 INFO L290 TraceCheckUtils]: 6: Hoare triple {442#true} ~n := #in~n;~m := #in~m; {471#(= |multiple_of_#in~n| multiple_of_~n)} is VALID [2022-02-21 04:19:21,875 INFO L290 TraceCheckUtils]: 7: Hoare triple {471#(= |multiple_of_#in~n| multiple_of_~n)} assume !(~m < 0); {471#(= |multiple_of_#in~n| multiple_of_~n)} is VALID [2022-02-21 04:19:21,876 INFO L290 TraceCheckUtils]: 8: Hoare triple {471#(= |multiple_of_#in~n| multiple_of_~n)} assume !(~n < 0); {471#(= |multiple_of_#in~n| multiple_of_~n)} is VALID [2022-02-21 04:19:21,876 INFO L290 TraceCheckUtils]: 9: Hoare triple {471#(= |multiple_of_#in~n| multiple_of_~n)} assume !(0 == ~m); {471#(= |multiple_of_#in~n| multiple_of_~n)} is VALID [2022-02-21 04:19:21,877 INFO L290 TraceCheckUtils]: 10: Hoare triple {471#(= |multiple_of_#in~n| multiple_of_~n)} assume 0 == ~n;#res := 1; {472#(<= |multiple_of_#in~n| 0)} is VALID [2022-02-21 04:19:21,877 INFO L290 TraceCheckUtils]: 11: Hoare triple {472#(<= |multiple_of_#in~n| 0)} assume true; {472#(<= |multiple_of_#in~n| 0)} is VALID [2022-02-21 04:19:21,879 INFO L284 TraceCheckUtils]: 12: Hoare quadruple {472#(<= |multiple_of_#in~n| 0)} {462#(and (= |multiple_of_#in~m| multiple_of_~m) (= |multiple_of_#in~n| multiple_of_~n))} #112#return; {470#(<= |multiple_of_#in~n| |multiple_of_#in~m|)} is VALID [2022-02-21 04:19:21,879 INFO L290 TraceCheckUtils]: 13: Hoare triple {470#(<= |multiple_of_#in~n| |multiple_of_#in~m|)} #res := #t~ret8;havoc #t~ret8; {470#(<= |multiple_of_#in~n| |multiple_of_#in~m|)} is VALID [2022-02-21 04:19:21,880 INFO L290 TraceCheckUtils]: 14: Hoare triple {470#(<= |multiple_of_#in~n| |multiple_of_#in~m|)} assume true; {470#(<= |multiple_of_#in~n| |multiple_of_#in~m|)} is VALID [2022-02-21 04:19:21,881 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {470#(<= |multiple_of_#in~n| |multiple_of_#in~m|)} {445#(<= (+ is_prime__~m 1) is_prime__~n)} #122#return; {443#false} is VALID [2022-02-21 04:19:21,881 INFO L290 TraceCheckUtils]: 0: Hoare triple {442#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(9, 2);call #Ultimate.allocInit(12, 3); {442#true} is VALID [2022-02-21 04:19:21,881 INFO L290 TraceCheckUtils]: 1: Hoare triple {442#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet12#1, main_#t~ret13#1, main_#t~nondet14#1, main_#t~nondet15#1, main_#t~ret16#1, main_#t~short17#1, main_~n~0#1, main_~result~0#1, main_~f1~0#1, main_~f2~0#1;main_~n~0#1 := main_#t~nondet12#1;havoc main_#t~nondet12#1; {442#true} is VALID [2022-02-21 04:19:21,882 INFO L290 TraceCheckUtils]: 2: Hoare triple {442#true} assume !(main_~n~0#1 < 1 || main_~n~0#1 > 46340);assume { :begin_inline_is_prime } true;is_prime_#in~n#1 := main_~n~0#1;havoc is_prime_#res#1;havoc is_prime_#t~ret9#1, is_prime_~n#1;is_prime_~n#1 := is_prime_#in~n#1; {442#true} is VALID [2022-02-21 04:19:21,882 INFO L272 TraceCheckUtils]: 3: Hoare triple {442#true} call is_prime_#t~ret9#1 := is_prime_(is_prime_~n#1, is_prime_~n#1 - 1); {444#(<= (+ |is_prime__#in~m| 1) |is_prime__#in~n|)} is VALID [2022-02-21 04:19:21,883 INFO L290 TraceCheckUtils]: 4: Hoare triple {444#(<= (+ |is_prime__#in~m| 1) |is_prime__#in~n|)} ~n := #in~n;~m := #in~m; {445#(<= (+ is_prime__~m 1) is_prime__~n)} is VALID [2022-02-21 04:19:21,884 INFO L290 TraceCheckUtils]: 5: Hoare triple {445#(<= (+ is_prime__~m 1) is_prime__~n)} assume !(~n <= 1); {445#(<= (+ is_prime__~m 1) is_prime__~n)} is VALID [2022-02-21 04:19:21,884 INFO L290 TraceCheckUtils]: 6: Hoare triple {445#(<= (+ is_prime__~m 1) is_prime__~n)} assume !(2 == ~n); {445#(<= (+ is_prime__~m 1) is_prime__~n)} is VALID [2022-02-21 04:19:21,884 INFO L290 TraceCheckUtils]: 7: Hoare triple {445#(<= (+ is_prime__~m 1) is_prime__~n)} assume ~n > 2; {445#(<= (+ is_prime__~m 1) is_prime__~n)} is VALID [2022-02-21 04:19:21,885 INFO L290 TraceCheckUtils]: 8: Hoare triple {445#(<= (+ is_prime__~m 1) is_prime__~n)} assume !(~m <= 1); {445#(<= (+ is_prime__~m 1) is_prime__~n)} is VALID [2022-02-21 04:19:21,885 INFO L272 TraceCheckUtils]: 9: Hoare triple {445#(<= (+ is_prime__~m 1) is_prime__~n)} call #t~ret10 := multiple_of(~n, ~m); {442#true} is VALID [2022-02-21 04:19:21,886 INFO L290 TraceCheckUtils]: 10: Hoare triple {442#true} ~n := #in~n;~m := #in~m; {462#(and (= |multiple_of_#in~m| multiple_of_~m) (= |multiple_of_#in~n| multiple_of_~n))} is VALID [2022-02-21 04:19:21,886 INFO L290 TraceCheckUtils]: 11: Hoare triple {462#(and (= |multiple_of_#in~m| multiple_of_~m) (= |multiple_of_#in~n| multiple_of_~n))} assume !(~m < 0); {462#(and (= |multiple_of_#in~m| multiple_of_~m) (= |multiple_of_#in~n| multiple_of_~n))} is VALID [2022-02-21 04:19:21,887 INFO L290 TraceCheckUtils]: 12: Hoare triple {462#(and (= |multiple_of_#in~m| multiple_of_~m) (= |multiple_of_#in~n| multiple_of_~n))} assume !(~n < 0); {462#(and (= |multiple_of_#in~m| multiple_of_~m) (= |multiple_of_#in~n| multiple_of_~n))} is VALID [2022-02-21 04:19:21,887 INFO L290 TraceCheckUtils]: 13: Hoare triple {462#(and (= |multiple_of_#in~m| multiple_of_~m) (= |multiple_of_#in~n| multiple_of_~n))} assume !(0 == ~m); {462#(and (= |multiple_of_#in~m| multiple_of_~m) (= |multiple_of_#in~n| multiple_of_~n))} is VALID [2022-02-21 04:19:21,888 INFO L290 TraceCheckUtils]: 14: Hoare triple {462#(and (= |multiple_of_#in~m| multiple_of_~m) (= |multiple_of_#in~n| multiple_of_~n))} assume !(0 == ~n); {462#(and (= |multiple_of_#in~m| multiple_of_~m) (= |multiple_of_#in~n| multiple_of_~n))} is VALID [2022-02-21 04:19:21,888 INFO L272 TraceCheckUtils]: 15: Hoare triple {462#(and (= |multiple_of_#in~m| multiple_of_~m) (= |multiple_of_#in~n| multiple_of_~n))} call #t~ret8 := multiple_of(~n - ~m, ~m); {442#true} is VALID [2022-02-21 04:19:21,889 INFO L290 TraceCheckUtils]: 16: Hoare triple {442#true} ~n := #in~n;~m := #in~m; {471#(= |multiple_of_#in~n| multiple_of_~n)} is VALID [2022-02-21 04:19:21,890 INFO L290 TraceCheckUtils]: 17: Hoare triple {471#(= |multiple_of_#in~n| multiple_of_~n)} assume !(~m < 0); {471#(= |multiple_of_#in~n| multiple_of_~n)} is VALID [2022-02-21 04:19:21,890 INFO L290 TraceCheckUtils]: 18: Hoare triple {471#(= |multiple_of_#in~n| multiple_of_~n)} assume !(~n < 0); {471#(= |multiple_of_#in~n| multiple_of_~n)} is VALID [2022-02-21 04:19:21,891 INFO L290 TraceCheckUtils]: 19: Hoare triple {471#(= |multiple_of_#in~n| multiple_of_~n)} assume !(0 == ~m); {471#(= |multiple_of_#in~n| multiple_of_~n)} is VALID [2022-02-21 04:19:21,892 INFO L290 TraceCheckUtils]: 20: Hoare triple {471#(= |multiple_of_#in~n| multiple_of_~n)} assume 0 == ~n;#res := 1; {472#(<= |multiple_of_#in~n| 0)} is VALID [2022-02-21 04:19:21,892 INFO L290 TraceCheckUtils]: 21: Hoare triple {472#(<= |multiple_of_#in~n| 0)} assume true; {472#(<= |multiple_of_#in~n| 0)} is VALID [2022-02-21 04:19:21,893 INFO L284 TraceCheckUtils]: 22: Hoare quadruple {472#(<= |multiple_of_#in~n| 0)} {462#(and (= |multiple_of_#in~m| multiple_of_~m) (= |multiple_of_#in~n| multiple_of_~n))} #112#return; {470#(<= |multiple_of_#in~n| |multiple_of_#in~m|)} is VALID [2022-02-21 04:19:21,894 INFO L290 TraceCheckUtils]: 23: Hoare triple {470#(<= |multiple_of_#in~n| |multiple_of_#in~m|)} #res := #t~ret8;havoc #t~ret8; {470#(<= |multiple_of_#in~n| |multiple_of_#in~m|)} is VALID [2022-02-21 04:19:21,894 INFO L290 TraceCheckUtils]: 24: Hoare triple {470#(<= |multiple_of_#in~n| |multiple_of_#in~m|)} assume true; {470#(<= |multiple_of_#in~n| |multiple_of_#in~m|)} is VALID [2022-02-21 04:19:21,895 INFO L284 TraceCheckUtils]: 25: Hoare quadruple {470#(<= |multiple_of_#in~n| |multiple_of_#in~m|)} {445#(<= (+ is_prime__~m 1) is_prime__~n)} #122#return; {443#false} is VALID [2022-02-21 04:19:21,896 INFO L290 TraceCheckUtils]: 26: Hoare triple {443#false} assume !(0 == #t~ret10);havoc #t~ret10; {443#false} is VALID [2022-02-21 04:19:21,896 INFO L272 TraceCheckUtils]: 27: Hoare triple {443#false} call #t~ret11 := is_prime_(~n, ~m - 1); {443#false} is VALID [2022-02-21 04:19:21,896 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-02-21 04:19:21,897 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-21 04:19:21,897 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [625715573] [2022-02-21 04:19:21,897 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [625715573] provided 0 perfect and 1 imperfect interpolant sequences [2022-02-21 04:19:21,897 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1651959991] [2022-02-21 04:19:21,897 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 04:19:21,898 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-21 04:19:21,898 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 04:19:21,913 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-02-21 04:19:21,948 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-02-21 04:19:21,982 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 04:19:21,984 INFO L263 TraceCheckSpWp]: Trace formula consists of 92 conjuncts, 11 conjunts are in the unsatisfiable core [2022-02-21 04:19:22,001 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 04:19:22,002 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-21 04:19:22,352 INFO L290 TraceCheckUtils]: 0: Hoare triple {442#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(9, 2);call #Ultimate.allocInit(12, 3); {442#true} is VALID [2022-02-21 04:19:22,352 INFO L290 TraceCheckUtils]: 1: Hoare triple {442#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet12#1, main_#t~ret13#1, main_#t~nondet14#1, main_#t~nondet15#1, main_#t~ret16#1, main_#t~short17#1, main_~n~0#1, main_~result~0#1, main_~f1~0#1, main_~f2~0#1;main_~n~0#1 := main_#t~nondet12#1;havoc main_#t~nondet12#1; {442#true} is VALID [2022-02-21 04:19:22,352 INFO L290 TraceCheckUtils]: 2: Hoare triple {442#true} assume !(main_~n~0#1 < 1 || main_~n~0#1 > 46340);assume { :begin_inline_is_prime } true;is_prime_#in~n#1 := main_~n~0#1;havoc is_prime_#res#1;havoc is_prime_#t~ret9#1, is_prime_~n#1;is_prime_~n#1 := is_prime_#in~n#1; {442#true} is VALID [2022-02-21 04:19:22,353 INFO L272 TraceCheckUtils]: 3: Hoare triple {442#true} call is_prime_#t~ret9#1 := is_prime_(is_prime_~n#1, is_prime_~n#1 - 1); {444#(<= (+ |is_prime__#in~m| 1) |is_prime__#in~n|)} is VALID [2022-02-21 04:19:22,353 INFO L290 TraceCheckUtils]: 4: Hoare triple {444#(<= (+ |is_prime__#in~m| 1) |is_prime__#in~n|)} ~n := #in~n;~m := #in~m; {445#(<= (+ is_prime__~m 1) is_prime__~n)} is VALID [2022-02-21 04:19:22,354 INFO L290 TraceCheckUtils]: 5: Hoare triple {445#(<= (+ is_prime__~m 1) is_prime__~n)} assume !(~n <= 1); {445#(<= (+ is_prime__~m 1) is_prime__~n)} is VALID [2022-02-21 04:19:22,354 INFO L290 TraceCheckUtils]: 6: Hoare triple {445#(<= (+ is_prime__~m 1) is_prime__~n)} assume !(2 == ~n); {445#(<= (+ is_prime__~m 1) is_prime__~n)} is VALID [2022-02-21 04:19:22,354 INFO L290 TraceCheckUtils]: 7: Hoare triple {445#(<= (+ is_prime__~m 1) is_prime__~n)} assume ~n > 2; {445#(<= (+ is_prime__~m 1) is_prime__~n)} is VALID [2022-02-21 04:19:22,355 INFO L290 TraceCheckUtils]: 8: Hoare triple {445#(<= (+ is_prime__~m 1) is_prime__~n)} assume !(~m <= 1); {445#(<= (+ is_prime__~m 1) is_prime__~n)} is VALID [2022-02-21 04:19:22,355 INFO L272 TraceCheckUtils]: 9: Hoare triple {445#(<= (+ is_prime__~m 1) is_prime__~n)} call #t~ret10 := multiple_of(~n, ~m); {442#true} is VALID [2022-02-21 04:19:22,355 INFO L290 TraceCheckUtils]: 10: Hoare triple {442#true} ~n := #in~n;~m := #in~m; {506#(and (<= |multiple_of_#in~n| multiple_of_~n) (<= multiple_of_~m |multiple_of_#in~m|))} is VALID [2022-02-21 04:19:22,358 INFO L290 TraceCheckUtils]: 11: Hoare triple {506#(and (<= |multiple_of_#in~n| multiple_of_~n) (<= multiple_of_~m |multiple_of_#in~m|))} assume !(~m < 0); {506#(and (<= |multiple_of_#in~n| multiple_of_~n) (<= multiple_of_~m |multiple_of_#in~m|))} is VALID [2022-02-21 04:19:22,358 INFO L290 TraceCheckUtils]: 12: Hoare triple {506#(and (<= |multiple_of_#in~n| multiple_of_~n) (<= multiple_of_~m |multiple_of_#in~m|))} assume !(~n < 0); {506#(and (<= |multiple_of_#in~n| multiple_of_~n) (<= multiple_of_~m |multiple_of_#in~m|))} is VALID [2022-02-21 04:19:22,359 INFO L290 TraceCheckUtils]: 13: Hoare triple {506#(and (<= |multiple_of_#in~n| multiple_of_~n) (<= multiple_of_~m |multiple_of_#in~m|))} assume !(0 == ~m); {506#(and (<= |multiple_of_#in~n| multiple_of_~n) (<= multiple_of_~m |multiple_of_#in~m|))} is VALID [2022-02-21 04:19:22,359 INFO L290 TraceCheckUtils]: 14: Hoare triple {506#(and (<= |multiple_of_#in~n| multiple_of_~n) (<= multiple_of_~m |multiple_of_#in~m|))} assume !(0 == ~n); {506#(and (<= |multiple_of_#in~n| multiple_of_~n) (<= multiple_of_~m |multiple_of_#in~m|))} is VALID [2022-02-21 04:19:22,359 INFO L272 TraceCheckUtils]: 15: Hoare triple {506#(and (<= |multiple_of_#in~n| multiple_of_~n) (<= multiple_of_~m |multiple_of_#in~m|))} call #t~ret8 := multiple_of(~n - ~m, ~m); {442#true} is VALID [2022-02-21 04:19:22,359 INFO L290 TraceCheckUtils]: 16: Hoare triple {442#true} ~n := #in~n;~m := #in~m; {525#(<= |multiple_of_#in~n| multiple_of_~n)} is VALID [2022-02-21 04:19:22,360 INFO L290 TraceCheckUtils]: 17: Hoare triple {525#(<= |multiple_of_#in~n| multiple_of_~n)} assume !(~m < 0); {525#(<= |multiple_of_#in~n| multiple_of_~n)} is VALID [2022-02-21 04:19:22,360 INFO L290 TraceCheckUtils]: 18: Hoare triple {525#(<= |multiple_of_#in~n| multiple_of_~n)} assume !(~n < 0); {525#(<= |multiple_of_#in~n| multiple_of_~n)} is VALID [2022-02-21 04:19:22,360 INFO L290 TraceCheckUtils]: 19: Hoare triple {525#(<= |multiple_of_#in~n| multiple_of_~n)} assume !(0 == ~m); {525#(<= |multiple_of_#in~n| multiple_of_~n)} is VALID [2022-02-21 04:19:22,361 INFO L290 TraceCheckUtils]: 20: Hoare triple {525#(<= |multiple_of_#in~n| multiple_of_~n)} assume 0 == ~n;#res := 1; {472#(<= |multiple_of_#in~n| 0)} is VALID [2022-02-21 04:19:22,361 INFO L290 TraceCheckUtils]: 21: Hoare triple {472#(<= |multiple_of_#in~n| 0)} assume true; {472#(<= |multiple_of_#in~n| 0)} is VALID [2022-02-21 04:19:22,363 INFO L284 TraceCheckUtils]: 22: Hoare quadruple {472#(<= |multiple_of_#in~n| 0)} {506#(and (<= |multiple_of_#in~n| multiple_of_~n) (<= multiple_of_~m |multiple_of_#in~m|))} #112#return; {470#(<= |multiple_of_#in~n| |multiple_of_#in~m|)} is VALID [2022-02-21 04:19:22,363 INFO L290 TraceCheckUtils]: 23: Hoare triple {470#(<= |multiple_of_#in~n| |multiple_of_#in~m|)} #res := #t~ret8;havoc #t~ret8; {470#(<= |multiple_of_#in~n| |multiple_of_#in~m|)} is VALID [2022-02-21 04:19:22,363 INFO L290 TraceCheckUtils]: 24: Hoare triple {470#(<= |multiple_of_#in~n| |multiple_of_#in~m|)} assume true; {470#(<= |multiple_of_#in~n| |multiple_of_#in~m|)} is VALID [2022-02-21 04:19:22,365 INFO L284 TraceCheckUtils]: 25: Hoare quadruple {470#(<= |multiple_of_#in~n| |multiple_of_#in~m|)} {445#(<= (+ is_prime__~m 1) is_prime__~n)} #122#return; {443#false} is VALID [2022-02-21 04:19:22,365 INFO L290 TraceCheckUtils]: 26: Hoare triple {443#false} assume !(0 == #t~ret10);havoc #t~ret10; {443#false} is VALID [2022-02-21 04:19:22,366 INFO L272 TraceCheckUtils]: 27: Hoare triple {443#false} call #t~ret11 := is_prime_(~n, ~m - 1); {443#false} is VALID [2022-02-21 04:19:22,366 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-02-21 04:19:22,366 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-02-21 04:19:23,063 INFO L272 TraceCheckUtils]: 27: Hoare triple {443#false} call #t~ret11 := is_prime_(~n, ~m - 1); {443#false} is VALID [2022-02-21 04:19:23,064 INFO L290 TraceCheckUtils]: 26: Hoare triple {443#false} assume !(0 == #t~ret10);havoc #t~ret10; {443#false} is VALID [2022-02-21 04:19:23,068 INFO L284 TraceCheckUtils]: 25: Hoare quadruple {470#(<= |multiple_of_#in~n| |multiple_of_#in~m|)} {445#(<= (+ is_prime__~m 1) is_prime__~n)} #122#return; {443#false} is VALID [2022-02-21 04:19:23,068 INFO L290 TraceCheckUtils]: 24: Hoare triple {470#(<= |multiple_of_#in~n| |multiple_of_#in~m|)} assume true; {470#(<= |multiple_of_#in~n| |multiple_of_#in~m|)} is VALID [2022-02-21 04:19:23,069 INFO L290 TraceCheckUtils]: 23: Hoare triple {470#(<= |multiple_of_#in~n| |multiple_of_#in~m|)} #res := #t~ret8;havoc #t~ret8; {470#(<= |multiple_of_#in~n| |multiple_of_#in~m|)} is VALID [2022-02-21 04:19:23,070 INFO L284 TraceCheckUtils]: 22: Hoare quadruple {472#(<= |multiple_of_#in~n| 0)} {577#(or (<= |multiple_of_#in~n| |multiple_of_#in~m|) (< multiple_of_~m multiple_of_~n))} #112#return; {470#(<= |multiple_of_#in~n| |multiple_of_#in~m|)} is VALID [2022-02-21 04:19:23,070 INFO L290 TraceCheckUtils]: 21: Hoare triple {472#(<= |multiple_of_#in~n| 0)} assume true; {472#(<= |multiple_of_#in~n| 0)} is VALID [2022-02-21 04:19:23,074 INFO L290 TraceCheckUtils]: 20: Hoare triple {587#(or (<= |multiple_of_#in~n| 0) (not (<= multiple_of_~n 0)))} assume 0 == ~n;#res := 1; {472#(<= |multiple_of_#in~n| 0)} is VALID [2022-02-21 04:19:23,075 INFO L290 TraceCheckUtils]: 19: Hoare triple {587#(or (<= |multiple_of_#in~n| 0) (not (<= multiple_of_~n 0)))} assume !(0 == ~m); {587#(or (<= |multiple_of_#in~n| 0) (not (<= multiple_of_~n 0)))} is VALID [2022-02-21 04:19:23,075 INFO L290 TraceCheckUtils]: 18: Hoare triple {587#(or (<= |multiple_of_#in~n| 0) (not (<= multiple_of_~n 0)))} assume !(~n < 0); {587#(or (<= |multiple_of_#in~n| 0) (not (<= multiple_of_~n 0)))} is VALID [2022-02-21 04:19:23,075 INFO L290 TraceCheckUtils]: 17: Hoare triple {587#(or (<= |multiple_of_#in~n| 0) (not (<= multiple_of_~n 0)))} assume !(~m < 0); {587#(or (<= |multiple_of_#in~n| 0) (not (<= multiple_of_~n 0)))} is VALID [2022-02-21 04:19:23,076 INFO L290 TraceCheckUtils]: 16: Hoare triple {442#true} ~n := #in~n;~m := #in~m; {587#(or (<= |multiple_of_#in~n| 0) (not (<= multiple_of_~n 0)))} is VALID [2022-02-21 04:19:23,076 INFO L272 TraceCheckUtils]: 15: Hoare triple {577#(or (<= |multiple_of_#in~n| |multiple_of_#in~m|) (< multiple_of_~m multiple_of_~n))} call #t~ret8 := multiple_of(~n - ~m, ~m); {442#true} is VALID [2022-02-21 04:19:23,076 INFO L290 TraceCheckUtils]: 14: Hoare triple {577#(or (<= |multiple_of_#in~n| |multiple_of_#in~m|) (< multiple_of_~m multiple_of_~n))} assume !(0 == ~n); {577#(or (<= |multiple_of_#in~n| |multiple_of_#in~m|) (< multiple_of_~m multiple_of_~n))} is VALID [2022-02-21 04:19:23,077 INFO L290 TraceCheckUtils]: 13: Hoare triple {577#(or (<= |multiple_of_#in~n| |multiple_of_#in~m|) (< multiple_of_~m multiple_of_~n))} assume !(0 == ~m); {577#(or (<= |multiple_of_#in~n| |multiple_of_#in~m|) (< multiple_of_~m multiple_of_~n))} is VALID [2022-02-21 04:19:23,077 INFO L290 TraceCheckUtils]: 12: Hoare triple {577#(or (<= |multiple_of_#in~n| |multiple_of_#in~m|) (< multiple_of_~m multiple_of_~n))} assume !(~n < 0); {577#(or (<= |multiple_of_#in~n| |multiple_of_#in~m|) (< multiple_of_~m multiple_of_~n))} is VALID [2022-02-21 04:19:23,077 INFO L290 TraceCheckUtils]: 11: Hoare triple {577#(or (<= |multiple_of_#in~n| |multiple_of_#in~m|) (< multiple_of_~m multiple_of_~n))} assume !(~m < 0); {577#(or (<= |multiple_of_#in~n| |multiple_of_#in~m|) (< multiple_of_~m multiple_of_~n))} is VALID [2022-02-21 04:19:23,078 INFO L290 TraceCheckUtils]: 10: Hoare triple {442#true} ~n := #in~n;~m := #in~m; {577#(or (<= |multiple_of_#in~n| |multiple_of_#in~m|) (< multiple_of_~m multiple_of_~n))} is VALID [2022-02-21 04:19:23,078 INFO L272 TraceCheckUtils]: 9: Hoare triple {445#(<= (+ is_prime__~m 1) is_prime__~n)} call #t~ret10 := multiple_of(~n, ~m); {442#true} is VALID [2022-02-21 04:19:23,078 INFO L290 TraceCheckUtils]: 8: Hoare triple {445#(<= (+ is_prime__~m 1) is_prime__~n)} assume !(~m <= 1); {445#(<= (+ is_prime__~m 1) is_prime__~n)} is VALID [2022-02-21 04:19:23,079 INFO L290 TraceCheckUtils]: 7: Hoare triple {445#(<= (+ is_prime__~m 1) is_prime__~n)} assume ~n > 2; {445#(<= (+ is_prime__~m 1) is_prime__~n)} is VALID [2022-02-21 04:19:23,079 INFO L290 TraceCheckUtils]: 6: Hoare triple {445#(<= (+ is_prime__~m 1) is_prime__~n)} assume !(2 == ~n); {445#(<= (+ is_prime__~m 1) is_prime__~n)} is VALID [2022-02-21 04:19:23,079 INFO L290 TraceCheckUtils]: 5: Hoare triple {445#(<= (+ is_prime__~m 1) is_prime__~n)} assume !(~n <= 1); {445#(<= (+ is_prime__~m 1) is_prime__~n)} is VALID [2022-02-21 04:19:23,080 INFO L290 TraceCheckUtils]: 4: Hoare triple {444#(<= (+ |is_prime__#in~m| 1) |is_prime__#in~n|)} ~n := #in~n;~m := #in~m; {445#(<= (+ is_prime__~m 1) is_prime__~n)} is VALID [2022-02-21 04:19:23,080 INFO L272 TraceCheckUtils]: 3: Hoare triple {442#true} call is_prime_#t~ret9#1 := is_prime_(is_prime_~n#1, is_prime_~n#1 - 1); {444#(<= (+ |is_prime__#in~m| 1) |is_prime__#in~n|)} is VALID [2022-02-21 04:19:23,080 INFO L290 TraceCheckUtils]: 2: Hoare triple {442#true} assume !(main_~n~0#1 < 1 || main_~n~0#1 > 46340);assume { :begin_inline_is_prime } true;is_prime_#in~n#1 := main_~n~0#1;havoc is_prime_#res#1;havoc is_prime_#t~ret9#1, is_prime_~n#1;is_prime_~n#1 := is_prime_#in~n#1; {442#true} is VALID [2022-02-21 04:19:23,080 INFO L290 TraceCheckUtils]: 1: Hoare triple {442#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet12#1, main_#t~ret13#1, main_#t~nondet14#1, main_#t~nondet15#1, main_#t~ret16#1, main_#t~short17#1, main_~n~0#1, main_~result~0#1, main_~f1~0#1, main_~f2~0#1;main_~n~0#1 := main_#t~nondet12#1;havoc main_#t~nondet12#1; {442#true} is VALID [2022-02-21 04:19:23,080 INFO L290 TraceCheckUtils]: 0: Hoare triple {442#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(9, 2);call #Ultimate.allocInit(12, 3); {442#true} is VALID [2022-02-21 04:19:23,081 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-02-21 04:19:23,081 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1651959991] provided 0 perfect and 2 imperfect interpolant sequences [2022-02-21 04:19:23,081 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-02-21 04:19:23,082 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 12 [2022-02-21 04:19:23,082 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [894009530] [2022-02-21 04:19:23,082 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-02-21 04:19:23,463 INFO L210 LassoAnalysis]: Preferences: [2022-02-21 04:19:23,464 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2022-02-21 04:19:23,464 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2022-02-21 04:19:23,464 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2022-02-21 04:19:23,464 INFO L129 ssoRankerPreferences]: Use exernal solver: true [2022-02-21 04:19:23,464 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 04:19:23,464 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2022-02-21 04:19:23,464 INFO L132 ssoRankerPreferences]: Path of dumped script: [2022-02-21 04:19:23,464 INFO L133 ssoRankerPreferences]: Filename of dumped script: Primes.c_Iteration3_Loop [2022-02-21 04:19:23,464 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2022-02-21 04:19:23,465 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2022-02-21 04:19:23,474 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 04:19:23,478 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 04:19:23,480 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 04:19:23,481 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 04:19:23,483 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 04:19:23,491 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 04:19:23,575 INFO L294 LassoAnalysis]: Preprocessing complete. [2022-02-21 04:19:23,576 INFO L404 LassoAnalysis]: Checking for nontermination... [2022-02-21 04:19:23,578 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 04:19:23,578 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 04:19:23,579 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 04:19:23,580 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 04:19:23,582 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2022-02-21 04:19:23,582 INFO L160 nArgumentSynthesizer]: Using integer mode. [2022-02-21 04:19:23,590 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2022-02-21 04:19:23,591 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {is_prime__#t~ret11=0} Honda state: {is_prime__#t~ret11=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2022-02-21 04:19:23,606 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (3)] Ended with exit code 0 [2022-02-21 04:19:23,606 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 04:19:23,606 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 04:19:23,636 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 04:19:23,637 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 04:19:23,639 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2022-02-21 04:19:23,639 INFO L160 nArgumentSynthesizer]: Using integer mode. [2022-02-21 04:19:23,654 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2022-02-21 04:19:23,654 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {is_prime__~m=0} Honda state: {is_prime__~m=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2022-02-21 04:19:23,679 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 04:19:23,680 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 04:19:23,680 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 04:19:23,681 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 04:19:23,681 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 04:19:23,683 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2022-02-21 04:19:23,683 INFO L160 nArgumentSynthesizer]: Using integer mode. [2022-02-21 04:19:23,689 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2022-02-21 04:19:23,689 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {is_prime__~n=0} Honda state: {is_prime__~n=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2022-02-21 04:19:23,709 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 04:19:23,709 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 04:19:23,709 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 04:19:23,711 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 04:19:23,712 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 04:19:23,728 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2022-02-21 04:19:23,728 INFO L160 nArgumentSynthesizer]: Using integer mode. [2022-02-21 04:19:23,745 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2022-02-21 04:19:23,745 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {is_prime__#t~ret10=0} Honda state: {is_prime__#t~ret10=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2022-02-21 04:19:23,766 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 04:19:23,766 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 04:19:23,766 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 04:19:23,767 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 04:19:23,768 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 04:19:23,770 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2022-02-21 04:19:23,770 INFO L160 nArgumentSynthesizer]: Using integer mode. [2022-02-21 04:19:23,810 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (7)] Forceful destruction successful, exit code 0 [2022-02-21 04:19:23,823 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 04:19:23,823 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 04:19:23,824 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 04:19:23,825 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 04:19:23,827 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2022-02-21 04:19:23,827 INFO L160 nArgumentSynthesizer]: Using integer mode. [2022-02-21 04:19:23,975 INFO L444 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2022-02-21 04:19:23,979 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 04:19:23,983 INFO L210 LassoAnalysis]: Preferences: [2022-02-21 04:19:23,983 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2022-02-21 04:19:23,984 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2022-02-21 04:19:23,984 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2022-02-21 04:19:23,984 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2022-02-21 04:19:23,984 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 04:19:23,984 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2022-02-21 04:19:23,984 INFO L132 ssoRankerPreferences]: Path of dumped script: [2022-02-21 04:19:23,984 INFO L133 ssoRankerPreferences]: Filename of dumped script: Primes.c_Iteration3_Loop [2022-02-21 04:19:23,984 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2022-02-21 04:19:23,984 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2022-02-21 04:19:23,984 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 04:19:23,990 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 04:19:23,992 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 04:19:23,994 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 04:19:23,995 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 04:19:24,002 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 04:19:24,068 INFO L294 LassoAnalysis]: Preprocessing complete. [2022-02-21 04:19:24,071 INFO L490 LassoAnalysis]: Using template 'affine'. [2022-02-21 04:19:24,072 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 04:19:24,072 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 04:19:24,079 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 04:19:24,080 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 04:19:24,082 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 04:19:24,087 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 04:19:24,087 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 04:19:24,088 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 04:19:24,088 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 04:19:24,088 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 04:19:24,089 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-02-21 04:19:24,089 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 04:19:24,100 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 04:19:24,122 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 04:19:24,123 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 04:19:24,123 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 04:19:24,125 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 04:19:24,126 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 04:19:24,127 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 04:19:24,132 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 04:19:24,132 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 04:19:24,132 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 04:19:24,132 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 04:19:24,132 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 04:19:24,133 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-02-21 04:19:24,133 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 04:19:24,139 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 04:19:24,154 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (10)] Ended with exit code 0 [2022-02-21 04:19:24,154 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 04:19:24,154 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 04:19:24,157 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 04:19:24,157 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 04:19:24,158 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 04:19:24,163 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 04:19:24,163 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 04:19:24,163 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 04:19:24,163 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 04:19:24,164 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 04:19:24,164 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-02-21 04:19:24,164 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 04:19:24,179 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 04:19:24,194 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 04:19:24,194 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 04:19:24,195 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 04:19:24,196 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 04:19:24,197 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 04:19:24,198 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 04:19:24,207 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 04:19:24,207 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 04:19:24,207 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 04:19:24,207 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 04:19:24,207 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 04:19:24,208 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-02-21 04:19:24,208 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 04:19:24,219 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 04:19:24,236 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (12)] Ended with exit code 0 [2022-02-21 04:19:24,236 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 04:19:24,236 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 04:19:24,237 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 04:19:24,238 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 04:19:24,239 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 04:19:24,244 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 04:19:24,244 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 04:19:24,244 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 04:19:24,245 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 04:19:24,245 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 04:19:24,246 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-02-21 04:19:24,246 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 04:19:24,262 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2022-02-21 04:19:24,288 INFO L443 ModelExtractionUtils]: Simplification made 2 calls to the SMT solver. [2022-02-21 04:19:24,288 INFO L444 ModelExtractionUtils]: 2 out of 4 variables were initially zero. Simplification set additionally 0 variables to zero. [2022-02-21 04:19:24,289 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 04:19:24,289 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 04:19:24,291 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 04:19:24,291 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 04:19:24,292 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2022-02-21 04:19:24,293 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2022-02-21 04:19:24,293 INFO L513 LassoAnalysis]: Proved termination. [2022-02-21 04:19:24,293 INFO L515 LassoAnalysis]: Termination argument consisting of: Ranking function f(is_prime__#in~m) = 1*is_prime__#in~m Supporting invariants [] [2022-02-21 04:19:24,307 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 04:19:24,316 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2022-02-21 04:19:24,320 INFO L390 LassoCheck]: Loop: "~n := #in~n;~m := #in~m;" "assume !(~n <= 1);" "assume !(2 == ~n);" "assume ~n > 2;" "assume !(~m <= 1);" "call #t~ret10 := multiple_of(~n, ~m);"< "~n := #in~n;~m := #in~m;" "assume !(~m < 0);" "assume !(~n < 0);" "assume !(0 == ~m);" "assume !(0 == ~n);" "call #t~ret8 := multiple_of(~n - ~m, ~m);"< "~n := #in~n;~m := #in~m;" "assume !(~m < 0);" "assume !(~n < 0);" "assume !(0 == ~m);" "assume 0 == ~n;#res := 1;" "assume true;" >"#112#return;" "#res := #t~ret8;havoc #t~ret8;" "assume true;" >"#122#return;" "assume !(0 == #t~ret10);havoc #t~ret10;" "call #t~ret11 := is_prime_(~n, ~m - 1);"< [2022-02-21 04:19:24,334 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 04:19:24,347 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 04:19:24,357 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 04:19:24,358 INFO L263 TraceCheckSpWp]: Trace formula consists of 66 conjuncts, 4 conjunts are in the unsatisfiable core [2022-02-21 04:19:24,364 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 04:19:24,364 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-21 04:19:24,372 INFO L290 TraceCheckUtils]: 0: Hoare triple {639#unseeded} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(9, 2);call #Ultimate.allocInit(12, 3); {639#unseeded} is VALID [2022-02-21 04:19:24,373 INFO L290 TraceCheckUtils]: 1: Hoare triple {639#unseeded} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet12#1, main_#t~ret13#1, main_#t~nondet14#1, main_#t~nondet15#1, main_#t~ret16#1, main_#t~short17#1, main_~n~0#1, main_~result~0#1, main_~f1~0#1, main_~f2~0#1;main_~n~0#1 := main_#t~nondet12#1;havoc main_#t~nondet12#1; {639#unseeded} is VALID [2022-02-21 04:19:24,373 INFO L290 TraceCheckUtils]: 2: Hoare triple {639#unseeded} assume !(main_~n~0#1 < 1 || main_~n~0#1 > 46340);assume { :begin_inline_is_prime } true;is_prime_#in~n#1 := main_~n~0#1;havoc is_prime_#res#1;havoc is_prime_#t~ret9#1, is_prime_~n#1;is_prime_~n#1 := is_prime_#in~n#1; {639#unseeded} is VALID [2022-02-21 04:19:24,373 INFO L272 TraceCheckUtils]: 3: Hoare triple {639#unseeded} call is_prime_#t~ret9#1 := is_prime_(is_prime_~n#1, is_prime_~n#1 - 1); {639#unseeded} is VALID [2022-02-21 04:19:24,401 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 04:19:24,419 INFO L263 TraceCheckSpWp]: Trace formula consists of 140 conjuncts, 18 conjunts are in the unsatisfiable core [2022-02-21 04:19:24,449 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 04:19:24,450 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 04:19:24,453 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-21 04:19:24,775 INFO L290 TraceCheckUtils]: 0: Hoare triple {642#(>= oldRank0 |is_prime__#in~m|)} ~n := #in~n;~m := #in~m; {666#(<= is_prime__~m oldRank0)} is VALID [2022-02-21 04:19:24,776 INFO L290 TraceCheckUtils]: 1: Hoare triple {666#(<= is_prime__~m oldRank0)} assume !(~n <= 1); {666#(<= is_prime__~m oldRank0)} is VALID [2022-02-21 04:19:24,776 INFO L290 TraceCheckUtils]: 2: Hoare triple {666#(<= is_prime__~m oldRank0)} assume !(2 == ~n); {666#(<= is_prime__~m oldRank0)} is VALID [2022-02-21 04:19:24,776 INFO L290 TraceCheckUtils]: 3: Hoare triple {666#(<= is_prime__~m oldRank0)} assume ~n > 2; {676#(and (<= is_prime__~m oldRank0) (< 2 is_prime__~n))} is VALID [2022-02-21 04:19:24,777 INFO L290 TraceCheckUtils]: 4: Hoare triple {676#(and (<= is_prime__~m oldRank0) (< 2 is_prime__~n))} assume !(~m <= 1); {676#(and (<= is_prime__~m oldRank0) (< 2 is_prime__~n))} is VALID [2022-02-21 04:19:24,777 INFO L272 TraceCheckUtils]: 5: Hoare triple {676#(and (<= is_prime__~m oldRank0) (< 2 is_prime__~n))} call #t~ret10 := multiple_of(~n, ~m); {683#(<= |old(oldRank0)| oldRank0)} is VALID [2022-02-21 04:19:24,778 INFO L290 TraceCheckUtils]: 6: Hoare triple {683#(<= |old(oldRank0)| oldRank0)} ~n := #in~n;~m := #in~m; {687#(and (<= |multiple_of_#in~n| multiple_of_~n) (<= multiple_of_~m |multiple_of_#in~m|) (<= |old(oldRank0)| oldRank0))} is VALID [2022-02-21 04:19:24,778 INFO L290 TraceCheckUtils]: 7: Hoare triple {687#(and (<= |multiple_of_#in~n| multiple_of_~n) (<= multiple_of_~m |multiple_of_#in~m|) (<= |old(oldRank0)| oldRank0))} assume !(~m < 0); {687#(and (<= |multiple_of_#in~n| multiple_of_~n) (<= multiple_of_~m |multiple_of_#in~m|) (<= |old(oldRank0)| oldRank0))} is VALID [2022-02-21 04:19:24,779 INFO L290 TraceCheckUtils]: 8: Hoare triple {687#(and (<= |multiple_of_#in~n| multiple_of_~n) (<= multiple_of_~m |multiple_of_#in~m|) (<= |old(oldRank0)| oldRank0))} assume !(~n < 0); {687#(and (<= |multiple_of_#in~n| multiple_of_~n) (<= multiple_of_~m |multiple_of_#in~m|) (<= |old(oldRank0)| oldRank0))} is VALID [2022-02-21 04:19:24,779 INFO L290 TraceCheckUtils]: 9: Hoare triple {687#(and (<= |multiple_of_#in~n| multiple_of_~n) (<= multiple_of_~m |multiple_of_#in~m|) (<= |old(oldRank0)| oldRank0))} assume !(0 == ~m); {687#(and (<= |multiple_of_#in~n| multiple_of_~n) (<= multiple_of_~m |multiple_of_#in~m|) (<= |old(oldRank0)| oldRank0))} is VALID [2022-02-21 04:19:24,779 INFO L290 TraceCheckUtils]: 10: Hoare triple {687#(and (<= |multiple_of_#in~n| multiple_of_~n) (<= multiple_of_~m |multiple_of_#in~m|) (<= |old(oldRank0)| oldRank0))} assume !(0 == ~n); {687#(and (<= |multiple_of_#in~n| multiple_of_~n) (<= multiple_of_~m |multiple_of_#in~m|) (<= |old(oldRank0)| oldRank0))} is VALID [2022-02-21 04:19:24,780 INFO L272 TraceCheckUtils]: 11: Hoare triple {687#(and (<= |multiple_of_#in~n| multiple_of_~n) (<= multiple_of_~m |multiple_of_#in~m|) (<= |old(oldRank0)| oldRank0))} call #t~ret8 := multiple_of(~n - ~m, ~m); {683#(<= |old(oldRank0)| oldRank0)} is VALID [2022-02-21 04:19:24,780 INFO L290 TraceCheckUtils]: 12: Hoare triple {683#(<= |old(oldRank0)| oldRank0)} ~n := #in~n;~m := #in~m; {706#(and (<= |multiple_of_#in~n| multiple_of_~n) (<= |old(oldRank0)| oldRank0))} is VALID [2022-02-21 04:19:24,781 INFO L290 TraceCheckUtils]: 13: Hoare triple {706#(and (<= |multiple_of_#in~n| multiple_of_~n) (<= |old(oldRank0)| oldRank0))} assume !(~m < 0); {706#(and (<= |multiple_of_#in~n| multiple_of_~n) (<= |old(oldRank0)| oldRank0))} is VALID [2022-02-21 04:19:24,781 INFO L290 TraceCheckUtils]: 14: Hoare triple {706#(and (<= |multiple_of_#in~n| multiple_of_~n) (<= |old(oldRank0)| oldRank0))} assume !(~n < 0); {706#(and (<= |multiple_of_#in~n| multiple_of_~n) (<= |old(oldRank0)| oldRank0))} is VALID [2022-02-21 04:19:24,781 INFO L290 TraceCheckUtils]: 15: Hoare triple {706#(and (<= |multiple_of_#in~n| multiple_of_~n) (<= |old(oldRank0)| oldRank0))} assume !(0 == ~m); {706#(and (<= |multiple_of_#in~n| multiple_of_~n) (<= |old(oldRank0)| oldRank0))} is VALID [2022-02-21 04:19:24,782 INFO L290 TraceCheckUtils]: 16: Hoare triple {706#(and (<= |multiple_of_#in~n| multiple_of_~n) (<= |old(oldRank0)| oldRank0))} assume 0 == ~n;#res := 1; {719#(and (<= |multiple_of_#in~n| 0) (<= |old(oldRank0)| oldRank0))} is VALID [2022-02-21 04:19:24,782 INFO L290 TraceCheckUtils]: 17: Hoare triple {719#(and (<= |multiple_of_#in~n| 0) (<= |old(oldRank0)| oldRank0))} assume true; {719#(and (<= |multiple_of_#in~n| 0) (<= |old(oldRank0)| oldRank0))} is VALID [2022-02-21 04:19:24,783 INFO L284 TraceCheckUtils]: 18: Hoare quadruple {719#(and (<= |multiple_of_#in~n| 0) (<= |old(oldRank0)| oldRank0))} {687#(and (<= |multiple_of_#in~n| multiple_of_~n) (<= multiple_of_~m |multiple_of_#in~m|) (<= |old(oldRank0)| oldRank0))} #112#return; {726#(and (<= |multiple_of_#in~n| |multiple_of_#in~m|) (<= |old(oldRank0)| oldRank0))} is VALID [2022-02-21 04:19:24,783 INFO L290 TraceCheckUtils]: 19: Hoare triple {726#(and (<= |multiple_of_#in~n| |multiple_of_#in~m|) (<= |old(oldRank0)| oldRank0))} #res := #t~ret8;havoc #t~ret8; {726#(and (<= |multiple_of_#in~n| |multiple_of_#in~m|) (<= |old(oldRank0)| oldRank0))} is VALID [2022-02-21 04:19:24,784 INFO L290 TraceCheckUtils]: 20: Hoare triple {726#(and (<= |multiple_of_#in~n| |multiple_of_#in~m|) (<= |old(oldRank0)| oldRank0))} assume true; {726#(and (<= |multiple_of_#in~n| |multiple_of_#in~m|) (<= |old(oldRank0)| oldRank0))} is VALID [2022-02-21 04:19:24,785 INFO L284 TraceCheckUtils]: 21: Hoare quadruple {726#(and (<= |multiple_of_#in~n| |multiple_of_#in~m|) (<= |old(oldRank0)| oldRank0))} {676#(and (<= is_prime__~m oldRank0) (< 2 is_prime__~n))} #122#return; {736#(and (<= is_prime__~m oldRank0) (< 2 is_prime__~m))} is VALID [2022-02-21 04:19:24,785 INFO L290 TraceCheckUtils]: 22: Hoare triple {736#(and (<= is_prime__~m oldRank0) (< 2 is_prime__~m))} assume !(0 == #t~ret10);havoc #t~ret10; {736#(and (<= is_prime__~m oldRank0) (< 2 is_prime__~m))} is VALID [2022-02-21 04:19:24,786 INFO L272 TraceCheckUtils]: 23: Hoare triple {736#(and (<= is_prime__~m oldRank0) (< 2 is_prime__~m))} call #t~ret11 := is_prime_(~n, ~m - 1); {652#(or (and (>= oldRank0 0) (> oldRank0 |is_prime__#in~m|)) unseeded)} is VALID [2022-02-21 04:19:24,786 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-02-21 04:19:24,788 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 10 states, 10 states have (on average 2.2) internal successors, (22), 8 states have internal predecessors, (22), 4 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-02-21 04:19:24,806 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 28 edges. 28 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-21 04:19:24,807 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 10 states, 10 states have (on average 2.2) internal successors, (22), 8 states have internal predecessors, (22), 4 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Stem has 4 letters. Loop has 24 letters. [2022-02-21 04:19:24,808 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:24,810 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 9 loop predicates [2022-02-21 04:19:24,810 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 41 states and 54 transitions. cyclomatic complexity: 16 Second operand has 10 states, 10 states have (on average 2.2) internal successors, (22), 8 states have internal predecessors, (22), 4 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-02-21 04:19:26,083 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 41 states and 54 transitions. cyclomatic complexity: 16. Second operand has 10 states, 10 states have (on average 2.2) internal successors, (22), 8 states have internal predecessors, (22), 4 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Result 322 states and 477 transitions. Complement of second has 71 states. [2022-02-21 04:19:26,083 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 13 states 1 stem states 11 non-accepting loop states 1 accepting loop states [2022-02-21 04:19:26,084 INFO L123 tractBuchiDifference]: Start testing correctness of buchiDifferenceNCSBLazy3 [2022-02-21 04:19:26,084 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 41 states and 54 transitions. cyclomatic complexity: 16 [2022-02-21 04:19:26,084 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 04:19:26,084 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 04:19:26,084 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 10 states, 10 states have (on average 2.2) internal successors, (22), 8 states have internal predecessors, (22), 4 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-02-21 04:19:26,092 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 8 [2022-02-21 04:19:26,092 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 04:19:26,092 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 04:19:26,093 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 322 states and 477 transitions. [2022-02-21 04:19:26,102 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 30 [2022-02-21 04:19:26,102 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 04:19:26,102 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 04:19:26,106 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 41 states and 54 transitions. cyclomatic complexity: 16 [2022-02-21 04:19:26,118 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 23 examples of accepted words. [2022-02-21 04:19:26,119 INFO L70 LassoExtractor]: Start lassoExtractor. Operand has 10 states, 10 states have (on average 2.2) internal successors, (22), 8 states have internal predecessors, (22), 4 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-02-21 04:19:26,122 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 8 [2022-02-21 04:19:26,122 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 1 examples of accepted words. [2022-02-21 04:19:26,122 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 322 states and 477 transitions. cyclomatic complexity: 160 [2022-02-21 04:19:26,133 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 31 examples of accepted words. [2022-02-21 04:19:26,133 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 41 states and 54 transitions. cyclomatic complexity: 16 Stem has 4 letters. Loop has 24 letters. [2022-02-21 04:19:26,133 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:26,134 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 10 states, 10 states have (on average 2.2) internal successors, (22), 8 states have internal predecessors, (22), 4 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Stem has 4 letters. Loop has 24 letters. [2022-02-21 04:19:26,134 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:26,134 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 322 states and 477 transitions. cyclomatic complexity: 160 Stem has 4 letters. Loop has 24 letters. [2022-02-21 04:19:26,137 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:26,137 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 41 states and 54 transitions. cyclomatic complexity: 16 Stem has 1 letters. Loop has 10 letters. [2022-02-21 04:19:26,137 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:26,137 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 10 states, 10 states have (on average 2.2) internal successors, (22), 8 states have internal predecessors, (22), 4 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Stem has 1 letters. Loop has 10 letters. [2022-02-21 04:19:26,137 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:26,138 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 322 states and 477 transitions. cyclomatic complexity: 160 Stem has 1 letters. Loop has 10 letters. [2022-02-21 04:19:26,138 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:26,138 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 41 states and 54 transitions. cyclomatic complexity: 16 Stem has 13 letters. Loop has 3 letters. [2022-02-21 04:19:26,138 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:26,138 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 10 states, 10 states have (on average 2.2) internal successors, (22), 8 states have internal predecessors, (22), 4 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Stem has 13 letters. Loop has 3 letters. [2022-02-21 04:19:26,138 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:26,139 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 322 states and 477 transitions. cyclomatic complexity: 160 Stem has 13 letters. Loop has 3 letters. [2022-02-21 04:19:26,139 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:26,139 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 41 states and 54 transitions. cyclomatic complexity: 16 Stem has 322 letters. Loop has 322 letters. [2022-02-21 04:19:26,139 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:26,139 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 10 states, 10 states have (on average 2.2) internal successors, (22), 8 states have internal predecessors, (22), 4 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Stem has 322 letters. Loop has 322 letters. [2022-02-21 04:19:26,139 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:26,139 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 322 states and 477 transitions. cyclomatic complexity: 160 Stem has 322 letters. Loop has 322 letters. [2022-02-21 04:19:26,140 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:26,140 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 41 states and 54 transitions. cyclomatic complexity: 16 Stem has 41 letters. Loop has 41 letters. [2022-02-21 04:19:26,140 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:26,140 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 10 states, 10 states have (on average 2.2) internal successors, (22), 8 states have internal predecessors, (22), 4 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Stem has 41 letters. Loop has 41 letters. [2022-02-21 04:19:26,140 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:26,140 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 322 states and 477 transitions. cyclomatic complexity: 160 Stem has 41 letters. Loop has 41 letters. [2022-02-21 04:19:26,140 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:26,140 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 41 states and 54 transitions. cyclomatic complexity: 16 Stem has 13 letters. Loop has 13 letters. [2022-02-21 04:19:26,140 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:26,141 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 10 states, 10 states have (on average 2.2) internal successors, (22), 8 states have internal predecessors, (22), 4 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Stem has 13 letters. Loop has 13 letters. [2022-02-21 04:19:26,141 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:26,141 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 322 states and 477 transitions. cyclomatic complexity: 160 Stem has 13 letters. Loop has 13 letters. [2022-02-21 04:19:26,141 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:26,141 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 41 states and 54 transitions. cyclomatic complexity: 16 Stem has 10 letters. Loop has 3 letters. [2022-02-21 04:19:26,141 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:26,141 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 10 states, 10 states have (on average 2.2) internal successors, (22), 8 states have internal predecessors, (22), 4 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Stem has 10 letters. Loop has 3 letters. [2022-02-21 04:19:26,141 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:26,141 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 322 states and 477 transitions. cyclomatic complexity: 160 Stem has 10 letters. Loop has 3 letters. [2022-02-21 04:19:26,142 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:26,142 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 41 states and 54 transitions. cyclomatic complexity: 16 Stem has 13 letters. Loop has 4 letters. [2022-02-21 04:19:26,142 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:26,142 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 10 states, 10 states have (on average 2.2) internal successors, (22), 8 states have internal predecessors, (22), 4 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Stem has 13 letters. Loop has 4 letters. [2022-02-21 04:19:26,142 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:26,142 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 322 states and 477 transitions. cyclomatic complexity: 160 Stem has 13 letters. Loop has 4 letters. [2022-02-21 04:19:26,143 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:26,143 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 41 states and 54 transitions. cyclomatic complexity: 16 Stem has 12 letters. Loop has 3 letters. [2022-02-21 04:19:26,143 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:26,144 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 10 states, 10 states have (on average 2.2) internal successors, (22), 8 states have internal predecessors, (22), 4 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Stem has 12 letters. Loop has 3 letters. [2022-02-21 04:19:26,144 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:26,144 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 322 states and 477 transitions. cyclomatic complexity: 160 Stem has 12 letters. Loop has 3 letters. [2022-02-21 04:19:26,144 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:26,144 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 41 states and 54 transitions. cyclomatic complexity: 16 Stem has 13 letters. Loop has 6 letters. [2022-02-21 04:19:26,144 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:26,145 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 10 states, 10 states have (on average 2.2) internal successors, (22), 8 states have internal predecessors, (22), 4 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Stem has 13 letters. Loop has 6 letters. [2022-02-21 04:19:26,145 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:26,145 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 322 states and 477 transitions. cyclomatic complexity: 160 Stem has 13 letters. Loop has 6 letters. [2022-02-21 04:19:26,145 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:26,145 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 41 states and 54 transitions. cyclomatic complexity: 16 Stem has 14 letters. Loop has 6 letters. [2022-02-21 04:19:26,145 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:26,146 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 10 states, 10 states have (on average 2.2) internal successors, (22), 8 states have internal predecessors, (22), 4 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Stem has 14 letters. Loop has 6 letters. [2022-02-21 04:19:26,146 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:26,146 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 322 states and 477 transitions. cyclomatic complexity: 160 Stem has 14 letters. Loop has 6 letters. [2022-02-21 04:19:26,146 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:26,146 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 41 states and 54 transitions. cyclomatic complexity: 16 Stem has 15 letters. Loop has 6 letters. [2022-02-21 04:19:26,146 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:26,146 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 10 states, 10 states have (on average 2.2) internal successors, (22), 8 states have internal predecessors, (22), 4 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Stem has 15 letters. Loop has 6 letters. [2022-02-21 04:19:26,147 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:26,147 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 322 states and 477 transitions. cyclomatic complexity: 160 Stem has 15 letters. Loop has 6 letters. [2022-02-21 04:19:26,147 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:26,147 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 41 states and 54 transitions. cyclomatic complexity: 16 Stem has 11 letters. Loop has 3 letters. [2022-02-21 04:19:26,147 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:26,147 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 10 states, 10 states have (on average 2.2) internal successors, (22), 8 states have internal predecessors, (22), 4 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Stem has 11 letters. Loop has 3 letters. [2022-02-21 04:19:26,148 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:26,148 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 322 states and 477 transitions. cyclomatic complexity: 160 Stem has 11 letters. Loop has 3 letters. [2022-02-21 04:19:26,148 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:26,148 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 41 states and 54 transitions. cyclomatic complexity: 16 Stem has 12 letters. Loop has 4 letters. [2022-02-21 04:19:26,148 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:26,148 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 10 states, 10 states have (on average 2.2) internal successors, (22), 8 states have internal predecessors, (22), 4 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Stem has 12 letters. Loop has 4 letters. [2022-02-21 04:19:26,149 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:26,149 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 322 states and 477 transitions. cyclomatic complexity: 160 Stem has 12 letters. Loop has 4 letters. [2022-02-21 04:19:26,149 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:26,149 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 41 states and 54 transitions. cyclomatic complexity: 16 Stem has 9 letters. Loop has 24 letters. [2022-02-21 04:19:26,150 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:26,151 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 10 states, 10 states have (on average 2.2) internal successors, (22), 8 states have internal predecessors, (22), 4 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Stem has 9 letters. Loop has 24 letters. [2022-02-21 04:19:26,151 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:26,151 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 322 states and 477 transitions. cyclomatic complexity: 160 Stem has 9 letters. Loop has 24 letters. [2022-02-21 04:19:26,152 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:26,152 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 41 states and 54 transitions. cyclomatic complexity: 16 Stem has 8 letters. Loop has 24 letters. [2022-02-21 04:19:26,152 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:26,152 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 10 states, 10 states have (on average 2.2) internal successors, (22), 8 states have internal predecessors, (22), 4 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Stem has 8 letters. Loop has 24 letters. [2022-02-21 04:19:26,153 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:26,154 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 322 states and 477 transitions. cyclomatic complexity: 160 Stem has 8 letters. Loop has 24 letters. [2022-02-21 04:19:26,154 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:26,154 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 41 states and 54 transitions. cyclomatic complexity: 16 Stem has 26 letters. Loop has 24 letters. [2022-02-21 04:19:26,154 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:26,154 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 10 states, 10 states have (on average 2.2) internal successors, (22), 8 states have internal predecessors, (22), 4 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Stem has 26 letters. Loop has 24 letters. [2022-02-21 04:19:26,155 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:26,155 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 322 states and 477 transitions. cyclomatic complexity: 160 Stem has 26 letters. Loop has 24 letters. [2022-02-21 04:19:26,155 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:26,155 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 41 states and 54 transitions. cyclomatic complexity: 16 Stem has 27 letters. Loop has 24 letters. [2022-02-21 04:19:26,155 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:26,156 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 10 states, 10 states have (on average 2.2) internal successors, (22), 8 states have internal predecessors, (22), 4 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Stem has 27 letters. Loop has 24 letters. [2022-02-21 04:19:26,156 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:26,156 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 322 states and 477 transitions. cyclomatic complexity: 160 Stem has 27 letters. Loop has 24 letters. [2022-02-21 04:19:26,156 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:26,156 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 41 states and 54 transitions. cyclomatic complexity: 16 Stem has 5 letters. Loop has 24 letters. [2022-02-21 04:19:26,157 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:26,157 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 10 states, 10 states have (on average 2.2) internal successors, (22), 8 states have internal predecessors, (22), 4 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Stem has 5 letters. Loop has 24 letters. [2022-02-21 04:19:26,157 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:26,157 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 322 states and 477 transitions. cyclomatic complexity: 160 Stem has 5 letters. Loop has 24 letters. [2022-02-21 04:19:26,157 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:26,157 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 41 states and 54 transitions. cyclomatic complexity: 16 Stem has 6 letters. Loop has 24 letters. [2022-02-21 04:19:26,158 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:26,158 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 10 states, 10 states have (on average 2.2) internal successors, (22), 8 states have internal predecessors, (22), 4 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Stem has 6 letters. Loop has 24 letters. [2022-02-21 04:19:26,158 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:26,158 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 322 states and 477 transitions. cyclomatic complexity: 160 Stem has 6 letters. Loop has 24 letters. [2022-02-21 04:19:26,160 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:26,160 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 41 states and 54 transitions. cyclomatic complexity: 16 Stem has 7 letters. Loop has 24 letters. [2022-02-21 04:19:26,160 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:26,160 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 10 states, 10 states have (on average 2.2) internal successors, (22), 8 states have internal predecessors, (22), 4 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Stem has 7 letters. Loop has 24 letters. [2022-02-21 04:19:26,161 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:26,161 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 322 states and 477 transitions. cyclomatic complexity: 160 Stem has 7 letters. Loop has 24 letters. [2022-02-21 04:19:26,162 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:26,162 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 41 states and 54 transitions. cyclomatic complexity: 16 Stem has 4 letters. Loop has 24 letters. [2022-02-21 04:19:26,162 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:26,162 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 10 states, 10 states have (on average 2.2) internal successors, (22), 8 states have internal predecessors, (22), 4 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Stem has 4 letters. Loop has 24 letters. [2022-02-21 04:19:26,163 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:26,163 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 322 states and 477 transitions. cyclomatic complexity: 160 Stem has 4 letters. Loop has 24 letters. [2022-02-21 04:19:26,163 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:26,163 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 41 states and 54 transitions. cyclomatic complexity: 16 Stem has 26 letters. Loop has 24 letters. [2022-02-21 04:19:26,163 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:26,164 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 10 states, 10 states have (on average 2.2) internal successors, (22), 8 states have internal predecessors, (22), 4 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Stem has 26 letters. Loop has 24 letters. [2022-02-21 04:19:26,165 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:26,165 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 322 states and 477 transitions. cyclomatic complexity: 160 Stem has 26 letters. Loop has 24 letters. [2022-02-21 04:19:26,166 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:26,166 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 41 states and 54 transitions. cyclomatic complexity: 16 Stem has 15 letters. Loop has 3 letters. [2022-02-21 04:19:26,166 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:26,166 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 10 states, 10 states have (on average 2.2) internal successors, (22), 8 states have internal predecessors, (22), 4 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Stem has 15 letters. Loop has 3 letters. [2022-02-21 04:19:26,166 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:26,166 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 322 states and 477 transitions. cyclomatic complexity: 160 Stem has 15 letters. Loop has 3 letters. [2022-02-21 04:19:26,167 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:26,167 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 41 states and 54 transitions. cyclomatic complexity: 16 Stem has 16 letters. Loop has 5 letters. [2022-02-21 04:19:26,167 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:26,167 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 10 states, 10 states have (on average 2.2) internal successors, (22), 8 states have internal predecessors, (22), 4 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Stem has 16 letters. Loop has 5 letters. [2022-02-21 04:19:26,167 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:26,167 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 322 states and 477 transitions. cyclomatic complexity: 160 Stem has 16 letters. Loop has 5 letters. [2022-02-21 04:19:26,167 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:26,167 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 41 states and 54 transitions. cyclomatic complexity: 16 Stem has 17 letters. Loop has 5 letters. [2022-02-21 04:19:26,168 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:26,168 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 10 states, 10 states have (on average 2.2) internal successors, (22), 8 states have internal predecessors, (22), 4 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Stem has 17 letters. Loop has 5 letters. [2022-02-21 04:19:26,168 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:26,168 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 322 states and 477 transitions. cyclomatic complexity: 160 Stem has 17 letters. Loop has 5 letters. [2022-02-21 04:19:26,168 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:26,168 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 41 states and 54 transitions. cyclomatic complexity: 16 Stem has 16 letters. Loop has 3 letters. [2022-02-21 04:19:26,168 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:26,168 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 10 states, 10 states have (on average 2.2) internal successors, (22), 8 states have internal predecessors, (22), 4 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Stem has 16 letters. Loop has 3 letters. [2022-02-21 04:19:26,169 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:26,169 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 322 states and 477 transitions. cyclomatic complexity: 160 Stem has 16 letters. Loop has 3 letters. [2022-02-21 04:19:26,169 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:26,169 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 41 states and 54 transitions. cyclomatic complexity: 16 Stem has 18 letters. Loop has 5 letters. [2022-02-21 04:19:26,169 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:26,169 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 10 states, 10 states have (on average 2.2) internal successors, (22), 8 states have internal predecessors, (22), 4 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Stem has 18 letters. Loop has 5 letters. [2022-02-21 04:19:26,169 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:26,169 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 322 states and 477 transitions. cyclomatic complexity: 160 Stem has 18 letters. Loop has 5 letters. [2022-02-21 04:19:26,170 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:26,170 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 41 states and 54 transitions. cyclomatic complexity: 16 Stem has 14 letters. Loop has 3 letters. [2022-02-21 04:19:26,170 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:26,170 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 10 states, 10 states have (on average 2.2) internal successors, (22), 8 states have internal predecessors, (22), 4 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Stem has 14 letters. Loop has 3 letters. [2022-02-21 04:19:26,170 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:26,170 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 322 states and 477 transitions. cyclomatic complexity: 160 Stem has 14 letters. Loop has 3 letters. [2022-02-21 04:19:26,170 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:26,170 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 41 states and 54 transitions. cyclomatic complexity: 16 Stem has 1 letters. Loop has 10 letters. [2022-02-21 04:19:26,170 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:26,171 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 10 states, 10 states have (on average 2.2) internal successors, (22), 8 states have internal predecessors, (22), 4 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Stem has 1 letters. Loop has 10 letters. [2022-02-21 04:19:26,171 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:26,172 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 322 states and 477 transitions. cyclomatic complexity: 160 Stem has 1 letters. Loop has 10 letters. [2022-02-21 04:19:26,172 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:26,172 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 41 states and 54 transitions. cyclomatic complexity: 16 Stem has 19 letters. Loop has 10 letters. [2022-02-21 04:19:26,172 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:26,172 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 10 states, 10 states have (on average 2.2) internal successors, (22), 8 states have internal predecessors, (22), 4 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Stem has 19 letters. Loop has 10 letters. [2022-02-21 04:19:26,173 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:26,173 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 322 states and 477 transitions. cyclomatic complexity: 160 Stem has 19 letters. Loop has 10 letters. [2022-02-21 04:19:26,173 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:26,173 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 41 states and 54 transitions. cyclomatic complexity: 16 Stem has 13 letters. Loop has 3 letters. [2022-02-21 04:19:26,174 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:26,174 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 10 states, 10 states have (on average 2.2) internal successors, (22), 8 states have internal predecessors, (22), 4 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Stem has 13 letters. Loop has 3 letters. [2022-02-21 04:19:26,174 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:26,174 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 322 states and 477 transitions. cyclomatic complexity: 160 Stem has 13 letters. Loop has 3 letters. [2022-02-21 04:19:26,174 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:26,174 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 41 states and 54 transitions. cyclomatic complexity: 16 Stem has 16 letters. Loop has 7 letters. [2022-02-21 04:19:26,174 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:26,174 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 10 states, 10 states have (on average 2.2) internal successors, (22), 8 states have internal predecessors, (22), 4 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Stem has 16 letters. Loop has 7 letters. [2022-02-21 04:19:26,175 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:26,175 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 322 states and 477 transitions. cyclomatic complexity: 160 Stem has 16 letters. Loop has 7 letters. [2022-02-21 04:19:26,175 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:26,175 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 41 states and 54 transitions. cyclomatic complexity: 16 Stem has 16 letters. Loop has 6 letters. [2022-02-21 04:19:26,175 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:26,175 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 10 states, 10 states have (on average 2.2) internal successors, (22), 8 states have internal predecessors, (22), 4 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Stem has 16 letters. Loop has 6 letters. [2022-02-21 04:19:26,176 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:26,176 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 322 states and 477 transitions. cyclomatic complexity: 160 Stem has 16 letters. Loop has 6 letters. [2022-02-21 04:19:26,176 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:26,177 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 41 states and 54 transitions. cyclomatic complexity: 16 Stem has 16 letters. Loop has 7 letters. [2022-02-21 04:19:26,177 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:26,177 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 10 states, 10 states have (on average 2.2) internal successors, (22), 8 states have internal predecessors, (22), 4 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Stem has 16 letters. Loop has 7 letters. [2022-02-21 04:19:26,177 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:26,177 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 322 states and 477 transitions. cyclomatic complexity: 160 Stem has 16 letters. Loop has 7 letters. [2022-02-21 04:19:26,177 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:26,177 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 41 states and 54 transitions. cyclomatic complexity: 16 Stem has 16 letters. Loop has 4 letters. [2022-02-21 04:19:26,177 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:26,178 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 10 states, 10 states have (on average 2.2) internal successors, (22), 8 states have internal predecessors, (22), 4 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Stem has 16 letters. Loop has 4 letters. [2022-02-21 04:19:26,178 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:26,178 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 322 states and 477 transitions. cyclomatic complexity: 160 Stem has 16 letters. Loop has 4 letters. [2022-02-21 04:19:26,178 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:26,178 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 41 states and 54 transitions. cyclomatic complexity: 16 Stem has 14 letters. Loop has 3 letters. [2022-02-21 04:19:26,178 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:26,188 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 10 states, 10 states have (on average 2.2) internal successors, (22), 8 states have internal predecessors, (22), 4 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Stem has 14 letters. Loop has 3 letters. [2022-02-21 04:19:26,188 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:26,188 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 322 states and 477 transitions. cyclomatic complexity: 160 Stem has 14 letters. Loop has 3 letters. [2022-02-21 04:19:26,188 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:26,188 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 41 states and 54 transitions. cyclomatic complexity: 16 Stem has 14 letters. Loop has 4 letters. [2022-02-21 04:19:26,188 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:26,189 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 10 states, 10 states have (on average 2.2) internal successors, (22), 8 states have internal predecessors, (22), 4 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Stem has 14 letters. Loop has 4 letters. [2022-02-21 04:19:26,189 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:26,189 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 322 states and 477 transitions. cyclomatic complexity: 160 Stem has 14 letters. Loop has 4 letters. [2022-02-21 04:19:26,189 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:26,189 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 41 states and 54 transitions. cyclomatic complexity: 16 Stem has 17 letters. Loop has 6 letters. [2022-02-21 04:19:26,190 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:26,190 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 10 states, 10 states have (on average 2.2) internal successors, (22), 8 states have internal predecessors, (22), 4 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Stem has 17 letters. Loop has 6 letters. [2022-02-21 04:19:26,190 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:26,190 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 322 states and 477 transitions. cyclomatic complexity: 160 Stem has 17 letters. Loop has 6 letters. [2022-02-21 04:19:26,190 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:26,190 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 41 states and 54 transitions. cyclomatic complexity: 16 Stem has 17 letters. Loop has 4 letters. [2022-02-21 04:19:26,191 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:26,191 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 10 states, 10 states have (on average 2.2) internal successors, (22), 8 states have internal predecessors, (22), 4 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Stem has 17 letters. Loop has 4 letters. [2022-02-21 04:19:26,191 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:26,191 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 322 states and 477 transitions. cyclomatic complexity: 160 Stem has 17 letters. Loop has 4 letters. [2022-02-21 04:19:26,191 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:26,191 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 41 states and 54 transitions. cyclomatic complexity: 16 Stem has 17 letters. Loop has 10 letters. [2022-02-21 04:19:26,191 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:26,192 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 10 states, 10 states have (on average 2.2) internal successors, (22), 8 states have internal predecessors, (22), 4 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Stem has 17 letters. Loop has 10 letters. [2022-02-21 04:19:26,192 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:26,192 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 322 states and 477 transitions. cyclomatic complexity: 160 Stem has 17 letters. Loop has 10 letters. [2022-02-21 04:19:26,192 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:26,192 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 41 states and 54 transitions. cyclomatic complexity: 16 Stem has 15 letters. Loop has 3 letters. [2022-02-21 04:19:26,192 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:26,192 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 10 states, 10 states have (on average 2.2) internal successors, (22), 8 states have internal predecessors, (22), 4 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Stem has 15 letters. Loop has 3 letters. [2022-02-21 04:19:26,192 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:26,192 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 322 states and 477 transitions. cyclomatic complexity: 160 Stem has 15 letters. Loop has 3 letters. [2022-02-21 04:19:26,193 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:26,193 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 41 states and 54 transitions. cyclomatic complexity: 16 Stem has 15 letters. Loop has 6 letters. [2022-02-21 04:19:26,193 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:26,194 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 10 states, 10 states have (on average 2.2) internal successors, (22), 8 states have internal predecessors, (22), 4 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Stem has 15 letters. Loop has 6 letters. [2022-02-21 04:19:26,194 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:26,194 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 322 states and 477 transitions. cyclomatic complexity: 160 Stem has 15 letters. Loop has 6 letters. [2022-02-21 04:19:26,194 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:26,194 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 41 states and 54 transitions. cyclomatic complexity: 16 Stem has 18 letters. Loop has 6 letters. [2022-02-21 04:19:26,194 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:26,195 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 10 states, 10 states have (on average 2.2) internal successors, (22), 8 states have internal predecessors, (22), 4 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Stem has 18 letters. Loop has 6 letters. [2022-02-21 04:19:26,195 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:26,195 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 322 states and 477 transitions. cyclomatic complexity: 160 Stem has 18 letters. Loop has 6 letters. [2022-02-21 04:19:26,195 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:26,195 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 41 states and 54 transitions. cyclomatic complexity: 16 Stem has 18 letters. Loop has 10 letters. [2022-02-21 04:19:26,195 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:26,195 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 10 states, 10 states have (on average 2.2) internal successors, (22), 8 states have internal predecessors, (22), 4 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Stem has 18 letters. Loop has 10 letters. [2022-02-21 04:19:26,195 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:26,195 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 322 states and 477 transitions. cyclomatic complexity: 160 Stem has 18 letters. Loop has 10 letters. [2022-02-21 04:19:26,196 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:26,196 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 41 states and 54 transitions. cyclomatic complexity: 16 Stem has 15 letters. Loop has 4 letters. [2022-02-21 04:19:26,196 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:26,196 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 10 states, 10 states have (on average 2.2) internal successors, (22), 8 states have internal predecessors, (22), 4 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Stem has 15 letters. Loop has 4 letters. [2022-02-21 04:19:26,196 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:26,196 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 322 states and 477 transitions. cyclomatic complexity: 160 Stem has 15 letters. Loop has 4 letters. [2022-02-21 04:19:26,196 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:26,196 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 41 states and 54 transitions. cyclomatic complexity: 16 Stem has 102 letters. Loop has 33 letters. [2022-02-21 04:19:26,197 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:26,197 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 10 states, 10 states have (on average 2.2) internal successors, (22), 8 states have internal predecessors, (22), 4 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Stem has 102 letters. Loop has 33 letters. [2022-02-21 04:19:26,197 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:26,198 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 322 states and 477 transitions. cyclomatic complexity: 160 Stem has 102 letters. Loop has 33 letters. [2022-02-21 04:19:26,198 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:26,198 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 41 states and 54 transitions. cyclomatic complexity: 16 Stem has 75 letters. Loop has 33 letters. [2022-02-21 04:19:26,198 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:26,198 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 10 states, 10 states have (on average 2.2) internal successors, (22), 8 states have internal predecessors, (22), 4 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Stem has 75 letters. Loop has 33 letters. [2022-02-21 04:19:26,199 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:26,199 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 322 states and 477 transitions. cyclomatic complexity: 160 Stem has 75 letters. Loop has 33 letters. [2022-02-21 04:19:26,199 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:26,199 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 41 states and 54 transitions. cyclomatic complexity: 16 Stem has 70 letters. Loop has 33 letters. [2022-02-21 04:19:26,199 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:26,200 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 10 states, 10 states have (on average 2.2) internal successors, (22), 8 states have internal predecessors, (22), 4 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Stem has 70 letters. Loop has 33 letters. [2022-02-21 04:19:26,200 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:26,200 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 322 states and 477 transitions. cyclomatic complexity: 160 Stem has 70 letters. Loop has 33 letters. [2022-02-21 04:19:26,200 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:26,200 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 41 states and 54 transitions. cyclomatic complexity: 16 Stem has 71 letters. Loop has 33 letters. [2022-02-21 04:19:26,201 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:26,201 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 10 states, 10 states have (on average 2.2) internal successors, (22), 8 states have internal predecessors, (22), 4 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Stem has 71 letters. Loop has 33 letters. [2022-02-21 04:19:26,202 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:26,202 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 322 states and 477 transitions. cyclomatic complexity: 160 Stem has 71 letters. Loop has 33 letters. [2022-02-21 04:19:26,202 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:26,202 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 41 states and 54 transitions. cyclomatic complexity: 16 Stem has 72 letters. Loop has 33 letters. [2022-02-21 04:19:26,203 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:26,203 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 10 states, 10 states have (on average 2.2) internal successors, (22), 8 states have internal predecessors, (22), 4 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Stem has 72 letters. Loop has 33 letters. [2022-02-21 04:19:26,204 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:26,204 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 322 states and 477 transitions. cyclomatic complexity: 160 Stem has 72 letters. Loop has 33 letters. [2022-02-21 04:19:26,204 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:26,204 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 41 states and 54 transitions. cyclomatic complexity: 16 Stem has 73 letters. Loop has 33 letters. [2022-02-21 04:19:26,205 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:26,205 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 10 states, 10 states have (on average 2.2) internal successors, (22), 8 states have internal predecessors, (22), 4 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Stem has 73 letters. Loop has 33 letters. [2022-02-21 04:19:26,205 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:26,206 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 322 states and 477 transitions. cyclomatic complexity: 160 Stem has 73 letters. Loop has 33 letters. [2022-02-21 04:19:26,206 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:26,206 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 41 states and 54 transitions. cyclomatic complexity: 16 Stem has 101 letters. Loop has 33 letters. [2022-02-21 04:19:26,206 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:26,207 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 10 states, 10 states have (on average 2.2) internal successors, (22), 8 states have internal predecessors, (22), 4 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Stem has 101 letters. Loop has 33 letters. [2022-02-21 04:19:26,207 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:26,207 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 322 states and 477 transitions. cyclomatic complexity: 160 Stem has 101 letters. Loop has 33 letters. [2022-02-21 04:19:26,208 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:26,208 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 41 states and 54 transitions. cyclomatic complexity: 16 Stem has 74 letters. Loop has 33 letters. [2022-02-21 04:19:26,208 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:26,209 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 10 states, 10 states have (on average 2.2) internal successors, (22), 8 states have internal predecessors, (22), 4 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Stem has 74 letters. Loop has 33 letters. [2022-02-21 04:19:26,209 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:26,210 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 322 states and 477 transitions. cyclomatic complexity: 160 Stem has 74 letters. Loop has 33 letters. [2022-02-21 04:19:26,210 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:26,210 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 41 states and 54 transitions. cyclomatic complexity: 16 Stem has 101 letters. Loop has 33 letters. [2022-02-21 04:19:26,210 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:26,211 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 10 states, 10 states have (on average 2.2) internal successors, (22), 8 states have internal predecessors, (22), 4 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Stem has 101 letters. Loop has 33 letters. [2022-02-21 04:19:26,211 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:26,211 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 322 states and 477 transitions. cyclomatic complexity: 160 Stem has 101 letters. Loop has 33 letters. [2022-02-21 04:19:26,211 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:26,211 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 41 states and 54 transitions. cyclomatic complexity: 16 Stem has 17 letters. Loop has 5 letters. [2022-02-21 04:19:26,212 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:26,212 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 10 states, 10 states have (on average 2.2) internal successors, (22), 8 states have internal predecessors, (22), 4 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Stem has 17 letters. Loop has 5 letters. [2022-02-21 04:19:26,212 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:26,212 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 322 states and 477 transitions. cyclomatic complexity: 160 Stem has 17 letters. Loop has 5 letters. [2022-02-21 04:19:26,212 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:26,212 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 41 states and 54 transitions. cyclomatic complexity: 16 Stem has 16 letters. Loop has 3 letters. [2022-02-21 04:19:26,213 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:26,213 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 10 states, 10 states have (on average 2.2) internal successors, (22), 8 states have internal predecessors, (22), 4 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Stem has 16 letters. Loop has 3 letters. [2022-02-21 04:19:26,213 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:26,213 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 322 states and 477 transitions. cyclomatic complexity: 160 Stem has 16 letters. Loop has 3 letters. [2022-02-21 04:19:26,213 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:26,213 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 41 states and 54 transitions. cyclomatic complexity: 16 Stem has 16 letters. Loop has 5 letters. [2022-02-21 04:19:26,213 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:26,214 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 10 states, 10 states have (on average 2.2) internal successors, (22), 8 states have internal predecessors, (22), 4 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Stem has 16 letters. Loop has 5 letters. [2022-02-21 04:19:26,214 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:26,214 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 322 states and 477 transitions. cyclomatic complexity: 160 Stem has 16 letters. Loop has 5 letters. [2022-02-21 04:19:26,214 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:26,214 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 41 states and 54 transitions. cyclomatic complexity: 16 Stem has 15 letters. Loop has 3 letters. [2022-02-21 04:19:26,214 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:26,214 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 10 states, 10 states have (on average 2.2) internal successors, (22), 8 states have internal predecessors, (22), 4 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Stem has 15 letters. Loop has 3 letters. [2022-02-21 04:19:26,214 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:26,215 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 322 states and 477 transitions. cyclomatic complexity: 160 Stem has 15 letters. Loop has 3 letters. [2022-02-21 04:19:26,215 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:26,215 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 41 states and 54 transitions. cyclomatic complexity: 16 Stem has 18 letters. Loop has 5 letters. [2022-02-21 04:19:26,215 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:26,215 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 10 states, 10 states have (on average 2.2) internal successors, (22), 8 states have internal predecessors, (22), 4 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Stem has 18 letters. Loop has 5 letters. [2022-02-21 04:19:26,215 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:26,215 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 322 states and 477 transitions. cyclomatic complexity: 160 Stem has 18 letters. Loop has 5 letters. [2022-02-21 04:19:26,215 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:26,216 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 41 states and 54 transitions. cyclomatic complexity: 16 Stem has 14 letters. Loop has 3 letters. [2022-02-21 04:19:26,216 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:26,216 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 10 states, 10 states have (on average 2.2) internal successors, (22), 8 states have internal predecessors, (22), 4 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Stem has 14 letters. Loop has 3 letters. [2022-02-21 04:19:26,216 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:26,216 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 322 states and 477 transitions. cyclomatic complexity: 160 Stem has 14 letters. Loop has 3 letters. [2022-02-21 04:19:26,216 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:26,216 INFO L161 tractBuchiDifference]: Finished testing correctness of buchiDifferenceNCSBLazy3 [2022-02-21 04:19:26,218 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10 states, 10 states have (on average 2.2) internal successors, (22), 8 states have internal predecessors, (22), 4 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-02-21 04:19:26,220 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 77 transitions. [2022-02-21 04:19:26,221 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 13 states and 77 transitions. Stem has 4 letters. Loop has 24 letters. [2022-02-21 04:19:26,221 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:26,221 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 13 states and 77 transitions. Stem has 28 letters. Loop has 24 letters. [2022-02-21 04:19:26,221 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:26,221 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 13 states and 77 transitions. Stem has 4 letters. Loop has 48 letters. [2022-02-21 04:19:26,222 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:26,222 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 322 states and 477 transitions. cyclomatic complexity: 160 [2022-02-21 04:19:26,240 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 30 [2022-02-21 04:19:26,253 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 322 states to 264 states and 371 transitions. [2022-02-21 04:19:26,254 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 156 [2022-02-21 04:19:26,254 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 159 [2022-02-21 04:19:26,254 INFO L73 IsDeterministic]: Start isDeterministic. Operand 264 states and 371 transitions. [2022-02-21 04:19:26,254 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2022-02-21 04:19:26,254 INFO L681 BuchiCegarLoop]: Abstraction has 264 states and 371 transitions. [2022-02-21 04:19:26,255 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 264 states and 371 transitions. [2022-02-21 04:19:26,264 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 264 to 163. [2022-02-21 04:19:26,264 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-21 04:19:26,265 INFO L82 GeneralOperation]: Start isEquivalent. First operand 264 states and 371 transitions. Second operand has 163 states, 118 states have (on average 1.3135593220338984) internal successors, (155), 119 states have internal predecessors, (155), 28 states have call successors, (28), 13 states have call predecessors, (28), 17 states have return successors, (37), 30 states have call predecessors, (37), 23 states have call successors, (37) [2022-02-21 04:19:26,265 INFO L74 IsIncluded]: Start isIncluded. First operand 264 states and 371 transitions. Second operand has 163 states, 118 states have (on average 1.3135593220338984) internal successors, (155), 119 states have internal predecessors, (155), 28 states have call successors, (28), 13 states have call predecessors, (28), 17 states have return successors, (37), 30 states have call predecessors, (37), 23 states have call successors, (37) [2022-02-21 04:19:26,266 INFO L87 Difference]: Start difference. First operand 264 states and 371 transitions. Second operand has 163 states, 118 states have (on average 1.3135593220338984) internal successors, (155), 119 states have internal predecessors, (155), 28 states have call successors, (28), 13 states have call predecessors, (28), 17 states have return successors, (37), 30 states have call predecessors, (37), 23 states have call successors, (37) [2022-02-21 04:19:26,266 INFO L149 Difference]: Subtrahend was not deterministic. Recomputing result with determinization. [2022-02-21 04:19:26,332 INFO L93 Difference]: Finished difference Result 614 states and 829 transitions. [2022-02-21 04:19:26,332 INFO L276 IsEmpty]: Start isEmpty. Operand 614 states and 829 transitions. [2022-02-21 04:19:26,337 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 04:19:26,337 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 04:19:26,338 INFO L74 IsIncluded]: Start isIncluded. First operand has 163 states, 118 states have (on average 1.3135593220338984) internal successors, (155), 119 states have internal predecessors, (155), 28 states have call successors, (28), 13 states have call predecessors, (28), 17 states have return successors, (37), 30 states have call predecessors, (37), 23 states have call successors, (37) Second operand 264 states and 371 transitions. [2022-02-21 04:19:26,338 INFO L87 Difference]: Start difference. First operand has 163 states, 118 states have (on average 1.3135593220338984) internal successors, (155), 119 states have internal predecessors, (155), 28 states have call successors, (28), 13 states have call predecessors, (28), 17 states have return successors, (37), 30 states have call predecessors, (37), 23 states have call successors, (37) Second operand 264 states and 371 transitions. [2022-02-21 04:19:26,339 INFO L149 Difference]: Subtrahend was not deterministic. Recomputing result with determinization. [2022-02-21 04:19:26,396 INFO L93 Difference]: Finished difference Result 835 states and 1137 transitions. [2022-02-21 04:19:26,396 INFO L276 IsEmpty]: Start isEmpty. Operand 835 states and 1137 transitions. [2022-02-21 04:19:26,399 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 04:19:26,399 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 04:19:26,399 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-21 04:19:26,400 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-21 04:19:26,400 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 163 states, 118 states have (on average 1.3135593220338984) internal successors, (155), 119 states have internal predecessors, (155), 28 states have call successors, (28), 13 states have call predecessors, (28), 17 states have return successors, (37), 30 states have call predecessors, (37), 23 states have call successors, (37) [2022-02-21 04:19:26,404 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 163 states to 163 states and 220 transitions. [2022-02-21 04:19:26,404 INFO L704 BuchiCegarLoop]: Abstraction has 163 states and 220 transitions. [2022-02-21 04:19:26,404 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-21 04:19:26,405 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-02-21 04:19:26,405 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=98, Unknown=0, NotChecked=0, Total=132 [2022-02-21 04:19:26,405 INFO L87 Difference]: Start difference. First operand 163 states and 220 transitions. Second operand has 12 states, 12 states have (on average 3.5) internal successors, (42), 11 states have internal predecessors, (42), 6 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (4), 2 states have call predecessors, (4), 4 states have call successors, (4) [2022-02-21 04:19:26,799 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 04:19:26,799 INFO L93 Difference]: Finished difference Result 171 states and 229 transitions. [2022-02-21 04:19:26,799 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-02-21 04:19:26,800 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 12 states, 12 states have (on average 3.5) internal successors, (42), 11 states have internal predecessors, (42), 6 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (4), 2 states have call predecessors, (4), 4 states have call successors, (4) [2022-02-21 04:19:26,835 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 52 edges. 52 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-21 04:19:26,836 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 171 states and 229 transitions. [2022-02-21 04:19:26,841 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 29 [2022-02-21 04:19:26,844 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 171 states to 107 states and 147 transitions. [2022-02-21 04:19:26,845 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 107 [2022-02-21 04:19:26,845 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 107 [2022-02-21 04:19:26,845 INFO L73 IsDeterministic]: Start isDeterministic. Operand 107 states and 147 transitions. [2022-02-21 04:19:26,846 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-02-21 04:19:26,846 INFO L681 BuchiCegarLoop]: Abstraction has 107 states and 147 transitions. [2022-02-21 04:19:26,846 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 107 states and 147 transitions. [2022-02-21 04:19:26,849 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 107 to 93. [2022-02-21 04:19:26,849 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-21 04:19:26,849 INFO L82 GeneralOperation]: Start isEquivalent. First operand 107 states and 147 transitions. Second operand has 93 states, 67 states have (on average 1.3880597014925373) internal successors, (93), 71 states have internal predecessors, (93), 18 states have call successors, (18), 8 states have call predecessors, (18), 8 states have return successors, (15), 13 states have call predecessors, (15), 13 states have call successors, (15) [2022-02-21 04:19:26,850 INFO L74 IsIncluded]: Start isIncluded. First operand 107 states and 147 transitions. Second operand has 93 states, 67 states have (on average 1.3880597014925373) internal successors, (93), 71 states have internal predecessors, (93), 18 states have call successors, (18), 8 states have call predecessors, (18), 8 states have return successors, (15), 13 states have call predecessors, (15), 13 states have call successors, (15) [2022-02-21 04:19:26,850 INFO L87 Difference]: Start difference. First operand 107 states and 147 transitions. Second operand has 93 states, 67 states have (on average 1.3880597014925373) internal successors, (93), 71 states have internal predecessors, (93), 18 states have call successors, (18), 8 states have call predecessors, (18), 8 states have return successors, (15), 13 states have call predecessors, (15), 13 states have call successors, (15) [2022-02-21 04:19:26,852 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 04:19:26,853 INFO L93 Difference]: Finished difference Result 107 states and 147 transitions. [2022-02-21 04:19:26,853 INFO L276 IsEmpty]: Start isEmpty. Operand 107 states and 147 transitions. [2022-02-21 04:19:26,853 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 04:19:26,853 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 04:19:26,853 INFO L74 IsIncluded]: Start isIncluded. First operand has 93 states, 67 states have (on average 1.3880597014925373) internal successors, (93), 71 states have internal predecessors, (93), 18 states have call successors, (18), 8 states have call predecessors, (18), 8 states have return successors, (15), 13 states have call predecessors, (15), 13 states have call successors, (15) Second operand 107 states and 147 transitions. [2022-02-21 04:19:26,854 INFO L87 Difference]: Start difference. First operand has 93 states, 67 states have (on average 1.3880597014925373) internal successors, (93), 71 states have internal predecessors, (93), 18 states have call successors, (18), 8 states have call predecessors, (18), 8 states have return successors, (15), 13 states have call predecessors, (15), 13 states have call successors, (15) Second operand 107 states and 147 transitions. [2022-02-21 04:19:26,856 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 04:19:26,856 INFO L93 Difference]: Finished difference Result 107 states and 147 transitions. [2022-02-21 04:19:26,857 INFO L276 IsEmpty]: Start isEmpty. Operand 107 states and 147 transitions. [2022-02-21 04:19:26,857 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 04:19:26,857 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 04:19:26,857 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-21 04:19:26,857 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-21 04:19:26,858 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 93 states, 67 states have (on average 1.3880597014925373) internal successors, (93), 71 states have internal predecessors, (93), 18 states have call successors, (18), 8 states have call predecessors, (18), 8 states have return successors, (15), 13 states have call predecessors, (15), 13 states have call successors, (15) [2022-02-21 04:19:26,860 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93 states to 93 states and 126 transitions. [2022-02-21 04:19:26,860 INFO L704 BuchiCegarLoop]: Abstraction has 93 states and 126 transitions. [2022-02-21 04:19:26,860 INFO L587 BuchiCegarLoop]: Abstraction has 93 states and 126 transitions. [2022-02-21 04:19:26,860 INFO L425 BuchiCegarLoop]: ======== Iteration 4============ [2022-02-21 04:19:26,860 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 93 states and 126 transitions. [2022-02-21 04:19:26,861 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 29 [2022-02-21 04:19:26,861 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 04:19:26,861 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 04:19:26,861 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-21 04:19:26,861 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2022-02-21 04:19:26,862 INFO L791 eck$LassoCheckResult]: Stem: 3907#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(9, 2);call #Ultimate.allocInit(12, 3); 3886#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet12#1, main_#t~ret13#1, main_#t~nondet14#1, main_#t~nondet15#1, main_#t~ret16#1, main_#t~short17#1, main_~n~0#1, main_~result~0#1, main_~f1~0#1, main_~f2~0#1;main_~n~0#1 := main_#t~nondet12#1;havoc main_#t~nondet12#1; 3887#L78 assume !(main_~n~0#1 < 1 || main_~n~0#1 > 46340);assume { :begin_inline_is_prime } true;is_prime_#in~n#1 := main_~n~0#1;havoc is_prime_#res#1;havoc is_prime_#t~ret9#1, is_prime_~n#1;is_prime_~n#1 := is_prime_#in~n#1; 3910#L53 call is_prime_#t~ret9#1 := is_prime_(is_prime_~n#1, is_prime_~n#1 - 1);< 3929#is_prime_ENTRY ~n := #in~n;~m := #in~m; 3933#L58 assume !(~n <= 1); 3934#L61 assume !(2 == ~n); 3937#L64 assume ~n > 2; 3932#L65 assume !(~m <= 1); 3911#L68 call #t~ret10 := multiple_of(~n, ~m);< 3939#multiple_ofENTRY ~n := #in~n;~m := #in~m; 3956#L32 assume ~m < 0; 3915#L33 [2022-02-21 04:19:26,862 INFO L793 eck$LassoCheckResult]: Loop: 3915#L33 call #t~ret6 := multiple_of(~n, -~m);< 3897#multiple_ofENTRY ~n := #in~n;~m := #in~m; 3923#L32 assume ~m < 0; 3915#L33 [2022-02-21 04:19:26,862 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 04:19:26,862 INFO L85 PathProgramCache]: Analyzing trace with hash -123397399, now seen corresponding path program 1 times [2022-02-21 04:19:26,862 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 04:19:26,862 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1431300910] [2022-02-21 04:19:26,863 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 04:19:26,863 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 04:19:26,870 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 04:19:26,887 INFO L290 TraceCheckUtils]: 0: Hoare triple {4182#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(9, 2);call #Ultimate.allocInit(12, 3); {4182#true} is VALID [2022-02-21 04:19:26,887 INFO L290 TraceCheckUtils]: 1: Hoare triple {4182#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet12#1, main_#t~ret13#1, main_#t~nondet14#1, main_#t~nondet15#1, main_#t~ret16#1, main_#t~short17#1, main_~n~0#1, main_~result~0#1, main_~f1~0#1, main_~f2~0#1;main_~n~0#1 := main_#t~nondet12#1;havoc main_#t~nondet12#1; {4182#true} is VALID [2022-02-21 04:19:26,887 INFO L290 TraceCheckUtils]: 2: Hoare triple {4182#true} assume !(main_~n~0#1 < 1 || main_~n~0#1 > 46340);assume { :begin_inline_is_prime } true;is_prime_#in~n#1 := main_~n~0#1;havoc is_prime_#res#1;havoc is_prime_#t~ret9#1, is_prime_~n#1;is_prime_~n#1 := is_prime_#in~n#1; {4182#true} is VALID [2022-02-21 04:19:26,887 INFO L272 TraceCheckUtils]: 3: Hoare triple {4182#true} call is_prime_#t~ret9#1 := is_prime_(is_prime_~n#1, is_prime_~n#1 - 1); {4182#true} is VALID [2022-02-21 04:19:26,887 INFO L290 TraceCheckUtils]: 4: Hoare triple {4182#true} ~n := #in~n;~m := #in~m; {4182#true} is VALID [2022-02-21 04:19:26,888 INFO L290 TraceCheckUtils]: 5: Hoare triple {4182#true} assume !(~n <= 1); {4182#true} is VALID [2022-02-21 04:19:26,888 INFO L290 TraceCheckUtils]: 6: Hoare triple {4182#true} assume !(2 == ~n); {4182#true} is VALID [2022-02-21 04:19:26,888 INFO L290 TraceCheckUtils]: 7: Hoare triple {4182#true} assume ~n > 2; {4182#true} is VALID [2022-02-21 04:19:26,890 INFO L290 TraceCheckUtils]: 8: Hoare triple {4182#true} assume !(~m <= 1); {4184#(<= 2 is_prime__~m)} is VALID [2022-02-21 04:19:26,891 INFO L272 TraceCheckUtils]: 9: Hoare triple {4184#(<= 2 is_prime__~m)} call #t~ret10 := multiple_of(~n, ~m); {4185#(<= 2 |multiple_of_#in~m|)} is VALID [2022-02-21 04:19:26,891 INFO L290 TraceCheckUtils]: 10: Hoare triple {4185#(<= 2 |multiple_of_#in~m|)} ~n := #in~n;~m := #in~m; {4186#(<= 2 multiple_of_~m)} is VALID [2022-02-21 04:19:26,891 INFO L290 TraceCheckUtils]: 11: Hoare triple {4186#(<= 2 multiple_of_~m)} assume ~m < 0; {4183#false} is VALID [2022-02-21 04:19:26,891 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 04:19:26,892 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-21 04:19:26,892 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1431300910] [2022-02-21 04:19:26,892 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1431300910] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-21 04:19:26,892 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-21 04:19:26,892 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-02-21 04:19:26,892 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1228017126] [2022-02-21 04:19:26,892 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-21 04:19:26,893 INFO L796 eck$LassoCheckResult]: stem already infeasible [2022-02-21 04:19:26,893 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 04:19:26,893 INFO L85 PathProgramCache]: Analyzing trace with hash 132621, now seen corresponding path program 1 times [2022-02-21 04:19:26,893 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 04:19:26,893 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [655435498] [2022-02-21 04:19:26,893 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 04:19:26,893 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 04:19:26,896 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 04:19:26,896 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-02-21 04:19:26,897 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 04:19:26,898 INFO L138 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-02-21 04:19:26,965 INFO L210 LassoAnalysis]: Preferences: [2022-02-21 04:19:26,965 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2022-02-21 04:19:26,966 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2022-02-21 04:19:26,966 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2022-02-21 04:19:26,966 INFO L129 ssoRankerPreferences]: Use exernal solver: true [2022-02-21 04:19:26,966 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 04:19:26,966 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2022-02-21 04:19:26,966 INFO L132 ssoRankerPreferences]: Path of dumped script: [2022-02-21 04:19:26,966 INFO L133 ssoRankerPreferences]: Filename of dumped script: Primes.c_Iteration4_Loop [2022-02-21 04:19:26,966 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2022-02-21 04:19:26,966 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2022-02-21 04:19:26,968 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 04:19:26,971 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 04:19:26,973 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 04:19:26,974 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 04:19:26,976 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 04:19:26,979 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 04:19:27,027 INFO L294 LassoAnalysis]: Preprocessing complete. [2022-02-21 04:19:27,027 INFO L404 LassoAnalysis]: Checking for nontermination... [2022-02-21 04:19:27,027 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 04:19:27,027 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 04:19:27,028 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 04:19:27,030 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 04:19:27,031 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2022-02-21 04:19:27,031 INFO L160 nArgumentSynthesizer]: Using integer mode. [2022-02-21 04:19:27,053 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2022-02-21 04:19:27,053 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {multiple_of_~n=2, multiple_of_#in~n=2} Honda state: {multiple_of_~n=2, multiple_of_#in~n=2} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2022-02-21 04:19:27,072 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 04:19:27,072 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 04:19:27,072 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 04:19:27,073 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 04:19:27,075 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 04:19:27,076 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2022-02-21 04:19:27,076 INFO L160 nArgumentSynthesizer]: Using integer mode. [2022-02-21 04:19:27,099 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2022-02-21 04:19:27,100 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {multiple_of_#t~ret6=0} Honda state: {multiple_of_#t~ret6=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2022-02-21 04:19:27,122 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 04:19:27,122 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 04:19:27,122 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 04:19:27,123 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 04:19:27,127 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 04:19:27,128 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2022-02-21 04:19:27,128 INFO L160 nArgumentSynthesizer]: Using integer mode. [2022-02-21 04:19:27,134 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2022-02-21 04:19:27,135 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {multiple_of_#t~ret8=0} Honda state: {multiple_of_#t~ret8=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2022-02-21 04:19:27,152 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 04:19:27,152 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 04:19:27,152 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 04:19:27,153 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 04:19:27,154 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 04:19:27,155 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2022-02-21 04:19:27,155 INFO L160 nArgumentSynthesizer]: Using integer mode. [2022-02-21 04:19:27,172 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2022-02-21 04:19:27,172 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {multiple_of_#t~ret7=0} Honda state: {multiple_of_#t~ret7=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2022-02-21 04:19:27,196 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 04:19:27,196 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 04:19:27,196 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 04:19:27,197 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 04:19:27,198 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 04:19:27,201 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2022-02-21 04:19:27,201 INFO L160 nArgumentSynthesizer]: Using integer mode. [2022-02-21 04:19:27,235 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 04:19:27,236 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 04:19:27,236 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 04:19:27,237 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 04:19:27,238 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 04:19:27,240 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2022-02-21 04:19:27,240 INFO L160 nArgumentSynthesizer]: Using integer mode. [2022-02-21 04:19:28,776 INFO L444 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2022-02-21 04:19:28,780 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (20)] Forceful destruction successful, exit code 0 [2022-02-21 04:19:28,781 INFO L210 LassoAnalysis]: Preferences: [2022-02-21 04:19:28,781 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2022-02-21 04:19:28,781 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2022-02-21 04:19:28,781 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2022-02-21 04:19:28,781 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2022-02-21 04:19:28,781 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 04:19:28,781 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2022-02-21 04:19:28,781 INFO L132 ssoRankerPreferences]: Path of dumped script: [2022-02-21 04:19:28,781 INFO L133 ssoRankerPreferences]: Filename of dumped script: Primes.c_Iteration4_Loop [2022-02-21 04:19:28,781 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2022-02-21 04:19:28,781 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2022-02-21 04:19:28,782 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 04:19:28,788 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 04:19:28,790 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 04:19:28,792 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 04:19:28,793 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 04:19:28,795 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 04:19:28,851 INFO L294 LassoAnalysis]: Preprocessing complete. [2022-02-21 04:19:28,851 INFO L490 LassoAnalysis]: Using template 'affine'. [2022-02-21 04:19:28,852 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 04:19:28,852 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 04:19:28,853 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 04:19:28,855 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 04:19:28,856 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 04:19:28,867 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 04:19:28,867 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 04:19:28,867 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 04:19:28,867 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 04:19:28,867 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 04:19:28,868 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-02-21 04:19:28,868 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 04:19:28,869 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 04:19:28,888 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (21)] Forceful destruction successful, exit code 0 [2022-02-21 04:19:28,889 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 04:19:28,889 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 04:19:28,890 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 04:19:28,890 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 04:19:28,892 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 04:19:28,898 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 04:19:28,898 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 04:19:28,898 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 04:19:28,898 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 04:19:28,898 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 04:19:28,899 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-02-21 04:19:28,899 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 04:19:28,913 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 04:19:28,928 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (22)] Ended with exit code 0 [2022-02-21 04:19:28,928 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 04:19:28,928 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 04:19:28,929 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 04:19:28,930 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 04:19:28,931 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 04:19:28,937 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 04:19:28,937 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 04:19:28,937 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 04:19:28,937 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 04:19:28,937 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 04:19:28,937 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-02-21 04:19:28,937 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 04:19:28,946 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 04:19:28,963 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 04:19:28,963 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 04:19:28,964 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 04:19:28,964 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 04:19:28,971 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 04:19:28,972 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 04:19:28,977 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 04:19:28,977 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 04:19:28,978 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 04:19:28,978 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 04:19:28,978 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 04:19:28,979 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-02-21 04:19:28,979 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 04:19:28,991 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 04:19:29,008 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 04:19:29,009 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 04:19:29,009 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 04:19:29,010 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 04:19:29,010 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 04:19:29,012 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 04:19:29,017 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 04:19:29,018 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 04:19:29,018 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 04:19:29,018 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 04:19:29,018 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 04:19:29,018 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-02-21 04:19:29,018 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 04:19:29,019 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 04:19:29,034 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 04:19:29,034 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 04:19:29,035 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 04:19:29,036 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 04:19:29,037 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 04:19:29,038 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 04:19:29,044 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 04:19:29,044 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 04:19:29,044 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 04:19:29,044 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 04:19:29,044 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 04:19:29,047 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-02-21 04:19:29,047 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 04:19:29,063 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2022-02-21 04:19:29,072 INFO L443 ModelExtractionUtils]: Simplification made 2 calls to the SMT solver. [2022-02-21 04:19:29,072 INFO L444 ModelExtractionUtils]: 2 out of 4 variables were initially zero. Simplification set additionally 0 variables to zero. [2022-02-21 04:19:29,072 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 04:19:29,073 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 04:19:29,073 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 04:19:29,074 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 04:19:29,075 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2022-02-21 04:19:29,075 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2022-02-21 04:19:29,075 INFO L513 LassoAnalysis]: Proved termination. [2022-02-21 04:19:29,075 INFO L515 LassoAnalysis]: Termination argument consisting of: Ranking function f(multiple_of_~m) = 1*multiple_of_~m Supporting invariants [] [2022-02-21 04:19:29,091 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (26)] Forceful destruction successful, exit code 0 [2022-02-21 04:19:29,095 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2022-02-21 04:19:29,098 INFO L390 LassoCheck]: Loop: "call #t~ret6 := multiple_of(~n, -~m);"< "~n := #in~n;~m := #in~m;" "assume ~m < 0;" [2022-02-21 04:19:29,101 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 04:19:29,109 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 04:19:29,145 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 04:19:29,146 INFO L263 TraceCheckSpWp]: Trace formula consists of 113 conjuncts, 6 conjunts are in the unsatisfiable core [2022-02-21 04:19:29,152 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 04:19:29,152 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-21 04:19:29,180 INFO L290 TraceCheckUtils]: 0: Hoare triple {4189#unseeded} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(9, 2);call #Ultimate.allocInit(12, 3); {4189#unseeded} is VALID [2022-02-21 04:19:29,180 INFO L290 TraceCheckUtils]: 1: Hoare triple {4189#unseeded} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet12#1, main_#t~ret13#1, main_#t~nondet14#1, main_#t~nondet15#1, main_#t~ret16#1, main_#t~short17#1, main_~n~0#1, main_~result~0#1, main_~f1~0#1, main_~f2~0#1;main_~n~0#1 := main_#t~nondet12#1;havoc main_#t~nondet12#1; {4189#unseeded} is VALID [2022-02-21 04:19:29,181 INFO L290 TraceCheckUtils]: 2: Hoare triple {4189#unseeded} assume !(main_~n~0#1 < 1 || main_~n~0#1 > 46340);assume { :begin_inline_is_prime } true;is_prime_#in~n#1 := main_~n~0#1;havoc is_prime_#res#1;havoc is_prime_#t~ret9#1, is_prime_~n#1;is_prime_~n#1 := is_prime_#in~n#1; {4189#unseeded} is VALID [2022-02-21 04:19:29,181 INFO L272 TraceCheckUtils]: 3: Hoare triple {4189#unseeded} call is_prime_#t~ret9#1 := is_prime_(is_prime_~n#1, is_prime_~n#1 - 1); {4189#unseeded} is VALID [2022-02-21 04:19:29,182 INFO L290 TraceCheckUtils]: 4: Hoare triple {4189#unseeded} ~n := #in~n;~m := #in~m; {4189#unseeded} is VALID [2022-02-21 04:19:29,182 INFO L290 TraceCheckUtils]: 5: Hoare triple {4189#unseeded} assume !(~n <= 1); {4189#unseeded} is VALID [2022-02-21 04:19:29,182 INFO L290 TraceCheckUtils]: 6: Hoare triple {4189#unseeded} assume !(2 == ~n); {4189#unseeded} is VALID [2022-02-21 04:19:29,183 INFO L290 TraceCheckUtils]: 7: Hoare triple {4189#unseeded} assume ~n > 2; {4189#unseeded} is VALID [2022-02-21 04:19:29,183 INFO L290 TraceCheckUtils]: 8: Hoare triple {4189#unseeded} assume !(~m <= 1); {4189#unseeded} is VALID [2022-02-21 04:19:29,184 INFO L272 TraceCheckUtils]: 9: Hoare triple {4189#unseeded} call #t~ret10 := multiple_of(~n, ~m); {4189#unseeded} is VALID [2022-02-21 04:19:29,184 INFO L290 TraceCheckUtils]: 10: Hoare triple {4189#unseeded} ~n := #in~n;~m := #in~m; {4189#unseeded} is VALID [2022-02-21 04:19:29,188 INFO L290 TraceCheckUtils]: 11: Hoare triple {4189#unseeded} assume ~m < 0; {4189#unseeded} is VALID [2022-02-21 04:19:29,195 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 04:19:29,195 INFO L263 TraceCheckSpWp]: Trace formula consists of 41 conjuncts, 7 conjunts are in the unsatisfiable core [2022-02-21 04:19:29,201 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 04:19:29,202 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-21 04:19:29,251 INFO L272 TraceCheckUtils]: 0: Hoare triple {4192#(>= oldRank0 multiple_of_~m)} call #t~ret6 := multiple_of(~n, -~m); {4240#(<= 0 (+ |multiple_of_#in~m| oldRank0))} is VALID [2022-02-21 04:19:29,252 INFO L290 TraceCheckUtils]: 1: Hoare triple {4240#(<= 0 (+ |multiple_of_#in~m| oldRank0))} ~n := #in~n;~m := #in~m; {4244#(<= 0 (+ oldRank0 multiple_of_~m))} is VALID [2022-02-21 04:19:29,252 INFO L290 TraceCheckUtils]: 2: Hoare triple {4244#(<= 0 (+ oldRank0 multiple_of_~m))} assume ~m < 0; {4202#(or (and (>= oldRank0 0) (> oldRank0 multiple_of_~m)) unseeded)} is VALID [2022-02-21 04:19:29,252 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 04:19:29,253 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 4 states, 3 states have (on average 4.0) internal successors, (12), 3 states have internal predecessors, (12), 2 states have call successors, (3), 2 states have call predecessors, (3), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 04:19:29,260 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 15 edges. 15 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-21 04:19:29,260 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 4 states, 3 states have (on average 4.0) internal successors, (12), 3 states have internal predecessors, (12), 2 states have call successors, (3), 2 states have call predecessors, (3), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 12 letters. Loop has 3 letters. [2022-02-21 04:19:29,260 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:29,260 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 04:19:29,261 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 93 states and 126 transitions. cyclomatic complexity: 36 Second operand has 4 states, 3 states have (on average 4.0) internal successors, (12), 3 states have internal predecessors, (12), 2 states have call successors, (3), 2 states have call predecessors, (3), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 04:19:29,415 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 93 states and 126 transitions. cyclomatic complexity: 36. Second operand has 4 states, 3 states have (on average 4.0) internal successors, (12), 3 states have internal predecessors, (12), 2 states have call successors, (3), 2 states have call predecessors, (3), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Result 191 states and 253 transitions. Complement of second has 18 states. [2022-02-21 04:19:29,415 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 5 states 1 stem states 3 non-accepting loop states 1 accepting loop states [2022-02-21 04:19:29,415 INFO L123 tractBuchiDifference]: Start testing correctness of buchiDifferenceNCSBLazy3 [2022-02-21 04:19:29,415 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 93 states and 126 transitions. cyclomatic complexity: 36 [2022-02-21 04:19:29,415 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 04:19:29,416 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 04:19:29,416 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 4 states, 3 states have (on average 4.0) internal successors, (12), 3 states have internal predecessors, (12), 2 states have call successors, (3), 2 states have call predecessors, (3), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 04:19:29,418 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2022-02-21 04:19:29,419 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 04:19:29,419 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 04:19:29,419 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 191 states and 253 transitions. [2022-02-21 04:19:29,421 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 42 [2022-02-21 04:19:29,421 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 04:19:29,421 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 04:19:29,421 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 93 states and 126 transitions. cyclomatic complexity: 36 [2022-02-21 04:19:29,427 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 30 examples of accepted words. [2022-02-21 04:19:29,428 INFO L70 LassoExtractor]: Start lassoExtractor. Operand has 4 states, 3 states have (on average 4.0) internal successors, (12), 3 states have internal predecessors, (12), 2 states have call successors, (3), 2 states have call predecessors, (3), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 04:19:29,429 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2022-02-21 04:19:29,429 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 1 examples of accepted words. [2022-02-21 04:19:29,429 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 191 states and 253 transitions. cyclomatic complexity: 67 [2022-02-21 04:19:29,434 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 43 examples of accepted words. [2022-02-21 04:19:29,435 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 93 states and 126 transitions. cyclomatic complexity: 36 Stem has 12 letters. Loop has 3 letters. [2022-02-21 04:19:29,435 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:29,435 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 4 states, 3 states have (on average 4.0) internal successors, (12), 3 states have internal predecessors, (12), 2 states have call successors, (3), 2 states have call predecessors, (3), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 12 letters. Loop has 3 letters. [2022-02-21 04:19:29,435 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:29,435 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 191 states and 253 transitions. cyclomatic complexity: 67 Stem has 12 letters. Loop has 3 letters. [2022-02-21 04:19:29,435 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:29,435 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 93 states and 126 transitions. cyclomatic complexity: 36 Stem has 1 letters. Loop has 3 letters. [2022-02-21 04:19:29,435 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:29,435 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 4 states, 3 states have (on average 4.0) internal successors, (12), 3 states have internal predecessors, (12), 2 states have call successors, (3), 2 states have call predecessors, (3), 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 04:19:29,436 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:29,436 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 191 states and 253 transitions. cyclomatic complexity: 67 Stem has 1 letters. Loop has 3 letters. [2022-02-21 04:19:29,436 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:29,436 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 93 states and 126 transitions. cyclomatic complexity: 36 Stem has 14 letters. Loop has 3 letters. [2022-02-21 04:19:29,436 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:29,436 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 4 states, 3 states have (on average 4.0) internal successors, (12), 3 states have internal predecessors, (12), 2 states have call successors, (3), 2 states have call predecessors, (3), 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 04:19:29,436 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:29,436 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 191 states and 253 transitions. cyclomatic complexity: 67 Stem has 14 letters. Loop has 3 letters. [2022-02-21 04:19:29,436 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:29,437 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 93 states and 126 transitions. cyclomatic complexity: 36 Stem has 191 letters. Loop has 191 letters. [2022-02-21 04:19:29,437 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:29,437 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 4 states, 3 states have (on average 4.0) internal successors, (12), 3 states have internal predecessors, (12), 2 states have call successors, (3), 2 states have call predecessors, (3), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 191 letters. Loop has 191 letters. [2022-02-21 04:19:29,437 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:29,437 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 191 states and 253 transitions. cyclomatic complexity: 67 Stem has 191 letters. Loop has 191 letters. [2022-02-21 04:19:29,437 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:29,437 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 93 states and 126 transitions. cyclomatic complexity: 36 Stem has 93 letters. Loop has 93 letters. [2022-02-21 04:19:29,437 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:29,437 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 4 states, 3 states have (on average 4.0) internal successors, (12), 3 states have internal predecessors, (12), 2 states have call successors, (3), 2 states have call predecessors, (3), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 93 letters. Loop has 93 letters. [2022-02-21 04:19:29,437 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:29,437 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 191 states and 253 transitions. cyclomatic complexity: 67 Stem has 93 letters. Loop has 93 letters. [2022-02-21 04:19:29,438 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:29,438 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 93 states and 126 transitions. cyclomatic complexity: 36 Stem has 5 letters. Loop has 5 letters. [2022-02-21 04:19:29,438 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:29,438 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 4 states, 3 states have (on average 4.0) internal successors, (12), 3 states have internal predecessors, (12), 2 states have call successors, (3), 2 states have call predecessors, (3), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 5 letters. Loop has 5 letters. [2022-02-21 04:19:29,438 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:29,438 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 191 states and 253 transitions. cyclomatic complexity: 67 Stem has 5 letters. Loop has 5 letters. [2022-02-21 04:19:29,438 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:29,438 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 93 states and 126 transitions. cyclomatic complexity: 36 Stem has 17 letters. Loop has 4 letters. [2022-02-21 04:19:29,438 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:29,438 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 4 states, 3 states have (on average 4.0) internal successors, (12), 3 states have internal predecessors, (12), 2 states have call successors, (3), 2 states have call predecessors, (3), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 17 letters. Loop has 4 letters. [2022-02-21 04:19:29,439 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:29,439 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 191 states and 253 transitions. cyclomatic complexity: 67 Stem has 17 letters. Loop has 4 letters. [2022-02-21 04:19:29,439 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:29,439 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 93 states and 126 transitions. cyclomatic complexity: 36 Stem has 16 letters. Loop has 7 letters. [2022-02-21 04:19:29,439 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:29,439 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 4 states, 3 states have (on average 4.0) internal successors, (12), 3 states have internal predecessors, (12), 2 states have call successors, (3), 2 states have call predecessors, (3), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 16 letters. Loop has 7 letters. [2022-02-21 04:19:29,439 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:29,439 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 191 states and 253 transitions. cyclomatic complexity: 67 Stem has 16 letters. Loop has 7 letters. [2022-02-21 04:19:29,439 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:29,439 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 93 states and 126 transitions. cyclomatic complexity: 36 Stem has 17 letters. Loop has 10 letters. [2022-02-21 04:19:29,440 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:29,440 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 4 states, 3 states have (on average 4.0) internal successors, (12), 3 states have internal predecessors, (12), 2 states have call successors, (3), 2 states have call predecessors, (3), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 17 letters. Loop has 10 letters. [2022-02-21 04:19:29,440 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:29,440 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 191 states and 253 transitions. cyclomatic complexity: 67 Stem has 17 letters. Loop has 10 letters. [2022-02-21 04:19:29,440 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:29,440 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 93 states and 126 transitions. cyclomatic complexity: 36 Stem has 18 letters. Loop has 10 letters. [2022-02-21 04:19:29,440 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:29,440 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 4 states, 3 states have (on average 4.0) internal successors, (12), 3 states have internal predecessors, (12), 2 states have call successors, (3), 2 states have call predecessors, (3), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 18 letters. Loop has 10 letters. [2022-02-21 04:19:29,440 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:29,440 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 191 states and 253 transitions. cyclomatic complexity: 67 Stem has 18 letters. Loop has 10 letters. [2022-02-21 04:19:29,441 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:29,441 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 93 states and 126 transitions. cyclomatic complexity: 36 Stem has 14 letters. Loop has 4 letters. [2022-02-21 04:19:29,441 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:29,441 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 4 states, 3 states have (on average 4.0) internal successors, (12), 3 states have internal predecessors, (12), 2 states have call successors, (3), 2 states have call predecessors, (3), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 14 letters. Loop has 4 letters. [2022-02-21 04:19:29,441 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:29,441 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 191 states and 253 transitions. cyclomatic complexity: 67 Stem has 14 letters. Loop has 4 letters. [2022-02-21 04:19:29,441 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:29,441 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 93 states and 126 transitions. cyclomatic complexity: 36 Stem has 15 letters. Loop has 4 letters. [2022-02-21 04:19:29,441 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:29,441 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 4 states, 3 states have (on average 4.0) internal successors, (12), 3 states have internal predecessors, (12), 2 states have call successors, (3), 2 states have call predecessors, (3), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 15 letters. Loop has 4 letters. [2022-02-21 04:19:29,442 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:29,442 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 191 states and 253 transitions. cyclomatic complexity: 67 Stem has 15 letters. Loop has 4 letters. [2022-02-21 04:19:29,442 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:29,442 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 93 states and 126 transitions. cyclomatic complexity: 36 Stem has 12 letters. Loop has 3 letters. [2022-02-21 04:19:29,442 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:29,442 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 4 states, 3 states have (on average 4.0) internal successors, (12), 3 states have internal predecessors, (12), 2 states have call successors, (3), 2 states have call predecessors, (3), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 12 letters. Loop has 3 letters. [2022-02-21 04:19:29,442 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:29,442 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 191 states and 253 transitions. cyclomatic complexity: 67 Stem has 12 letters. Loop has 3 letters. [2022-02-21 04:19:29,442 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:29,442 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 93 states and 126 transitions. cyclomatic complexity: 36 Stem has 16 letters. Loop has 4 letters. [2022-02-21 04:19:29,443 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:29,443 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 4 states, 3 states have (on average 4.0) internal successors, (12), 3 states have internal predecessors, (12), 2 states have call successors, (3), 2 states have call predecessors, (3), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 16 letters. Loop has 4 letters. [2022-02-21 04:19:29,443 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:29,443 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 191 states and 253 transitions. cyclomatic complexity: 67 Stem has 16 letters. Loop has 4 letters. [2022-02-21 04:19:29,443 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:29,443 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 93 states and 126 transitions. cyclomatic complexity: 36 Stem has 18 letters. Loop has 6 letters. [2022-02-21 04:19:29,443 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:29,443 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 4 states, 3 states have (on average 4.0) internal successors, (12), 3 states have internal predecessors, (12), 2 states have call successors, (3), 2 states have call predecessors, (3), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 18 letters. Loop has 6 letters. [2022-02-21 04:19:29,443 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:29,443 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 191 states and 253 transitions. cyclomatic complexity: 67 Stem has 18 letters. Loop has 6 letters. [2022-02-21 04:19:29,444 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:29,444 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 93 states and 126 transitions. cyclomatic complexity: 36 Stem has 14 letters. Loop has 3 letters. [2022-02-21 04:19:29,444 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:29,444 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 4 states, 3 states have (on average 4.0) internal successors, (12), 3 states have internal predecessors, (12), 2 states have call successors, (3), 2 states have call predecessors, (3), 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 04:19:29,444 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:29,444 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 191 states and 253 transitions. cyclomatic complexity: 67 Stem has 14 letters. Loop has 3 letters. [2022-02-21 04:19:29,444 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:29,444 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 93 states and 126 transitions. cyclomatic complexity: 36 Stem has 17 letters. Loop has 6 letters. [2022-02-21 04:19:29,445 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:29,445 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 4 states, 3 states have (on average 4.0) internal successors, (12), 3 states have internal predecessors, (12), 2 states have call successors, (3), 2 states have call predecessors, (3), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 17 letters. Loop has 6 letters. [2022-02-21 04:19:29,445 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:29,445 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 191 states and 253 transitions. cyclomatic complexity: 67 Stem has 17 letters. Loop has 6 letters. [2022-02-21 04:19:29,445 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:29,445 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 93 states and 126 transitions. cyclomatic complexity: 36 Stem has 15 letters. Loop has 6 letters. [2022-02-21 04:19:29,445 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:29,445 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 4 states, 3 states have (on average 4.0) internal successors, (12), 3 states have internal predecessors, (12), 2 states have call successors, (3), 2 states have call predecessors, (3), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 15 letters. Loop has 6 letters. [2022-02-21 04:19:29,445 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:29,446 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 191 states and 253 transitions. cyclomatic complexity: 67 Stem has 15 letters. Loop has 6 letters. [2022-02-21 04:19:29,446 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:29,446 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 93 states and 126 transitions. cyclomatic complexity: 36 Stem has 19 letters. Loop has 10 letters. [2022-02-21 04:19:29,446 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:29,446 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 4 states, 3 states have (on average 4.0) internal successors, (12), 3 states have internal predecessors, (12), 2 states have call successors, (3), 2 states have call predecessors, (3), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 19 letters. Loop has 10 letters. [2022-02-21 04:19:29,446 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:29,446 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 191 states and 253 transitions. cyclomatic complexity: 67 Stem has 19 letters. Loop has 10 letters. [2022-02-21 04:19:29,446 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:29,446 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 93 states and 126 transitions. cyclomatic complexity: 36 Stem has 16 letters. Loop has 6 letters. [2022-02-21 04:19:29,446 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:29,447 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 4 states, 3 states have (on average 4.0) internal successors, (12), 3 states have internal predecessors, (12), 2 states have call successors, (3), 2 states have call predecessors, (3), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 16 letters. Loop has 6 letters. [2022-02-21 04:19:29,447 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:29,447 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 191 states and 253 transitions. cyclomatic complexity: 67 Stem has 16 letters. Loop has 6 letters. [2022-02-21 04:19:29,447 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:29,448 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 93 states and 126 transitions. cyclomatic complexity: 36 Stem has 13 letters. Loop has 3 letters. [2022-02-21 04:19:29,448 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:29,448 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 4 states, 3 states have (on average 4.0) internal successors, (12), 3 states have internal predecessors, (12), 2 states have call successors, (3), 2 states have call predecessors, (3), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 13 letters. Loop has 3 letters. [2022-02-21 04:19:29,448 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:29,448 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 191 states and 253 transitions. cyclomatic complexity: 67 Stem has 13 letters. Loop has 3 letters. [2022-02-21 04:19:29,449 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:29,449 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 93 states and 126 transitions. cyclomatic complexity: 36 Stem has 101 letters. Loop has 33 letters. [2022-02-21 04:19:29,449 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:29,449 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 4 states, 3 states have (on average 4.0) internal successors, (12), 3 states have internal predecessors, (12), 2 states have call successors, (3), 2 states have call predecessors, (3), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 101 letters. Loop has 33 letters. [2022-02-21 04:19:29,451 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:29,452 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 191 states and 253 transitions. cyclomatic complexity: 67 Stem has 101 letters. Loop has 33 letters. [2022-02-21 04:19:29,452 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:29,452 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 93 states and 126 transitions. cyclomatic complexity: 36 Stem has 74 letters. Loop has 33 letters. [2022-02-21 04:19:29,452 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:29,453 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 4 states, 3 states have (on average 4.0) internal successors, (12), 3 states have internal predecessors, (12), 2 states have call successors, (3), 2 states have call predecessors, (3), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 74 letters. Loop has 33 letters. [2022-02-21 04:19:29,454 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:29,454 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 191 states and 253 transitions. cyclomatic complexity: 67 Stem has 74 letters. Loop has 33 letters. [2022-02-21 04:19:29,454 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:29,454 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 93 states and 126 transitions. cyclomatic complexity: 36 Stem has 70 letters. Loop has 33 letters. [2022-02-21 04:19:29,454 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:29,454 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 4 states, 3 states have (on average 4.0) internal successors, (12), 3 states have internal predecessors, (12), 2 states have call successors, (3), 2 states have call predecessors, (3), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 70 letters. Loop has 33 letters. [2022-02-21 04:19:29,455 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:29,455 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 191 states and 253 transitions. cyclomatic complexity: 67 Stem has 70 letters. Loop has 33 letters. [2022-02-21 04:19:29,455 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:29,455 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 93 states and 126 transitions. cyclomatic complexity: 36 Stem has 75 letters. Loop has 33 letters. [2022-02-21 04:19:29,455 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:29,455 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 4 states, 3 states have (on average 4.0) internal successors, (12), 3 states have internal predecessors, (12), 2 states have call successors, (3), 2 states have call predecessors, (3), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 75 letters. Loop has 33 letters. [2022-02-21 04:19:29,455 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:29,456 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 191 states and 253 transitions. cyclomatic complexity: 67 Stem has 75 letters. Loop has 33 letters. [2022-02-21 04:19:29,456 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:29,456 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 93 states and 126 transitions. cyclomatic complexity: 36 Stem has 71 letters. Loop has 33 letters. [2022-02-21 04:19:29,456 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:29,456 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 4 states, 3 states have (on average 4.0) internal successors, (12), 3 states have internal predecessors, (12), 2 states have call successors, (3), 2 states have call predecessors, (3), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 71 letters. Loop has 33 letters. [2022-02-21 04:19:29,456 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:29,456 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 191 states and 253 transitions. cyclomatic complexity: 67 Stem has 71 letters. Loop has 33 letters. [2022-02-21 04:19:29,457 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:29,457 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 93 states and 126 transitions. cyclomatic complexity: 36 Stem has 102 letters. Loop has 33 letters. [2022-02-21 04:19:29,457 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:29,457 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 4 states, 3 states have (on average 4.0) internal successors, (12), 3 states have internal predecessors, (12), 2 states have call successors, (3), 2 states have call predecessors, (3), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 102 letters. Loop has 33 letters. [2022-02-21 04:19:29,457 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:29,457 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 191 states and 253 transitions. cyclomatic complexity: 67 Stem has 102 letters. Loop has 33 letters. [2022-02-21 04:19:29,457 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:29,457 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 93 states and 126 transitions. cyclomatic complexity: 36 Stem has 72 letters. Loop has 33 letters. [2022-02-21 04:19:29,458 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:29,458 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 4 states, 3 states have (on average 4.0) internal successors, (12), 3 states have internal predecessors, (12), 2 states have call successors, (3), 2 states have call predecessors, (3), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 72 letters. Loop has 33 letters. [2022-02-21 04:19:29,458 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:29,458 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 191 states and 253 transitions. cyclomatic complexity: 67 Stem has 72 letters. Loop has 33 letters. [2022-02-21 04:19:29,458 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:29,458 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 93 states and 126 transitions. cyclomatic complexity: 36 Stem has 73 letters. Loop has 33 letters. [2022-02-21 04:19:29,459 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:29,459 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 4 states, 3 states have (on average 4.0) internal successors, (12), 3 states have internal predecessors, (12), 2 states have call successors, (3), 2 states have call predecessors, (3), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 73 letters. Loop has 33 letters. [2022-02-21 04:19:29,459 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:29,459 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 191 states and 253 transitions. cyclomatic complexity: 67 Stem has 73 letters. Loop has 33 letters. [2022-02-21 04:19:29,459 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:29,459 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 93 states and 126 transitions. cyclomatic complexity: 36 Stem has 101 letters. Loop has 33 letters. [2022-02-21 04:19:29,460 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:29,460 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 4 states, 3 states have (on average 4.0) internal successors, (12), 3 states have internal predecessors, (12), 2 states have call successors, (3), 2 states have call predecessors, (3), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 101 letters. Loop has 33 letters. [2022-02-21 04:19:29,460 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:29,460 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 191 states and 253 transitions. cyclomatic complexity: 67 Stem has 101 letters. Loop has 33 letters. [2022-02-21 04:19:29,460 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:29,460 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 93 states and 126 transitions. cyclomatic complexity: 36 Stem has 16 letters. Loop has 5 letters. [2022-02-21 04:19:29,461 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:29,461 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 4 states, 3 states have (on average 4.0) internal successors, (12), 3 states have internal predecessors, (12), 2 states have call successors, (3), 2 states have call predecessors, (3), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 16 letters. Loop has 5 letters. [2022-02-21 04:19:29,461 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:29,461 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 191 states and 253 transitions. cyclomatic complexity: 67 Stem has 16 letters. Loop has 5 letters. [2022-02-21 04:19:29,462 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:29,462 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 93 states and 126 transitions. cyclomatic complexity: 36 Stem has 17 letters. Loop has 5 letters. [2022-02-21 04:19:29,462 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:29,462 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 4 states, 3 states have (on average 4.0) internal successors, (12), 3 states have internal predecessors, (12), 2 states have call successors, (3), 2 states have call predecessors, (3), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 17 letters. Loop has 5 letters. [2022-02-21 04:19:29,462 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:29,462 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 191 states and 253 transitions. cyclomatic complexity: 67 Stem has 17 letters. Loop has 5 letters. [2022-02-21 04:19:29,462 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:29,462 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 93 states and 126 transitions. cyclomatic complexity: 36 Stem has 18 letters. Loop has 5 letters. [2022-02-21 04:19:29,462 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:29,463 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 4 states, 3 states have (on average 4.0) internal successors, (12), 3 states have internal predecessors, (12), 2 states have call successors, (3), 2 states have call predecessors, (3), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 18 letters. Loop has 5 letters. [2022-02-21 04:19:29,463 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:29,463 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 191 states and 253 transitions. cyclomatic complexity: 67 Stem has 18 letters. Loop has 5 letters. [2022-02-21 04:19:29,463 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:29,463 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 93 states and 126 transitions. cyclomatic complexity: 36 Stem has 16 letters. Loop has 3 letters. [2022-02-21 04:19:29,463 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:29,463 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 4 states, 3 states have (on average 4.0) internal successors, (12), 3 states have internal predecessors, (12), 2 states have call successors, (3), 2 states have call predecessors, (3), 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 04:19:29,465 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:29,465 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 191 states and 253 transitions. cyclomatic complexity: 67 Stem has 16 letters. Loop has 3 letters. [2022-02-21 04:19:29,466 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:29,466 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 93 states and 126 transitions. cyclomatic complexity: 36 Stem has 14 letters. Loop has 3 letters. [2022-02-21 04:19:29,466 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:29,466 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 4 states, 3 states have (on average 4.0) internal successors, (12), 3 states have internal predecessors, (12), 2 states have call successors, (3), 2 states have call predecessors, (3), 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 04:19:29,466 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:29,466 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 191 states and 253 transitions. cyclomatic complexity: 67 Stem has 14 letters. Loop has 3 letters. [2022-02-21 04:19:29,466 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:29,466 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 93 states and 126 transitions. cyclomatic complexity: 36 Stem has 15 letters. Loop has 3 letters. [2022-02-21 04:19:29,466 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:29,466 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 4 states, 3 states have (on average 4.0) internal successors, (12), 3 states have internal predecessors, (12), 2 states have call successors, (3), 2 states have call predecessors, (3), 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 04:19:29,467 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:29,467 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 191 states and 253 transitions. cyclomatic complexity: 67 Stem has 15 letters. Loop has 3 letters. [2022-02-21 04:19:29,467 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:29,467 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 93 states and 126 transitions. cyclomatic complexity: 36 Stem has 1 letters. Loop has 3 letters. [2022-02-21 04:19:29,467 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:29,467 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 4 states, 3 states have (on average 4.0) internal successors, (12), 3 states have internal predecessors, (12), 2 states have call successors, (3), 2 states have call predecessors, (3), 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 04:19:29,467 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:29,467 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 191 states and 253 transitions. cyclomatic complexity: 67 Stem has 1 letters. Loop has 3 letters. [2022-02-21 04:19:29,467 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:29,467 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 93 states and 126 transitions. cyclomatic complexity: 36 Stem has 18 letters. Loop has 4 letters. [2022-02-21 04:19:29,468 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:29,468 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 4 states, 3 states have (on average 4.0) internal successors, (12), 3 states have internal predecessors, (12), 2 states have call successors, (3), 2 states have call predecessors, (3), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 18 letters. Loop has 4 letters. [2022-02-21 04:19:29,468 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:29,468 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 191 states and 253 transitions. cyclomatic complexity: 67 Stem has 18 letters. Loop has 4 letters. [2022-02-21 04:19:29,468 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:29,468 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 93 states and 126 transitions. cyclomatic complexity: 36 Stem has 22 letters. Loop has 10 letters. [2022-02-21 04:19:29,468 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:29,468 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 4 states, 3 states have (on average 4.0) internal successors, (12), 3 states have internal predecessors, (12), 2 states have call successors, (3), 2 states have call predecessors, (3), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 22 letters. Loop has 10 letters. [2022-02-21 04:19:29,468 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:29,468 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 191 states and 253 transitions. cyclomatic complexity: 67 Stem has 22 letters. Loop has 10 letters. [2022-02-21 04:19:29,469 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:29,469 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 93 states and 126 transitions. cyclomatic complexity: 36 Stem has 22 letters. Loop has 10 letters. [2022-02-21 04:19:29,469 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:29,469 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 4 states, 3 states have (on average 4.0) internal successors, (12), 3 states have internal predecessors, (12), 2 states have call successors, (3), 2 states have call predecessors, (3), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 22 letters. Loop has 10 letters. [2022-02-21 04:19:29,469 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:29,469 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 191 states and 253 transitions. cyclomatic complexity: 67 Stem has 22 letters. Loop has 10 letters. [2022-02-21 04:19:29,469 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:29,469 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 93 states and 126 transitions. cyclomatic complexity: 36 Stem has 22 letters. Loop has 6 letters. [2022-02-21 04:19:29,469 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:29,470 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 4 states, 3 states have (on average 4.0) internal successors, (12), 3 states have internal predecessors, (12), 2 states have call successors, (3), 2 states have call predecessors, (3), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 22 letters. Loop has 6 letters. [2022-02-21 04:19:29,470 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:29,470 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 191 states and 253 transitions. cyclomatic complexity: 67 Stem has 22 letters. Loop has 6 letters. [2022-02-21 04:19:29,470 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:29,470 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 93 states and 126 transitions. cyclomatic complexity: 36 Stem has 19 letters. Loop has 4 letters. [2022-02-21 04:19:29,470 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:29,470 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 4 states, 3 states have (on average 4.0) internal successors, (12), 3 states have internal predecessors, (12), 2 states have call successors, (3), 2 states have call predecessors, (3), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 19 letters. Loop has 4 letters. [2022-02-21 04:19:29,470 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:29,471 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 191 states and 253 transitions. cyclomatic complexity: 67 Stem has 19 letters. Loop has 4 letters. [2022-02-21 04:19:29,471 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:29,471 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 93 states and 126 transitions. cyclomatic complexity: 36 Stem has 23 letters. Loop has 6 letters. [2022-02-21 04:19:29,471 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:29,471 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 4 states, 3 states have (on average 4.0) internal successors, (12), 3 states have internal predecessors, (12), 2 states have call successors, (3), 2 states have call predecessors, (3), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 23 letters. Loop has 6 letters. [2022-02-21 04:19:29,471 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:29,471 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 191 states and 253 transitions. cyclomatic complexity: 67 Stem has 23 letters. Loop has 6 letters. [2022-02-21 04:19:29,471 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:29,471 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 93 states and 126 transitions. cyclomatic complexity: 36 Stem has 19 letters. Loop has 6 letters. [2022-02-21 04:19:29,471 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:29,472 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 4 states, 3 states have (on average 4.0) internal successors, (12), 3 states have internal predecessors, (12), 2 states have call successors, (3), 2 states have call predecessors, (3), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 19 letters. Loop has 6 letters. [2022-02-21 04:19:29,472 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:29,472 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 191 states and 253 transitions. cyclomatic complexity: 67 Stem has 19 letters. Loop has 6 letters. [2022-02-21 04:19:29,472 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:29,472 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 93 states and 126 transitions. cyclomatic complexity: 36 Stem has 20 letters. Loop has 4 letters. [2022-02-21 04:19:29,472 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:29,472 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 4 states, 3 states have (on average 4.0) internal successors, (12), 3 states have internal predecessors, (12), 2 states have call successors, (3), 2 states have call predecessors, (3), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 20 letters. Loop has 4 letters. [2022-02-21 04:19:29,472 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:29,472 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 191 states and 253 transitions. cyclomatic complexity: 67 Stem has 20 letters. Loop has 4 letters. [2022-02-21 04:19:29,473 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:29,473 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 93 states and 126 transitions. cyclomatic complexity: 36 Stem has 24 letters. Loop has 6 letters. [2022-02-21 04:19:29,473 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:29,473 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 4 states, 3 states have (on average 4.0) internal successors, (12), 3 states have internal predecessors, (12), 2 states have call successors, (3), 2 states have call predecessors, (3), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 24 letters. Loop has 6 letters. [2022-02-21 04:19:29,473 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:29,473 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 191 states and 253 transitions. cyclomatic complexity: 67 Stem has 24 letters. Loop has 6 letters. [2022-02-21 04:19:29,473 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:29,473 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 93 states and 126 transitions. cyclomatic complexity: 36 Stem has 20 letters. Loop has 10 letters. [2022-02-21 04:19:29,473 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:29,473 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 4 states, 3 states have (on average 4.0) internal successors, (12), 3 states have internal predecessors, (12), 2 states have call successors, (3), 2 states have call predecessors, (3), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 20 letters. Loop has 10 letters. [2022-02-21 04:19:29,474 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:29,474 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 191 states and 253 transitions. cyclomatic complexity: 67 Stem has 20 letters. Loop has 10 letters. [2022-02-21 04:19:29,474 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:29,474 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 93 states and 126 transitions. cyclomatic complexity: 36 Stem has 17 letters. Loop has 4 letters. [2022-02-21 04:19:29,474 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:29,474 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 4 states, 3 states have (on average 4.0) internal successors, (12), 3 states have internal predecessors, (12), 2 states have call successors, (3), 2 states have call predecessors, (3), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 17 letters. Loop has 4 letters. [2022-02-21 04:19:29,474 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:29,474 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 191 states and 253 transitions. cyclomatic complexity: 67 Stem has 17 letters. Loop has 4 letters. [2022-02-21 04:19:29,474 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:29,474 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 93 states and 126 transitions. cyclomatic complexity: 36 Stem has 20 letters. Loop has 6 letters. [2022-02-21 04:19:29,475 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:29,475 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 4 states, 3 states have (on average 4.0) internal successors, (12), 3 states have internal predecessors, (12), 2 states have call successors, (3), 2 states have call predecessors, (3), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 20 letters. Loop has 6 letters. [2022-02-21 04:19:29,475 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:29,475 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 191 states and 253 transitions. cyclomatic complexity: 67 Stem has 20 letters. Loop has 6 letters. [2022-02-21 04:19:29,475 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:29,475 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 93 states and 126 transitions. cyclomatic complexity: 36 Stem has 21 letters. Loop has 10 letters. [2022-02-21 04:19:29,475 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:29,475 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 4 states, 3 states have (on average 4.0) internal successors, (12), 3 states have internal predecessors, (12), 2 states have call successors, (3), 2 states have call predecessors, (3), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 21 letters. Loop has 10 letters. [2022-02-21 04:19:29,475 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:29,476 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 191 states and 253 transitions. cyclomatic complexity: 67 Stem has 21 letters. Loop has 10 letters. [2022-02-21 04:19:29,476 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:29,476 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 93 states and 126 transitions. cyclomatic complexity: 36 Stem has 21 letters. Loop has 6 letters. [2022-02-21 04:19:29,476 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:29,476 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 4 states, 3 states have (on average 4.0) internal successors, (12), 3 states have internal predecessors, (12), 2 states have call successors, (3), 2 states have call predecessors, (3), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 21 letters. Loop has 6 letters. [2022-02-21 04:19:29,476 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:29,476 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 191 states and 253 transitions. cyclomatic complexity: 67 Stem has 21 letters. Loop has 6 letters. [2022-02-21 04:19:29,476 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:29,476 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 93 states and 126 transitions. cyclomatic complexity: 36 Stem has 14 letters. Loop has 4 letters. [2022-02-21 04:19:29,477 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:29,477 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 4 states, 3 states have (on average 4.0) internal successors, (12), 3 states have internal predecessors, (12), 2 states have call successors, (3), 2 states have call predecessors, (3), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 14 letters. Loop has 4 letters. [2022-02-21 04:19:29,477 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:29,477 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 191 states and 253 transitions. cyclomatic complexity: 67 Stem has 14 letters. Loop has 4 letters. [2022-02-21 04:19:29,477 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:29,477 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 93 states and 126 transitions. cyclomatic complexity: 36 Stem has 18 letters. Loop has 10 letters. [2022-02-21 04:19:29,478 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:29,478 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 4 states, 3 states have (on average 4.0) internal successors, (12), 3 states have internal predecessors, (12), 2 states have call successors, (3), 2 states have call predecessors, (3), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 18 letters. Loop has 10 letters. [2022-02-21 04:19:29,478 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:29,478 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 191 states and 253 transitions. cyclomatic complexity: 67 Stem has 18 letters. Loop has 10 letters. [2022-02-21 04:19:29,478 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:29,478 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 93 states and 126 transitions. cyclomatic complexity: 36 Stem has 18 letters. Loop has 6 letters. [2022-02-21 04:19:29,478 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:29,479 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 4 states, 3 states have (on average 4.0) internal successors, (12), 3 states have internal predecessors, (12), 2 states have call successors, (3), 2 states have call predecessors, (3), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 18 letters. Loop has 6 letters. [2022-02-21 04:19:29,479 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:29,479 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 191 states and 253 transitions. cyclomatic complexity: 67 Stem has 18 letters. Loop has 6 letters. [2022-02-21 04:19:29,480 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:29,480 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 93 states and 126 transitions. cyclomatic complexity: 36 Stem has 15 letters. Loop has 4 letters. [2022-02-21 04:19:29,480 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:29,480 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 4 states, 3 states have (on average 4.0) internal successors, (12), 3 states have internal predecessors, (12), 2 states have call successors, (3), 2 states have call predecessors, (3), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 15 letters. Loop has 4 letters. [2022-02-21 04:19:29,480 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:29,480 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 191 states and 253 transitions. cyclomatic complexity: 67 Stem has 15 letters. Loop has 4 letters. [2022-02-21 04:19:29,480 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:29,480 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 93 states and 126 transitions. cyclomatic complexity: 36 Stem has 19 letters. Loop has 10 letters. [2022-02-21 04:19:29,480 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:29,481 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 4 states, 3 states have (on average 4.0) internal successors, (12), 3 states have internal predecessors, (12), 2 states have call successors, (3), 2 states have call predecessors, (3), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 19 letters. Loop has 10 letters. [2022-02-21 04:19:29,481 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:29,481 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 191 states and 253 transitions. cyclomatic complexity: 67 Stem has 19 letters. Loop has 10 letters. [2022-02-21 04:19:29,481 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:29,481 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 93 states and 126 transitions. cyclomatic complexity: 36 Stem has 16 letters. Loop has 4 letters. [2022-02-21 04:19:29,481 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:29,481 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 4 states, 3 states have (on average 4.0) internal successors, (12), 3 states have internal predecessors, (12), 2 states have call successors, (3), 2 states have call predecessors, (3), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 16 letters. Loop has 4 letters. [2022-02-21 04:19:29,481 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:29,481 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 191 states and 253 transitions. cyclomatic complexity: 67 Stem has 16 letters. Loop has 4 letters. [2022-02-21 04:19:29,481 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:29,482 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 93 states and 126 transitions. cyclomatic complexity: 36 Stem has 19 letters. Loop has 10 letters. [2022-02-21 04:19:29,482 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:29,482 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 4 states, 3 states have (on average 4.0) internal successors, (12), 3 states have internal predecessors, (12), 2 states have call successors, (3), 2 states have call predecessors, (3), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 19 letters. Loop has 10 letters. [2022-02-21 04:19:29,482 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:29,482 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 191 states and 253 transitions. cyclomatic complexity: 67 Stem has 19 letters. Loop has 10 letters. [2022-02-21 04:19:29,482 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:29,482 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 93 states and 126 transitions. cyclomatic complexity: 36 Stem has 16 letters. Loop has 6 letters. [2022-02-21 04:19:29,482 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:29,483 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 4 states, 3 states have (on average 4.0) internal successors, (12), 3 states have internal predecessors, (12), 2 states have call successors, (3), 2 states have call predecessors, (3), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 16 letters. Loop has 6 letters. [2022-02-21 04:19:29,483 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:29,483 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 191 states and 253 transitions. cyclomatic complexity: 67 Stem has 16 letters. Loop has 6 letters. [2022-02-21 04:19:29,483 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:29,483 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 93 states and 126 transitions. cyclomatic complexity: 36 Stem has 19 letters. Loop has 6 letters. [2022-02-21 04:19:29,483 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:29,483 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 4 states, 3 states have (on average 4.0) internal successors, (12), 3 states have internal predecessors, (12), 2 states have call successors, (3), 2 states have call predecessors, (3), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 19 letters. Loop has 6 letters. [2022-02-21 04:19:29,483 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:29,483 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 191 states and 253 transitions. cyclomatic complexity: 67 Stem has 19 letters. Loop has 6 letters. [2022-02-21 04:19:29,484 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:29,484 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 93 states and 126 transitions. cyclomatic complexity: 36 Stem has 17 letters. Loop has 4 letters. [2022-02-21 04:19:29,484 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:29,484 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 4 states, 3 states have (on average 4.0) internal successors, (12), 3 states have internal predecessors, (12), 2 states have call successors, (3), 2 states have call predecessors, (3), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 17 letters. Loop has 4 letters. [2022-02-21 04:19:29,484 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:29,484 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 191 states and 253 transitions. cyclomatic complexity: 67 Stem has 17 letters. Loop has 4 letters. [2022-02-21 04:19:29,486 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:29,486 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 93 states and 126 transitions. cyclomatic complexity: 36 Stem has 17 letters. Loop has 10 letters. [2022-02-21 04:19:29,486 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:29,486 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 4 states, 3 states have (on average 4.0) internal successors, (12), 3 states have internal predecessors, (12), 2 states have call successors, (3), 2 states have call predecessors, (3), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 17 letters. Loop has 10 letters. [2022-02-21 04:19:29,486 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:29,486 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 191 states and 253 transitions. cyclomatic complexity: 67 Stem has 17 letters. Loop has 10 letters. [2022-02-21 04:19:29,505 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:29,505 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 93 states and 126 transitions. cyclomatic complexity: 36 Stem has 20 letters. Loop has 6 letters. [2022-02-21 04:19:29,505 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:29,505 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 4 states, 3 states have (on average 4.0) internal successors, (12), 3 states have internal predecessors, (12), 2 states have call successors, (3), 2 states have call predecessors, (3), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 20 letters. Loop has 6 letters. [2022-02-21 04:19:29,506 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:29,506 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 191 states and 253 transitions. cyclomatic complexity: 67 Stem has 20 letters. Loop has 6 letters. [2022-02-21 04:19:29,506 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:29,506 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 93 states and 126 transitions. cyclomatic complexity: 36 Stem has 17 letters. Loop has 6 letters. [2022-02-21 04:19:29,506 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:29,506 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 4 states, 3 states have (on average 4.0) internal successors, (12), 3 states have internal predecessors, (12), 2 states have call successors, (3), 2 states have call predecessors, (3), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 17 letters. Loop has 6 letters. [2022-02-21 04:19:29,507 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:29,507 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 191 states and 253 transitions. cyclomatic complexity: 67 Stem has 17 letters. Loop has 6 letters. [2022-02-21 04:19:29,507 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:29,507 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 93 states and 126 transitions. cyclomatic complexity: 36 Stem has 21 letters. Loop has 6 letters. [2022-02-21 04:19:29,507 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:29,508 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 4 states, 3 states have (on average 4.0) internal successors, (12), 3 states have internal predecessors, (12), 2 states have call successors, (3), 2 states have call predecessors, (3), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 21 letters. Loop has 6 letters. [2022-02-21 04:19:29,508 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:29,508 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 191 states and 253 transitions. cyclomatic complexity: 67 Stem has 21 letters. Loop has 6 letters. [2022-02-21 04:19:29,509 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:29,509 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 93 states and 126 transitions. cyclomatic complexity: 36 Stem has 70 letters. Loop has 33 letters. [2022-02-21 04:19:29,510 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:29,510 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 4 states, 3 states have (on average 4.0) internal successors, (12), 3 states have internal predecessors, (12), 2 states have call successors, (3), 2 states have call predecessors, (3), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 70 letters. Loop has 33 letters. [2022-02-21 04:19:29,510 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:29,510 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 191 states and 253 transitions. cyclomatic complexity: 67 Stem has 70 letters. Loop has 33 letters. [2022-02-21 04:19:29,510 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:29,510 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 93 states and 126 transitions. cyclomatic complexity: 36 Stem has 71 letters. Loop has 33 letters. [2022-02-21 04:19:29,510 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:29,511 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 4 states, 3 states have (on average 4.0) internal successors, (12), 3 states have internal predecessors, (12), 2 states have call successors, (3), 2 states have call predecessors, (3), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 71 letters. Loop has 33 letters. [2022-02-21 04:19:29,511 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:29,511 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 191 states and 253 transitions. cyclomatic complexity: 67 Stem has 71 letters. Loop has 33 letters. [2022-02-21 04:19:29,511 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:29,511 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 93 states and 126 transitions. cyclomatic complexity: 36 Stem has 72 letters. Loop has 33 letters. [2022-02-21 04:19:29,511 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:29,511 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 4 states, 3 states have (on average 4.0) internal successors, (12), 3 states have internal predecessors, (12), 2 states have call successors, (3), 2 states have call predecessors, (3), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 72 letters. Loop has 33 letters. [2022-02-21 04:19:29,512 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:29,512 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 191 states and 253 transitions. cyclomatic complexity: 67 Stem has 72 letters. Loop has 33 letters. [2022-02-21 04:19:29,512 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:29,512 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 93 states and 126 transitions. cyclomatic complexity: 36 Stem has 73 letters. Loop has 33 letters. [2022-02-21 04:19:29,512 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:29,512 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 4 states, 3 states have (on average 4.0) internal successors, (12), 3 states have internal predecessors, (12), 2 states have call successors, (3), 2 states have call predecessors, (3), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 73 letters. Loop has 33 letters. [2022-02-21 04:19:29,512 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:29,512 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 191 states and 253 transitions. cyclomatic complexity: 67 Stem has 73 letters. Loop has 33 letters. [2022-02-21 04:19:29,513 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:29,513 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 93 states and 126 transitions. cyclomatic complexity: 36 Stem has 74 letters. Loop has 33 letters. [2022-02-21 04:19:29,513 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:29,513 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 4 states, 3 states have (on average 4.0) internal successors, (12), 3 states have internal predecessors, (12), 2 states have call successors, (3), 2 states have call predecessors, (3), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 74 letters. Loop has 33 letters. [2022-02-21 04:19:29,513 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:29,513 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 191 states and 253 transitions. cyclomatic complexity: 67 Stem has 74 letters. Loop has 33 letters. [2022-02-21 04:19:29,513 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:29,514 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 93 states and 126 transitions. cyclomatic complexity: 36 Stem has 75 letters. Loop has 33 letters. [2022-02-21 04:19:29,514 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:29,514 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 4 states, 3 states have (on average 4.0) internal successors, (12), 3 states have internal predecessors, (12), 2 states have call successors, (3), 2 states have call predecessors, (3), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 75 letters. Loop has 33 letters. [2022-02-21 04:19:29,514 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:29,514 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 191 states and 253 transitions. cyclomatic complexity: 67 Stem has 75 letters. Loop has 33 letters. [2022-02-21 04:19:29,514 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:29,514 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 93 states and 126 transitions. cyclomatic complexity: 36 Stem has 101 letters. Loop has 33 letters. [2022-02-21 04:19:29,515 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:29,515 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 4 states, 3 states have (on average 4.0) internal successors, (12), 3 states have internal predecessors, (12), 2 states have call successors, (3), 2 states have call predecessors, (3), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 101 letters. Loop has 33 letters. [2022-02-21 04:19:29,515 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:29,515 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 191 states and 253 transitions. cyclomatic complexity: 67 Stem has 101 letters. Loop has 33 letters. [2022-02-21 04:19:29,515 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:29,515 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 93 states and 126 transitions. cyclomatic complexity: 36 Stem has 102 letters. Loop has 33 letters. [2022-02-21 04:19:29,515 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:29,516 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 4 states, 3 states have (on average 4.0) internal successors, (12), 3 states have internal predecessors, (12), 2 states have call successors, (3), 2 states have call predecessors, (3), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 102 letters. Loop has 33 letters. [2022-02-21 04:19:29,516 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:29,516 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 191 states and 253 transitions. cyclomatic complexity: 67 Stem has 102 letters. Loop has 33 letters. [2022-02-21 04:19:29,516 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:29,516 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 93 states and 126 transitions. cyclomatic complexity: 36 Stem has 101 letters. Loop has 33 letters. [2022-02-21 04:19:29,516 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:29,516 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 4 states, 3 states have (on average 4.0) internal successors, (12), 3 states have internal predecessors, (12), 2 states have call successors, (3), 2 states have call predecessors, (3), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 101 letters. Loop has 33 letters. [2022-02-21 04:19:29,517 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:29,517 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 191 states and 253 transitions. cyclomatic complexity: 67 Stem has 101 letters. Loop has 33 letters. [2022-02-21 04:19:29,517 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:29,517 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 93 states and 126 transitions. cyclomatic complexity: 36 Stem has 17 letters. Loop has 5 letters. [2022-02-21 04:19:29,517 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:29,517 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 4 states, 3 states have (on average 4.0) internal successors, (12), 3 states have internal predecessors, (12), 2 states have call successors, (3), 2 states have call predecessors, (3), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 17 letters. Loop has 5 letters. [2022-02-21 04:19:29,517 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:29,517 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 191 states and 253 transitions. cyclomatic complexity: 67 Stem has 17 letters. Loop has 5 letters. [2022-02-21 04:19:29,517 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:29,517 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 93 states and 126 transitions. cyclomatic complexity: 36 Stem has 15 letters. Loop has 3 letters. [2022-02-21 04:19:29,518 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:29,518 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (27)] Forceful destruction successful, exit code 0 [2022-02-21 04:19:29,519 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 4 states, 3 states have (on average 4.0) internal successors, (12), 3 states have internal predecessors, (12), 2 states have call successors, (3), 2 states have call predecessors, (3), 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 04:19:29,519 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:29,519 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 191 states and 253 transitions. cyclomatic complexity: 67 Stem has 15 letters. Loop has 3 letters. [2022-02-21 04:19:29,519 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:29,519 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 93 states and 126 transitions. cyclomatic complexity: 36 Stem has 16 letters. Loop has 3 letters. [2022-02-21 04:19:29,520 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:29,520 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 4 states, 3 states have (on average 4.0) internal successors, (12), 3 states have internal predecessors, (12), 2 states have call successors, (3), 2 states have call predecessors, (3), 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 04:19:29,520 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:29,520 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 191 states and 253 transitions. cyclomatic complexity: 67 Stem has 16 letters. Loop has 3 letters. [2022-02-21 04:19:29,520 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:29,520 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 93 states and 126 transitions. cyclomatic complexity: 36 Stem has 14 letters. Loop has 3 letters. [2022-02-21 04:19:29,520 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:29,520 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 4 states, 3 states have (on average 4.0) internal successors, (12), 3 states have internal predecessors, (12), 2 states have call successors, (3), 2 states have call predecessors, (3), 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 04:19:29,520 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:29,520 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 191 states and 253 transitions. cyclomatic complexity: 67 Stem has 14 letters. Loop has 3 letters. [2022-02-21 04:19:29,521 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:29,521 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 93 states and 126 transitions. cyclomatic complexity: 36 Stem has 16 letters. Loop has 5 letters. [2022-02-21 04:19:29,521 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:29,521 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 4 states, 3 states have (on average 4.0) internal successors, (12), 3 states have internal predecessors, (12), 2 states have call successors, (3), 2 states have call predecessors, (3), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 16 letters. Loop has 5 letters. [2022-02-21 04:19:29,521 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:29,521 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 191 states and 253 transitions. cyclomatic complexity: 67 Stem has 16 letters. Loop has 5 letters. [2022-02-21 04:19:29,521 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:29,521 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 93 states and 126 transitions. cyclomatic complexity: 36 Stem has 18 letters. Loop has 5 letters. [2022-02-21 04:19:29,521 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:29,521 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 4 states, 3 states have (on average 4.0) internal successors, (12), 3 states have internal predecessors, (12), 2 states have call successors, (3), 2 states have call predecessors, (3), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 18 letters. Loop has 5 letters. [2022-02-21 04:19:29,522 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:29,522 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 191 states and 253 transitions. cyclomatic complexity: 67 Stem has 18 letters. Loop has 5 letters. [2022-02-21 04:19:29,522 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:29,522 INFO L161 tractBuchiDifference]: Finished testing correctness of buchiDifferenceNCSBLazy3 [2022-02-21 04:19:29,524 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 3 states have (on average 4.0) internal successors, (12), 3 states have internal predecessors, (12), 2 states have call successors, (3), 2 states have call predecessors, (3), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 04:19:29,525 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 67 transitions. [2022-02-21 04:19:29,525 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 67 transitions. Stem has 12 letters. Loop has 3 letters. [2022-02-21 04:19:29,525 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:29,525 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 67 transitions. Stem has 15 letters. Loop has 3 letters. [2022-02-21 04:19:29,525 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:29,525 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 67 transitions. Stem has 12 letters. Loop has 6 letters. [2022-02-21 04:19:29,526 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:29,526 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 191 states and 253 transitions. cyclomatic complexity: 67 [2022-02-21 04:19:29,531 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 42 [2022-02-21 04:19:29,541 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 191 states to 137 states and 182 transitions. [2022-02-21 04:19:29,541 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 113 [2022-02-21 04:19:29,541 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 114 [2022-02-21 04:19:29,541 INFO L73 IsDeterministic]: Start isDeterministic. Operand 137 states and 182 transitions. [2022-02-21 04:19:29,542 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2022-02-21 04:19:29,542 INFO L681 BuchiCegarLoop]: Abstraction has 137 states and 182 transitions. [2022-02-21 04:19:29,542 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 137 states and 182 transitions. [2022-02-21 04:19:29,544 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 137 to 108. [2022-02-21 04:19:29,544 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-21 04:19:29,545 INFO L82 GeneralOperation]: Start isEquivalent. First operand 137 states and 182 transitions. Second operand has 108 states, 77 states have (on average 1.3766233766233766) internal successors, (106), 84 states have internal predecessors, (106), 23 states have call successors, (25), 10 states have call predecessors, (25), 8 states have return successors, (15), 13 states have call predecessors, (15), 13 states have call successors, (15) [2022-02-21 04:19:29,545 INFO L74 IsIncluded]: Start isIncluded. First operand 137 states and 182 transitions. Second operand has 108 states, 77 states have (on average 1.3766233766233766) internal successors, (106), 84 states have internal predecessors, (106), 23 states have call successors, (25), 10 states have call predecessors, (25), 8 states have return successors, (15), 13 states have call predecessors, (15), 13 states have call successors, (15) [2022-02-21 04:19:29,545 INFO L87 Difference]: Start difference. First operand 137 states and 182 transitions. Second operand has 108 states, 77 states have (on average 1.3766233766233766) internal successors, (106), 84 states have internal predecessors, (106), 23 states have call successors, (25), 10 states have call predecessors, (25), 8 states have return successors, (15), 13 states have call predecessors, (15), 13 states have call successors, (15) [2022-02-21 04:19:29,546 INFO L149 Difference]: Subtrahend was not deterministic. Recomputing result with determinization. [2022-02-21 04:19:29,553 INFO L93 Difference]: Finished difference Result 257 states and 348 transitions. [2022-02-21 04:19:29,553 INFO L276 IsEmpty]: Start isEmpty. Operand 257 states and 348 transitions. [2022-02-21 04:19:29,554 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 04:19:29,554 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 04:19:29,554 INFO L74 IsIncluded]: Start isIncluded. First operand has 108 states, 77 states have (on average 1.3766233766233766) internal successors, (106), 84 states have internal predecessors, (106), 23 states have call successors, (25), 10 states have call predecessors, (25), 8 states have return successors, (15), 13 states have call predecessors, (15), 13 states have call successors, (15) Second operand 137 states and 182 transitions. [2022-02-21 04:19:29,554 INFO L87 Difference]: Start difference. First operand has 108 states, 77 states have (on average 1.3766233766233766) internal successors, (106), 84 states have internal predecessors, (106), 23 states have call successors, (25), 10 states have call predecessors, (25), 8 states have return successors, (15), 13 states have call predecessors, (15), 13 states have call successors, (15) Second operand 137 states and 182 transitions. [2022-02-21 04:19:29,554 INFO L149 Difference]: Subtrahend was not deterministic. Recomputing result with determinization. [2022-02-21 04:19:29,563 INFO L93 Difference]: Finished difference Result 332 states and 443 transitions. [2022-02-21 04:19:29,563 INFO L276 IsEmpty]: Start isEmpty. Operand 332 states and 443 transitions. [2022-02-21 04:19:29,564 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 04:19:29,564 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 04:19:29,564 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-21 04:19:29,564 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-21 04:19:29,565 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 108 states, 77 states have (on average 1.3766233766233766) internal successors, (106), 84 states have internal predecessors, (106), 23 states have call successors, (25), 10 states have call predecessors, (25), 8 states have return successors, (15), 13 states have call predecessors, (15), 13 states have call successors, (15) [2022-02-21 04:19:29,566 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 108 states to 108 states and 146 transitions. [2022-02-21 04:19:29,566 INFO L704 BuchiCegarLoop]: Abstraction has 108 states and 146 transitions. [2022-02-21 04:19:29,567 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-21 04:19:29,567 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-02-21 04:19:29,567 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-02-21 04:19:29,567 INFO L87 Difference]: Start difference. First operand 108 states and 146 transitions. Second operand has 5 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 4 states have internal predecessors, (10), 2 states have call successors, (2), 2 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 04:19:29,689 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 04:19:29,689 INFO L93 Difference]: Finished difference Result 98 states and 128 transitions. [2022-02-21 04:19:29,689 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-02-21 04:19:29,689 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 5 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 4 states have internal predecessors, (10), 2 states have call successors, (2), 2 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 04:19:29,697 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 04:19:29,699 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 98 states and 128 transitions. [2022-02-21 04:19:29,701 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 28 [2022-02-21 04:19:29,704 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 98 states to 98 states and 128 transitions. [2022-02-21 04:19:29,704 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 98 [2022-02-21 04:19:29,705 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 98 [2022-02-21 04:19:29,705 INFO L73 IsDeterministic]: Start isDeterministic. Operand 98 states and 128 transitions. [2022-02-21 04:19:29,705 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-02-21 04:19:29,705 INFO L681 BuchiCegarLoop]: Abstraction has 98 states and 128 transitions. [2022-02-21 04:19:29,705 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 98 states and 128 transitions. [2022-02-21 04:19:29,715 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 98 to 92. [2022-02-21 04:19:29,716 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-21 04:19:29,716 INFO L82 GeneralOperation]: Start isEquivalent. First operand 98 states and 128 transitions. Second operand has 92 states, 67 states have (on average 1.328358208955224) internal successors, (89), 70 states have internal predecessors, (89), 17 states have call successors, (17), 8 states have call predecessors, (17), 8 states have return successors, (15), 13 states have call predecessors, (15), 13 states have call successors, (15) [2022-02-21 04:19:29,716 INFO L74 IsIncluded]: Start isIncluded. First operand 98 states and 128 transitions. Second operand has 92 states, 67 states have (on average 1.328358208955224) internal successors, (89), 70 states have internal predecessors, (89), 17 states have call successors, (17), 8 states have call predecessors, (17), 8 states have return successors, (15), 13 states have call predecessors, (15), 13 states have call successors, (15) [2022-02-21 04:19:29,717 INFO L87 Difference]: Start difference. First operand 98 states and 128 transitions. Second operand has 92 states, 67 states have (on average 1.328358208955224) internal successors, (89), 70 states have internal predecessors, (89), 17 states have call successors, (17), 8 states have call predecessors, (17), 8 states have return successors, (15), 13 states have call predecessors, (15), 13 states have call successors, (15) [2022-02-21 04:19:29,719 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 04:19:29,719 INFO L93 Difference]: Finished difference Result 98 states and 128 transitions. [2022-02-21 04:19:29,719 INFO L276 IsEmpty]: Start isEmpty. Operand 98 states and 128 transitions. [2022-02-21 04:19:29,720 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 04:19:29,720 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 04:19:29,720 INFO L74 IsIncluded]: Start isIncluded. First operand has 92 states, 67 states have (on average 1.328358208955224) internal successors, (89), 70 states have internal predecessors, (89), 17 states have call successors, (17), 8 states have call predecessors, (17), 8 states have return successors, (15), 13 states have call predecessors, (15), 13 states have call successors, (15) Second operand 98 states and 128 transitions. [2022-02-21 04:19:29,720 INFO L87 Difference]: Start difference. First operand has 92 states, 67 states have (on average 1.328358208955224) internal successors, (89), 70 states have internal predecessors, (89), 17 states have call successors, (17), 8 states have call predecessors, (17), 8 states have return successors, (15), 13 states have call predecessors, (15), 13 states have call successors, (15) Second operand 98 states and 128 transitions. [2022-02-21 04:19:29,723 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 04:19:29,723 INFO L93 Difference]: Finished difference Result 98 states and 128 transitions. [2022-02-21 04:19:29,723 INFO L276 IsEmpty]: Start isEmpty. Operand 98 states and 128 transitions. [2022-02-21 04:19:29,723 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 04:19:29,724 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 04:19:29,724 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-21 04:19:29,724 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-21 04:19:29,725 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 92 states, 67 states have (on average 1.328358208955224) internal successors, (89), 70 states have internal predecessors, (89), 17 states have call successors, (17), 8 states have call predecessors, (17), 8 states have return successors, (15), 13 states have call predecessors, (15), 13 states have call successors, (15) [2022-02-21 04:19:29,727 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 92 states to 92 states and 121 transitions. [2022-02-21 04:19:29,727 INFO L704 BuchiCegarLoop]: Abstraction has 92 states and 121 transitions. [2022-02-21 04:19:29,727 INFO L587 BuchiCegarLoop]: Abstraction has 92 states and 121 transitions. [2022-02-21 04:19:29,727 INFO L425 BuchiCegarLoop]: ======== Iteration 5============ [2022-02-21 04:19:29,727 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 92 states and 121 transitions. [2022-02-21 04:19:29,728 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 28 [2022-02-21 04:19:29,728 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 04:19:29,728 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 04:19:29,728 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-21 04:19:29,729 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2022-02-21 04:19:29,729 INFO L791 eck$LassoCheckResult]: Stem: 5842#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(9, 2);call #Ultimate.allocInit(12, 3); 5818#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet12#1, main_#t~ret13#1, main_#t~nondet14#1, main_#t~nondet15#1, main_#t~ret16#1, main_#t~short17#1, main_~n~0#1, main_~result~0#1, main_~f1~0#1, main_~f2~0#1;main_~n~0#1 := main_#t~nondet12#1;havoc main_#t~nondet12#1; 5819#L78 assume !(main_~n~0#1 < 1 || main_~n~0#1 > 46340);assume { :begin_inline_is_prime } true;is_prime_#in~n#1 := main_~n~0#1;havoc is_prime_#res#1;havoc is_prime_#t~ret9#1, is_prime_~n#1;is_prime_~n#1 := is_prime_#in~n#1; 5848#L53 call is_prime_#t~ret9#1 := is_prime_(is_prime_~n#1, is_prime_~n#1 - 1);< 5861#is_prime_ENTRY ~n := #in~n;~m := #in~m; 5879#L58 assume ~n <= 1;#res := 0; 5863#is_prime_FINAL assume true; 5862#is_prime_EXIT >#118#return; 5859#L53-1 is_prime_#res#1 := is_prime_#t~ret9#1;havoc is_prime_#t~ret9#1; 5811#L53-2 main_#t~ret13#1 := is_prime_#res#1;assume { :end_inline_is_prime } true;main_~result~0#1 := main_#t~ret13#1;havoc main_#t~ret13#1;main_~f1~0#1 := main_#t~nondet14#1;havoc main_#t~nondet14#1; 5812#L85 assume !(main_~f1~0#1 < 1 || main_~f1~0#1 > 46340);main_~f2~0#1 := main_#t~nondet15#1;havoc main_#t~nondet15#1; 5816#L91 assume !(main_~f2~0#1 < 1 || main_~f2~0#1 > 46340);main_#t~short17#1 := 1 == main_~result~0#1; 5820#L97 assume main_#t~short17#1; 5821#L97-1 call main_#t~ret16#1 := mult(main_~f1~0#1, main_~f2~0#1);< 5833#multENTRY [2022-02-21 04:19:29,729 INFO L793 eck$LassoCheckResult]: Loop: 5833#multENTRY ~n := #in~n;~m := #in~m; 5840#L18 assume ~m < 0; 5827#L19 call #t~ret4 := mult(~n, -~m);< 5833#multENTRY [2022-02-21 04:19:29,730 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 04:19:29,730 INFO L85 PathProgramCache]: Analyzing trace with hash 636635474, now seen corresponding path program 1 times [2022-02-21 04:19:29,730 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 04:19:29,730 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [947151197] [2022-02-21 04:19:29,730 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 04:19:29,731 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 04:19:29,756 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 04:19:29,778 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-02-21 04:19:29,781 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 04:19:29,796 INFO L290 TraceCheckUtils]: 0: Hoare triple {6098#true} ~n := #in~n;~m := #in~m; {6098#true} is VALID [2022-02-21 04:19:29,797 INFO L290 TraceCheckUtils]: 1: Hoare triple {6098#true} assume ~n <= 1;#res := 0; {6108#(and (<= 0 |is_prime__#res|) (<= |is_prime__#res| 0))} is VALID [2022-02-21 04:19:29,797 INFO L290 TraceCheckUtils]: 2: Hoare triple {6108#(and (<= 0 |is_prime__#res|) (<= |is_prime__#res| 0))} assume true; {6108#(and (<= 0 |is_prime__#res|) (<= |is_prime__#res| 0))} is VALID [2022-02-21 04:19:29,798 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {6108#(and (<= 0 |is_prime__#res|) (<= |is_prime__#res| 0))} {6098#true} #118#return; {6104#(= |ULTIMATE.start_is_prime_#t~ret9#1| 0)} is VALID [2022-02-21 04:19:29,798 INFO L290 TraceCheckUtils]: 0: Hoare triple {6098#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(9, 2);call #Ultimate.allocInit(12, 3); {6098#true} is VALID [2022-02-21 04:19:29,798 INFO L290 TraceCheckUtils]: 1: Hoare triple {6098#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet12#1, main_#t~ret13#1, main_#t~nondet14#1, main_#t~nondet15#1, main_#t~ret16#1, main_#t~short17#1, main_~n~0#1, main_~result~0#1, main_~f1~0#1, main_~f2~0#1;main_~n~0#1 := main_#t~nondet12#1;havoc main_#t~nondet12#1; {6098#true} is VALID [2022-02-21 04:19:29,799 INFO L290 TraceCheckUtils]: 2: Hoare triple {6098#true} assume !(main_~n~0#1 < 1 || main_~n~0#1 > 46340);assume { :begin_inline_is_prime } true;is_prime_#in~n#1 := main_~n~0#1;havoc is_prime_#res#1;havoc is_prime_#t~ret9#1, is_prime_~n#1;is_prime_~n#1 := is_prime_#in~n#1; {6098#true} is VALID [2022-02-21 04:19:29,799 INFO L272 TraceCheckUtils]: 3: Hoare triple {6098#true} call is_prime_#t~ret9#1 := is_prime_(is_prime_~n#1, is_prime_~n#1 - 1); {6098#true} is VALID [2022-02-21 04:19:29,799 INFO L290 TraceCheckUtils]: 4: Hoare triple {6098#true} ~n := #in~n;~m := #in~m; {6098#true} is VALID [2022-02-21 04:19:29,799 INFO L290 TraceCheckUtils]: 5: Hoare triple {6098#true} assume ~n <= 1;#res := 0; {6108#(and (<= 0 |is_prime__#res|) (<= |is_prime__#res| 0))} is VALID [2022-02-21 04:19:29,800 INFO L290 TraceCheckUtils]: 6: Hoare triple {6108#(and (<= 0 |is_prime__#res|) (<= |is_prime__#res| 0))} assume true; {6108#(and (<= 0 |is_prime__#res|) (<= |is_prime__#res| 0))} is VALID [2022-02-21 04:19:29,800 INFO L284 TraceCheckUtils]: 7: Hoare quadruple {6108#(and (<= 0 |is_prime__#res|) (<= |is_prime__#res| 0))} {6098#true} #118#return; {6104#(= |ULTIMATE.start_is_prime_#t~ret9#1| 0)} is VALID [2022-02-21 04:19:29,801 INFO L290 TraceCheckUtils]: 8: Hoare triple {6104#(= |ULTIMATE.start_is_prime_#t~ret9#1| 0)} is_prime_#res#1 := is_prime_#t~ret9#1;havoc is_prime_#t~ret9#1; {6105#(= |ULTIMATE.start_is_prime_#res#1| 0)} is VALID [2022-02-21 04:19:29,801 INFO L290 TraceCheckUtils]: 9: Hoare triple {6105#(= |ULTIMATE.start_is_prime_#res#1| 0)} main_#t~ret13#1 := is_prime_#res#1;assume { :end_inline_is_prime } true;main_~result~0#1 := main_#t~ret13#1;havoc main_#t~ret13#1;main_~f1~0#1 := main_#t~nondet14#1;havoc main_#t~nondet14#1; {6106#(= |ULTIMATE.start_main_~result~0#1| 0)} is VALID [2022-02-21 04:19:29,802 INFO L290 TraceCheckUtils]: 10: Hoare triple {6106#(= |ULTIMATE.start_main_~result~0#1| 0)} assume !(main_~f1~0#1 < 1 || main_~f1~0#1 > 46340);main_~f2~0#1 := main_#t~nondet15#1;havoc main_#t~nondet15#1; {6106#(= |ULTIMATE.start_main_~result~0#1| 0)} is VALID [2022-02-21 04:19:29,802 INFO L290 TraceCheckUtils]: 11: Hoare triple {6106#(= |ULTIMATE.start_main_~result~0#1| 0)} assume !(main_~f2~0#1 < 1 || main_~f2~0#1 > 46340);main_#t~short17#1 := 1 == main_~result~0#1; {6107#(not |ULTIMATE.start_main_#t~short17#1|)} is VALID [2022-02-21 04:19:29,802 INFO L290 TraceCheckUtils]: 12: Hoare triple {6107#(not |ULTIMATE.start_main_#t~short17#1|)} assume main_#t~short17#1; {6099#false} is VALID [2022-02-21 04:19:29,802 INFO L272 TraceCheckUtils]: 13: Hoare triple {6099#false} call main_#t~ret16#1 := mult(main_~f1~0#1, main_~f2~0#1); {6099#false} is VALID [2022-02-21 04:19:29,803 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 04:19:29,803 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-21 04:19:29,803 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [947151197] [2022-02-21 04:19:29,803 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [947151197] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-21 04:19:29,803 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-21 04:19:29,803 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-02-21 04:19:29,804 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2030241212] [2022-02-21 04:19:29,804 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-21 04:19:29,804 INFO L796 eck$LassoCheckResult]: stem already infeasible [2022-02-21 04:19:29,804 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 04:19:29,804 INFO L85 PathProgramCache]: Analyzing trace with hash 53805, now seen corresponding path program 1 times [2022-02-21 04:19:29,805 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 04:19:29,805 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1375534400] [2022-02-21 04:19:29,805 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 04:19:29,805 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 04:19:29,808 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 04:19:29,808 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-02-21 04:19:29,809 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 04:19:29,810 INFO L138 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-02-21 04:19:29,860 INFO L210 LassoAnalysis]: Preferences: [2022-02-21 04:19:29,860 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2022-02-21 04:19:29,861 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2022-02-21 04:19:29,861 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2022-02-21 04:19:29,861 INFO L129 ssoRankerPreferences]: Use exernal solver: true [2022-02-21 04:19:29,861 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 04:19:29,861 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2022-02-21 04:19:29,861 INFO L132 ssoRankerPreferences]: Path of dumped script: [2022-02-21 04:19:29,861 INFO L133 ssoRankerPreferences]: Filename of dumped script: Primes.c_Iteration5_Loop [2022-02-21 04:19:29,861 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2022-02-21 04:19:29,861 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2022-02-21 04:19:29,863 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 04:19:29,864 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 04:19:29,866 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 04:19:29,867 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 04:19:29,869 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 04:19:29,871 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 04:19:29,873 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 04:19:29,934 INFO L294 LassoAnalysis]: Preprocessing complete. [2022-02-21 04:19:29,934 INFO L404 LassoAnalysis]: Checking for nontermination... [2022-02-21 04:19:29,934 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 04:19:29,935 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 04:19:29,935 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 04:19:29,936 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 04:19:29,938 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2022-02-21 04:19:29,938 INFO L160 nArgumentSynthesizer]: Using integer mode. [2022-02-21 04:19:29,944 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2022-02-21 04:19:29,944 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {mult_~n=0} Honda state: {mult_~n=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2022-02-21 04:19:29,959 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (28)] Ended with exit code 0 [2022-02-21 04:19:29,960 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 04:19:29,960 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 04:19:29,961 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 04:19:29,961 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 04:19:29,963 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2022-02-21 04:19:29,964 INFO L160 nArgumentSynthesizer]: Using integer mode. [2022-02-21 04:19:29,970 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2022-02-21 04:19:29,970 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {mult_#t~ret4=0} Honda state: {mult_#t~ret4=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2022-02-21 04:19:29,985 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (29)] Ended with exit code 0 [2022-02-21 04:19:29,985 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 04:19:29,985 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 04:19:29,986 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 04:19:29,987 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 04:19:29,989 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2022-02-21 04:19:29,989 INFO L160 nArgumentSynthesizer]: Using integer mode. [2022-02-21 04:19:29,995 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2022-02-21 04:19:29,996 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {mult_~m=0} Honda state: {mult_~m=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2022-02-21 04:19:30,013 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (30)] Ended with exit code 0 [2022-02-21 04:19:30,014 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 04:19:30,014 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 04:19:30,015 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 04:19:30,015 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 04:19:30,017 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2022-02-21 04:19:30,017 INFO L160 nArgumentSynthesizer]: Using integer mode. [2022-02-21 04:19:30,023 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2022-02-21 04:19:30,023 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {mult_#res=0} Honda state: {mult_#res=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2022-02-21 04:19:30,041 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 04:19:30,041 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 04:19:30,041 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 04:19:30,042 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 04:19:30,043 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 04:19:30,044 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2022-02-21 04:19:30,044 INFO L160 nArgumentSynthesizer]: Using integer mode. [2022-02-21 04:19:30,050 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2022-02-21 04:19:30,050 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {mult_#t~ret5=0} Honda state: {mult_#t~ret5=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2022-02-21 04:19:30,067 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 04:19:30,068 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 04:19:30,068 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 04:19:30,069 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 04:19:30,070 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 04:19:30,071 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2022-02-21 04:19:30,071 INFO L160 nArgumentSynthesizer]: Using integer mode. [2022-02-21 04:19:30,077 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2022-02-21 04:19:30,077 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {mult_#in~n=0} Honda state: {mult_#in~n=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2022-02-21 04:19:30,102 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (33)] Ended with exit code 0 [2022-02-21 04:19:30,102 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 04:19:30,102 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 04:19:30,103 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 04:19:30,103 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 04:19:30,105 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2022-02-21 04:19:30,105 INFO L160 nArgumentSynthesizer]: Using integer mode. [2022-02-21 04:19:30,133 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 04:19:30,133 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 04:19:30,133 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 04:19:30,135 INFO L229 MonitoredProcess]: Starting monitored process 35 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 04:19:30,135 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (35)] Waiting until timeout for monitored process [2022-02-21 04:19:30,137 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2022-02-21 04:19:30,137 INFO L160 nArgumentSynthesizer]: Using integer mode. [2022-02-21 04:19:30,173 INFO L444 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2022-02-21 04:19:30,176 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (35)] Ended with exit code 0 [2022-02-21 04:19:30,176 INFO L210 LassoAnalysis]: Preferences: [2022-02-21 04:19:30,176 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2022-02-21 04:19:30,176 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2022-02-21 04:19:30,176 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2022-02-21 04:19:30,176 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2022-02-21 04:19:30,176 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 04:19:30,176 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2022-02-21 04:19:30,176 INFO L132 ssoRankerPreferences]: Path of dumped script: [2022-02-21 04:19:30,176 INFO L133 ssoRankerPreferences]: Filename of dumped script: Primes.c_Iteration5_Loop [2022-02-21 04:19:30,176 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2022-02-21 04:19:30,176 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2022-02-21 04:19:30,177 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 04:19:30,179 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 04:19:30,182 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 04:19:30,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 04:19:30,185 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 04:19:30,187 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 04:19:30,189 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 04:19:30,261 INFO L294 LassoAnalysis]: Preprocessing complete. [2022-02-21 04:19:30,261 INFO L490 LassoAnalysis]: Using template 'affine'. [2022-02-21 04:19:30,261 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 04:19:30,261 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 04:19:30,262 INFO L229 MonitoredProcess]: Starting monitored process 36 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 04:19:30,264 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (36)] Waiting until timeout for monitored process [2022-02-21 04:19:30,264 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 04:19:30,270 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 04:19:30,270 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 04:19:30,270 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 04:19:30,270 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 04:19:30,270 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 04:19:30,271 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-02-21 04:19:30,271 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 04:19:30,286 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 04:19:30,308 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (36)] Ended with exit code 0 [2022-02-21 04:19:30,308 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 04:19:30,308 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 04:19:30,309 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 04:19:30,310 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 04:19:30,311 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 04:19:30,317 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 04:19:30,318 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 04:19:30,318 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 04:19:30,318 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 04:19:30,318 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 04:19:30,318 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-02-21 04:19:30,318 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 04:19:30,319 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 04:19:30,337 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 04:19:30,337 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 04:19:30,338 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 04:19:30,339 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 04:19:30,342 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 04:19:30,343 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 04:19:30,348 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 04:19:30,348 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 04:19:30,348 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 04:19:30,348 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 04:19:30,348 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 04:19:30,349 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-02-21 04:19:30,349 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 04:19:30,350 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 04:19:30,365 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 04:19:30,365 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 04:19:30,365 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 04:19:30,366 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 04:19:30,368 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 04:19:30,368 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 04:19:30,374 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 04:19:30,374 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 04:19:30,375 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 04:19:30,375 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 04:19:30,375 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 04:19:30,375 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-02-21 04:19:30,375 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 04:19:30,376 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 04:19:30,397 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (39)] Ended with exit code 0 [2022-02-21 04:19:30,398 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 04:19:30,398 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 04:19:30,399 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 04:19:30,400 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 04:19:30,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 04:19:30,407 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 04:19:30,407 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 04:19:30,407 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 04:19:30,407 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 04:19:30,407 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 04:19:30,407 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-02-21 04:19:30,407 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 04:19:30,413 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 04:19:30,428 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (40)] Forceful destruction successful, exit code 0 [2022-02-21 04:19:30,428 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 04:19:30,428 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 04:19:30,429 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 04:19:30,430 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 04:19:30,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 04:19:30,438 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 04:19:30,439 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 04:19:30,439 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 04:19:30,439 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 04:19:30,439 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 04:19:30,440 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-02-21 04:19:30,440 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 04:19:30,449 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 04:19:30,471 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (41)] Ended with exit code 0 [2022-02-21 04:19:30,471 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 04:19:30,472 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 04:19:30,472 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 04:19:30,473 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 04:19:30,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 04:19:30,479 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 04:19:30,480 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 04:19:30,480 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 04:19:30,480 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 04:19:30,480 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 04:19:30,480 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-02-21 04:19:30,480 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 04:19:30,482 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2022-02-21 04:19:30,484 INFO L443 ModelExtractionUtils]: Simplification made 2 calls to the SMT solver. [2022-02-21 04:19:30,484 INFO L444 ModelExtractionUtils]: 1 out of 3 variables were initially zero. Simplification set additionally 0 variables to zero. [2022-02-21 04:19:30,484 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 04:19:30,484 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 04:19:30,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 04:19:30,487 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 04:19:30,487 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2022-02-21 04:19:30,487 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2022-02-21 04:19:30,487 INFO L513 LassoAnalysis]: Proved termination. [2022-02-21 04:19:30,487 INFO L515 LassoAnalysis]: Termination argument consisting of: Ranking function f(mult_#in~m) = -1*mult_#in~m Supporting invariants [] [2022-02-21 04:19:30,502 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (42)] Ended with exit code 0 [2022-02-21 04:19:30,509 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2022-02-21 04:19:30,512 INFO L390 LassoCheck]: Loop: "~n := #in~n;~m := #in~m;" "assume ~m < 0;" "call #t~ret4 := mult(~n, -~m);"< [2022-02-21 04:19:30,516 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 04:19:30,532 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 04:19:30,574 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (43)] Forceful destruction successful, exit code 0 [2022-02-21 04:19:30,579 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 04:19:30,580 INFO L263 TraceCheckSpWp]: Trace formula consists of 124 conjuncts, 6 conjunts are in the unsatisfiable core [2022-02-21 04:19:30,588 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 04:19:30,589 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-21 04:19:30,648 INFO L290 TraceCheckUtils]: 0: Hoare triple {6111#unseeded} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(9, 2);call #Ultimate.allocInit(12, 3); {6111#unseeded} is VALID [2022-02-21 04:19:30,648 INFO L290 TraceCheckUtils]: 1: Hoare triple {6111#unseeded} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet12#1, main_#t~ret13#1, main_#t~nondet14#1, main_#t~nondet15#1, main_#t~ret16#1, main_#t~short17#1, main_~n~0#1, main_~result~0#1, main_~f1~0#1, main_~f2~0#1;main_~n~0#1 := main_#t~nondet12#1;havoc main_#t~nondet12#1; {6111#unseeded} is VALID [2022-02-21 04:19:30,649 INFO L290 TraceCheckUtils]: 2: Hoare triple {6111#unseeded} assume !(main_~n~0#1 < 1 || main_~n~0#1 > 46340);assume { :begin_inline_is_prime } true;is_prime_#in~n#1 := main_~n~0#1;havoc is_prime_#res#1;havoc is_prime_#t~ret9#1, is_prime_~n#1;is_prime_~n#1 := is_prime_#in~n#1; {6111#unseeded} is VALID [2022-02-21 04:19:30,649 INFO L272 TraceCheckUtils]: 3: Hoare triple {6111#unseeded} call is_prime_#t~ret9#1 := is_prime_(is_prime_~n#1, is_prime_~n#1 - 1); {6138#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2022-02-21 04:19:30,650 INFO L290 TraceCheckUtils]: 4: Hoare triple {6138#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} ~n := #in~n;~m := #in~m; {6138#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2022-02-21 04:19:30,650 INFO L290 TraceCheckUtils]: 5: Hoare triple {6138#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} assume ~n <= 1;#res := 0; {6138#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2022-02-21 04:19:30,650 INFO L290 TraceCheckUtils]: 6: Hoare triple {6138#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} assume true; {6138#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2022-02-21 04:19:30,651 INFO L284 TraceCheckUtils]: 7: Hoare quadruple {6138#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} {6111#unseeded} #118#return; {6111#unseeded} is VALID [2022-02-21 04:19:30,651 INFO L290 TraceCheckUtils]: 8: Hoare triple {6111#unseeded} is_prime_#res#1 := is_prime_#t~ret9#1;havoc is_prime_#t~ret9#1; {6111#unseeded} is VALID [2022-02-21 04:19:30,652 INFO L290 TraceCheckUtils]: 9: Hoare triple {6111#unseeded} main_#t~ret13#1 := is_prime_#res#1;assume { :end_inline_is_prime } true;main_~result~0#1 := main_#t~ret13#1;havoc main_#t~ret13#1;main_~f1~0#1 := main_#t~nondet14#1;havoc main_#t~nondet14#1; {6111#unseeded} is VALID [2022-02-21 04:19:30,652 INFO L290 TraceCheckUtils]: 10: Hoare triple {6111#unseeded} assume !(main_~f1~0#1 < 1 || main_~f1~0#1 > 46340);main_~f2~0#1 := main_#t~nondet15#1;havoc main_#t~nondet15#1; {6111#unseeded} is VALID [2022-02-21 04:19:30,652 INFO L290 TraceCheckUtils]: 11: Hoare triple {6111#unseeded} assume !(main_~f2~0#1 < 1 || main_~f2~0#1 > 46340);main_#t~short17#1 := 1 == main_~result~0#1; {6111#unseeded} is VALID [2022-02-21 04:19:30,652 INFO L290 TraceCheckUtils]: 12: Hoare triple {6111#unseeded} assume main_#t~short17#1; {6111#unseeded} is VALID [2022-02-21 04:19:30,653 INFO L272 TraceCheckUtils]: 13: Hoare triple {6111#unseeded} call main_#t~ret16#1 := mult(main_~f1~0#1, main_~f2~0#1); {6111#unseeded} is VALID [2022-02-21 04:19:30,660 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 04:19:30,660 INFO L263 TraceCheckSpWp]: Trace formula consists of 41 conjuncts, 7 conjunts are in the unsatisfiable core [2022-02-21 04:19:30,664 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 04:19:30,664 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-21 04:19:30,696 INFO L290 TraceCheckUtils]: 0: Hoare triple {6114#(>= oldRank0 (* (- 1) |mult_#in~m|))} ~n := #in~n;~m := #in~m; {6169#(<= 0 (+ oldRank0 mult_~m))} is VALID [2022-02-21 04:19:30,697 INFO L290 TraceCheckUtils]: 1: Hoare triple {6169#(<= 0 (+ oldRank0 mult_~m))} assume ~m < 0; {6173#(and (<= 0 (+ oldRank0 mult_~m)) (< mult_~m 0))} is VALID [2022-02-21 04:19:30,697 INFO L272 TraceCheckUtils]: 2: Hoare triple {6173#(and (<= 0 (+ oldRank0 mult_~m)) (< mult_~m 0))} call #t~ret4 := mult(~n, -~m); {6124#(or unseeded (and (>= oldRank0 0) (> oldRank0 (* (- 1) |mult_#in~m|))))} is VALID [2022-02-21 04:19:30,698 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 04:19:30,698 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), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-21 04:19:30,709 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 04:19:30,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), 2 states have call successors, (3), 2 states have call predecessors, (3), 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 04:19:30,710 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:30,710 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 04:19:30,710 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 92 states and 121 transitions. cyclomatic complexity: 32 Second operand has 5 states, 4 states have (on average 3.25) internal successors, (13), 4 states have internal predecessors, (13), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-21 04:19:30,850 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 92 states and 121 transitions. cyclomatic complexity: 32. Second operand has 5 states, 4 states have (on average 3.25) internal successors, (13), 4 states have internal predecessors, (13), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Result 114 states and 145 transitions. Complement of second has 14 states. [2022-02-21 04:19:30,850 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 04:19:30,850 INFO L123 tractBuchiDifference]: Start testing correctness of buchiDifferenceNCSBLazy3 [2022-02-21 04:19:30,850 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 92 states and 121 transitions. cyclomatic complexity: 32 [2022-02-21 04:19:30,850 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 04:19:30,850 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 04:19:30,850 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), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-21 04:19:30,851 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2022-02-21 04:19:30,851 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 04:19:30,851 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 04:19:30,851 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 114 states and 145 transitions. [2022-02-21 04:19:30,852 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 28 [2022-02-21 04:19:30,852 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 04:19:30,852 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 04:19:30,852 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 92 states and 121 transitions. cyclomatic complexity: 32 [2022-02-21 04:19:30,854 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 29 examples of accepted words. [2022-02-21 04:19:30,854 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), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-21 04:19:30,855 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2022-02-21 04:19:30,855 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 1 examples of accepted words. [2022-02-21 04:19:30,855 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 114 states and 145 transitions. cyclomatic complexity: 35 [2022-02-21 04:19:30,858 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 29 examples of accepted words. [2022-02-21 04:19:30,858 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 92 states and 121 transitions. cyclomatic complexity: 32 Stem has 14 letters. Loop has 3 letters. [2022-02-21 04:19:30,858 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:30,858 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), 2 states have call successors, (3), 2 states have call predecessors, (3), 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 04:19:30,858 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:30,858 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 114 states and 145 transitions. cyclomatic complexity: 35 Stem has 14 letters. Loop has 3 letters. [2022-02-21 04:19:30,858 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:30,858 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 92 states and 121 transitions. cyclomatic complexity: 32 Stem has 1 letters. Loop has 3 letters. [2022-02-21 04:19:30,858 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:30,858 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), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Stem has 1 letters. Loop has 3 letters. [2022-02-21 04:19:30,859 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:30,859 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 114 states and 145 transitions. cyclomatic complexity: 35 Stem has 1 letters. Loop has 3 letters. [2022-02-21 04:19:30,859 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:30,859 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 92 states and 121 transitions. cyclomatic complexity: 32 Stem has 14 letters. Loop has 4 letters. [2022-02-21 04:19:30,859 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:30,859 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), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Stem has 14 letters. Loop has 4 letters. [2022-02-21 04:19:30,859 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:30,860 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 114 states and 145 transitions. cyclomatic complexity: 35 Stem has 14 letters. Loop has 4 letters. [2022-02-21 04:19:30,860 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:30,860 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 92 states and 121 transitions. cyclomatic complexity: 32 Stem has 114 letters. Loop has 114 letters. [2022-02-21 04:19:30,860 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:30,860 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), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Stem has 114 letters. Loop has 114 letters. [2022-02-21 04:19:30,860 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:30,860 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 114 states and 145 transitions. cyclomatic complexity: 35 Stem has 114 letters. Loop has 114 letters. [2022-02-21 04:19:30,860 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:30,860 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 92 states and 121 transitions. cyclomatic complexity: 32 Stem has 92 letters. Loop has 92 letters. [2022-02-21 04:19:30,860 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:30,860 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), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Stem has 92 letters. Loop has 92 letters. [2022-02-21 04:19:30,861 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:30,861 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 114 states and 145 transitions. cyclomatic complexity: 35 Stem has 92 letters. Loop has 92 letters. [2022-02-21 04:19:30,861 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:30,861 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 92 states and 121 transitions. cyclomatic complexity: 32 Stem has 5 letters. Loop has 5 letters. [2022-02-21 04:19:30,861 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:30,861 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), 2 states have call successors, (3), 2 states have call predecessors, (3), 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 04:19:30,861 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:30,861 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 114 states and 145 transitions. cyclomatic complexity: 35 Stem has 5 letters. Loop has 5 letters. [2022-02-21 04:19:30,861 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:30,861 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 92 states and 121 transitions. cyclomatic complexity: 32 Stem has 21 letters. Loop has 6 letters. [2022-02-21 04:19:30,861 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:30,861 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), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Stem has 21 letters. Loop has 6 letters. [2022-02-21 04:19:30,861 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:30,861 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 114 states and 145 transitions. cyclomatic complexity: 35 Stem has 21 letters. Loop has 6 letters. [2022-02-21 04:19:30,861 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:30,861 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 92 states and 121 transitions. cyclomatic complexity: 32 Stem has 19 letters. Loop has 10 letters. [2022-02-21 04:19:30,861 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:30,861 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), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Stem has 19 letters. Loop has 10 letters. [2022-02-21 04:19:30,861 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:30,861 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 114 states and 145 transitions. cyclomatic complexity: 35 Stem has 19 letters. Loop has 10 letters. [2022-02-21 04:19:30,861 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:30,861 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 92 states and 121 transitions. cyclomatic complexity: 32 Stem has 16 letters. Loop has 6 letters. [2022-02-21 04:19:30,861 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:30,862 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), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Stem has 16 letters. Loop has 6 letters. [2022-02-21 04:19:30,862 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:30,862 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 114 states and 145 transitions. cyclomatic complexity: 35 Stem has 16 letters. Loop has 6 letters. [2022-02-21 04:19:30,862 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:30,862 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 92 states and 121 transitions. cyclomatic complexity: 32 Stem has 19 letters. Loop has 10 letters. [2022-02-21 04:19:30,862 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:30,862 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), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Stem has 19 letters. Loop has 10 letters. [2022-02-21 04:19:30,862 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:30,862 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 114 states and 145 transitions. cyclomatic complexity: 35 Stem has 19 letters. Loop has 10 letters. [2022-02-21 04:19:30,862 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:30,862 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 92 states and 121 transitions. cyclomatic complexity: 32 Stem has 17 letters. Loop has 4 letters. [2022-02-21 04:19:30,862 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:30,862 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), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Stem has 17 letters. Loop has 4 letters. [2022-02-21 04:19:30,862 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:30,862 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 114 states and 145 transitions. cyclomatic complexity: 35 Stem has 17 letters. Loop has 4 letters. [2022-02-21 04:19:30,862 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:30,862 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 92 states and 121 transitions. cyclomatic complexity: 32 Stem has 18 letters. Loop has 6 letters. [2022-02-21 04:19:30,862 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:30,862 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), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Stem has 18 letters. Loop has 6 letters. [2022-02-21 04:19:30,862 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:30,863 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 114 states and 145 transitions. cyclomatic complexity: 35 Stem has 18 letters. Loop has 6 letters. [2022-02-21 04:19:30,863 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:30,863 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 92 states and 121 transitions. cyclomatic complexity: 32 Stem has 18 letters. Loop has 10 letters. [2022-02-21 04:19:30,863 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:30,863 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), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Stem has 18 letters. Loop has 10 letters. [2022-02-21 04:19:30,863 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:30,863 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 114 states and 145 transitions. cyclomatic complexity: 35 Stem has 18 letters. Loop has 10 letters. [2022-02-21 04:19:30,863 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:30,863 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 92 states and 121 transitions. cyclomatic complexity: 32 Stem has 17 letters. Loop has 10 letters. [2022-02-21 04:19:30,863 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:30,863 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), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Stem has 17 letters. Loop has 10 letters. [2022-02-21 04:19:30,863 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:30,863 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 114 states and 145 transitions. cyclomatic complexity: 35 Stem has 17 letters. Loop has 10 letters. [2022-02-21 04:19:30,863 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:30,863 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 92 states and 121 transitions. cyclomatic complexity: 32 Stem has 16 letters. Loop has 4 letters. [2022-02-21 04:19:30,863 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:30,863 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), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Stem has 16 letters. Loop has 4 letters. [2022-02-21 04:19:30,863 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:30,863 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 114 states and 145 transitions. cyclomatic complexity: 35 Stem has 16 letters. Loop has 4 letters. [2022-02-21 04:19:30,863 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:30,863 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 92 states and 121 transitions. cyclomatic complexity: 32 Stem has 17 letters. Loop has 6 letters. [2022-02-21 04:19:30,863 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:30,863 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), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Stem has 17 letters. Loop has 6 letters. [2022-02-21 04:19:30,864 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:30,864 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 114 states and 145 transitions. cyclomatic complexity: 35 Stem has 17 letters. Loop has 6 letters. [2022-02-21 04:19:30,864 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:30,864 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 92 states and 121 transitions. cyclomatic complexity: 32 Stem has 15 letters. Loop has 4 letters. [2022-02-21 04:19:30,864 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:30,864 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), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Stem has 15 letters. Loop has 4 letters. [2022-02-21 04:19:30,864 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:30,864 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 114 states and 145 transitions. cyclomatic complexity: 35 Stem has 15 letters. Loop has 4 letters. [2022-02-21 04:19:30,864 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:30,864 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 92 states and 121 transitions. cyclomatic complexity: 32 Stem has 19 letters. Loop has 6 letters. [2022-02-21 04:19:30,864 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:30,864 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), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Stem has 19 letters. Loop has 6 letters. [2022-02-21 04:19:30,864 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:30,864 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 114 states and 145 transitions. cyclomatic complexity: 35 Stem has 19 letters. Loop has 6 letters. [2022-02-21 04:19:30,864 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:30,864 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 92 states and 121 transitions. cyclomatic complexity: 32 Stem has 20 letters. Loop has 6 letters. [2022-02-21 04:19:30,864 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:30,864 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), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Stem has 20 letters. Loop has 6 letters. [2022-02-21 04:19:30,864 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:30,864 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 114 states and 145 transitions. cyclomatic complexity: 35 Stem has 20 letters. Loop has 6 letters. [2022-02-21 04:19:30,864 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:30,864 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 92 states and 121 transitions. cyclomatic complexity: 32 Stem has 14 letters. Loop has 4 letters. [2022-02-21 04:19:30,864 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:30,865 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), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Stem has 14 letters. Loop has 4 letters. [2022-02-21 04:19:30,865 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:30,865 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 114 states and 145 transitions. cyclomatic complexity: 35 Stem has 14 letters. Loop has 4 letters. [2022-02-21 04:19:30,865 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:30,865 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 92 states and 121 transitions. cyclomatic complexity: 32 Stem has 75 letters. Loop has 33 letters. [2022-02-21 04:19:30,866 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:30,866 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), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Stem has 75 letters. Loop has 33 letters. [2022-02-21 04:19:30,866 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:30,866 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 114 states and 145 transitions. cyclomatic complexity: 35 Stem has 75 letters. Loop has 33 letters. [2022-02-21 04:19:30,866 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:30,866 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 92 states and 121 transitions. cyclomatic complexity: 32 Stem has 101 letters. Loop has 33 letters. [2022-02-21 04:19:30,866 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:30,866 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), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Stem has 101 letters. Loop has 33 letters. [2022-02-21 04:19:30,866 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:30,866 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 114 states and 145 transitions. cyclomatic complexity: 35 Stem has 101 letters. Loop has 33 letters. [2022-02-21 04:19:30,866 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:30,866 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 92 states and 121 transitions. cyclomatic complexity: 32 Stem has 102 letters. Loop has 33 letters. [2022-02-21 04:19:30,867 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:30,867 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), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Stem has 102 letters. Loop has 33 letters. [2022-02-21 04:19:30,867 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:30,867 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 114 states and 145 transitions. cyclomatic complexity: 35 Stem has 102 letters. Loop has 33 letters. [2022-02-21 04:19:30,867 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:30,867 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 92 states and 121 transitions. cyclomatic complexity: 32 Stem has 74 letters. Loop has 33 letters. [2022-02-21 04:19:30,867 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:30,867 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), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Stem has 74 letters. Loop has 33 letters. [2022-02-21 04:19:30,867 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:30,867 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 114 states and 145 transitions. cyclomatic complexity: 35 Stem has 74 letters. Loop has 33 letters. [2022-02-21 04:19:30,867 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:30,867 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 92 states and 121 transitions. cyclomatic complexity: 32 Stem has 70 letters. Loop has 33 letters. [2022-02-21 04:19:30,868 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:30,868 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), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Stem has 70 letters. Loop has 33 letters. [2022-02-21 04:19:30,868 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:30,868 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 114 states and 145 transitions. cyclomatic complexity: 35 Stem has 70 letters. Loop has 33 letters. [2022-02-21 04:19:30,868 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:30,868 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 92 states and 121 transitions. cyclomatic complexity: 32 Stem has 71 letters. Loop has 33 letters. [2022-02-21 04:19:30,868 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:30,868 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), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Stem has 71 letters. Loop has 33 letters. [2022-02-21 04:19:30,868 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:30,868 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 114 states and 145 transitions. cyclomatic complexity: 35 Stem has 71 letters. Loop has 33 letters. [2022-02-21 04:19:30,868 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:30,868 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 92 states and 121 transitions. cyclomatic complexity: 32 Stem has 72 letters. Loop has 33 letters. [2022-02-21 04:19:30,869 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:30,869 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), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Stem has 72 letters. Loop has 33 letters. [2022-02-21 04:19:30,869 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:30,869 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 114 states and 145 transitions. cyclomatic complexity: 35 Stem has 72 letters. Loop has 33 letters. [2022-02-21 04:19:30,869 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:30,869 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 92 states and 121 transitions. cyclomatic complexity: 32 Stem has 73 letters. Loop has 33 letters. [2022-02-21 04:19:30,869 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:30,869 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), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Stem has 73 letters. Loop has 33 letters. [2022-02-21 04:19:30,869 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:30,869 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 114 states and 145 transitions. cyclomatic complexity: 35 Stem has 73 letters. Loop has 33 letters. [2022-02-21 04:19:30,869 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:30,869 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 92 states and 121 transitions. cyclomatic complexity: 32 Stem has 101 letters. Loop has 33 letters. [2022-02-21 04:19:30,869 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:30,870 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), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Stem has 101 letters. Loop has 33 letters. [2022-02-21 04:19:30,870 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:30,870 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 114 states and 145 transitions. cyclomatic complexity: 35 Stem has 101 letters. Loop has 33 letters. [2022-02-21 04:19:30,870 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:30,870 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 92 states and 121 transitions. cyclomatic complexity: 32 Stem has 15 letters. Loop has 3 letters. [2022-02-21 04:19:30,870 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:30,870 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), 2 states have call successors, (3), 2 states have call predecessors, (3), 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 04:19:30,870 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:30,870 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 114 states and 145 transitions. cyclomatic complexity: 35 Stem has 15 letters. Loop has 3 letters. [2022-02-21 04:19:30,870 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:30,870 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 92 states and 121 transitions. cyclomatic complexity: 32 Stem has 17 letters. Loop has 5 letters. [2022-02-21 04:19:30,870 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:30,870 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), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Stem has 17 letters. Loop has 5 letters. [2022-02-21 04:19:30,870 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:30,870 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 114 states and 145 transitions. cyclomatic complexity: 35 Stem has 17 letters. Loop has 5 letters. [2022-02-21 04:19:30,871 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:30,872 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 92 states and 121 transitions. cyclomatic complexity: 32 Stem has 16 letters. Loop has 5 letters. [2022-02-21 04:19:30,872 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:30,872 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), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Stem has 16 letters. Loop has 5 letters. [2022-02-21 04:19:30,872 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:30,872 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 114 states and 145 transitions. cyclomatic complexity: 35 Stem has 16 letters. Loop has 5 letters. [2022-02-21 04:19:30,872 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:30,872 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 92 states and 121 transitions. cyclomatic complexity: 32 Stem has 18 letters. Loop has 5 letters. [2022-02-21 04:19:30,872 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:30,872 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), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Stem has 18 letters. Loop has 5 letters. [2022-02-21 04:19:30,872 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:30,872 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 114 states and 145 transitions. cyclomatic complexity: 35 Stem has 18 letters. Loop has 5 letters. [2022-02-21 04:19:30,872 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:30,872 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 92 states and 121 transitions. cyclomatic complexity: 32 Stem has 16 letters. Loop has 3 letters. [2022-02-21 04:19:30,872 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:30,872 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), 2 states have call successors, (3), 2 states have call predecessors, (3), 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 04:19:30,872 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:30,872 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 114 states and 145 transitions. cyclomatic complexity: 35 Stem has 16 letters. Loop has 3 letters. [2022-02-21 04:19:30,872 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:30,872 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 92 states and 121 transitions. cyclomatic complexity: 32 Stem has 14 letters. Loop has 3 letters. [2022-02-21 04:19:30,872 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:30,873 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), 2 states have call successors, (3), 2 states have call predecessors, (3), 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 04:19:30,873 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:30,873 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 114 states and 145 transitions. cyclomatic complexity: 35 Stem has 14 letters. Loop has 3 letters. [2022-02-21 04:19:30,873 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:30,873 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 92 states and 121 transitions. cyclomatic complexity: 32 Stem has 1 letters. Loop has 3 letters. [2022-02-21 04:19:30,873 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:30,873 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), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Stem has 1 letters. Loop has 3 letters. [2022-02-21 04:19:30,873 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:30,873 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 114 states and 145 transitions. cyclomatic complexity: 35 Stem has 1 letters. Loop has 3 letters. [2022-02-21 04:19:30,873 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:30,873 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 92 states and 121 transitions. cyclomatic complexity: 32 Stem has 14 letters. Loop has 4 letters. [2022-02-21 04:19:30,873 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:30,873 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), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Stem has 14 letters. Loop has 4 letters. [2022-02-21 04:19:30,873 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:30,873 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 114 states and 145 transitions. cyclomatic complexity: 35 Stem has 14 letters. Loop has 4 letters. [2022-02-21 04:19:30,873 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:30,873 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 92 states and 121 transitions. cyclomatic complexity: 32 Stem has 18 letters. Loop has 10 letters. [2022-02-21 04:19:30,873 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:30,873 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), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Stem has 18 letters. Loop has 10 letters. [2022-02-21 04:19:30,873 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:30,873 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 114 states and 145 transitions. cyclomatic complexity: 35 Stem has 18 letters. Loop has 10 letters. [2022-02-21 04:19:30,873 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:30,873 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 92 states and 121 transitions. cyclomatic complexity: 32 Stem has 18 letters. Loop has 6 letters. [2022-02-21 04:19:30,874 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:30,874 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), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Stem has 18 letters. Loop has 6 letters. [2022-02-21 04:19:30,874 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:30,874 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 114 states and 145 transitions. cyclomatic complexity: 35 Stem has 18 letters. Loop has 6 letters. [2022-02-21 04:19:30,874 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:30,874 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 92 states and 121 transitions. cyclomatic complexity: 32 Stem has 15 letters. Loop has 4 letters. [2022-02-21 04:19:30,874 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:30,874 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), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Stem has 15 letters. Loop has 4 letters. [2022-02-21 04:19:30,874 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:30,874 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 114 states and 145 transitions. cyclomatic complexity: 35 Stem has 15 letters. Loop has 4 letters. [2022-02-21 04:19:30,874 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:30,874 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 92 states and 121 transitions. cyclomatic complexity: 32 Stem has 19 letters. Loop has 10 letters. [2022-02-21 04:19:30,874 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:30,874 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), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Stem has 19 letters. Loop has 10 letters. [2022-02-21 04:19:30,874 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:30,874 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 114 states and 145 transitions. cyclomatic complexity: 35 Stem has 19 letters. Loop has 10 letters. [2022-02-21 04:19:30,874 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:30,874 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 92 states and 121 transitions. cyclomatic complexity: 32 Stem has 19 letters. Loop has 10 letters. [2022-02-21 04:19:30,874 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:30,874 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), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Stem has 19 letters. Loop has 10 letters. [2022-02-21 04:19:30,874 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:30,874 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 114 states and 145 transitions. cyclomatic complexity: 35 Stem has 19 letters. Loop has 10 letters. [2022-02-21 04:19:30,875 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:30,875 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 92 states and 121 transitions. cyclomatic complexity: 32 Stem has 19 letters. Loop has 6 letters. [2022-02-21 04:19:30,875 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:30,875 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), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Stem has 19 letters. Loop has 6 letters. [2022-02-21 04:19:30,876 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:30,876 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 114 states and 145 transitions. cyclomatic complexity: 35 Stem has 19 letters. Loop has 6 letters. [2022-02-21 04:19:30,876 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:30,876 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 92 states and 121 transitions. cyclomatic complexity: 32 Stem has 16 letters. Loop has 4 letters. [2022-02-21 04:19:30,876 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:30,876 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), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Stem has 16 letters. Loop has 4 letters. [2022-02-21 04:19:30,876 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:30,876 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 114 states and 145 transitions. cyclomatic complexity: 35 Stem has 16 letters. Loop has 4 letters. [2022-02-21 04:19:30,876 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:30,876 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 92 states and 121 transitions. cyclomatic complexity: 32 Stem has 20 letters. Loop has 6 letters. [2022-02-21 04:19:30,876 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:30,876 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), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Stem has 20 letters. Loop has 6 letters. [2022-02-21 04:19:30,876 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:30,876 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 114 states and 145 transitions. cyclomatic complexity: 35 Stem has 20 letters. Loop has 6 letters. [2022-02-21 04:19:30,876 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:30,876 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 92 states and 121 transitions. cyclomatic complexity: 32 Stem has 16 letters. Loop has 6 letters. [2022-02-21 04:19:30,876 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:30,876 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), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Stem has 16 letters. Loop has 6 letters. [2022-02-21 04:19:30,876 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:30,876 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 114 states and 145 transitions. cyclomatic complexity: 35 Stem has 16 letters. Loop has 6 letters. [2022-02-21 04:19:30,876 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:30,877 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 92 states and 121 transitions. cyclomatic complexity: 32 Stem has 17 letters. Loop has 4 letters. [2022-02-21 04:19:30,877 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:30,877 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), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Stem has 17 letters. Loop has 4 letters. [2022-02-21 04:19:30,877 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:30,877 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 114 states and 145 transitions. cyclomatic complexity: 35 Stem has 17 letters. Loop has 4 letters. [2022-02-21 04:19:30,877 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:30,877 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 92 states and 121 transitions. cyclomatic complexity: 32 Stem has 17 letters. Loop has 10 letters. [2022-02-21 04:19:30,877 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:30,878 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), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Stem has 17 letters. Loop has 10 letters. [2022-02-21 04:19:30,878 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:30,878 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 114 states and 145 transitions. cyclomatic complexity: 35 Stem has 17 letters. Loop has 10 letters. [2022-02-21 04:19:30,878 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:30,878 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 92 states and 121 transitions. cyclomatic complexity: 32 Stem has 21 letters. Loop has 6 letters. [2022-02-21 04:19:30,878 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:30,878 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), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Stem has 21 letters. Loop has 6 letters. [2022-02-21 04:19:30,878 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:30,878 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 114 states and 145 transitions. cyclomatic complexity: 35 Stem has 21 letters. Loop has 6 letters. [2022-02-21 04:19:30,878 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:30,878 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 92 states and 121 transitions. cyclomatic complexity: 32 Stem has 17 letters. Loop has 6 letters. [2022-02-21 04:19:30,878 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:30,878 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), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Stem has 17 letters. Loop has 6 letters. [2022-02-21 04:19:30,879 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:30,879 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 114 states and 145 transitions. cyclomatic complexity: 35 Stem has 17 letters. Loop has 6 letters. [2022-02-21 04:19:30,879 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:30,879 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 92 states and 121 transitions. cyclomatic complexity: 32 Stem has 73 letters. Loop has 33 letters. [2022-02-21 04:19:30,879 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:30,879 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), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Stem has 73 letters. Loop has 33 letters. [2022-02-21 04:19:30,879 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:30,879 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 114 states and 145 transitions. cyclomatic complexity: 35 Stem has 73 letters. Loop has 33 letters. [2022-02-21 04:19:30,879 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:30,879 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 92 states and 121 transitions. cyclomatic complexity: 32 Stem has 74 letters. Loop has 33 letters. [2022-02-21 04:19:30,879 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:30,879 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), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Stem has 74 letters. Loop has 33 letters. [2022-02-21 04:19:30,879 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:30,880 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 114 states and 145 transitions. cyclomatic complexity: 35 Stem has 74 letters. Loop has 33 letters. [2022-02-21 04:19:30,880 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:30,880 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 92 states and 121 transitions. cyclomatic complexity: 32 Stem has 75 letters. Loop has 33 letters. [2022-02-21 04:19:30,880 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:30,880 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), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Stem has 75 letters. Loop has 33 letters. [2022-02-21 04:19:30,880 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:30,880 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 114 states and 145 transitions. cyclomatic complexity: 35 Stem has 75 letters. Loop has 33 letters. [2022-02-21 04:19:30,880 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:30,880 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 92 states and 121 transitions. cyclomatic complexity: 32 Stem has 101 letters. Loop has 33 letters. [2022-02-21 04:19:30,880 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:30,880 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), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Stem has 101 letters. Loop has 33 letters. [2022-02-21 04:19:30,880 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:30,880 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 114 states and 145 transitions. cyclomatic complexity: 35 Stem has 101 letters. Loop has 33 letters. [2022-02-21 04:19:30,881 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:30,881 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 92 states and 121 transitions. cyclomatic complexity: 32 Stem has 102 letters. Loop has 33 letters. [2022-02-21 04:19:30,881 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:30,881 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), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Stem has 102 letters. Loop has 33 letters. [2022-02-21 04:19:30,881 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:30,881 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 114 states and 145 transitions. cyclomatic complexity: 35 Stem has 102 letters. Loop has 33 letters. [2022-02-21 04:19:30,881 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:30,881 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 92 states and 121 transitions. cyclomatic complexity: 32 Stem has 70 letters. Loop has 33 letters. [2022-02-21 04:19:30,881 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:30,881 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), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Stem has 70 letters. Loop has 33 letters. [2022-02-21 04:19:30,881 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:30,881 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 114 states and 145 transitions. cyclomatic complexity: 35 Stem has 70 letters. Loop has 33 letters. [2022-02-21 04:19:30,882 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:30,882 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 92 states and 121 transitions. cyclomatic complexity: 32 Stem has 71 letters. Loop has 33 letters. [2022-02-21 04:19:30,882 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:30,882 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), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Stem has 71 letters. Loop has 33 letters. [2022-02-21 04:19:30,882 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:30,882 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 114 states and 145 transitions. cyclomatic complexity: 35 Stem has 71 letters. Loop has 33 letters. [2022-02-21 04:19:30,882 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:30,882 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 92 states and 121 transitions. cyclomatic complexity: 32 Stem has 72 letters. Loop has 33 letters. [2022-02-21 04:19:30,882 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:30,895 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), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Stem has 72 letters. Loop has 33 letters. [2022-02-21 04:19:30,895 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:30,895 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 114 states and 145 transitions. cyclomatic complexity: 35 Stem has 72 letters. Loop has 33 letters. [2022-02-21 04:19:30,896 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:30,896 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 92 states and 121 transitions. cyclomatic complexity: 32 Stem has 101 letters. Loop has 33 letters. [2022-02-21 04:19:30,896 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:30,896 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), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Stem has 101 letters. Loop has 33 letters. [2022-02-21 04:19:30,897 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:30,897 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 114 states and 145 transitions. cyclomatic complexity: 35 Stem has 101 letters. Loop has 33 letters. [2022-02-21 04:19:30,897 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:30,897 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 92 states and 121 transitions. cyclomatic complexity: 32 Stem has 20 letters. Loop has 3 letters. [2022-02-21 04:19:30,897 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:30,897 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), 2 states have call successors, (3), 2 states have call predecessors, (3), 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 04:19:30,897 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:30,897 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 114 states and 145 transitions. cyclomatic complexity: 35 Stem has 20 letters. Loop has 3 letters. [2022-02-21 04:19:30,897 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:30,897 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 92 states and 121 transitions. cyclomatic complexity: 32 Stem has 21 letters. Loop has 3 letters. [2022-02-21 04:19:30,897 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:30,897 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), 2 states have call successors, (3), 2 states have call predecessors, (3), 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 04:19:30,897 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:30,897 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 114 states and 145 transitions. cyclomatic complexity: 35 Stem has 21 letters. Loop has 3 letters. [2022-02-21 04:19:30,897 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:30,897 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 92 states and 121 transitions. cyclomatic complexity: 32 Stem has 21 letters. Loop has 5 letters. [2022-02-21 04:19:30,897 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:30,897 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), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Stem has 21 letters. Loop has 5 letters. [2022-02-21 04:19:30,897 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:30,897 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 114 states and 145 transitions. cyclomatic complexity: 35 Stem has 21 letters. Loop has 5 letters. [2022-02-21 04:19:30,898 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:30,898 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 92 states and 121 transitions. cyclomatic complexity: 32 Stem has 22 letters. Loop has 5 letters. [2022-02-21 04:19:30,898 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:30,898 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), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Stem has 22 letters. Loop has 5 letters. [2022-02-21 04:19:30,898 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:30,898 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 114 states and 145 transitions. cyclomatic complexity: 35 Stem has 22 letters. Loop has 5 letters. [2022-02-21 04:19:30,898 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:30,898 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 92 states and 121 transitions. cyclomatic complexity: 32 Stem has 19 letters. Loop has 3 letters. [2022-02-21 04:19:30,898 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:30,898 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), 2 states have call successors, (3), 2 states have call predecessors, (3), 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 04:19:30,898 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:30,898 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 114 states and 145 transitions. cyclomatic complexity: 35 Stem has 19 letters. Loop has 3 letters. [2022-02-21 04:19:30,898 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:30,898 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 92 states and 121 transitions. cyclomatic complexity: 32 Stem has 23 letters. Loop has 5 letters. [2022-02-21 04:19:30,898 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:30,898 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), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Stem has 23 letters. Loop has 5 letters. [2022-02-21 04:19:30,898 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:30,898 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 114 states and 145 transitions. cyclomatic complexity: 35 Stem has 23 letters. Loop has 5 letters. [2022-02-21 04:19:30,898 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:30,898 INFO L161 tractBuchiDifference]: Finished testing correctness of buchiDifferenceNCSBLazy3 [2022-02-21 04:19:30,899 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), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-21 04:19:30,899 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 48 transitions. [2022-02-21 04:19:30,899 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 48 transitions. Stem has 14 letters. Loop has 3 letters. [2022-02-21 04:19:30,899 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:30,899 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 48 transitions. Stem has 17 letters. Loop has 3 letters. [2022-02-21 04:19:30,899 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:30,900 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 48 transitions. Stem has 14 letters. Loop has 6 letters. [2022-02-21 04:19:30,900 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:30,900 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 114 states and 145 transitions. cyclomatic complexity: 35 [2022-02-21 04:19:30,902 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 28 [2022-02-21 04:19:30,903 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 114 states to 106 states and 137 transitions. [2022-02-21 04:19:30,903 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 99 [2022-02-21 04:19:30,903 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 101 [2022-02-21 04:19:30,903 INFO L73 IsDeterministic]: Start isDeterministic. Operand 106 states and 137 transitions. [2022-02-21 04:19:30,904 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2022-02-21 04:19:30,904 INFO L681 BuchiCegarLoop]: Abstraction has 106 states and 137 transitions. [2022-02-21 04:19:30,904 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 106 states and 137 transitions. [2022-02-21 04:19:30,905 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 106 to 97. [2022-02-21 04:19:30,905 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-21 04:19:30,905 INFO L82 GeneralOperation]: Start isEquivalent. First operand 106 states and 137 transitions. Second operand has 97 states, 71 states have (on average 1.3380281690140845) internal successors, (95), 73 states have internal predecessors, (95), 18 states have call successors, (18), 10 states have call predecessors, (18), 8 states have return successors, (15), 13 states have call predecessors, (15), 13 states have call successors, (15) [2022-02-21 04:19:30,906 INFO L74 IsIncluded]: Start isIncluded. First operand 106 states and 137 transitions. Second operand has 97 states, 71 states have (on average 1.3380281690140845) internal successors, (95), 73 states have internal predecessors, (95), 18 states have call successors, (18), 10 states have call predecessors, (18), 8 states have return successors, (15), 13 states have call predecessors, (15), 13 states have call successors, (15) [2022-02-21 04:19:30,906 INFO L87 Difference]: Start difference. First operand 106 states and 137 transitions. Second operand has 97 states, 71 states have (on average 1.3380281690140845) internal successors, (95), 73 states have internal predecessors, (95), 18 states have call successors, (18), 10 states have call predecessors, (18), 8 states have return successors, (15), 13 states have call predecessors, (15), 13 states have call successors, (15) [2022-02-21 04:19:30,906 INFO L149 Difference]: Subtrahend was not deterministic. Recomputing result with determinization. [2022-02-21 04:19:30,910 INFO L93 Difference]: Finished difference Result 195 states and 251 transitions. [2022-02-21 04:19:30,910 INFO L276 IsEmpty]: Start isEmpty. Operand 195 states and 251 transitions. [2022-02-21 04:19:30,910 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 04:19:30,910 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 04:19:30,911 INFO L74 IsIncluded]: Start isIncluded. First operand has 97 states, 71 states have (on average 1.3380281690140845) internal successors, (95), 73 states have internal predecessors, (95), 18 states have call successors, (18), 10 states have call predecessors, (18), 8 states have return successors, (15), 13 states have call predecessors, (15), 13 states have call successors, (15) Second operand 106 states and 137 transitions. [2022-02-21 04:19:30,911 INFO L87 Difference]: Start difference. First operand has 97 states, 71 states have (on average 1.3380281690140845) internal successors, (95), 73 states have internal predecessors, (95), 18 states have call successors, (18), 10 states have call predecessors, (18), 8 states have return successors, (15), 13 states have call predecessors, (15), 13 states have call successors, (15) Second operand 106 states and 137 transitions. [2022-02-21 04:19:30,911 INFO L149 Difference]: Subtrahend was not deterministic. Recomputing result with determinization. [2022-02-21 04:19:30,915 INFO L93 Difference]: Finished difference Result 214 states and 273 transitions. [2022-02-21 04:19:30,915 INFO L276 IsEmpty]: Start isEmpty. Operand 214 states and 273 transitions. [2022-02-21 04:19:30,916 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 04:19:30,916 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 04:19:30,916 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-21 04:19:30,916 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-21 04:19:30,916 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 97 states, 71 states have (on average 1.3380281690140845) internal successors, (95), 73 states have internal predecessors, (95), 18 states have call successors, (18), 10 states have call predecessors, (18), 8 states have return successors, (15), 13 states have call predecessors, (15), 13 states have call successors, (15) [2022-02-21 04:19:30,917 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 97 states to 97 states and 128 transitions. [2022-02-21 04:19:30,918 INFO L704 BuchiCegarLoop]: Abstraction has 97 states and 128 transitions. [2022-02-21 04:19:30,918 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-21 04:19:30,918 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-02-21 04:19:30,918 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-02-21 04:19:30,918 INFO L87 Difference]: Start difference. First operand 97 states and 128 transitions. Second operand has 7 states, 6 states have (on average 1.8333333333333333) internal successors, (11), 6 states have internal predecessors, (11), 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 04:19:31,062 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 04:19:31,062 INFO L93 Difference]: Finished difference Result 108 states and 139 transitions. [2022-02-21 04:19:31,062 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-02-21 04:19:31,062 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 7 states, 6 states have (on average 1.8333333333333333) internal successors, (11), 6 states have internal predecessors, (11), 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 04:19:31,073 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 14 edges. 14 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-21 04:19:31,074 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 108 states and 139 transitions. [2022-02-21 04:19:31,077 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 28 [2022-02-21 04:19:31,080 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 108 states to 101 states and 131 transitions. [2022-02-21 04:19:31,080 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 98 [2022-02-21 04:19:31,080 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 98 [2022-02-21 04:19:31,080 INFO L73 IsDeterministic]: Start isDeterministic. Operand 101 states and 131 transitions. [2022-02-21 04:19:31,081 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2022-02-21 04:19:31,081 INFO L681 BuchiCegarLoop]: Abstraction has 101 states and 131 transitions. [2022-02-21 04:19:31,081 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 101 states and 131 transitions. [2022-02-21 04:19:31,085 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 101 to 97. [2022-02-21 04:19:31,085 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-21 04:19:31,085 INFO L82 GeneralOperation]: Start isEquivalent. First operand 101 states and 131 transitions. Second operand has 97 states, 71 states have (on average 1.3098591549295775) internal successors, (93), 73 states have internal predecessors, (93), 18 states have call successors, (18), 10 states have call predecessors, (18), 8 states have return successors, (15), 13 states have call predecessors, (15), 13 states have call successors, (15) [2022-02-21 04:19:31,085 INFO L74 IsIncluded]: Start isIncluded. First operand 101 states and 131 transitions. Second operand has 97 states, 71 states have (on average 1.3098591549295775) internal successors, (93), 73 states have internal predecessors, (93), 18 states have call successors, (18), 10 states have call predecessors, (18), 8 states have return successors, (15), 13 states have call predecessors, (15), 13 states have call successors, (15) [2022-02-21 04:19:31,086 INFO L87 Difference]: Start difference. First operand 101 states and 131 transitions. Second operand has 97 states, 71 states have (on average 1.3098591549295775) internal successors, (93), 73 states have internal predecessors, (93), 18 states have call successors, (18), 10 states have call predecessors, (18), 8 states have return successors, (15), 13 states have call predecessors, (15), 13 states have call successors, (15) [2022-02-21 04:19:31,086 INFO L149 Difference]: Subtrahend was not deterministic. Recomputing result with determinization. [2022-02-21 04:19:31,090 INFO L93 Difference]: Finished difference Result 201 states and 256 transitions. [2022-02-21 04:19:31,090 INFO L276 IsEmpty]: Start isEmpty. Operand 201 states and 256 transitions. [2022-02-21 04:19:31,091 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 04:19:31,091 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 04:19:31,091 INFO L74 IsIncluded]: Start isIncluded. First operand has 97 states, 71 states have (on average 1.3098591549295775) internal successors, (93), 73 states have internal predecessors, (93), 18 states have call successors, (18), 10 states have call predecessors, (18), 8 states have return successors, (15), 13 states have call predecessors, (15), 13 states have call successors, (15) Second operand 101 states and 131 transitions. [2022-02-21 04:19:31,091 INFO L87 Difference]: Start difference. First operand has 97 states, 71 states have (on average 1.3098591549295775) internal successors, (93), 73 states have internal predecessors, (93), 18 states have call successors, (18), 10 states have call predecessors, (18), 8 states have return successors, (15), 13 states have call predecessors, (15), 13 states have call successors, (15) Second operand 101 states and 131 transitions. [2022-02-21 04:19:31,092 INFO L149 Difference]: Subtrahend was not deterministic. Recomputing result with determinization. [2022-02-21 04:19:31,098 INFO L93 Difference]: Finished difference Result 201 states and 256 transitions. [2022-02-21 04:19:31,098 INFO L276 IsEmpty]: Start isEmpty. Operand 201 states and 256 transitions. [2022-02-21 04:19:31,098 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 04:19:31,098 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 04:19:31,099 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-21 04:19:31,099 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-21 04:19:31,099 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 97 states, 71 states have (on average 1.3098591549295775) internal successors, (93), 73 states have internal predecessors, (93), 18 states have call successors, (18), 10 states have call predecessors, (18), 8 states have return successors, (15), 13 states have call predecessors, (15), 13 states have call successors, (15) [2022-02-21 04:19:31,100 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 97 states to 97 states and 126 transitions. [2022-02-21 04:19:31,100 INFO L704 BuchiCegarLoop]: Abstraction has 97 states and 126 transitions. [2022-02-21 04:19:31,100 INFO L587 BuchiCegarLoop]: Abstraction has 97 states and 126 transitions. [2022-02-21 04:19:31,101 INFO L425 BuchiCegarLoop]: ======== Iteration 6============ [2022-02-21 04:19:31,101 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 97 states and 126 transitions. [2022-02-21 04:19:31,101 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 28 [2022-02-21 04:19:31,101 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 04:19:31,101 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 04:19:31,101 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-21 04:19:31,102 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2022-02-21 04:19:31,102 INFO L791 eck$LassoCheckResult]: Stem: 7431#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(9, 2);call #Ultimate.allocInit(12, 3); 7405#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet12#1, main_#t~ret13#1, main_#t~nondet14#1, main_#t~nondet15#1, main_#t~ret16#1, main_#t~short17#1, main_~n~0#1, main_~result~0#1, main_~f1~0#1, main_~f2~0#1;main_~n~0#1 := main_#t~nondet12#1;havoc main_#t~nondet12#1; 7406#L78 assume !(main_~n~0#1 < 1 || main_~n~0#1 > 46340);assume { :begin_inline_is_prime } true;is_prime_#in~n#1 := main_~n~0#1;havoc is_prime_#res#1;havoc is_prime_#t~ret9#1, is_prime_~n#1;is_prime_~n#1 := is_prime_#in~n#1; 7437#L53 call is_prime_#t~ret9#1 := is_prime_(is_prime_~n#1, is_prime_~n#1 - 1);< 7447#is_prime_ENTRY ~n := #in~n;~m := #in~m; 7456#L58 assume !(~n <= 1); 7453#L61 assume !(2 == ~n); 7454#L64 assume ~n > 2; 7451#L65 assume !(~m <= 1); 7438#L68 call #t~ret10 := multiple_of(~n, ~m);< 7459#multiple_ofENTRY ~n := #in~n;~m := #in~m; 7476#L32 assume !(~m < 0); 7472#L35 assume ~n < 0; 7394#L36 call #t~ret7 := multiple_of(-~n, ~m);< 7439#multiple_ofENTRY [2022-02-21 04:19:31,102 INFO L793 eck$LassoCheckResult]: Loop: 7439#multiple_ofENTRY ~n := #in~n;~m := #in~m; 7483#L32 assume !(~m < 0); 7481#L35 assume ~n < 0; 7393#L36 call #t~ret7 := multiple_of(-~n, ~m);< 7439#multiple_ofENTRY [2022-02-21 04:19:31,102 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 04:19:31,102 INFO L85 PathProgramCache]: Analyzing trace with hash 1674187120, now seen corresponding path program 1 times [2022-02-21 04:19:31,102 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 04:19:31,103 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1376065937] [2022-02-21 04:19:31,103 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 04:19:31,103 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 04:19:31,123 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 04:19:31,148 INFO L290 TraceCheckUtils]: 0: Hoare triple {8346#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(9, 2);call #Ultimate.allocInit(12, 3); {8346#true} is VALID [2022-02-21 04:19:31,148 INFO L290 TraceCheckUtils]: 1: Hoare triple {8346#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet12#1, main_#t~ret13#1, main_#t~nondet14#1, main_#t~nondet15#1, main_#t~ret16#1, main_#t~short17#1, main_~n~0#1, main_~result~0#1, main_~f1~0#1, main_~f2~0#1;main_~n~0#1 := main_#t~nondet12#1;havoc main_#t~nondet12#1; {8346#true} is VALID [2022-02-21 04:19:31,149 INFO L290 TraceCheckUtils]: 2: Hoare triple {8346#true} assume !(main_~n~0#1 < 1 || main_~n~0#1 > 46340);assume { :begin_inline_is_prime } true;is_prime_#in~n#1 := main_~n~0#1;havoc is_prime_#res#1;havoc is_prime_#t~ret9#1, is_prime_~n#1;is_prime_~n#1 := is_prime_#in~n#1; {8346#true} is VALID [2022-02-21 04:19:31,149 INFO L272 TraceCheckUtils]: 3: Hoare triple {8346#true} call is_prime_#t~ret9#1 := is_prime_(is_prime_~n#1, is_prime_~n#1 - 1); {8346#true} is VALID [2022-02-21 04:19:31,149 INFO L290 TraceCheckUtils]: 4: Hoare triple {8346#true} ~n := #in~n;~m := #in~m; {8346#true} is VALID [2022-02-21 04:19:31,149 INFO L290 TraceCheckUtils]: 5: Hoare triple {8346#true} assume !(~n <= 1); {8348#(<= 2 is_prime__~n)} is VALID [2022-02-21 04:19:31,150 INFO L290 TraceCheckUtils]: 6: Hoare triple {8348#(<= 2 is_prime__~n)} assume !(2 == ~n); {8348#(<= 2 is_prime__~n)} is VALID [2022-02-21 04:19:31,150 INFO L290 TraceCheckUtils]: 7: Hoare triple {8348#(<= 2 is_prime__~n)} assume ~n > 2; {8348#(<= 2 is_prime__~n)} is VALID [2022-02-21 04:19:31,151 INFO L290 TraceCheckUtils]: 8: Hoare triple {8348#(<= 2 is_prime__~n)} assume !(~m <= 1); {8348#(<= 2 is_prime__~n)} is VALID [2022-02-21 04:19:31,152 INFO L272 TraceCheckUtils]: 9: Hoare triple {8348#(<= 2 is_prime__~n)} call #t~ret10 := multiple_of(~n, ~m); {8349#(<= 2 |multiple_of_#in~n|)} is VALID [2022-02-21 04:19:31,153 INFO L290 TraceCheckUtils]: 10: Hoare triple {8349#(<= 2 |multiple_of_#in~n|)} ~n := #in~n;~m := #in~m; {8350#(<= 2 multiple_of_~n)} is VALID [2022-02-21 04:19:31,154 INFO L290 TraceCheckUtils]: 11: Hoare triple {8350#(<= 2 multiple_of_~n)} assume !(~m < 0); {8350#(<= 2 multiple_of_~n)} is VALID [2022-02-21 04:19:31,154 INFO L290 TraceCheckUtils]: 12: Hoare triple {8350#(<= 2 multiple_of_~n)} assume ~n < 0; {8347#false} is VALID [2022-02-21 04:19:31,154 INFO L272 TraceCheckUtils]: 13: Hoare triple {8347#false} call #t~ret7 := multiple_of(-~n, ~m); {8347#false} is VALID [2022-02-21 04:19:31,154 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 04:19:31,154 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-21 04:19:31,155 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1376065937] [2022-02-21 04:19:31,155 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1376065937] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-21 04:19:31,155 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-21 04:19:31,155 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-02-21 04:19:31,155 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1771097981] [2022-02-21 04:19:31,155 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-21 04:19:31,155 INFO L796 eck$LassoCheckResult]: stem already infeasible [2022-02-21 04:19:31,156 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 04:19:31,156 INFO L85 PathProgramCache]: Analyzing trace with hash 929675, now seen corresponding path program 1 times [2022-02-21 04:19:31,156 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 04:19:31,156 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1326438217] [2022-02-21 04:19:31,156 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 04:19:31,156 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 04:19:31,159 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 04:19:31,159 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-02-21 04:19:31,160 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 04:19:31,160 INFO L138 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-02-21 04:19:31,226 INFO L210 LassoAnalysis]: Preferences: [2022-02-21 04:19:31,226 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2022-02-21 04:19:31,226 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2022-02-21 04:19:31,226 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2022-02-21 04:19:31,226 INFO L129 ssoRankerPreferences]: Use exernal solver: true [2022-02-21 04:19:31,226 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 04:19:31,226 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2022-02-21 04:19:31,226 INFO L132 ssoRankerPreferences]: Path of dumped script: [2022-02-21 04:19:31,226 INFO L133 ssoRankerPreferences]: Filename of dumped script: Primes.c_Iteration6_Loop [2022-02-21 04:19:31,226 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2022-02-21 04:19:31,226 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2022-02-21 04:19:31,227 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 04:19:31,231 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 04:19:31,235 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 04:19:31,236 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 04:19:31,238 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 04:19:31,241 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 04:19:31,243 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 04:19:31,244 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 04:19:31,307 INFO L294 LassoAnalysis]: Preprocessing complete. [2022-02-21 04:19:31,307 INFO L404 LassoAnalysis]: Checking for nontermination... [2022-02-21 04:19:31,307 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 04:19:31,307 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 04:19:31,314 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 04:19:31,315 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 04:19:31,316 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2022-02-21 04:19:31,316 INFO L160 nArgumentSynthesizer]: Using integer mode. [2022-02-21 04:19:31,348 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (44)] Ended with exit code 0 [2022-02-21 04:19:31,348 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 04:19:31,348 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 04:19:31,349 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 04:19:31,352 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 04:19:31,353 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2022-02-21 04:19:31,353 INFO L160 nArgumentSynthesizer]: Using integer mode. [2022-02-21 04:19:31,399 INFO L444 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2022-02-21 04:19:31,403 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (45)] Ended with exit code 0 [2022-02-21 04:19:31,403 INFO L210 LassoAnalysis]: Preferences: [2022-02-21 04:19:31,403 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2022-02-21 04:19:31,403 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2022-02-21 04:19:31,403 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2022-02-21 04:19:31,403 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2022-02-21 04:19:31,404 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 04:19:31,404 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2022-02-21 04:19:31,404 INFO L132 ssoRankerPreferences]: Path of dumped script: [2022-02-21 04:19:31,404 INFO L133 ssoRankerPreferences]: Filename of dumped script: Primes.c_Iteration6_Loop [2022-02-21 04:19:31,404 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2022-02-21 04:19:31,404 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2022-02-21 04:19:31,404 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 04:19:31,419 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 04:19:31,423 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 04:19:31,425 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 04:19:31,427 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 04:19:31,429 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 04:19:31,432 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 04:19:31,434 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 04:19:31,502 INFO L294 LassoAnalysis]: Preprocessing complete. [2022-02-21 04:19:31,502 INFO L490 LassoAnalysis]: Using template 'affine'. [2022-02-21 04:19:31,502 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 04:19:31,502 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 04:19:31,505 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 04:19:31,507 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 04:19:31,508 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 04:19:31,515 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 04:19:31,515 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 04:19:31,515 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 04:19:31,515 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 04:19:31,515 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 04:19:31,516 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-02-21 04:19:31,516 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 04:19:31,517 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2022-02-21 04:19:31,519 INFO L443 ModelExtractionUtils]: Simplification made 2 calls to the SMT solver. [2022-02-21 04:19:31,519 INFO L444 ModelExtractionUtils]: 1 out of 3 variables were initially zero. Simplification set additionally 0 variables to zero. [2022-02-21 04:19:31,519 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 04:19:31,519 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 04:19:31,520 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 04:19:31,522 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 04:19:31,522 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2022-02-21 04:19:31,522 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2022-02-21 04:19:31,523 INFO L513 LassoAnalysis]: Proved termination. [2022-02-21 04:19:31,523 INFO L515 LassoAnalysis]: Termination argument consisting of: Ranking function f(multiple_of_#in~n) = -1*multiple_of_#in~n Supporting invariants [] [2022-02-21 04:19:31,545 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (46)] Ended with exit code 0 [2022-02-21 04:19:31,550 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2022-02-21 04:19:31,553 INFO L390 LassoCheck]: Loop: "~n := #in~n;~m := #in~m;" "assume !(~m < 0);" "assume ~n < 0;" "call #t~ret7 := multiple_of(-~n, ~m);"< [2022-02-21 04:19:31,557 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 04:19:31,570 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 04:19:31,599 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 04:19:31,600 INFO L263 TraceCheckSpWp]: Trace formula consists of 148 conjuncts, 8 conjunts are in the unsatisfiable core [2022-02-21 04:19:31,607 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 04:19:31,607 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-21 04:19:31,644 INFO L290 TraceCheckUtils]: 0: Hoare triple {8353#unseeded} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(9, 2);call #Ultimate.allocInit(12, 3); {8353#unseeded} is VALID [2022-02-21 04:19:31,644 INFO L290 TraceCheckUtils]: 1: Hoare triple {8353#unseeded} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet12#1, main_#t~ret13#1, main_#t~nondet14#1, main_#t~nondet15#1, main_#t~ret16#1, main_#t~short17#1, main_~n~0#1, main_~result~0#1, main_~f1~0#1, main_~f2~0#1;main_~n~0#1 := main_#t~nondet12#1;havoc main_#t~nondet12#1; {8353#unseeded} is VALID [2022-02-21 04:19:31,645 INFO L290 TraceCheckUtils]: 2: Hoare triple {8353#unseeded} assume !(main_~n~0#1 < 1 || main_~n~0#1 > 46340);assume { :begin_inline_is_prime } true;is_prime_#in~n#1 := main_~n~0#1;havoc is_prime_#res#1;havoc is_prime_#t~ret9#1, is_prime_~n#1;is_prime_~n#1 := is_prime_#in~n#1; {8353#unseeded} is VALID [2022-02-21 04:19:31,646 INFO L272 TraceCheckUtils]: 3: Hoare triple {8353#unseeded} call is_prime_#t~ret9#1 := is_prime_(is_prime_~n#1, is_prime_~n#1 - 1); {8353#unseeded} is VALID [2022-02-21 04:19:31,646 INFO L290 TraceCheckUtils]: 4: Hoare triple {8353#unseeded} ~n := #in~n;~m := #in~m; {8353#unseeded} is VALID [2022-02-21 04:19:31,646 INFO L290 TraceCheckUtils]: 5: Hoare triple {8353#unseeded} assume !(~n <= 1); {8353#unseeded} is VALID [2022-02-21 04:19:31,647 INFO L290 TraceCheckUtils]: 6: Hoare triple {8353#unseeded} assume !(2 == ~n); {8353#unseeded} is VALID [2022-02-21 04:19:31,647 INFO L290 TraceCheckUtils]: 7: Hoare triple {8353#unseeded} assume ~n > 2; {8353#unseeded} is VALID [2022-02-21 04:19:31,648 INFO L290 TraceCheckUtils]: 8: Hoare triple {8353#unseeded} assume !(~m <= 1); {8353#unseeded} is VALID [2022-02-21 04:19:31,648 INFO L272 TraceCheckUtils]: 9: Hoare triple {8353#unseeded} call #t~ret10 := multiple_of(~n, ~m); {8353#unseeded} is VALID [2022-02-21 04:19:31,648 INFO L290 TraceCheckUtils]: 10: Hoare triple {8353#unseeded} ~n := #in~n;~m := #in~m; {8353#unseeded} is VALID [2022-02-21 04:19:31,649 INFO L290 TraceCheckUtils]: 11: Hoare triple {8353#unseeded} assume !(~m < 0); {8353#unseeded} is VALID [2022-02-21 04:19:31,649 INFO L290 TraceCheckUtils]: 12: Hoare triple {8353#unseeded} assume ~n < 0; {8353#unseeded} is VALID [2022-02-21 04:19:31,649 INFO L272 TraceCheckUtils]: 13: Hoare triple {8353#unseeded} call #t~ret7 := multiple_of(-~n, ~m); {8353#unseeded} is VALID [2022-02-21 04:19:31,672 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 04:19:31,673 INFO L263 TraceCheckSpWp]: Trace formula consists of 42 conjuncts, 7 conjunts are in the unsatisfiable core [2022-02-21 04:19:31,678 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 04:19:31,678 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-21 04:19:31,711 INFO L290 TraceCheckUtils]: 0: Hoare triple {8356#(>= oldRank0 (* (- 1) |multiple_of_#in~n|))} ~n := #in~n;~m := #in~m; {8410#(<= 0 (+ oldRank0 multiple_of_~n))} is VALID [2022-02-21 04:19:31,712 INFO L290 TraceCheckUtils]: 1: Hoare triple {8410#(<= 0 (+ oldRank0 multiple_of_~n))} assume !(~m < 0); {8410#(<= 0 (+ oldRank0 multiple_of_~n))} is VALID [2022-02-21 04:19:31,712 INFO L290 TraceCheckUtils]: 2: Hoare triple {8410#(<= 0 (+ oldRank0 multiple_of_~n))} assume ~n < 0; {8417#(and (<= 0 (+ oldRank0 multiple_of_~n)) (< multiple_of_~n 0))} is VALID [2022-02-21 04:19:31,713 INFO L272 TraceCheckUtils]: 3: Hoare triple {8417#(and (<= 0 (+ oldRank0 multiple_of_~n)) (< multiple_of_~n 0))} call #t~ret7 := multiple_of(-~n, ~m); {8366#(or unseeded (and (>= oldRank0 0) (> oldRank0 (* (- 1) |multiple_of_#in~n|))))} is VALID [2022-02-21 04:19:31,713 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 04:19:31,714 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 4 states, 3 states have (on average 4.666666666666667) internal successors, (14), 3 states have internal predecessors, (14), 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 04:19:31,722 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 18 edges. 18 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-21 04:19:31,722 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 4 states, 3 states have (on average 4.666666666666667) internal successors, (14), 3 states have internal predecessors, (14), 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 4 letters. [2022-02-21 04:19:31,723 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:31,723 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 04:19:31,723 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 97 states and 126 transitions. cyclomatic complexity: 33 Second operand has 4 states, 3 states have (on average 4.666666666666667) internal successors, (14), 3 states have internal predecessors, (14), 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 04:19:31,846 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 97 states and 126 transitions. cyclomatic complexity: 33. Second operand has 4 states, 3 states have (on average 4.666666666666667) internal successors, (14), 3 states have internal predecessors, (14), 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 200 states and 269 transitions. Complement of second has 13 states. [2022-02-21 04:19:31,846 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 04:19:31,846 INFO L123 tractBuchiDifference]: Start testing correctness of buchiDifferenceNCSBLazy3 [2022-02-21 04:19:31,846 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 97 states and 126 transitions. cyclomatic complexity: 33 [2022-02-21 04:19:31,846 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 04:19:31,846 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 04:19:31,846 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 4 states, 3 states have (on average 4.666666666666667) internal successors, (14), 3 states have internal predecessors, (14), 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 04:19:31,847 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2022-02-21 04:19:31,848 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 04:19:31,848 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 04:19:31,848 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 200 states and 269 transitions. [2022-02-21 04:19:31,849 INFO L131 ngComponentsAnalysis]: Automaton has 6 accepting balls. 48 [2022-02-21 04:19:31,849 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 04:19:31,849 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 04:19:31,850 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 97 states and 126 transitions. cyclomatic complexity: 33 [2022-02-21 04:19:31,852 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 29 examples of accepted words. [2022-02-21 04:19:31,852 INFO L70 LassoExtractor]: Start lassoExtractor. Operand has 4 states, 3 states have (on average 4.666666666666667) internal successors, (14), 3 states have internal predecessors, (14), 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 04:19:31,853 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2022-02-21 04:19:31,853 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 1 examples of accepted words. [2022-02-21 04:19:31,853 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 200 states and 269 transitions. cyclomatic complexity: 78 [2022-02-21 04:19:31,861 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 50 examples of accepted words. [2022-02-21 04:19:31,862 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 97 states and 126 transitions. cyclomatic complexity: 33 Stem has 14 letters. Loop has 4 letters. [2022-02-21 04:19:31,862 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:31,862 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 4 states, 3 states have (on average 4.666666666666667) internal successors, (14), 3 states have internal predecessors, (14), 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 4 letters. [2022-02-21 04:19:31,862 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:31,862 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 200 states and 269 transitions. cyclomatic complexity: 78 Stem has 14 letters. Loop has 4 letters. [2022-02-21 04:19:31,863 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:31,863 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 97 states and 126 transitions. cyclomatic complexity: 33 Stem has 1 letters. Loop has 3 letters. [2022-02-21 04:19:31,863 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:31,863 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 4 states, 3 states have (on average 4.666666666666667) internal successors, (14), 3 states have internal predecessors, (14), 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 04:19:31,863 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:31,863 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 200 states and 269 transitions. cyclomatic complexity: 78 Stem has 1 letters. Loop has 3 letters. [2022-02-21 04:19:31,863 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:31,863 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 97 states and 126 transitions. cyclomatic complexity: 33 Stem has 16 letters. Loop has 6 letters. [2022-02-21 04:19:31,863 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:31,863 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 4 states, 3 states have (on average 4.666666666666667) internal successors, (14), 3 states have internal predecessors, (14), 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 6 letters. [2022-02-21 04:19:31,864 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:31,864 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 200 states and 269 transitions. cyclomatic complexity: 78 Stem has 16 letters. Loop has 6 letters. [2022-02-21 04:19:31,864 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:31,864 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 97 states and 126 transitions. cyclomatic complexity: 33 Stem has 200 letters. Loop has 200 letters. [2022-02-21 04:19:31,864 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:31,864 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 4 states, 3 states have (on average 4.666666666666667) internal successors, (14), 3 states have internal predecessors, (14), 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 200 letters. Loop has 200 letters. [2022-02-21 04:19:31,864 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:31,864 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 200 states and 269 transitions. cyclomatic complexity: 78 Stem has 200 letters. Loop has 200 letters. [2022-02-21 04:19:31,865 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:31,865 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 97 states and 126 transitions. cyclomatic complexity: 33 Stem has 97 letters. Loop has 97 letters. [2022-02-21 04:19:31,866 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:31,866 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 4 states, 3 states have (on average 4.666666666666667) internal successors, (14), 3 states have internal predecessors, (14), 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 97 letters. Loop has 97 letters. [2022-02-21 04:19:31,867 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:31,867 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 200 states and 269 transitions. cyclomatic complexity: 78 Stem has 97 letters. Loop has 97 letters. [2022-02-21 04:19:31,867 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:31,867 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 97 states and 126 transitions. cyclomatic complexity: 33 Stem has 4 letters. Loop has 4 letters. [2022-02-21 04:19:31,867 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:31,867 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 4 states, 3 states have (on average 4.666666666666667) internal successors, (14), 3 states have internal predecessors, (14), 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 04:19:31,867 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:31,867 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 200 states and 269 transitions. cyclomatic complexity: 78 Stem has 4 letters. Loop has 4 letters. [2022-02-21 04:19:31,867 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:31,868 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 97 states and 126 transitions. cyclomatic complexity: 33 Stem has 17 letters. Loop has 4 letters. [2022-02-21 04:19:31,868 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:31,868 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 4 states, 3 states have (on average 4.666666666666667) internal successors, (14), 3 states have internal predecessors, (14), 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 17 letters. Loop has 4 letters. [2022-02-21 04:19:31,868 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:31,868 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 200 states and 269 transitions. cyclomatic complexity: 78 Stem has 17 letters. Loop has 4 letters. [2022-02-21 04:19:31,868 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:31,868 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 97 states and 126 transitions. cyclomatic complexity: 33 Stem has 19 letters. Loop has 10 letters. [2022-02-21 04:19:31,868 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:31,868 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 4 states, 3 states have (on average 4.666666666666667) internal successors, (14), 3 states have internal predecessors, (14), 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 19 letters. Loop has 10 letters. [2022-02-21 04:19:31,869 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:31,869 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 200 states and 269 transitions. cyclomatic complexity: 78 Stem has 19 letters. Loop has 10 letters. [2022-02-21 04:19:31,869 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:31,869 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 97 states and 126 transitions. cyclomatic complexity: 33 Stem has 19 letters. Loop has 10 letters. [2022-02-21 04:19:31,869 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:31,869 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 4 states, 3 states have (on average 4.666666666666667) internal successors, (14), 3 states have internal predecessors, (14), 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 19 letters. Loop has 10 letters. [2022-02-21 04:19:31,869 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:31,869 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 200 states and 269 transitions. cyclomatic complexity: 78 Stem has 19 letters. Loop has 10 letters. [2022-02-21 04:19:31,870 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:31,870 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 97 states and 126 transitions. cyclomatic complexity: 33 Stem has 21 letters. Loop has 6 letters. [2022-02-21 04:19:31,870 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:31,870 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 4 states, 3 states have (on average 4.666666666666667) internal successors, (14), 3 states have internal predecessors, (14), 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 6 letters. [2022-02-21 04:19:31,870 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:31,870 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 200 states and 269 transitions. cyclomatic complexity: 78 Stem has 21 letters. Loop has 6 letters. [2022-02-21 04:19:31,870 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:31,870 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 97 states and 126 transitions. cyclomatic complexity: 33 Stem has 14 letters. Loop has 4 letters. [2022-02-21 04:19:31,870 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:31,871 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 4 states, 3 states have (on average 4.666666666666667) internal successors, (14), 3 states have internal predecessors, (14), 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 4 letters. [2022-02-21 04:19:31,871 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:31,871 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 200 states and 269 transitions. cyclomatic complexity: 78 Stem has 14 letters. Loop has 4 letters. [2022-02-21 04:19:31,871 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:31,871 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 97 states and 126 transitions. cyclomatic complexity: 33 Stem has 18 letters. Loop has 10 letters. [2022-02-21 04:19:31,871 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:31,871 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 4 states, 3 states have (on average 4.666666666666667) internal successors, (14), 3 states have internal predecessors, (14), 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 18 letters. Loop has 10 letters. [2022-02-21 04:19:31,871 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:31,871 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 200 states and 269 transitions. cyclomatic complexity: 78 Stem has 18 letters. Loop has 10 letters. [2022-02-21 04:19:31,872 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:31,872 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 97 states and 126 transitions. cyclomatic complexity: 33 Stem has 20 letters. Loop has 6 letters. [2022-02-21 04:19:31,872 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:31,872 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 4 states, 3 states have (on average 4.666666666666667) internal successors, (14), 3 states have internal predecessors, (14), 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 20 letters. Loop has 6 letters. [2022-02-21 04:19:31,872 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:31,872 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 200 states and 269 transitions. cyclomatic complexity: 78 Stem has 20 letters. Loop has 6 letters. [2022-02-21 04:19:31,872 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:31,872 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 97 states and 126 transitions. cyclomatic complexity: 33 Stem has 17 letters. Loop has 10 letters. [2022-02-21 04:19:31,873 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:31,873 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 4 states, 3 states have (on average 4.666666666666667) internal successors, (14), 3 states have internal predecessors, (14), 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 17 letters. Loop has 10 letters. [2022-02-21 04:19:31,873 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:31,873 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 200 states and 269 transitions. cyclomatic complexity: 78 Stem has 17 letters. Loop has 10 letters. [2022-02-21 04:19:31,873 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:31,873 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 97 states and 126 transitions. cyclomatic complexity: 33 Stem has 19 letters. Loop has 6 letters. [2022-02-21 04:19:31,873 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:31,873 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 4 states, 3 states have (on average 4.666666666666667) internal successors, (14), 3 states have internal predecessors, (14), 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 19 letters. Loop has 6 letters. [2022-02-21 04:19:31,873 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:31,874 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 200 states and 269 transitions. cyclomatic complexity: 78 Stem has 19 letters. Loop has 6 letters. [2022-02-21 04:19:31,874 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:31,874 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 97 states and 126 transitions. cyclomatic complexity: 33 Stem has 16 letters. Loop has 4 letters. [2022-02-21 04:19:31,874 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:31,874 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 4 states, 3 states have (on average 4.666666666666667) internal successors, (14), 3 states have internal predecessors, (14), 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 4 letters. [2022-02-21 04:19:31,874 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:31,874 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 200 states and 269 transitions. cyclomatic complexity: 78 Stem has 16 letters. Loop has 4 letters. [2022-02-21 04:19:31,874 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:31,874 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 97 states and 126 transitions. cyclomatic complexity: 33 Stem has 18 letters. Loop has 6 letters. [2022-02-21 04:19:31,875 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:31,875 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 4 states, 3 states have (on average 4.666666666666667) internal successors, (14), 3 states have internal predecessors, (14), 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 18 letters. Loop has 6 letters. [2022-02-21 04:19:31,875 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:31,875 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 200 states and 269 transitions. cyclomatic complexity: 78 Stem has 18 letters. Loop has 6 letters. [2022-02-21 04:19:31,875 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:31,875 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 97 states and 126 transitions. cyclomatic complexity: 33 Stem has 16 letters. Loop has 6 letters. [2022-02-21 04:19:31,875 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:31,875 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 4 states, 3 states have (on average 4.666666666666667) internal successors, (14), 3 states have internal predecessors, (14), 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 6 letters. [2022-02-21 04:19:31,875 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:31,876 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 200 states and 269 transitions. cyclomatic complexity: 78 Stem has 16 letters. Loop has 6 letters. [2022-02-21 04:19:31,876 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:31,876 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 97 states and 126 transitions. cyclomatic complexity: 33 Stem has 15 letters. Loop has 4 letters. [2022-02-21 04:19:31,876 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:31,876 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 4 states, 3 states have (on average 4.666666666666667) internal successors, (14), 3 states have internal predecessors, (14), 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 4 letters. [2022-02-21 04:19:31,876 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:31,876 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 200 states and 269 transitions. cyclomatic complexity: 78 Stem has 15 letters. Loop has 4 letters. [2022-02-21 04:19:31,876 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:31,876 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 97 states and 126 transitions. cyclomatic complexity: 33 Stem has 17 letters. Loop has 6 letters. [2022-02-21 04:19:31,877 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:31,877 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 4 states, 3 states have (on average 4.666666666666667) internal successors, (14), 3 states have internal predecessors, (14), 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 17 letters. Loop has 6 letters. [2022-02-21 04:19:31,877 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:31,877 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 200 states and 269 transitions. cyclomatic complexity: 78 Stem has 17 letters. Loop has 6 letters. [2022-02-21 04:19:31,877 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:31,877 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 97 states and 126 transitions. cyclomatic complexity: 33 Stem has 72 letters. Loop has 33 letters. [2022-02-21 04:19:31,877 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:31,878 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 4 states, 3 states have (on average 4.666666666666667) internal successors, (14), 3 states have internal predecessors, (14), 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 72 letters. Loop has 33 letters. [2022-02-21 04:19:31,878 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:31,878 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 200 states and 269 transitions. cyclomatic complexity: 78 Stem has 72 letters. Loop has 33 letters. [2022-02-21 04:19:31,878 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:31,878 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 97 states and 126 transitions. cyclomatic complexity: 33 Stem has 73 letters. Loop has 33 letters. [2022-02-21 04:19:31,878 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:31,878 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 4 states, 3 states have (on average 4.666666666666667) internal successors, (14), 3 states have internal predecessors, (14), 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 73 letters. Loop has 33 letters. [2022-02-21 04:19:31,879 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:31,879 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 200 states and 269 transitions. cyclomatic complexity: 78 Stem has 73 letters. Loop has 33 letters. [2022-02-21 04:19:31,879 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:31,879 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 97 states and 126 transitions. cyclomatic complexity: 33 Stem has 74 letters. Loop has 33 letters. [2022-02-21 04:19:31,879 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:31,879 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 4 states, 3 states have (on average 4.666666666666667) internal successors, (14), 3 states have internal predecessors, (14), 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 74 letters. Loop has 33 letters. [2022-02-21 04:19:31,879 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:31,880 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 200 states and 269 transitions. cyclomatic complexity: 78 Stem has 74 letters. Loop has 33 letters. [2022-02-21 04:19:31,880 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:31,880 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 97 states and 126 transitions. cyclomatic complexity: 33 Stem has 101 letters. Loop has 33 letters. [2022-02-21 04:19:31,880 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:31,880 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 4 states, 3 states have (on average 4.666666666666667) internal successors, (14), 3 states have internal predecessors, (14), 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 101 letters. Loop has 33 letters. [2022-02-21 04:19:31,880 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:31,880 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 200 states and 269 transitions. cyclomatic complexity: 78 Stem has 101 letters. Loop has 33 letters. [2022-02-21 04:19:31,881 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:31,881 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 97 states and 126 transitions. cyclomatic complexity: 33 Stem has 102 letters. Loop has 33 letters. [2022-02-21 04:19:31,881 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:31,881 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 4 states, 3 states have (on average 4.666666666666667) internal successors, (14), 3 states have internal predecessors, (14), 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 102 letters. Loop has 33 letters. [2022-02-21 04:19:31,882 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:31,882 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 200 states and 269 transitions. cyclomatic complexity: 78 Stem has 102 letters. Loop has 33 letters. [2022-02-21 04:19:31,882 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:31,882 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 97 states and 126 transitions. cyclomatic complexity: 33 Stem has 71 letters. Loop has 33 letters. [2022-02-21 04:19:31,882 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:31,882 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 4 states, 3 states have (on average 4.666666666666667) internal successors, (14), 3 states have internal predecessors, (14), 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 71 letters. Loop has 33 letters. [2022-02-21 04:19:31,883 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:31,883 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 200 states and 269 transitions. cyclomatic complexity: 78 Stem has 71 letters. Loop has 33 letters. [2022-02-21 04:19:31,883 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:31,883 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 97 states and 126 transitions. cyclomatic complexity: 33 Stem has 70 letters. Loop has 33 letters. [2022-02-21 04:19:31,883 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:31,883 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 4 states, 3 states have (on average 4.666666666666667) internal successors, (14), 3 states have internal predecessors, (14), 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 70 letters. Loop has 33 letters. [2022-02-21 04:19:31,884 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:31,884 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 200 states and 269 transitions. cyclomatic complexity: 78 Stem has 70 letters. Loop has 33 letters. [2022-02-21 04:19:31,884 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:31,884 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 97 states and 126 transitions. cyclomatic complexity: 33 Stem has 75 letters. Loop has 33 letters. [2022-02-21 04:19:31,884 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:31,884 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 4 states, 3 states have (on average 4.666666666666667) internal successors, (14), 3 states have internal predecessors, (14), 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 75 letters. Loop has 33 letters. [2022-02-21 04:19:31,884 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:31,884 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 200 states and 269 transitions. cyclomatic complexity: 78 Stem has 75 letters. Loop has 33 letters. [2022-02-21 04:19:31,885 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:31,885 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 97 states and 126 transitions. cyclomatic complexity: 33 Stem has 101 letters. Loop has 33 letters. [2022-02-21 04:19:31,885 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:31,885 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 4 states, 3 states have (on average 4.666666666666667) internal successors, (14), 3 states have internal predecessors, (14), 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 101 letters. Loop has 33 letters. [2022-02-21 04:19:31,885 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:31,885 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 200 states and 269 transitions. cyclomatic complexity: 78 Stem has 101 letters. Loop has 33 letters. [2022-02-21 04:19:31,885 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:31,886 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 97 states and 126 transitions. cyclomatic complexity: 33 Stem has 18 letters. Loop has 5 letters. [2022-02-21 04:19:31,886 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:31,886 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 4 states, 3 states have (on average 4.666666666666667) internal successors, (14), 3 states have internal predecessors, (14), 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 18 letters. Loop has 5 letters. [2022-02-21 04:19:31,886 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:31,886 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 200 states and 269 transitions. cyclomatic complexity: 78 Stem has 18 letters. Loop has 5 letters. [2022-02-21 04:19:31,886 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:31,886 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 97 states and 126 transitions. cyclomatic complexity: 33 Stem has 19 letters. Loop has 5 letters. [2022-02-21 04:19:31,886 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:31,886 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 4 states, 3 states have (on average 4.666666666666667) internal successors, (14), 3 states have internal predecessors, (14), 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 19 letters. Loop has 5 letters. [2022-02-21 04:19:31,887 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:31,887 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 200 states and 269 transitions. cyclomatic complexity: 78 Stem has 19 letters. Loop has 5 letters. [2022-02-21 04:19:31,887 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:31,887 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 97 states and 126 transitions. cyclomatic complexity: 33 Stem has 17 letters. Loop has 5 letters. [2022-02-21 04:19:31,887 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:31,887 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 4 states, 3 states have (on average 4.666666666666667) internal successors, (14), 3 states have internal predecessors, (14), 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 17 letters. Loop has 5 letters. [2022-02-21 04:19:31,887 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:31,887 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 200 states and 269 transitions. cyclomatic complexity: 78 Stem has 17 letters. Loop has 5 letters. [2022-02-21 04:19:31,887 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:31,888 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 97 states and 126 transitions. cyclomatic complexity: 33 Stem has 22 letters. Loop has 3 letters. [2022-02-21 04:19:31,888 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:31,888 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 4 states, 3 states have (on average 4.666666666666667) internal successors, (14), 3 states have internal predecessors, (14), 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 22 letters. Loop has 3 letters. [2022-02-21 04:19:31,888 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:31,888 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 200 states and 269 transitions. cyclomatic complexity: 78 Stem has 22 letters. Loop has 3 letters. [2022-02-21 04:19:31,888 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:31,888 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 97 states and 126 transitions. cyclomatic complexity: 33 Stem has 20 letters. Loop has 3 letters. [2022-02-21 04:19:31,888 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:31,888 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 4 states, 3 states have (on average 4.666666666666667) internal successors, (14), 3 states have internal predecessors, (14), 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 20 letters. Loop has 3 letters. [2022-02-21 04:19:31,889 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:31,889 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 200 states and 269 transitions. cyclomatic complexity: 78 Stem has 20 letters. Loop has 3 letters. [2022-02-21 04:19:31,889 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:31,889 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 97 states and 126 transitions. cyclomatic complexity: 33 Stem has 21 letters. Loop has 3 letters. [2022-02-21 04:19:31,889 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:31,889 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 4 states, 3 states have (on average 4.666666666666667) internal successors, (14), 3 states have internal predecessors, (14), 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 3 letters. [2022-02-21 04:19:31,889 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:31,889 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 200 states and 269 transitions. cyclomatic complexity: 78 Stem has 21 letters. Loop has 3 letters. [2022-02-21 04:19:31,890 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:31,890 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 97 states and 126 transitions. cyclomatic complexity: 33 Stem has 1 letters. Loop has 3 letters. [2022-02-21 04:19:31,890 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:31,890 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 4 states, 3 states have (on average 4.666666666666667) internal successors, (14), 3 states have internal predecessors, (14), 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 04:19:31,890 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:31,890 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 200 states and 269 transitions. cyclomatic complexity: 78 Stem has 1 letters. Loop has 3 letters. [2022-02-21 04:19:31,890 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:31,890 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 97 states and 126 transitions. cyclomatic complexity: 33 Stem has 22 letters. Loop has 6 letters. [2022-02-21 04:19:31,890 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:31,890 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 4 states, 3 states have (on average 4.666666666666667) internal successors, (14), 3 states have internal predecessors, (14), 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 22 letters. Loop has 6 letters. [2022-02-21 04:19:31,891 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:31,891 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 200 states and 269 transitions. cyclomatic complexity: 78 Stem has 22 letters. Loop has 6 letters. [2022-02-21 04:19:31,891 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:31,891 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 97 states and 126 transitions. cyclomatic complexity: 33 Stem has 23 letters. Loop has 10 letters. [2022-02-21 04:19:31,891 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:31,891 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 4 states, 3 states have (on average 4.666666666666667) internal successors, (14), 3 states have internal predecessors, (14), 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 23 letters. Loop has 10 letters. [2022-02-21 04:19:31,891 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:31,891 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 200 states and 269 transitions. cyclomatic complexity: 78 Stem has 23 letters. Loop has 10 letters. [2022-02-21 04:19:31,891 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:31,892 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 97 states and 126 transitions. cyclomatic complexity: 33 Stem has 23 letters. Loop has 6 letters. [2022-02-21 04:19:31,892 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:31,892 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 4 states, 3 states have (on average 4.666666666666667) internal successors, (14), 3 states have internal predecessors, (14), 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 23 letters. Loop has 6 letters. [2022-02-21 04:19:31,892 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:31,892 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 200 states and 269 transitions. cyclomatic complexity: 78 Stem has 23 letters. Loop has 6 letters. [2022-02-21 04:19:31,892 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:31,892 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 97 states and 126 transitions. cyclomatic complexity: 33 Stem has 24 letters. Loop has 4 letters. [2022-02-21 04:19:31,892 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:31,892 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 4 states, 3 states have (on average 4.666666666666667) internal successors, (14), 3 states have internal predecessors, (14), 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 24 letters. Loop has 4 letters. [2022-02-21 04:19:31,893 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:31,893 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 200 states and 269 transitions. cyclomatic complexity: 78 Stem has 24 letters. Loop has 4 letters. [2022-02-21 04:19:31,893 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:31,893 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 97 states and 126 transitions. cyclomatic complexity: 33 Stem has 24 letters. Loop has 6 letters. [2022-02-21 04:19:31,893 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:31,893 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 4 states, 3 states have (on average 4.666666666666667) internal successors, (14), 3 states have internal predecessors, (14), 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 24 letters. Loop has 6 letters. [2022-02-21 04:19:31,893 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:31,893 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 200 states and 269 transitions. cyclomatic complexity: 78 Stem has 24 letters. Loop has 6 letters. [2022-02-21 04:19:31,893 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:31,894 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 97 states and 126 transitions. cyclomatic complexity: 33 Stem has 25 letters. Loop has 4 letters. [2022-02-21 04:19:31,894 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:31,897 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 4 states, 3 states have (on average 4.666666666666667) internal successors, (14), 3 states have internal predecessors, (14), 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 25 letters. Loop has 4 letters. [2022-02-21 04:19:31,897 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:31,897 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 200 states and 269 transitions. cyclomatic complexity: 78 Stem has 25 letters. Loop has 4 letters. [2022-02-21 04:19:31,897 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:31,898 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 97 states and 126 transitions. cyclomatic complexity: 33 Stem has 25 letters. Loop has 6 letters. [2022-02-21 04:19:31,898 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:31,898 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 4 states, 3 states have (on average 4.666666666666667) internal successors, (14), 3 states have internal predecessors, (14), 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 25 letters. Loop has 6 letters. [2022-02-21 04:19:31,898 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:31,898 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 200 states and 269 transitions. cyclomatic complexity: 78 Stem has 25 letters. Loop has 6 letters. [2022-02-21 04:19:31,898 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:31,898 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 97 states and 126 transitions. cyclomatic complexity: 33 Stem has 26 letters. Loop has 4 letters. [2022-02-21 04:19:31,898 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:31,899 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 4 states, 3 states have (on average 4.666666666666667) internal successors, (14), 3 states have internal predecessors, (14), 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 26 letters. Loop has 4 letters. [2022-02-21 04:19:31,899 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:31,899 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 200 states and 269 transitions. cyclomatic complexity: 78 Stem has 26 letters. Loop has 4 letters. [2022-02-21 04:19:31,899 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:31,899 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 97 states and 126 transitions. cyclomatic complexity: 33 Stem has 20 letters. Loop has 6 letters. [2022-02-21 04:19:31,899 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:31,899 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 4 states, 3 states have (on average 4.666666666666667) internal successors, (14), 3 states have internal predecessors, (14), 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 20 letters. Loop has 6 letters. [2022-02-21 04:19:31,899 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:31,899 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 200 states and 269 transitions. cyclomatic complexity: 78 Stem has 20 letters. Loop has 6 letters. [2022-02-21 04:19:31,900 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:31,900 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 97 states and 126 transitions. cyclomatic complexity: 33 Stem has 27 letters. Loop has 4 letters. [2022-02-21 04:19:31,900 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:31,900 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 4 states, 3 states have (on average 4.666666666666667) internal successors, (14), 3 states have internal predecessors, (14), 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 27 letters. Loop has 4 letters. [2022-02-21 04:19:31,900 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:31,900 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 200 states and 269 transitions. cyclomatic complexity: 78 Stem has 27 letters. Loop has 4 letters. [2022-02-21 04:19:31,900 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:31,900 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 97 states and 126 transitions. cyclomatic complexity: 33 Stem has 27 letters. Loop has 10 letters. [2022-02-21 04:19:31,900 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:31,901 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 4 states, 3 states have (on average 4.666666666666667) internal successors, (14), 3 states have internal predecessors, (14), 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 27 letters. Loop has 10 letters. [2022-02-21 04:19:31,901 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:31,901 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 200 states and 269 transitions. cyclomatic complexity: 78 Stem has 27 letters. Loop has 10 letters. [2022-02-21 04:19:31,901 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:31,901 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 97 states and 126 transitions. cyclomatic complexity: 33 Stem has 28 letters. Loop has 10 letters. [2022-02-21 04:19:31,901 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:31,901 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 4 states, 3 states have (on average 4.666666666666667) internal successors, (14), 3 states have internal predecessors, (14), 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 28 letters. Loop has 10 letters. [2022-02-21 04:19:31,901 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:31,901 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 200 states and 269 transitions. cyclomatic complexity: 78 Stem has 28 letters. Loop has 10 letters. [2022-02-21 04:19:31,902 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:31,902 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 97 states and 126 transitions. cyclomatic complexity: 33 Stem has 29 letters. Loop has 10 letters. [2022-02-21 04:19:31,902 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:31,902 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 4 states, 3 states have (on average 4.666666666666667) internal successors, (14), 3 states have internal predecessors, (14), 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 29 letters. Loop has 10 letters. [2022-02-21 04:19:31,902 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:31,902 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 200 states and 269 transitions. cyclomatic complexity: 78 Stem has 29 letters. Loop has 10 letters. [2022-02-21 04:19:31,902 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:31,903 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 97 states and 126 transitions. cyclomatic complexity: 33 Stem has 21 letters. Loop has 6 letters. [2022-02-21 04:19:31,904 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:31,904 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 4 states, 3 states have (on average 4.666666666666667) internal successors, (14), 3 states have internal predecessors, (14), 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 6 letters. [2022-02-21 04:19:31,904 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:31,904 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 200 states and 269 transitions. cyclomatic complexity: 78 Stem has 21 letters. Loop has 6 letters. [2022-02-21 04:19:31,904 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:31,904 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 97 states and 126 transitions. cyclomatic complexity: 33 Stem has 18 letters. Loop has 6 letters. [2022-02-21 04:19:31,904 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:31,905 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 4 states, 3 states have (on average 4.666666666666667) internal successors, (14), 3 states have internal predecessors, (14), 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 18 letters. Loop has 6 letters. [2022-02-21 04:19:31,905 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:31,905 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 200 states and 269 transitions. cyclomatic complexity: 78 Stem has 18 letters. Loop has 6 letters. [2022-02-21 04:19:31,905 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:31,905 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 97 states and 126 transitions. cyclomatic complexity: 33 Stem has 20 letters. Loop has 6 letters. [2022-02-21 04:19:31,905 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:31,905 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 4 states, 3 states have (on average 4.666666666666667) internal successors, (14), 3 states have internal predecessors, (14), 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 20 letters. Loop has 6 letters. [2022-02-21 04:19:31,905 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:31,905 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 200 states and 269 transitions. cyclomatic complexity: 78 Stem has 20 letters. Loop has 6 letters. [2022-02-21 04:19:31,906 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:31,906 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 97 states and 126 transitions. cyclomatic complexity: 33 Stem has 17 letters. Loop has 6 letters. [2022-02-21 04:19:31,906 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:31,906 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 4 states, 3 states have (on average 4.666666666666667) internal successors, (14), 3 states have internal predecessors, (14), 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 17 letters. Loop has 6 letters. [2022-02-21 04:19:31,906 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:31,906 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 200 states and 269 transitions. cyclomatic complexity: 78 Stem has 17 letters. Loop has 6 letters. [2022-02-21 04:19:31,906 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:31,906 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 97 states and 126 transitions. cyclomatic complexity: 33 Stem has 19 letters. Loop has 6 letters. [2022-02-21 04:19:31,906 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:31,907 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 4 states, 3 states have (on average 4.666666666666667) internal successors, (14), 3 states have internal predecessors, (14), 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 19 letters. Loop has 6 letters. [2022-02-21 04:19:31,907 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:31,907 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 200 states and 269 transitions. cyclomatic complexity: 78 Stem has 19 letters. Loop has 6 letters. [2022-02-21 04:19:31,907 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:31,907 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 97 states and 126 transitions. cyclomatic complexity: 33 Stem has 21 letters. Loop has 6 letters. [2022-02-21 04:19:31,907 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:31,907 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 4 states, 3 states have (on average 4.666666666666667) internal successors, (14), 3 states have internal predecessors, (14), 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 6 letters. [2022-02-21 04:19:31,907 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:31,907 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 200 states and 269 transitions. cyclomatic complexity: 78 Stem has 21 letters. Loop has 6 letters. [2022-02-21 04:19:31,908 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:31,908 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 97 states and 126 transitions. cyclomatic complexity: 33 Stem has 16 letters. Loop has 6 letters. [2022-02-21 04:19:31,908 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:31,908 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 4 states, 3 states have (on average 4.666666666666667) internal successors, (14), 3 states have internal predecessors, (14), 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 6 letters. [2022-02-21 04:19:31,908 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:31,908 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 200 states and 269 transitions. cyclomatic complexity: 78 Stem has 16 letters. Loop has 6 letters. [2022-02-21 04:19:31,908 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:31,908 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 97 states and 126 transitions. cyclomatic complexity: 33 Stem has 77 letters. Loop has 33 letters. [2022-02-21 04:19:31,909 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:31,909 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 4 states, 3 states have (on average 4.666666666666667) internal successors, (14), 3 states have internal predecessors, (14), 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 77 letters. Loop has 33 letters. [2022-02-21 04:19:31,909 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:31,909 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 200 states and 269 transitions. cyclomatic complexity: 78 Stem has 77 letters. Loop has 33 letters. [2022-02-21 04:19:31,909 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:31,909 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 97 states and 126 transitions. cyclomatic complexity: 33 Stem has 78 letters. Loop has 33 letters. [2022-02-21 04:19:31,909 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:31,909 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 4 states, 3 states have (on average 4.666666666666667) internal successors, (14), 3 states have internal predecessors, (14), 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 78 letters. Loop has 33 letters. [2022-02-21 04:19:31,910 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:31,910 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 200 states and 269 transitions. cyclomatic complexity: 78 Stem has 78 letters. Loop has 33 letters. [2022-02-21 04:19:31,910 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:31,910 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 97 states and 126 transitions. cyclomatic complexity: 33 Stem has 79 letters. Loop has 33 letters. [2022-02-21 04:19:31,910 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:31,910 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 4 states, 3 states have (on average 4.666666666666667) internal successors, (14), 3 states have internal predecessors, (14), 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 79 letters. Loop has 33 letters. [2022-02-21 04:19:31,910 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:31,910 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 200 states and 269 transitions. cyclomatic complexity: 78 Stem has 79 letters. Loop has 33 letters. [2022-02-21 04:19:31,911 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:31,911 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 97 states and 126 transitions. cyclomatic complexity: 33 Stem has 80 letters. Loop has 33 letters. [2022-02-21 04:19:31,911 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:31,911 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 4 states, 3 states have (on average 4.666666666666667) internal successors, (14), 3 states have internal predecessors, (14), 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 80 letters. Loop has 33 letters. [2022-02-21 04:19:31,911 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:31,911 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 200 states and 269 transitions. cyclomatic complexity: 78 Stem has 80 letters. Loop has 33 letters. [2022-02-21 04:19:31,911 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:31,912 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 97 states and 126 transitions. cyclomatic complexity: 33 Stem has 81 letters. Loop has 33 letters. [2022-02-21 04:19:31,912 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:31,912 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 4 states, 3 states have (on average 4.666666666666667) internal successors, (14), 3 states have internal predecessors, (14), 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 81 letters. Loop has 33 letters. [2022-02-21 04:19:31,912 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:31,912 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 200 states and 269 transitions. cyclomatic complexity: 78 Stem has 81 letters. Loop has 33 letters. [2022-02-21 04:19:31,912 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:31,912 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 97 states and 126 transitions. cyclomatic complexity: 33 Stem has 108 letters. Loop has 33 letters. [2022-02-21 04:19:31,912 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:31,913 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 4 states, 3 states have (on average 4.666666666666667) internal successors, (14), 3 states have internal predecessors, (14), 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 108 letters. Loop has 33 letters. [2022-02-21 04:19:31,913 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:31,913 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 200 states and 269 transitions. cyclomatic complexity: 78 Stem has 108 letters. Loop has 33 letters. [2022-02-21 04:19:31,913 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:31,913 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 97 states and 126 transitions. cyclomatic complexity: 33 Stem has 82 letters. Loop has 33 letters. [2022-02-21 04:19:31,913 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:31,913 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 4 states, 3 states have (on average 4.666666666666667) internal successors, (14), 3 states have internal predecessors, (14), 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 82 letters. Loop has 33 letters. [2022-02-21 04:19:31,914 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:31,914 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 200 states and 269 transitions. cyclomatic complexity: 78 Stem has 82 letters. Loop has 33 letters. [2022-02-21 04:19:31,914 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:31,914 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 97 states and 126 transitions. cyclomatic complexity: 33 Stem has 109 letters. Loop has 33 letters. [2022-02-21 04:19:31,914 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:31,914 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 4 states, 3 states have (on average 4.666666666666667) internal successors, (14), 3 states have internal predecessors, (14), 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 33 letters. [2022-02-21 04:19:31,914 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:31,914 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 200 states and 269 transitions. cyclomatic complexity: 78 Stem has 109 letters. Loop has 33 letters. [2022-02-21 04:19:31,915 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:31,915 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 97 states and 126 transitions. cyclomatic complexity: 33 Stem has 108 letters. Loop has 33 letters. [2022-02-21 04:19:31,915 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:31,915 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 4 states, 3 states have (on average 4.666666666666667) internal successors, (14), 3 states have internal predecessors, (14), 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 108 letters. Loop has 33 letters. [2022-02-21 04:19:31,915 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:31,915 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 200 states and 269 transitions. cyclomatic complexity: 78 Stem has 108 letters. Loop has 33 letters. [2022-02-21 04:19:31,915 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:31,916 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 97 states and 126 transitions. cyclomatic complexity: 33 Stem has 70 letters. Loop has 33 letters. [2022-02-21 04:19:31,916 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:31,916 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 4 states, 3 states have (on average 4.666666666666667) internal successors, (14), 3 states have internal predecessors, (14), 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 70 letters. Loop has 33 letters. [2022-02-21 04:19:31,916 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:31,916 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 200 states and 269 transitions. cyclomatic complexity: 78 Stem has 70 letters. Loop has 33 letters. [2022-02-21 04:19:31,916 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:31,916 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 97 states and 126 transitions. cyclomatic complexity: 33 Stem has 71 letters. Loop has 33 letters. [2022-02-21 04:19:31,917 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:31,917 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 4 states, 3 states have (on average 4.666666666666667) internal successors, (14), 3 states have internal predecessors, (14), 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 71 letters. Loop has 33 letters. [2022-02-21 04:19:31,917 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:31,917 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 200 states and 269 transitions. cyclomatic complexity: 78 Stem has 71 letters. Loop has 33 letters. [2022-02-21 04:19:31,917 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:31,917 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 97 states and 126 transitions. cyclomatic complexity: 33 Stem has 72 letters. Loop has 33 letters. [2022-02-21 04:19:31,917 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:31,917 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 4 states, 3 states have (on average 4.666666666666667) internal successors, (14), 3 states have internal predecessors, (14), 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 72 letters. Loop has 33 letters. [2022-02-21 04:19:31,918 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:31,918 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 200 states and 269 transitions. cyclomatic complexity: 78 Stem has 72 letters. Loop has 33 letters. [2022-02-21 04:19:31,918 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:31,918 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 97 states and 126 transitions. cyclomatic complexity: 33 Stem has 73 letters. Loop has 33 letters. [2022-02-21 04:19:31,918 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:31,918 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 4 states, 3 states have (on average 4.666666666666667) internal successors, (14), 3 states have internal predecessors, (14), 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 73 letters. Loop has 33 letters. [2022-02-21 04:19:31,919 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:31,919 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 200 states and 269 transitions. cyclomatic complexity: 78 Stem has 73 letters. Loop has 33 letters. [2022-02-21 04:19:31,919 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:31,919 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 97 states and 126 transitions. cyclomatic complexity: 33 Stem has 74 letters. Loop has 33 letters. [2022-02-21 04:19:31,919 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:31,919 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 4 states, 3 states have (on average 4.666666666666667) internal successors, (14), 3 states have internal predecessors, (14), 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 74 letters. Loop has 33 letters. [2022-02-21 04:19:31,919 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:31,919 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 200 states and 269 transitions. cyclomatic complexity: 78 Stem has 74 letters. Loop has 33 letters. [2022-02-21 04:19:31,923 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:31,923 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 97 states and 126 transitions. cyclomatic complexity: 33 Stem has 75 letters. Loop has 33 letters. [2022-02-21 04:19:31,923 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:31,923 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 4 states, 3 states have (on average 4.666666666666667) internal successors, (14), 3 states have internal predecessors, (14), 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 75 letters. Loop has 33 letters. [2022-02-21 04:19:31,924 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:31,924 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 200 states and 269 transitions. cyclomatic complexity: 78 Stem has 75 letters. Loop has 33 letters. [2022-02-21 04:19:31,924 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:31,924 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 97 states and 126 transitions. cyclomatic complexity: 33 Stem has 101 letters. Loop has 33 letters. [2022-02-21 04:19:31,924 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:31,924 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 4 states, 3 states have (on average 4.666666666666667) internal successors, (14), 3 states have internal predecessors, (14), 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 101 letters. Loop has 33 letters. [2022-02-21 04:19:31,924 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:31,924 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 200 states and 269 transitions. cyclomatic complexity: 78 Stem has 101 letters. Loop has 33 letters. [2022-02-21 04:19:31,925 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:31,925 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 97 states and 126 transitions. cyclomatic complexity: 33 Stem has 102 letters. Loop has 33 letters. [2022-02-21 04:19:31,925 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:31,925 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 4 states, 3 states have (on average 4.666666666666667) internal successors, (14), 3 states have internal predecessors, (14), 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 102 letters. Loop has 33 letters. [2022-02-21 04:19:31,925 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:31,925 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 200 states and 269 transitions. cyclomatic complexity: 78 Stem has 102 letters. Loop has 33 letters. [2022-02-21 04:19:31,925 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:31,925 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 97 states and 126 transitions. cyclomatic complexity: 33 Stem has 101 letters. Loop has 33 letters. [2022-02-21 04:19:31,925 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:31,926 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 4 states, 3 states have (on average 4.666666666666667) internal successors, (14), 3 states have internal predecessors, (14), 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 101 letters. Loop has 33 letters. [2022-02-21 04:19:31,926 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:31,926 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 200 states and 269 transitions. cyclomatic complexity: 78 Stem has 101 letters. Loop has 33 letters. [2022-02-21 04:19:31,926 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:31,926 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 97 states and 126 transitions. cyclomatic complexity: 33 Stem has 89 letters. Loop has 5 letters. [2022-02-21 04:19:31,926 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:31,926 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 4 states, 3 states have (on average 4.666666666666667) internal successors, (14), 3 states have internal predecessors, (14), 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 89 letters. Loop has 5 letters. [2022-02-21 04:19:31,926 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:31,926 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 200 states and 269 transitions. cyclomatic complexity: 78 Stem has 89 letters. Loop has 5 letters. [2022-02-21 04:19:31,927 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:31,927 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 97 states and 126 transitions. cyclomatic complexity: 33 Stem has 90 letters. Loop has 5 letters. [2022-02-21 04:19:31,927 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:31,927 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 4 states, 3 states have (on average 4.666666666666667) internal successors, (14), 3 states have internal predecessors, (14), 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 90 letters. Loop has 5 letters. [2022-02-21 04:19:31,927 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:31,927 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 200 states and 269 transitions. cyclomatic complexity: 78 Stem has 90 letters. Loop has 5 letters. [2022-02-21 04:19:31,927 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:31,927 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 97 states and 126 transitions. cyclomatic complexity: 33 Stem has 91 letters. Loop has 5 letters. [2022-02-21 04:19:31,927 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:31,927 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 4 states, 3 states have (on average 4.666666666666667) internal successors, (14), 3 states have internal predecessors, (14), 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 91 letters. Loop has 5 letters. [2022-02-21 04:19:31,928 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:31,928 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 200 states and 269 transitions. cyclomatic complexity: 78 Stem has 91 letters. Loop has 5 letters. [2022-02-21 04:19:31,928 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:31,928 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 97 states and 126 transitions. cyclomatic complexity: 33 Stem has 92 letters. Loop has 3 letters. [2022-02-21 04:19:31,928 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:31,928 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 4 states, 3 states have (on average 4.666666666666667) internal successors, (14), 3 states have internal predecessors, (14), 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 92 letters. Loop has 3 letters. [2022-02-21 04:19:31,928 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:31,928 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 200 states and 269 transitions. cyclomatic complexity: 78 Stem has 92 letters. Loop has 3 letters. [2022-02-21 04:19:31,928 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:31,928 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 97 states and 126 transitions. cyclomatic complexity: 33 Stem has 93 letters. Loop has 3 letters. [2022-02-21 04:19:31,929 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:31,929 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 4 states, 3 states have (on average 4.666666666666667) internal successors, (14), 3 states have internal predecessors, (14), 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 93 letters. Loop has 3 letters. [2022-02-21 04:19:31,929 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:31,929 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 200 states and 269 transitions. cyclomatic complexity: 78 Stem has 93 letters. Loop has 3 letters. [2022-02-21 04:19:31,929 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:31,929 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 97 states and 126 transitions. cyclomatic complexity: 33 Stem has 94 letters. Loop has 3 letters. [2022-02-21 04:19:31,929 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:31,929 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 4 states, 3 states have (on average 4.666666666666667) internal successors, (14), 3 states have internal predecessors, (14), 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 94 letters. Loop has 3 letters. [2022-02-21 04:19:31,929 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:31,929 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 200 states and 269 transitions. cyclomatic complexity: 78 Stem has 94 letters. Loop has 3 letters. [2022-02-21 04:19:31,930 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:31,930 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 97 states and 126 transitions. cyclomatic complexity: 33 Stem has 19 letters. Loop has 5 letters. [2022-02-21 04:19:31,930 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:31,935 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 4 states, 3 states have (on average 4.666666666666667) internal successors, (14), 3 states have internal predecessors, (14), 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 19 letters. Loop has 5 letters. [2022-02-21 04:19:31,940 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:31,940 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 200 states and 269 transitions. cyclomatic complexity: 78 Stem has 19 letters. Loop has 5 letters. [2022-02-21 04:19:31,940 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:31,940 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 97 states and 126 transitions. cyclomatic complexity: 33 Stem has 21 letters. Loop has 3 letters. [2022-02-21 04:19:31,940 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:31,940 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 4 states, 3 states have (on average 4.666666666666667) internal successors, (14), 3 states have internal predecessors, (14), 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 3 letters. [2022-02-21 04:19:31,940 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:31,941 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 200 states and 269 transitions. cyclomatic complexity: 78 Stem has 21 letters. Loop has 3 letters. [2022-02-21 04:19:31,941 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:31,941 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 97 states and 126 transitions. cyclomatic complexity: 33 Stem has 18 letters. Loop has 5 letters. [2022-02-21 04:19:31,941 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:31,941 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 4 states, 3 states have (on average 4.666666666666667) internal successors, (14), 3 states have internal predecessors, (14), 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 18 letters. Loop has 5 letters. [2022-02-21 04:19:31,941 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:31,941 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 200 states and 269 transitions. cyclomatic complexity: 78 Stem has 18 letters. Loop has 5 letters. [2022-02-21 04:19:31,941 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:31,941 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 97 states and 126 transitions. cyclomatic complexity: 33 Stem has 20 letters. Loop has 3 letters. [2022-02-21 04:19:31,941 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:31,941 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 4 states, 3 states have (on average 4.666666666666667) internal successors, (14), 3 states have internal predecessors, (14), 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 20 letters. Loop has 3 letters. [2022-02-21 04:19:31,942 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:31,942 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 200 states and 269 transitions. cyclomatic complexity: 78 Stem has 20 letters. Loop has 3 letters. [2022-02-21 04:19:31,942 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:31,942 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 97 states and 126 transitions. cyclomatic complexity: 33 Stem has 22 letters. Loop has 3 letters. [2022-02-21 04:19:31,942 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:31,942 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 4 states, 3 states have (on average 4.666666666666667) internal successors, (14), 3 states have internal predecessors, (14), 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 22 letters. Loop has 3 letters. [2022-02-21 04:19:31,942 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:31,942 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 200 states and 269 transitions. cyclomatic complexity: 78 Stem has 22 letters. Loop has 3 letters. [2022-02-21 04:19:31,942 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:31,942 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 97 states and 126 transitions. cyclomatic complexity: 33 Stem has 17 letters. Loop has 5 letters. [2022-02-21 04:19:31,942 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:31,942 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 4 states, 3 states have (on average 4.666666666666667) internal successors, (14), 3 states have internal predecessors, (14), 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 17 letters. Loop has 5 letters. [2022-02-21 04:19:31,943 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:31,943 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 200 states and 269 transitions. cyclomatic complexity: 78 Stem has 17 letters. Loop has 5 letters. [2022-02-21 04:19:31,943 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:31,943 INFO L161 tractBuchiDifference]: Finished testing correctness of buchiDifferenceNCSBLazy3 [2022-02-21 04:19:31,944 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 3 states have (on average 4.666666666666667) internal successors, (14), 3 states have internal predecessors, (14), 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 04:19:31,944 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 56 transitions. [2022-02-21 04:19:31,944 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 56 transitions. Stem has 14 letters. Loop has 4 letters. [2022-02-21 04:19:31,945 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:31,945 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 56 transitions. Stem has 18 letters. Loop has 4 letters. [2022-02-21 04:19:31,945 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:31,945 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 56 transitions. Stem has 14 letters. Loop has 8 letters. [2022-02-21 04:19:31,945 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:31,945 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 200 states and 269 transitions. cyclomatic complexity: 78 [2022-02-21 04:19:31,950 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 04:19:31,955 INFO L131 ngComponentsAnalysis]: Automaton has 6 accepting balls. 48 [2022-02-21 04:19:31,960 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 200 states to 188 states and 257 transitions. [2022-02-21 04:19:31,960 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 173 [2022-02-21 04:19:31,960 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 175 [2022-02-21 04:19:31,960 INFO L73 IsDeterministic]: Start isDeterministic. Operand 188 states and 257 transitions. [2022-02-21 04:19:31,960 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2022-02-21 04:19:31,960 INFO L681 BuchiCegarLoop]: Abstraction has 188 states and 257 transitions. [2022-02-21 04:19:31,961 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 188 states and 257 transitions. [2022-02-21 04:19:31,964 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 188 to 163. [2022-02-21 04:19:31,964 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-21 04:19:31,964 INFO L82 GeneralOperation]: Start isEquivalent. First operand 188 states and 257 transitions. Second operand has 163 states, 119 states have (on average 1.3277310924369747) internal successors, (158), 125 states have internal predecessors, (158), 28 states have call successors, (28), 16 states have call predecessors, (28), 16 states have return successors, (37), 21 states have call predecessors, (37), 22 states have call successors, (37) [2022-02-21 04:19:31,964 INFO L74 IsIncluded]: Start isIncluded. First operand 188 states and 257 transitions. Second operand has 163 states, 119 states have (on average 1.3277310924369747) internal successors, (158), 125 states have internal predecessors, (158), 28 states have call successors, (28), 16 states have call predecessors, (28), 16 states have return successors, (37), 21 states have call predecessors, (37), 22 states have call successors, (37) [2022-02-21 04:19:31,965 INFO L87 Difference]: Start difference. First operand 188 states and 257 transitions. Second operand has 163 states, 119 states have (on average 1.3277310924369747) internal successors, (158), 125 states have internal predecessors, (158), 28 states have call successors, (28), 16 states have call predecessors, (28), 16 states have return successors, (37), 21 states have call predecessors, (37), 22 states have call successors, (37) [2022-02-21 04:19:31,965 INFO L149 Difference]: Subtrahend was not deterministic. Recomputing result with determinization. [2022-02-21 04:19:31,979 INFO L93 Difference]: Finished difference Result 395 states and 506 transitions. [2022-02-21 04:19:31,979 INFO L276 IsEmpty]: Start isEmpty. Operand 395 states and 506 transitions. [2022-02-21 04:19:31,980 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 04:19:31,980 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 04:19:31,981 INFO L74 IsIncluded]: Start isIncluded. First operand has 163 states, 119 states have (on average 1.3277310924369747) internal successors, (158), 125 states have internal predecessors, (158), 28 states have call successors, (28), 16 states have call predecessors, (28), 16 states have return successors, (37), 21 states have call predecessors, (37), 22 states have call successors, (37) Second operand 188 states and 257 transitions. [2022-02-21 04:19:31,981 INFO L87 Difference]: Start difference. First operand has 163 states, 119 states have (on average 1.3277310924369747) internal successors, (158), 125 states have internal predecessors, (158), 28 states have call successors, (28), 16 states have call predecessors, (28), 16 states have return successors, (37), 21 states have call predecessors, (37), 22 states have call successors, (37) Second operand 188 states and 257 transitions. [2022-02-21 04:19:31,981 INFO L149 Difference]: Subtrahend was not deterministic. Recomputing result with determinization. [2022-02-21 04:19:31,994 INFO L93 Difference]: Finished difference Result 436 states and 557 transitions. [2022-02-21 04:19:31,994 INFO L276 IsEmpty]: Start isEmpty. Operand 436 states and 557 transitions. [2022-02-21 04:19:31,995 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 04:19:31,996 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 04:19:31,996 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-21 04:19:31,996 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-21 04:19:31,996 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 163 states, 119 states have (on average 1.3277310924369747) internal successors, (158), 125 states have internal predecessors, (158), 28 states have call successors, (28), 16 states have call predecessors, (28), 16 states have return successors, (37), 21 states have call predecessors, (37), 22 states have call successors, (37) [2022-02-21 04:19:31,999 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 163 states to 163 states and 223 transitions. [2022-02-21 04:19:31,999 INFO L704 BuchiCegarLoop]: Abstraction has 163 states and 223 transitions. [2022-02-21 04:19:31,999 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-21 04:19:31,999 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-02-21 04:19:31,999 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-02-21 04:19:31,999 INFO L87 Difference]: Start difference. First operand 163 states and 223 transitions. 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, (3), 3 states have call predecessors, (3), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 04:19:32,126 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 04:19:32,126 INFO L93 Difference]: Finished difference Result 169 states and 228 transitions. [2022-02-21 04:19:32,126 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-02-21 04:19:32,126 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, (3), 3 states have call predecessors, (3), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 04:19:32,136 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 14 edges. 14 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-21 04:19:32,137 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 169 states and 228 transitions. [2022-02-21 04:19:32,141 INFO L131 ngComponentsAnalysis]: Automaton has 5 accepting balls. 42 [2022-02-21 04:19:32,145 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 169 states to 169 states and 228 transitions. [2022-02-21 04:19:32,145 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 162 [2022-02-21 04:19:32,145 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 162 [2022-02-21 04:19:32,145 INFO L73 IsDeterministic]: Start isDeterministic. Operand 169 states and 228 transitions. [2022-02-21 04:19:32,145 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2022-02-21 04:19:32,145 INFO L681 BuchiCegarLoop]: Abstraction has 169 states and 228 transitions. [2022-02-21 04:19:32,145 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 169 states and 228 transitions. [2022-02-21 04:19:32,148 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 169 to 165. [2022-02-21 04:19:32,148 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-21 04:19:32,148 INFO L82 GeneralOperation]: Start isEquivalent. First operand 169 states and 228 transitions. Second operand has 165 states, 121 states have (on average 1.2975206611570247) internal successors, (157), 127 states have internal predecessors, (157), 26 states have call successors, (26), 16 states have call predecessors, (26), 18 states have return successors, (40), 21 states have call predecessors, (40), 22 states have call successors, (40) [2022-02-21 04:19:32,149 INFO L74 IsIncluded]: Start isIncluded. First operand 169 states and 228 transitions. Second operand has 165 states, 121 states have (on average 1.2975206611570247) internal successors, (157), 127 states have internal predecessors, (157), 26 states have call successors, (26), 16 states have call predecessors, (26), 18 states have return successors, (40), 21 states have call predecessors, (40), 22 states have call successors, (40) [2022-02-21 04:19:32,149 INFO L87 Difference]: Start difference. First operand 169 states and 228 transitions. Second operand has 165 states, 121 states have (on average 1.2975206611570247) internal successors, (157), 127 states have internal predecessors, (157), 26 states have call successors, (26), 16 states have call predecessors, (26), 18 states have return successors, (40), 21 states have call predecessors, (40), 22 states have call successors, (40) [2022-02-21 04:19:32,149 INFO L149 Difference]: Subtrahend was not deterministic. Recomputing result with determinization. [2022-02-21 04:19:32,159 INFO L93 Difference]: Finished difference Result 341 states and 440 transitions. [2022-02-21 04:19:32,159 INFO L276 IsEmpty]: Start isEmpty. Operand 341 states and 440 transitions. [2022-02-21 04:19:32,160 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 04:19:32,160 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 04:19:32,160 INFO L74 IsIncluded]: Start isIncluded. First operand has 165 states, 121 states have (on average 1.2975206611570247) internal successors, (157), 127 states have internal predecessors, (157), 26 states have call successors, (26), 16 states have call predecessors, (26), 18 states have return successors, (40), 21 states have call predecessors, (40), 22 states have call successors, (40) Second operand 169 states and 228 transitions. [2022-02-21 04:19:32,160 INFO L87 Difference]: Start difference. First operand has 165 states, 121 states have (on average 1.2975206611570247) internal successors, (157), 127 states have internal predecessors, (157), 26 states have call successors, (26), 16 states have call predecessors, (26), 18 states have return successors, (40), 21 states have call predecessors, (40), 22 states have call successors, (40) Second operand 169 states and 228 transitions. [2022-02-21 04:19:32,161 INFO L149 Difference]: Subtrahend was not deterministic. Recomputing result with determinization. [2022-02-21 04:19:32,171 INFO L93 Difference]: Finished difference Result 341 states and 440 transitions. [2022-02-21 04:19:32,171 INFO L276 IsEmpty]: Start isEmpty. Operand 341 states and 440 transitions. [2022-02-21 04:19:32,172 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 04:19:32,172 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 04:19:32,172 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-21 04:19:32,172 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-21 04:19:32,172 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 165 states, 121 states have (on average 1.2975206611570247) internal successors, (157), 127 states have internal predecessors, (157), 26 states have call successors, (26), 16 states have call predecessors, (26), 18 states have return successors, (40), 21 states have call predecessors, (40), 22 states have call successors, (40) [2022-02-21 04:19:32,175 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 165 states to 165 states and 223 transitions. [2022-02-21 04:19:32,175 INFO L704 BuchiCegarLoop]: Abstraction has 165 states and 223 transitions. [2022-02-21 04:19:32,175 INFO L587 BuchiCegarLoop]: Abstraction has 165 states and 223 transitions. [2022-02-21 04:19:32,175 INFO L425 BuchiCegarLoop]: ======== Iteration 7============ [2022-02-21 04:19:32,176 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 165 states and 223 transitions. [2022-02-21 04:19:32,176 INFO L131 ngComponentsAnalysis]: Automaton has 5 accepting balls. 42 [2022-02-21 04:19:32,176 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 04:19:32,176 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 04:19:32,177 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-21 04:19:32,177 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1] [2022-02-21 04:19:32,177 INFO L791 eck$LassoCheckResult]: Stem: 10684#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(9, 2);call #Ultimate.allocInit(12, 3); 10649#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet12#1, main_#t~ret13#1, main_#t~nondet14#1, main_#t~nondet15#1, main_#t~ret16#1, main_#t~short17#1, main_~n~0#1, main_~result~0#1, main_~f1~0#1, main_~f2~0#1;main_~n~0#1 := main_#t~nondet12#1;havoc main_#t~nondet12#1; 10650#L78 assume !(main_~n~0#1 < 1 || main_~n~0#1 > 46340);assume { :begin_inline_is_prime } true;is_prime_#in~n#1 := main_~n~0#1;havoc is_prime_#res#1;havoc is_prime_#t~ret9#1, is_prime_~n#1;is_prime_~n#1 := is_prime_#in~n#1; 10689#L53 call is_prime_#t~ret9#1 := is_prime_(is_prime_~n#1, is_prime_~n#1 - 1);< 10706#is_prime_ENTRY ~n := #in~n;~m := #in~m; 10720#L58 assume !(~n <= 1); 10717#L61 assume !(2 == ~n); 10718#L64 assume ~n > 2; 10715#L65 assume !(~m <= 1); 10687#L68 call #t~ret10 := multiple_of(~n, ~m);< 10749#multiple_ofENTRY ~n := #in~n;~m := #in~m; 10780#L32 assume !(~m < 0); 10705#L35 assume !(~n < 0); 10686#L38 assume !(0 == ~m); 10688#L41 assume !(0 == ~n); 10672#L44 call #t~ret8 := multiple_of(~n - ~m, ~m);< 10714#multiple_ofENTRY [2022-02-21 04:19:32,177 INFO L793 eck$LassoCheckResult]: Loop: 10714#multiple_ofENTRY ~n := #in~n;~m := #in~m; 10712#L32 assume !(~m < 0); 10709#L35 assume !(~n < 0); 10710#L38 assume !(0 == ~m); 10756#L41 assume !(0 == ~n); 10670#L44 call #t~ret8 := multiple_of(~n - ~m, ~m);< 10714#multiple_ofENTRY [2022-02-21 04:19:32,177 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 04:19:32,177 INFO L85 PathProgramCache]: Analyzing trace with hash -1718912949, now seen corresponding path program 1 times [2022-02-21 04:19:32,177 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 04:19:32,177 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [721663173] [2022-02-21 04:19:32,177 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 04:19:32,177 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 04:19:32,184 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 04:19:32,184 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-02-21 04:19:32,188 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 04:19:32,190 INFO L138 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-02-21 04:19:32,190 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 04:19:32,190 INFO L85 PathProgramCache]: Analyzing trace with hash 893418406, now seen corresponding path program 1 times [2022-02-21 04:19:32,190 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 04:19:32,190 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1835781473] [2022-02-21 04:19:32,191 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 04:19:32,191 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 04:19:32,199 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 04:19:32,199 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-02-21 04:19:32,201 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 04:19:32,205 INFO L138 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-02-21 04:19:32,208 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 04:19:32,208 INFO L85 PathProgramCache]: Analyzing trace with hash 1893667952, now seen corresponding path program 2 times [2022-02-21 04:19:32,208 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 04:19:32,208 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1131749936] [2022-02-21 04:19:32,209 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 04:19:32,209 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 04:19:32,226 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 04:19:32,226 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-02-21 04:19:32,231 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 04:19:32,233 INFO L138 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-02-21 04:19:32,349 INFO L210 LassoAnalysis]: Preferences: [2022-02-21 04:19:32,349 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2022-02-21 04:19:32,349 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2022-02-21 04:19:32,350 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2022-02-21 04:19:32,350 INFO L129 ssoRankerPreferences]: Use exernal solver: true [2022-02-21 04:19:32,350 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 04:19:32,350 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2022-02-21 04:19:32,350 INFO L132 ssoRankerPreferences]: Path of dumped script: [2022-02-21 04:19:32,350 INFO L133 ssoRankerPreferences]: Filename of dumped script: Primes.c_Iteration7_Loop [2022-02-21 04:19:32,350 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2022-02-21 04:19:32,350 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2022-02-21 04:19:32,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 04:19:32,361 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 04:19:32,363 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 04:19:32,365 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 04:19:32,367 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 04:19:32,368 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 04:19:32,370 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 04:19:32,450 INFO L294 LassoAnalysis]: Preprocessing complete. [2022-02-21 04:19:32,450 INFO L404 LassoAnalysis]: Checking for nontermination... [2022-02-21 04:19:32,450 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 04:19:32,450 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 04:19:32,451 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 04:19:32,452 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 04:19:32,503 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2022-02-21 04:19:32,503 INFO L160 nArgumentSynthesizer]: Using integer mode. [2022-02-21 04:19:32,543 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 04:19:32,543 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 04:19:32,543 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 04:19:32,544 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 04:19:32,545 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 04:19:32,546 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2022-02-21 04:19:32,546 INFO L160 nArgumentSynthesizer]: Using integer mode. [2022-02-21 04:19:32,596 INFO L444 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2022-02-21 04:19:32,600 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (49)] Ended with exit code 0 [2022-02-21 04:19:32,600 INFO L210 LassoAnalysis]: Preferences: [2022-02-21 04:19:32,600 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2022-02-21 04:19:32,600 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2022-02-21 04:19:32,600 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2022-02-21 04:19:32,600 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2022-02-21 04:19:32,601 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 04:19:32,601 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2022-02-21 04:19:32,601 INFO L132 ssoRankerPreferences]: Path of dumped script: [2022-02-21 04:19:32,601 INFO L133 ssoRankerPreferences]: Filename of dumped script: Primes.c_Iteration7_Loop [2022-02-21 04:19:32,601 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2022-02-21 04:19:32,601 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2022-02-21 04:19:32,601 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 04:19:32,604 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 04:19:32,613 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 04:19:32,620 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 04:19:32,622 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 04:19:32,623 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 04:19:32,628 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 04:19:32,714 INFO L294 LassoAnalysis]: Preprocessing complete. [2022-02-21 04:19:32,714 INFO L490 LassoAnalysis]: Using template 'affine'. [2022-02-21 04:19:32,714 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 04:19:32,714 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 04:19:32,715 INFO L229 MonitoredProcess]: Starting monitored process 50 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 04:19:32,716 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (50)] Waiting until timeout for monitored process [2022-02-21 04:19:32,717 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 04:19:32,725 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 04:19:32,726 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 04:19:32,726 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 04:19:32,726 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 04:19:32,726 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 04:19:32,726 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-02-21 04:19:32,726 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 04:19:32,738 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 04:19:32,754 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (50)] Forceful destruction successful, exit code 0 [2022-02-21 04:19:32,755 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 04:19:32,755 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 04:19:32,756 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 04:19:32,756 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 04:19:32,758 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 04:19:32,764 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 04:19:32,764 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 04:19:32,764 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 04:19:32,764 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 04:19:32,764 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 04:19:32,765 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-02-21 04:19:32,766 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 04:19:32,780 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2022-02-21 04:19:32,782 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2022-02-21 04:19:32,783 INFO L444 ModelExtractionUtils]: 1 out of 4 variables were initially zero. Simplification set additionally 1 variables to zero. [2022-02-21 04:19:32,783 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 04:19:32,783 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 04:19:32,785 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 04:19:32,785 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 04:19:32,786 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2022-02-21 04:19:32,787 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2022-02-21 04:19:32,787 INFO L513 LassoAnalysis]: Proved termination. [2022-02-21 04:19:32,787 INFO L515 LassoAnalysis]: Termination argument consisting of: Ranking function f(multiple_of_#in~n) = 1*multiple_of_#in~n Supporting invariants [] [2022-02-21 04:19:32,810 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (51)] Ended with exit code 0 [2022-02-21 04:19:32,814 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2022-02-21 04:19:32,816 INFO L390 LassoCheck]: Loop: "~n := #in~n;~m := #in~m;" "assume !(~m < 0);" "assume !(~n < 0);" "assume !(0 == ~m);" "assume !(0 == ~n);" "call #t~ret8 := multiple_of(~n - ~m, ~m);"< [2022-02-21 04:19:32,821 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 04:19:32,829 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 04:19:32,870 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 04:19:32,897 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 04:19:32,899 INFO L263 TraceCheckSpWp]: Trace formula consists of 150 conjuncts, 8 conjunts are in the unsatisfiable core [2022-02-21 04:19:32,909 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 04:19:32,909 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-21 04:19:32,938 INFO L290 TraceCheckUtils]: 0: Hoare triple {12212#unseeded} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(9, 2);call #Ultimate.allocInit(12, 3); {12212#unseeded} is VALID [2022-02-21 04:19:32,938 INFO L290 TraceCheckUtils]: 1: Hoare triple {12212#unseeded} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet12#1, main_#t~ret13#1, main_#t~nondet14#1, main_#t~nondet15#1, main_#t~ret16#1, main_#t~short17#1, main_~n~0#1, main_~result~0#1, main_~f1~0#1, main_~f2~0#1;main_~n~0#1 := main_#t~nondet12#1;havoc main_#t~nondet12#1; {12212#unseeded} is VALID [2022-02-21 04:19:32,938 INFO L290 TraceCheckUtils]: 2: Hoare triple {12212#unseeded} assume !(main_~n~0#1 < 1 || main_~n~0#1 > 46340);assume { :begin_inline_is_prime } true;is_prime_#in~n#1 := main_~n~0#1;havoc is_prime_#res#1;havoc is_prime_#t~ret9#1, is_prime_~n#1;is_prime_~n#1 := is_prime_#in~n#1; {12212#unseeded} is VALID [2022-02-21 04:19:32,939 INFO L272 TraceCheckUtils]: 3: Hoare triple {12212#unseeded} call is_prime_#t~ret9#1 := is_prime_(is_prime_~n#1, is_prime_~n#1 - 1); {12212#unseeded} is VALID [2022-02-21 04:19:32,939 INFO L290 TraceCheckUtils]: 4: Hoare triple {12212#unseeded} ~n := #in~n;~m := #in~m; {12212#unseeded} is VALID [2022-02-21 04:19:32,939 INFO L290 TraceCheckUtils]: 5: Hoare triple {12212#unseeded} assume !(~n <= 1); {12212#unseeded} is VALID [2022-02-21 04:19:32,940 INFO L290 TraceCheckUtils]: 6: Hoare triple {12212#unseeded} assume !(2 == ~n); {12212#unseeded} is VALID [2022-02-21 04:19:32,940 INFO L290 TraceCheckUtils]: 7: Hoare triple {12212#unseeded} assume ~n > 2; {12212#unseeded} is VALID [2022-02-21 04:19:32,940 INFO L290 TraceCheckUtils]: 8: Hoare triple {12212#unseeded} assume !(~m <= 1); {12212#unseeded} is VALID [2022-02-21 04:19:32,941 INFO L272 TraceCheckUtils]: 9: Hoare triple {12212#unseeded} call #t~ret10 := multiple_of(~n, ~m); {12212#unseeded} is VALID [2022-02-21 04:19:32,942 INFO L290 TraceCheckUtils]: 10: Hoare triple {12212#unseeded} ~n := #in~n;~m := #in~m; {12212#unseeded} is VALID [2022-02-21 04:19:32,942 INFO L290 TraceCheckUtils]: 11: Hoare triple {12212#unseeded} assume !(~m < 0); {12212#unseeded} is VALID [2022-02-21 04:19:32,942 INFO L290 TraceCheckUtils]: 12: Hoare triple {12212#unseeded} assume !(~n < 0); {12212#unseeded} is VALID [2022-02-21 04:19:32,943 INFO L290 TraceCheckUtils]: 13: Hoare triple {12212#unseeded} assume !(0 == ~m); {12212#unseeded} is VALID [2022-02-21 04:19:32,943 INFO L290 TraceCheckUtils]: 14: Hoare triple {12212#unseeded} assume !(0 == ~n); {12212#unseeded} is VALID [2022-02-21 04:19:32,943 INFO L272 TraceCheckUtils]: 15: Hoare triple {12212#unseeded} call #t~ret8 := multiple_of(~n - ~m, ~m); {12212#unseeded} is VALID [2022-02-21 04:19:32,950 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 04:19:32,951 INFO L263 TraceCheckSpWp]: Trace formula consists of 44 conjuncts, 10 conjunts are in the unsatisfiable core [2022-02-21 04:19:32,956 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 04:19:32,957 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-21 04:19:33,060 INFO L290 TraceCheckUtils]: 0: Hoare triple {12215#(>= oldRank0 |multiple_of_#in~n|)} ~n := #in~n;~m := #in~m; {12275#(<= multiple_of_~n oldRank0)} is VALID [2022-02-21 04:19:33,061 INFO L290 TraceCheckUtils]: 1: Hoare triple {12275#(<= multiple_of_~n oldRank0)} assume !(~m < 0); {12279#(and (not (< multiple_of_~m 0)) (<= multiple_of_~n oldRank0))} is VALID [2022-02-21 04:19:33,061 INFO L290 TraceCheckUtils]: 2: Hoare triple {12279#(and (not (< multiple_of_~m 0)) (<= multiple_of_~n oldRank0))} assume !(~n < 0); {12283#(and (not (< multiple_of_~m 0)) (not (< multiple_of_~n 0)) (<= multiple_of_~n oldRank0))} is VALID [2022-02-21 04:19:33,061 INFO L290 TraceCheckUtils]: 3: Hoare triple {12283#(and (not (< multiple_of_~m 0)) (not (< multiple_of_~n 0)) (<= multiple_of_~n oldRank0))} assume !(0 == ~m); {12287#(and (not (< multiple_of_~m 0)) (not (= multiple_of_~m 0)) (not (< multiple_of_~n 0)) (<= multiple_of_~n oldRank0))} is VALID [2022-02-21 04:19:33,062 INFO L290 TraceCheckUtils]: 4: Hoare triple {12287#(and (not (< multiple_of_~m 0)) (not (= multiple_of_~m 0)) (not (< multiple_of_~n 0)) (<= multiple_of_~n oldRank0))} assume !(0 == ~n); {12291#(and (not (= multiple_of_~n 0)) (not (< multiple_of_~m 0)) (not (= multiple_of_~m 0)) (not (< multiple_of_~n 0)) (<= multiple_of_~n oldRank0))} is VALID [2022-02-21 04:19:33,063 INFO L272 TraceCheckUtils]: 5: Hoare triple {12291#(and (not (= multiple_of_~n 0)) (not (< multiple_of_~m 0)) (not (= multiple_of_~m 0)) (not (< multiple_of_~n 0)) (<= multiple_of_~n oldRank0))} call #t~ret8 := multiple_of(~n - ~m, ~m); {12225#(or (and (>= oldRank0 0) (> oldRank0 |multiple_of_#in~n|)) unseeded)} is VALID [2022-02-21 04:19:33,063 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 04:19:33,063 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 7 states, 6 states have (on average 3.0) internal successors, (18), 6 states have internal predecessors, (18), 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 04:19:33,075 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 04:19:33,075 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 7 states, 6 states have (on average 3.0) internal successors, (18), 6 states have internal predecessors, (18), 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 6 letters. [2022-02-21 04:19:33,075 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:33,076 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 6 loop predicates [2022-02-21 04:19:33,076 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 165 states and 223 transitions. cyclomatic complexity: 65 Second operand has 7 states, 6 states have (on average 3.0) internal successors, (18), 6 states have internal predecessors, (18), 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 04:19:33,263 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 165 states and 223 transitions. cyclomatic complexity: 65. Second operand has 7 states, 6 states have (on average 3.0) internal successors, (18), 6 states have internal predecessors, (18), 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 218 states and 293 transitions. Complement of second has 25 states. [2022-02-21 04:19:33,263 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 7 states 1 stem states 5 non-accepting loop states 1 accepting loop states [2022-02-21 04:19:33,263 INFO L123 tractBuchiDifference]: Start testing correctness of buchiDifferenceNCSBLazy3 [2022-02-21 04:19:33,263 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 165 states and 223 transitions. cyclomatic complexity: 65 [2022-02-21 04:19:33,263 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 04:19:33,263 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 04:19:33,263 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 7 states, 6 states have (on average 3.0) internal successors, (18), 6 states have internal predecessors, (18), 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 04:19:33,264 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 6 [2022-02-21 04:19:33,264 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 04:19:33,264 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 04:19:33,264 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 218 states and 293 transitions. [2022-02-21 04:19:33,265 INFO L131 ngComponentsAnalysis]: Automaton has 6 accepting balls. 48 [2022-02-21 04:19:33,265 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 04:19:33,266 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 04:19:33,266 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 165 states and 223 transitions. cyclomatic complexity: 65 [2022-02-21 04:19:33,270 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 44 examples of accepted words. [2022-02-21 04:19:33,270 INFO L70 LassoExtractor]: Start lassoExtractor. Operand has 7 states, 6 states have (on average 3.0) internal successors, (18), 6 states have internal predecessors, (18), 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 04:19:33,271 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 6 [2022-02-21 04:19:33,271 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 1 examples of accepted words. [2022-02-21 04:19:33,271 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 218 states and 293 transitions. cyclomatic complexity: 85 [2022-02-21 04:19:33,275 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 50 examples of accepted words. [2022-02-21 04:19:33,276 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 165 states and 223 transitions. cyclomatic complexity: 65 Stem has 16 letters. Loop has 6 letters. [2022-02-21 04:19:33,276 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:33,276 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 7 states, 6 states have (on average 3.0) internal successors, (18), 6 states have internal predecessors, (18), 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 6 letters. [2022-02-21 04:19:33,276 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:33,276 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 218 states and 293 transitions. cyclomatic complexity: 85 Stem has 16 letters. Loop has 6 letters. [2022-02-21 04:19:33,276 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:33,276 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 165 states and 223 transitions. cyclomatic complexity: 65 Stem has 1 letters. Loop has 6 letters. [2022-02-21 04:19:33,276 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:33,277 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 7 states, 6 states have (on average 3.0) internal successors, (18), 6 states have internal predecessors, (18), 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 6 letters. [2022-02-21 04:19:33,277 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:33,277 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 218 states and 293 transitions. cyclomatic complexity: 85 Stem has 1 letters. Loop has 6 letters. [2022-02-21 04:19:33,277 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:33,277 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 165 states and 223 transitions. cyclomatic complexity: 65 Stem has 17 letters. Loop has 5 letters. [2022-02-21 04:19:33,277 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:33,277 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 7 states, 6 states have (on average 3.0) internal successors, (18), 6 states have internal predecessors, (18), 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 17 letters. Loop has 5 letters. [2022-02-21 04:19:33,277 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:33,277 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 218 states and 293 transitions. cyclomatic complexity: 85 Stem has 17 letters. Loop has 5 letters. [2022-02-21 04:19:33,277 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:33,278 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 165 states and 223 transitions. cyclomatic complexity: 65 Stem has 218 letters. Loop has 218 letters. [2022-02-21 04:19:33,278 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:33,278 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 7 states, 6 states have (on average 3.0) internal successors, (18), 6 states have internal predecessors, (18), 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 218 letters. Loop has 218 letters. [2022-02-21 04:19:33,278 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:33,278 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 218 states and 293 transitions. cyclomatic complexity: 85 Stem has 218 letters. Loop has 218 letters. [2022-02-21 04:19:33,278 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:33,278 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 165 states and 223 transitions. cyclomatic complexity: 65 Stem has 165 letters. Loop has 165 letters. [2022-02-21 04:19:33,278 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:33,278 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 7 states, 6 states have (on average 3.0) internal successors, (18), 6 states have internal predecessors, (18), 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 165 letters. Loop has 165 letters. [2022-02-21 04:19:33,278 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:33,278 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 218 states and 293 transitions. cyclomatic complexity: 85 Stem has 165 letters. Loop has 165 letters. [2022-02-21 04:19:33,279 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:33,279 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 165 states and 223 transitions. cyclomatic complexity: 65 Stem has 7 letters. Loop has 7 letters. [2022-02-21 04:19:33,279 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:33,279 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 7 states, 6 states have (on average 3.0) internal successors, (18), 6 states have internal predecessors, (18), 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 7 letters. Loop has 7 letters. [2022-02-21 04:19:33,279 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:33,279 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 218 states and 293 transitions. cyclomatic complexity: 85 Stem has 7 letters. Loop has 7 letters. [2022-02-21 04:19:33,279 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:33,279 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 165 states and 223 transitions. cyclomatic complexity: 65 Stem has 29 letters. Loop has 10 letters. [2022-02-21 04:19:33,279 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:33,279 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 7 states, 6 states have (on average 3.0) internal successors, (18), 6 states have internal predecessors, (18), 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 29 letters. Loop has 10 letters. [2022-02-21 04:19:33,279 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:33,280 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 218 states and 293 transitions. cyclomatic complexity: 85 Stem has 29 letters. Loop has 10 letters. [2022-02-21 04:19:33,280 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:33,280 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 165 states and 223 transitions. cyclomatic complexity: 65 Stem has 30 letters. Loop has 4 letters. [2022-02-21 04:19:33,280 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:33,280 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 7 states, 6 states have (on average 3.0) internal successors, (18), 6 states have internal predecessors, (18), 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 30 letters. Loop has 4 letters. [2022-02-21 04:19:33,280 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:33,280 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 218 states and 293 transitions. cyclomatic complexity: 85 Stem has 30 letters. Loop has 4 letters. [2022-02-21 04:19:33,280 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:33,280 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 165 states and 223 transitions. cyclomatic complexity: 65 Stem has 30 letters. Loop has 6 letters. [2022-02-21 04:19:33,280 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:33,281 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 7 states, 6 states have (on average 3.0) internal successors, (18), 6 states have internal predecessors, (18), 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 30 letters. Loop has 6 letters. [2022-02-21 04:19:33,281 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:33,281 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 218 states and 293 transitions. cyclomatic complexity: 85 Stem has 30 letters. Loop has 6 letters. [2022-02-21 04:19:33,281 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:33,281 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 165 states and 223 transitions. cyclomatic complexity: 65 Stem has 33 letters. Loop has 4 letters. [2022-02-21 04:19:33,281 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:33,281 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 7 states, 6 states have (on average 3.0) internal successors, (18), 6 states have internal predecessors, (18), 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 33 letters. Loop has 4 letters. [2022-02-21 04:19:33,281 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:33,281 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 218 states and 293 transitions. cyclomatic complexity: 85 Stem has 33 letters. Loop has 4 letters. [2022-02-21 04:19:33,281 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:33,281 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 165 states and 223 transitions. cyclomatic complexity: 65 Stem has 26 letters. Loop has 6 letters. [2022-02-21 04:19:33,282 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:33,282 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 7 states, 6 states have (on average 3.0) internal successors, (18), 6 states have internal predecessors, (18), 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 26 letters. Loop has 6 letters. [2022-02-21 04:19:33,282 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:33,282 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 218 states and 293 transitions. cyclomatic complexity: 85 Stem has 26 letters. Loop has 6 letters. [2022-02-21 04:19:33,282 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:33,282 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 165 states and 223 transitions. cyclomatic complexity: 65 Stem has 34 letters. Loop has 10 letters. [2022-02-21 04:19:33,282 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:33,282 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 7 states, 6 states have (on average 3.0) internal successors, (18), 6 states have internal predecessors, (18), 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 34 letters. Loop has 10 letters. [2022-02-21 04:19:33,282 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:33,282 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 218 states and 293 transitions. cyclomatic complexity: 85 Stem has 34 letters. Loop has 10 letters. [2022-02-21 04:19:33,282 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:33,283 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 165 states and 223 transitions. cyclomatic complexity: 65 Stem has 25 letters. Loop has 10 letters. [2022-02-21 04:19:33,283 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:33,283 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 7 states, 6 states have (on average 3.0) internal successors, (18), 6 states have internal predecessors, (18), 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 25 letters. Loop has 10 letters. [2022-02-21 04:19:33,283 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:33,283 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 218 states and 293 transitions. cyclomatic complexity: 85 Stem has 25 letters. Loop has 10 letters. [2022-02-21 04:19:33,283 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:33,283 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 165 states and 223 transitions. cyclomatic complexity: 65 Stem has 31 letters. Loop has 6 letters. [2022-02-21 04:19:33,283 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:33,283 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 7 states, 6 states have (on average 3.0) internal successors, (18), 6 states have internal predecessors, (18), 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 31 letters. Loop has 6 letters. [2022-02-21 04:19:33,283 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:33,284 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 218 states and 293 transitions. cyclomatic complexity: 85 Stem has 31 letters. Loop has 6 letters. [2022-02-21 04:19:33,284 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:33,284 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 165 states and 223 transitions. cyclomatic complexity: 65 Stem has 33 letters. Loop has 10 letters. [2022-02-21 04:19:33,284 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:33,284 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 7 states, 6 states have (on average 3.0) internal successors, (18), 6 states have internal predecessors, (18), 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 33 letters. Loop has 10 letters. [2022-02-21 04:19:33,284 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:33,284 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 218 states and 293 transitions. cyclomatic complexity: 85 Stem has 33 letters. Loop has 10 letters. [2022-02-21 04:19:33,284 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:33,284 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 165 states and 223 transitions. cyclomatic complexity: 65 Stem has 32 letters. Loop has 4 letters. [2022-02-21 04:19:33,284 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:33,284 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 7 states, 6 states have (on average 3.0) internal successors, (18), 6 states have internal predecessors, (18), 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 32 letters. Loop has 4 letters. [2022-02-21 04:19:33,285 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:33,285 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 218 states and 293 transitions. cyclomatic complexity: 85 Stem has 32 letters. Loop has 4 letters. [2022-02-21 04:19:33,285 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:33,285 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 165 states and 223 transitions. cyclomatic complexity: 65 Stem has 31 letters. Loop has 4 letters. [2022-02-21 04:19:33,285 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:33,285 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 7 states, 6 states have (on average 3.0) internal successors, (18), 6 states have internal predecessors, (18), 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 31 letters. Loop has 4 letters. [2022-02-21 04:19:33,285 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:33,285 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 218 states and 293 transitions. cyclomatic complexity: 85 Stem has 31 letters. Loop has 4 letters. [2022-02-21 04:19:33,285 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:33,285 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 165 states and 223 transitions. cyclomatic complexity: 65 Stem has 28 letters. Loop has 6 letters. [2022-02-21 04:19:33,286 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:33,286 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 7 states, 6 states have (on average 3.0) internal successors, (18), 6 states have internal predecessors, (18), 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 28 letters. Loop has 6 letters. [2022-02-21 04:19:33,286 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:33,286 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 218 states and 293 transitions. cyclomatic complexity: 85 Stem has 28 letters. Loop has 6 letters. [2022-02-21 04:19:33,286 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:33,286 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 165 states and 223 transitions. cyclomatic complexity: 65 Stem has 29 letters. Loop has 6 letters. [2022-02-21 04:19:33,286 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:33,286 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 7 states, 6 states have (on average 3.0) internal successors, (18), 6 states have internal predecessors, (18), 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 29 letters. Loop has 6 letters. [2022-02-21 04:19:33,286 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:33,286 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 218 states and 293 transitions. cyclomatic complexity: 85 Stem has 29 letters. Loop has 6 letters. [2022-02-21 04:19:33,286 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:33,287 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 165 states and 223 transitions. cyclomatic complexity: 65 Stem has 27 letters. Loop has 6 letters. [2022-02-21 04:19:33,287 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:33,287 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 7 states, 6 states have (on average 3.0) internal successors, (18), 6 states have internal predecessors, (18), 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 27 letters. Loop has 6 letters. [2022-02-21 04:19:33,287 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:33,287 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 218 states and 293 transitions. cyclomatic complexity: 85 Stem has 27 letters. Loop has 6 letters. [2022-02-21 04:19:33,287 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:33,287 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 165 states and 223 transitions. cyclomatic complexity: 65 Stem has 20 letters. Loop has 6 letters. [2022-02-21 04:19:33,287 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:33,287 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 7 states, 6 states have (on average 3.0) internal successors, (18), 6 states have internal predecessors, (18), 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 20 letters. Loop has 6 letters. [2022-02-21 04:19:33,287 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:33,288 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 218 states and 293 transitions. cyclomatic complexity: 85 Stem has 20 letters. Loop has 6 letters. [2022-02-21 04:19:33,288 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:33,288 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 165 states and 223 transitions. cyclomatic complexity: 65 Stem has 18 letters. Loop has 6 letters. [2022-02-21 04:19:33,288 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:33,288 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 7 states, 6 states have (on average 3.0) internal successors, (18), 6 states have internal predecessors, (18), 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 18 letters. Loop has 6 letters. [2022-02-21 04:19:33,288 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:33,288 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 218 states and 293 transitions. cyclomatic complexity: 85 Stem has 18 letters. Loop has 6 letters. [2022-02-21 04:19:33,288 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:33,288 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 165 states and 223 transitions. cyclomatic complexity: 65 Stem has 19 letters. Loop has 6 letters. [2022-02-21 04:19:33,288 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:33,289 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 7 states, 6 states have (on average 3.0) internal successors, (18), 6 states have internal predecessors, (18), 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 19 letters. Loop has 6 letters. [2022-02-21 04:19:33,289 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:33,289 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 218 states and 293 transitions. cyclomatic complexity: 85 Stem has 19 letters. Loop has 6 letters. [2022-02-21 04:19:33,289 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:33,289 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 165 states and 223 transitions. cyclomatic complexity: 65 Stem has 17 letters. Loop has 6 letters. [2022-02-21 04:19:33,289 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:33,289 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 7 states, 6 states have (on average 3.0) internal successors, (18), 6 states have internal predecessors, (18), 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 17 letters. Loop has 6 letters. [2022-02-21 04:19:33,289 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:33,289 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 218 states and 293 transitions. cyclomatic complexity: 85 Stem has 17 letters. Loop has 6 letters. [2022-02-21 04:19:33,289 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:33,289 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 165 states and 223 transitions. cyclomatic complexity: 65 Stem has 16 letters. Loop has 6 letters. [2022-02-21 04:19:33,290 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:33,290 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 7 states, 6 states have (on average 3.0) internal successors, (18), 6 states have internal predecessors, (18), 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 6 letters. [2022-02-21 04:19:33,290 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:33,290 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 218 states and 293 transitions. cyclomatic complexity: 85 Stem has 16 letters. Loop has 6 letters. [2022-02-21 04:19:33,290 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:33,290 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 165 states and 223 transitions. cyclomatic complexity: 65 Stem has 21 letters. Loop has 6 letters. [2022-02-21 04:19:33,290 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:33,290 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 7 states, 6 states have (on average 3.0) internal successors, (18), 6 states have internal predecessors, (18), 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 6 letters. [2022-02-21 04:19:33,290 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:33,290 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 218 states and 293 transitions. cyclomatic complexity: 85 Stem has 21 letters. Loop has 6 letters. [2022-02-21 04:19:33,291 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:33,291 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 165 states and 223 transitions. cyclomatic complexity: 65 Stem has 94 letters. Loop has 47 letters. [2022-02-21 04:19:33,291 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:33,291 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 7 states, 6 states have (on average 3.0) internal successors, (18), 6 states have internal predecessors, (18), 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 94 letters. Loop has 47 letters. [2022-02-21 04:19:33,291 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:33,291 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 218 states and 293 transitions. cyclomatic complexity: 85 Stem has 94 letters. Loop has 47 letters. [2022-02-21 04:19:33,291 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:33,291 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 165 states and 223 transitions. cyclomatic complexity: 65 Stem has 136 letters. Loop has 47 letters. [2022-02-21 04:19:33,292 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:33,292 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 7 states, 6 states have (on average 3.0) internal successors, (18), 6 states have internal predecessors, (18), 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 136 letters. Loop has 47 letters. [2022-02-21 04:19:33,292 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:33,292 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 218 states and 293 transitions. cyclomatic complexity: 85 Stem has 136 letters. Loop has 47 letters. [2022-02-21 04:19:33,292 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:33,292 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 165 states and 223 transitions. cyclomatic complexity: 65 Stem has 96 letters. Loop has 47 letters. [2022-02-21 04:19:33,292 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:33,292 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 7 states, 6 states have (on average 3.0) internal successors, (18), 6 states have internal predecessors, (18), 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 96 letters. Loop has 47 letters. [2022-02-21 04:19:33,292 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:33,293 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 218 states and 293 transitions. cyclomatic complexity: 85 Stem has 96 letters. Loop has 47 letters. [2022-02-21 04:19:33,293 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:33,293 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 165 states and 223 transitions. cyclomatic complexity: 65 Stem has 93 letters. Loop has 47 letters. [2022-02-21 04:19:33,293 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:33,293 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 7 states, 6 states have (on average 3.0) internal successors, (18), 6 states have internal predecessors, (18), 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 93 letters. Loop has 47 letters. [2022-02-21 04:19:33,293 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:33,293 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 218 states and 293 transitions. cyclomatic complexity: 85 Stem has 93 letters. Loop has 47 letters. [2022-02-21 04:19:33,293 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:33,293 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 165 states and 223 transitions. cyclomatic complexity: 65 Stem has 137 letters. Loop has 47 letters. [2022-02-21 04:19:33,294 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:33,294 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 7 states, 6 states have (on average 3.0) internal successors, (18), 6 states have internal predecessors, (18), 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 137 letters. Loop has 47 letters. [2022-02-21 04:19:33,294 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:33,294 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 218 states and 293 transitions. cyclomatic complexity: 85 Stem has 137 letters. Loop has 47 letters. [2022-02-21 04:19:33,294 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:33,294 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 165 states and 223 transitions. cyclomatic complexity: 65 Stem has 92 letters. Loop has 47 letters. [2022-02-21 04:19:33,294 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:33,294 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 7 states, 6 states have (on average 3.0) internal successors, (18), 6 states have internal predecessors, (18), 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 92 letters. Loop has 47 letters. [2022-02-21 04:19:33,294 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:33,295 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 218 states and 293 transitions. cyclomatic complexity: 85 Stem has 92 letters. Loop has 47 letters. [2022-02-21 04:19:33,295 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:33,295 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 165 states and 223 transitions. cyclomatic complexity: 65 Stem has 95 letters. Loop has 47 letters. [2022-02-21 04:19:33,295 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:33,295 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 7 states, 6 states have (on average 3.0) internal successors, (18), 6 states have internal predecessors, (18), 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 95 letters. Loop has 47 letters. [2022-02-21 04:19:33,295 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:33,295 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 218 states and 293 transitions. cyclomatic complexity: 85 Stem has 95 letters. Loop has 47 letters. [2022-02-21 04:19:33,295 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:33,295 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 165 states and 223 transitions. cyclomatic complexity: 65 Stem has 91 letters. Loop has 47 letters. [2022-02-21 04:19:33,296 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:33,296 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 7 states, 6 states have (on average 3.0) internal successors, (18), 6 states have internal predecessors, (18), 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 91 letters. Loop has 47 letters. [2022-02-21 04:19:33,296 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:33,296 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 218 states and 293 transitions. cyclomatic complexity: 85 Stem has 91 letters. Loop has 47 letters. [2022-02-21 04:19:33,296 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:33,296 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 165 states and 223 transitions. cyclomatic complexity: 65 Stem has 136 letters. Loop has 47 letters. [2022-02-21 04:19:33,296 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:33,296 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 7 states, 6 states have (on average 3.0) internal successors, (18), 6 states have internal predecessors, (18), 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 136 letters. Loop has 47 letters. [2022-02-21 04:19:33,296 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:33,297 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 218 states and 293 transitions. cyclomatic complexity: 85 Stem has 136 letters. Loop has 47 letters. [2022-02-21 04:19:33,297 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:33,297 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 165 states and 223 transitions. cyclomatic complexity: 65 Stem has 75 letters. Loop has 33 letters. [2022-02-21 04:19:33,297 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:33,297 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 7 states, 6 states have (on average 3.0) internal successors, (18), 6 states have internal predecessors, (18), 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 75 letters. Loop has 33 letters. [2022-02-21 04:19:33,297 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:33,297 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 218 states and 293 transitions. cyclomatic complexity: 85 Stem has 75 letters. Loop has 33 letters. [2022-02-21 04:19:33,298 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:33,298 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 165 states and 223 transitions. cyclomatic complexity: 65 Stem has 74 letters. Loop has 33 letters. [2022-02-21 04:19:33,298 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:33,298 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 7 states, 6 states have (on average 3.0) internal successors, (18), 6 states have internal predecessors, (18), 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 74 letters. Loop has 33 letters. [2022-02-21 04:19:33,298 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:33,298 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 218 states and 293 transitions. cyclomatic complexity: 85 Stem has 74 letters. Loop has 33 letters. [2022-02-21 04:19:33,298 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:33,298 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 165 states and 223 transitions. cyclomatic complexity: 65 Stem has 102 letters. Loop has 33 letters. [2022-02-21 04:19:33,299 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:33,299 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 7 states, 6 states have (on average 3.0) internal successors, (18), 6 states have internal predecessors, (18), 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 102 letters. Loop has 33 letters. [2022-02-21 04:19:33,299 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:33,299 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 218 states and 293 transitions. cyclomatic complexity: 85 Stem has 102 letters. Loop has 33 letters. [2022-02-21 04:19:33,299 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:33,299 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 165 states and 223 transitions. cyclomatic complexity: 65 Stem has 72 letters. Loop has 33 letters. [2022-02-21 04:19:33,299 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:33,300 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 7 states, 6 states have (on average 3.0) internal successors, (18), 6 states have internal predecessors, (18), 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 72 letters. Loop has 33 letters. [2022-02-21 04:19:33,300 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:33,300 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 218 states and 293 transitions. cyclomatic complexity: 85 Stem has 72 letters. Loop has 33 letters. [2022-02-21 04:19:33,300 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:33,300 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 165 states and 223 transitions. cyclomatic complexity: 65 Stem has 73 letters. Loop has 33 letters. [2022-02-21 04:19:33,300 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:33,300 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 7 states, 6 states have (on average 3.0) internal successors, (18), 6 states have internal predecessors, (18), 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 73 letters. Loop has 33 letters. [2022-02-21 04:19:33,301 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:33,301 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 218 states and 293 transitions. cyclomatic complexity: 85 Stem has 73 letters. Loop has 33 letters. [2022-02-21 04:19:33,301 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:33,301 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 165 states and 223 transitions. cyclomatic complexity: 65 Stem has 70 letters. Loop has 33 letters. [2022-02-21 04:19:33,301 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:33,301 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 7 states, 6 states have (on average 3.0) internal successors, (18), 6 states have internal predecessors, (18), 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 70 letters. Loop has 33 letters. [2022-02-21 04:19:33,301 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:33,301 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 218 states and 293 transitions. cyclomatic complexity: 85 Stem has 70 letters. Loop has 33 letters. [2022-02-21 04:19:33,302 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:33,302 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 165 states and 223 transitions. cyclomatic complexity: 65 Stem has 71 letters. Loop has 33 letters. [2022-02-21 04:19:33,302 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:33,302 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 7 states, 6 states have (on average 3.0) internal successors, (18), 6 states have internal predecessors, (18), 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 71 letters. Loop has 33 letters. [2022-02-21 04:19:33,302 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:33,302 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 218 states and 293 transitions. cyclomatic complexity: 85 Stem has 71 letters. Loop has 33 letters. [2022-02-21 04:19:33,302 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:33,303 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 165 states and 223 transitions. cyclomatic complexity: 65 Stem has 101 letters. Loop has 33 letters. [2022-02-21 04:19:33,303 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:33,303 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 7 states, 6 states have (on average 3.0) internal successors, (18), 6 states have internal predecessors, (18), 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 101 letters. Loop has 33 letters. [2022-02-21 04:19:33,303 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:33,303 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 218 states and 293 transitions. cyclomatic complexity: 85 Stem has 101 letters. Loop has 33 letters. [2022-02-21 04:19:33,303 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:33,303 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 165 states and 223 transitions. cyclomatic complexity: 65 Stem has 101 letters. Loop has 33 letters. [2022-02-21 04:19:33,303 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:33,304 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 7 states, 6 states have (on average 3.0) internal successors, (18), 6 states have internal predecessors, (18), 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 101 letters. Loop has 33 letters. [2022-02-21 04:19:33,304 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:33,304 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 218 states and 293 transitions. cyclomatic complexity: 85 Stem has 101 letters. Loop has 33 letters. [2022-02-21 04:19:33,304 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:33,304 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 165 states and 223 transitions. cyclomatic complexity: 65 Stem has 18 letters. Loop has 5 letters. [2022-02-21 04:19:33,304 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:33,304 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 7 states, 6 states have (on average 3.0) internal successors, (18), 6 states have internal predecessors, (18), 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 18 letters. Loop has 5 letters. [2022-02-21 04:19:33,305 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:33,305 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 218 states and 293 transitions. cyclomatic complexity: 85 Stem has 18 letters. Loop has 5 letters. [2022-02-21 04:19:33,305 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:33,305 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 165 states and 223 transitions. cyclomatic complexity: 65 Stem has 22 letters. Loop has 3 letters. [2022-02-21 04:19:33,305 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:33,305 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 7 states, 6 states have (on average 3.0) internal successors, (18), 6 states have internal predecessors, (18), 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 22 letters. Loop has 3 letters. [2022-02-21 04:19:33,305 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:33,305 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 218 states and 293 transitions. cyclomatic complexity: 85 Stem has 22 letters. Loop has 3 letters. [2022-02-21 04:19:33,305 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:33,305 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 165 states and 223 transitions. cyclomatic complexity: 65 Stem has 19 letters. Loop has 5 letters. [2022-02-21 04:19:33,306 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:33,306 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 7 states, 6 states have (on average 3.0) internal successors, (18), 6 states have internal predecessors, (18), 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 19 letters. Loop has 5 letters. [2022-02-21 04:19:33,306 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:33,306 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 218 states and 293 transitions. cyclomatic complexity: 85 Stem has 19 letters. Loop has 5 letters. [2022-02-21 04:19:33,306 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:33,306 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 165 states and 223 transitions. cyclomatic complexity: 65 Stem has 17 letters. Loop has 5 letters. [2022-02-21 04:19:33,306 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:33,306 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 7 states, 6 states have (on average 3.0) internal successors, (18), 6 states have internal predecessors, (18), 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 17 letters. Loop has 5 letters. [2022-02-21 04:19:33,306 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:33,306 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 218 states and 293 transitions. cyclomatic complexity: 85 Stem has 17 letters. Loop has 5 letters. [2022-02-21 04:19:33,306 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:33,307 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 165 states and 223 transitions. cyclomatic complexity: 65 Stem has 20 letters. Loop has 3 letters. [2022-02-21 04:19:33,307 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:33,307 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 7 states, 6 states have (on average 3.0) internal successors, (18), 6 states have internal predecessors, (18), 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 20 letters. Loop has 3 letters. [2022-02-21 04:19:33,307 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:33,307 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 218 states and 293 transitions. cyclomatic complexity: 85 Stem has 20 letters. Loop has 3 letters. [2022-02-21 04:19:33,307 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:33,307 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 165 states and 223 transitions. cyclomatic complexity: 65 Stem has 21 letters. Loop has 3 letters. [2022-02-21 04:19:33,307 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:33,307 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 7 states, 6 states have (on average 3.0) internal successors, (18), 6 states have internal predecessors, (18), 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 3 letters. [2022-02-21 04:19:33,307 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:33,307 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 218 states and 293 transitions. cyclomatic complexity: 85 Stem has 21 letters. Loop has 3 letters. [2022-02-21 04:19:33,308 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:33,308 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 165 states and 223 transitions. cyclomatic complexity: 65 Stem has 1 letters. Loop has 6 letters. [2022-02-21 04:19:33,308 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:33,308 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 7 states, 6 states have (on average 3.0) internal successors, (18), 6 states have internal predecessors, (18), 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 6 letters. [2022-02-21 04:19:33,308 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:33,308 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 218 states and 293 transitions. cyclomatic complexity: 85 Stem has 1 letters. Loop has 6 letters. [2022-02-21 04:19:33,308 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:33,308 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 165 states and 223 transitions. cyclomatic complexity: 65 Stem has 28 letters. Loop has 6 letters. [2022-02-21 04:19:33,308 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:33,308 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 7 states, 6 states have (on average 3.0) internal successors, (18), 6 states have internal predecessors, (18), 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 28 letters. Loop has 6 letters. [2022-02-21 04:19:33,308 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:33,309 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 218 states and 293 transitions. cyclomatic complexity: 85 Stem has 28 letters. Loop has 6 letters. [2022-02-21 04:19:33,309 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:33,309 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 165 states and 223 transitions. cyclomatic complexity: 65 Stem has 29 letters. Loop has 10 letters. [2022-02-21 04:19:33,309 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:33,309 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 7 states, 6 states have (on average 3.0) internal successors, (18), 6 states have internal predecessors, (18), 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 29 letters. Loop has 10 letters. [2022-02-21 04:19:33,309 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:33,309 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 218 states and 293 transitions. cyclomatic complexity: 85 Stem has 29 letters. Loop has 10 letters. [2022-02-21 04:19:33,309 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:33,309 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 165 states and 223 transitions. cyclomatic complexity: 65 Stem has 29 letters. Loop has 6 letters. [2022-02-21 04:19:33,309 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:33,310 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 7 states, 6 states have (on average 3.0) internal successors, (18), 6 states have internal predecessors, (18), 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 29 letters. Loop has 6 letters. [2022-02-21 04:19:33,310 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:33,310 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 218 states and 293 transitions. cyclomatic complexity: 85 Stem has 29 letters. Loop has 6 letters. [2022-02-21 04:19:33,310 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:33,310 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 165 states and 223 transitions. cyclomatic complexity: 65 Stem has 30 letters. Loop has 4 letters. [2022-02-21 04:19:33,310 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:33,310 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 7 states, 6 states have (on average 3.0) internal successors, (18), 6 states have internal predecessors, (18), 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 30 letters. Loop has 4 letters. [2022-02-21 04:19:33,310 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:33,310 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 218 states and 293 transitions. cyclomatic complexity: 85 Stem has 30 letters. Loop has 4 letters. [2022-02-21 04:19:33,310 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:33,311 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 165 states and 223 transitions. cyclomatic complexity: 65 Stem has 30 letters. Loop has 6 letters. [2022-02-21 04:19:33,311 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:33,311 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 7 states, 6 states have (on average 3.0) internal successors, (18), 6 states have internal predecessors, (18), 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 30 letters. Loop has 6 letters. [2022-02-21 04:19:33,311 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:33,311 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 218 states and 293 transitions. cyclomatic complexity: 85 Stem has 30 letters. Loop has 6 letters. [2022-02-21 04:19:33,311 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:33,311 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 165 states and 223 transitions. cyclomatic complexity: 65 Stem has 25 letters. Loop has 10 letters. [2022-02-21 04:19:33,311 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:33,311 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 7 states, 6 states have (on average 3.0) internal successors, (18), 6 states have internal predecessors, (18), 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 25 letters. Loop has 10 letters. [2022-02-21 04:19:33,311 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:33,311 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 218 states and 293 transitions. cyclomatic complexity: 85 Stem has 25 letters. Loop has 10 letters. [2022-02-21 04:19:33,312 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:33,312 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 165 states and 223 transitions. cyclomatic complexity: 65 Stem has 31 letters. Loop has 4 letters. [2022-02-21 04:19:33,312 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:33,312 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 7 states, 6 states have (on average 3.0) internal successors, (18), 6 states have internal predecessors, (18), 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 31 letters. Loop has 4 letters. [2022-02-21 04:19:33,312 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:33,312 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 218 states and 293 transitions. cyclomatic complexity: 85 Stem has 31 letters. Loop has 4 letters. [2022-02-21 04:19:33,312 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:33,312 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 165 states and 223 transitions. cyclomatic complexity: 65 Stem has 31 letters. Loop has 6 letters. [2022-02-21 04:19:33,312 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:33,312 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 7 states, 6 states have (on average 3.0) internal successors, (18), 6 states have internal predecessors, (18), 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 31 letters. Loop has 6 letters. [2022-02-21 04:19:33,312 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:33,313 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 218 states and 293 transitions. cyclomatic complexity: 85 Stem has 31 letters. Loop has 6 letters. [2022-02-21 04:19:33,313 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:33,313 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 165 states and 223 transitions. cyclomatic complexity: 65 Stem has 32 letters. Loop has 4 letters. [2022-02-21 04:19:33,313 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:33,313 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 7 states, 6 states have (on average 3.0) internal successors, (18), 6 states have internal predecessors, (18), 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 32 letters. Loop has 4 letters. [2022-02-21 04:19:33,313 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:33,313 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 218 states and 293 transitions. cyclomatic complexity: 85 Stem has 32 letters. Loop has 4 letters. [2022-02-21 04:19:33,313 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:33,313 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 165 states and 223 transitions. cyclomatic complexity: 65 Stem has 26 letters. Loop has 6 letters. [2022-02-21 04:19:33,313 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:33,314 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 7 states, 6 states have (on average 3.0) internal successors, (18), 6 states have internal predecessors, (18), 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 26 letters. Loop has 6 letters. [2022-02-21 04:19:33,314 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:33,314 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 218 states and 293 transitions. cyclomatic complexity: 85 Stem has 26 letters. Loop has 6 letters. [2022-02-21 04:19:33,314 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:33,314 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 165 states and 223 transitions. cyclomatic complexity: 65 Stem has 33 letters. Loop has 4 letters. [2022-02-21 04:19:33,314 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:33,314 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 7 states, 6 states have (on average 3.0) internal successors, (18), 6 states have internal predecessors, (18), 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 33 letters. Loop has 4 letters. [2022-02-21 04:19:33,314 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:33,314 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 218 states and 293 transitions. cyclomatic complexity: 85 Stem has 33 letters. Loop has 4 letters. [2022-02-21 04:19:33,314 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:33,314 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 165 states and 223 transitions. cyclomatic complexity: 65 Stem has 33 letters. Loop has 10 letters. [2022-02-21 04:19:33,315 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:33,315 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 7 states, 6 states have (on average 3.0) internal successors, (18), 6 states have internal predecessors, (18), 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 33 letters. Loop has 10 letters. [2022-02-21 04:19:33,315 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:33,315 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 218 states and 293 transitions. cyclomatic complexity: 85 Stem has 33 letters. Loop has 10 letters. [2022-02-21 04:19:33,315 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:33,315 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 165 states and 223 transitions. cyclomatic complexity: 65 Stem has 34 letters. Loop has 10 letters. [2022-02-21 04:19:33,315 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:33,315 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 7 states, 6 states have (on average 3.0) internal successors, (18), 6 states have internal predecessors, (18), 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 34 letters. Loop has 10 letters. [2022-02-21 04:19:33,315 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:33,315 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 218 states and 293 transitions. cyclomatic complexity: 85 Stem has 34 letters. Loop has 10 letters. [2022-02-21 04:19:33,315 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:33,316 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 165 states and 223 transitions. cyclomatic complexity: 65 Stem has 27 letters. Loop has 6 letters. [2022-02-21 04:19:33,316 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:33,316 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 7 states, 6 states have (on average 3.0) internal successors, (18), 6 states have internal predecessors, (18), 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 27 letters. Loop has 6 letters. [2022-02-21 04:19:33,316 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:33,316 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 218 states and 293 transitions. cyclomatic complexity: 85 Stem has 27 letters. Loop has 6 letters. [2022-02-21 04:19:33,316 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:33,316 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 165 states and 223 transitions. cyclomatic complexity: 65 Stem has 118 letters. Loop has 47 letters. [2022-02-21 04:19:33,316 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:33,316 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 7 states, 6 states have (on average 3.0) internal successors, (18), 6 states have internal predecessors, (18), 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 118 letters. Loop has 47 letters. [2022-02-21 04:19:33,317 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:33,317 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 218 states and 293 transitions. cyclomatic complexity: 85 Stem has 118 letters. Loop has 47 letters. [2022-02-21 04:19:33,317 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:33,317 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 165 states and 223 transitions. cyclomatic complexity: 65 Stem has 80 letters. Loop has 47 letters. [2022-02-21 04:19:33,317 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:33,317 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 7 states, 6 states have (on average 3.0) internal successors, (18), 6 states have internal predecessors, (18), 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 80 letters. Loop has 47 letters. [2022-02-21 04:19:33,317 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:33,317 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 218 states and 293 transitions. cyclomatic complexity: 85 Stem has 80 letters. Loop has 47 letters. [2022-02-21 04:19:33,317 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:33,318 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 165 states and 223 transitions. cyclomatic complexity: 65 Stem has 81 letters. Loop has 47 letters. [2022-02-21 04:19:33,318 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:33,318 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 7 states, 6 states have (on average 3.0) internal successors, (18), 6 states have internal predecessors, (18), 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 81 letters. Loop has 47 letters. [2022-02-21 04:19:33,318 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:33,318 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 218 states and 293 transitions. cyclomatic complexity: 85 Stem has 81 letters. Loop has 47 letters. [2022-02-21 04:19:33,318 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:33,318 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 165 states and 223 transitions. cyclomatic complexity: 65 Stem has 77 letters. Loop has 47 letters. [2022-02-21 04:19:33,318 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:33,318 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 7 states, 6 states have (on average 3.0) internal successors, (18), 6 states have internal predecessors, (18), 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 77 letters. Loop has 47 letters. [2022-02-21 04:19:33,319 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:33,319 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 218 states and 293 transitions. cyclomatic complexity: 85 Stem has 77 letters. Loop has 47 letters. [2022-02-21 04:19:33,319 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:33,319 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 165 states and 223 transitions. cyclomatic complexity: 65 Stem has 82 letters. Loop has 47 letters. [2022-02-21 04:19:33,319 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:33,319 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 7 states, 6 states have (on average 3.0) internal successors, (18), 6 states have internal predecessors, (18), 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 82 letters. Loop has 47 letters. [2022-02-21 04:19:33,319 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:33,319 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 218 states and 293 transitions. cyclomatic complexity: 85 Stem has 82 letters. Loop has 47 letters. [2022-02-21 04:19:33,319 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:33,320 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 165 states and 223 transitions. cyclomatic complexity: 65 Stem has 78 letters. Loop has 47 letters. [2022-02-21 04:19:33,320 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:33,320 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 7 states, 6 states have (on average 3.0) internal successors, (18), 6 states have internal predecessors, (18), 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 78 letters. Loop has 47 letters. [2022-02-21 04:19:33,320 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:33,320 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 218 states and 293 transitions. cyclomatic complexity: 85 Stem has 78 letters. Loop has 47 letters. [2022-02-21 04:19:33,320 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:33,320 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 165 states and 223 transitions. cyclomatic complexity: 65 Stem has 79 letters. Loop has 47 letters. [2022-02-21 04:19:33,320 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:33,320 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 7 states, 6 states have (on average 3.0) internal successors, (18), 6 states have internal predecessors, (18), 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 79 letters. Loop has 47 letters. [2022-02-21 04:19:33,321 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:33,321 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 218 states and 293 transitions. cyclomatic complexity: 85 Stem has 79 letters. Loop has 47 letters. [2022-02-21 04:19:33,321 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:33,321 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 165 states and 223 transitions. cyclomatic complexity: 65 Stem has 117 letters. Loop has 47 letters. [2022-02-21 04:19:33,321 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:33,321 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 7 states, 6 states have (on average 3.0) internal successors, (18), 6 states have internal predecessors, (18), 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 117 letters. Loop has 47 letters. [2022-02-21 04:19:33,321 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:33,321 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 218 states and 293 transitions. cyclomatic complexity: 85 Stem has 117 letters. Loop has 47 letters. [2022-02-21 04:19:33,321 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:33,321 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 165 states and 223 transitions. cyclomatic complexity: 65 Stem has 117 letters. Loop has 47 letters. [2022-02-21 04:19:33,322 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:33,322 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 7 states, 6 states have (on average 3.0) internal successors, (18), 6 states have internal predecessors, (18), 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 117 letters. Loop has 47 letters. [2022-02-21 04:19:33,322 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:33,322 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 218 states and 293 transitions. cyclomatic complexity: 85 Stem has 117 letters. Loop has 47 letters. [2022-02-21 04:19:33,322 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:33,322 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 165 states and 223 transitions. cyclomatic complexity: 65 Stem has 53 letters. Loop has 6 letters. [2022-02-21 04:19:33,322 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:33,322 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 7 states, 6 states have (on average 3.0) internal successors, (18), 6 states have internal predecessors, (18), 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 53 letters. Loop has 6 letters. [2022-02-21 04:19:33,322 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:33,323 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 218 states and 293 transitions. cyclomatic complexity: 85 Stem has 53 letters. Loop has 6 letters. [2022-02-21 04:19:33,323 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:33,323 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 165 states and 223 transitions. cyclomatic complexity: 65 Stem has 54 letters. Loop has 6 letters. [2022-02-21 04:19:33,323 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:33,323 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 7 states, 6 states have (on average 3.0) internal successors, (18), 6 states have internal predecessors, (18), 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 54 letters. Loop has 6 letters. [2022-02-21 04:19:33,323 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:33,323 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 218 states and 293 transitions. cyclomatic complexity: 85 Stem has 54 letters. Loop has 6 letters. [2022-02-21 04:19:33,323 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:33,323 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 165 states and 223 transitions. cyclomatic complexity: 65 Stem has 49 letters. Loop has 6 letters. [2022-02-21 04:19:33,323 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:33,324 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 7 states, 6 states have (on average 3.0) internal successors, (18), 6 states have internal predecessors, (18), 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 49 letters. Loop has 6 letters. [2022-02-21 04:19:33,324 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:33,324 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 218 states and 293 transitions. cyclomatic complexity: 85 Stem has 49 letters. Loop has 6 letters. [2022-02-21 04:19:33,324 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:33,324 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 165 states and 223 transitions. cyclomatic complexity: 65 Stem has 50 letters. Loop has 6 letters. [2022-02-21 04:19:33,324 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:33,324 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 7 states, 6 states have (on average 3.0) internal successors, (18), 6 states have internal predecessors, (18), 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 50 letters. Loop has 6 letters. [2022-02-21 04:19:33,324 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:33,324 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 218 states and 293 transitions. cyclomatic complexity: 85 Stem has 50 letters. Loop has 6 letters. [2022-02-21 04:19:33,324 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:33,325 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 165 states and 223 transitions. cyclomatic complexity: 65 Stem has 51 letters. Loop has 6 letters. [2022-02-21 04:19:33,325 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:33,325 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 7 states, 6 states have (on average 3.0) internal successors, (18), 6 states have internal predecessors, (18), 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 51 letters. Loop has 6 letters. [2022-02-21 04:19:33,325 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:33,325 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 218 states and 293 transitions. cyclomatic complexity: 85 Stem has 51 letters. Loop has 6 letters. [2022-02-21 04:19:33,325 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:33,325 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 165 states and 223 transitions. cyclomatic complexity: 65 Stem has 52 letters. Loop has 6 letters. [2022-02-21 04:19:33,325 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:33,325 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 7 states, 6 states have (on average 3.0) internal successors, (18), 6 states have internal predecessors, (18), 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 52 letters. Loop has 6 letters. [2022-02-21 04:19:33,325 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:33,326 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 218 states and 293 transitions. cyclomatic complexity: 85 Stem has 52 letters. Loop has 6 letters. [2022-02-21 04:19:33,326 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:33,326 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 165 states and 223 transitions. cyclomatic complexity: 65 Stem has 119 letters. Loop has 42 letters. [2022-02-21 04:19:33,326 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:33,326 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 7 states, 6 states have (on average 3.0) internal successors, (18), 6 states have internal predecessors, (18), 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 119 letters. Loop has 42 letters. [2022-02-21 04:19:33,326 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:33,326 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 218 states and 293 transitions. cyclomatic complexity: 85 Stem has 119 letters. Loop has 42 letters. [2022-02-21 04:19:33,326 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:33,326 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 165 states and 223 transitions. cyclomatic complexity: 65 Stem has 79 letters. Loop has 42 letters. [2022-02-21 04:19:33,327 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:33,327 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 7 states, 6 states have (on average 3.0) internal successors, (18), 6 states have internal predecessors, (18), 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 79 letters. Loop has 42 letters. [2022-02-21 04:19:33,327 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:33,327 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 218 states and 293 transitions. cyclomatic complexity: 85 Stem has 79 letters. Loop has 42 letters. [2022-02-21 04:19:33,327 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:33,327 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 165 states and 223 transitions. cyclomatic complexity: 65 Stem has 120 letters. Loop has 42 letters. [2022-02-21 04:19:33,327 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:33,327 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 7 states, 6 states have (on average 3.0) internal successors, (18), 6 states have internal predecessors, (18), 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 120 letters. Loop has 42 letters. [2022-02-21 04:19:33,327 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:33,327 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 218 states and 293 transitions. cyclomatic complexity: 85 Stem has 120 letters. Loop has 42 letters. [2022-02-21 04:19:33,328 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:33,328 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 165 states and 223 transitions. cyclomatic complexity: 65 Stem has 80 letters. Loop has 42 letters. [2022-02-21 04:19:33,328 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:33,328 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 7 states, 6 states have (on average 3.0) internal successors, (18), 6 states have internal predecessors, (18), 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 80 letters. Loop has 42 letters. [2022-02-21 04:19:33,328 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:33,328 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 218 states and 293 transitions. cyclomatic complexity: 85 Stem has 80 letters. Loop has 42 letters. [2022-02-21 04:19:33,328 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:33,328 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 165 states and 223 transitions. cyclomatic complexity: 65 Stem has 81 letters. Loop has 42 letters. [2022-02-21 04:19:33,328 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:33,329 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 7 states, 6 states have (on average 3.0) internal successors, (18), 6 states have internal predecessors, (18), 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 81 letters. Loop has 42 letters. [2022-02-21 04:19:33,329 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:33,329 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 218 states and 293 transitions. cyclomatic complexity: 85 Stem has 81 letters. Loop has 42 letters. [2022-02-21 04:19:33,329 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:33,329 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 165 states and 223 transitions. cyclomatic complexity: 65 Stem has 82 letters. Loop has 42 letters. [2022-02-21 04:19:33,329 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:33,329 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 7 states, 6 states have (on average 3.0) internal successors, (18), 6 states have internal predecessors, (18), 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 82 letters. Loop has 42 letters. [2022-02-21 04:19:33,329 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:33,329 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 218 states and 293 transitions. cyclomatic complexity: 85 Stem has 82 letters. Loop has 42 letters. [2022-02-21 04:19:33,330 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:33,330 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 165 states and 223 transitions. cyclomatic complexity: 65 Stem has 83 letters. Loop has 42 letters. [2022-02-21 04:19:33,330 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:33,330 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 7 states, 6 states have (on average 3.0) internal successors, (18), 6 states have internal predecessors, (18), 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 83 letters. Loop has 42 letters. [2022-02-21 04:19:33,330 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:33,330 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 218 states and 293 transitions. cyclomatic complexity: 85 Stem has 83 letters. Loop has 42 letters. [2022-02-21 04:19:33,330 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:33,330 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 165 states and 223 transitions. cyclomatic complexity: 65 Stem has 84 letters. Loop has 42 letters. [2022-02-21 04:19:33,330 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:33,330 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 7 states, 6 states have (on average 3.0) internal successors, (18), 6 states have internal predecessors, (18), 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 84 letters. Loop has 42 letters. [2022-02-21 04:19:33,331 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:33,331 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 218 states and 293 transitions. cyclomatic complexity: 85 Stem has 84 letters. Loop has 42 letters. [2022-02-21 04:19:33,331 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:33,331 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 165 states and 223 transitions. cyclomatic complexity: 65 Stem has 119 letters. Loop has 42 letters. [2022-02-21 04:19:33,331 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:33,331 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 7 states, 6 states have (on average 3.0) internal successors, (18), 6 states have internal predecessors, (18), 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 119 letters. Loop has 42 letters. [2022-02-21 04:19:33,331 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:33,331 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 218 states and 293 transitions. cyclomatic complexity: 85 Stem has 119 letters. Loop has 42 letters. [2022-02-21 04:19:33,331 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:33,332 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 165 states and 223 transitions. cyclomatic complexity: 65 Stem has 20 letters. Loop has 3 letters. [2022-02-21 04:19:33,332 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:33,332 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 7 states, 6 states have (on average 3.0) internal successors, (18), 6 states have internal predecessors, (18), 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 20 letters. Loop has 3 letters. [2022-02-21 04:19:33,332 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:33,332 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 218 states and 293 transitions. cyclomatic complexity: 85 Stem has 20 letters. Loop has 3 letters. [2022-02-21 04:19:33,332 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:33,332 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 165 states and 223 transitions. cyclomatic complexity: 65 Stem has 22 letters. Loop has 3 letters. [2022-02-21 04:19:33,332 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:33,332 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 7 states, 6 states have (on average 3.0) internal successors, (18), 6 states have internal predecessors, (18), 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 22 letters. Loop has 3 letters. [2022-02-21 04:19:33,332 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:33,332 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 218 states and 293 transitions. cyclomatic complexity: 85 Stem has 22 letters. Loop has 3 letters. [2022-02-21 04:19:33,333 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:33,333 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 165 states and 223 transitions. cyclomatic complexity: 65 Stem has 19 letters. Loop has 5 letters. [2022-02-21 04:19:33,333 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:33,333 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 7 states, 6 states have (on average 3.0) internal successors, (18), 6 states have internal predecessors, (18), 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 19 letters. Loop has 5 letters. [2022-02-21 04:19:33,333 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:33,333 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 218 states and 293 transitions. cyclomatic complexity: 85 Stem has 19 letters. Loop has 5 letters. [2022-02-21 04:19:33,333 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:33,333 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 165 states and 223 transitions. cyclomatic complexity: 65 Stem has 17 letters. Loop has 5 letters. [2022-02-21 04:19:33,333 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:33,333 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 7 states, 6 states have (on average 3.0) internal successors, (18), 6 states have internal predecessors, (18), 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 17 letters. Loop has 5 letters. [2022-02-21 04:19:33,334 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:33,334 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 218 states and 293 transitions. cyclomatic complexity: 85 Stem has 17 letters. Loop has 5 letters. [2022-02-21 04:19:33,334 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:33,334 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 165 states and 223 transitions. cyclomatic complexity: 65 Stem has 21 letters. Loop has 3 letters. [2022-02-21 04:19:33,334 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:33,334 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 7 states, 6 states have (on average 3.0) internal successors, (18), 6 states have internal predecessors, (18), 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 3 letters. [2022-02-21 04:19:33,334 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:33,334 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 218 states and 293 transitions. cyclomatic complexity: 85 Stem has 21 letters. Loop has 3 letters. [2022-02-21 04:19:33,334 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:33,334 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 165 states and 223 transitions. cyclomatic complexity: 65 Stem has 18 letters. Loop has 5 letters. [2022-02-21 04:19:33,334 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:33,335 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 7 states, 6 states have (on average 3.0) internal successors, (18), 6 states have internal predecessors, (18), 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 18 letters. Loop has 5 letters. [2022-02-21 04:19:33,335 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:33,335 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 218 states and 293 transitions. cyclomatic complexity: 85 Stem has 18 letters. Loop has 5 letters. [2022-02-21 04:19:33,335 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:33,335 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 165 states and 223 transitions. cyclomatic complexity: 65 Stem has 54 letters. Loop has 5 letters. [2022-02-21 04:19:33,335 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:33,335 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 7 states, 6 states have (on average 3.0) internal successors, (18), 6 states have internal predecessors, (18), 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 54 letters. Loop has 5 letters. [2022-02-21 04:19:33,335 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:33,335 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 218 states and 293 transitions. cyclomatic complexity: 85 Stem has 54 letters. Loop has 5 letters. [2022-02-21 04:19:33,335 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:33,336 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 165 states and 223 transitions. cyclomatic complexity: 65 Stem has 55 letters. Loop has 3 letters. [2022-02-21 04:19:33,336 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:33,336 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 7 states, 6 states have (on average 3.0) internal successors, (18), 6 states have internal predecessors, (18), 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 55 letters. Loop has 3 letters. [2022-02-21 04:19:33,336 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:33,336 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 218 states and 293 transitions. cyclomatic complexity: 85 Stem has 55 letters. Loop has 3 letters. [2022-02-21 04:19:33,336 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:33,336 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 165 states and 223 transitions. cyclomatic complexity: 65 Stem has 56 letters. Loop has 3 letters. [2022-02-21 04:19:33,336 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:33,336 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 7 states, 6 states have (on average 3.0) internal successors, (18), 6 states have internal predecessors, (18), 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 56 letters. Loop has 3 letters. [2022-02-21 04:19:33,336 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:33,336 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 218 states and 293 transitions. cyclomatic complexity: 85 Stem has 56 letters. Loop has 3 letters. [2022-02-21 04:19:33,337 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:33,337 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 165 states and 223 transitions. cyclomatic complexity: 65 Stem has 57 letters. Loop has 3 letters. [2022-02-21 04:19:33,337 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:33,337 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 7 states, 6 states have (on average 3.0) internal successors, (18), 6 states have internal predecessors, (18), 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 57 letters. Loop has 3 letters. [2022-02-21 04:19:33,337 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:33,337 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 218 states and 293 transitions. cyclomatic complexity: 85 Stem has 57 letters. Loop has 3 letters. [2022-02-21 04:19:33,337 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:33,337 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 165 states and 223 transitions. cyclomatic complexity: 65 Stem has 52 letters. Loop has 5 letters. [2022-02-21 04:19:33,337 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:33,338 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 7 states, 6 states have (on average 3.0) internal successors, (18), 6 states have internal predecessors, (18), 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 52 letters. Loop has 5 letters. [2022-02-21 04:19:33,338 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:33,338 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 218 states and 293 transitions. cyclomatic complexity: 85 Stem has 52 letters. Loop has 5 letters. [2022-02-21 04:19:33,338 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:33,338 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 165 states and 223 transitions. cyclomatic complexity: 65 Stem has 53 letters. Loop has 5 letters. [2022-02-21 04:19:33,338 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:33,338 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 7 states, 6 states have (on average 3.0) internal successors, (18), 6 states have internal predecessors, (18), 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 53 letters. Loop has 5 letters. [2022-02-21 04:19:33,338 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:33,338 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 218 states and 293 transitions. cyclomatic complexity: 85 Stem has 53 letters. Loop has 5 letters. [2022-02-21 04:19:33,338 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:33,338 INFO L161 tractBuchiDifference]: Finished testing correctness of buchiDifferenceNCSBLazy3 [2022-02-21 04:19:33,339 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 6 states have (on average 3.0) internal successors, (18), 6 states have internal predecessors, (18), 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 04:19:33,339 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 43 transitions. [2022-02-21 04:19:33,339 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 43 transitions. Stem has 16 letters. Loop has 6 letters. [2022-02-21 04:19:33,340 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:33,340 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 43 transitions. Stem has 22 letters. Loop has 6 letters. [2022-02-21 04:19:33,340 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:33,340 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 43 transitions. Stem has 16 letters. Loop has 12 letters. [2022-02-21 04:19:33,340 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:33,340 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 218 states and 293 transitions. cyclomatic complexity: 85 [2022-02-21 04:19:33,344 INFO L131 ngComponentsAnalysis]: Automaton has 6 accepting balls. 48 [2022-02-21 04:19:33,349 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 218 states to 206 states and 279 transitions. [2022-02-21 04:19:33,349 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 183 [2022-02-21 04:19:33,349 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 185 [2022-02-21 04:19:33,349 INFO L73 IsDeterministic]: Start isDeterministic. Operand 206 states and 279 transitions. [2022-02-21 04:19:33,350 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2022-02-21 04:19:33,350 INFO L681 BuchiCegarLoop]: Abstraction has 206 states and 279 transitions. [2022-02-21 04:19:33,350 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 206 states and 279 transitions. [2022-02-21 04:19:33,352 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 206 to 181. [2022-02-21 04:19:33,352 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-21 04:19:33,353 INFO L82 GeneralOperation]: Start isEquivalent. First operand 206 states and 279 transitions. Second operand has 181 states, 134 states have (on average 1.291044776119403) internal successors, (173), 141 states have internal predecessors, (173), 28 states have call successors, (28), 18 states have call predecessors, (28), 19 states have return successors, (44), 21 states have call predecessors, (44), 23 states have call successors, (44) [2022-02-21 04:19:33,353 INFO L74 IsIncluded]: Start isIncluded. First operand 206 states and 279 transitions. Second operand has 181 states, 134 states have (on average 1.291044776119403) internal successors, (173), 141 states have internal predecessors, (173), 28 states have call successors, (28), 18 states have call predecessors, (28), 19 states have return successors, (44), 21 states have call predecessors, (44), 23 states have call successors, (44) [2022-02-21 04:19:33,353 INFO L87 Difference]: Start difference. First operand 206 states and 279 transitions. Second operand has 181 states, 134 states have (on average 1.291044776119403) internal successors, (173), 141 states have internal predecessors, (173), 28 states have call successors, (28), 18 states have call predecessors, (28), 19 states have return successors, (44), 21 states have call predecessors, (44), 23 states have call successors, (44) [2022-02-21 04:19:33,354 INFO L149 Difference]: Subtrahend was not deterministic. Recomputing result with determinization. [2022-02-21 04:19:33,381 INFO L93 Difference]: Finished difference Result 403 states and 512 transitions. [2022-02-21 04:19:33,381 INFO L276 IsEmpty]: Start isEmpty. Operand 403 states and 512 transitions. [2022-02-21 04:19:33,382 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 04:19:33,382 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 04:19:33,382 INFO L74 IsIncluded]: Start isIncluded. First operand has 181 states, 134 states have (on average 1.291044776119403) internal successors, (173), 141 states have internal predecessors, (173), 28 states have call successors, (28), 18 states have call predecessors, (28), 19 states have return successors, (44), 21 states have call predecessors, (44), 23 states have call successors, (44) Second operand 206 states and 279 transitions. [2022-02-21 04:19:33,383 INFO L87 Difference]: Start difference. First operand has 181 states, 134 states have (on average 1.291044776119403) internal successors, (173), 141 states have internal predecessors, (173), 28 states have call successors, (28), 18 states have call predecessors, (28), 19 states have return successors, (44), 21 states have call predecessors, (44), 23 states have call successors, (44) Second operand 206 states and 279 transitions. [2022-02-21 04:19:33,383 INFO L149 Difference]: Subtrahend was not deterministic. Recomputing result with determinization. [2022-02-21 04:19:33,395 INFO L93 Difference]: Finished difference Result 440 states and 557 transitions. [2022-02-21 04:19:33,395 INFO L276 IsEmpty]: Start isEmpty. Operand 440 states and 557 transitions. [2022-02-21 04:19:33,396 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 04:19:33,396 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 04:19:33,396 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-21 04:19:33,396 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-21 04:19:33,397 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 181 states, 134 states have (on average 1.291044776119403) internal successors, (173), 141 states have internal predecessors, (173), 28 states have call successors, (28), 18 states have call predecessors, (28), 19 states have return successors, (44), 21 states have call predecessors, (44), 23 states have call successors, (44) [2022-02-21 04:19:33,400 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 181 states to 181 states and 245 transitions. [2022-02-21 04:19:33,400 INFO L704 BuchiCegarLoop]: Abstraction has 181 states and 245 transitions. [2022-02-21 04:19:33,400 INFO L587 BuchiCegarLoop]: Abstraction has 181 states and 245 transitions. [2022-02-21 04:19:33,400 INFO L425 BuchiCegarLoop]: ======== Iteration 8============ [2022-02-21 04:19:33,400 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 181 states and 245 transitions. [2022-02-21 04:19:33,401 INFO L131 ngComponentsAnalysis]: Automaton has 5 accepting balls. 42 [2022-02-21 04:19:33,401 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 04:19:33,401 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 04:19:33,401 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-21 04:19:33,401 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1] [2022-02-21 04:19:33,402 INFO L791 eck$LassoCheckResult]: Stem: 12595#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(9, 2);call #Ultimate.allocInit(12, 3); 12564#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet12#1, main_#t~ret13#1, main_#t~nondet14#1, main_#t~nondet15#1, main_#t~ret16#1, main_#t~short17#1, main_~n~0#1, main_~result~0#1, main_~f1~0#1, main_~f2~0#1;main_~n~0#1 := main_#t~nondet12#1;havoc main_#t~nondet12#1; 12565#L78 assume !(main_~n~0#1 < 1 || main_~n~0#1 > 46340);assume { :begin_inline_is_prime } true;is_prime_#in~n#1 := main_~n~0#1;havoc is_prime_#res#1;havoc is_prime_#t~ret9#1, is_prime_~n#1;is_prime_~n#1 := is_prime_#in~n#1; 12604#L53 call is_prime_#t~ret9#1 := is_prime_(is_prime_~n#1, is_prime_~n#1 - 1);< 12626#is_prime_ENTRY ~n := #in~n;~m := #in~m; 12646#L58 assume !(~n <= 1); 12645#L61 assume 2 == ~n;#res := 1; 12643#is_prime_FINAL assume true; 12633#is_prime_EXIT >#118#return; 12623#L53-1 is_prime_#res#1 := is_prime_#t~ret9#1;havoc is_prime_#t~ret9#1; 12555#L53-2 main_#t~ret13#1 := is_prime_#res#1;assume { :end_inline_is_prime } true;main_~result~0#1 := main_#t~ret13#1;havoc main_#t~ret13#1;main_~f1~0#1 := main_#t~nondet14#1;havoc main_#t~nondet14#1; 12556#L85 assume !(main_~f1~0#1 < 1 || main_~f1~0#1 > 46340);main_~f2~0#1 := main_#t~nondet15#1;havoc main_#t~nondet15#1; 12562#L91 assume !(main_~f2~0#1 < 1 || main_~f2~0#1 > 46340);main_#t~short17#1 := 1 == main_~result~0#1; 12566#L97 assume main_#t~short17#1; 12567#L97-1 call main_#t~ret16#1 := mult(main_~f1~0#1, main_~f2~0#1);< 12591#multENTRY ~n := #in~n;~m := #in~m; 12592#L18 assume !(~m < 0); 12593#L21 [2022-02-21 04:19:33,402 INFO L793 eck$LassoCheckResult]: Loop: 12593#L21 assume !(0 == ~m); 12571#L24 assume !(1 == ~m); 12572#L27 call #t~ret5 := mult(~n, ~m - 1);< 12580#multENTRY ~n := #in~n;~m := #in~m; 12603#L18 assume !(~m < 0); 12593#L21 [2022-02-21 04:19:33,402 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 04:19:33,402 INFO L85 PathProgramCache]: Analyzing trace with hash 2081524284, now seen corresponding path program 1 times [2022-02-21 04:19:33,402 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 04:19:33,402 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [864406817] [2022-02-21 04:19:33,403 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 04:19:33,403 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 04:19:33,411 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 04:19:33,411 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-02-21 04:19:33,415 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 04:19:33,417 INFO L138 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-02-21 04:19:33,417 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 04:19:33,417 INFO L85 PathProgramCache]: Analyzing trace with hash 61272212, now seen corresponding path program 1 times [2022-02-21 04:19:33,417 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 04:19:33,418 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [901652791] [2022-02-21 04:19:33,418 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 04:19:33,418 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 04:19:33,420 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 04:19:33,420 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-02-21 04:19:33,421 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 04:19:33,422 INFO L138 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-02-21 04:19:33,422 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 04:19:33,423 INFO L85 PathProgramCache]: Analyzing trace with hash 1269404473, now seen corresponding path program 1 times [2022-02-21 04:19:33,423 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 04:19:33,423 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1291557564] [2022-02-21 04:19:33,423 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 04:19:33,423 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 04:19:33,429 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 04:19:33,430 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-02-21 04:19:33,433 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 04:19:33,435 INFO L138 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-02-21 04:19:33,524 INFO L210 LassoAnalysis]: Preferences: [2022-02-21 04:19:33,525 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2022-02-21 04:19:33,525 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2022-02-21 04:19:33,525 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2022-02-21 04:19:33,525 INFO L129 ssoRankerPreferences]: Use exernal solver: true [2022-02-21 04:19:33,525 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 04:19:33,525 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2022-02-21 04:19:33,525 INFO L132 ssoRankerPreferences]: Path of dumped script: [2022-02-21 04:19:33,525 INFO L133 ssoRankerPreferences]: Filename of dumped script: Primes.c_Iteration8_Loop [2022-02-21 04:19:33,525 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2022-02-21 04:19:33,525 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2022-02-21 04:19:33,526 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 04:19:33,528 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 04:19:33,531 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 04:19:33,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 04:19:33,539 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 04:19:33,598 INFO L294 LassoAnalysis]: Preprocessing complete. [2022-02-21 04:19:33,598 INFO L404 LassoAnalysis]: Checking for nontermination... [2022-02-21 04:19:33,598 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 04:19:33,598 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 04:19:33,599 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 04:19:33,600 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 04:19:33,602 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2022-02-21 04:19:33,602 INFO L160 nArgumentSynthesizer]: Using integer mode. [2022-02-21 04:19:33,622 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2022-02-21 04:19:33,622 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {mult_#res=0} Honda state: {mult_#res=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2022-02-21 04:19:33,638 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 04:19:33,638 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 04:19:33,639 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 04:19:33,648 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 04:19:33,649 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 04:19:33,650 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2022-02-21 04:19:33,650 INFO L160 nArgumentSynthesizer]: Using integer mode. [2022-02-21 04:19:33,671 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2022-02-21 04:19:33,671 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {mult_~n=-8, mult_#in~n=-8} Honda state: {mult_~n=-8, mult_#in~n=-8} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2022-02-21 04:19:33,688 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (54)] Forceful destruction successful, exit code 0 [2022-02-21 04:19:33,688 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 04:19:33,688 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 04:19:33,689 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 04:19:33,690 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 04:19:33,691 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2022-02-21 04:19:33,691 INFO L160 nArgumentSynthesizer]: Using integer mode. [2022-02-21 04:19:33,712 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2022-02-21 04:19:33,712 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {mult_#t~ret5=0} Honda state: {mult_#t~ret5=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2022-02-21 04:19:33,728 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 04:19:33,728 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 04:19:33,728 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 04:19:33,729 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 04:19:33,730 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 04:19:33,732 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2022-02-21 04:19:33,732 INFO L160 nArgumentSynthesizer]: Using integer mode. [2022-02-21 04:19:33,770 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 04:19:33,770 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 04:19:33,771 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 04:19:33,772 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 04:19:33,772 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 04:19:33,774 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2022-02-21 04:19:33,774 INFO L160 nArgumentSynthesizer]: Using integer mode. [2022-02-21 04:19:34,772 INFO L444 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2022-02-21 04:19:34,776 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (57)] Ended with exit code 0 [2022-02-21 04:19:34,776 INFO L210 LassoAnalysis]: Preferences: [2022-02-21 04:19:34,776 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2022-02-21 04:19:34,777 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2022-02-21 04:19:34,777 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2022-02-21 04:19:34,777 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2022-02-21 04:19:34,777 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 04:19:34,777 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2022-02-21 04:19:34,777 INFO L132 ssoRankerPreferences]: Path of dumped script: [2022-02-21 04:19:34,777 INFO L133 ssoRankerPreferences]: Filename of dumped script: Primes.c_Iteration8_Loop [2022-02-21 04:19:34,777 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2022-02-21 04:19:34,777 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2022-02-21 04:19:34,778 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 04:19:34,779 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 04:19:34,783 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 04:19:34,785 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 04:19:34,791 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 04:19:34,850 INFO L294 LassoAnalysis]: Preprocessing complete. [2022-02-21 04:19:34,851 INFO L490 LassoAnalysis]: Using template 'affine'. [2022-02-21 04:19:34,851 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 04:19:34,851 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 04:19:34,852 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 04:19:34,852 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 04:19:34,854 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 04:19:34,860 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 04:19:34,861 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 04:19:34,861 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 04:19:34,861 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 04:19:34,861 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 04:19:34,861 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-02-21 04:19:34,861 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 04:19:34,862 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 04:19:34,884 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (58)] Ended with exit code 0 [2022-02-21 04:19:34,885 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 04:19:34,885 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 04:19:34,886 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 04:19:34,886 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 04:19:34,887 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 04:19:34,893 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 04:19:34,893 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 04:19:34,893 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 04:19:34,893 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 04:19:34,893 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 04:19:34,894 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-02-21 04:19:34,894 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 04:19:34,895 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 04:19:34,918 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (59)] Ended with exit code 0 [2022-02-21 04:19:34,918 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 04:19:34,918 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 04:19:34,919 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 04:19:34,920 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 04:19:34,921 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 04:19:34,926 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 04:19:34,926 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 04:19:34,926 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 04:19:34,926 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 04:19:34,926 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 04:19:34,927 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-02-21 04:19:34,927 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 04:19:34,928 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 04:19:34,950 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 04:19:34,950 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 04:19:34,950 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 04:19:34,951 INFO L229 MonitoredProcess]: Starting monitored process 61 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 04:19:34,952 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (61)] Waiting until timeout for monitored process [2022-02-21 04:19:34,953 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 04:19:34,959 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 04:19:34,960 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 04:19:34,960 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 04:19:34,960 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 04:19:34,960 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 04:19:34,960 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-02-21 04:19:34,960 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 04:19:34,974 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2022-02-21 04:19:34,977 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2022-02-21 04:19:34,977 INFO L444 ModelExtractionUtils]: 1 out of 4 variables were initially zero. Simplification set additionally 1 variables to zero. [2022-02-21 04:19:34,977 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 04:19:34,977 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 04:19:34,978 INFO L229 MonitoredProcess]: Starting monitored process 62 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 04:19:34,979 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (62)] Waiting until timeout for monitored process [2022-02-21 04:19:34,980 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2022-02-21 04:19:34,980 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2022-02-21 04:19:34,980 INFO L513 LassoAnalysis]: Proved termination. [2022-02-21 04:19:34,980 INFO L515 LassoAnalysis]: Termination argument consisting of: Ranking function f(mult_~m) = 1*mult_~m Supporting invariants [] [2022-02-21 04:19:34,995 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (61)] Ended with exit code 0 [2022-02-21 04:19:34,999 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2022-02-21 04:19:35,002 INFO L390 LassoCheck]: Loop: "assume !(0 == ~m);" "assume !(1 == ~m);" "call #t~ret5 := mult(~n, ~m - 1);"< "~n := #in~n;~m := #in~m;" "assume !(~m < 0);" [2022-02-21 04:19:35,006 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 04:19:35,014 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 04:19:35,031 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 04:19:35,031 INFO L263 TraceCheckSpWp]: Trace formula consists of 131 conjuncts, 6 conjunts are in the unsatisfiable core [2022-02-21 04:19:35,036 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 04:19:35,036 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-21 04:19:35,088 INFO L290 TraceCheckUtils]: 0: Hoare triple {14409#unseeded} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(9, 2);call #Ultimate.allocInit(12, 3); {14409#unseeded} is VALID [2022-02-21 04:19:35,088 INFO L290 TraceCheckUtils]: 1: Hoare triple {14409#unseeded} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet12#1, main_#t~ret13#1, main_#t~nondet14#1, main_#t~nondet15#1, main_#t~ret16#1, main_#t~short17#1, main_~n~0#1, main_~result~0#1, main_~f1~0#1, main_~f2~0#1;main_~n~0#1 := main_#t~nondet12#1;havoc main_#t~nondet12#1; {14409#unseeded} is VALID [2022-02-21 04:19:35,088 INFO L290 TraceCheckUtils]: 2: Hoare triple {14409#unseeded} assume !(main_~n~0#1 < 1 || main_~n~0#1 > 46340);assume { :begin_inline_is_prime } true;is_prime_#in~n#1 := main_~n~0#1;havoc is_prime_#res#1;havoc is_prime_#t~ret9#1, is_prime_~n#1;is_prime_~n#1 := is_prime_#in~n#1; {14409#unseeded} is VALID [2022-02-21 04:19:35,089 INFO L272 TraceCheckUtils]: 3: Hoare triple {14409#unseeded} call is_prime_#t~ret9#1 := is_prime_(is_prime_~n#1, is_prime_~n#1 - 1); {14436#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2022-02-21 04:19:35,089 INFO L290 TraceCheckUtils]: 4: Hoare triple {14436#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} ~n := #in~n;~m := #in~m; {14436#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2022-02-21 04:19:35,090 INFO L290 TraceCheckUtils]: 5: Hoare triple {14436#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} assume !(~n <= 1); {14436#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2022-02-21 04:19:35,090 INFO L290 TraceCheckUtils]: 6: Hoare triple {14436#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} assume 2 == ~n;#res := 1; {14436#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2022-02-21 04:19:35,090 INFO L290 TraceCheckUtils]: 7: Hoare triple {14436#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} assume true; {14436#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2022-02-21 04:19:35,091 INFO L284 TraceCheckUtils]: 8: Hoare quadruple {14436#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} {14409#unseeded} #118#return; {14409#unseeded} is VALID [2022-02-21 04:19:35,091 INFO L290 TraceCheckUtils]: 9: Hoare triple {14409#unseeded} is_prime_#res#1 := is_prime_#t~ret9#1;havoc is_prime_#t~ret9#1; {14409#unseeded} is VALID [2022-02-21 04:19:35,093 INFO L290 TraceCheckUtils]: 10: Hoare triple {14409#unseeded} main_#t~ret13#1 := is_prime_#res#1;assume { :end_inline_is_prime } true;main_~result~0#1 := main_#t~ret13#1;havoc main_#t~ret13#1;main_~f1~0#1 := main_#t~nondet14#1;havoc main_#t~nondet14#1; {14409#unseeded} is VALID [2022-02-21 04:19:35,093 INFO L290 TraceCheckUtils]: 11: Hoare triple {14409#unseeded} assume !(main_~f1~0#1 < 1 || main_~f1~0#1 > 46340);main_~f2~0#1 := main_#t~nondet15#1;havoc main_#t~nondet15#1; {14409#unseeded} is VALID [2022-02-21 04:19:35,093 INFO L290 TraceCheckUtils]: 12: Hoare triple {14409#unseeded} assume !(main_~f2~0#1 < 1 || main_~f2~0#1 > 46340);main_#t~short17#1 := 1 == main_~result~0#1; {14409#unseeded} is VALID [2022-02-21 04:19:35,094 INFO L290 TraceCheckUtils]: 13: Hoare triple {14409#unseeded} assume main_#t~short17#1; {14409#unseeded} is VALID [2022-02-21 04:19:35,094 INFO L272 TraceCheckUtils]: 14: Hoare triple {14409#unseeded} call main_#t~ret16#1 := mult(main_~f1~0#1, main_~f2~0#1); {14409#unseeded} is VALID [2022-02-21 04:19:35,094 INFO L290 TraceCheckUtils]: 15: Hoare triple {14409#unseeded} ~n := #in~n;~m := #in~m; {14409#unseeded} is VALID [2022-02-21 04:19:35,094 INFO L290 TraceCheckUtils]: 16: Hoare triple {14409#unseeded} assume !(~m < 0); {14409#unseeded} is VALID [2022-02-21 04:19:35,100 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 04:19:35,100 INFO L263 TraceCheckSpWp]: Trace formula consists of 43 conjuncts, 7 conjunts are in the unsatisfiable core [2022-02-21 04:19:35,104 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 04:19:35,104 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-21 04:19:35,153 INFO L290 TraceCheckUtils]: 0: Hoare triple {14412#(>= oldRank0 mult_~m)} assume !(0 == ~m); {14412#(>= oldRank0 mult_~m)} is VALID [2022-02-21 04:19:35,153 INFO L290 TraceCheckUtils]: 1: Hoare triple {14412#(>= oldRank0 mult_~m)} assume !(1 == ~m); {14412#(>= oldRank0 mult_~m)} is VALID [2022-02-21 04:19:35,154 INFO L272 TraceCheckUtils]: 2: Hoare triple {14412#(>= oldRank0 mult_~m)} call #t~ret5 := mult(~n, ~m - 1); {14482#(<= (+ |mult_#in~m| 1) oldRank0)} is VALID [2022-02-21 04:19:35,154 INFO L290 TraceCheckUtils]: 3: Hoare triple {14482#(<= (+ |mult_#in~m| 1) oldRank0)} ~n := #in~n;~m := #in~m; {14486#(<= (+ mult_~m 1) oldRank0)} is VALID [2022-02-21 04:19:35,155 INFO L290 TraceCheckUtils]: 4: Hoare triple {14486#(<= (+ mult_~m 1) oldRank0)} assume !(~m < 0); {14422#(or (and (>= oldRank0 0) (> oldRank0 mult_~m)) unseeded)} is VALID [2022-02-21 04:19:35,155 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 04:19:35,155 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 6 states, 6 states have (on average 3.0) internal successors, (18), 5 states have internal predecessors, (18), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-21 04:19:35,164 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 04:19:35,165 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 6 states, 6 states have (on average 3.0) internal successors, (18), 5 states have internal predecessors, (18), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Stem has 17 letters. Loop has 5 letters. [2022-02-21 04:19:35,165 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:35,165 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 04:19:35,165 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 181 states and 245 transitions. cyclomatic complexity: 72 Second operand has 6 states, 6 states have (on average 3.0) internal successors, (18), 5 states have internal predecessors, (18), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-21 04:19:35,283 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 181 states and 245 transitions. cyclomatic complexity: 72. Second operand has 6 states, 6 states have (on average 3.0) internal successors, (18), 5 states have internal predecessors, (18), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Result 205 states and 272 transitions. Complement of second has 17 states. [2022-02-21 04:19:35,284 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 6 states 2 stem states 3 non-accepting loop states 1 accepting loop states [2022-02-21 04:19:35,284 INFO L123 tractBuchiDifference]: Start testing correctness of buchiDifferenceNCSBLazy3 [2022-02-21 04:19:35,284 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 181 states and 245 transitions. cyclomatic complexity: 72 [2022-02-21 04:19:35,284 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 04:19:35,284 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 04:19:35,284 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 6 states, 6 states have (on average 3.0) internal successors, (18), 5 states have internal predecessors, (18), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-21 04:19:35,285 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2022-02-21 04:19:35,285 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 04:19:35,285 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 04:19:35,292 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 205 states and 272 transitions. [2022-02-21 04:19:35,293 INFO L131 ngComponentsAnalysis]: Automaton has 5 accepting balls. 42 [2022-02-21 04:19:35,293 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 04:19:35,293 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 04:19:35,294 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 181 states and 245 transitions. cyclomatic complexity: 72 [2022-02-21 04:19:35,324 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 44 examples of accepted words. [2022-02-21 04:19:35,324 INFO L70 LassoExtractor]: Start lassoExtractor. Operand has 6 states, 6 states have (on average 3.0) internal successors, (18), 5 states have internal predecessors, (18), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-21 04:19:35,325 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2022-02-21 04:19:35,325 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 1 examples of accepted words. [2022-02-21 04:19:35,325 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 205 states and 272 transitions. cyclomatic complexity: 76 [2022-02-21 04:19:35,332 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 44 examples of accepted words. [2022-02-21 04:19:35,332 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 181 states and 245 transitions. cyclomatic complexity: 72 Stem has 17 letters. Loop has 5 letters. [2022-02-21 04:19:35,332 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:35,333 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 6 states, 6 states have (on average 3.0) internal successors, (18), 5 states have internal predecessors, (18), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Stem has 17 letters. Loop has 5 letters. [2022-02-21 04:19:35,333 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:35,333 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 205 states and 272 transitions. cyclomatic complexity: 76 Stem has 17 letters. Loop has 5 letters. [2022-02-21 04:19:35,333 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:35,333 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 181 states and 245 transitions. cyclomatic complexity: 72 Stem has 2 letters. Loop has 4 letters. [2022-02-21 04:19:35,333 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:35,333 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 6 states, 6 states have (on average 3.0) internal successors, (18), 5 states have internal predecessors, (18), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Stem has 2 letters. Loop has 4 letters. [2022-02-21 04:19:35,333 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:35,334 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 205 states and 272 transitions. cyclomatic complexity: 76 Stem has 2 letters. Loop has 4 letters. [2022-02-21 04:19:35,334 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:35,334 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 181 states and 245 transitions. cyclomatic complexity: 72 Stem has 23 letters. Loop has 3 letters. [2022-02-21 04:19:35,334 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:35,334 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 6 states, 6 states have (on average 3.0) internal successors, (18), 5 states have internal predecessors, (18), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Stem has 23 letters. Loop has 3 letters. [2022-02-21 04:19:35,334 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:35,334 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 205 states and 272 transitions. cyclomatic complexity: 76 Stem has 23 letters. Loop has 3 letters. [2022-02-21 04:19:35,334 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:35,334 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 181 states and 245 transitions. cyclomatic complexity: 72 Stem has 205 letters. Loop has 205 letters. [2022-02-21 04:19:35,335 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:35,335 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 6 states, 6 states have (on average 3.0) internal successors, (18), 5 states have internal predecessors, (18), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Stem has 205 letters. Loop has 205 letters. [2022-02-21 04:19:35,335 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:35,335 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 205 states and 272 transitions. cyclomatic complexity: 76 Stem has 205 letters. Loop has 205 letters. [2022-02-21 04:19:35,335 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:35,335 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 181 states and 245 transitions. cyclomatic complexity: 72 Stem has 181 letters. Loop has 181 letters. [2022-02-21 04:19:35,335 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:35,335 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 6 states, 6 states have (on average 3.0) internal successors, (18), 5 states have internal predecessors, (18), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Stem has 181 letters. Loop has 181 letters. [2022-02-21 04:19:35,336 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:35,336 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 205 states and 272 transitions. cyclomatic complexity: 76 Stem has 181 letters. Loop has 181 letters. [2022-02-21 04:19:35,336 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:35,336 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 181 states and 245 transitions. cyclomatic complexity: 72 Stem has 6 letters. Loop has 6 letters. [2022-02-21 04:19:35,336 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:35,336 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 6 states, 6 states have (on average 3.0) internal successors, (18), 5 states have internal predecessors, (18), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Stem has 6 letters. Loop has 6 letters. [2022-02-21 04:19:35,336 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:35,336 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 205 states and 272 transitions. cyclomatic complexity: 76 Stem has 6 letters. Loop has 6 letters. [2022-02-21 04:19:35,336 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:35,336 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 181 states and 245 transitions. cyclomatic complexity: 72 Stem has 28 letters. Loop has 6 letters. [2022-02-21 04:19:35,337 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:35,337 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 6 states, 6 states have (on average 3.0) internal successors, (18), 5 states have internal predecessors, (18), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Stem has 28 letters. Loop has 6 letters. [2022-02-21 04:19:35,337 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:35,337 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 205 states and 272 transitions. cyclomatic complexity: 76 Stem has 28 letters. Loop has 6 letters. [2022-02-21 04:19:35,337 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:35,337 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 181 states and 245 transitions. cyclomatic complexity: 72 Stem has 29 letters. Loop has 6 letters. [2022-02-21 04:19:35,337 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:35,337 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 6 states, 6 states have (on average 3.0) internal successors, (18), 5 states have internal predecessors, (18), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Stem has 29 letters. Loop has 6 letters. [2022-02-21 04:19:35,338 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:35,338 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 205 states and 272 transitions. cyclomatic complexity: 76 Stem has 29 letters. Loop has 6 letters. [2022-02-21 04:19:35,338 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:35,338 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 181 states and 245 transitions. cyclomatic complexity: 72 Stem has 27 letters. Loop has 6 letters. [2022-02-21 04:19:35,338 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:35,338 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 6 states, 6 states have (on average 3.0) internal successors, (18), 5 states have internal predecessors, (18), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Stem has 27 letters. Loop has 6 letters. [2022-02-21 04:19:35,338 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:35,338 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 205 states and 272 transitions. cyclomatic complexity: 76 Stem has 27 letters. Loop has 6 letters. [2022-02-21 04:19:35,339 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:35,339 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 181 states and 245 transitions. cyclomatic complexity: 72 Stem has 31 letters. Loop has 6 letters. [2022-02-21 04:19:35,339 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:35,339 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 6 states, 6 states have (on average 3.0) internal successors, (18), 5 states have internal predecessors, (18), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Stem has 31 letters. Loop has 6 letters. [2022-02-21 04:19:35,339 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:35,339 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 205 states and 272 transitions. cyclomatic complexity: 76 Stem has 31 letters. Loop has 6 letters. [2022-02-21 04:19:35,340 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:35,340 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 181 states and 245 transitions. cyclomatic complexity: 72 Stem has 30 letters. Loop has 6 letters. [2022-02-21 04:19:35,340 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:35,340 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 6 states, 6 states have (on average 3.0) internal successors, (18), 5 states have internal predecessors, (18), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Stem has 30 letters. Loop has 6 letters. [2022-02-21 04:19:35,340 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:35,340 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 205 states and 272 transitions. cyclomatic complexity: 76 Stem has 30 letters. Loop has 6 letters. [2022-02-21 04:19:35,340 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:35,340 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 181 states and 245 transitions. cyclomatic complexity: 72 Stem has 25 letters. Loop has 10 letters. [2022-02-21 04:19:35,341 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:35,341 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 6 states, 6 states have (on average 3.0) internal successors, (18), 5 states have internal predecessors, (18), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Stem has 25 letters. Loop has 10 letters. [2022-02-21 04:19:35,341 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:35,341 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 205 states and 272 transitions. cyclomatic complexity: 76 Stem has 25 letters. Loop has 10 letters. [2022-02-21 04:19:35,341 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:35,341 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 181 states and 245 transitions. cyclomatic complexity: 72 Stem has 34 letters. Loop has 10 letters. [2022-02-21 04:19:35,341 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:35,341 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 6 states, 6 states have (on average 3.0) internal successors, (18), 5 states have internal predecessors, (18), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Stem has 34 letters. Loop has 10 letters. [2022-02-21 04:19:35,342 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:35,342 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 205 states and 272 transitions. cyclomatic complexity: 76 Stem has 34 letters. Loop has 10 letters. [2022-02-21 04:19:35,342 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:35,342 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 181 states and 245 transitions. cyclomatic complexity: 72 Stem has 33 letters. Loop has 10 letters. [2022-02-21 04:19:35,342 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:35,343 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 6 states, 6 states have (on average 3.0) internal successors, (18), 5 states have internal predecessors, (18), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Stem has 33 letters. Loop has 10 letters. [2022-02-21 04:19:35,343 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:35,343 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 205 states and 272 transitions. cyclomatic complexity: 76 Stem has 33 letters. Loop has 10 letters. [2022-02-21 04:19:35,343 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:35,343 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 181 states and 245 transitions. cyclomatic complexity: 72 Stem has 32 letters. Loop has 4 letters. [2022-02-21 04:19:35,344 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:35,344 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 6 states, 6 states have (on average 3.0) internal successors, (18), 5 states have internal predecessors, (18), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Stem has 32 letters. Loop has 4 letters. [2022-02-21 04:19:35,344 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:35,344 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 205 states and 272 transitions. cyclomatic complexity: 76 Stem has 32 letters. Loop has 4 letters. [2022-02-21 04:19:35,344 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:35,344 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 181 states and 245 transitions. cyclomatic complexity: 72 Stem has 31 letters. Loop has 4 letters. [2022-02-21 04:19:35,344 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:35,344 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 6 states, 6 states have (on average 3.0) internal successors, (18), 5 states have internal predecessors, (18), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Stem has 31 letters. Loop has 4 letters. [2022-02-21 04:19:35,345 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:35,345 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 205 states and 272 transitions. cyclomatic complexity: 76 Stem has 31 letters. Loop has 4 letters. [2022-02-21 04:19:35,345 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:35,345 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 181 states and 245 transitions. cyclomatic complexity: 72 Stem has 33 letters. Loop has 4 letters. [2022-02-21 04:19:35,345 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:35,345 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 6 states, 6 states have (on average 3.0) internal successors, (18), 5 states have internal predecessors, (18), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Stem has 33 letters. Loop has 4 letters. [2022-02-21 04:19:35,345 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:35,345 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 205 states and 272 transitions. cyclomatic complexity: 76 Stem has 33 letters. Loop has 4 letters. [2022-02-21 04:19:35,346 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:35,346 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 181 states and 245 transitions. cyclomatic complexity: 72 Stem has 29 letters. Loop has 10 letters. [2022-02-21 04:19:35,346 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:35,346 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 6 states, 6 states have (on average 3.0) internal successors, (18), 5 states have internal predecessors, (18), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Stem has 29 letters. Loop has 10 letters. [2022-02-21 04:19:35,346 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:35,346 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 205 states and 272 transitions. cyclomatic complexity: 76 Stem has 29 letters. Loop has 10 letters. [2022-02-21 04:19:35,346 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:35,346 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 181 states and 245 transitions. cyclomatic complexity: 72 Stem has 30 letters. Loop has 4 letters. [2022-02-21 04:19:35,346 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:35,347 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 6 states, 6 states have (on average 3.0) internal successors, (18), 5 states have internal predecessors, (18), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Stem has 30 letters. Loop has 4 letters. [2022-02-21 04:19:35,347 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:35,347 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 205 states and 272 transitions. cyclomatic complexity: 76 Stem has 30 letters. Loop has 4 letters. [2022-02-21 04:19:35,347 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:35,347 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 181 states and 245 transitions. cyclomatic complexity: 72 Stem has 26 letters. Loop has 6 letters. [2022-02-21 04:19:35,347 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:35,347 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 6 states, 6 states have (on average 3.0) internal successors, (18), 5 states have internal predecessors, (18), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Stem has 26 letters. Loop has 6 letters. [2022-02-21 04:19:35,347 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:35,348 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 205 states and 272 transitions. cyclomatic complexity: 76 Stem has 26 letters. Loop has 6 letters. [2022-02-21 04:19:35,348 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:35,348 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 181 states and 245 transitions. cyclomatic complexity: 72 Stem has 49 letters. Loop has 6 letters. [2022-02-21 04:19:35,348 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:35,348 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 6 states, 6 states have (on average 3.0) internal successors, (18), 5 states have internal predecessors, (18), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Stem has 49 letters. Loop has 6 letters. [2022-02-21 04:19:35,348 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:35,348 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 205 states and 272 transitions. cyclomatic complexity: 76 Stem has 49 letters. Loop has 6 letters. [2022-02-21 04:19:35,348 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:35,349 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 181 states and 245 transitions. cyclomatic complexity: 72 Stem has 53 letters. Loop has 6 letters. [2022-02-21 04:19:35,349 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:35,349 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 6 states, 6 states have (on average 3.0) internal successors, (18), 5 states have internal predecessors, (18), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Stem has 53 letters. Loop has 6 letters. [2022-02-21 04:19:35,349 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:35,349 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 205 states and 272 transitions. cyclomatic complexity: 76 Stem has 53 letters. Loop has 6 letters. [2022-02-21 04:19:35,349 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:35,349 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 181 states and 245 transitions. cyclomatic complexity: 72 Stem has 54 letters. Loop has 6 letters. [2022-02-21 04:19:35,349 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:35,350 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 6 states, 6 states have (on average 3.0) internal successors, (18), 5 states have internal predecessors, (18), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Stem has 54 letters. Loop has 6 letters. [2022-02-21 04:19:35,350 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:35,350 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 205 states and 272 transitions. cyclomatic complexity: 76 Stem has 54 letters. Loop has 6 letters. [2022-02-21 04:19:35,350 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:35,350 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 181 states and 245 transitions. cyclomatic complexity: 72 Stem has 52 letters. Loop has 6 letters. [2022-02-21 04:19:35,350 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:35,350 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 6 states, 6 states have (on average 3.0) internal successors, (18), 5 states have internal predecessors, (18), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Stem has 52 letters. Loop has 6 letters. [2022-02-21 04:19:35,350 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:35,351 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 205 states and 272 transitions. cyclomatic complexity: 76 Stem has 52 letters. Loop has 6 letters. [2022-02-21 04:19:35,351 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:35,351 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (62)] Forceful destruction successful, exit code 0 [2022-02-21 04:19:35,354 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 181 states and 245 transitions. cyclomatic complexity: 72 Stem has 50 letters. Loop has 6 letters. [2022-02-21 04:19:35,354 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:35,354 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 6 states, 6 states have (on average 3.0) internal successors, (18), 5 states have internal predecessors, (18), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Stem has 50 letters. Loop has 6 letters. [2022-02-21 04:19:35,354 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:35,354 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 205 states and 272 transitions. cyclomatic complexity: 76 Stem has 50 letters. Loop has 6 letters. [2022-02-21 04:19:35,355 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:35,355 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 181 states and 245 transitions. cyclomatic complexity: 72 Stem has 51 letters. Loop has 6 letters. [2022-02-21 04:19:35,355 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:35,355 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 6 states, 6 states have (on average 3.0) internal successors, (18), 5 states have internal predecessors, (18), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Stem has 51 letters. Loop has 6 letters. [2022-02-21 04:19:35,355 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:35,355 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 205 states and 272 transitions. cyclomatic complexity: 76 Stem has 51 letters. Loop has 6 letters. [2022-02-21 04:19:35,355 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:35,356 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 181 states and 245 transitions. cyclomatic complexity: 72 Stem has 77 letters. Loop has 33 letters. [2022-02-21 04:19:35,356 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:35,356 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 6 states, 6 states have (on average 3.0) internal successors, (18), 5 states have internal predecessors, (18), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Stem has 77 letters. Loop has 33 letters. [2022-02-21 04:19:35,356 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:35,356 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 205 states and 272 transitions. cyclomatic complexity: 76 Stem has 77 letters. Loop has 33 letters. [2022-02-21 04:19:35,356 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:35,356 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 181 states and 245 transitions. cyclomatic complexity: 72 Stem has 78 letters. Loop has 33 letters. [2022-02-21 04:19:35,357 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:35,357 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 6 states, 6 states have (on average 3.0) internal successors, (18), 5 states have internal predecessors, (18), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Stem has 78 letters. Loop has 33 letters. [2022-02-21 04:19:35,357 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:35,357 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 205 states and 272 transitions. cyclomatic complexity: 76 Stem has 78 letters. Loop has 33 letters. [2022-02-21 04:19:35,357 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:35,357 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 181 states and 245 transitions. cyclomatic complexity: 72 Stem has 79 letters. Loop has 33 letters. [2022-02-21 04:19:35,358 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:35,358 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 6 states, 6 states have (on average 3.0) internal successors, (18), 5 states have internal predecessors, (18), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Stem has 79 letters. Loop has 33 letters. [2022-02-21 04:19:35,358 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:35,358 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 205 states and 272 transitions. cyclomatic complexity: 76 Stem has 79 letters. Loop has 33 letters. [2022-02-21 04:19:35,358 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:35,358 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 181 states and 245 transitions. cyclomatic complexity: 72 Stem has 80 letters. Loop has 33 letters. [2022-02-21 04:19:35,358 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:35,359 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 6 states, 6 states have (on average 3.0) internal successors, (18), 5 states have internal predecessors, (18), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Stem has 80 letters. Loop has 33 letters. [2022-02-21 04:19:35,359 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:35,359 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 205 states and 272 transitions. cyclomatic complexity: 76 Stem has 80 letters. Loop has 33 letters. [2022-02-21 04:19:35,359 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:35,359 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 181 states and 245 transitions. cyclomatic complexity: 72 Stem has 82 letters. Loop has 33 letters. [2022-02-21 04:19:35,359 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:35,360 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 6 states, 6 states have (on average 3.0) internal successors, (18), 5 states have internal predecessors, (18), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Stem has 82 letters. Loop has 33 letters. [2022-02-21 04:19:35,360 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:35,360 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 205 states and 272 transitions. cyclomatic complexity: 76 Stem has 82 letters. Loop has 33 letters. [2022-02-21 04:19:35,360 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:35,360 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 181 states and 245 transitions. cyclomatic complexity: 72 Stem has 81 letters. Loop has 33 letters. [2022-02-21 04:19:35,360 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:35,360 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 6 states, 6 states have (on average 3.0) internal successors, (18), 5 states have internal predecessors, (18), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Stem has 81 letters. Loop has 33 letters. [2022-02-21 04:19:35,361 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:35,361 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 205 states and 272 transitions. cyclomatic complexity: 76 Stem has 81 letters. Loop has 33 letters. [2022-02-21 04:19:35,361 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:35,361 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 181 states and 245 transitions. cyclomatic complexity: 72 Stem has 118 letters. Loop has 33 letters. [2022-02-21 04:19:35,361 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:35,361 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 6 states, 6 states have (on average 3.0) internal successors, (18), 5 states have internal predecessors, (18), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Stem has 118 letters. Loop has 33 letters. [2022-02-21 04:19:35,362 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:35,362 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 205 states and 272 transitions. cyclomatic complexity: 76 Stem has 118 letters. Loop has 33 letters. [2022-02-21 04:19:35,362 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:35,362 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 181 states and 245 transitions. cyclomatic complexity: 72 Stem has 117 letters. Loop has 33 letters. [2022-02-21 04:19:35,362 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:35,362 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 6 states, 6 states have (on average 3.0) internal successors, (18), 5 states have internal predecessors, (18), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Stem has 117 letters. Loop has 33 letters. [2022-02-21 04:19:35,363 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:35,363 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 205 states and 272 transitions. cyclomatic complexity: 76 Stem has 117 letters. Loop has 33 letters. [2022-02-21 04:19:35,363 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:35,363 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 181 states and 245 transitions. cyclomatic complexity: 72 Stem has 117 letters. Loop has 33 letters. [2022-02-21 04:19:35,363 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:35,363 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 6 states, 6 states have (on average 3.0) internal successors, (18), 5 states have internal predecessors, (18), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Stem has 117 letters. Loop has 33 letters. [2022-02-21 04:19:35,364 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:35,364 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 205 states and 272 transitions. cyclomatic complexity: 76 Stem has 117 letters. Loop has 33 letters. [2022-02-21 04:19:35,364 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:35,364 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 181 states and 245 transitions. cyclomatic complexity: 72 Stem has 83 letters. Loop has 42 letters. [2022-02-21 04:19:35,364 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:35,364 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 6 states, 6 states have (on average 3.0) internal successors, (18), 5 states have internal predecessors, (18), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Stem has 83 letters. Loop has 42 letters. [2022-02-21 04:19:35,365 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:35,365 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 205 states and 272 transitions. cyclomatic complexity: 76 Stem has 83 letters. Loop has 42 letters. [2022-02-21 04:19:35,365 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:35,365 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 181 states and 245 transitions. cyclomatic complexity: 72 Stem has 82 letters. Loop has 42 letters. [2022-02-21 04:19:35,365 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:35,365 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 6 states, 6 states have (on average 3.0) internal successors, (18), 5 states have internal predecessors, (18), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Stem has 82 letters. Loop has 42 letters. [2022-02-21 04:19:35,366 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:35,366 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 205 states and 272 transitions. cyclomatic complexity: 76 Stem has 82 letters. Loop has 42 letters. [2022-02-21 04:19:35,366 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:35,366 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 181 states and 245 transitions. cyclomatic complexity: 72 Stem has 81 letters. Loop has 42 letters. [2022-02-21 04:19:35,366 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:35,366 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 6 states, 6 states have (on average 3.0) internal successors, (18), 5 states have internal predecessors, (18), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Stem has 81 letters. Loop has 42 letters. [2022-02-21 04:19:35,367 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:35,367 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 205 states and 272 transitions. cyclomatic complexity: 76 Stem has 81 letters. Loop has 42 letters. [2022-02-21 04:19:35,367 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:35,367 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 181 states and 245 transitions. cyclomatic complexity: 72 Stem has 80 letters. Loop has 42 letters. [2022-02-21 04:19:35,367 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:35,367 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 6 states, 6 states have (on average 3.0) internal successors, (18), 5 states have internal predecessors, (18), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Stem has 80 letters. Loop has 42 letters. [2022-02-21 04:19:35,368 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:35,368 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 205 states and 272 transitions. cyclomatic complexity: 76 Stem has 80 letters. Loop has 42 letters. [2022-02-21 04:19:35,368 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:35,368 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 181 states and 245 transitions. cyclomatic complexity: 72 Stem has 79 letters. Loop has 42 letters. [2022-02-21 04:19:35,368 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:35,368 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 6 states, 6 states have (on average 3.0) internal successors, (18), 5 states have internal predecessors, (18), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Stem has 79 letters. Loop has 42 letters. [2022-02-21 04:19:35,369 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:35,369 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 205 states and 272 transitions. cyclomatic complexity: 76 Stem has 79 letters. Loop has 42 letters. [2022-02-21 04:19:35,369 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:35,369 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 181 states and 245 transitions. cyclomatic complexity: 72 Stem has 84 letters. Loop has 42 letters. [2022-02-21 04:19:35,369 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:35,369 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 6 states, 6 states have (on average 3.0) internal successors, (18), 5 states have internal predecessors, (18), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Stem has 84 letters. Loop has 42 letters. [2022-02-21 04:19:35,370 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:35,370 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 205 states and 272 transitions. cyclomatic complexity: 76 Stem has 84 letters. Loop has 42 letters. [2022-02-21 04:19:35,370 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:35,370 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 181 states and 245 transitions. cyclomatic complexity: 72 Stem has 119 letters. Loop has 42 letters. [2022-02-21 04:19:35,370 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:35,370 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 6 states, 6 states have (on average 3.0) internal successors, (18), 5 states have internal predecessors, (18), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Stem has 119 letters. Loop has 42 letters. [2022-02-21 04:19:35,371 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:35,371 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 205 states and 272 transitions. cyclomatic complexity: 76 Stem has 119 letters. Loop has 42 letters. [2022-02-21 04:19:35,371 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:35,371 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 181 states and 245 transitions. cyclomatic complexity: 72 Stem has 120 letters. Loop has 42 letters. [2022-02-21 04:19:35,371 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:35,371 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 6 states, 6 states have (on average 3.0) internal successors, (18), 5 states have internal predecessors, (18), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Stem has 120 letters. Loop has 42 letters. [2022-02-21 04:19:35,372 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:35,372 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 205 states and 272 transitions. cyclomatic complexity: 76 Stem has 120 letters. Loop has 42 letters. [2022-02-21 04:19:35,372 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:35,372 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 181 states and 245 transitions. cyclomatic complexity: 72 Stem has 119 letters. Loop has 42 letters. [2022-02-21 04:19:35,372 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:35,372 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 6 states, 6 states have (on average 3.0) internal successors, (18), 5 states have internal predecessors, (18), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Stem has 119 letters. Loop has 42 letters. [2022-02-21 04:19:35,372 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:35,373 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 205 states and 272 transitions. cyclomatic complexity: 76 Stem has 119 letters. Loop has 42 letters. [2022-02-21 04:19:35,373 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:35,373 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 181 states and 245 transitions. cyclomatic complexity: 72 Stem has 17 letters. Loop has 5 letters. [2022-02-21 04:19:35,373 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:35,373 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 6 states, 6 states have (on average 3.0) internal successors, (18), 5 states have internal predecessors, (18), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Stem has 17 letters. Loop has 5 letters. [2022-02-21 04:19:35,373 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:35,373 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 205 states and 272 transitions. cyclomatic complexity: 76 Stem has 17 letters. Loop has 5 letters. [2022-02-21 04:19:35,374 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:35,374 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 181 states and 245 transitions. cyclomatic complexity: 72 Stem has 20 letters. Loop has 3 letters. [2022-02-21 04:19:35,374 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:35,374 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 6 states, 6 states have (on average 3.0) internal successors, (18), 5 states have internal predecessors, (18), 2 states have call successors, (3), 3 states have call predecessors, (3), 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 04:19:35,374 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:35,374 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 205 states and 272 transitions. cyclomatic complexity: 76 Stem has 20 letters. Loop has 3 letters. [2022-02-21 04:19:35,374 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:35,374 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 181 states and 245 transitions. cyclomatic complexity: 72 Stem has 21 letters. Loop has 3 letters. [2022-02-21 04:19:35,374 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:35,375 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 6 states, 6 states have (on average 3.0) internal successors, (18), 5 states have internal predecessors, (18), 2 states have call successors, (3), 3 states have call predecessors, (3), 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 04:19:35,375 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:35,375 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 205 states and 272 transitions. cyclomatic complexity: 76 Stem has 21 letters. Loop has 3 letters. [2022-02-21 04:19:35,375 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:35,375 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 181 states and 245 transitions. cyclomatic complexity: 72 Stem has 18 letters. Loop has 5 letters. [2022-02-21 04:19:35,375 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:35,376 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 6 states, 6 states have (on average 3.0) internal successors, (18), 5 states have internal predecessors, (18), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Stem has 18 letters. Loop has 5 letters. [2022-02-21 04:19:35,376 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:35,376 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 205 states and 272 transitions. cyclomatic complexity: 76 Stem has 18 letters. Loop has 5 letters. [2022-02-21 04:19:35,376 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:35,376 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 181 states and 245 transitions. cyclomatic complexity: 72 Stem has 19 letters. Loop has 5 letters. [2022-02-21 04:19:35,376 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:35,376 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 6 states, 6 states have (on average 3.0) internal successors, (18), 5 states have internal predecessors, (18), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Stem has 19 letters. Loop has 5 letters. [2022-02-21 04:19:35,376 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:35,377 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 205 states and 272 transitions. cyclomatic complexity: 76 Stem has 19 letters. Loop has 5 letters. [2022-02-21 04:19:35,377 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:35,377 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 181 states and 245 transitions. cyclomatic complexity: 72 Stem has 22 letters. Loop has 3 letters. [2022-02-21 04:19:35,377 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:35,377 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 6 states, 6 states have (on average 3.0) internal successors, (18), 5 states have internal predecessors, (18), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Stem has 22 letters. Loop has 3 letters. [2022-02-21 04:19:35,377 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:35,377 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 205 states and 272 transitions. cyclomatic complexity: 76 Stem has 22 letters. Loop has 3 letters. [2022-02-21 04:19:35,378 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:35,378 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 181 states and 245 transitions. cyclomatic complexity: 72 Stem has 2 letters. Loop has 4 letters. [2022-02-21 04:19:35,378 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:35,378 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 6 states, 6 states have (on average 3.0) internal successors, (18), 5 states have internal predecessors, (18), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Stem has 2 letters. Loop has 4 letters. [2022-02-21 04:19:35,378 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:35,378 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 205 states and 272 transitions. cyclomatic complexity: 76 Stem has 2 letters. Loop has 4 letters. [2022-02-21 04:19:35,378 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:35,378 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 181 states and 245 transitions. cyclomatic complexity: 72 Stem has 32 letters. Loop has 4 letters. [2022-02-21 04:19:35,378 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:35,379 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 6 states, 6 states have (on average 3.0) internal successors, (18), 5 states have internal predecessors, (18), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Stem has 32 letters. Loop has 4 letters. [2022-02-21 04:19:35,379 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:35,379 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 205 states and 272 transitions. cyclomatic complexity: 76 Stem has 32 letters. Loop has 4 letters. [2022-02-21 04:19:35,379 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:35,379 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 181 states and 245 transitions. cyclomatic complexity: 72 Stem has 33 letters. Loop has 4 letters. [2022-02-21 04:19:35,379 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:35,379 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 6 states, 6 states have (on average 3.0) internal successors, (18), 5 states have internal predecessors, (18), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Stem has 33 letters. Loop has 4 letters. [2022-02-21 04:19:35,380 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:35,380 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 205 states and 272 transitions. cyclomatic complexity: 76 Stem has 33 letters. Loop has 4 letters. [2022-02-21 04:19:35,380 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:35,380 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 181 states and 245 transitions. cyclomatic complexity: 72 Stem has 25 letters. Loop has 10 letters. [2022-02-21 04:19:35,380 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:35,380 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 6 states, 6 states have (on average 3.0) internal successors, (18), 5 states have internal predecessors, (18), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Stem has 25 letters. Loop has 10 letters. [2022-02-21 04:19:35,380 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:35,380 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 205 states and 272 transitions. cyclomatic complexity: 76 Stem has 25 letters. Loop has 10 letters. [2022-02-21 04:19:35,381 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:35,381 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 181 states and 245 transitions. cyclomatic complexity: 72 Stem has 33 letters. Loop has 10 letters. [2022-02-21 04:19:35,381 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:35,381 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 6 states, 6 states have (on average 3.0) internal successors, (18), 5 states have internal predecessors, (18), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Stem has 33 letters. Loop has 10 letters. [2022-02-21 04:19:35,381 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:35,381 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 205 states and 272 transitions. cyclomatic complexity: 76 Stem has 33 letters. Loop has 10 letters. [2022-02-21 04:19:35,381 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:35,381 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 181 states and 245 transitions. cyclomatic complexity: 72 Stem has 34 letters. Loop has 10 letters. [2022-02-21 04:19:35,382 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:35,382 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 6 states, 6 states have (on average 3.0) internal successors, (18), 5 states have internal predecessors, (18), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Stem has 34 letters. Loop has 10 letters. [2022-02-21 04:19:35,382 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:35,382 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 205 states and 272 transitions. cyclomatic complexity: 76 Stem has 34 letters. Loop has 10 letters. [2022-02-21 04:19:35,382 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:35,382 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 181 states and 245 transitions. cyclomatic complexity: 72 Stem has 26 letters. Loop has 6 letters. [2022-02-21 04:19:35,382 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:35,382 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 6 states, 6 states have (on average 3.0) internal successors, (18), 5 states have internal predecessors, (18), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Stem has 26 letters. Loop has 6 letters. [2022-02-21 04:19:35,383 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:35,383 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 205 states and 272 transitions. cyclomatic complexity: 76 Stem has 26 letters. Loop has 6 letters. [2022-02-21 04:19:35,383 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:35,383 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 181 states and 245 transitions. cyclomatic complexity: 72 Stem has 27 letters. Loop has 6 letters. [2022-02-21 04:19:35,383 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:35,383 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 6 states, 6 states have (on average 3.0) internal successors, (18), 5 states have internal predecessors, (18), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Stem has 27 letters. Loop has 6 letters. [2022-02-21 04:19:35,383 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:35,383 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 205 states and 272 transitions. cyclomatic complexity: 76 Stem has 27 letters. Loop has 6 letters. [2022-02-21 04:19:35,384 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:35,384 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 181 states and 245 transitions. cyclomatic complexity: 72 Stem has 28 letters. Loop has 6 letters. [2022-02-21 04:19:35,384 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:35,384 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 6 states, 6 states have (on average 3.0) internal successors, (18), 5 states have internal predecessors, (18), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Stem has 28 letters. Loop has 6 letters. [2022-02-21 04:19:35,384 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:35,384 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 205 states and 272 transitions. cyclomatic complexity: 76 Stem has 28 letters. Loop has 6 letters. [2022-02-21 04:19:35,384 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:35,384 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 181 states and 245 transitions. cyclomatic complexity: 72 Stem has 29 letters. Loop has 10 letters. [2022-02-21 04:19:35,385 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:35,385 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 6 states, 6 states have (on average 3.0) internal successors, (18), 5 states have internal predecessors, (18), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Stem has 29 letters. Loop has 10 letters. [2022-02-21 04:19:35,385 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:35,385 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 205 states and 272 transitions. cyclomatic complexity: 76 Stem has 29 letters. Loop has 10 letters. [2022-02-21 04:19:35,385 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:35,385 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 181 states and 245 transitions. cyclomatic complexity: 72 Stem has 29 letters. Loop has 6 letters. [2022-02-21 04:19:35,385 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:35,386 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 6 states, 6 states have (on average 3.0) internal successors, (18), 5 states have internal predecessors, (18), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Stem has 29 letters. Loop has 6 letters. [2022-02-21 04:19:35,386 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:35,386 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 205 states and 272 transitions. cyclomatic complexity: 76 Stem has 29 letters. Loop has 6 letters. [2022-02-21 04:19:35,386 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:35,386 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 181 states and 245 transitions. cyclomatic complexity: 72 Stem has 30 letters. Loop has 4 letters. [2022-02-21 04:19:35,386 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:35,386 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 6 states, 6 states have (on average 3.0) internal successors, (18), 5 states have internal predecessors, (18), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Stem has 30 letters. Loop has 4 letters. [2022-02-21 04:19:35,386 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:35,387 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 205 states and 272 transitions. cyclomatic complexity: 76 Stem has 30 letters. Loop has 4 letters. [2022-02-21 04:19:35,387 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:35,387 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 181 states and 245 transitions. cyclomatic complexity: 72 Stem has 30 letters. Loop has 6 letters. [2022-02-21 04:19:35,387 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:35,387 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 6 states, 6 states have (on average 3.0) internal successors, (18), 5 states have internal predecessors, (18), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Stem has 30 letters. Loop has 6 letters. [2022-02-21 04:19:35,387 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:35,387 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 205 states and 272 transitions. cyclomatic complexity: 76 Stem has 30 letters. Loop has 6 letters. [2022-02-21 04:19:35,387 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:35,388 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 181 states and 245 transitions. cyclomatic complexity: 72 Stem has 31 letters. Loop has 4 letters. [2022-02-21 04:19:35,388 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:35,388 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 6 states, 6 states have (on average 3.0) internal successors, (18), 5 states have internal predecessors, (18), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Stem has 31 letters. Loop has 4 letters. [2022-02-21 04:19:35,388 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:35,388 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 205 states and 272 transitions. cyclomatic complexity: 76 Stem has 31 letters. Loop has 4 letters. [2022-02-21 04:19:35,388 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:35,388 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 181 states and 245 transitions. cyclomatic complexity: 72 Stem has 31 letters. Loop has 6 letters. [2022-02-21 04:19:35,388 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:35,389 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 6 states, 6 states have (on average 3.0) internal successors, (18), 5 states have internal predecessors, (18), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Stem has 31 letters. Loop has 6 letters. [2022-02-21 04:19:35,389 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:35,389 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 205 states and 272 transitions. cyclomatic complexity: 76 Stem has 31 letters. Loop has 6 letters. [2022-02-21 04:19:35,389 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:35,389 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 181 states and 245 transitions. cyclomatic complexity: 72 Stem has 54 letters. Loop has 6 letters. [2022-02-21 04:19:35,389 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:35,389 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 6 states, 6 states have (on average 3.0) internal successors, (18), 5 states have internal predecessors, (18), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Stem has 54 letters. Loop has 6 letters. [2022-02-21 04:19:35,389 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:35,390 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 205 states and 272 transitions. cyclomatic complexity: 76 Stem has 54 letters. Loop has 6 letters. [2022-02-21 04:19:35,390 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:35,390 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 181 states and 245 transitions. cyclomatic complexity: 72 Stem has 49 letters. Loop has 6 letters. [2022-02-21 04:19:35,390 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:35,390 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 6 states, 6 states have (on average 3.0) internal successors, (18), 5 states have internal predecessors, (18), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Stem has 49 letters. Loop has 6 letters. [2022-02-21 04:19:35,390 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:35,390 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 205 states and 272 transitions. cyclomatic complexity: 76 Stem has 49 letters. Loop has 6 letters. [2022-02-21 04:19:35,390 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:35,391 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 181 states and 245 transitions. cyclomatic complexity: 72 Stem has 50 letters. Loop has 6 letters. [2022-02-21 04:19:35,391 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:35,391 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 6 states, 6 states have (on average 3.0) internal successors, (18), 5 states have internal predecessors, (18), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Stem has 50 letters. Loop has 6 letters. [2022-02-21 04:19:35,391 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:35,391 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 205 states and 272 transitions. cyclomatic complexity: 76 Stem has 50 letters. Loop has 6 letters. [2022-02-21 04:19:35,391 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:35,391 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 181 states and 245 transitions. cyclomatic complexity: 72 Stem has 51 letters. Loop has 6 letters. [2022-02-21 04:19:35,392 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:35,392 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 6 states, 6 states have (on average 3.0) internal successors, (18), 5 states have internal predecessors, (18), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Stem has 51 letters. Loop has 6 letters. [2022-02-21 04:19:35,392 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:35,392 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 205 states and 272 transitions. cyclomatic complexity: 76 Stem has 51 letters. Loop has 6 letters. [2022-02-21 04:19:35,392 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:35,392 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 181 states and 245 transitions. cyclomatic complexity: 72 Stem has 52 letters. Loop has 6 letters. [2022-02-21 04:19:35,392 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:35,392 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 6 states, 6 states have (on average 3.0) internal successors, (18), 5 states have internal predecessors, (18), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Stem has 52 letters. Loop has 6 letters. [2022-02-21 04:19:35,393 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:35,393 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 205 states and 272 transitions. cyclomatic complexity: 76 Stem has 52 letters. Loop has 6 letters. [2022-02-21 04:19:35,393 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:35,393 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 181 states and 245 transitions. cyclomatic complexity: 72 Stem has 53 letters. Loop has 6 letters. [2022-02-21 04:19:35,393 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:35,393 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 6 states, 6 states have (on average 3.0) internal successors, (18), 5 states have internal predecessors, (18), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Stem has 53 letters. Loop has 6 letters. [2022-02-21 04:19:35,393 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:35,393 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 205 states and 272 transitions. cyclomatic complexity: 76 Stem has 53 letters. Loop has 6 letters. [2022-02-21 04:19:35,394 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:35,394 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 181 states and 245 transitions. cyclomatic complexity: 72 Stem has 81 letters. Loop has 33 letters. [2022-02-21 04:19:35,394 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:35,394 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 6 states, 6 states have (on average 3.0) internal successors, (18), 5 states have internal predecessors, (18), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Stem has 81 letters. Loop has 33 letters. [2022-02-21 04:19:35,394 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:35,394 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 205 states and 272 transitions. cyclomatic complexity: 76 Stem has 81 letters. Loop has 33 letters. [2022-02-21 04:19:35,395 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:35,395 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 181 states and 245 transitions. cyclomatic complexity: 72 Stem has 77 letters. Loop has 33 letters. [2022-02-21 04:19:35,395 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:35,395 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 6 states, 6 states have (on average 3.0) internal successors, (18), 5 states have internal predecessors, (18), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Stem has 77 letters. Loop has 33 letters. [2022-02-21 04:19:35,395 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:35,395 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 205 states and 272 transitions. cyclomatic complexity: 76 Stem has 77 letters. Loop has 33 letters. [2022-02-21 04:19:35,396 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:35,396 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 181 states and 245 transitions. cyclomatic complexity: 72 Stem has 82 letters. Loop has 33 letters. [2022-02-21 04:19:35,396 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:35,396 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 6 states, 6 states have (on average 3.0) internal successors, (18), 5 states have internal predecessors, (18), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Stem has 82 letters. Loop has 33 letters. [2022-02-21 04:19:35,396 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:35,396 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 205 states and 272 transitions. cyclomatic complexity: 76 Stem has 82 letters. Loop has 33 letters. [2022-02-21 04:19:35,396 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:35,397 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 181 states and 245 transitions. cyclomatic complexity: 72 Stem has 78 letters. Loop has 33 letters. [2022-02-21 04:19:35,397 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:35,397 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 6 states, 6 states have (on average 3.0) internal successors, (18), 5 states have internal predecessors, (18), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Stem has 78 letters. Loop has 33 letters. [2022-02-21 04:19:35,397 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:35,397 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 205 states and 272 transitions. cyclomatic complexity: 76 Stem has 78 letters. Loop has 33 letters. [2022-02-21 04:19:35,397 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:35,397 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 181 states and 245 transitions. cyclomatic complexity: 72 Stem has 79 letters. Loop has 33 letters. [2022-02-21 04:19:35,398 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:35,398 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 6 states, 6 states have (on average 3.0) internal successors, (18), 5 states have internal predecessors, (18), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Stem has 79 letters. Loop has 33 letters. [2022-02-21 04:19:35,398 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:35,398 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 205 states and 272 transitions. cyclomatic complexity: 76 Stem has 79 letters. Loop has 33 letters. [2022-02-21 04:19:35,398 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:35,398 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 181 states and 245 transitions. cyclomatic complexity: 72 Stem has 117 letters. Loop has 33 letters. [2022-02-21 04:19:35,398 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:35,399 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 6 states, 6 states have (on average 3.0) internal successors, (18), 5 states have internal predecessors, (18), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Stem has 117 letters. Loop has 33 letters. [2022-02-21 04:19:35,399 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:35,399 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 205 states and 272 transitions. cyclomatic complexity: 76 Stem has 117 letters. Loop has 33 letters. [2022-02-21 04:19:35,399 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:35,399 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 181 states and 245 transitions. cyclomatic complexity: 72 Stem has 118 letters. Loop has 33 letters. [2022-02-21 04:19:35,399 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:35,400 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 6 states, 6 states have (on average 3.0) internal successors, (18), 5 states have internal predecessors, (18), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Stem has 118 letters. Loop has 33 letters. [2022-02-21 04:19:35,400 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:35,400 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 205 states and 272 transitions. cyclomatic complexity: 76 Stem has 118 letters. Loop has 33 letters. [2022-02-21 04:19:35,400 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:35,400 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 181 states and 245 transitions. cyclomatic complexity: 72 Stem has 80 letters. Loop has 33 letters. [2022-02-21 04:19:35,400 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:35,400 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 6 states, 6 states have (on average 3.0) internal successors, (18), 5 states have internal predecessors, (18), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Stem has 80 letters. Loop has 33 letters. [2022-02-21 04:19:35,401 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:35,401 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 205 states and 272 transitions. cyclomatic complexity: 76 Stem has 80 letters. Loop has 33 letters. [2022-02-21 04:19:35,401 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:35,401 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 181 states and 245 transitions. cyclomatic complexity: 72 Stem has 117 letters. Loop has 33 letters. [2022-02-21 04:19:35,401 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:35,401 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 6 states, 6 states have (on average 3.0) internal successors, (18), 5 states have internal predecessors, (18), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Stem has 117 letters. Loop has 33 letters. [2022-02-21 04:19:35,402 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:35,402 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 205 states and 272 transitions. cyclomatic complexity: 76 Stem has 117 letters. Loop has 33 letters. [2022-02-21 04:19:35,402 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:35,402 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 181 states and 245 transitions. cyclomatic complexity: 72 Stem has 82 letters. Loop has 42 letters. [2022-02-21 04:19:35,402 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:35,402 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 6 states, 6 states have (on average 3.0) internal successors, (18), 5 states have internal predecessors, (18), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Stem has 82 letters. Loop has 42 letters. [2022-02-21 04:19:35,403 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:35,403 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 205 states and 272 transitions. cyclomatic complexity: 76 Stem has 82 letters. Loop has 42 letters. [2022-02-21 04:19:35,403 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:35,403 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 181 states and 245 transitions. cyclomatic complexity: 72 Stem has 83 letters. Loop has 42 letters. [2022-02-21 04:19:35,403 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:35,404 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 6 states, 6 states have (on average 3.0) internal successors, (18), 5 states have internal predecessors, (18), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Stem has 83 letters. Loop has 42 letters. [2022-02-21 04:19:35,404 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:35,404 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 205 states and 272 transitions. cyclomatic complexity: 76 Stem has 83 letters. Loop has 42 letters. [2022-02-21 04:19:35,404 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:35,404 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 181 states and 245 transitions. cyclomatic complexity: 72 Stem has 84 letters. Loop has 42 letters. [2022-02-21 04:19:35,404 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:35,405 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 6 states, 6 states have (on average 3.0) internal successors, (18), 5 states have internal predecessors, (18), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Stem has 84 letters. Loop has 42 letters. [2022-02-21 04:19:35,405 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:35,405 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 205 states and 272 transitions. cyclomatic complexity: 76 Stem has 84 letters. Loop has 42 letters. [2022-02-21 04:19:35,405 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:35,405 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 181 states and 245 transitions. cyclomatic complexity: 72 Stem has 119 letters. Loop has 42 letters. [2022-02-21 04:19:35,405 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:35,405 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 6 states, 6 states have (on average 3.0) internal successors, (18), 5 states have internal predecessors, (18), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Stem has 119 letters. Loop has 42 letters. [2022-02-21 04:19:35,406 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:35,406 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 205 states and 272 transitions. cyclomatic complexity: 76 Stem has 119 letters. Loop has 42 letters. [2022-02-21 04:19:35,406 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:35,406 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 181 states and 245 transitions. cyclomatic complexity: 72 Stem has 79 letters. Loop has 42 letters. [2022-02-21 04:19:35,406 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:35,406 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 6 states, 6 states have (on average 3.0) internal successors, (18), 5 states have internal predecessors, (18), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Stem has 79 letters. Loop has 42 letters. [2022-02-21 04:19:35,407 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:35,407 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 205 states and 272 transitions. cyclomatic complexity: 76 Stem has 79 letters. Loop has 42 letters. [2022-02-21 04:19:35,407 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:35,407 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 181 states and 245 transitions. cyclomatic complexity: 72 Stem has 120 letters. Loop has 42 letters. [2022-02-21 04:19:35,407 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:35,407 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 6 states, 6 states have (on average 3.0) internal successors, (18), 5 states have internal predecessors, (18), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Stem has 120 letters. Loop has 42 letters. [2022-02-21 04:19:35,408 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:35,408 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 205 states and 272 transitions. cyclomatic complexity: 76 Stem has 120 letters. Loop has 42 letters. [2022-02-21 04:19:35,408 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:35,408 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 181 states and 245 transitions. cyclomatic complexity: 72 Stem has 80 letters. Loop has 42 letters. [2022-02-21 04:19:35,408 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:35,408 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 6 states, 6 states have (on average 3.0) internal successors, (18), 5 states have internal predecessors, (18), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Stem has 80 letters. Loop has 42 letters. [2022-02-21 04:19:35,409 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:35,409 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 205 states and 272 transitions. cyclomatic complexity: 76 Stem has 80 letters. Loop has 42 letters. [2022-02-21 04:19:35,409 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:35,409 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 181 states and 245 transitions. cyclomatic complexity: 72 Stem has 81 letters. Loop has 42 letters. [2022-02-21 04:19:35,409 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:35,409 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 6 states, 6 states have (on average 3.0) internal successors, (18), 5 states have internal predecessors, (18), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Stem has 81 letters. Loop has 42 letters. [2022-02-21 04:19:35,409 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:35,410 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 205 states and 272 transitions. cyclomatic complexity: 76 Stem has 81 letters. Loop has 42 letters. [2022-02-21 04:19:35,410 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:35,410 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 181 states and 245 transitions. cyclomatic complexity: 72 Stem has 119 letters. Loop has 42 letters. [2022-02-21 04:19:35,410 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:35,410 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 6 states, 6 states have (on average 3.0) internal successors, (18), 5 states have internal predecessors, (18), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Stem has 119 letters. Loop has 42 letters. [2022-02-21 04:19:35,410 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:35,411 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 205 states and 272 transitions. cyclomatic complexity: 76 Stem has 119 letters. Loop has 42 letters. [2022-02-21 04:19:35,411 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:35,411 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 181 states and 245 transitions. cyclomatic complexity: 72 Stem has 23 letters. Loop has 3 letters. [2022-02-21 04:19:35,411 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:35,411 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 6 states, 6 states have (on average 3.0) internal successors, (18), 5 states have internal predecessors, (18), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Stem has 23 letters. Loop has 3 letters. [2022-02-21 04:19:35,411 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:35,411 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 205 states and 272 transitions. cyclomatic complexity: 76 Stem has 23 letters. Loop has 3 letters. [2022-02-21 04:19:35,411 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:35,412 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 181 states and 245 transitions. cyclomatic complexity: 72 Stem has 26 letters. Loop has 5 letters. [2022-02-21 04:19:35,412 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:35,412 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 6 states, 6 states have (on average 3.0) internal successors, (18), 5 states have internal predecessors, (18), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Stem has 26 letters. Loop has 5 letters. [2022-02-21 04:19:35,412 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:35,412 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 205 states and 272 transitions. cyclomatic complexity: 76 Stem has 26 letters. Loop has 5 letters. [2022-02-21 04:19:35,412 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:35,412 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 181 states and 245 transitions. cyclomatic complexity: 72 Stem has 27 letters. Loop has 5 letters. [2022-02-21 04:19:35,412 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:35,413 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 6 states, 6 states have (on average 3.0) internal successors, (18), 5 states have internal predecessors, (18), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Stem has 27 letters. Loop has 5 letters. [2022-02-21 04:19:35,413 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:35,413 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 205 states and 272 transitions. cyclomatic complexity: 76 Stem has 27 letters. Loop has 5 letters. [2022-02-21 04:19:35,413 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:35,413 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 181 states and 245 transitions. cyclomatic complexity: 72 Stem has 24 letters. Loop has 3 letters. [2022-02-21 04:19:35,413 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:35,413 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 6 states, 6 states have (on average 3.0) internal successors, (18), 5 states have internal predecessors, (18), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Stem has 24 letters. Loop has 3 letters. [2022-02-21 04:19:35,413 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:35,413 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 205 states and 272 transitions. cyclomatic complexity: 76 Stem has 24 letters. Loop has 3 letters. [2022-02-21 04:19:35,414 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:35,414 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 181 states and 245 transitions. cyclomatic complexity: 72 Stem has 25 letters. Loop has 3 letters. [2022-02-21 04:19:35,414 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:35,414 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 6 states, 6 states have (on average 3.0) internal successors, (18), 5 states have internal predecessors, (18), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Stem has 25 letters. Loop has 3 letters. [2022-02-21 04:19:35,414 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:35,414 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 205 states and 272 transitions. cyclomatic complexity: 76 Stem has 25 letters. Loop has 3 letters. [2022-02-21 04:19:35,414 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:35,414 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 181 states and 245 transitions. cyclomatic complexity: 72 Stem has 25 letters. Loop has 5 letters. [2022-02-21 04:19:35,414 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:35,415 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 6 states, 6 states have (on average 3.0) internal successors, (18), 5 states have internal predecessors, (18), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Stem has 25 letters. Loop has 5 letters. [2022-02-21 04:19:35,415 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:35,415 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 205 states and 272 transitions. cyclomatic complexity: 76 Stem has 25 letters. Loop has 5 letters. [2022-02-21 04:19:35,415 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:35,415 INFO L161 tractBuchiDifference]: Finished testing correctness of buchiDifferenceNCSBLazy3 [2022-02-21 04:19:35,416 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 3.0) internal successors, (18), 5 states have internal predecessors, (18), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-21 04:19:35,417 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 52 transitions. [2022-02-21 04:19:35,417 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 52 transitions. Stem has 17 letters. Loop has 5 letters. [2022-02-21 04:19:35,417 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:35,417 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 52 transitions. Stem has 22 letters. Loop has 5 letters. [2022-02-21 04:19:35,417 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:35,417 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 52 transitions. Stem has 17 letters. Loop has 10 letters. [2022-02-21 04:19:35,417 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:35,417 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 205 states and 272 transitions. cyclomatic complexity: 76 [2022-02-21 04:19:35,423 INFO L131 ngComponentsAnalysis]: Automaton has 5 accepting balls. 42 [2022-02-21 04:19:35,431 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 205 states to 204 states and 271 transitions. [2022-02-21 04:19:35,431 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 177 [2022-02-21 04:19:35,431 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 180 [2022-02-21 04:19:35,431 INFO L73 IsDeterministic]: Start isDeterministic. Operand 204 states and 271 transitions. [2022-02-21 04:19:35,432 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2022-02-21 04:19:35,432 INFO L681 BuchiCegarLoop]: Abstraction has 204 states and 271 transitions. [2022-02-21 04:19:35,432 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 204 states and 271 transitions. [2022-02-21 04:19:35,435 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 204 to 191. [2022-02-21 04:19:35,436 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-21 04:19:35,436 INFO L82 GeneralOperation]: Start isEquivalent. First operand 204 states and 271 transitions. Second operand has 191 states, 142 states have (on average 1.2887323943661972) internal successors, (183), 149 states have internal predecessors, (183), 30 states have call successors, (30), 20 states have call predecessors, (30), 19 states have return successors, (44), 21 states have call predecessors, (44), 23 states have call successors, (44) [2022-02-21 04:19:35,437 INFO L74 IsIncluded]: Start isIncluded. First operand 204 states and 271 transitions. Second operand has 191 states, 142 states have (on average 1.2887323943661972) internal successors, (183), 149 states have internal predecessors, (183), 30 states have call successors, (30), 20 states have call predecessors, (30), 19 states have return successors, (44), 21 states have call predecessors, (44), 23 states have call successors, (44) [2022-02-21 04:19:35,437 INFO L87 Difference]: Start difference. First operand 204 states and 271 transitions. Second operand has 191 states, 142 states have (on average 1.2887323943661972) internal successors, (183), 149 states have internal predecessors, (183), 30 states have call successors, (30), 20 states have call predecessors, (30), 19 states have return successors, (44), 21 states have call predecessors, (44), 23 states have call successors, (44) [2022-02-21 04:19:35,438 INFO L149 Difference]: Subtrahend was not deterministic. Recomputing result with determinization. [2022-02-21 04:19:35,451 INFO L93 Difference]: Finished difference Result 383 states and 491 transitions. [2022-02-21 04:19:35,452 INFO L276 IsEmpty]: Start isEmpty. Operand 383 states and 491 transitions. [2022-02-21 04:19:35,453 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 04:19:35,453 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 04:19:35,454 INFO L74 IsIncluded]: Start isIncluded. First operand has 191 states, 142 states have (on average 1.2887323943661972) internal successors, (183), 149 states have internal predecessors, (183), 30 states have call successors, (30), 20 states have call predecessors, (30), 19 states have return successors, (44), 21 states have call predecessors, (44), 23 states have call successors, (44) Second operand 204 states and 271 transitions. [2022-02-21 04:19:35,454 INFO L87 Difference]: Start difference. First operand has 191 states, 142 states have (on average 1.2887323943661972) internal successors, (183), 149 states have internal predecessors, (183), 30 states have call successors, (30), 20 states have call predecessors, (30), 19 states have return successors, (44), 21 states have call predecessors, (44), 23 states have call successors, (44) Second operand 204 states and 271 transitions. [2022-02-21 04:19:35,454 INFO L149 Difference]: Subtrahend was not deterministic. Recomputing result with determinization. [2022-02-21 04:19:35,470 INFO L93 Difference]: Finished difference Result 418 states and 531 transitions. [2022-02-21 04:19:35,470 INFO L276 IsEmpty]: Start isEmpty. Operand 418 states and 531 transitions. [2022-02-21 04:19:35,472 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 04:19:35,472 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 04:19:35,472 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-21 04:19:35,472 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-21 04:19:35,473 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 191 states, 142 states have (on average 1.2887323943661972) internal successors, (183), 149 states have internal predecessors, (183), 30 states have call successors, (30), 20 states have call predecessors, (30), 19 states have return successors, (44), 21 states have call predecessors, (44), 23 states have call successors, (44) [2022-02-21 04:19:35,477 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 191 states to 191 states and 257 transitions. [2022-02-21 04:19:35,478 INFO L704 BuchiCegarLoop]: Abstraction has 191 states and 257 transitions. [2022-02-21 04:19:35,478 INFO L587 BuchiCegarLoop]: Abstraction has 191 states and 257 transitions. [2022-02-21 04:19:35,478 INFO L425 BuchiCegarLoop]: ======== Iteration 9============ [2022-02-21 04:19:35,478 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 191 states and 257 transitions. [2022-02-21 04:19:35,479 INFO L131 ngComponentsAnalysis]: Automaton has 5 accepting balls. 42 [2022-02-21 04:19:35,479 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 04:19:35,479 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 04:19:35,480 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-21 04:19:35,480 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2022-02-21 04:19:35,480 INFO L791 eck$LassoCheckResult]: Stem: 14771#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(9, 2);call #Ultimate.allocInit(12, 3); 14733#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet12#1, main_#t~ret13#1, main_#t~nondet14#1, main_#t~nondet15#1, main_#t~ret16#1, main_#t~short17#1, main_~n~0#1, main_~result~0#1, main_~f1~0#1, main_~f2~0#1;main_~n~0#1 := main_#t~nondet12#1;havoc main_#t~nondet12#1; 14734#L78 assume !(main_~n~0#1 < 1 || main_~n~0#1 > 46340);assume { :begin_inline_is_prime } true;is_prime_#in~n#1 := main_~n~0#1;havoc is_prime_#res#1;havoc is_prime_#t~ret9#1, is_prime_~n#1;is_prime_~n#1 := is_prime_#in~n#1; 14779#L53 call is_prime_#t~ret9#1 := is_prime_(is_prime_~n#1, is_prime_~n#1 - 1);< 14806#is_prime_ENTRY ~n := #in~n;~m := #in~m; 14821#L58 assume !(~n <= 1); 14819#L61 assume 2 == ~n;#res := 1; 14815#is_prime_FINAL assume true; 14812#is_prime_EXIT >#118#return; 14802#L53-1 is_prime_#res#1 := is_prime_#t~ret9#1;havoc is_prime_#t~ret9#1; 14723#L53-2 main_#t~ret13#1 := is_prime_#res#1;assume { :end_inline_is_prime } true;main_~result~0#1 := main_#t~ret13#1;havoc main_#t~ret13#1;main_~f1~0#1 := main_#t~nondet14#1;havoc main_#t~nondet14#1; 14724#L85 assume !(main_~f1~0#1 < 1 || main_~f1~0#1 > 46340);main_~f2~0#1 := main_#t~nondet15#1;havoc main_#t~nondet15#1; 14728#L91 assume !(main_~f2~0#1 < 1 || main_~f2~0#1 > 46340);main_#t~short17#1 := 1 == main_~result~0#1; 14735#L97 assume main_#t~short17#1; 14736#L97-1 call main_#t~ret16#1 := mult(main_~f1~0#1, main_~f2~0#1);< 14765#multENTRY ~n := #in~n;~m := #in~m; 14766#L18 assume !(~m < 0); 14767#L21 assume !(0 == ~m); 14741#L24 assume !(1 == ~m); 14743#L27 call #t~ret5 := mult(~n, ~m - 1);< 14769#multENTRY ~n := #in~n;~m := #in~m; 14890#L18 assume ~m < 0; 14751#L19 [2022-02-21 04:19:35,480 INFO L793 eck$LassoCheckResult]: Loop: 14751#L19 call #t~ret4 := mult(~n, -~m);< 14752#multENTRY ~n := #in~n;~m := #in~m; 14778#L18 assume ~m < 0; 14751#L19 [2022-02-21 04:19:35,481 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 04:19:35,481 INFO L85 PathProgramCache]: Analyzing trace with hash 1269404470, now seen corresponding path program 1 times [2022-02-21 04:19:35,481 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 04:19:35,483 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [430955777] [2022-02-21 04:19:35,483 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 04:19:35,483 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 04:19:35,496 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 04:19:35,526 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-02-21 04:19:35,528 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 04:19:35,531 INFO L290 TraceCheckUtils]: 0: Hoare triple {16514#true} ~n := #in~n;~m := #in~m; {16514#true} is VALID [2022-02-21 04:19:35,531 INFO L290 TraceCheckUtils]: 1: Hoare triple {16514#true} assume !(~n <= 1); {16514#true} is VALID [2022-02-21 04:19:35,532 INFO L290 TraceCheckUtils]: 2: Hoare triple {16514#true} assume 2 == ~n;#res := 1; {16514#true} is VALID [2022-02-21 04:19:35,532 INFO L290 TraceCheckUtils]: 3: Hoare triple {16514#true} assume true; {16514#true} is VALID [2022-02-21 04:19:35,532 INFO L284 TraceCheckUtils]: 4: Hoare quadruple {16514#true} {16514#true} #118#return; {16514#true} is VALID [2022-02-21 04:19:35,532 INFO L290 TraceCheckUtils]: 0: Hoare triple {16514#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(9, 2);call #Ultimate.allocInit(12, 3); {16514#true} is VALID [2022-02-21 04:19:35,532 INFO L290 TraceCheckUtils]: 1: Hoare triple {16514#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet12#1, main_#t~ret13#1, main_#t~nondet14#1, main_#t~nondet15#1, main_#t~ret16#1, main_#t~short17#1, main_~n~0#1, main_~result~0#1, main_~f1~0#1, main_~f2~0#1;main_~n~0#1 := main_#t~nondet12#1;havoc main_#t~nondet12#1; {16514#true} is VALID [2022-02-21 04:19:35,532 INFO L290 TraceCheckUtils]: 2: Hoare triple {16514#true} assume !(main_~n~0#1 < 1 || main_~n~0#1 > 46340);assume { :begin_inline_is_prime } true;is_prime_#in~n#1 := main_~n~0#1;havoc is_prime_#res#1;havoc is_prime_#t~ret9#1, is_prime_~n#1;is_prime_~n#1 := is_prime_#in~n#1; {16514#true} is VALID [2022-02-21 04:19:35,532 INFO L272 TraceCheckUtils]: 3: Hoare triple {16514#true} call is_prime_#t~ret9#1 := is_prime_(is_prime_~n#1, is_prime_~n#1 - 1); {16514#true} is VALID [2022-02-21 04:19:35,533 INFO L290 TraceCheckUtils]: 4: Hoare triple {16514#true} ~n := #in~n;~m := #in~m; {16514#true} is VALID [2022-02-21 04:19:35,533 INFO L290 TraceCheckUtils]: 5: Hoare triple {16514#true} assume !(~n <= 1); {16514#true} is VALID [2022-02-21 04:19:35,533 INFO L290 TraceCheckUtils]: 6: Hoare triple {16514#true} assume 2 == ~n;#res := 1; {16514#true} is VALID [2022-02-21 04:19:35,533 INFO L290 TraceCheckUtils]: 7: Hoare triple {16514#true} assume true; {16514#true} is VALID [2022-02-21 04:19:35,533 INFO L284 TraceCheckUtils]: 8: Hoare quadruple {16514#true} {16514#true} #118#return; {16514#true} is VALID [2022-02-21 04:19:35,533 INFO L290 TraceCheckUtils]: 9: Hoare triple {16514#true} is_prime_#res#1 := is_prime_#t~ret9#1;havoc is_prime_#t~ret9#1; {16514#true} is VALID [2022-02-21 04:19:35,533 INFO L290 TraceCheckUtils]: 10: Hoare triple {16514#true} main_#t~ret13#1 := is_prime_#res#1;assume { :end_inline_is_prime } true;main_~result~0#1 := main_#t~ret13#1;havoc main_#t~ret13#1;main_~f1~0#1 := main_#t~nondet14#1;havoc main_#t~nondet14#1; {16514#true} is VALID [2022-02-21 04:19:35,534 INFO L290 TraceCheckUtils]: 11: Hoare triple {16514#true} assume !(main_~f1~0#1 < 1 || main_~f1~0#1 > 46340);main_~f2~0#1 := main_#t~nondet15#1;havoc main_#t~nondet15#1; {16514#true} is VALID [2022-02-21 04:19:35,534 INFO L290 TraceCheckUtils]: 12: Hoare triple {16514#true} assume !(main_~f2~0#1 < 1 || main_~f2~0#1 > 46340);main_#t~short17#1 := 1 == main_~result~0#1; {16514#true} is VALID [2022-02-21 04:19:35,534 INFO L290 TraceCheckUtils]: 13: Hoare triple {16514#true} assume main_#t~short17#1; {16514#true} is VALID [2022-02-21 04:19:35,534 INFO L272 TraceCheckUtils]: 14: Hoare triple {16514#true} call main_#t~ret16#1 := mult(main_~f1~0#1, main_~f2~0#1); {16514#true} is VALID [2022-02-21 04:19:35,534 INFO L290 TraceCheckUtils]: 15: Hoare triple {16514#true} ~n := #in~n;~m := #in~m; {16514#true} is VALID [2022-02-21 04:19:35,535 INFO L290 TraceCheckUtils]: 16: Hoare triple {16514#true} assume !(~m < 0); {16521#(< 0 (+ mult_~m 1))} is VALID [2022-02-21 04:19:35,535 INFO L290 TraceCheckUtils]: 17: Hoare triple {16521#(< 0 (+ mult_~m 1))} assume !(0 == ~m); {16522#(not (<= mult_~m 0))} is VALID [2022-02-21 04:19:35,536 INFO L290 TraceCheckUtils]: 18: Hoare triple {16522#(not (<= mult_~m 0))} assume !(1 == ~m); {16522#(not (<= mult_~m 0))} is VALID [2022-02-21 04:19:35,536 INFO L272 TraceCheckUtils]: 19: Hoare triple {16522#(not (<= mult_~m 0))} call #t~ret5 := mult(~n, ~m - 1); {16523#(<= 0 |mult_#in~m|)} is VALID [2022-02-21 04:19:35,537 INFO L290 TraceCheckUtils]: 20: Hoare triple {16523#(<= 0 |mult_#in~m|)} ~n := #in~n;~m := #in~m; {16521#(< 0 (+ mult_~m 1))} is VALID [2022-02-21 04:19:35,537 INFO L290 TraceCheckUtils]: 21: Hoare triple {16521#(< 0 (+ mult_~m 1))} assume ~m < 0; {16515#false} is VALID [2022-02-21 04:19:35,537 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-21 04:19:35,537 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-21 04:19:35,538 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [430955777] [2022-02-21 04:19:35,538 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [430955777] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-21 04:19:35,538 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-21 04:19:35,538 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-02-21 04:19:35,538 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1460176038] [2022-02-21 04:19:35,538 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-21 04:19:35,539 INFO L796 eck$LassoCheckResult]: stem already infeasible [2022-02-21 04:19:35,539 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 04:19:35,539 INFO L85 PathProgramCache]: Analyzing trace with hash 139155, now seen corresponding path program 2 times [2022-02-21 04:19:35,539 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 04:19:35,539 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [418040815] [2022-02-21 04:19:35,539 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 04:19:35,540 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 04:19:35,543 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 04:19:35,543 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-02-21 04:19:35,544 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 04:19:35,546 INFO L138 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-02-21 04:19:35,608 INFO L210 LassoAnalysis]: Preferences: [2022-02-21 04:19:35,608 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2022-02-21 04:19:35,609 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2022-02-21 04:19:35,609 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2022-02-21 04:19:35,609 INFO L129 ssoRankerPreferences]: Use exernal solver: true [2022-02-21 04:19:35,609 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 04:19:35,609 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2022-02-21 04:19:35,609 INFO L132 ssoRankerPreferences]: Path of dumped script: [2022-02-21 04:19:35,609 INFO L133 ssoRankerPreferences]: Filename of dumped script: Primes.c_Iteration9_Loop [2022-02-21 04:19:35,609 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2022-02-21 04:19:35,609 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2022-02-21 04:19:35,610 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 04:19:35,612 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 04:19:35,617 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 04:19:35,620 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 04:19:35,622 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 04:19:35,675 INFO L294 LassoAnalysis]: Preprocessing complete. [2022-02-21 04:19:35,675 INFO L404 LassoAnalysis]: Checking for nontermination... [2022-02-21 04:19:35,676 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 04:19:35,676 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 04:19:35,693 INFO L229 MonitoredProcess]: Starting monitored process 63 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 04:19:35,708 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2022-02-21 04:19:35,708 INFO L160 nArgumentSynthesizer]: Using integer mode. [2022-02-21 04:19:35,717 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (63)] Waiting until timeout for monitored process [2022-02-21 04:19:35,723 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2022-02-21 04:19:35,723 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {mult_#t~ret5=0} Honda state: {mult_#t~ret5=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2022-02-21 04:19:35,753 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (63)] Forceful destruction successful, exit code 0 [2022-02-21 04:19:35,753 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 04:19:35,754 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 04:19:35,755 INFO L229 MonitoredProcess]: Starting monitored process 64 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 04:19:35,756 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (64)] Waiting until timeout for monitored process [2022-02-21 04:19:35,757 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2022-02-21 04:19:35,757 INFO L160 nArgumentSynthesizer]: Using integer mode. [2022-02-21 04:19:35,806 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (64)] Forceful destruction successful, exit code 0 [2022-02-21 04:19:35,807 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 04:19:35,807 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 04:19:35,808 INFO L229 MonitoredProcess]: Starting monitored process 65 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 04:19:35,809 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (65)] Waiting until timeout for monitored process [2022-02-21 04:19:35,810 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2022-02-21 04:19:35,810 INFO L160 nArgumentSynthesizer]: Using integer mode. [2022-02-21 04:19:36,900 INFO L444 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2022-02-21 04:19:36,904 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (65)] Ended with exit code 0 [2022-02-21 04:19:36,905 INFO L210 LassoAnalysis]: Preferences: [2022-02-21 04:19:36,905 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2022-02-21 04:19:36,905 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2022-02-21 04:19:36,905 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2022-02-21 04:19:36,905 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2022-02-21 04:19:36,905 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 04:19:36,905 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2022-02-21 04:19:36,905 INFO L132 ssoRankerPreferences]: Path of dumped script: [2022-02-21 04:19:36,905 INFO L133 ssoRankerPreferences]: Filename of dumped script: Primes.c_Iteration9_Loop [2022-02-21 04:19:36,905 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2022-02-21 04:19:36,905 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2022-02-21 04:19:36,906 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 04:19:36,911 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 04:19:36,912 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 04:19:36,917 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 04:19:36,920 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 04:19:36,981 INFO L294 LassoAnalysis]: Preprocessing complete. [2022-02-21 04:19:36,981 INFO L490 LassoAnalysis]: Using template 'affine'. [2022-02-21 04:19:36,981 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 04:19:36,982 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 04:19:36,991 INFO L229 MonitoredProcess]: Starting monitored process 66 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 04:19:36,992 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 04:19:36,998 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 04:19:36,998 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 04:19:36,998 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 04:19:36,998 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 04:19:36,998 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 04:19:36,999 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-02-21 04:19:36,999 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 04:19:37,002 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (66)] Waiting until timeout for monitored process [2022-02-21 04:19:37,011 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2022-02-21 04:19:37,013 INFO L443 ModelExtractionUtils]: Simplification made 2 calls to the SMT solver. [2022-02-21 04:19:37,013 INFO L444 ModelExtractionUtils]: 2 out of 4 variables were initially zero. Simplification set additionally 0 variables to zero. [2022-02-21 04:19:37,013 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 04:19:37,013 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 04:19:37,014 INFO L229 MonitoredProcess]: Starting monitored process 67 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 04:19:37,016 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (67)] Waiting until timeout for monitored process [2022-02-21 04:19:37,017 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2022-02-21 04:19:37,017 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2022-02-21 04:19:37,017 INFO L513 LassoAnalysis]: Proved termination. [2022-02-21 04:19:37,017 INFO L515 LassoAnalysis]: Termination argument consisting of: Ranking function f(mult_~m) = 1*mult_~m Supporting invariants [] [2022-02-21 04:19:37,035 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (66)] Ended with exit code 0 [2022-02-21 04:19:37,039 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2022-02-21 04:19:37,044 INFO L390 LassoCheck]: Loop: "call #t~ret4 := mult(~n, -~m);"< "~n := #in~n;~m := #in~m;" "assume ~m < 0;" [2022-02-21 04:19:37,047 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 04:19:37,056 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 04:19:37,093 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 04:19:37,095 INFO L263 TraceCheckSpWp]: Trace formula consists of 172 conjuncts, 8 conjunts are in the unsatisfiable core [2022-02-21 04:19:37,102 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 04:19:37,103 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-21 04:19:37,185 INFO L290 TraceCheckUtils]: 0: Hoare triple {16526#unseeded} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(9, 2);call #Ultimate.allocInit(12, 3); {16526#unseeded} is VALID [2022-02-21 04:19:37,185 INFO L290 TraceCheckUtils]: 1: Hoare triple {16526#unseeded} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet12#1, main_#t~ret13#1, main_#t~nondet14#1, main_#t~nondet15#1, main_#t~ret16#1, main_#t~short17#1, main_~n~0#1, main_~result~0#1, main_~f1~0#1, main_~f2~0#1;main_~n~0#1 := main_#t~nondet12#1;havoc main_#t~nondet12#1; {16526#unseeded} is VALID [2022-02-21 04:19:37,186 INFO L290 TraceCheckUtils]: 2: Hoare triple {16526#unseeded} assume !(main_~n~0#1 < 1 || main_~n~0#1 > 46340);assume { :begin_inline_is_prime } true;is_prime_#in~n#1 := main_~n~0#1;havoc is_prime_#res#1;havoc is_prime_#t~ret9#1, is_prime_~n#1;is_prime_~n#1 := is_prime_#in~n#1; {16526#unseeded} is VALID [2022-02-21 04:19:37,186 INFO L272 TraceCheckUtils]: 3: Hoare triple {16526#unseeded} call is_prime_#t~ret9#1 := is_prime_(is_prime_~n#1, is_prime_~n#1 - 1); {16553#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2022-02-21 04:19:37,187 INFO L290 TraceCheckUtils]: 4: Hoare triple {16553#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} ~n := #in~n;~m := #in~m; {16553#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2022-02-21 04:19:37,187 INFO L290 TraceCheckUtils]: 5: Hoare triple {16553#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} assume !(~n <= 1); {16553#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2022-02-21 04:19:37,188 INFO L290 TraceCheckUtils]: 6: Hoare triple {16553#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} assume 2 == ~n;#res := 1; {16553#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2022-02-21 04:19:37,189 INFO L290 TraceCheckUtils]: 7: Hoare triple {16553#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} assume true; {16553#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2022-02-21 04:19:37,190 INFO L284 TraceCheckUtils]: 8: Hoare quadruple {16553#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} {16526#unseeded} #118#return; {16526#unseeded} is VALID [2022-02-21 04:19:37,190 INFO L290 TraceCheckUtils]: 9: Hoare triple {16526#unseeded} is_prime_#res#1 := is_prime_#t~ret9#1;havoc is_prime_#t~ret9#1; {16526#unseeded} is VALID [2022-02-21 04:19:37,190 INFO L290 TraceCheckUtils]: 10: Hoare triple {16526#unseeded} main_#t~ret13#1 := is_prime_#res#1;assume { :end_inline_is_prime } true;main_~result~0#1 := main_#t~ret13#1;havoc main_#t~ret13#1;main_~f1~0#1 := main_#t~nondet14#1;havoc main_#t~nondet14#1; {16526#unseeded} is VALID [2022-02-21 04:19:37,190 INFO L290 TraceCheckUtils]: 11: Hoare triple {16526#unseeded} assume !(main_~f1~0#1 < 1 || main_~f1~0#1 > 46340);main_~f2~0#1 := main_#t~nondet15#1;havoc main_#t~nondet15#1; {16526#unseeded} is VALID [2022-02-21 04:19:37,191 INFO L290 TraceCheckUtils]: 12: Hoare triple {16526#unseeded} assume !(main_~f2~0#1 < 1 || main_~f2~0#1 > 46340);main_#t~short17#1 := 1 == main_~result~0#1; {16526#unseeded} is VALID [2022-02-21 04:19:37,191 INFO L290 TraceCheckUtils]: 13: Hoare triple {16526#unseeded} assume main_#t~short17#1; {16526#unseeded} is VALID [2022-02-21 04:19:37,192 INFO L272 TraceCheckUtils]: 14: Hoare triple {16526#unseeded} call main_#t~ret16#1 := mult(main_~f1~0#1, main_~f2~0#1); {16526#unseeded} is VALID [2022-02-21 04:19:37,192 INFO L290 TraceCheckUtils]: 15: Hoare triple {16526#unseeded} ~n := #in~n;~m := #in~m; {16526#unseeded} is VALID [2022-02-21 04:19:37,192 INFO L290 TraceCheckUtils]: 16: Hoare triple {16526#unseeded} assume !(~m < 0); {16526#unseeded} is VALID [2022-02-21 04:19:37,192 INFO L290 TraceCheckUtils]: 17: Hoare triple {16526#unseeded} assume !(0 == ~m); {16526#unseeded} is VALID [2022-02-21 04:19:37,193 INFO L290 TraceCheckUtils]: 18: Hoare triple {16526#unseeded} assume !(1 == ~m); {16526#unseeded} is VALID [2022-02-21 04:19:37,193 INFO L272 TraceCheckUtils]: 19: Hoare triple {16526#unseeded} call #t~ret5 := mult(~n, ~m - 1); {16526#unseeded} is VALID [2022-02-21 04:19:37,193 INFO L290 TraceCheckUtils]: 20: Hoare triple {16526#unseeded} ~n := #in~n;~m := #in~m; {16526#unseeded} is VALID [2022-02-21 04:19:37,194 INFO L290 TraceCheckUtils]: 21: Hoare triple {16526#unseeded} assume ~m < 0; {16526#unseeded} is VALID [2022-02-21 04:19:37,214 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 04:19:37,214 INFO L263 TraceCheckSpWp]: Trace formula consists of 41 conjuncts, 7 conjunts are in the unsatisfiable core [2022-02-21 04:19:37,219 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 04:19:37,219 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-21 04:19:37,267 INFO L272 TraceCheckUtils]: 0: Hoare triple {16529#(>= oldRank0 mult_~m)} call #t~ret4 := mult(~n, -~m); {16608#(<= 0 (+ oldRank0 |mult_#in~m|))} is VALID [2022-02-21 04:19:37,268 INFO L290 TraceCheckUtils]: 1: Hoare triple {16608#(<= 0 (+ oldRank0 |mult_#in~m|))} ~n := #in~n;~m := #in~m; {16612#(<= 0 (+ oldRank0 mult_~m))} is VALID [2022-02-21 04:19:37,268 INFO L290 TraceCheckUtils]: 2: Hoare triple {16612#(<= 0 (+ oldRank0 mult_~m))} assume ~m < 0; {16539#(or (and (>= oldRank0 0) (> oldRank0 mult_~m)) unseeded)} is VALID [2022-02-21 04:19:37,268 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 04:19:37,269 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 5 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-21 04:19:37,282 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 24 edges. 24 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-21 04:19:37,283 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 5 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Stem has 22 letters. Loop has 3 letters. [2022-02-21 04:19:37,283 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:37,283 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 04:19:37,283 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 191 states and 257 transitions. cyclomatic complexity: 75 Second operand has 5 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-21 04:19:37,416 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 191 states and 257 transitions. cyclomatic complexity: 75. Second operand has 5 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Result 232 states and 303 transitions. Complement of second has 11 states. [2022-02-21 04:19:37,416 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 04:19:37,416 INFO L123 tractBuchiDifference]: Start testing correctness of buchiDifferenceNCSBLazy3 [2022-02-21 04:19:37,416 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 191 states and 257 transitions. cyclomatic complexity: 75 [2022-02-21 04:19:37,416 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 04:19:37,416 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 04:19:37,416 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 5 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-21 04:19:37,417 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2022-02-21 04:19:37,417 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 04:19:37,417 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 04:19:37,417 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 232 states and 303 transitions. [2022-02-21 04:19:37,418 INFO L131 ngComponentsAnalysis]: Automaton has 5 accepting balls. 42 [2022-02-21 04:19:37,418 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 04:19:37,419 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 04:19:37,419 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 191 states and 257 transitions. cyclomatic complexity: 75 [2022-02-21 04:19:37,423 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 44 examples of accepted words. [2022-02-21 04:19:37,423 INFO L70 LassoExtractor]: Start lassoExtractor. Operand has 5 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-21 04:19:37,424 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2022-02-21 04:19:37,424 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 1 examples of accepted words. [2022-02-21 04:19:37,424 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 232 states and 303 transitions. cyclomatic complexity: 82 [2022-02-21 04:19:37,428 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 44 examples of accepted words. [2022-02-21 04:19:37,428 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 191 states and 257 transitions. cyclomatic complexity: 75 Stem has 22 letters. Loop has 3 letters. [2022-02-21 04:19:37,429 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:37,429 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 5 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Stem has 22 letters. Loop has 3 letters. [2022-02-21 04:19:37,429 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:37,429 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 232 states and 303 transitions. cyclomatic complexity: 82 Stem has 22 letters. Loop has 3 letters. [2022-02-21 04:19:37,429 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:37,429 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 191 states and 257 transitions. cyclomatic complexity: 75 Stem has 2 letters. Loop has 3 letters. [2022-02-21 04:19:37,429 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:37,429 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 5 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 2 states have call successors, (4), 3 states have call predecessors, (4), 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 04:19:37,429 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:37,429 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 232 states and 303 transitions. cyclomatic complexity: 82 Stem has 2 letters. Loop has 3 letters. [2022-02-21 04:19:37,430 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:37,430 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 191 states and 257 transitions. cyclomatic complexity: 75 Stem has 25 letters. Loop has 3 letters. [2022-02-21 04:19:37,430 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:37,430 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 5 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Stem has 25 letters. Loop has 3 letters. [2022-02-21 04:19:37,430 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:37,430 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 232 states and 303 transitions. cyclomatic complexity: 82 Stem has 25 letters. Loop has 3 letters. [2022-02-21 04:19:37,430 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:37,430 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 191 states and 257 transitions. cyclomatic complexity: 75 Stem has 232 letters. Loop has 232 letters. [2022-02-21 04:19:37,430 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:37,430 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 5 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Stem has 232 letters. Loop has 232 letters. [2022-02-21 04:19:37,430 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:37,431 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 232 states and 303 transitions. cyclomatic complexity: 82 Stem has 232 letters. Loop has 232 letters. [2022-02-21 04:19:37,431 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:37,431 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 191 states and 257 transitions. cyclomatic complexity: 75 Stem has 191 letters. Loop has 191 letters. [2022-02-21 04:19:37,431 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:37,431 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 5 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Stem has 191 letters. Loop has 191 letters. [2022-02-21 04:19:37,431 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:37,431 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 232 states and 303 transitions. cyclomatic complexity: 82 Stem has 191 letters. Loop has 191 letters. [2022-02-21 04:19:37,431 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:37,431 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 191 states and 257 transitions. cyclomatic complexity: 75 Stem has 5 letters. Loop has 5 letters. [2022-02-21 04:19:37,431 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:37,431 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 5 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 2 states have call successors, (4), 3 states have call predecessors, (4), 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 04:19:37,432 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:37,432 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 232 states and 303 transitions. cyclomatic complexity: 82 Stem has 5 letters. Loop has 5 letters. [2022-02-21 04:19:37,432 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:37,432 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 191 states and 257 transitions. cyclomatic complexity: 75 Stem has 33 letters. Loop has 10 letters. [2022-02-21 04:19:37,432 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:37,432 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 5 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Stem has 33 letters. Loop has 10 letters. [2022-02-21 04:19:37,432 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:37,432 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 232 states and 303 transitions. cyclomatic complexity: 82 Stem has 33 letters. Loop has 10 letters. [2022-02-21 04:19:37,432 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:37,432 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 191 states and 257 transitions. cyclomatic complexity: 75 Stem has 31 letters. Loop has 4 letters. [2022-02-21 04:19:37,432 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:37,433 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 5 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Stem has 31 letters. Loop has 4 letters. [2022-02-21 04:19:37,433 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:37,433 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 232 states and 303 transitions. cyclomatic complexity: 82 Stem has 31 letters. Loop has 4 letters. [2022-02-21 04:19:37,433 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:37,433 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 191 states and 257 transitions. cyclomatic complexity: 75 Stem has 28 letters. Loop has 6 letters. [2022-02-21 04:19:37,433 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:37,433 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 5 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Stem has 28 letters. Loop has 6 letters. [2022-02-21 04:19:37,433 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:37,433 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 232 states and 303 transitions. cyclomatic complexity: 82 Stem has 28 letters. Loop has 6 letters. [2022-02-21 04:19:37,433 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:37,433 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 191 states and 257 transitions. cyclomatic complexity: 75 Stem has 29 letters. Loop has 6 letters. [2022-02-21 04:19:37,434 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:37,434 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 5 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Stem has 29 letters. Loop has 6 letters. [2022-02-21 04:19:37,434 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:37,434 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 232 states and 303 transitions. cyclomatic complexity: 82 Stem has 29 letters. Loop has 6 letters. [2022-02-21 04:19:37,434 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:37,434 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 191 states and 257 transitions. cyclomatic complexity: 75 Stem has 26 letters. Loop has 6 letters. [2022-02-21 04:19:37,434 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:37,434 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 5 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Stem has 26 letters. Loop has 6 letters. [2022-02-21 04:19:37,434 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:37,434 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 232 states and 303 transitions. cyclomatic complexity: 82 Stem has 26 letters. Loop has 6 letters. [2022-02-21 04:19:37,435 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:37,435 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 191 states and 257 transitions. cyclomatic complexity: 75 Stem has 27 letters. Loop has 6 letters. [2022-02-21 04:19:37,435 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:37,435 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 5 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Stem has 27 letters. Loop has 6 letters. [2022-02-21 04:19:37,435 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:37,435 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 232 states and 303 transitions. cyclomatic complexity: 82 Stem has 27 letters. Loop has 6 letters. [2022-02-21 04:19:37,435 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:37,435 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 191 states and 257 transitions. cyclomatic complexity: 75 Stem has 29 letters. Loop has 10 letters. [2022-02-21 04:19:37,435 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:37,435 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 5 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Stem has 29 letters. Loop has 10 letters. [2022-02-21 04:19:37,435 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:37,436 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 232 states and 303 transitions. cyclomatic complexity: 82 Stem has 29 letters. Loop has 10 letters. [2022-02-21 04:19:37,436 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:37,436 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 191 states and 257 transitions. cyclomatic complexity: 75 Stem has 25 letters. Loop has 10 letters. [2022-02-21 04:19:37,436 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:37,436 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 5 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Stem has 25 letters. Loop has 10 letters. [2022-02-21 04:19:37,436 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:37,436 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 232 states and 303 transitions. cyclomatic complexity: 82 Stem has 25 letters. Loop has 10 letters. [2022-02-21 04:19:37,436 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:37,436 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 191 states and 257 transitions. cyclomatic complexity: 75 Stem has 33 letters. Loop has 4 letters. [2022-02-21 04:19:37,436 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:37,436 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 5 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Stem has 33 letters. Loop has 4 letters. [2022-02-21 04:19:37,437 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:37,437 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 232 states and 303 transitions. cyclomatic complexity: 82 Stem has 33 letters. Loop has 4 letters. [2022-02-21 04:19:37,437 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:37,437 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 191 states and 257 transitions. cyclomatic complexity: 75 Stem has 31 letters. Loop has 6 letters. [2022-02-21 04:19:37,437 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:37,437 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 5 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Stem has 31 letters. Loop has 6 letters. [2022-02-21 04:19:37,437 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:37,437 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 232 states and 303 transitions. cyclomatic complexity: 82 Stem has 31 letters. Loop has 6 letters. [2022-02-21 04:19:37,437 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:37,437 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 191 states and 257 transitions. cyclomatic complexity: 75 Stem has 30 letters. Loop has 4 letters. [2022-02-21 04:19:37,437 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:37,438 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 5 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Stem has 30 letters. Loop has 4 letters. [2022-02-21 04:19:37,438 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:37,438 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 232 states and 303 transitions. cyclomatic complexity: 82 Stem has 30 letters. Loop has 4 letters. [2022-02-21 04:19:37,438 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:37,438 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 191 states and 257 transitions. cyclomatic complexity: 75 Stem has 30 letters. Loop has 6 letters. [2022-02-21 04:19:37,438 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:37,438 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 5 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Stem has 30 letters. Loop has 6 letters. [2022-02-21 04:19:37,438 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:37,438 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 232 states and 303 transitions. cyclomatic complexity: 82 Stem has 30 letters. Loop has 6 letters. [2022-02-21 04:19:37,438 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:37,438 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 191 states and 257 transitions. cyclomatic complexity: 75 Stem has 34 letters. Loop has 10 letters. [2022-02-21 04:19:37,439 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:37,439 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 5 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Stem has 34 letters. Loop has 10 letters. [2022-02-21 04:19:37,439 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:37,439 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 232 states and 303 transitions. cyclomatic complexity: 82 Stem has 34 letters. Loop has 10 letters. [2022-02-21 04:19:37,439 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:37,439 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 191 states and 257 transitions. cyclomatic complexity: 75 Stem has 32 letters. Loop has 4 letters. [2022-02-21 04:19:37,439 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:37,439 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 5 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Stem has 32 letters. Loop has 4 letters. [2022-02-21 04:19:37,439 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:37,439 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 232 states and 303 transitions. cyclomatic complexity: 82 Stem has 32 letters. Loop has 4 letters. [2022-02-21 04:19:37,440 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:37,440 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 191 states and 257 transitions. cyclomatic complexity: 75 Stem has 53 letters. Loop has 6 letters. [2022-02-21 04:19:37,440 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:37,440 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 5 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Stem has 53 letters. Loop has 6 letters. [2022-02-21 04:19:37,440 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:37,440 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 232 states and 303 transitions. cyclomatic complexity: 82 Stem has 53 letters. Loop has 6 letters. [2022-02-21 04:19:37,440 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:37,440 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 191 states and 257 transitions. cyclomatic complexity: 75 Stem has 50 letters. Loop has 6 letters. [2022-02-21 04:19:37,440 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:37,440 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 5 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Stem has 50 letters. Loop has 6 letters. [2022-02-21 04:19:37,441 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:37,441 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 232 states and 303 transitions. cyclomatic complexity: 82 Stem has 50 letters. Loop has 6 letters. [2022-02-21 04:19:37,441 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:37,441 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 191 states and 257 transitions. cyclomatic complexity: 75 Stem has 51 letters. Loop has 6 letters. [2022-02-21 04:19:37,441 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:37,441 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 5 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Stem has 51 letters. Loop has 6 letters. [2022-02-21 04:19:37,441 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:37,441 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 232 states and 303 transitions. cyclomatic complexity: 82 Stem has 51 letters. Loop has 6 letters. [2022-02-21 04:19:37,441 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:37,441 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 191 states and 257 transitions. cyclomatic complexity: 75 Stem has 52 letters. Loop has 6 letters. [2022-02-21 04:19:37,441 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:37,442 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 5 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Stem has 52 letters. Loop has 6 letters. [2022-02-21 04:19:37,442 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:37,442 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 232 states and 303 transitions. cyclomatic complexity: 82 Stem has 52 letters. Loop has 6 letters. [2022-02-21 04:19:37,442 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:37,442 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 191 states and 257 transitions. cyclomatic complexity: 75 Stem has 54 letters. Loop has 6 letters. [2022-02-21 04:19:37,442 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:37,442 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 5 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Stem has 54 letters. Loop has 6 letters. [2022-02-21 04:19:37,442 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:37,442 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 232 states and 303 transitions. cyclomatic complexity: 82 Stem has 54 letters. Loop has 6 letters. [2022-02-21 04:19:37,442 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:37,443 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 191 states and 257 transitions. cyclomatic complexity: 75 Stem has 49 letters. Loop has 6 letters. [2022-02-21 04:19:37,443 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:37,443 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 5 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Stem has 49 letters. Loop has 6 letters. [2022-02-21 04:19:37,443 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:37,443 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 232 states and 303 transitions. cyclomatic complexity: 82 Stem has 49 letters. Loop has 6 letters. [2022-02-21 04:19:37,443 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:37,443 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 191 states and 257 transitions. cyclomatic complexity: 75 Stem has 81 letters. Loop has 33 letters. [2022-02-21 04:19:37,443 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:37,443 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 5 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Stem has 81 letters. Loop has 33 letters. [2022-02-21 04:19:37,443 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:37,444 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 232 states and 303 transitions. cyclomatic complexity: 82 Stem has 81 letters. Loop has 33 letters. [2022-02-21 04:19:37,444 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:37,444 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 191 states and 257 transitions. cyclomatic complexity: 75 Stem has 77 letters. Loop has 33 letters. [2022-02-21 04:19:37,444 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:37,444 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 5 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Stem has 77 letters. Loop has 33 letters. [2022-02-21 04:19:37,444 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:37,444 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 232 states and 303 transitions. cyclomatic complexity: 82 Stem has 77 letters. Loop has 33 letters. [2022-02-21 04:19:37,444 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:37,444 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 191 states and 257 transitions. cyclomatic complexity: 75 Stem has 78 letters. Loop has 33 letters. [2022-02-21 04:19:37,445 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:37,445 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 5 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Stem has 78 letters. Loop has 33 letters. [2022-02-21 04:19:37,445 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:37,445 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 232 states and 303 transitions. cyclomatic complexity: 82 Stem has 78 letters. Loop has 33 letters. [2022-02-21 04:19:37,445 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:37,445 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 191 states and 257 transitions. cyclomatic complexity: 75 Stem has 79 letters. Loop has 33 letters. [2022-02-21 04:19:37,445 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:37,445 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 5 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Stem has 79 letters. Loop has 33 letters. [2022-02-21 04:19:37,446 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:37,446 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 232 states and 303 transitions. cyclomatic complexity: 82 Stem has 79 letters. Loop has 33 letters. [2022-02-21 04:19:37,446 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:37,446 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 191 states and 257 transitions. cyclomatic complexity: 75 Stem has 80 letters. Loop has 33 letters. [2022-02-21 04:19:37,446 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:37,446 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 5 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Stem has 80 letters. Loop has 33 letters. [2022-02-21 04:19:37,446 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:37,446 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 232 states and 303 transitions. cyclomatic complexity: 82 Stem has 80 letters. Loop has 33 letters. [2022-02-21 04:19:37,446 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:37,446 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 191 states and 257 transitions. cyclomatic complexity: 75 Stem has 117 letters. Loop has 33 letters. [2022-02-21 04:19:37,447 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:37,447 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 5 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Stem has 117 letters. Loop has 33 letters. [2022-02-21 04:19:37,447 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:37,447 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 232 states and 303 transitions. cyclomatic complexity: 82 Stem has 117 letters. Loop has 33 letters. [2022-02-21 04:19:37,447 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:37,447 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 191 states and 257 transitions. cyclomatic complexity: 75 Stem has 82 letters. Loop has 33 letters. [2022-02-21 04:19:37,447 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:37,447 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 5 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Stem has 82 letters. Loop has 33 letters. [2022-02-21 04:19:37,448 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:37,448 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 232 states and 303 transitions. cyclomatic complexity: 82 Stem has 82 letters. Loop has 33 letters. [2022-02-21 04:19:37,448 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:37,448 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 191 states and 257 transitions. cyclomatic complexity: 75 Stem has 118 letters. Loop has 33 letters. [2022-02-21 04:19:37,448 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:37,448 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 5 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Stem has 118 letters. Loop has 33 letters. [2022-02-21 04:19:37,448 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:37,448 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 232 states and 303 transitions. cyclomatic complexity: 82 Stem has 118 letters. Loop has 33 letters. [2022-02-21 04:19:37,448 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:37,449 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 191 states and 257 transitions. cyclomatic complexity: 75 Stem has 117 letters. Loop has 33 letters. [2022-02-21 04:19:37,449 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:37,449 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 5 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Stem has 117 letters. Loop has 33 letters. [2022-02-21 04:19:37,449 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:37,449 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 232 states and 303 transitions. cyclomatic complexity: 82 Stem has 117 letters. Loop has 33 letters. [2022-02-21 04:19:37,449 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:37,449 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 191 states and 257 transitions. cyclomatic complexity: 75 Stem has 119 letters. Loop has 42 letters. [2022-02-21 04:19:37,449 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:37,450 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 5 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Stem has 119 letters. Loop has 42 letters. [2022-02-21 04:19:37,450 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:37,450 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 232 states and 303 transitions. cyclomatic complexity: 82 Stem has 119 letters. Loop has 42 letters. [2022-02-21 04:19:37,450 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:37,450 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 191 states and 257 transitions. cyclomatic complexity: 75 Stem has 81 letters. Loop has 42 letters. [2022-02-21 04:19:37,450 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:37,450 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 5 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Stem has 81 letters. Loop has 42 letters. [2022-02-21 04:19:37,450 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:37,450 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 232 states and 303 transitions. cyclomatic complexity: 82 Stem has 81 letters. Loop has 42 letters. [2022-02-21 04:19:37,451 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:37,451 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 191 states and 257 transitions. cyclomatic complexity: 75 Stem has 84 letters. Loop has 42 letters. [2022-02-21 04:19:37,451 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:37,451 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 5 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Stem has 84 letters. Loop has 42 letters. [2022-02-21 04:19:37,452 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:37,452 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 232 states and 303 transitions. cyclomatic complexity: 82 Stem has 84 letters. Loop has 42 letters. [2022-02-21 04:19:37,452 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:37,452 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 191 states and 257 transitions. cyclomatic complexity: 75 Stem has 80 letters. Loop has 42 letters. [2022-02-21 04:19:37,452 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:37,452 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 5 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Stem has 80 letters. Loop has 42 letters. [2022-02-21 04:19:37,453 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:37,453 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 232 states and 303 transitions. cyclomatic complexity: 82 Stem has 80 letters. Loop has 42 letters. [2022-02-21 04:19:37,453 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:37,453 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 191 states and 257 transitions. cyclomatic complexity: 75 Stem has 120 letters. Loop has 42 letters. [2022-02-21 04:19:37,453 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:37,453 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 5 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Stem has 120 letters. Loop has 42 letters. [2022-02-21 04:19:37,453 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:37,453 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 232 states and 303 transitions. cyclomatic complexity: 82 Stem has 120 letters. Loop has 42 letters. [2022-02-21 04:19:37,454 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:37,454 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 191 states and 257 transitions. cyclomatic complexity: 75 Stem has 83 letters. Loop has 42 letters. [2022-02-21 04:19:37,454 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:37,454 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 5 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Stem has 83 letters. Loop has 42 letters. [2022-02-21 04:19:37,454 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:37,454 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 232 states and 303 transitions. cyclomatic complexity: 82 Stem has 83 letters. Loop has 42 letters. [2022-02-21 04:19:37,454 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:37,454 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 191 states and 257 transitions. cyclomatic complexity: 75 Stem has 79 letters. Loop has 42 letters. [2022-02-21 04:19:37,454 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:37,455 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 5 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Stem has 79 letters. Loop has 42 letters. [2022-02-21 04:19:37,455 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:37,455 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 232 states and 303 transitions. cyclomatic complexity: 82 Stem has 79 letters. Loop has 42 letters. [2022-02-21 04:19:37,455 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:37,455 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 191 states and 257 transitions. cyclomatic complexity: 75 Stem has 82 letters. Loop has 42 letters. [2022-02-21 04:19:37,455 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:37,455 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 5 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Stem has 82 letters. Loop has 42 letters. [2022-02-21 04:19:37,455 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:37,456 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 232 states and 303 transitions. cyclomatic complexity: 82 Stem has 82 letters. Loop has 42 letters. [2022-02-21 04:19:37,456 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:37,456 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 191 states and 257 transitions. cyclomatic complexity: 75 Stem has 119 letters. Loop has 42 letters. [2022-02-21 04:19:37,456 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:37,456 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 5 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Stem has 119 letters. Loop has 42 letters. [2022-02-21 04:19:37,456 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:37,456 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 232 states and 303 transitions. cyclomatic complexity: 82 Stem has 119 letters. Loop has 42 letters. [2022-02-21 04:19:37,456 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:37,456 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 191 states and 257 transitions. cyclomatic complexity: 75 Stem has 23 letters. Loop has 3 letters. [2022-02-21 04:19:37,457 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:37,457 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 5 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Stem has 23 letters. Loop has 3 letters. [2022-02-21 04:19:37,457 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:37,457 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 232 states and 303 transitions. cyclomatic complexity: 82 Stem has 23 letters. Loop has 3 letters. [2022-02-21 04:19:37,457 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:37,457 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 191 states and 257 transitions. cyclomatic complexity: 75 Stem has 27 letters. Loop has 5 letters. [2022-02-21 04:19:37,457 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:37,457 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 5 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Stem has 27 letters. Loop has 5 letters. [2022-02-21 04:19:37,457 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:37,457 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 232 states and 303 transitions. cyclomatic complexity: 82 Stem has 27 letters. Loop has 5 letters. [2022-02-21 04:19:37,458 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:37,458 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 191 states and 257 transitions. cyclomatic complexity: 75 Stem has 24 letters. Loop has 3 letters. [2022-02-21 04:19:37,458 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:37,458 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 5 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Stem has 24 letters. Loop has 3 letters. [2022-02-21 04:19:37,458 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:37,458 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 232 states and 303 transitions. cyclomatic complexity: 82 Stem has 24 letters. Loop has 3 letters. [2022-02-21 04:19:37,458 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:37,458 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 191 states and 257 transitions. cyclomatic complexity: 75 Stem has 25 letters. Loop has 5 letters. [2022-02-21 04:19:37,458 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:37,458 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 5 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Stem has 25 letters. Loop has 5 letters. [2022-02-21 04:19:37,458 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:37,459 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 232 states and 303 transitions. cyclomatic complexity: 82 Stem has 25 letters. Loop has 5 letters. [2022-02-21 04:19:37,459 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:37,459 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 191 states and 257 transitions. cyclomatic complexity: 75 Stem has 26 letters. Loop has 5 letters. [2022-02-21 04:19:37,459 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:37,459 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 5 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Stem has 26 letters. Loop has 5 letters. [2022-02-21 04:19:37,459 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:37,459 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 232 states and 303 transitions. cyclomatic complexity: 82 Stem has 26 letters. Loop has 5 letters. [2022-02-21 04:19:37,459 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:37,459 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 191 states and 257 transitions. cyclomatic complexity: 75 Stem has 22 letters. Loop has 3 letters. [2022-02-21 04:19:37,459 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:37,459 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 5 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Stem has 22 letters. Loop has 3 letters. [2022-02-21 04:19:37,460 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:37,460 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 232 states and 303 transitions. cyclomatic complexity: 82 Stem has 22 letters. Loop has 3 letters. [2022-02-21 04:19:37,460 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:37,460 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 191 states and 257 transitions. cyclomatic complexity: 75 Stem has 2 letters. Loop has 3 letters. [2022-02-21 04:19:37,460 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:37,460 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 5 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 2 states have call successors, (4), 3 states have call predecessors, (4), 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 04:19:37,460 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:37,461 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 232 states and 303 transitions. cyclomatic complexity: 82 Stem has 2 letters. Loop has 3 letters. [2022-02-21 04:19:37,461 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:37,461 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 191 states and 257 transitions. cyclomatic complexity: 75 Stem has 32 letters. Loop has 4 letters. [2022-02-21 04:19:37,461 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:37,461 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 5 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Stem has 32 letters. Loop has 4 letters. [2022-02-21 04:19:37,461 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:37,461 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 232 states and 303 transitions. cyclomatic complexity: 82 Stem has 32 letters. Loop has 4 letters. [2022-02-21 04:19:37,461 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:37,461 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 191 states and 257 transitions. cyclomatic complexity: 75 Stem has 26 letters. Loop has 6 letters. [2022-02-21 04:19:37,461 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:37,461 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 5 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Stem has 26 letters. Loop has 6 letters. [2022-02-21 04:19:37,462 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:37,462 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 232 states and 303 transitions. cyclomatic complexity: 82 Stem has 26 letters. Loop has 6 letters. [2022-02-21 04:19:37,462 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:37,462 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 191 states and 257 transitions. cyclomatic complexity: 75 Stem has 33 letters. Loop has 4 letters. [2022-02-21 04:19:37,462 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:37,462 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 5 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Stem has 33 letters. Loop has 4 letters. [2022-02-21 04:19:37,462 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:37,462 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 232 states and 303 transitions. cyclomatic complexity: 82 Stem has 33 letters. Loop has 4 letters. [2022-02-21 04:19:37,462 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:37,462 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 191 states and 257 transitions. cyclomatic complexity: 75 Stem has 33 letters. Loop has 10 letters. [2022-02-21 04:19:37,462 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:37,463 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 5 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Stem has 33 letters. Loop has 10 letters. [2022-02-21 04:19:37,463 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:37,463 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 232 states and 303 transitions. cyclomatic complexity: 82 Stem has 33 letters. Loop has 10 letters. [2022-02-21 04:19:37,463 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:37,463 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 191 states and 257 transitions. cyclomatic complexity: 75 Stem has 34 letters. Loop has 10 letters. [2022-02-21 04:19:37,463 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:37,463 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 5 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Stem has 34 letters. Loop has 10 letters. [2022-02-21 04:19:37,463 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:37,463 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 232 states and 303 transitions. cyclomatic complexity: 82 Stem has 34 letters. Loop has 10 letters. [2022-02-21 04:19:37,463 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:37,463 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 191 states and 257 transitions. cyclomatic complexity: 75 Stem has 27 letters. Loop has 6 letters. [2022-02-21 04:19:37,464 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:37,464 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 5 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Stem has 27 letters. Loop has 6 letters. [2022-02-21 04:19:37,464 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:37,464 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 232 states and 303 transitions. cyclomatic complexity: 82 Stem has 27 letters. Loop has 6 letters. [2022-02-21 04:19:37,464 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:37,464 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 191 states and 257 transitions. cyclomatic complexity: 75 Stem has 28 letters. Loop has 6 letters. [2022-02-21 04:19:37,464 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:37,464 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 5 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Stem has 28 letters. Loop has 6 letters. [2022-02-21 04:19:37,464 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:37,464 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 232 states and 303 transitions. cyclomatic complexity: 82 Stem has 28 letters. Loop has 6 letters. [2022-02-21 04:19:37,465 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:37,465 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 191 states and 257 transitions. cyclomatic complexity: 75 Stem has 29 letters. Loop has 10 letters. [2022-02-21 04:19:37,465 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:37,465 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 5 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Stem has 29 letters. Loop has 10 letters. [2022-02-21 04:19:37,465 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:37,465 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 232 states and 303 transitions. cyclomatic complexity: 82 Stem has 29 letters. Loop has 10 letters. [2022-02-21 04:19:37,465 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:37,465 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 191 states and 257 transitions. cyclomatic complexity: 75 Stem has 29 letters. Loop has 6 letters. [2022-02-21 04:19:37,465 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:37,465 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 5 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Stem has 29 letters. Loop has 6 letters. [2022-02-21 04:19:37,465 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:37,466 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 232 states and 303 transitions. cyclomatic complexity: 82 Stem has 29 letters. Loop has 6 letters. [2022-02-21 04:19:37,466 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:37,466 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 191 states and 257 transitions. cyclomatic complexity: 75 Stem has 30 letters. Loop has 4 letters. [2022-02-21 04:19:37,466 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:37,466 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 5 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Stem has 30 letters. Loop has 4 letters. [2022-02-21 04:19:37,466 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:37,466 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 232 states and 303 transitions. cyclomatic complexity: 82 Stem has 30 letters. Loop has 4 letters. [2022-02-21 04:19:37,466 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:37,466 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 191 states and 257 transitions. cyclomatic complexity: 75 Stem has 30 letters. Loop has 6 letters. [2022-02-21 04:19:37,466 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:37,467 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 5 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Stem has 30 letters. Loop has 6 letters. [2022-02-21 04:19:37,467 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:37,467 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 232 states and 303 transitions. cyclomatic complexity: 82 Stem has 30 letters. Loop has 6 letters. [2022-02-21 04:19:37,467 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:37,467 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 191 states and 257 transitions. cyclomatic complexity: 75 Stem has 25 letters. Loop has 10 letters. [2022-02-21 04:19:37,467 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:37,467 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 5 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Stem has 25 letters. Loop has 10 letters. [2022-02-21 04:19:37,467 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:37,467 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 232 states and 303 transitions. cyclomatic complexity: 82 Stem has 25 letters. Loop has 10 letters. [2022-02-21 04:19:37,467 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:37,467 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 191 states and 257 transitions. cyclomatic complexity: 75 Stem has 31 letters. Loop has 4 letters. [2022-02-21 04:19:37,468 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:37,468 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 5 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Stem has 31 letters. Loop has 4 letters. [2022-02-21 04:19:37,468 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:37,468 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 232 states and 303 transitions. cyclomatic complexity: 82 Stem has 31 letters. Loop has 4 letters. [2022-02-21 04:19:37,468 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:37,468 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 191 states and 257 transitions. cyclomatic complexity: 75 Stem has 31 letters. Loop has 6 letters. [2022-02-21 04:19:37,468 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:37,468 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 5 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Stem has 31 letters. Loop has 6 letters. [2022-02-21 04:19:37,468 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:37,468 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 232 states and 303 transitions. cyclomatic complexity: 82 Stem has 31 letters. Loop has 6 letters. [2022-02-21 04:19:37,469 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:37,469 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 191 states and 257 transitions. cyclomatic complexity: 75 Stem has 53 letters. Loop has 6 letters. [2022-02-21 04:19:37,469 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:37,469 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 5 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Stem has 53 letters. Loop has 6 letters. [2022-02-21 04:19:37,469 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:37,469 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 232 states and 303 transitions. cyclomatic complexity: 82 Stem has 53 letters. Loop has 6 letters. [2022-02-21 04:19:37,469 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:37,469 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 191 states and 257 transitions. cyclomatic complexity: 75 Stem has 54 letters. Loop has 6 letters. [2022-02-21 04:19:37,469 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:37,469 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 5 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Stem has 54 letters. Loop has 6 letters. [2022-02-21 04:19:37,470 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:37,470 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 232 states and 303 transitions. cyclomatic complexity: 82 Stem has 54 letters. Loop has 6 letters. [2022-02-21 04:19:37,470 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:37,470 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 191 states and 257 transitions. cyclomatic complexity: 75 Stem has 49 letters. Loop has 6 letters. [2022-02-21 04:19:37,470 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:37,470 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 5 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Stem has 49 letters. Loop has 6 letters. [2022-02-21 04:19:37,470 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:37,470 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 232 states and 303 transitions. cyclomatic complexity: 82 Stem has 49 letters. Loop has 6 letters. [2022-02-21 04:19:37,470 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:37,470 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 191 states and 257 transitions. cyclomatic complexity: 75 Stem has 50 letters. Loop has 6 letters. [2022-02-21 04:19:37,470 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:37,471 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 5 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Stem has 50 letters. Loop has 6 letters. [2022-02-21 04:19:37,471 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:37,471 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 232 states and 303 transitions. cyclomatic complexity: 82 Stem has 50 letters. Loop has 6 letters. [2022-02-21 04:19:37,471 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:37,471 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 191 states and 257 transitions. cyclomatic complexity: 75 Stem has 51 letters. Loop has 6 letters. [2022-02-21 04:19:37,471 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:37,471 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 5 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Stem has 51 letters. Loop has 6 letters. [2022-02-21 04:19:37,471 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:37,471 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 232 states and 303 transitions. cyclomatic complexity: 82 Stem has 51 letters. Loop has 6 letters. [2022-02-21 04:19:37,471 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:37,472 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 191 states and 257 transitions. cyclomatic complexity: 75 Stem has 52 letters. Loop has 6 letters. [2022-02-21 04:19:37,472 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:37,472 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 5 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Stem has 52 letters. Loop has 6 letters. [2022-02-21 04:19:37,472 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:37,472 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 232 states and 303 transitions. cyclomatic complexity: 82 Stem has 52 letters. Loop has 6 letters. [2022-02-21 04:19:37,472 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:37,472 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 191 states and 257 transitions. cyclomatic complexity: 75 Stem has 81 letters. Loop has 33 letters. [2022-02-21 04:19:37,472 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:37,472 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 5 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Stem has 81 letters. Loop has 33 letters. [2022-02-21 04:19:37,474 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:37,474 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 232 states and 303 transitions. cyclomatic complexity: 82 Stem has 81 letters. Loop has 33 letters. [2022-02-21 04:19:37,474 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:37,474 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 191 states and 257 transitions. cyclomatic complexity: 75 Stem has 77 letters. Loop has 33 letters. [2022-02-21 04:19:37,474 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:37,474 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 5 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Stem has 77 letters. Loop has 33 letters. [2022-02-21 04:19:37,475 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:37,475 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 232 states and 303 transitions. cyclomatic complexity: 82 Stem has 77 letters. Loop has 33 letters. [2022-02-21 04:19:37,475 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:37,475 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 191 states and 257 transitions. cyclomatic complexity: 75 Stem has 82 letters. Loop has 33 letters. [2022-02-21 04:19:37,475 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:37,475 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 5 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Stem has 82 letters. Loop has 33 letters. [2022-02-21 04:19:37,475 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:37,475 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 232 states and 303 transitions. cyclomatic complexity: 82 Stem has 82 letters. Loop has 33 letters. [2022-02-21 04:19:37,476 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:37,476 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 191 states and 257 transitions. cyclomatic complexity: 75 Stem has 78 letters. Loop has 33 letters. [2022-02-21 04:19:37,476 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:37,476 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 5 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Stem has 78 letters. Loop has 33 letters. [2022-02-21 04:19:37,476 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:37,476 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 232 states and 303 transitions. cyclomatic complexity: 82 Stem has 78 letters. Loop has 33 letters. [2022-02-21 04:19:37,476 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:37,476 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 191 states and 257 transitions. cyclomatic complexity: 75 Stem has 79 letters. Loop has 33 letters. [2022-02-21 04:19:37,476 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:37,477 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 5 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Stem has 79 letters. Loop has 33 letters. [2022-02-21 04:19:37,477 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:37,477 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 232 states and 303 transitions. cyclomatic complexity: 82 Stem has 79 letters. Loop has 33 letters. [2022-02-21 04:19:37,477 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:37,477 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 191 states and 257 transitions. cyclomatic complexity: 75 Stem has 117 letters. Loop has 33 letters. [2022-02-21 04:19:37,477 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:37,477 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 5 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Stem has 117 letters. Loop has 33 letters. [2022-02-21 04:19:37,477 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:37,477 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 232 states and 303 transitions. cyclomatic complexity: 82 Stem has 117 letters. Loop has 33 letters. [2022-02-21 04:19:37,478 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:37,478 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 191 states and 257 transitions. cyclomatic complexity: 75 Stem has 118 letters. Loop has 33 letters. [2022-02-21 04:19:37,478 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:37,478 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 5 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Stem has 118 letters. Loop has 33 letters. [2022-02-21 04:19:37,478 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:37,478 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 232 states and 303 transitions. cyclomatic complexity: 82 Stem has 118 letters. Loop has 33 letters. [2022-02-21 04:19:37,478 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:37,478 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 191 states and 257 transitions. cyclomatic complexity: 75 Stem has 80 letters. Loop has 33 letters. [2022-02-21 04:19:37,479 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:37,479 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 5 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Stem has 80 letters. Loop has 33 letters. [2022-02-21 04:19:37,479 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:37,479 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 232 states and 303 transitions. cyclomatic complexity: 82 Stem has 80 letters. Loop has 33 letters. [2022-02-21 04:19:37,479 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:37,479 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 191 states and 257 transitions. cyclomatic complexity: 75 Stem has 117 letters. Loop has 33 letters. [2022-02-21 04:19:37,479 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:37,479 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 5 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Stem has 117 letters. Loop has 33 letters. [2022-02-21 04:19:37,479 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:37,480 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 232 states and 303 transitions. cyclomatic complexity: 82 Stem has 117 letters. Loop has 33 letters. [2022-02-21 04:19:37,480 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:37,480 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 191 states and 257 transitions. cyclomatic complexity: 75 Stem has 81 letters. Loop has 42 letters. [2022-02-21 04:19:37,480 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:37,480 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 5 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Stem has 81 letters. Loop has 42 letters. [2022-02-21 04:19:37,480 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:37,480 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 232 states and 303 transitions. cyclomatic complexity: 82 Stem has 81 letters. Loop has 42 letters. [2022-02-21 04:19:37,480 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:37,480 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 191 states and 257 transitions. cyclomatic complexity: 75 Stem has 82 letters. Loop has 42 letters. [2022-02-21 04:19:37,481 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:37,481 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 5 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Stem has 82 letters. Loop has 42 letters. [2022-02-21 04:19:37,481 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:37,481 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 232 states and 303 transitions. cyclomatic complexity: 82 Stem has 82 letters. Loop has 42 letters. [2022-02-21 04:19:37,481 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:37,481 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 191 states and 257 transitions. cyclomatic complexity: 75 Stem has 83 letters. Loop has 42 letters. [2022-02-21 04:19:37,481 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:37,481 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 5 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Stem has 83 letters. Loop has 42 letters. [2022-02-21 04:19:37,482 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:37,482 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 232 states and 303 transitions. cyclomatic complexity: 82 Stem has 83 letters. Loop has 42 letters. [2022-02-21 04:19:37,482 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:37,482 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 191 states and 257 transitions. cyclomatic complexity: 75 Stem has 84 letters. Loop has 42 letters. [2022-02-21 04:19:37,482 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:37,482 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 5 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Stem has 84 letters. Loop has 42 letters. [2022-02-21 04:19:37,482 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:37,482 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 232 states and 303 transitions. cyclomatic complexity: 82 Stem has 84 letters. Loop has 42 letters. [2022-02-21 04:19:37,483 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:37,483 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 191 states and 257 transitions. cyclomatic complexity: 75 Stem has 119 letters. Loop has 42 letters. [2022-02-21 04:19:37,483 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:37,483 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 5 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Stem has 119 letters. Loop has 42 letters. [2022-02-21 04:19:37,483 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:37,483 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 232 states and 303 transitions. cyclomatic complexity: 82 Stem has 119 letters. Loop has 42 letters. [2022-02-21 04:19:37,483 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:37,483 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 191 states and 257 transitions. cyclomatic complexity: 75 Stem has 120 letters. Loop has 42 letters. [2022-02-21 04:19:37,483 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:37,484 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 5 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Stem has 120 letters. Loop has 42 letters. [2022-02-21 04:19:37,484 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:37,484 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 232 states and 303 transitions. cyclomatic complexity: 82 Stem has 120 letters. Loop has 42 letters. [2022-02-21 04:19:37,484 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:37,484 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 191 states and 257 transitions. cyclomatic complexity: 75 Stem has 79 letters. Loop has 42 letters. [2022-02-21 04:19:37,484 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:37,484 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 5 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Stem has 79 letters. Loop has 42 letters. [2022-02-21 04:19:37,484 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:37,485 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 232 states and 303 transitions. cyclomatic complexity: 82 Stem has 79 letters. Loop has 42 letters. [2022-02-21 04:19:37,485 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:37,485 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 191 states and 257 transitions. cyclomatic complexity: 75 Stem has 80 letters. Loop has 42 letters. [2022-02-21 04:19:37,485 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:37,485 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 5 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Stem has 80 letters. Loop has 42 letters. [2022-02-21 04:19:37,485 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:37,485 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 232 states and 303 transitions. cyclomatic complexity: 82 Stem has 80 letters. Loop has 42 letters. [2022-02-21 04:19:37,485 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:37,485 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 191 states and 257 transitions. cyclomatic complexity: 75 Stem has 119 letters. Loop has 42 letters. [2022-02-21 04:19:37,486 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:37,486 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 5 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Stem has 119 letters. Loop has 42 letters. [2022-02-21 04:19:37,486 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:37,486 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 232 states and 303 transitions. cyclomatic complexity: 82 Stem has 119 letters. Loop has 42 letters. [2022-02-21 04:19:37,486 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:37,486 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 191 states and 257 transitions. cyclomatic complexity: 75 Stem has 29 letters. Loop has 5 letters. [2022-02-21 04:19:37,486 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:37,486 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 5 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Stem has 29 letters. Loop has 5 letters. [2022-02-21 04:19:37,486 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:37,487 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 232 states and 303 transitions. cyclomatic complexity: 82 Stem has 29 letters. Loop has 5 letters. [2022-02-21 04:19:37,487 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:37,487 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 191 states and 257 transitions. cyclomatic complexity: 75 Stem has 25 letters. Loop has 3 letters. [2022-02-21 04:19:37,487 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:37,487 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 5 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Stem has 25 letters. Loop has 3 letters. [2022-02-21 04:19:37,487 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:37,487 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 232 states and 303 transitions. cyclomatic complexity: 82 Stem has 25 letters. Loop has 3 letters. [2022-02-21 04:19:37,487 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:37,487 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 191 states and 257 transitions. cyclomatic complexity: 75 Stem has 27 letters. Loop has 3 letters. [2022-02-21 04:19:37,487 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:37,487 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 5 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Stem has 27 letters. Loop has 3 letters. [2022-02-21 04:19:37,488 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:37,488 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 232 states and 303 transitions. cyclomatic complexity: 82 Stem has 27 letters. Loop has 3 letters. [2022-02-21 04:19:37,488 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:37,488 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 191 states and 257 transitions. cyclomatic complexity: 75 Stem has 30 letters. Loop has 5 letters. [2022-02-21 04:19:37,488 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:37,488 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 5 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Stem has 30 letters. Loop has 5 letters. [2022-02-21 04:19:37,488 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:37,488 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 232 states and 303 transitions. cyclomatic complexity: 82 Stem has 30 letters. Loop has 5 letters. [2022-02-21 04:19:37,488 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:37,488 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 191 states and 257 transitions. cyclomatic complexity: 75 Stem has 26 letters. Loop has 3 letters. [2022-02-21 04:19:37,488 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:37,489 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 5 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Stem has 26 letters. Loop has 3 letters. [2022-02-21 04:19:37,489 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:37,489 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 232 states and 303 transitions. cyclomatic complexity: 82 Stem has 26 letters. Loop has 3 letters. [2022-02-21 04:19:37,489 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:37,489 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 191 states and 257 transitions. cyclomatic complexity: 75 Stem has 28 letters. Loop has 5 letters. [2022-02-21 04:19:37,489 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:37,489 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 5 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Stem has 28 letters. Loop has 5 letters. [2022-02-21 04:19:37,489 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:37,489 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 232 states and 303 transitions. cyclomatic complexity: 82 Stem has 28 letters. Loop has 5 letters. [2022-02-21 04:19:37,489 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:37,489 INFO L161 tractBuchiDifference]: Finished testing correctness of buchiDifferenceNCSBLazy3 [2022-02-21 04:19:37,490 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-21 04:19:37,491 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 54 transitions. [2022-02-21 04:19:37,491 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 54 transitions. Stem has 22 letters. Loop has 3 letters. [2022-02-21 04:19:37,491 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:37,491 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 54 transitions. Stem has 25 letters. Loop has 3 letters. [2022-02-21 04:19:37,491 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:37,491 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 54 transitions. Stem has 22 letters. Loop has 6 letters. [2022-02-21 04:19:37,491 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:37,491 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 232 states and 303 transitions. cyclomatic complexity: 82 [2022-02-21 04:19:37,524 INFO L131 ngComponentsAnalysis]: Automaton has 5 accepting balls. 42 [2022-02-21 04:19:37,537 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 232 states to 222 states and 293 transitions. [2022-02-21 04:19:37,537 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 188 [2022-02-21 04:19:37,538 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 190 [2022-02-21 04:19:37,538 INFO L73 IsDeterministic]: Start isDeterministic. Operand 222 states and 293 transitions. [2022-02-21 04:19:37,538 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2022-02-21 04:19:37,538 INFO L681 BuchiCegarLoop]: Abstraction has 222 states and 293 transitions. [2022-02-21 04:19:37,538 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 222 states and 293 transitions. [2022-02-21 04:19:37,544 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 222 to 209. [2022-02-21 04:19:37,544 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-21 04:19:37,544 INFO L82 GeneralOperation]: Start isEquivalent. First operand 222 states and 293 transitions. Second operand has 209 states, 156 states have (on average 1.2692307692307692) internal successors, (198), 162 states have internal predecessors, (198), 34 states have call successors, (37), 25 states have call predecessors, (37), 19 states have return successors, (44), 21 states have call predecessors, (44), 23 states have call successors, (44) [2022-02-21 04:19:37,545 INFO L74 IsIncluded]: Start isIncluded. First operand 222 states and 293 transitions. Second operand has 209 states, 156 states have (on average 1.2692307692307692) internal successors, (198), 162 states have internal predecessors, (198), 34 states have call successors, (37), 25 states have call predecessors, (37), 19 states have return successors, (44), 21 states have call predecessors, (44), 23 states have call successors, (44) [2022-02-21 04:19:37,545 INFO L87 Difference]: Start difference. First operand 222 states and 293 transitions. Second operand has 209 states, 156 states have (on average 1.2692307692307692) internal successors, (198), 162 states have internal predecessors, (198), 34 states have call successors, (37), 25 states have call predecessors, (37), 19 states have return successors, (44), 21 states have call predecessors, (44), 23 states have call successors, (44) [2022-02-21 04:19:37,546 INFO L149 Difference]: Subtrahend was not deterministic. Recomputing result with determinization. [2022-02-21 04:19:37,547 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (67)] Forceful destruction successful, exit code 0 [2022-02-21 04:19:37,562 INFO L93 Difference]: Finished difference Result 410 states and 523 transitions. [2022-02-21 04:19:37,562 INFO L276 IsEmpty]: Start isEmpty. Operand 410 states and 523 transitions. [2022-02-21 04:19:37,563 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 04:19:37,564 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 04:19:37,564 INFO L74 IsIncluded]: Start isIncluded. First operand has 209 states, 156 states have (on average 1.2692307692307692) internal successors, (198), 162 states have internal predecessors, (198), 34 states have call successors, (37), 25 states have call predecessors, (37), 19 states have return successors, (44), 21 states have call predecessors, (44), 23 states have call successors, (44) Second operand 222 states and 293 transitions. [2022-02-21 04:19:37,564 INFO L87 Difference]: Start difference. First operand has 209 states, 156 states have (on average 1.2692307692307692) internal successors, (198), 162 states have internal predecessors, (198), 34 states have call successors, (37), 25 states have call predecessors, (37), 19 states have return successors, (44), 21 states have call predecessors, (44), 23 states have call successors, (44) Second operand 222 states and 293 transitions. [2022-02-21 04:19:37,565 INFO L149 Difference]: Subtrahend was not deterministic. Recomputing result with determinization. [2022-02-21 04:19:37,583 INFO L93 Difference]: Finished difference Result 446 states and 565 transitions. [2022-02-21 04:19:37,583 INFO L276 IsEmpty]: Start isEmpty. Operand 446 states and 565 transitions. [2022-02-21 04:19:37,584 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 04:19:37,585 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 04:19:37,585 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-21 04:19:37,585 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-21 04:19:37,585 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 209 states, 156 states have (on average 1.2692307692307692) internal successors, (198), 162 states have internal predecessors, (198), 34 states have call successors, (37), 25 states have call predecessors, (37), 19 states have return successors, (44), 21 states have call predecessors, (44), 23 states have call successors, (44) [2022-02-21 04:19:37,589 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 209 states to 209 states and 279 transitions. [2022-02-21 04:19:37,589 INFO L704 BuchiCegarLoop]: Abstraction has 209 states and 279 transitions. [2022-02-21 04:19:37,589 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-21 04:19:37,589 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-02-21 04:19:37,590 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-02-21 04:19:37,590 INFO L87 Difference]: Start difference. First operand 209 states and 279 transitions. Second operand has 5 states, 4 states have (on average 4.5) internal successors, (18), 4 states have internal predecessors, (18), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-21 04:19:37,671 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 04:19:37,671 INFO L93 Difference]: Finished difference Result 205 states and 270 transitions. [2022-02-21 04:19:37,671 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-02-21 04:19:37,671 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 5 states, 4 states have (on average 4.5) internal successors, (18), 4 states have internal predecessors, (18), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-21 04:19:37,687 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 04:19:37,688 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 205 states and 270 transitions. [2022-02-21 04:19:37,692 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 36 [2022-02-21 04:19:37,694 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 205 states to 145 states and 177 transitions. [2022-02-21 04:19:37,694 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 135 [2022-02-21 04:19:37,695 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 135 [2022-02-21 04:19:37,695 INFO L73 IsDeterministic]: Start isDeterministic. Operand 145 states and 177 transitions. [2022-02-21 04:19:37,695 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2022-02-21 04:19:37,695 INFO L681 BuchiCegarLoop]: Abstraction has 145 states and 177 transitions. [2022-02-21 04:19:37,695 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 145 states and 177 transitions. [2022-02-21 04:19:37,697 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 145 to 125. [2022-02-21 04:19:37,697 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-21 04:19:37,697 INFO L82 GeneralOperation]: Start isEquivalent. First operand 145 states and 177 transitions. Second operand has 125 states, 95 states have (on average 1.1368421052631579) internal successors, (108), 100 states have internal predecessors, (108), 18 states have call successors, (18), 13 states have call predecessors, (18), 12 states have return successors, (28), 11 states have call predecessors, (28), 14 states have call successors, (28) [2022-02-21 04:19:37,698 INFO L74 IsIncluded]: Start isIncluded. First operand 145 states and 177 transitions. Second operand has 125 states, 95 states have (on average 1.1368421052631579) internal successors, (108), 100 states have internal predecessors, (108), 18 states have call successors, (18), 13 states have call predecessors, (18), 12 states have return successors, (28), 11 states have call predecessors, (28), 14 states have call successors, (28) [2022-02-21 04:19:37,698 INFO L87 Difference]: Start difference. First operand 145 states and 177 transitions. Second operand has 125 states, 95 states have (on average 1.1368421052631579) internal successors, (108), 100 states have internal predecessors, (108), 18 states have call successors, (18), 13 states have call predecessors, (18), 12 states have return successors, (28), 11 states have call predecessors, (28), 14 states have call successors, (28) [2022-02-21 04:19:37,698 INFO L149 Difference]: Subtrahend was not deterministic. Recomputing result with determinization. [2022-02-21 04:19:37,709 INFO L93 Difference]: Finished difference Result 262 states and 314 transitions. [2022-02-21 04:19:37,709 INFO L276 IsEmpty]: Start isEmpty. Operand 262 states and 314 transitions. [2022-02-21 04:19:37,710 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 04:19:37,710 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 04:19:37,710 INFO L74 IsIncluded]: Start isIncluded. First operand has 125 states, 95 states have (on average 1.1368421052631579) internal successors, (108), 100 states have internal predecessors, (108), 18 states have call successors, (18), 13 states have call predecessors, (18), 12 states have return successors, (28), 11 states have call predecessors, (28), 14 states have call successors, (28) Second operand 145 states and 177 transitions. [2022-02-21 04:19:37,711 INFO L87 Difference]: Start difference. First operand has 125 states, 95 states have (on average 1.1368421052631579) internal successors, (108), 100 states have internal predecessors, (108), 18 states have call successors, (18), 13 states have call predecessors, (18), 12 states have return successors, (28), 11 states have call predecessors, (28), 14 states have call successors, (28) Second operand 145 states and 177 transitions. [2022-02-21 04:19:37,711 INFO L149 Difference]: Subtrahend was not deterministic. Recomputing result with determinization. [2022-02-21 04:19:37,717 INFO L93 Difference]: Finished difference Result 301 states and 356 transitions. [2022-02-21 04:19:37,717 INFO L276 IsEmpty]: Start isEmpty. Operand 301 states and 356 transitions. [2022-02-21 04:19:37,718 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 04:19:37,718 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 04:19:37,718 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-21 04:19:37,718 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-21 04:19:37,718 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 125 states, 95 states have (on average 1.1368421052631579) internal successors, (108), 100 states have internal predecessors, (108), 18 states have call successors, (18), 13 states have call predecessors, (18), 12 states have return successors, (28), 11 states have call predecessors, (28), 14 states have call successors, (28) [2022-02-21 04:19:37,720 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 125 states to 125 states and 154 transitions. [2022-02-21 04:19:37,720 INFO L704 BuchiCegarLoop]: Abstraction has 125 states and 154 transitions. [2022-02-21 04:19:37,720 INFO L587 BuchiCegarLoop]: Abstraction has 125 states and 154 transitions. [2022-02-21 04:19:37,720 INFO L425 BuchiCegarLoop]: ======== Iteration 10============ [2022-02-21 04:19:37,720 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 125 states and 154 transitions. [2022-02-21 04:19:37,721 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 36 [2022-02-21 04:19:37,721 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 04:19:37,721 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 04:19:37,722 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-21 04:19:37,722 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [2, 2, 1, 1, 1, 1, 1, 1] [2022-02-21 04:19:37,722 INFO L791 eck$LassoCheckResult]: Stem: 18978#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(9, 2);call #Ultimate.allocInit(12, 3); 18979#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet12#1, main_#t~ret13#1, main_#t~nondet14#1, main_#t~nondet15#1, main_#t~ret16#1, main_#t~short17#1, main_~n~0#1, main_~result~0#1, main_~f1~0#1, main_~f2~0#1;main_~n~0#1 := main_#t~nondet12#1;havoc main_#t~nondet12#1; 18993#L78 assume !(main_~n~0#1 < 1 || main_~n~0#1 > 46340);assume { :begin_inline_is_prime } true;is_prime_#in~n#1 := main_~n~0#1;havoc is_prime_#res#1;havoc is_prime_#t~ret9#1, is_prime_~n#1;is_prime_~n#1 := is_prime_#in~n#1; 18985#L53 call is_prime_#t~ret9#1 := is_prime_(is_prime_~n#1, is_prime_~n#1 - 1);< 19023#is_prime_ENTRY ~n := #in~n;~m := #in~m; 19047#L58 assume !(~n <= 1); 19046#L61 assume !(2 == ~n); 19045#L64 assume ~n > 2; 19044#L65 assume !(~m <= 1); 19008#L68 call #t~ret10 := multiple_of(~n, ~m);< 19043#multiple_ofENTRY ~n := #in~n;~m := #in~m; 19042#L32 assume !(~m < 0); 19041#L35 assume !(~n < 0); 19040#L38 assume !(0 == ~m); 19039#L41 assume !(0 == ~n); 18991#L44 call #t~ret8 := multiple_of(~n - ~m, ~m);< 19034#multiple_ofENTRY ~n := #in~n;~m := #in~m; 19035#L32 assume !(~m < 0); 19068#L35 assume ~n < 0; 18999#L36 call #t~ret7 := multiple_of(-~n, ~m);< 19037#multiple_ofENTRY ~n := #in~n;~m := #in~m; 19038#L32 assume !(~m < 0); 19060#L35 assume !(~n < 0); 19059#L38 assume !(0 == ~m); 19058#L41 assume !(0 == ~n); 19025#L44 [2022-02-21 04:19:37,722 INFO L793 eck$LassoCheckResult]: Loop: 19025#L44 call #t~ret8 := multiple_of(~n - ~m, ~m);< 19064#multiple_ofENTRY ~n := #in~n;~m := #in~m; 19063#L32 assume !(~m < 0); 19061#L35 assume ~n < 0; 18995#L36 call #t~ret7 := multiple_of(-~n, ~m);< 18996#multiple_ofENTRY ~n := #in~n;~m := #in~m; 19067#L32 assume !(~m < 0); 19065#L35 assume !(~n < 0); 19066#L38 assume !(0 == ~m); 19056#L41 assume !(0 == ~n); 19025#L44 [2022-02-21 04:19:37,722 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 04:19:37,722 INFO L85 PathProgramCache]: Analyzing trace with hash -155061355, now seen corresponding path program 1 times [2022-02-21 04:19:37,722 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 04:19:37,723 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [385281676] [2022-02-21 04:19:37,723 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 04:19:37,723 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 04:19:37,731 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 04:19:37,787 INFO L290 TraceCheckUtils]: 0: Hoare triple {20228#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(9, 2);call #Ultimate.allocInit(12, 3); {20228#true} is VALID [2022-02-21 04:19:37,788 INFO L290 TraceCheckUtils]: 1: Hoare triple {20228#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet12#1, main_#t~ret13#1, main_#t~nondet14#1, main_#t~nondet15#1, main_#t~ret16#1, main_#t~short17#1, main_~n~0#1, main_~result~0#1, main_~f1~0#1, main_~f2~0#1;main_~n~0#1 := main_#t~nondet12#1;havoc main_#t~nondet12#1; {20228#true} is VALID [2022-02-21 04:19:37,788 INFO L290 TraceCheckUtils]: 2: Hoare triple {20228#true} assume !(main_~n~0#1 < 1 || main_~n~0#1 > 46340);assume { :begin_inline_is_prime } true;is_prime_#in~n#1 := main_~n~0#1;havoc is_prime_#res#1;havoc is_prime_#t~ret9#1, is_prime_~n#1;is_prime_~n#1 := is_prime_#in~n#1; {20228#true} is VALID [2022-02-21 04:19:37,788 INFO L272 TraceCheckUtils]: 3: Hoare triple {20228#true} call is_prime_#t~ret9#1 := is_prime_(is_prime_~n#1, is_prime_~n#1 - 1); {20230#(<= (+ |is_prime__#in~m| 1) |is_prime__#in~n|)} is VALID [2022-02-21 04:19:37,789 INFO L290 TraceCheckUtils]: 4: Hoare triple {20230#(<= (+ |is_prime__#in~m| 1) |is_prime__#in~n|)} ~n := #in~n;~m := #in~m; {20231#(<= (+ is_prime__~m 1) is_prime__~n)} is VALID [2022-02-21 04:19:37,789 INFO L290 TraceCheckUtils]: 5: Hoare triple {20231#(<= (+ is_prime__~m 1) is_prime__~n)} assume !(~n <= 1); {20231#(<= (+ is_prime__~m 1) is_prime__~n)} is VALID [2022-02-21 04:19:37,789 INFO L290 TraceCheckUtils]: 6: Hoare triple {20231#(<= (+ is_prime__~m 1) is_prime__~n)} assume !(2 == ~n); {20231#(<= (+ is_prime__~m 1) is_prime__~n)} is VALID [2022-02-21 04:19:37,795 INFO L290 TraceCheckUtils]: 7: Hoare triple {20231#(<= (+ is_prime__~m 1) is_prime__~n)} assume ~n > 2; {20231#(<= (+ is_prime__~m 1) is_prime__~n)} is VALID [2022-02-21 04:19:37,804 INFO L290 TraceCheckUtils]: 8: Hoare triple {20231#(<= (+ is_prime__~m 1) is_prime__~n)} assume !(~m <= 1); {20231#(<= (+ is_prime__~m 1) is_prime__~n)} is VALID [2022-02-21 04:19:37,809 INFO L272 TraceCheckUtils]: 9: Hoare triple {20231#(<= (+ is_prime__~m 1) is_prime__~n)} call #t~ret10 := multiple_of(~n, ~m); {20232#(<= (+ |multiple_of_#in~m| 1) |multiple_of_#in~n|)} is VALID [2022-02-21 04:19:37,810 INFO L290 TraceCheckUtils]: 10: Hoare triple {20232#(<= (+ |multiple_of_#in~m| 1) |multiple_of_#in~n|)} ~n := #in~n;~m := #in~m; {20233#(<= (+ multiple_of_~m 1) multiple_of_~n)} is VALID [2022-02-21 04:19:37,811 INFO L290 TraceCheckUtils]: 11: Hoare triple {20233#(<= (+ multiple_of_~m 1) multiple_of_~n)} assume !(~m < 0); {20233#(<= (+ multiple_of_~m 1) multiple_of_~n)} is VALID [2022-02-21 04:19:37,812 INFO L290 TraceCheckUtils]: 12: Hoare triple {20233#(<= (+ multiple_of_~m 1) multiple_of_~n)} assume !(~n < 0); {20233#(<= (+ multiple_of_~m 1) multiple_of_~n)} is VALID [2022-02-21 04:19:37,812 INFO L290 TraceCheckUtils]: 13: Hoare triple {20233#(<= (+ multiple_of_~m 1) multiple_of_~n)} assume !(0 == ~m); {20233#(<= (+ multiple_of_~m 1) multiple_of_~n)} is VALID [2022-02-21 04:19:37,812 INFO L290 TraceCheckUtils]: 14: Hoare triple {20233#(<= (+ multiple_of_~m 1) multiple_of_~n)} assume !(0 == ~n); {20233#(<= (+ multiple_of_~m 1) multiple_of_~n)} is VALID [2022-02-21 04:19:37,813 INFO L272 TraceCheckUtils]: 15: Hoare triple {20233#(<= (+ multiple_of_~m 1) multiple_of_~n)} call #t~ret8 := multiple_of(~n - ~m, ~m); {20234#(<= 1 |multiple_of_#in~n|)} is VALID [2022-02-21 04:19:37,814 INFO L290 TraceCheckUtils]: 16: Hoare triple {20234#(<= 1 |multiple_of_#in~n|)} ~n := #in~n;~m := #in~m; {20235#(<= 1 multiple_of_~n)} is VALID [2022-02-21 04:19:37,814 INFO L290 TraceCheckUtils]: 17: Hoare triple {20235#(<= 1 multiple_of_~n)} assume !(~m < 0); {20235#(<= 1 multiple_of_~n)} is VALID [2022-02-21 04:19:37,814 INFO L290 TraceCheckUtils]: 18: Hoare triple {20235#(<= 1 multiple_of_~n)} assume ~n < 0; {20229#false} is VALID [2022-02-21 04:19:37,814 INFO L272 TraceCheckUtils]: 19: Hoare triple {20229#false} call #t~ret7 := multiple_of(-~n, ~m); {20229#false} is VALID [2022-02-21 04:19:37,815 INFO L290 TraceCheckUtils]: 20: Hoare triple {20229#false} ~n := #in~n;~m := #in~m; {20229#false} is VALID [2022-02-21 04:19:37,815 INFO L290 TraceCheckUtils]: 21: Hoare triple {20229#false} assume !(~m < 0); {20229#false} is VALID [2022-02-21 04:19:37,815 INFO L290 TraceCheckUtils]: 22: Hoare triple {20229#false} assume !(~n < 0); {20229#false} is VALID [2022-02-21 04:19:37,815 INFO L290 TraceCheckUtils]: 23: Hoare triple {20229#false} assume !(0 == ~m); {20229#false} is VALID [2022-02-21 04:19:37,815 INFO L290 TraceCheckUtils]: 24: Hoare triple {20229#false} assume !(0 == ~n); {20229#false} is VALID [2022-02-21 04:19:37,815 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 8 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-21 04:19:37,815 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-21 04:19:37,815 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [385281676] [2022-02-21 04:19:37,816 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [385281676] provided 0 perfect and 1 imperfect interpolant sequences [2022-02-21 04:19:37,816 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [356338886] [2022-02-21 04:19:37,816 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 04:19:37,816 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-21 04:19:37,816 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 04:19:37,817 INFO L229 MonitoredProcess]: Starting monitored process 68 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-02-21 04:19:37,818 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (68)] Waiting until timeout for monitored process [2022-02-21 04:19:37,851 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 04:19:37,852 INFO L263 TraceCheckSpWp]: Trace formula consists of 86 conjuncts, 11 conjunts are in the unsatisfiable core [2022-02-21 04:19:37,863 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 04:19:37,865 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-21 04:19:38,022 INFO L290 TraceCheckUtils]: 0: Hoare triple {20228#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(9, 2);call #Ultimate.allocInit(12, 3); {20228#true} is VALID [2022-02-21 04:19:38,022 INFO L290 TraceCheckUtils]: 1: Hoare triple {20228#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet12#1, main_#t~ret13#1, main_#t~nondet14#1, main_#t~nondet15#1, main_#t~ret16#1, main_#t~short17#1, main_~n~0#1, main_~result~0#1, main_~f1~0#1, main_~f2~0#1;main_~n~0#1 := main_#t~nondet12#1;havoc main_#t~nondet12#1; {20228#true} is VALID [2022-02-21 04:19:38,022 INFO L290 TraceCheckUtils]: 2: Hoare triple {20228#true} assume !(main_~n~0#1 < 1 || main_~n~0#1 > 46340);assume { :begin_inline_is_prime } true;is_prime_#in~n#1 := main_~n~0#1;havoc is_prime_#res#1;havoc is_prime_#t~ret9#1, is_prime_~n#1;is_prime_~n#1 := is_prime_#in~n#1; {20228#true} is VALID [2022-02-21 04:19:38,023 INFO L272 TraceCheckUtils]: 3: Hoare triple {20228#true} call is_prime_#t~ret9#1 := is_prime_(is_prime_~n#1, is_prime_~n#1 - 1); {20230#(<= (+ |is_prime__#in~m| 1) |is_prime__#in~n|)} is VALID [2022-02-21 04:19:38,024 INFO L290 TraceCheckUtils]: 4: Hoare triple {20230#(<= (+ |is_prime__#in~m| 1) |is_prime__#in~n|)} ~n := #in~n;~m := #in~m; {20231#(<= (+ is_prime__~m 1) is_prime__~n)} is VALID [2022-02-21 04:19:38,024 INFO L290 TraceCheckUtils]: 5: Hoare triple {20231#(<= (+ is_prime__~m 1) is_prime__~n)} assume !(~n <= 1); {20231#(<= (+ is_prime__~m 1) is_prime__~n)} is VALID [2022-02-21 04:19:38,024 INFO L290 TraceCheckUtils]: 6: Hoare triple {20231#(<= (+ is_prime__~m 1) is_prime__~n)} assume !(2 == ~n); {20231#(<= (+ is_prime__~m 1) is_prime__~n)} is VALID [2022-02-21 04:19:38,024 INFO L290 TraceCheckUtils]: 7: Hoare triple {20231#(<= (+ is_prime__~m 1) is_prime__~n)} assume ~n > 2; {20231#(<= (+ is_prime__~m 1) is_prime__~n)} is VALID [2022-02-21 04:19:38,025 INFO L290 TraceCheckUtils]: 8: Hoare triple {20231#(<= (+ is_prime__~m 1) is_prime__~n)} assume !(~m <= 1); {20231#(<= (+ is_prime__~m 1) is_prime__~n)} is VALID [2022-02-21 04:19:38,025 INFO L272 TraceCheckUtils]: 9: Hoare triple {20231#(<= (+ is_prime__~m 1) is_prime__~n)} call #t~ret10 := multiple_of(~n, ~m); {20232#(<= (+ |multiple_of_#in~m| 1) |multiple_of_#in~n|)} is VALID [2022-02-21 04:19:38,026 INFO L290 TraceCheckUtils]: 10: Hoare triple {20232#(<= (+ |multiple_of_#in~m| 1) |multiple_of_#in~n|)} ~n := #in~n;~m := #in~m; {20233#(<= (+ multiple_of_~m 1) multiple_of_~n)} is VALID [2022-02-21 04:19:38,026 INFO L290 TraceCheckUtils]: 11: Hoare triple {20233#(<= (+ multiple_of_~m 1) multiple_of_~n)} assume !(~m < 0); {20233#(<= (+ multiple_of_~m 1) multiple_of_~n)} is VALID [2022-02-21 04:19:38,026 INFO L290 TraceCheckUtils]: 12: Hoare triple {20233#(<= (+ multiple_of_~m 1) multiple_of_~n)} assume !(~n < 0); {20233#(<= (+ multiple_of_~m 1) multiple_of_~n)} is VALID [2022-02-21 04:19:38,026 INFO L290 TraceCheckUtils]: 13: Hoare triple {20233#(<= (+ multiple_of_~m 1) multiple_of_~n)} assume !(0 == ~m); {20233#(<= (+ multiple_of_~m 1) multiple_of_~n)} is VALID [2022-02-21 04:19:38,027 INFO L290 TraceCheckUtils]: 14: Hoare triple {20233#(<= (+ multiple_of_~m 1) multiple_of_~n)} assume !(0 == ~n); {20233#(<= (+ multiple_of_~m 1) multiple_of_~n)} is VALID [2022-02-21 04:19:38,027 INFO L272 TraceCheckUtils]: 15: Hoare triple {20233#(<= (+ multiple_of_~m 1) multiple_of_~n)} call #t~ret8 := multiple_of(~n - ~m, ~m); {20234#(<= 1 |multiple_of_#in~n|)} is VALID [2022-02-21 04:19:38,027 INFO L290 TraceCheckUtils]: 16: Hoare triple {20234#(<= 1 |multiple_of_#in~n|)} ~n := #in~n;~m := #in~m; {20235#(<= 1 multiple_of_~n)} is VALID [2022-02-21 04:19:38,028 INFO L290 TraceCheckUtils]: 17: Hoare triple {20235#(<= 1 multiple_of_~n)} assume !(~m < 0); {20235#(<= 1 multiple_of_~n)} is VALID [2022-02-21 04:19:38,028 INFO L290 TraceCheckUtils]: 18: Hoare triple {20235#(<= 1 multiple_of_~n)} assume ~n < 0; {20229#false} is VALID [2022-02-21 04:19:38,028 INFO L272 TraceCheckUtils]: 19: Hoare triple {20229#false} call #t~ret7 := multiple_of(-~n, ~m); {20229#false} is VALID [2022-02-21 04:19:38,028 INFO L290 TraceCheckUtils]: 20: Hoare triple {20229#false} ~n := #in~n;~m := #in~m; {20229#false} is VALID [2022-02-21 04:19:38,028 INFO L290 TraceCheckUtils]: 21: Hoare triple {20229#false} assume !(~m < 0); {20229#false} is VALID [2022-02-21 04:19:38,028 INFO L290 TraceCheckUtils]: 22: Hoare triple {20229#false} assume !(~n < 0); {20229#false} is VALID [2022-02-21 04:19:38,028 INFO L290 TraceCheckUtils]: 23: Hoare triple {20229#false} assume !(0 == ~m); {20229#false} is VALID [2022-02-21 04:19:38,028 INFO L290 TraceCheckUtils]: 24: Hoare triple {20229#false} assume !(0 == ~n); {20229#false} is VALID [2022-02-21 04:19:38,029 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 8 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-21 04:19:38,029 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-02-21 04:19:38,227 INFO L290 TraceCheckUtils]: 24: Hoare triple {20229#false} assume !(0 == ~n); {20229#false} is VALID [2022-02-21 04:19:38,227 INFO L290 TraceCheckUtils]: 23: Hoare triple {20229#false} assume !(0 == ~m); {20229#false} is VALID [2022-02-21 04:19:38,227 INFO L290 TraceCheckUtils]: 22: Hoare triple {20229#false} assume !(~n < 0); {20229#false} is VALID [2022-02-21 04:19:38,227 INFO L290 TraceCheckUtils]: 21: Hoare triple {20229#false} assume !(~m < 0); {20229#false} is VALID [2022-02-21 04:19:38,227 INFO L290 TraceCheckUtils]: 20: Hoare triple {20229#false} ~n := #in~n;~m := #in~m; {20229#false} is VALID [2022-02-21 04:19:38,227 INFO L272 TraceCheckUtils]: 19: Hoare triple {20229#false} call #t~ret7 := multiple_of(-~n, ~m); {20229#false} is VALID [2022-02-21 04:19:38,228 INFO L290 TraceCheckUtils]: 18: Hoare triple {20329#(not (< multiple_of_~n 0))} assume ~n < 0; {20229#false} is VALID [2022-02-21 04:19:38,228 INFO L290 TraceCheckUtils]: 17: Hoare triple {20329#(not (< multiple_of_~n 0))} assume !(~m < 0); {20329#(not (< multiple_of_~n 0))} is VALID [2022-02-21 04:19:38,228 INFO L290 TraceCheckUtils]: 16: Hoare triple {20336#(<= 0 |multiple_of_#in~n|)} ~n := #in~n;~m := #in~m; {20329#(not (< multiple_of_~n 0))} is VALID [2022-02-21 04:19:38,229 INFO L272 TraceCheckUtils]: 15: Hoare triple {20340#(<= multiple_of_~m multiple_of_~n)} call #t~ret8 := multiple_of(~n - ~m, ~m); {20336#(<= 0 |multiple_of_#in~n|)} is VALID [2022-02-21 04:19:38,229 INFO L290 TraceCheckUtils]: 14: Hoare triple {20340#(<= multiple_of_~m multiple_of_~n)} assume !(0 == ~n); {20340#(<= multiple_of_~m multiple_of_~n)} is VALID [2022-02-21 04:19:38,229 INFO L290 TraceCheckUtils]: 13: Hoare triple {20340#(<= multiple_of_~m multiple_of_~n)} assume !(0 == ~m); {20340#(<= multiple_of_~m multiple_of_~n)} is VALID [2022-02-21 04:19:38,230 INFO L290 TraceCheckUtils]: 12: Hoare triple {20340#(<= multiple_of_~m multiple_of_~n)} assume !(~n < 0); {20340#(<= multiple_of_~m multiple_of_~n)} is VALID [2022-02-21 04:19:38,230 INFO L290 TraceCheckUtils]: 11: Hoare triple {20340#(<= multiple_of_~m multiple_of_~n)} assume !(~m < 0); {20340#(<= multiple_of_~m multiple_of_~n)} is VALID [2022-02-21 04:19:38,230 INFO L290 TraceCheckUtils]: 10: Hoare triple {20356#(<= |multiple_of_#in~m| |multiple_of_#in~n|)} ~n := #in~n;~m := #in~m; {20340#(<= multiple_of_~m multiple_of_~n)} is VALID [2022-02-21 04:19:38,231 INFO L272 TraceCheckUtils]: 9: Hoare triple {20360#(<= is_prime__~m is_prime__~n)} call #t~ret10 := multiple_of(~n, ~m); {20356#(<= |multiple_of_#in~m| |multiple_of_#in~n|)} is VALID [2022-02-21 04:19:38,231 INFO L290 TraceCheckUtils]: 8: Hoare triple {20360#(<= is_prime__~m is_prime__~n)} assume !(~m <= 1); {20360#(<= is_prime__~m is_prime__~n)} is VALID [2022-02-21 04:19:38,231 INFO L290 TraceCheckUtils]: 7: Hoare triple {20360#(<= is_prime__~m is_prime__~n)} assume ~n > 2; {20360#(<= is_prime__~m is_prime__~n)} is VALID [2022-02-21 04:19:38,232 INFO L290 TraceCheckUtils]: 6: Hoare triple {20360#(<= is_prime__~m is_prime__~n)} assume !(2 == ~n); {20360#(<= is_prime__~m is_prime__~n)} is VALID [2022-02-21 04:19:38,232 INFO L290 TraceCheckUtils]: 5: Hoare triple {20360#(<= is_prime__~m is_prime__~n)} assume !(~n <= 1); {20360#(<= is_prime__~m is_prime__~n)} is VALID [2022-02-21 04:19:38,232 INFO L290 TraceCheckUtils]: 4: Hoare triple {20376#(<= |is_prime__#in~m| |is_prime__#in~n|)} ~n := #in~n;~m := #in~m; {20360#(<= is_prime__~m is_prime__~n)} is VALID [2022-02-21 04:19:38,233 INFO L272 TraceCheckUtils]: 3: Hoare triple {20228#true} call is_prime_#t~ret9#1 := is_prime_(is_prime_~n#1, is_prime_~n#1 - 1); {20376#(<= |is_prime__#in~m| |is_prime__#in~n|)} is VALID [2022-02-21 04:19:38,233 INFO L290 TraceCheckUtils]: 2: Hoare triple {20228#true} assume !(main_~n~0#1 < 1 || main_~n~0#1 > 46340);assume { :begin_inline_is_prime } true;is_prime_#in~n#1 := main_~n~0#1;havoc is_prime_#res#1;havoc is_prime_#t~ret9#1, is_prime_~n#1;is_prime_~n#1 := is_prime_#in~n#1; {20228#true} is VALID [2022-02-21 04:19:38,233 INFO L290 TraceCheckUtils]: 1: Hoare triple {20228#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet12#1, main_#t~ret13#1, main_#t~nondet14#1, main_#t~nondet15#1, main_#t~ret16#1, main_#t~short17#1, main_~n~0#1, main_~result~0#1, main_~f1~0#1, main_~f2~0#1;main_~n~0#1 := main_#t~nondet12#1;havoc main_#t~nondet12#1; {20228#true} is VALID [2022-02-21 04:19:38,233 INFO L290 TraceCheckUtils]: 0: Hoare triple {20228#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(9, 2);call #Ultimate.allocInit(12, 3); {20228#true} is VALID [2022-02-21 04:19:38,233 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 8 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-21 04:19:38,233 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [356338886] provided 0 perfect and 2 imperfect interpolant sequences [2022-02-21 04:19:38,233 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-02-21 04:19:38,233 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 14 [2022-02-21 04:19:38,234 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [995398025] [2022-02-21 04:19:38,234 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-02-21 04:19:38,234 INFO L796 eck$LassoCheckResult]: stem already infeasible [2022-02-21 04:19:38,234 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 04:19:38,234 INFO L85 PathProgramCache]: Analyzing trace with hash -2044787022, now seen corresponding path program 1 times [2022-02-21 04:19:38,234 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 04:19:38,234 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [905243666] [2022-02-21 04:19:38,235 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 04:19:38,235 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 04:19:38,250 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 04:19:38,250 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-02-21 04:19:38,251 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 04:19:38,252 INFO L138 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-02-21 04:19:38,553 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-21 04:19:38,554 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-02-21 04:19:38,554 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=151, Unknown=0, NotChecked=0, Total=182 [2022-02-21 04:19:38,554 INFO L87 Difference]: Start difference. First operand 125 states and 154 transitions. cyclomatic complexity: 35 Second operand has 14 states, 14 states have (on average 2.4285714285714284) internal successors, (34), 8 states have internal predecessors, (34), 6 states have call successors, (7), 7 states have call predecessors, (7), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 04:19:38,978 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 04:19:38,978 INFO L93 Difference]: Finished difference Result 153 states and 195 transitions. [2022-02-21 04:19:38,978 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-02-21 04:19:38,978 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 14 states, 14 states have (on average 2.4285714285714284) internal successors, (34), 8 states have internal predecessors, (34), 6 states have call successors, (7), 7 states have call predecessors, (7), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 04:19:39,013 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 41 edges. 41 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-21 04:19:39,014 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 153 states and 195 transitions. [2022-02-21 04:19:39,016 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 36 [2022-02-21 04:19:39,019 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 153 states to 151 states and 193 transitions. [2022-02-21 04:19:39,019 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 136 [2022-02-21 04:19:39,019 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 136 [2022-02-21 04:19:39,019 INFO L73 IsDeterministic]: Start isDeterministic. Operand 151 states and 193 transitions. [2022-02-21 04:19:39,020 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2022-02-21 04:19:39,020 INFO L681 BuchiCegarLoop]: Abstraction has 151 states and 193 transitions. [2022-02-21 04:19:39,020 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 151 states and 193 transitions. [2022-02-21 04:19:39,022 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 151 to 147. [2022-02-21 04:19:39,022 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-21 04:19:39,022 INFO L82 GeneralOperation]: Start isEquivalent. First operand 151 states and 193 transitions. Second operand has 147 states, 112 states have (on average 1.1071428571428572) internal successors, (124), 118 states have internal predecessors, (124), 20 states have call successors, (20), 15 states have call predecessors, (20), 15 states have return successors, (36), 13 states have call predecessors, (36), 17 states have call successors, (36) [2022-02-21 04:19:39,022 INFO L74 IsIncluded]: Start isIncluded. First operand 151 states and 193 transitions. Second operand has 147 states, 112 states have (on average 1.1071428571428572) internal successors, (124), 118 states have internal predecessors, (124), 20 states have call successors, (20), 15 states have call predecessors, (20), 15 states have return successors, (36), 13 states have call predecessors, (36), 17 states have call successors, (36) [2022-02-21 04:19:39,023 INFO L87 Difference]: Start difference. First operand 151 states and 193 transitions. Second operand has 147 states, 112 states have (on average 1.1071428571428572) internal successors, (124), 118 states have internal predecessors, (124), 20 states have call successors, (20), 15 states have call predecessors, (20), 15 states have return successors, (36), 13 states have call predecessors, (36), 17 states have call successors, (36) [2022-02-21 04:19:39,023 INFO L149 Difference]: Subtrahend was not deterministic. Recomputing result with determinization. [2022-02-21 04:19:39,029 INFO L93 Difference]: Finished difference Result 287 states and 353 transitions. [2022-02-21 04:19:39,029 INFO L276 IsEmpty]: Start isEmpty. Operand 287 states and 353 transitions. [2022-02-21 04:19:39,030 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 04:19:39,030 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 04:19:39,030 INFO L74 IsIncluded]: Start isIncluded. First operand has 147 states, 112 states have (on average 1.1071428571428572) internal successors, (124), 118 states have internal predecessors, (124), 20 states have call successors, (20), 15 states have call predecessors, (20), 15 states have return successors, (36), 13 states have call predecessors, (36), 17 states have call successors, (36) Second operand 151 states and 193 transitions. [2022-02-21 04:19:39,030 INFO L87 Difference]: Start difference. First operand has 147 states, 112 states have (on average 1.1071428571428572) internal successors, (124), 118 states have internal predecessors, (124), 20 states have call successors, (20), 15 states have call predecessors, (20), 15 states have return successors, (36), 13 states have call predecessors, (36), 17 states have call successors, (36) Second operand 151 states and 193 transitions. [2022-02-21 04:19:39,031 INFO L149 Difference]: Subtrahend was not deterministic. Recomputing result with determinization. [2022-02-21 04:19:39,037 INFO L93 Difference]: Finished difference Result 287 states and 353 transitions. [2022-02-21 04:19:39,037 INFO L276 IsEmpty]: Start isEmpty. Operand 287 states and 353 transitions. [2022-02-21 04:19:39,037 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 04:19:39,038 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 04:19:39,038 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-21 04:19:39,038 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-21 04:19:39,038 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 147 states, 112 states have (on average 1.1071428571428572) internal successors, (124), 118 states have internal predecessors, (124), 20 states have call successors, (20), 15 states have call predecessors, (20), 15 states have return successors, (36), 13 states have call predecessors, (36), 17 states have call successors, (36) [2022-02-21 04:19:39,040 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 147 states to 147 states and 180 transitions. [2022-02-21 04:19:39,040 INFO L704 BuchiCegarLoop]: Abstraction has 147 states and 180 transitions. [2022-02-21 04:19:39,040 INFO L587 BuchiCegarLoop]: Abstraction has 147 states and 180 transitions. [2022-02-21 04:19:39,040 INFO L425 BuchiCegarLoop]: ======== Iteration 11============ [2022-02-21 04:19:39,040 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 147 states and 180 transitions. [2022-02-21 04:19:39,041 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 36 [2022-02-21 04:19:39,041 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 04:19:39,041 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 04:19:39,041 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [4, 4, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-21 04:19:39,041 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [2, 2, 1, 1, 1, 1, 1, 1] [2022-02-21 04:19:39,042 INFO L791 eck$LassoCheckResult]: Stem: 20555#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(9, 2);call #Ultimate.allocInit(12, 3); 20556#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet12#1, main_#t~ret13#1, main_#t~nondet14#1, main_#t~nondet15#1, main_#t~ret16#1, main_#t~short17#1, main_~n~0#1, main_~result~0#1, main_~f1~0#1, main_~f2~0#1;main_~n~0#1 := main_#t~nondet12#1;havoc main_#t~nondet12#1; 20566#L78 assume !(main_~n~0#1 < 1 || main_~n~0#1 > 46340);assume { :begin_inline_is_prime } true;is_prime_#in~n#1 := main_~n~0#1;havoc is_prime_#res#1;havoc is_prime_#t~ret9#1, is_prime_~n#1;is_prime_~n#1 := is_prime_#in~n#1; 20559#L53 call is_prime_#t~ret9#1 := is_prime_(is_prime_~n#1, is_prime_~n#1 - 1);< 20597#is_prime_ENTRY ~n := #in~n;~m := #in~m; 20618#L58 assume !(~n <= 1); 20617#L61 assume !(2 == ~n); 20616#L64 assume ~n > 2; 20615#L65 assume !(~m <= 1); 20609#L68 call #t~ret10 := multiple_of(~n, ~m);< 20614#multiple_ofENTRY ~n := #in~n;~m := #in~m; 20613#L32 assume !(~m < 0); 20612#L35 assume !(~n < 0); 20611#L38 assume !(0 == ~m); 20610#L41 assume !(0 == ~n); 20564#L44 call #t~ret8 := multiple_of(~n - ~m, ~m);< 20607#multiple_ofENTRY ~n := #in~n;~m := #in~m; 20608#L32 assume !(~m < 0); 20646#L35 assume !(~n < 0); 20563#L38 assume !(0 == ~m); 20565#L41 assume !(0 == ~n); 20574#L44 call #t~ret8 := multiple_of(~n - ~m, ~m);< 20584#multiple_ofENTRY ~n := #in~n;~m := #in~m; 20585#L32 assume !(~m < 0); 20647#L35 assume ~n < 0; 20550#L36 call #t~ret7 := multiple_of(-~n, ~m);< 20602#multiple_ofENTRY ~n := #in~n;~m := #in~m; 20571#L32 assume !(~m < 0); 20572#L35 assume !(~n < 0); 20561#L38 assume !(0 == ~m); 20562#L41 assume !(0 == ~n); 20589#L44 [2022-02-21 04:19:39,042 INFO L793 eck$LassoCheckResult]: Loop: 20589#L44 call #t~ret8 := multiple_of(~n - ~m, ~m);< 20591#multiple_ofENTRY ~n := #in~n;~m := #in~m; 20677#L32 assume !(~m < 0); 20674#L35 assume ~n < 0; 20553#L36 call #t~ret7 := multiple_of(-~n, ~m);< 20567#multiple_ofENTRY ~n := #in~n;~m := #in~m; 20670#L32 assume !(~m < 0); 20669#L35 assume !(~n < 0); 20668#L38 assume !(0 == ~m); 20667#L41 assume !(0 == ~n); 20589#L44 [2022-02-21 04:19:39,042 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 04:19:39,042 INFO L85 PathProgramCache]: Analyzing trace with hash -1134874352, now seen corresponding path program 2 times [2022-02-21 04:19:39,042 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 04:19:39,042 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [909824177] [2022-02-21 04:19:39,042 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 04:19:39,043 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 04:19:39,051 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 04:19:39,051 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-02-21 04:19:39,058 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 04:19:39,062 INFO L138 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-02-21 04:19:39,062 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 04:19:39,062 INFO L85 PathProgramCache]: Analyzing trace with hash -2044787022, now seen corresponding path program 2 times [2022-02-21 04:19:39,062 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 04:19:39,062 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [525289249] [2022-02-21 04:19:39,062 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 04:19:39,063 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 04:19:39,067 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 04:19:39,068 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-02-21 04:19:39,069 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 04:19:39,075 INFO L138 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-02-21 04:19:39,076 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 04:19:39,076 INFO L85 PathProgramCache]: Analyzing trace with hash 1280798977, now seen corresponding path program 3 times [2022-02-21 04:19:39,076 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 04:19:39,076 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1969098010] [2022-02-21 04:19:39,076 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 04:19:39,076 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 04:19:39,086 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 04:19:39,087 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-02-21 04:19:39,094 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 04:19:39,103 INFO L138 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-02-21 04:19:40,500 FATAL L489 DefaultTranslator]: Callstack has procedure call flag but succeeding procedure is empty at [CALL] call #t~ret9 := is_prime_(~n, ~n - 1); [2022-02-21 04:19:40,501 FATAL L? ?]: The Plugin de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer has thrown an exception: java.lang.AssertionError: callstack broken after backtranslation by InlinerBacktranslator at de.uni_freiburg.informatik.ultimate.boogie.procedureinliner.backtranslation.InlinerBacktranslator.translateProgramExecution(InlinerBacktranslator.java:230) at de.uni_freiburg.informatik.ultimate.core.coreplugin.services.ModelTranslationContainer.translateProgramExecution(ModelTranslationContainer.java:216) at de.uni_freiburg.informatik.ultimate.core.coreplugin.services.ModelTranslationContainer.translateProgramExecution(ModelTranslationContainer.java:225) at de.uni_freiburg.informatik.ultimate.core.coreplugin.services.ModelTranslationContainer.translateProgramExecution(ModelTranslationContainer.java:225) at de.uni_freiburg.informatik.ultimate.core.coreplugin.services.ModelTranslationContainer.translateProgramExecution(ModelTranslationContainer.java:206) at de.uni_freiburg.informatik.ultimate.core.lib.results.NonterminatingLassoResult.getLongDescription(NonterminatingLassoResult.java:69) at de.uni_freiburg.informatik.ultimate.core.coreplugin.services.ResultService.reportResult(ResultService.java:86) at de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver.reportResult(BuchiAutomizerObserver.java:374) at de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver.interpretAndReportResult(BuchiAutomizerObserver.java:294) at de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver.doTerminationAnalysis(BuchiAutomizerObserver.java:162) at de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver.finish(BuchiAutomizerObserver.java:397) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2022-02-21 04:19:40,507 INFO L158 Benchmark]: Toolchain (without parser) took 20744.35ms. Allocated memory was 109.1MB in the beginning and 159.4MB in the end (delta: 50.3MB). Free memory was 75.0MB in the beginning and 87.0MB in the end (delta: -12.0MB). Peak memory consumption was 84.5MB. Max. memory is 16.1GB. [2022-02-21 04:19:40,507 INFO L158 Benchmark]: CDTParser took 0.18ms. Allocated memory is still 109.1MB. Free memory was 79.3MB in the beginning and 79.3MB in the end (delta: 24.5kB). There was no memory consumed. Max. memory is 16.1GB. [2022-02-21 04:19:40,509 INFO L158 Benchmark]: CACSL2BoogieTranslator took 216.33ms. Allocated memory is still 109.1MB. Free memory was 74.8MB in the beginning and 84.0MB in the end (delta: -9.2MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2022-02-21 04:19:40,509 INFO L158 Benchmark]: Boogie Procedure Inliner took 30.59ms. Allocated memory is still 109.1MB. Free memory was 84.0MB in the beginning and 82.4MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-02-21 04:19:40,510 INFO L158 Benchmark]: Boogie Preprocessor took 18.65ms. Allocated memory is still 109.1MB. Free memory was 82.4MB in the beginning and 80.9MB in the end (delta: 1.5MB). There was no memory consumed. Max. memory is 16.1GB. [2022-02-21 04:19:40,510 INFO L158 Benchmark]: RCFGBuilder took 341.86ms. Allocated memory is still 109.1MB. Free memory was 80.9MB in the beginning and 67.7MB in the end (delta: 13.2MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. [2022-02-21 04:19:40,510 INFO L158 Benchmark]: BuchiAutomizer took 20131.04ms. Allocated memory was 109.1MB in the beginning and 159.4MB in the end (delta: 50.3MB). Free memory was 67.2MB in the beginning and 87.0MB in the end (delta: -19.7MB). Peak memory consumption was 78.7MB. Max. memory is 16.1GB. [2022-02-21 04:19:40,511 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.18ms. Allocated memory is still 109.1MB. Free memory was 79.3MB in the beginning and 79.3MB in the end (delta: 24.5kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 216.33ms. Allocated memory is still 109.1MB. Free memory was 74.8MB in the beginning and 84.0MB in the end (delta: -9.2MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 30.59ms. Allocated memory is still 109.1MB. Free memory was 84.0MB in the beginning and 82.4MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 18.65ms. Allocated memory is still 109.1MB. Free memory was 82.4MB in the beginning and 80.9MB in the end (delta: 1.5MB). There was no memory consumed. Max. memory is 16.1GB. * RCFGBuilder took 341.86ms. Allocated memory is still 109.1MB. Free memory was 80.9MB in the beginning and 67.7MB in the end (delta: 13.2MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. * BuchiAutomizer took 20131.04ms. Allocated memory was 109.1MB in the beginning and 159.4MB in the end (delta: 50.3MB). Free memory was 67.2MB in the beginning and 87.0MB in the end (delta: -19.7MB). Peak memory consumption was 78.7MB. 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 15 terminating modules (8 trivial, 7 deterministic, 0 nondeterministic) and one nonterminating remainder module.One deterministic module has affine ranking function \old(m) and consists of 13 locations. One deterministic module has affine ranking function m and consists of 5 locations. One deterministic module has affine ranking function -1 * \old(m) and consists of 5 locations. One deterministic module has affine ranking function -1 * \old(n) and consists of 4 locations. One deterministic module has affine ranking function \old(n) and consists of 7 locations. One deterministic module has affine ranking function m and consists of 6 locations. One deterministic module has affine ranking function m and consists of 5 locations. 8 modules have a trivial ranking function, the largest among these consists of 14 locations. The remainder module has 147 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 20.0s and 11 iterations. TraceHistogramMax:4. Analysis of lassos took 12.6s. Construction of modules took 1.1s. Büchi inclusion checks took 5.2s. Highest rank in rank-based complementation 3. Minimization of det autom 4. Minimization of nondet autom 11. Automata minimization 0.5s AutomataMinimizationTime, 15 MinimizatonAttempts, 271 StatesRemovedByMinimization, 15 NontrivialMinimizations. Non-live state removal took 0.1s Buchi closure took 0.0s. Biggest automaton had 191 states and ocurred in iteration 8. Nontrivial modules had stage [7, 0, 0, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 1/7 HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 652 SdHoareTripleChecker+Valid, 1.2s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 633 mSDsluCounter, 1974 SdHoareTripleChecker+Invalid, 1.2s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 1305 mSDsCounter, 198 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 950 IncrementalHoareTripleChecker+Invalid, 1148 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 198 mSolverCounterUnsat, 669 mSDtfsCounter, 950 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown LassoAnalysisResults: nont1 unkn0 SFLI2 SFLT2 conc0 concLT1 SILN1 SILU0 SILI0 SILT4 lasso0 LassoPreprocessingBenchmarks: Lassos: inital21 mio100 ax100 hnf100 lsp77 ukn100 mio100 lsp100 div100 bol100 ite100 ukn100 eq172 hnf93 smp85 dnf100 smp100 tf110 neg98 sie110 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 0 Time: 28ms VariablesStem: 0 VariablesLoop: 0 DisjunctsStem: 1 DisjunctsLoop: 1 SupportingInvariants: 0 MotzkinApplications: 2 LassoTerminationAnalysisBenchmarks: LassoNonterminationAnalysisSatFixpoint: 18 LassoNonterminationAnalysisSatUnbounded: 0 LassoNonterminationAnalysisUnsat: 7 LassoNonterminationAnalysisUnknown: 0 LassoNonterminationAnalysisTime: 4.6s - TerminationAnalysisResult: Nontermination possible Buchi Automizer proved that your program is nonterminating for some inputs - FixpointNonTerminationResult [Line: 44]: Nontermination argument in form of an infinite program execution. Nontermination argument in form of an infinite execution State at position 0 is {NULL=1} State at position 1 is {org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@550415b6=0, NULL=0, NULL=0, NULL=1, f2=0, m=0, \old(n)=0, n=0, m=2, n=1, org.eclipse.cdt.internal.core.dom.parser.c.CASTBinaryExpression@3fa2d670=0, \result=0, n=0, f1=0, n=0, \old(n)=1, \old(m)=2, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@759e96=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@7fc7a0a7=0, \result=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@d198642=0, NULL=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@6e1da29e=0, \result=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@3a5070b9=0, \old(m)=0, result=0, \old(n)=0, NULL=0, \result=0, NULL=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@43542c2d=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@19371b04=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@58e80060=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@20bd27c=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@61d6c5=0} - StatisticsResult: NonterminationArgumentStatistics Fixpoint * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer: - ExceptionOrErrorResult: AssertionError: callstack broken after backtranslation by InlinerBacktranslator de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer: AssertionError: callstack broken after backtranslation by InlinerBacktranslator: de.uni_freiburg.informatik.ultimate.boogie.procedureinliner.backtranslation.InlinerBacktranslator.translateProgramExecution(InlinerBacktranslator.java:230) RESULT: Ultimate could not prove your program: Toolchain returned no result. [2022-02-21 04:19:40,536 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (68)] Forceful destruction successful, exit code 0 [2022-02-21 04:19:40,761 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2022-02-21 04:19:40,963 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 Using bit-precise analysis No suitable file found in config dir /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config using search string *Termination*32bit*_Bitvector*.epf No suitable settings file found using Termination*32bit*_Bitvector ERROR: UNSUPPORTED PROPERTY Writing output log to file Ultimate.log Result: ERROR: ExceptionOrErrorResult: AssertionError: callstack broken after backtranslation by InlinerBacktranslator